{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HAOFJPIWQEOWBSA7BAUGZTLGLN","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":"bb4b50dc98839a11ea88ef35b68d5247b20bc98367b97e1c41a66ba095ead961","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-04-08T20:54:14Z","title_canon_sha256":"a4f9a2166195487798c10dcd9ee67ab6c38d33f725699d5614fff17ecc88083d"},"schema_version":"1.0","source":{"id":"2404.05864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05864","created_at":"2026-07-05T08:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05864v1","created_at":"2026-07-05T08:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05864","created_at":"2026-07-05T08:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"HAOFJPIWQEOW","created_at":"2026-07-05T08:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"HAOFJPIWQEOWBSA7","created_at":"2026-07-05T08:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"HAOFJPIW","created_at":"2026-07-05T08:06:00Z"}],"graph_snapshots":[{"event_id":"sha256:2451385c411762a442a634318e3312e0314601941ba540d19fa22ee26900267d","target":"graph","created_at":"2026-07-05T08:06:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.05864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Omar Alrabiah, Venkatesan Guruswami","cross_cats":["cs.CC","math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-04-08T20:54:14Z","title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05864","kind":"arxiv","version":1},"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:333a4f2eedd2c99d3ff699c02644b9094eefb12d23fedd6cf8d4937a9214932f","target":"record","created_at":"2026-07-05T08:06:00Z","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":"bb4b50dc98839a11ea88ef35b68d5247b20bc98367b97e1c41a66ba095ead961","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-04-08T20:54:14Z","title_canon_sha256":"a4f9a2166195487798c10dcd9ee67ab6c38d33f725699d5614fff17ecc88083d"},"schema_version":"1.0","source":{"id":"2404.05864","kind":"arxiv","version":1}},"canonical_sha256":"381c54bd16811d60c81f08286ccd665b5303a0eb40b91b55bc07773f76526676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"381c54bd16811d60c81f08286ccd665b5303a0eb40b91b55bc07773f76526676","first_computed_at":"2026-07-05T08:06:00.443982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:00.443982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w9P56TE5PdfbjNljcfHV2Fk+UkrnU3lFLoH/rTCxr6cv//pC428fxu/4a3SZlWm/JL3+GttzE2aK8uboOc0KDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:00.444391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.05864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:333a4f2eedd2c99d3ff699c02644b9094eefb12d23fedd6cf8d4937a9214932f","sha256:2451385c411762a442a634318e3312e0314601941ba540d19fa22ee26900267d"],"state_sha256":"eda8410aa946b8bf183df4fedeeaa0b76b9d109c8ce9da0a6ac29d544b0d82cc"}