{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HAOFJPIWQEOWBSA7BAUGZTLGLN","short_pith_number":"pith:HAOFJPIW","schema_version":"1.0","canonical_sha256":"381c54bd16811d60c81f08286ccd665b5303a0eb40b91b55bc07773f76526676","source":{"kind":"arxiv","id":"2404.05864","version":1},"attestation_state":"computed","paper":{"title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Venkatesan Guruswami","submitted_at":"2024-04-08T20:54:14Z","abstract_excerpt":"We prove that a binary linear code of block length $n$ that is locally correctable with $3$ queries against a fraction $\\delta > 0$ of adversarial errors must have dimension at most $O_{\\delta}(\\log^2 n \\cdot \\log \\log n)$. This is almost tight in view of quadratic Reed-Muller codes being a $3$-query locally correctable code (LCC) with dimension $\\Theta(\\log^2 n)$. Our result improves, for the binary field case, the $O_{\\delta}(\\log^8 n)$ bound obtained in the recent breakthrough of (Kothari and Manohar, 2023) (arXiv:2311.00558) (and the more recent improvement to $O_{\\delta}(\\log^4 n)$ for bi"},"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":"2404.05864","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-04-08T20:54:14Z","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"title_canon_sha256":"a4f9a2166195487798c10dcd9ee67ab6c38d33f725699d5614fff17ecc88083d","abstract_canon_sha256":"bb4b50dc98839a11ea88ef35b68d5247b20bc98367b97e1c41a66ba095ead961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:00.444391Z","signature_b64":"w9P56TE5PdfbjNljcfHV2Fk+UkrnU3lFLoH/rTCxr6cv//pC428fxu/4a3SZlWm/JL3+GttzE2aK8uboOc0KDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"381c54bd16811d60c81f08286ccd665b5303a0eb40b91b55bc07773f76526676","last_reissued_at":"2026-07-05T08:06:00.443982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:00.443982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Venkatesan Guruswami","submitted_at":"2024-04-08T20:54:14Z","abstract_excerpt":"We prove that a binary linear code of block length $n$ that is locally correctable with $3$ queries against a fraction $\\delta > 0$ of adversarial errors must have dimension at most $O_{\\delta}(\\log^2 n \\cdot \\log \\log n)$. This is almost tight in view of quadratic Reed-Muller codes being a $3$-query locally correctable code (LCC) with dimension $\\Theta(\\log^2 n)$. Our result improves, for the binary field case, the $O_{\\delta}(\\log^8 n)$ bound obtained in the recent breakthrough of (Kothari and Manohar, 2023) (arXiv:2311.00558) (and the more recent improvement to $O_{\\delta}(\\log^4 n)$ for bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05864","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.05864/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.05864","created_at":"2026-07-05T08:06:00.444046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05864v1","created_at":"2026-07-05T08:06:00.444046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05864","created_at":"2026-07-05T08:06:00.444046+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAOFJPIWQEOW","created_at":"2026-07-05T08:06:00.444046+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAOFJPIWQEOWBSA7","created_at":"2026-07-05T08:06:00.444046+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAOFJPIW","created_at":"2026-07-05T08:06:00.444046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13945","citing_title":"Restricted subgraphs of edge-colored graphs and applications","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN","json":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN.json","graph_json":"https://pith.science/api/pith-number/HAOFJPIWQEOWBSA7BAUGZTLGLN/graph.json","events_json":"https://pith.science/api/pith-number/HAOFJPIWQEOWBSA7BAUGZTLGLN/events.json","paper":"https://pith.science/paper/HAOFJPIW"},"agent_actions":{"view_html":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN","download_json":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN.json","view_paper":"https://pith.science/paper/HAOFJPIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05864&json=true","fetch_graph":"https://pith.science/api/pith-number/HAOFJPIWQEOWBSA7BAUGZTLGLN/graph.json","fetch_events":"https://pith.science/api/pith-number/HAOFJPIWQEOWBSA7BAUGZTLGLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN/action/storage_attestation","attest_author":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN/action/author_attestation","sign_citation":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN/action/citation_signature","submit_replication":"https://pith.science/pith/HAOFJPIWQEOWBSA7BAUGZTLGLN/action/replication_record"}},"created_at":"2026-07-05T08:06:00.444046+00:00","updated_at":"2026-07-05T08:06:00.444046+00:00"}