{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CAABHQW2YUGI4Q7RHCFYJSMTRL","short_pith_number":"pith:CAABHQW2","schema_version":"1.0","canonical_sha256":"100013c2dac50c8e43f1388b84c9938ad5f8c4cf18705144a77940ebc4c8bcf7","source":{"kind":"arxiv","id":"1611.06980","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for 2-query LCCs over large alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Arnab Bhattacharyya, Avishay Tal, Sivakanth Gopi","submitted_at":"2016-11-21T19:57:35Z","abstract_excerpt":"A locally correctable code (LCC) is an error correcting code that allows correction of any arbitrary coordinate of a corrupted codeword by querying only a few coordinates. We show that any {\\em zero-error} $2$-query locally correctable code $\\mathcal{C}: \\{0,1\\}^k \\to \\Sigma^n$ that can correct a constant fraction of corrupted symbols must have $n \\geq \\exp(k/\\log|\\Sigma|)$. We say that an LCC is zero-error if there exists a non-adaptive corrector algorithm that succeeds with probability $1$ when the input is an uncorrupted codeword. All known constructions of LCCs are zero-error.\n  Our result"},"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":"1611.06980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-21T19:57:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9b10b3edb08dce949245aced10faff6f19a9abfb271152edaa88d3906b1acd6","abstract_canon_sha256":"d50224a27974155b9eaa1802fef96bb9121b2f686ec9961cce98fb925cf1b49f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:22.204421Z","signature_b64":"VZ9T+PjNGgRSW+m6kIc1jLlTY48ZkQ90jJ0S4Lo/C/FKJ/wjmb1wSPXZxgsmrTjC3t76RB/UbAJbuptDMvl7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"100013c2dac50c8e43f1388b84c9938ad5f8c4cf18705144a77940ebc4c8bcf7","last_reissued_at":"2026-05-18T00:45:22.203916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:22.203916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for 2-query LCCs over large alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Arnab Bhattacharyya, Avishay Tal, Sivakanth Gopi","submitted_at":"2016-11-21T19:57:35Z","abstract_excerpt":"A locally correctable code (LCC) is an error correcting code that allows correction of any arbitrary coordinate of a corrupted codeword by querying only a few coordinates. We show that any {\\em zero-error} $2$-query locally correctable code $\\mathcal{C}: \\{0,1\\}^k \\to \\Sigma^n$ that can correct a constant fraction of corrupted symbols must have $n \\geq \\exp(k/\\log|\\Sigma|)$. We say that an LCC is zero-error if there exists a non-adaptive corrector algorithm that succeeds with probability $1$ when the input is an uncorrupted codeword. All known constructions of LCCs are zero-error.\n  Our result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06980","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":"1611.06980","created_at":"2026-05-18T00:45:22.203985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06980v2","created_at":"2026-05-18T00:45:22.203985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06980","created_at":"2026-05-18T00:45:22.203985+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAABHQW2YUGI","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAABHQW2YUGI4Q7R","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAABHQW2","created_at":"2026-05-18T12:30:09.641336+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/CAABHQW2YUGI4Q7RHCFYJSMTRL","json":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL.json","graph_json":"https://pith.science/api/pith-number/CAABHQW2YUGI4Q7RHCFYJSMTRL/graph.json","events_json":"https://pith.science/api/pith-number/CAABHQW2YUGI4Q7RHCFYJSMTRL/events.json","paper":"https://pith.science/paper/CAABHQW2"},"agent_actions":{"view_html":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL","download_json":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL.json","view_paper":"https://pith.science/paper/CAABHQW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06980&json=true","fetch_graph":"https://pith.science/api/pith-number/CAABHQW2YUGI4Q7RHCFYJSMTRL/graph.json","fetch_events":"https://pith.science/api/pith-number/CAABHQW2YUGI4Q7RHCFYJSMTRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL/action/storage_attestation","attest_author":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL/action/author_attestation","sign_citation":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL/action/citation_signature","submit_replication":"https://pith.science/pith/CAABHQW2YUGI4Q7RHCFYJSMTRL/action/replication_record"}},"created_at":"2026-05-18T00:45:22.203985+00:00","updated_at":"2026-05-18T00:45:22.203985+00:00"}