{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJFOSDLVZBRVCQ56CRMTGM7KPE","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":"45fcf27357bc19900de401303b7dc62ba335aed53740a411b6b47a6471d0a0f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T17:38:58Z","title_canon_sha256":"e04bfb7c0c137121c805d934b01cc3d64bda5de300350d2741ca9f3bfacf27e0"},"schema_version":"1.0","source":{"id":"1707.06628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06628","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06628v2","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06628","created_at":"2026-05-18T00:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"RJFOSDLVZBRV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJFOSDLVZBRVCQ56","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJFOSDLV","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b03d203333efe042ab807d615f4c706c136aebfb236876d24423d1d0bd85e2c5","target":"graph","created_at":"2026-05-18T00:09:53Z","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":"Tiet\\\"{a}v\\\"{a}inen's upper and lower bounds assert that for block-length-$n$ linear codes with dual distance $d$, the covering radius $R$ is at most $\\frac{n}{2}-(\\frac{1}{2}-o(1))\\sqrt{dn}$ and typically at least $\\frac{n}{2}-\\Theta(\\sqrt{dn\\log{\\frac{n}{d}}})$. The gap between those bounds on $R -\\frac{n}{2}$ is an $\\Theta(\\sqrt{\\log{\\frac{n}{d}}})$ factor related to the gap between the worst covering radius given $d$ and the sphere-covering bound. Our focus in this paper is on the case when $d = o(n)$, i.e., when the code size is subexponential and the gap is $w(1)$. We show that up to a c","authors_text":"Louay Bazzi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T17:38:58Z","title":"On the covering radius of small codes versus dual distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06628","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:dae5112f1878f5dc8910e8c78dcb8b2694b8011733dca68d4294141f8871cd70","target":"record","created_at":"2026-05-18T00:09:53Z","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":"45fcf27357bc19900de401303b7dc62ba335aed53740a411b6b47a6471d0a0f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T17:38:58Z","title_canon_sha256":"e04bfb7c0c137121c805d934b01cc3d64bda5de300350d2741ca9f3bfacf27e0"},"schema_version":"1.0","source":{"id":"1707.06628","kind":"arxiv","version":2}},"canonical_sha256":"8a4ae90d75c8635143be14593333ea7912498049a17f5bc4db18d2799eeacbb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a4ae90d75c8635143be14593333ea7912498049a17f5bc4db18d2799eeacbb7","first_computed_at":"2026-05-18T00:09:53.038346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:53.038346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P1mHTSQQES9ri30vrUZFIoAXQnlFRoWeifmN9er7FlH+tgmMgGy8j2yd0vFK7ymEXmA8Cw81aPAwZ1ZGLTXDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:53.038992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dae5112f1878f5dc8910e8c78dcb8b2694b8011733dca68d4294141f8871cd70","sha256:b03d203333efe042ab807d615f4c706c136aebfb236876d24423d1d0bd85e2c5"],"state_sha256":"0d0552655cdcc5dbcbad4e0bf852ef0f09b12233b4c4cd2565b399d6cbe5aaee"}