{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:62TNGOSI6ODOJPZQOAPLCNQHUQ","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":"4f1d325338491dfa21799379c1a1a50bbb886128f0a4a5b504d45aef57c0a112","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-08T22:18:52Z","title_canon_sha256":"34aeac08774a4d51d3907f49d9aca62005fb94f8a53b29481b2e0def06a1dcee"},"schema_version":"1.0","source":{"id":"1011.1933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1933","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1933v2","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1933","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"62TNGOSI6ODO","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"62TNGOSI6ODOJPZQ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"62TNGOSI","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:572d07d81f922ae572c02b10d743134f346473cbdf1eb76042159581ae2b839a","target":"graph","created_at":"2026-05-18T04:21:29Z","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":"Given $r\\geq 3$ and $2^{r-1}+1\\leq n< 2^{r}-1$, an $[n,n-r,3]$ shortened Hamming code that can detect a maximal number of double errors is constructed. The optimality of the construction is proven.","authors_text":"Mario Blaum, Sugata Sanyal","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-08T22:18:52Z","title":"Shortened Hamming Codes Maximizing Double Error Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1933","kind":"arxiv","version":2},"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:d5e0c905b38f3f955bd926c66e9aeb6f78d437611cae819f2b07c2fee0e7f9d9","target":"record","created_at":"2026-05-18T04:21:29Z","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":"4f1d325338491dfa21799379c1a1a50bbb886128f0a4a5b504d45aef57c0a112","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-08T22:18:52Z","title_canon_sha256":"34aeac08774a4d51d3907f49d9aca62005fb94f8a53b29481b2e0def06a1dcee"},"schema_version":"1.0","source":{"id":"1011.1933","kind":"arxiv","version":2}},"canonical_sha256":"f6a6d33a48f386e4bf30701eb13607a41156cfdb70981d11e121c3f6ce37b373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6a6d33a48f386e4bf30701eb13607a41156cfdb70981d11e121c3f6ce37b373","first_computed_at":"2026-05-18T04:21:29.894306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:29.894306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3xHffMRZuNoTABMksBh9J6ETpBpZBnO079xCstsGP0mewtObJnb+SL5/5LETCLSkzO3a4+LoTPL7yhUbzlwqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:29.894687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5e0c905b38f3f955bd926c66e9aeb6f78d437611cae819f2b07c2fee0e7f9d9","sha256:572d07d81f922ae572c02b10d743134f346473cbdf1eb76042159581ae2b839a"],"state_sha256":"4c9bcab3be699745e21006c837c6135886c317d7f5c1f98bae70963aa023e68f"}