{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OPHNSRCPBFI64IJFECI433SUQY","short_pith_number":"pith:OPHNSRCP","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"},"canonical_sha256":"73ced9444f0951ee21252091cdee54863648d7aa37dfefb2a4a3dcbae6f3cc83","source":{"kind":"arxiv","id":"1104.4013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4013","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4013v1","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4013","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"OPHNSRCPBFI6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OPHNSRCPBFI64IJF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OPHNSRCP","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OPHNSRCPBFI64IJFECI433SUQY","target":"record","payload":{"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"},"canonical_sha256":"73ced9444f0951ee21252091cdee54863648d7aa37dfefb2a4a3dcbae6f3cc83","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"},"source_kind":"arxiv","source_id":"1104.4013","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-05-18T04:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Eqx3VjjN/3Cw3wMvBOXWc7xkkL3gp4Gf0y/AGAG5vjbs62TfDxpAEbOpV687em4vWQ57veZldpRfaLXkJTWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:51:32.478460Z"},"content_sha256":"f54f38f640d602ce0fecc121e5dfedbd0c7239afbab6131626e739fa29564bb1","schema_version":"1.0","event_id":"sha256:f54f38f640d602ce0fecc121e5dfedbd0c7239afbab6131626e739fa29564bb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OPHNSRCPBFI64IJFECI433SUQY","target":"graph","payload":{"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"},"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-05-18T04:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMozIF1n2UzBfjTwf1tnY3ZcTn93QFQUHuQTgNePqSVfZAe7tXiXSEmcpGQPwT6NtGre1GmiGlwOyoqR25HMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T11:51:32.478801Z"},"content_sha256":"afd288a0389be14615813f9c6942ea4e30dff04716a5573342cba922a923e137","schema_version":"1.0","event_id":"sha256:afd288a0389be14615813f9c6942ea4e30dff04716a5573342cba922a923e137"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/bundle.json","state_url":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPHNSRCPBFI64IJFECI433SUQY/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-06-21T11:51:32Z","links":{"resolver":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY","bundle":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/bundle.json","state":"https://pith.science/pith/OPHNSRCPBFI64IJFECI433SUQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPHNSRCPBFI64IJFECI433SUQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OPHNSRCPBFI64IJFECI433SUQY","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":"0c688570efc146fb0c4d332dc7b4ab076d7bc4c5b662565d642106dccdef1c16","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-20T13:00:42Z","title_canon_sha256":"263046ed8e79a11354e42c67a70ac2ef3c52ffac2371fc954f61edb8cbb3d3e1"},"schema_version":"1.0","source":{"id":"1104.4013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4013","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4013v1","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4013","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"OPHNSRCPBFI6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OPHNSRCPBFI64IJF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OPHNSRCP","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:afd288a0389be14615813f9c6942ea4e30dff04716a5573342cba922a923e137","target":"graph","created_at":"2026-05-18T04:11:31Z","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"},"paper":{"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","authors_text":"Denis S. Krotov, Olli Pottonen, Patric R. J. \\\"Osterg{\\aa}rd","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-20T13:00:42Z","title":"On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4013","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:f54f38f640d602ce0fecc121e5dfedbd0c7239afbab6131626e739fa29564bb1","target":"record","created_at":"2026-05-18T04:11:31Z","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":"0c688570efc146fb0c4d332dc7b4ab076d7bc4c5b662565d642106dccdef1c16","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-20T13:00:42Z","title_canon_sha256":"263046ed8e79a11354e42c67a70ac2ef3c52ffac2371fc954f61edb8cbb3d3e1"},"schema_version":"1.0","source":{"id":"1104.4013","kind":"arxiv","version":1}},"canonical_sha256":"73ced9444f0951ee21252091cdee54863648d7aa37dfefb2a4a3dcbae6f3cc83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73ced9444f0951ee21252091cdee54863648d7aa37dfefb2a4a3dcbae6f3cc83","first_computed_at":"2026-05-18T04:11:31.657275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:31.657275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Bnxu26YHe+1co8B/GlTg1Co2B5/bAtP7NxGSJ+4vVmoWS5yKpqKmLEW5qZ6vvglTQa6UzYl8Cuho9RIKNknCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:31.657910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f54f38f640d602ce0fecc121e5dfedbd0c7239afbab6131626e739fa29564bb1","sha256:afd288a0389be14615813f9c6942ea4e30dff04716a5573342cba922a923e137"],"state_sha256":"4d220430c02c0a17fd046e7bddc0665ddc39c776192dd7a04979cf2c3f9c7080"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BreprNW/EEYSI0QXwJ1js7jYz/6/UEoWIBMpqbgiseCrPxPM0B4EA0aAjnIHkvvDsR9akbVTK8IDZ7lLQojwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T11:51:32.480717Z","bundle_sha256":"5982555a3524b3a9cf3649fc7e3fa1a28320d1ef56799f085ff070978c632bc3"}}