{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OPHNSRCPBFI64IJFECI433SUQY","short_pith_number":"pith:OPHNSRCP","schema_version":"1.0","canonical_sha256":"73ced9444f0951ee21252091cdee54863648d7aa37dfefb2a4a3dcbae6f3cc83","source":{"kind":"arxiv","id":"1104.4013","version":1},"attestation_state":"computed","paper":{"title":"On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Olli Pottonen, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2011-04-20T13:00:42Z","abstract_excerpt":"Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied, determining among other things parameters of certain subcodes. A utilization of these properties makes a computer-aided classification of the optimal binary one-error-correcting codes of lengths 12 and 13 possible; there are 237610 and 117823 such codes, respectively (with 27375 and 17513 inequivalent extensions). This completes the classification of optimal binar"},"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":"1104.4013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-20T13:00:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"263046ed8e79a11354e42c67a70ac2ef3c52ffac2371fc954f61edb8cbb3d3e1","abstract_canon_sha256":"0c688570efc146fb0c4d332dc7b4ab076d7bc4c5b662565d642106dccdef1c16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:31.657910Z","signature_b64":"8Bnxu26YHe+1co8B/GlTg1Co2B5/bAtP7NxGSJ+4vVmoWS5yKpqKmLEW5qZ6vvglTQa6UzYl8Cuho9RIKNknCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ced9444f0951ee21252091cdee54863648d7aa37dfefb2a4a3dcbae6f3cc83","last_reissued_at":"2026-05-18T04:11:31.657275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:31.657275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Olli Pottonen, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2011-04-20T13:00:42Z","abstract_excerpt":"Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied, determining among other things parameters of certain subcodes. A utilization of these properties makes a computer-aided classification of the optimal binary one-error-correcting codes of lengths 12 and 13 possible; there are 237610 and 117823 such codes, respectively (with 27375 and 17513 inequivalent extensions). This completes the classification of optimal binar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4013","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":""},"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":"1104.4013","created_at":"2026-05-18T04:11:31.657379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4013v1","created_at":"2026-05-18T04:11:31.657379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4013","created_at":"2026-05-18T04:11:31.657379+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPHNSRCPBFI6","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPHNSRCPBFI64IJF","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPHNSRCP","created_at":"2026-05-18T12:26:37.096874+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/OPHNSRCPBFI64IJFECI433SUQY","json":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY.json","graph_json":"https://pith.science/api/pith-number/OPHNSRCPBFI64IJFECI433SUQY/graph.json","events_json":"https://pith.science/api/pith-number/OPHNSRCPBFI64IJFECI433SUQY/events.json","paper":"https://pith.science/paper/OPHNSRCP"},"agent_actions":{"view_html":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY","download_json":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY.json","view_paper":"https://pith.science/paper/OPHNSRCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4013&json=true","fetch_graph":"https://pith.science/api/pith-number/OPHNSRCPBFI64IJFECI433SUQY/graph.json","fetch_events":"https://pith.science/api/pith-number/OPHNSRCPBFI64IJFECI433SUQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/action/storage_attestation","attest_author":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/action/author_attestation","sign_citation":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/action/citation_signature","submit_replication":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/action/replication_record"}},"created_at":"2026-05-18T04:11:31.657379+00:00","updated_at":"2026-05-18T04:11:31.657379+00:00"}