schema_version stringclasses 1
value | id stringlengths 15 85 | record_kind stringclasses 1
value | slug stringlengths 7 77 | title stringlengths 4 200 | field dict | additional_fields listlengths 0 2 | msc2020 listlengths 0 3 | problem_statement stringlengths 4 6.73k | status stringclasses 6
values | source dict | lean4_statement stringlengths 24 44.8k ⌀ | proof stringclasses 0
values | lean4_proof stringclasses 0
values | proof_status stringclasses 1
value | lean4_proof_status stringclasses 1
value | lean4_target stringclasses 2
values | formalizations listlengths 0 2 | contributions listlengths 0 0 | teaser stringlengths 5 339 | background stringlengths 0 24.4k ⌀ | partial_results stringlengths 55 11.8k ⌀ | why_it_matters stringclasses 26
values | review_state stringclasses 1
value | horizon stringclasses 4
values | difficulty stringclasses 2
values | tags listlengths 1 5 | posed_by stringlengths 1 573 ⌀ | posed_year int64 1.61k 2.03k ⌀ | prize_amount_usd int64 1k 1M ⌀ | prize_sponsor stringclasses 3
values | references listlengths 0 8 | provenance dict | source_status_json stringlengths 984 1.64k ⌀ | quality_flags listlengths 0 5 | linked_problem_ids listlengths 0 0 | dates dict | snapshot_at stringclasses 1
value | metadata_json stringlengths 86 134 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1.0.0 | problem:theoremdb-p5324 | problem | theoremdb-p5324 | Exact value of A(91, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(91,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{91}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5324",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5324",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5324 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5324",
"url": "https://theoremdb.org/statements/P5324",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5324",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:37+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5324,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.257Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"9b7b9a35-dbd8-4a31-af61-b309ebcf1adc","format_issues":null,"number":5145} |
1.0.0 | problem:theoremdb-p5326 | problem | theoremdb-p5326 | Exact value of A(92, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(92,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{92}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5326",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5326",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5326 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5326",
"url": "https://theoremdb.org/statements/P5326",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5326",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:41+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5326,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.265Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"eefca3b5-e3a9-4adf-b680-ec9a6bbbcecf","format_issues":null,"number":5147} |
1.0.0 | problem:theoremdb-p5328 | problem | theoremdb-p5328 | Exact value of A(93, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(93,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{93}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5328",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5328",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5328 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5328",
"url": "https://theoremdb.org/statements/P5328",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5328",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:43+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5328,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.275Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"41556ba3-33ef-4f9e-9c0c-2231cbb2aeb5","format_issues":null,"number":5149} |
1.0.0 | problem:theoremdb-p5330 | problem | theoremdb-p5330 | Exact value of A(94, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(94,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{94}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5330",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5330",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5330 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5330",
"url": "https://theoremdb.org/statements/P5330",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5330",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:43+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5330,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.287Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"e267c211-29ec-4a5f-9d57-f8a52be1957b","format_issues":null,"number":5151} |
1.0.0 | problem:theoremdb-p5332 | problem | theoremdb-p5332 | Exact value of A(95, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(95,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{95}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5332",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5332",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5332 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5332",
"url": "https://theoremdb.org/statements/P5332",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5332",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:47+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5332,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.297Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"10407947-7efb-4dee-974e-fdef5c1914fa","format_issues":null,"number":5153} |
1.0.0 | problem:theoremdb-p5334 | problem | theoremdb-p5334 | Exact value of A(96, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(96,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{96}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5334",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5334",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5334 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5334",
"url": "https://theoremdb.org/statements/P5334",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5334",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:48+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5334,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.306Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"65184911-6b1c-451a-8126-506a2b6ae5b1","format_issues":null,"number":5155} |
1.0.0 | problem:theoremdb-p5336 | problem | theoremdb-p5336 | Exact value of A(97, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(97,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{97}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5336",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5336",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5336 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5336",
"url": "https://theoremdb.org/statements/P5336",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5336",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:52+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5336,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":true,"solutionRecord":null},"lean":... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.314Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"0e2ae0a5-757b-4e58-b365-f18f96a618c1","format_issues":null,"number":5157} |
1.0.0 | problem:theoremdb-p5338 | problem | theoremdb-p5338 | Exact value of A(98, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(98,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{98}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5338",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5338",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5338 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5338",
"url": "https://theoremdb.org/statements/P5338",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5338",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:55+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5338,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.323Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c0047060-33f1-4300-a76b-5370ff3e2e15","format_issues":null,"number":5159} |
1.0.0 | problem:theoremdb-p5340 | problem | theoremdb-p5340 | Exact value of A(99, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(99,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{99}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5340",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5340",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5340 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5340",
"url": "https://theoremdb.org/statements/P5340",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5340",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:21:59+00:00","display_standard":{"editorial_review":"submitter_supplied","formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5340,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean"... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:58.332Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"fbd95272-443d-4815-857c-88c86ba5f3aa","format_issues":null,"number":5161} |
1.0.0 | problem:theoremdb-p5342 | problem | theoremdb-p5342 | Exact value of A(100, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(100,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{100}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5342",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5342",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5342 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5342",
"url": "https://theoremdb.org/statements/P5342",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5342",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:00+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5342,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":true,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","reas... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.446Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"9a830890-b991-4258-85e4-2ccade9cd914","format_issues":null,"number":4964} |
1.0.0 | problem:theoremdb-p5344 | problem | theoremdb-p5344 | Exact value of A(101, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(101,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{101}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5344",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5344",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5344 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5344",
"url": "https://theoremdb.org/statements/P5344",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5344",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:04+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5344,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.454Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"1c2f4690-3edc-4940-8f45-f4c7fece4ce1","format_issues":null,"number":4966} |
1.0.0 | problem:theoremdb-p5346 | problem | theoremdb-p5346 | Exact value of A(102, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(102,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{102}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5346",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5346",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5346 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5346",
"url": "https://theoremdb.org/statements/P5346",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5346",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:05+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5346,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.462Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"79715c3f-761d-49a2-ace4-67ac74b502c9","format_issues":null,"number":4968} |
1.0.0 | problem:theoremdb-p5348 | problem | theoremdb-p5348 | Exact value of A(103, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(103,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{103}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5348",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5348",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5348 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5348",
"url": "https://theoremdb.org/statements/P5348",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5348",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:06+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5348,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.471Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"8c98cfa9-9861-46b9-bb47-9a1e7037744c","format_issues":null,"number":4970} |
1.0.0 | problem:theoremdb-p5350 | problem | theoremdb-p5350 | Exact value of A(104, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(104,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{104}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5350",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5350",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5350 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5350",
"url": "https://theoremdb.org/statements/P5350",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5350",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:12+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5350,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.480Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"98534803-8424-438c-a0dd-e4e388f38fbb","format_issues":null,"number":4972} |
1.0.0 | problem:theoremdb-p5352 | problem | theoremdb-p5352 | Exact value of A(105, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(105,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{105}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5352",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5352",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5352 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5352",
"url": "https://theoremdb.org/statements/P5352",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5352",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:13+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5352,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.489Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a64a891c-097f-4248-baf5-9260bc2d3076","format_issues":null,"number":4974} |
1.0.0 | problem:theoremdb-p5354 | problem | theoremdb-p5354 | Exact value of A(106, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(106,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{106}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5354",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5354",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5354 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5354",
"url": "https://theoremdb.org/statements/P5354",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5354",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:17+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5354,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.497Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"bea3a640-25ea-4653-b8a0-80338db2d4bd","format_issues":null,"number":4976} |
1.0.0 | problem:theoremdb-p5356 | problem | theoremdb-p5356 | Exact value of A(107, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(107,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{107}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5356",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5356",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5356 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5356",
"url": "https://theoremdb.org/statements/P5356",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5356",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:20+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5356,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.509Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"0e25980b-c649-4dd5-bc1f-716aab43a826","format_issues":null,"number":4978} |
1.0.0 | problem:theoremdb-p5358 | problem | theoremdb-p5358 | Exact value of A(108, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(108,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{108}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5358",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5358",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5358 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5358",
"url": "https://theoremdb.org/statements/P5358",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5358",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:22+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5358,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.517Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"665999c4-f2d8-4722-bfc5-41823c69387f","format_issues":null,"number":4980} |
1.0.0 | problem:theoremdb-p5360 | problem | theoremdb-p5360 | Exact value of A(109, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(109,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{109}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5360",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5360",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5360 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5360",
"url": "https://theoremdb.org/statements/P5360",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5360",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:27+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5360,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":true,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","reas... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.526Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"0c2261b1-f081-4517-98dd-49087c4c4b55","format_issues":null,"number":4982} |
1.0.0 | problem:theoremdb-p5362 | problem | theoremdb-p5362 | Exact value of A(110, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(110,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{110}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5362",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5362",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5362 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5362",
"url": "https://theoremdb.org/statements/P5362",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5362",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:30+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5362,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.534Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a830dc04-a17b-4028-a164-a4edbf7a3eb6","format_issues":null,"number":4984} |
1.0.0 | problem:theoremdb-p5364 | problem | theoremdb-p5364 | Exact value of A(111, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(111,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{111}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5364",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5364",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5364 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5364",
"url": "https://theoremdb.org/statements/P5364",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5364",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:34+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5364,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.543Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"0f008e92-41b9-450c-adce-ef9e9cb3057d","format_issues":null,"number":4986} |
1.0.0 | problem:theoremdb-p5366 | problem | theoremdb-p5366 | Exact value of A(112, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(112,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{112}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5366",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5366",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5366 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5366",
"url": "https://theoremdb.org/statements/P5366",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5366",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:35+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5366,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":true,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","reas... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.552Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a286cae3-efc2-4fc1-b551-6bc75206d800","format_issues":null,"number":4988} |
1.0.0 | problem:theoremdb-p5368 | problem | theoremdb-p5368 | Exact value of A(113, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(113,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{113}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5368",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5368",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5368 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5368",
"url": "https://theoremdb.org/statements/P5368",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5368",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:37+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5368,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.560Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"94f5feb6-74c9-44bf-8d64-a0f3d48ebae6","format_issues":null,"number":4990} |
1.0.0 | problem:theoremdb-p5370 | problem | theoremdb-p5370 | Exact value of A(114, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(114,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{114}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5370",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5370",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5370 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5370",
"url": "https://theoremdb.org/statements/P5370",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5370",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:40+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5370,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.569Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"be319a30-10ee-42ee-a669-f2a46e3c9254","format_issues":null,"number":4992} |
1.0.0 | problem:theoremdb-p5372 | problem | theoremdb-p5372 | Exact value of A(115, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(115,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{115}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5372",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5372",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5372 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5372",
"url": "https://theoremdb.org/statements/P5372",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5372",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:41+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5372,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.578Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"1361322f-f4b2-4a8e-87b2-8792f4ea0193","format_issues":null,"number":4994} |
1.0.0 | problem:theoremdb-p5374 | problem | theoremdb-p5374 | Exact value of A(116, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(116,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{116}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5374",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5374",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5374 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5374",
"url": "https://theoremdb.org/statements/P5374",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5374",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:42+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5374,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.586Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"9b7511dc-489c-4e9b-9098-d7ae91fe1024","format_issues":null,"number":4996} |
1.0.0 | problem:theoremdb-p5376 | problem | theoremdb-p5376 | Exact value of A(117, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(117,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{117}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5376",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5376",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5376 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5376",
"url": "https://theoremdb.org/statements/P5376",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5376",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:44+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5376,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.595Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"29dc5017-84fa-498f-b0b9-75ee8ce3d9bc","format_issues":null,"number":4998} |
1.0.0 | problem:theoremdb-p5378 | problem | theoremdb-p5378 | Exact value of A(118, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(118,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{118}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5378",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5378",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5378 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5378",
"url": "https://theoremdb.org/statements/P5378",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5378",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:46+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5378,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.604Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"772b4188-3c9f-47f7-bb48-60a2ce930b4d","format_issues":null,"number":5000} |
1.0.0 | problem:theoremdb-p5380 | problem | theoremdb-p5380 | Exact value of A(119, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(119,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{119}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5380",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5380",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5380 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5380",
"url": "https://theoremdb.org/statements/P5380",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5380",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:48+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.612Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"43495d58-eaee-471f-b381-be3f9b4056de","format_issues":null,"number":5002} |
1.0.0 | problem:theoremdb-p5382 | problem | theoremdb-p5382 | Exact value of A(120, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(120,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{120}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5382",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5382",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5382 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5382",
"url": "https://theoremdb.org/statements/P5382",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5382",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:51+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.621Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"7ba84b8f-8205-4685-b26b-68c025cf6eb6","format_issues":null,"number":5004} |
1.0.0 | problem:theoremdb-p5384 | problem | theoremdb-p5384 | Exact value of A(121, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(121,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{121}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5384",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5384",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5384 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5384",
"url": "https://theoremdb.org/statements/P5384",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5384",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:56+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.633Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"5bfebca1-1b51-4307-bb2e-9ee390951655","format_issues":null,"number":5006} |
1.0.0 | problem:theoremdb-p5386 | problem | theoremdb-p5386 | Exact value of A(122, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(122,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{122}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5386",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5386",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5386 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5386",
"url": "https://theoremdb.org/statements/P5386",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5386",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:57+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.641Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"ff90be79-0b16-4c09-a077-b9b1634eb597","format_issues":null,"number":5008} |
1.0.0 | problem:theoremdb-p5388 | problem | theoremdb-p5388 | Exact value of A(123, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(123,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{123}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5388",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5388",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5388 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5388",
"url": "https://theoremdb.org/statements/P5388",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5388",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:22:59+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.650Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"4a5ba234-dd98-4f92-ab53-c9d68a445988","format_issues":null,"number":5010} |
1.0.0 | problem:theoremdb-p5390 | problem | theoremdb-p5390 | Exact value of A(124, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(124,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{124}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5390",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5390",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5390 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5390",
"url": "https://theoremdb.org/statements/P5390",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5390",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:03+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.659Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"d09fc66d-5539-4615-acaa-af5c61766aef","format_issues":null,"number":5012} |
1.0.0 | problem:theoremdb-p5392 | problem | theoremdb-p5392 | Exact value of A(125, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(125,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{125}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5392",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5392",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5392 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5392",
"url": "https://theoremdb.org/statements/P5392",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5392",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:04+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.668Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"6b7c49fc-7b10-45ae-aeba-e76ffcf1a73b","format_issues":null,"number":5014} |
1.0.0 | problem:theoremdb-p5394 | problem | theoremdb-p5394 | Exact value of A(126, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(126,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{126}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5394",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5394",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5394 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5394",
"url": "https://theoremdb.org/statements/P5394",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5394",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:06+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.676Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"9f878f3f-80d4-4ca2-babb-be270a22dc13","format_issues":null,"number":5016} |
1.0.0 | problem:theoremdb-p5396 | problem | theoremdb-p5396 | Exact value of A(127, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(127,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{127}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5396",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5396",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5396 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5396",
"url": "https://theoremdb.org/statements/P5396",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5396",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:09+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.684Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"e7d086af-af5d-4a9e-aef1-9f4129391b5c","format_issues":null,"number":5018} |
1.0.0 | problem:theoremdb-p5398 | problem | theoremdb-p5398 | Exact value of A(128, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(128,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{128}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5398",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5398",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5398 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5398",
"url": "https://theoremdb.org/statements/P5398",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5398",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:11+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.694Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a99b37eb-6cf1-4964-ad97-a6ae7818ce1f","format_issues":null,"number":5020} |
1.0.0 | problem:theoremdb-p5400 | problem | theoremdb-p5400 | Exact value of A(129, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(129,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{129}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5400",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5400",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5400 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5400",
"url": "https://theoremdb.org/statements/P5400",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5400",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:18+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.703Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"9f1af0e0-08c4-49b9-916e-c4f21c052ac2","format_issues":null,"number":5022} |
1.0.0 | problem:theoremdb-p5402 | problem | theoremdb-p5402 | Exact value of A(130, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(130,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{130}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5402",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5402",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5402 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5402",
"url": "https://theoremdb.org/statements/P5402",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5402",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:22+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.712Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"bbe07e34-007f-403f-b955-412dec905615","format_issues":null,"number":5024} |
1.0.0 | problem:theoremdb-p5404 | problem | theoremdb-p5404 | Exact value of A(131, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(131,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{131}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5404",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5404",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5404 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5404",
"url": "https://theoremdb.org/statements/P5404",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5404",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:28+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.720Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"b636adee-f0bb-4118-868b-3fe1625e3669","format_issues":null,"number":5026} |
1.0.0 | problem:theoremdb-p5406 | problem | theoremdb-p5406 | Exact value of A(132, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(132,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{132}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5406",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5406",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5406 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5406",
"url": "https://theoremdb.org/statements/P5406",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5406",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:33+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.729Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"22ca0ca8-04e0-42b2-b3ec-4d0feca94ee2","format_issues":null,"number":5028} |
1.0.0 | problem:theoremdb-p5408 | problem | theoremdb-p5408 | Exact value of A(133, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(133,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{133}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5408",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5408",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5408 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5408",
"url": "https://theoremdb.org/statements/P5408",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5408",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:38+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.737Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c5c7f36f-beac-47e0-b325-38b01e020fb1","format_issues":null,"number":5030} |
1.0.0 | problem:theoremdb-p5410 | problem | theoremdb-p5410 | Exact value of A(134, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(134,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{134}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5410",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5410",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5410 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5410",
"url": "https://theoremdb.org/statements/P5410",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5410",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:43+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.746Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"658bbfa3-e1ed-4ef2-b017-4f96cc305725","format_issues":null,"number":5032} |
1.0.0 | problem:theoremdb-p5412 | problem | theoremdb-p5412 | Exact value of A(135, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(135,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{135}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5412",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5412",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5412 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5412",
"url": "https://theoremdb.org/statements/P5412",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5412",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:50+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.757Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"f769a413-8700-481e-834a-28c8f59c40e7","format_issues":null,"number":5034} |
1.0.0 | problem:theoremdb-p5414 | problem | theoremdb-p5414 | Exact value of A(136, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(136,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{136}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5414",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5414",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5414 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5414",
"url": "https://theoremdb.org/statements/P5414",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5414",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:55+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.765Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"164077f5-c3f5-4994-9823-f05e78e4c4ee","format_issues":null,"number":5036} |
1.0.0 | problem:theoremdb-p5416 | problem | theoremdb-p5416 | Exact value of A(137, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(137,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{137}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5416",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5416",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5416 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5416",
"url": "https://theoremdb.org/statements/P5416",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5416",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:56+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.770Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c9484224-0239-4d8f-9964-da5378cea329","format_issues":null,"number":5037} |
1.0.0 | problem:theoremdb-p5418 | problem | theoremdb-p5418 | Exact value of A(138, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(138,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{138}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5418",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5418",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5418 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5418",
"url": "https://theoremdb.org/statements/P5418",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5418",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:57+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.774Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"5fd84a51-a1dd-4329-acfe-bb5926d721da","format_issues":null,"number":5038} |
1.0.0 | problem:theoremdb-p5420 | problem | theoremdb-p5420 | Exact value of A(139, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(139,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{139}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5420",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5420",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5420 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5420",
"url": "https://theoremdb.org/statements/P5420",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5420",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:23:59+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.778Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"5adcd2f5-75fd-4a53-a550-0e4cf66c50aa","format_issues":null,"number":5039} |
1.0.0 | problem:theoremdb-p5422 | problem | theoremdb-p5422 | Exact value of A(140, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(140,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{140}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5422",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5422",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5422 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5422",
"url": "https://theoremdb.org/statements/P5422",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5422",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:01+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.783Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a2b2c565-9ddb-42b4-a3e2-544de0f8bfc0","format_issues":null,"number":5040} |
1.0.0 | problem:theoremdb-p5424 | problem | theoremdb-p5424 | Exact value of A(141, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(141,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{141}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5424",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5424",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5424 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5424",
"url": "https://theoremdb.org/statements/P5424",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5424",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:02+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.790Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"abecd534-7f28-4c5a-a490-f5f00163afee","format_issues":null,"number":5041} |
1.0.0 | problem:theoremdb-p5426 | problem | theoremdb-p5426 | Exact value of A(142, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(142,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{142}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5426",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5426",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5426 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5426",
"url": "https://theoremdb.org/statements/P5426",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5426",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:07+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.795Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"e3d55646-3699-44a5-acff-e38de1e6c1ae","format_issues":null,"number":5042} |
1.0.0 | problem:theoremdb-p5428 | problem | theoremdb-p5428 | Exact value of A(143, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(143,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{143}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5428",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5428",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5428 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5428",
"url": "https://theoremdb.org/statements/P5428",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5428",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:17+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.801Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"b628db9d-76e9-412d-9638-1c13f21d5303","format_issues":null,"number":5043} |
1.0.0 | problem:theoremdb-p5430 | problem | theoremdb-p5430 | Exact value of A(144, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(144,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{144}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5430",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5430",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5430 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5430",
"url": "https://theoremdb.org/statements/P5430",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5430",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:31+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.805Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"7f29cca9-14b8-4193-8a74-74cbc761262f","format_issues":null,"number":5044} |
1.0.0 | problem:theoremdb-p5432 | problem | theoremdb-p5432 | Exact value of A(145, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(145,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{145}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5432",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5432",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5432 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5432",
"url": "https://theoremdb.org/statements/P5432",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5432",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:37+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.809Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"b40a1914-1af6-495d-bcd0-f3c89770ca22","format_issues":null,"number":5045} |
1.0.0 | problem:theoremdb-p5434 | problem | theoremdb-p5434 | Exact value of A(146, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(146,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{146}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5434",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5434",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5434 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5434",
"url": "https://theoremdb.org/statements/P5434",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5434",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:38+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.813Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c24a23bb-c7b4-4986-bd61-f7b083f78822","format_issues":null,"number":5046} |
1.0.0 | problem:theoremdb-p5436 | problem | theoremdb-p5436 | Exact value of A(147, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(147,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{147}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5436",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5436",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5436 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5436",
"url": "https://theoremdb.org/statements/P5436",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5436",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:38+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.818Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"d5b07693-5798-4bfb-85bc-1a25f4e4b7b3","format_issues":null,"number":5047} |
1.0.0 | problem:theoremdb-p5438 | problem | theoremdb-p5438 | Exact value of A(148, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(148,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{148}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5438",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5438",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5438 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5438",
"url": "https://theoremdb.org/statements/P5438",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5438",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:41+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.822Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"8ac6ea60-92de-408e-b6e6-813702567032","format_issues":null,"number":5048} |
1.0.0 | problem:theoremdb-p5440 | problem | theoremdb-p5440 | Exact value of A(149, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(149,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{149}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5440",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5440",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5440 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5440",
"url": "https://theoremdb.org/statements/P5440",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5440",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:24:52+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.826Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"10139fbc-526b-4b63-b68c-f2e776a7de15","format_issues":null,"number":5049} |
1.0.0 | problem:theoremdb-p5442 | problem | theoremdb-p5442 | Exact value of A(150, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(150,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{150}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5442",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5442",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5442 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5442",
"url": "https://theoremdb.org/statements/P5442",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5442",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:25:04+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.830Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c632b1ee-182e-4db1-8b09-1c1643feef23","format_issues":null,"number":5050} |
1.0.0 | problem:theoremdb-p5444 | problem | theoremdb-p5444 | Exact value of A(151, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(151,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{151}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5444",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5444",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5444 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5444",
"url": "https://theoremdb.org/statements/P5444",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5444",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:25:24+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.834Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"8ebf433e-16d8-43f4-9660-921bc94eca09","format_issues":null,"number":5051} |
1.0.0 | problem:theoremdb-p5446 | problem | theoremdb-p5446 | Exact value of A(152, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(152,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{152}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5446",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5446",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5446 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5446",
"url": "https://theoremdb.org/statements/P5446",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5446",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:25:41+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.840Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"d385aef5-5e3d-4305-a62c-d4d31b8bdf85","format_issues":null,"number":5052} |
1.0.0 | problem:theoremdb-p5448 | problem | theoremdb-p5448 | Exact value of A(153, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(153,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{153}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5448",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5448",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5448 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5448",
"url": "https://theoremdb.org/statements/P5448",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5448",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:25:45+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.844Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"fac7483c-62df-47df-a995-cfb93dae6aa1","format_issues":null,"number":5053} |
1.0.0 | problem:theoremdb-p5450 | problem | theoremdb-p5450 | Exact value of A(154, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(154,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{154}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5450",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5450",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5450 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5450",
"url": "https://theoremdb.org/statements/P5450",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5450",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:25:59+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.848Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"17da7c5b-0ffd-4973-9ff6-e3ff95c7bdd9","format_issues":null,"number":5054} |
1.0.0 | problem:theoremdb-p5452 | problem | theoremdb-p5452 | Exact value of A(155, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(155,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{155}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5452",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5452",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5452 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5452",
"url": "https://theoremdb.org/statements/P5452",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5452",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:26:17+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.852Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"14e0a1d8-4860-47d1-b1da-9e1f366bcd8d","format_issues":null,"number":5055} |
1.0.0 | problem:theoremdb-p5454 | problem | theoremdb-p5454 | Exact value of A(156, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(156,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{156}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5454",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5454",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5454 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5454",
"url": "https://theoremdb.org/statements/P5454",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5454",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:26:28+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.856Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"2bef606e-3d12-4a82-a44f-a9a27178d5e1","format_issues":null,"number":5056} |
1.0.0 | problem:theoremdb-p5456 | problem | theoremdb-p5456 | Exact value of A(157, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(157,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{157}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5456",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5456",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5456 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5456",
"url": "https://theoremdb.org/statements/P5456",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5456",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:26:38+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.861Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"e97da25c-cbba-447b-8bbe-27fe16cab1ba","format_issues":null,"number":5057} |
1.0.0 | problem:theoremdb-p5458 | problem | theoremdb-p5458 | Exact value of A(158, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(158,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{158}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5458",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5458",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5458 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5458",
"url": "https://theoremdb.org/statements/P5458",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5458",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:26:55+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.865Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"6453f079-da00-45ae-b9a2-b7ec9b665638","format_issues":null,"number":5058} |
1.0.0 | problem:theoremdb-p5460 | problem | theoremdb-p5460 | Exact value of A(159, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(159,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{159}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5460",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5460",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5460 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5460",
"url": "https://theoremdb.org/statements/P5460",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5460",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:27:02+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.870Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a457a14f-dd6a-4f0b-982c-8dad76fe0fcb","format_issues":null,"number":5059} |
1.0.0 | problem:theoremdb-p5462 | problem | theoremdb-p5462 | Exact value of A(160, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(160,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{160}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5462",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5462",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5462 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5462",
"url": "https://theoremdb.org/statements/P5462",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5462",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:27:10+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.877Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"f1275374-77b7-4a7f-b0b6-0d08c7dd44c7","format_issues":null,"number":5060} |
1.0.0 | problem:theoremdb-p5464 | problem | theoremdb-p5464 | Exact value of A(161, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(161,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{161}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5464",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5464",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5464 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5464",
"url": "https://theoremdb.org/statements/P5464",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5464",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:27:22+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.883Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"e974c6fb-06be-4f98-a233-a5a8733000f2","format_issues":null,"number":5061} |
1.0.0 | problem:theoremdb-p5466 | problem | theoremdb-p5466 | Exact value of A(162, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(162,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{162}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5466",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5466",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5466 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5466",
"url": "https://theoremdb.org/statements/P5466",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5466",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:27:33+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.887Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"735a444a-7842-4eec-a085-990166655bf2","format_issues":null,"number":5062} |
1.0.0 | problem:theoremdb-p5468 | problem | theoremdb-p5468 | Exact value of A(163, 6, 4) for binary constant-weight codes | {
"main": "math",
"sub": "control and information",
"slug": "control-and-information",
"name": "Control and information theory",
"original_discipline": "mathematics"
} | [] | [] | Determine $A_2(163,6,4)$, the largest cardinality of a family $C\subseteq\{0,1\}^{163}$ in which every word has Hamming weight $4$ and every two distinct words have Hamming distance at least $6$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5468",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5468",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5468 · coding theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5468",
"url": "https://theoremdb.org/statements/P5468",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5468",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:27:45+00:00","display_standard":{"definitions_format":"typed_textbook_exposition","editorial_review":"submitter_supplied","formal_correspondence":"not_applicable","statement_format":"textbook_mathematics","status":"passed","version":"theoremdb-problem-display-v5"},"lean_verified":false,"pro... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:57.891Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"5c59dc32-2329-4767-8285-45617a1ad0d9","format_issues":null,"number":5063} |
1.0.0 | problem:theoremdb-p5470 | problem | theoremdb-p5470 | Clique number of the Paley graph of order 1609 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1609)$ be the graph on $\mathbb{F}_{1609}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1609$. Determine the clique number $\omega(P(1609))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5470",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5470",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5470 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5470",
"url": "https://theoremdb.org/statements/P5470",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5470",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:27:51+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5470,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.949Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"4ecefcaa-ad4b-4efd-b0c8-8ec67fbb2b79","format_issues":null,"number":3751} |
1.0.0 | problem:theoremdb-p5472 | problem | theoremdb-p5472 | Clique number of the Paley graph of order 1613 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1613)$ be the graph on $\mathbb{F}_{1613}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1613$. Determine the clique number $\omega(P(1613))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5472",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5472",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5472 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5472",
"url": "https://theoremdb.org/statements/P5472",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5472",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:28:03+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5472,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.953Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"f67afc79-8aa8-4143-93df-94c648bc9d2a","format_issues":null,"number":3752} |
1.0.0 | problem:theoremdb-p5474 | problem | theoremdb-p5474 | Clique number of the Paley graph of order 1621 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1621)$ be the graph on $\mathbb{F}_{1621}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1621$. Determine the clique number $\omega(P(1621))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5474",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5474",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5474 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5474",
"url": "https://theoremdb.org/statements/P5474",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5474",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:28:06+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5474,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.958Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"afc6d890-1b11-499f-82a1-8545f39cdf43","format_issues":null,"number":3753} |
1.0.0 | problem:theoremdb-p5476 | problem | theoremdb-p5476 | Clique number of the Paley graph of order 1637 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1637)$ be the graph on $\mathbb{F}_{1637}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1637$. Determine the clique number $\omega(P(1637))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5476",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5476",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5476 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5476",
"url": "https://theoremdb.org/statements/P5476",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5476",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:28:14+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5476,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.962Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"2f0b4cbe-b97e-4883-845c-637f60620c19","format_issues":null,"number":3754} |
1.0.0 | problem:theoremdb-p5478 | problem | theoremdb-p5478 | Clique number of the Paley graph of order 1657 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1657)$ be the graph on $\mathbb{F}_{1657}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1657$. Determine the clique number $\omega(P(1657))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5478",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5478",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5478 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5478",
"url": "https://theoremdb.org/statements/P5478",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5478",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:28:33+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5478,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.966Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"43bc313a-3ee2-406e-a6ae-e190e64321d4","format_issues":null,"number":3755} |
1.0.0 | problem:theoremdb-p5480 | problem | theoremdb-p5480 | Clique number of the Paley graph of order 1669 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1669)$ be the graph on $\mathbb{F}_{1669}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1669$. Determine the clique number $\omega(P(1669))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5480",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5480",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5480 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5480",
"url": "https://theoremdb.org/statements/P5480",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5480",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:28:57+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5480,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.970Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"037f64ca-a097-43c1-af8b-da2896a42a5e","format_issues":null,"number":3756} |
1.0.0 | problem:theoremdb-p5482 | problem | theoremdb-p5482 | Clique number of the Paley graph of order 1693 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1693)$ be the graph on $\mathbb{F}_{1693}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1693$. Determine the clique number $\omega(P(1693))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5482",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5482",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5482 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5482",
"url": "https://theoremdb.org/statements/P5482",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5482",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:29:15+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5482,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.975Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"36ea6eb1-b534-47df-804a-d82ee07a9f66","format_issues":null,"number":3757} |
1.0.0 | problem:theoremdb-p5484 | problem | theoremdb-p5484 | Clique number of the Paley graph of order 1697 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1697)$ be the graph on $\mathbb{F}_{1697}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1697$. Determine the clique number $\omega(P(1697))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5484",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5484",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5484 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5484",
"url": "https://theoremdb.org/statements/P5484",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5484",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:29:32+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5484,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.979Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"8f46ac82-a9e9-418a-a8e1-214e66062914","format_issues":null,"number":3758} |
1.0.0 | problem:theoremdb-p5486 | problem | theoremdb-p5486 | Clique number of the Paley graph of order 1709 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1709)$ be the graph on $\mathbb{F}_{1709}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1709$. Determine the clique number $\omega(P(1709))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5486",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5486",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5486 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5486",
"url": "https://theoremdb.org/statements/P5486",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5486",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:29:40+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5486,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.984Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c9d81d23-b8a4-4385-a35b-c0c8855161e8","format_issues":null,"number":3759} |
1.0.0 | problem:theoremdb-p5488 | problem | theoremdb-p5488 | Clique number of the Paley graph of order 1721 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1721)$ be the graph on $\mathbb{F}_{1721}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1721$. Determine the clique number $\omega(P(1721))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5488",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5488",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5488 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. Not Lean-verified | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5488",
"url": "https://theoremdb.org/statements/P5488",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5488",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:29:50+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5488,"public_status":{"evidence":{"hasFormalization":true,"hasInformalProof":false,"hasRecordedWork":true,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"Not Lean... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.988Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c6c05c65-9af1-4c58-b9b7-71bf58831ce4","format_issues":null,"number":3760} |
1.0.0 | problem:theoremdb-p5490 | problem | theoremdb-p5490 | Clique number of the Paley graph of order 1733 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1733)$ be the graph on $\mathbb{F}_{1733}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1733$. Determine the clique number $\omega(P(1733))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5490",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5490",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5490 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5490",
"url": "https://theoremdb.org/statements/P5490",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5490",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:29:53+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5490,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.992Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"6eba3a02-1fe1-42eb-aa0c-0bb757ab78dd","format_issues":null,"number":3761} |
1.0.0 | problem:theoremdb-p5492 | problem | theoremdb-p5492 | Clique number of the Paley graph of order 1741 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1741)$ be the graph on $\mathbb{F}_{1741}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1741$. Determine the clique number $\omega(P(1741))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5492",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5492",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5492 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5492",
"url": "https://theoremdb.org/statements/P5492",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5492",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:29:56+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5492,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:51.997Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"b95e0d45-53df-4bf4-a621-c2c417545bd2","format_issues":null,"number":3762} |
1.0.0 | problem:theoremdb-p5494 | problem | theoremdb-p5494 | Clique number of the Paley graph of order 1753 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1753)$ be the graph on $\mathbb{F}_{1753}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1753$. Determine the clique number $\omega(P(1753))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5494",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5494",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5494 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5494",
"url": "https://theoremdb.org/statements/P5494",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5494",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:00+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5494,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.002Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"4ce45b3c-3f0f-46a6-8004-b6fdfc2f4364","format_issues":null,"number":3763} |
1.0.0 | problem:theoremdb-p5496 | problem | theoremdb-p5496 | Clique number of the Paley graph of order 1777 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1777)$ be the graph on $\mathbb{F}_{1777}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1777$. Determine the clique number $\omega(P(1777))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5496",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5496",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5496 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5496",
"url": "https://theoremdb.org/statements/P5496",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5496",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:05+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5496,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.007Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a57f0226-ded9-4169-b999-9cfb2db00818","format_issues":null,"number":3764} |
1.0.0 | problem:theoremdb-p5498 | problem | theoremdb-p5498 | Clique number of the Paley graph of order 1789 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1789)$ be the graph on $\mathbb{F}_{1789}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1789$. Determine the clique number $\omega(P(1789))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5498",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5498",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5498 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5498",
"url": "https://theoremdb.org/statements/P5498",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5498",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:07+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5498,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.011Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"26e513cd-a303-477e-94ed-f417b63fc279","format_issues":null,"number":3765} |
1.0.0 | problem:theoremdb-p5500 | problem | theoremdb-p5500 | Clique number of the Paley graph of order 1801 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1801)$ be the graph on $\mathbb{F}_{1801}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1801$. Determine the clique number $\omega(P(1801))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5500",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5500",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5500 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5500",
"url": "https://theoremdb.org/statements/P5500",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5500",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:12+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5500,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.015Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"954a41a4-3435-41fb-97a4-d648e0e92bce","format_issues":null,"number":3766} |
1.0.0 | problem:theoremdb-p5502 | problem | theoremdb-p5502 | Clique number of the Paley graph of order 1861 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1861)$ be the graph on $\mathbb{F}_{1861}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1861$. Determine the clique number $\omega(P(1861))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5502",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5502",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5502 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5502",
"url": "https://theoremdb.org/statements/P5502",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5502",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:15+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5502,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.019Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"0a9a591f-52ad-405a-85b3-2a04228062ee","format_issues":null,"number":3767} |
1.0.0 | problem:theoremdb-p5504 | problem | theoremdb-p5504 | Clique number of the Paley graph of order 1873 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1873)$ be the graph on $\mathbb{F}_{1873}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1873$. Determine the clique number $\omega(P(1873))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5504",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5504",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5504 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5504",
"url": "https://theoremdb.org/statements/P5504",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5504",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:17+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5504,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.023Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"4ebb0b06-4a94-4cc7-b94e-cf506fa5037c","format_issues":null,"number":3768} |
1.0.0 | problem:theoremdb-p5506 | problem | theoremdb-p5506 | Clique number of the Paley graph of order 1877 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1877)$ be the graph on $\mathbb{F}_{1877}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1877$. Determine the clique number $\omega(P(1877))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5506",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5506",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5506 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5506",
"url": "https://theoremdb.org/statements/P5506",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5506",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:19+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5506,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.027Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"16af8f45-f4a8-4147-a0fa-e9ac627f94f1","format_issues":null,"number":3769} |
1.0.0 | problem:theoremdb-p5508 | problem | theoremdb-p5508 | Clique number of the Paley graph of order 1889 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1889)$ be the graph on $\mathbb{F}_{1889}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1889$. Determine the clique number $\omega(P(1889))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5508",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5508",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5508 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5508",
"url": "https://theoremdb.org/statements/P5508",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5508",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:21+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5508,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.032Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"0c7c8b1c-b3eb-4abc-9f8c-234ae354c50d","format_issues":null,"number":3770} |
1.0.0 | problem:theoremdb-p5510 | problem | theoremdb-p5510 | Clique number of the Paley graph of order 1901 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1901)$ be the graph on $\mathbb{F}_{1901}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1901$. Determine the clique number $\omega(P(1901))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5510",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5510",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5510 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5510",
"url": "https://theoremdb.org/statements/P5510",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5510",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:26+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5510,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.036Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"6071543b-97d7-498e-8880-e04b7c65d24c","format_issues":null,"number":3771} |
1.0.0 | problem:theoremdb-p5512 | problem | theoremdb-p5512 | Clique number of the Paley graph of order 1913 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1913)$ be the graph on $\mathbb{F}_{1913}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1913$. Determine the clique number $\omega(P(1913))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5512",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5512",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5512 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5512",
"url": "https://theoremdb.org/statements/P5512",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5512",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:27+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5512,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.040Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"1e460dc3-78d7-4c84-8c6b-be09428effef","format_issues":null,"number":3772} |
1.0.0 | problem:theoremdb-p5514 | problem | theoremdb-p5514 | Clique number of the Paley graph of order 1933 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1933)$ be the graph on $\mathbb{F}_{1933}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1933$. Determine the clique number $\omega(P(1933))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5514",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5514",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5514 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5514",
"url": "https://theoremdb.org/statements/P5514",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5514",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:28+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5514,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.045Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"c4ef4f62-afd7-4fae-8cd5-a019a01a77e6","format_issues":null,"number":3773} |
1.0.0 | problem:theoremdb-p5516 | problem | theoremdb-p5516 | Clique number of the Paley graph of order 1949 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1949)$ be the graph on $\mathbb{F}_{1949}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1949$. Determine the clique number $\omega(P(1949))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5516",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5516",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5516 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5516",
"url": "https://theoremdb.org/statements/P5516",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5516",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:28+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5516,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.049Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"cc4a2b6f-3602-4fe1-890d-9a8e303b464b","format_issues":null,"number":3774} |
1.0.0 | problem:theoremdb-p5518 | problem | theoremdb-p5518 | Clique number of the Paley graph of order 1973 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1973)$ be the graph on $\mathbb{F}_{1973}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1973$. Determine the clique number $\omega(P(1973))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5518",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5518",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5518 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5518",
"url": "https://theoremdb.org/statements/P5518",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5518",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:33+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5518,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.053Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"a5442379-4ee9-4c2f-88a4-bafed8676c9a","format_issues":null,"number":3775} |
1.0.0 | problem:theoremdb-p5520 | problem | theoremdb-p5520 | Clique number of the Paley graph of order 1993 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1993)$ be the graph on $\mathbb{F}_{1993}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1993$. Determine the clique number $\omega(P(1993))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5520",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5520",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5520 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5520",
"url": "https://theoremdb.org/statements/P5520",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5520",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:36+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5520,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.058Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"3f509b84-39c3-478b-9b32-2c049d01bbe3","format_issues":null,"number":3776} |
1.0.0 | problem:theoremdb-p5522 | problem | theoremdb-p5522 | Clique number of the Paley graph of order 1997 | {
"main": "math",
"sub": "graph theory",
"slug": "graph-theory",
"name": "Graph theory",
"original_discipline": "mathematics"
} | [] | [
{
"code": "05C",
"basis": "community-map",
"evidence": "Inferred from community field: graph-theory"
}
] | Let $P(1997)$ be the graph on $\mathbb{F}_{1997}$ in which distinct vertices $x,y$ are adjacent exactly when $x-y$ is a nonzero quadratic residue modulo $1997$. Determine the clique number $\omega(P(1997))$. | open | {
"key": "theoremdb",
"name": "TheoremDB · P5522",
"type": "problem-list",
"url": "https://theoremdb.org/statements/P5522",
"citation": null,
"doi": null,
"arxiv_id": null,
"license": "Selected packets label their content CC0-1.0; original references retain their own terms",
"notes": "Selected problem... | null | null | null | not-recorded | not-recorded | null | [] | [] | TheoremDB P5522 · graph theory | null | Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution. | null | published | incremental | hard | [
"source-curated",
"theoremdb"
] | null | null | null | null | [
{
"kind": "website",
"citation": "TheoremDB P5522",
"url": "https://theoremdb.org/statements/P5522",
"note": null,
"sort_order": 0
}
] | {
"source_record": "P5522",
"imported_at": "2026-09-08",
"status_as_of": "2026-09-08",
"evidence_label": "Source catalogue assessment",
"note": "Full public directory statement. Source lane: curated; source resolution: open. Source verification claims are attributed only; no local Lean verification has been p... | {"created_at":"2026-08-16T08:30:38+00:00","display_standard":{"formal_correspondence":"not_applicable"},"lean_verified":false,"problem_number":5522,"public_status":{"evidence":{"hasFormalization":false,"hasInformalProof":false,"hasRecordedWork":false,"solutionRecord":null},"lean":{"kernelAccepted":false,"label":"","rea... | [
"source-full-text-not-present"
] | [] | {
"created_at": "2026-09-08T03:32:15.935Z",
"updated_at": "2026-09-08T03:32:15.935Z",
"published_at": "2026-09-08T03:32:52.063Z",
"solved_at": null
} | 2026-10-10T16:07:49.246Z | {"database_id":"eed28f89-1aa9-4a07-a488-c4c7f6d02209","format_issues":null,"number":3777} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.