{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZEE76J3ECCYI3VIFV26U6HIYME","short_pith_number":"pith:ZEE76J3E","canonical_record":{"source":{"id":"2311.00558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-01T14:55:04Z","cross_cats_sorted":[],"title_canon_sha256":"7f39b2177b9091ea12831ce3542ed29223bfdd3efa9fe1c741286c1f69793f44","abstract_canon_sha256":"86d7fe3454e79702b2d12f435212ef7adaed1322f16b39ece4865a0bdb5f7b0c"},"schema_version":"1.0"},"canonical_sha256":"c909ff276410b08dd505aebd4f1d186120d2998cb7ca4774e45c1bde6db51069","source":{"kind":"arxiv","id":"2311.00558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00558","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00558v1","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00558","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZEE76J3ECCYI","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZEE76J3ECCYI3VIF","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZEE76J3E","created_at":"2026-07-05T07:07:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZEE76J3ECCYI3VIFV26U6HIYME","target":"record","payload":{"canonical_record":{"source":{"id":"2311.00558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-01T14:55:04Z","cross_cats_sorted":[],"title_canon_sha256":"7f39b2177b9091ea12831ce3542ed29223bfdd3efa9fe1c741286c1f69793f44","abstract_canon_sha256":"86d7fe3454e79702b2d12f435212ef7adaed1322f16b39ece4865a0bdb5f7b0c"},"schema_version":"1.0"},"canonical_sha256":"c909ff276410b08dd505aebd4f1d186120d2998cb7ca4774e45c1bde6db51069","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:07:59.312014Z","signature_b64":"kL23gJLWo2rL2FfcqdegVioPjb9cO3PvgJSKQxE/rYPso1i4XYeF0SQkNejSuLj8MVzfZHTwMbK0rkuXx8vDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c909ff276410b08dd505aebd4f1d186120d2998cb7ca4774e45c1bde6db51069","last_reissued_at":"2026-07-05T07:07:59.311555Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:07:59.311555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.00558","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:07:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCQjqio4RJSvgsUxkyZjiN0wIDy+qEpHQBpcedxEtnTQUd+rL4PZclTBXvo2vkH4VRO12pGL+Q2wmhQl2xY/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:49:09.934456Z"},"content_sha256":"c27afae8e893b71e7c59574d5d17b30d0563ea4272fb9f754cfb1ec586ca7c5c","schema_version":"1.0","event_id":"sha256:c27afae8e893b71e7c59574d5d17b30d0563ea4272fb9f754cfb1ec586ca7c5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZEE76J3ECCYI3VIFV26U6HIYME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Peter Manohar, Pravesh K. Kothari","submitted_at":"2023-11-01T14:55:04Z","abstract_excerpt":"We prove that the blocklength $n$ of a linear $3$-query locally correctable code (LCC) $\\mathcal{L} \\colon {\\mathbb F}^k \\to {\\mathbb F}^n$ with distance $\\delta$ must be at least $n \\geq 2^{\\Omega\\left(\\left(\\frac{\\delta^2 k}{(|{\\mathbb F}|-1)^2}\\right)^{1/8}\\right)}$. In particular, the blocklength of a linear $3$-query LCC with constant distance over any small field grows exponentially with $k$. This improves on the best prior lower bound of $n \\geq \\tilde{\\Omega}(k^3)$ [AGKM23], which holds even for the weaker setting of $3$-query locally decodable codes (LDCs), and comes close to matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00558","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/2311.00558/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:07:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJ9IkMfWu56Zbm9U0kjiWnPOsy4NUwRBX8x+2jRonVQMGhl1KDxiyzNTy30qIxkGYFoxs0wgk3rGYYJb0zWvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:49:09.934987Z"},"content_sha256":"640811eef3ea59761a35e4cdb3c2cc9134eb6abcd4a919ba9711f6b05bf31ed4","schema_version":"1.0","event_id":"sha256:640811eef3ea59761a35e4cdb3c2cc9134eb6abcd4a919ba9711f6b05bf31ed4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEE76J3ECCYI3VIFV26U6HIYME/bundle.json","state_url":"https://pith.science/pith/ZEE76J3ECCYI3VIFV26U6HIYME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEE76J3ECCYI3VIFV26U6HIYME/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T08:49:09Z","links":{"resolver":"https://pith.science/pith/ZEE76J3ECCYI3VIFV26U6HIYME","bundle":"https://pith.science/pith/ZEE76J3ECCYI3VIFV26U6HIYME/bundle.json","state":"https://pith.science/pith/ZEE76J3ECCYI3VIFV26U6HIYME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEE76J3ECCYI3VIFV26U6HIYME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZEE76J3ECCYI3VIFV26U6HIYME","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":"86d7fe3454e79702b2d12f435212ef7adaed1322f16b39ece4865a0bdb5f7b0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-01T14:55:04Z","title_canon_sha256":"7f39b2177b9091ea12831ce3542ed29223bfdd3efa9fe1c741286c1f69793f44"},"schema_version":"1.0","source":{"id":"2311.00558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00558","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00558v1","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00558","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZEE76J3ECCYI","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZEE76J3ECCYI3VIF","created_at":"2026-07-05T07:07:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZEE76J3E","created_at":"2026-07-05T07:07:59Z"}],"graph_snapshots":[{"event_id":"sha256:640811eef3ea59761a35e4cdb3c2cc9134eb6abcd4a919ba9711f6b05bf31ed4","target":"graph","created_at":"2026-07-05T07:07:59Z","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/2311.00558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that the blocklength $n$ of a linear $3$-query locally correctable code (LCC) $\\mathcal{L} \\colon {\\mathbb F}^k \\to {\\mathbb F}^n$ with distance $\\delta$ must be at least $n \\geq 2^{\\Omega\\left(\\left(\\frac{\\delta^2 k}{(|{\\mathbb F}|-1)^2}\\right)^{1/8}\\right)}$. In particular, the blocklength of a linear $3$-query LCC with constant distance over any small field grows exponentially with $k$. This improves on the best prior lower bound of $n \\geq \\tilde{\\Omega}(k^3)$ [AGKM23], which holds even for the weaker setting of $3$-query locally decodable codes (LDCs), and comes close to matching","authors_text":"Peter Manohar, Pravesh K. Kothari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00558","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:c27afae8e893b71e7c59574d5d17b30d0563ea4272fb9f754cfb1ec586ca7c5c","target":"record","created_at":"2026-07-05T07:07:59Z","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":"86d7fe3454e79702b2d12f435212ef7adaed1322f16b39ece4865a0bdb5f7b0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-01T14:55:04Z","title_canon_sha256":"7f39b2177b9091ea12831ce3542ed29223bfdd3efa9fe1c741286c1f69793f44"},"schema_version":"1.0","source":{"id":"2311.00558","kind":"arxiv","version":1}},"canonical_sha256":"c909ff276410b08dd505aebd4f1d186120d2998cb7ca4774e45c1bde6db51069","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c909ff276410b08dd505aebd4f1d186120d2998cb7ca4774e45c1bde6db51069","first_computed_at":"2026-07-05T07:07:59.311555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:07:59.311555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kL23gJLWo2rL2FfcqdegVioPjb9cO3PvgJSKQxE/rYPso1i4XYeF0SQkNejSuLj8MVzfZHTwMbK0rkuXx8vDBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:07:59.312014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.00558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c27afae8e893b71e7c59574d5d17b30d0563ea4272fb9f754cfb1ec586ca7c5c","sha256:640811eef3ea59761a35e4cdb3c2cc9134eb6abcd4a919ba9711f6b05bf31ed4"],"state_sha256":"f11981bf9f8dc1b847f38023eee443f2591922092a6750061abca1df6ddd8f2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oFiz86CaHBAdHrqXgORSUcoiyoCOnp//bL2rPaDfTzhsNXX+AZO/bqdMgZNpQwY0QeOrMAtHYZPc4gHGFkrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:49:09.938541Z","bundle_sha256":"74434825ed995301dc38473af29258936b5d85b3b7f2007e001f305e0119ff78"}}