{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WAP7OTPDZXQB5I665BF45PRLDF","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":"5a63dfdf096fbd638ae764d9c297ec74105d536156496f9026e9f001443ac892","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T00:54:55Z","title_canon_sha256":"e7a299686290497de23587a84a66919f7779086114100a10989ac72331a64306"},"schema_version":"1.0","source":{"id":"1706.04709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04709","created_at":"2026-05-18T00:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04709v2","created_at":"2026-05-18T00:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04709","created_at":"2026-05-18T00:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"WAP7OTPDZXQB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAP7OTPDZXQB5I66","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAP7OTPD","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:49f877440a0dae63ce2fbe8c3e9e989ac1bffaf8160476c44549923a007a1a59","target":"graph","created_at":"2026-05-18T00:17:01Z","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":"We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a codeword. We demonstrate that the number of such balls that cover the entire code alphabet cannot exceed this maximum size. Our approach can be applied to codes $i)$ with elements over arbitrary code alphabets, and $ii)$ under a broad class of distance measures, thereby ensuring the generality of our formula. Our formula indicates that the maximum code size","authors_text":"Carol Wang, Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan, Yunghsiang S. Han","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T00:54:55Z","title":"On the Maximum Size of Block Codes Subject to a Distance Criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04709","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:ca8b45175cc5a0b7f1cd13d44274ea2168a87ce40ae8ea755cdb8da9b9fd0d4b","target":"record","created_at":"2026-05-18T00:17:01Z","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":"5a63dfdf096fbd638ae764d9c297ec74105d536156496f9026e9f001443ac892","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T00:54:55Z","title_canon_sha256":"e7a299686290497de23587a84a66919f7779086114100a10989ac72331a64306"},"schema_version":"1.0","source":{"id":"1706.04709","kind":"arxiv","version":2}},"canonical_sha256":"b01ff74de3cde01ea3dee84bcebe2b196b17cda269d81d354d4896193004dbc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b01ff74de3cde01ea3dee84bcebe2b196b17cda269d81d354d4896193004dbc0","first_computed_at":"2026-05-18T00:17:01.832767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:01.832767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ogjQ+3BnroNkd+uLgm7c/jBwT/ihV2cw0yzj1Bf5/mLi8pl5Rj5K0Gq3/y7crmZeu1js9rv2ZqWF2cxSCXP4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:01.833513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca8b45175cc5a0b7f1cd13d44274ea2168a87ce40ae8ea755cdb8da9b9fd0d4b","sha256:49f877440a0dae63ce2fbe8c3e9e989ac1bffaf8160476c44549923a007a1a59"],"state_sha256":"461a2602003bcb9169ed08e053b9a2536527dc512b09d2264416de638fe69625"}