fix: OEIS submitted filter + README status filter links

README.md

@@ -32,8 +32,8 @@ There are 1217 problems in total, of which
 - [93](https://teorth.github.io/erdosproblems/?status=solved) have been otherwise solved.
   - [23](https://teorth.github.io/erdosproblems/?status=solved+%28Lean%29) of these solutions have been formalized in [Lean](https://lean-lang.org/).
 - [3](https://teorth.github.io/erdosproblems/?status=not+provable) appear to be open, but cannot be proven from the axioms of ZFC. (not provable)
-- 4 appear to be open, but cannot be disproven from the axioms of ZFC. (not disprovable)
-- 3 are known to be independent of the ZFC axioms of mathematics. (independent)
+- [4](https://teorth.github.io/erdosproblems/?status=not+disprovable) appear to be open, but cannot be disproven from the axioms of ZFC. (not disprovable)
+- [3](https://teorth.github.io/erdosproblems/?status=independent) are known to be independent of the ZFC axioms of mathematics. (independent)
 - [9](https://teorth.github.io/erdosproblems/?status=decidable) appear to be open, but have been reduced to a finite computation. (decidable)
 - [27](https://teorth.github.io/erdosproblems/?status=falsifiable) appear to be open, but can be disproven by a finite computation if false. (falsifiable)
 - [7](https://teorth.github.io/erdosproblems/?status=verifiable) appear to be open, but can be proven by a finite computation if true. (verifiable)

docs/index.html

@@ -86,6 +86,7 @@ <h1>Erdős Problems Database</h1>
                         <option value="linked">Already Linked</option>
                         <option value="na">N/A</option>
                         <option value="possible">Possible</option>
+                        <option value="submitted">Submitted</option>
                         <option value="inprogress">In Progress</option>
                     </select>
                 </div>

docs/utils.js

@@ -336,10 +336,10 @@ function extractFormalizedCounts(problems) {
 /**
  * Extract OEIS counts from problems array
  * @param {Array<Object>} problems - Array of problem objects
- * @returns {Object} Object with linked/na/possible/inprogress counts
+ * @returns {Object} Object with linked/na/possible/submitted/inprogress counts
  */
 function extractOEISCounts(problems) {
-    const counts = { linked: 0, na: 0, possible: 0, inprogress: 0 };
+    const counts = { linked: 0, na: 0, possible: 0, submitted: 0, inprogress: 0 };
     problems.forEach(problem => {
         const oeis = problem.oeis || [];
         const oeisPattern = /^A\d{6}$/;
@@ -353,6 +353,9 @@ function extractOEISCounts(problems) {
         if (oeis.includes('possible')) {
             counts.possible++;
         }
+        if (oeis.includes('submitted')) {
+            counts.submitted++;
+        }
         if (oeis.includes('in progress')) {
             counts.inprogress++;
         }

scripts/generate_readme.py

@@ -302,8 +302,8 @@ def build_table(rows):
     lines.append(f"- {filter_link(count_solved(rows)+count_solved_lean(rows), 'status', 'solved')} have been otherwise solved.")
     lines.append(f"  - {filter_link(count_solved_lean(rows), 'status', 'solved (Lean)')} of these solutions have been formalized in [Lean](https://lean-lang.org/).")
     lines.append(f"- {filter_link(count_not_provable(rows), 'status', 'not provable')} appear to be open, but cannot be proven from the axioms of ZFC. (not provable)")
-    lines.append(f"- {count_not_disprovable(rows)} appear to be open, but cannot be disproven from the axioms of ZFC. (not disprovable)")
-    lines.append(f"- {count_independent(rows)} are known to be independent of the ZFC axioms of mathematics. (independent)")
+    lines.append(f"- {filter_link(count_not_disprovable(rows), 'status', 'not disprovable')} appear to be open, but cannot be disproven from the axioms of ZFC. (not disprovable)")
+    lines.append(f"- {filter_link(count_independent(rows), 'status', 'independent')} are known to be independent of the ZFC axioms of mathematics. (independent)")
     lines.append(f"- {filter_link(count_decidable(rows), 'status', 'decidable')} appear to be open, but have been reduced to a finite computation. (decidable)")
     lines.append(f"- {filter_link(count_falsifiable(rows), 'status', 'falsifiable')} appear to be open, but can be disproven by a finite computation if false. (falsifiable)")
     lines.append(f"- {filter_link(count_verifiable(rows), 'status', 'verifiable')} appear to be open, but can be proven by a finite computation if true. (verifiable)")
@@ -315,7 +315,7 @@ def build_table(rows):
     lines.append(f"  - {count_distinct_oeis_from(rows, min_id='A387000')} of these OEIS sequences were added since the creation of this database (A387000 onwards).")
     lines.append(f"- {filter_link(count_possible_oeis(rows), 'oeis', 'possible')} are potentially related to an [OEIS](https://oeis.org/) sequence not already listed.")
     lines.append(f"  - {count_possible_oeis(rows)-count_possible_and_id(rows)} of these problems are not currently linked to any existing [OEIS](https://oeis.org/) sequence.")
-    lines.append(f"- {count_submitted_oeis(rows)} have a related sequence currently being submitted to the [OEIS](https://oeis.org/).")
+    lines.append(f"- {filter_link(count_submitted_oeis(rows), 'oeis', 'submitted')} have a related sequence currently being submitted to the [OEIS](https://oeis.org/).")
     lines.append(f"- {filter_link(count_inprogress_oeis(rows), 'oeis', 'inprogress')} have a related sequence whose generation is currently in progress.")
     lines.append("\n")
     lines.append(header)