{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C5OV7K6WQNOEUOLILEBOHB2JJT","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":"5125ac2ae4b5c6350f5b51246832b3fa4f37483df4dfa5e404054d464963d820","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T22:28:42Z","title_canon_sha256":"bb1c4ec9a51e1157cc8439d463167452f9b7465ccec29793c55d0630afe6c379"},"schema_version":"1.0","source":{"id":"1405.1464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1464","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1464v2","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1464","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"C5OV7K6WQNOE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C5OV7K6WQNOEUOLI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C5OV7K6W","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:baa57dd741ac52acb28eb1470260a319d5b1679b58d08d992c6bc4dbb020258f","target":"graph","created_at":"2026-05-18T01:53:09Z","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":"Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and sphere-covering bounds to arbitrary error models. These generalizations become especially important when the sizes of the error spheres are nonuniform. The best possible sphere-packing and sphere-covering bounds are solutions to linear programs. We derive a series of bounds from approximations to packing and covering problems and study the relationships and trade-","authors_text":"Daniel Cullina, Negar Kiyavash","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T22:28:42Z","title":"Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1464","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:394cb0566bdc126ebf0d2392ca3326342d44d4bf01de2a560edc4d11d57b33bf","target":"record","created_at":"2026-05-18T01:53:09Z","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":"5125ac2ae4b5c6350f5b51246832b3fa4f37483df4dfa5e404054d464963d820","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T22:28:42Z","title_canon_sha256":"bb1c4ec9a51e1157cc8439d463167452f9b7465ccec29793c55d0630afe6c379"},"schema_version":"1.0","source":{"id":"1405.1464","kind":"arxiv","version":2}},"canonical_sha256":"175d5fabd6835c4a39685902e387494cdbd67cd0c8f639ea1a5646fe5f6c4ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"175d5fabd6835c4a39685902e387494cdbd67cd0c8f639ea1a5646fe5f6c4ab7","first_computed_at":"2026-05-18T01:53:09.421936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:09.421936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5GVSBZ3V1uLJBg5CjpXyFwSl0xh+PXz+oMkkzNKEbW+8+W2bKglf4Jg1bCXpJXPV3bUI2Ie+OashbDFnN60UBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:09.422437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:394cb0566bdc126ebf0d2392ca3326342d44d4bf01de2a560edc4d11d57b33bf","sha256:baa57dd741ac52acb28eb1470260a319d5b1679b58d08d992c6bc4dbb020258f"],"state_sha256":"1b9c099b426e543fcfd4df989a17aa056b963b1bacbaf78a557f7d0dd1153346"}