diff --git a/notes/counterexample-search-2026-03-26.md b/notes/2026-03-26-counterexample-search.md
similarity index 99%
rename from notes/counterexample-search-2026-03-26.md
rename to notes/2026-03-26-counterexample-search.md
index 7c50d1d..af245b0 100644
--- a/notes/counterexample-search-2026-03-26.md
+++ b/notes/2026-03-26-counterexample-search.md
@@ -1,5 +1,5 @@
 ---
-title: Counterexample Search Notes
+title: codex - Counterexample Search Notes
 ---
 
 # Goal
diff --git a/notes/proof-attempt-2026-03-26.md b/notes/2026-03-26-proof-attempt.md
similarity index 99%
rename from notes/proof-attempt-2026-03-26.md
rename to notes/2026-03-26-proof-attempt.md
index 8321954..3d60049 100644
--- a/notes/proof-attempt-2026-03-26.md
+++ b/notes/2026-03-26-proof-attempt.md
@@ -1,5 +1,5 @@
 ---
-title: Proof Attempt and the Strongly Base Orderable Case
+title: codex - Proof Attempt and the Strongly Base Orderable Case
 ---
 
 # Status
diff --git a/notes/main.md b/notes/main.md
index f17e5b3..1295b7d 100644
--- a/notes/main.md
+++ b/notes/main.md
@@ -8,7 +8,7 @@ Let $M=(E,\mathcal B)$  be a rank-$r$ matroid whose ground set decomposes into t
 assume that $E$ is colored by $r$ colors, each color appearing exactly twice. A basis of $M$ is called rainbow if
 it does not contain two elements of the same color.
 
-::: Problem
+::: {.Problem #prob-rainbowbasecover}
 What is the minimum number of rainbow bases needed to cover $E$?
 :::
 
@@ -21,7 +21,7 @@ Currently known bounds:
 
 ::: {.Conjecture #conj-doublecover}
 Let $M_1$ and $M_2$ be two matroid on the same ground set $E$. Assume that $E$ decomposes into two bases in both of them.
-Then $M_1$ and $M_2$ has four common bases that cover each element exactly twice.
+Then $M_1$ and $M_2$ has four common bases (allow repetition) that cover each element exactly twice.
 :::
 
 Let $M_1$ be the partition matroid of colors and let $M_2$ be $M$.
@@ -43,9 +43,35 @@ Let $M_1$ and $M_2$ be two matroids on the same ground set.
 2. If $\beta(M_1)= \beta(M_2)$, then $\beta(M_1\cap M_2)\leq \max \set{\beta(M_1),\beta(M_2)}+1$.
 :::
 
+Cases that have been verified:
+
+- If $\beta(M_1)=\beta(M_2)=2$ then $\beta(M_1\cap M_2)=3$.^[Note that this case does not give an answer to [@prob-rainbowbasecover] since the covering in $\beta(M_1\cap M_2)$ uses common independent sets instead of common bases.]
+- If $\beta(M_1)=2,\beta(M_2)=3$, then $\beta(M_1\cap M_2)\leq 4$
+- ...
+
 ::: {.Theorem title="Davies and McDiarmid"}
 Let $M_1$ and $M_2$ be strongly base orderable matroids on the same ground set.
 Then $\beta(M_1\cap M_2)= \max \set{\beta(M_1),\beta(M_2)}$.
 :::
 
-See [@berczi_partitioning_2024] for refs.
\ No newline at end of file
+See [@berczi_partitioning_2024] for refs. Bérczi and Schwarcz generalized SBO using the following definition.
+
+::: {.Definition title="strongly base reorderable"}
+A matroid is called **strongly base reorderable**(SBRO) if for any pair $A,B$ of bases, there exists bases $A',B'$ and a bijection $\phi:A'\setminus B'\to B'\setminus A'$ such that $A'\cap B'=A\cap B,A'\cup B'=A\cup B$, and $(A'\setminus X)\cup \phi(X)$ is a basis for every $X\subset A'\setminus B'$.
+:::
+
+::: Lemma
+The class of SRBO matroids is complete(closed under taking minors, duals, direct sums, truncations and induction by directed graphs).
+:::
+
+They also showed that SBRO is sufficient for $\beta(M_1\cap M_2)=\max \set{\beta(M_1),\beta(M_2)}$.
+
+::: Theorem
+Let $M_1$ and $M_2$ be strongly base reorderable matroids on the same ground set.
+Then $\beta(M_1\cap M_2)= \max \set{\beta(M_1),\beta(M_2)}$.
+:::
+
+## Circuit cover
+
+Let $M=(E,\mathcal B)$ be a matroid and let $A,B\in \mathcal B$ be two bases of $M$.
+Define a graph $G=(A\Delta B, F)$.
\ No newline at end of file