{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EPUWVD3WBZ2PG7ODY22NVFCVXM","short_pith_number":"pith:EPUWVD3W","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"},"canonical_sha256":"23e96a8f760e74f37dc3c6b4da9455bb3c3d0444687554b6f6b186a2f945dcd6","source":{"kind":"arxiv","id":"2607.19550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19550","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19550v1","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19550","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"pith_short_12","alias_value":"EPUWVD3WBZ2P","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"pith_short_16","alias_value":"EPUWVD3WBZ2PG7OD","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"pith_short_8","alias_value":"EPUWVD3W","created_at":"2026-07-23T00:23:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EPUWVD3WBZ2PG7ODY22NVFCVXM","target":"record","payload":{"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"},"canonical_sha256":"23e96a8f760e74f37dc3c6b4da9455bb3c3d0444687554b6f6b186a2f945dcd6","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"},"source_kind":"arxiv","source_id":"2607.19550","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-23T00:23:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKRP+nc4Zr/ZeeKrAx9wzTLJ//fnAt6fDk57G3f/OfuIrAzOirt8/1MpwzpKkTKjSeDvubPqvwZ5XMMdqEMcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:55:08.207309Z"},"content_sha256":"d807fa729d14bb31a09be61dc16d213f94c49dabf89aa6348a355bb7fc65a405","schema_version":"1.0","event_id":"sha256:d807fa729d14bb31a09be61dc16d213f94c49dabf89aa6348a355bb7fc65a405"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EPUWVD3WBZ2PG7ODY22NVFCVXM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-23T00:23:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bXVndNnnHYuzHRfG72y+yUuV1o0dy0HND1/Rs2lReOng6RYQMALJIOJju9PhVnPbajgF3EOzdoyY6sdT8jFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:55:08.207833Z"},"content_sha256":"7359987a0b27fe122265a3701fd432cba9c40f202248edf96625742485232396","schema_version":"1.0","event_id":"sha256:7359987a0b27fe122265a3701fd432cba9c40f202248edf96625742485232396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/bundle.json","state_url":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T18:55:08Z","links":{"resolver":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM","bundle":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/bundle.json","state":"https://pith.science/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPUWVD3WBZ2PG7ODY22NVFCVXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EPUWVD3WBZ2PG7ODY22NVFCVXM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c6f938f21e5f04665487e9bc063b73fd04a00b9b76bc8762aba9eccb2894c0d9","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-21T20:01:08Z","title_canon_sha256":"760f193a4e743f590b36ed2498e0d3218c5244c6bd140b80f9a8518f0a287c4c"},"schema_version":"1.0","source":{"id":"2607.19550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19550","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19550v1","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19550","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"pith_short_12","alias_value":"EPUWVD3WBZ2P","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"pith_short_16","alias_value":"EPUWVD3WBZ2PG7OD","created_at":"2026-07-23T00:23:56Z"},{"alias_kind":"pith_short_8","alias_value":"EPUWVD3W","created_at":"2026-07-23T00:23:56Z"}],"graph_snapshots":[{"event_id":"sha256:7359987a0b27fe122265a3701fd432cba9c40f202248edf96625742485232396","target":"graph","created_at":"2026-07-23T00:23:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.19550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Christian Lysenstoeen","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-21T20:01:08Z","title":"New lower bounds for binary constant-weight codes: $A(23,6,10)\\geq 2979$ and $A(24,6,10)\\geq 4214$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19550","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d807fa729d14bb31a09be61dc16d213f94c49dabf89aa6348a355bb7fc65a405","target":"record","created_at":"2026-07-23T00:23:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c6f938f21e5f04665487e9bc063b73fd04a00b9b76bc8762aba9eccb2894c0d9","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-21T20:01:08Z","title_canon_sha256":"760f193a4e743f590b36ed2498e0d3218c5244c6bd140b80f9a8518f0a287c4c"},"schema_version":"1.0","source":{"id":"2607.19550","kind":"arxiv","version":1}},"canonical_sha256":"23e96a8f760e74f37dc3c6b4da9455bb3c3d0444687554b6f6b186a2f945dcd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23e96a8f760e74f37dc3c6b4da9455bb3c3d0444687554b6f6b186a2f945dcd6","first_computed_at":"2026-07-23T00:23:56.143151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T00:23:56.143151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mYOjpkmATz0oiZfmQoJILnap8pXzKPSLxiGx+BWzbB6/xY6bR8RBqUgTH6IAQCkw2QyWuwrskkT8WFn4gEPHBQ==","signature_status":"signed_v1","signed_at":"2026-07-23T00:23:56.144056Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.19550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d807fa729d14bb31a09be61dc16d213f94c49dabf89aa6348a355bb7fc65a405","sha256:7359987a0b27fe122265a3701fd432cba9c40f202248edf96625742485232396"],"state_sha256":"a22fbbf740f1f9fb085c45ddf4b3364f0ffa252f85f6e91c95b01eded1a25067"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZ7PYwxxVFuzk6VhGKMXxSxbVxlULlxeMMpkWH26yKuYxkBtt/hrzfnDCfvlNxKtugbffW6czwPsRtUjbM4WAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:55:08.212040Z","bundle_sha256":"03e5ad5dbfea0165e46dba110504b67c027ecd6be91b68703bb912e7f102d10f"}}