{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XFYRBV7N23FOU2Q7SJVEVWXNJF","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":"706e723b2c1cdeb3c0d65507ceb7fffb7ca1aec600ddf0ae91bd46cb10c933d8","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T22:28:23Z","title_canon_sha256":"e15280a7e65c7722b45a4476e3d08ec23b248ef5a83539e08d7fcdc2573f9eda"},"schema_version":"1.0","source":{"id":"1202.6086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6086","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6086v2","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6086","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"XFYRBV7N23FO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XFYRBV7N23FOU2Q7","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XFYRBV7N","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:a31dd5bb524e25f445a99c75d2aee0643dfa2af1dd636d0f47ee1040ee086af3","target":"graph","created_at":"2026-05-18T02:21:17Z","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 study certain combinatorial aspects of list-decoding, motivated by the exponential gap between the known upper bound (of $O(1/\\gamma)$) and lower bound (of $\\Omega_p(\\log (1/\\gamma))$) for the list-size needed to decode up to radius $p$ with rate $\\gamma$ away from capacity, i.e., $1-\\h(p)-\\gamma$ (here $p\\in (0,1/2)$ and $\\gamma > 0$). Our main result is the following:\n  We prove that in any binary code $C \\subseteq \\{0,1\\}^n$ of rate $1-\\h(p)-\\gamma$, there must exist a set $\\mathcal{L} \\subset C$ of $\\Omega_p(1/\\sqrt{\\gamma})$ codewords such that the average distance of the points in $\\m","authors_text":"Srivatsan Narayanan, Venkatesan Guruswami","cross_cats":["cs.CC","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T22:28:23Z","title":"Combinatorial limitations of average-radius list-decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6086","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:311771d2bfd8a176cee8e37cd62887c209eca50d8b86ea31965ee8b852364418","target":"record","created_at":"2026-05-18T02:21:17Z","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":"706e723b2c1cdeb3c0d65507ceb7fffb7ca1aec600ddf0ae91bd46cb10c933d8","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T22:28:23Z","title_canon_sha256":"e15280a7e65c7722b45a4476e3d08ec23b248ef5a83539e08d7fcdc2573f9eda"},"schema_version":"1.0","source":{"id":"1202.6086","kind":"arxiv","version":2}},"canonical_sha256":"b97110d7edd6caea6a1f926a4adaed496e48be92c50cb3d4f14bf3a67681c887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b97110d7edd6caea6a1f926a4adaed496e48be92c50cb3d4f14bf3a67681c887","first_computed_at":"2026-05-18T02:21:17.504364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.504364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HE/l5wTUSYzawfmR72b+YhPYLyK24w7DmAwsSqO8iz/bsMZY4DcYoTg3a+rhMoW94GPFhz8iEjCxyuNDubaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.504985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:311771d2bfd8a176cee8e37cd62887c209eca50d8b86ea31965ee8b852364418","sha256:a31dd5bb524e25f445a99c75d2aee0643dfa2af1dd636d0f47ee1040ee086af3"],"state_sha256":"705ea7052b2d26712f66b9cad2cac0a9bab7a91746656533f936da528b37acd9"}