{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C5OV7K6WQNOEUOLILEBOHB2JJT","short_pith_number":"pith:C5OV7K6W","schema_version":"1.0","canonical_sha256":"175d5fabd6835c4a39685902e387494cdbd67cd0c8f639ea1a5646fe5f6c4ab7","source":{"kind":"arxiv","id":"1405.1464","version":2},"attestation_state":"computed","paper":{"title":"Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, Negar Kiyavash","submitted_at":"2014-05-06T22:28:42Z","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-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.1464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T22:28:42Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"bb1c4ec9a51e1157cc8439d463167452f9b7465ccec29793c55d0630afe6c379","abstract_canon_sha256":"5125ac2ae4b5c6350f5b51246832b3fa4f37483df4dfa5e404054d464963d820"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:09.422437Z","signature_b64":"5GVSBZ3V1uLJBg5CjpXyFwSl0xh+PXz+oMkkzNKEbW+8+W2bKglf4Jg1bCXpJXPV3bUI2Ie+OashbDFnN60UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"175d5fabd6835c4a39685902e387494cdbd67cd0c8f639ea1a5646fe5f6c4ab7","last_reissued_at":"2026-05-18T01:53:09.421936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:09.421936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, Negar Kiyavash","submitted_at":"2014-05-06T22:28:42Z","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-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1464","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.1464","created_at":"2026-05-18T01:53:09.422021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1464v2","created_at":"2026-05-18T01:53:09.422021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1464","created_at":"2026-05-18T01:53:09.422021+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5OV7K6WQNOE","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5OV7K6WQNOEUOLI","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5OV7K6W","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT","json":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT.json","graph_json":"https://pith.science/api/pith-number/C5OV7K6WQNOEUOLILEBOHB2JJT/graph.json","events_json":"https://pith.science/api/pith-number/C5OV7K6WQNOEUOLILEBOHB2JJT/events.json","paper":"https://pith.science/paper/C5OV7K6W"},"agent_actions":{"view_html":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT","download_json":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT.json","view_paper":"https://pith.science/paper/C5OV7K6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1464&json=true","fetch_graph":"https://pith.science/api/pith-number/C5OV7K6WQNOEUOLILEBOHB2JJT/graph.json","fetch_events":"https://pith.science/api/pith-number/C5OV7K6WQNOEUOLILEBOHB2JJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT/action/storage_attestation","attest_author":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT/action/author_attestation","sign_citation":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT/action/citation_signature","submit_replication":"https://pith.science/pith/C5OV7K6WQNOEUOLILEBOHB2JJT/action/replication_record"}},"created_at":"2026-05-18T01:53:09.422021+00:00","updated_at":"2026-05-18T01:53:09.422021+00:00"}