{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XFYRBV7N23FOU2Q7SJVEVWXNJF","short_pith_number":"pith:XFYRBV7N","schema_version":"1.0","canonical_sha256":"b97110d7edd6caea6a1f926a4adaed496e48be92c50cb3d4f14bf3a67681c887","source":{"kind":"arxiv","id":"1202.6086","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial limitations of average-radius list-decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Srivatsan Narayanan, Venkatesan Guruswami","submitted_at":"2012-02-27T22:28:23Z","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"},"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":"1202.6086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-27T22:28:23Z","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"title_canon_sha256":"e15280a7e65c7722b45a4476e3d08ec23b248ef5a83539e08d7fcdc2573f9eda","abstract_canon_sha256":"706e723b2c1cdeb3c0d65507ceb7fffb7ca1aec600ddf0ae91bd46cb10c933d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.504985Z","signature_b64":"/HE/l5wTUSYzawfmR72b+YhPYLyK24w7DmAwsSqO8iz/bsMZY4DcYoTg3a+rhMoW94GPFhz8iEjCxyuNDubaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b97110d7edd6caea6a1f926a4adaed496e48be92c50cb3d4f14bf3a67681c887","last_reissued_at":"2026-05-18T02:21:17.504364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.504364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial limitations of average-radius list-decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Srivatsan Narayanan, Venkatesan Guruswami","submitted_at":"2012-02-27T22:28:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6086","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":"1202.6086","created_at":"2026-05-18T02:21:17.504475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6086v2","created_at":"2026-05-18T02:21:17.504475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6086","created_at":"2026-05-18T02:21:17.504475+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFYRBV7N23FO","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFYRBV7N23FOU2Q7","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFYRBV7N","created_at":"2026-05-18T12:27:27.928770+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/XFYRBV7N23FOU2Q7SJVEVWXNJF","json":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF.json","graph_json":"https://pith.science/api/pith-number/XFYRBV7N23FOU2Q7SJVEVWXNJF/graph.json","events_json":"https://pith.science/api/pith-number/XFYRBV7N23FOU2Q7SJVEVWXNJF/events.json","paper":"https://pith.science/paper/XFYRBV7N"},"agent_actions":{"view_html":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF","download_json":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF.json","view_paper":"https://pith.science/paper/XFYRBV7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6086&json=true","fetch_graph":"https://pith.science/api/pith-number/XFYRBV7N23FOU2Q7SJVEVWXNJF/graph.json","fetch_events":"https://pith.science/api/pith-number/XFYRBV7N23FOU2Q7SJVEVWXNJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF/action/storage_attestation","attest_author":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF/action/author_attestation","sign_citation":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF/action/citation_signature","submit_replication":"https://pith.science/pith/XFYRBV7N23FOU2Q7SJVEVWXNJF/action/replication_record"}},"created_at":"2026-05-18T02:21:17.504475+00:00","updated_at":"2026-05-18T02:21:17.504475+00:00"}