{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R4QECUYLGQMMKYD3TXEB45MYF4","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":"e0784fe2f8f22d013e3e4e818e83078fcfe60eb4e8b5f7d1563e3c46dbf6aba8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-25T04:57:43Z","title_canon_sha256":"560664473938e181f80f90579eb57d08c72cc470619667fa36a8113e253c9972"},"schema_version":"1.0","source":{"id":"1401.6496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6496","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6496v1","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6496","created_at":"2026-05-18T03:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"R4QECUYLGQMM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R4QECUYLGQMMKYD3","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R4QECUYL","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:79dabdd2645988b45269d3b024d83e1b4f14b616280a082cc9523c954a764fdd","target":"graph","created_at":"2026-05-18T03:01: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":"Kulkarni and Kiyavash recently introduced a new method to establish upper bounds on the size of deletion-correcting codes. This method is based upon tools from hypergraph theory. The deletion channel is represented by a hypergraph whose edges are the deletion balls (or spheres), so that a deletion-correcting code becomes a matching in this hypergraph. Consequently, a bound on the size of such a code can be obtained from bounds on the matching number of a hypergraph. Classical results in hypergraph theory are then invoked to compute an upper bound on the matching number as a solution to a linea","authors_text":"Alexander Vardy, Arman Fazeli, Eitan Yaakobi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-25T04:57:43Z","title":"Generalized Sphere Packing Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6496","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:d54815064507565aab8385c5d3bc572d027e6803f212b2f151d708be2dccf7c2","target":"record","created_at":"2026-05-18T03:01: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":"e0784fe2f8f22d013e3e4e818e83078fcfe60eb4e8b5f7d1563e3c46dbf6aba8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-25T04:57:43Z","title_canon_sha256":"560664473938e181f80f90579eb57d08c72cc470619667fa36a8113e253c9972"},"schema_version":"1.0","source":{"id":"1401.6496","kind":"arxiv","version":1}},"canonical_sha256":"8f2041530b3418c5607b9dc81e75982f181c999fb04567a8fa77043ad9409f61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f2041530b3418c5607b9dc81e75982f181c999fb04567a8fa77043ad9409f61","first_computed_at":"2026-05-18T03:01:01.606253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:01.606253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6fmibDSVE7GDqvpAuXSiPmGJZYTLg9hkIsFjMpTvhR+YW9g4JFcmpRJX6Jlry3y4ROEz4sjGtgKd86/AE3u7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:01.607126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d54815064507565aab8385c5d3bc572d027e6803f212b2f151d708be2dccf7c2","sha256:79dabdd2645988b45269d3b024d83e1b4f14b616280a082cc9523c954a764fdd"],"state_sha256":"c917c37797a4331781aea1ac6857330187ab2eb9235024f1fe963754fcb2b01c"}