{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EPUWVD3WBZ2PG7ODY22NVFCVXM","short_pith_number":"pith:EPUWVD3W","schema_version":"1.0","canonical_sha256":"23e96a8f760e74f37dc3c6b4da9455bb3c3d0444687554b6f6b186a2f945dcd6","source":{"kind":"arxiv","id":"2607.19550","version":1},"attestation_state":"computed","paper":{"title":"New lower bounds for binary constant-weight codes: $A(23,6,10)\\geq 2979$ and $A(24,6,10)\\geq 4214$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Lysenstoeen","submitted_at":"2026-07-21T20:01:08Z","abstract_excerpt":"Let $A(n,d,w)$ denote the maximum size of a binary constant-weight code of length $n$, minimum distance $d$, and weight $w$. We construct explicit codes proving $A(23,6,10)\\ge 2979$ and $A(24,6,10)\\ge 4214$. These improve the best surviving explicit codes of sizes 2969 and 4174 and surpass the corresponding 1990 bounds 2970 and 4200 of Brouwer, Shearer, Sloane and Smith, whose code listings were lost. We also obtain $A(23,6,11)\\ge 3539$ and $A(24,6,8)\\ge 1855$. All four bounds are now listed in Brouwer's online table. The constructions use a coordinate decomposition in which one half is fixed "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.19550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-21T20:01:08Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"760f193a4e743f590b36ed2498e0d3218c5244c6bd140b80f9a8518f0a287c4c","abstract_canon_sha256":"c6f938f21e5f04665487e9bc063b73fd04a00b9b76bc8762aba9eccb2894c0d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T00:23:56.144056Z","signature_b64":"mYOjpkmATz0oiZfmQoJILnap8pXzKPSLxiGx+BWzbB6/xY6bR8RBqUgTH6IAQCkw2QyWuwrskkT8WFn4gEPHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e96a8f760e74f37dc3c6b4da9455bb3c3d0444687554b6f6b186a2f945dcd6","last_reissued_at":"2026-07-23T00:23:56.143151Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T00:23:56.143151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New lower bounds for binary constant-weight codes: $A(23,6,10)\\geq 2979$ and $A(24,6,10)\\geq 4214$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Lysenstoeen","submitted_at":"2026-07-21T20:01:08Z","abstract_excerpt":"Let $A(n,d,w)$ denote the maximum size of a binary constant-weight code of length $n$, minimum distance $d$, and weight $w$. We construct explicit codes proving $A(23,6,10)\\ge 2979$ and $A(24,6,10)\\ge 4214$. These improve the best surviving explicit codes of sizes 2969 and 4174 and surpass the corresponding 1990 bounds 2970 and 4200 of Brouwer, Shearer, Sloane and Smith, whose code listings were lost. We also obtain $A(23,6,11)\\ge 3539$ and $A(24,6,8)\\ge 1855$. All four bounds are now listed in Brouwer's online table. The constructions use a coordinate decomposition in which one half is fixed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19550","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.19550/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.19550","created_at":"2026-07-23T00:23:56.143615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19550v1","created_at":"2026-07-23T00:23:56.143615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19550","created_at":"2026-07-23T00:23:56.143615+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPUWVD3WBZ2P","created_at":"2026-07-23T00:23:56.143615+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPUWVD3WBZ2PG7OD","created_at":"2026-07-23T00:23:56.143615+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPUWVD3W","created_at":"2026-07-23T00:23:56.143615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM","json":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM.json","graph_json":"https://pith.science/api/pith-number/EPUWVD3WBZ2PG7ODY22NVFCVXM/graph.json","events_json":"https://pith.science/api/pith-number/EPUWVD3WBZ2PG7ODY22NVFCVXM/events.json","paper":"https://pith.science/paper/EPUWVD3W"},"agent_actions":{"view_html":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM","download_json":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM.json","view_paper":"https://pith.science/paper/EPUWVD3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19550&json=true","fetch_graph":"https://pith.science/api/pith-number/EPUWVD3WBZ2PG7ODY22NVFCVXM/graph.json","fetch_events":"https://pith.science/api/pith-number/EPUWVD3WBZ2PG7ODY22NVFCVXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/action/storage_attestation","attest_author":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/action/author_attestation","sign_citation":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/action/citation_signature","submit_replication":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/action/replication_record"}},"created_at":"2026-07-23T00:23:56.143615+00:00","updated_at":"2026-07-23T00:23:56.143615+00:00"}