Centre align.

app.py

@@ -238,7 +238,7 @@ with blocks:
 
                 md_warmup = gr.Markdown(
                     value=(
-                        "<p><code>Union-of-Paths-and-Cycles</code></p>\n"
+                        '<p style="text-align: center;"><code>Union-of-Paths-and-Cycles</code></p>\n'
                         "Given a tree-like graph $G=(V,E)$ and a weight function $w:V\\to\\mathbb{N}$, compute the sum of all weights of sets $S\\subseteq V$ such that the induced subgraph $G[S]$ is a disjoint union of paths and cycles."
                     ),
                     latex_delimiters=_latex,
@@ -246,7 +246,7 @@ with blocks:
                 )
                 md_tier1 = gr.Markdown(
                     value=(
-                        "<p><code>Maximal-Union-of-Paths-and-Cycles</code></p>\n"
+                        '<p style="text-align: center;"><code>Maximal-Union-of-Paths-and-Cycles</code></p>\n'
                         "Given a tree-like graph $G=(V,E)$ and a weight function $w:V\\to\\mathbb{N}$, compute the sum of all weights of sets $S\\subseteq V$ such that $G[S]$ is a disjoint union of paths and cycles and $S$ is maximal with respect to this property."
                     ),
                     visible=False,
@@ -255,7 +255,7 @@ with blocks:
                 )
                 md_tier2 = gr.Markdown(
                     value=(
-                        "<p><code>Maximal-Union-of-Cycles</code></p>\n"
+                        '<p style="text-align: center;"><code>Maximal-Union-of-Cycles</code></p>\n'
                         "Given a tree-like graph $G=(V,E)$ and a weight function $w:V\\to\\mathbb{N}$, compute the sum of all weights of sets $S\\subseteq V$ such that $G[S]$ is a disjoint union of cycles and $S$ is maximal with respect to this property."
                     ),
                     visible=False,

src/about.py

@@ -50,7 +50,7 @@ WHAT_IS_F1_HTML_BOTTOM_A_BEFORE_TABS = """
 <div class="f1-container">
   <section>
     <p class="mb-4 f1-p">The latter category is incredibly demanding, requiring resolution of many points of uncertainty, and involving an array of reasoning steps, including topological and geometric insight, knowledge of mathematical domains such as extremal graph theory and logic, combinatorial considerations, precise implementation, and more.</p>
-    <p class="f1-p">Despite <a href="https://epoch.ai/frontiermath" target="_blank" rel="noopener noreferrer" class="f1-a">impressive</a> <a href="https://artificialanalysis.ai/evaluations/gpqa-diamond" target="_blank" rel="noopener noreferrer" class="f1-a">performance</a> on existing benchmarks, presently <strong>no model solves even a single Tier 2 problem</strong>.<sup><a href="#evaluation" class="f1-a">1</a></sup></p>
+    <p class="f1-p">Despite <a href="https://epoch.ai/frontiermath" target="_blank" rel="noopener noreferrer" class="f1-a">impressive</a> <a href="https://artificialanalysis.ai/evaluations/gpqa-diamond" target="_blank" rel="noopener noreferrer" class="f1-a">performance</a> on existing benchmarks, presently <strong>no model solves even a single Tier 2 problem</strong>.</p>
   </section>
 
   <section>