{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P6JLFMWA7XFN6U3BUVVT3FGHBJ","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":"dfa6a852de55cbe3d0d4d435736747f3fb7060c8e838152f626f6c0b6fbbc870","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-20T15:39:38Z","title_canon_sha256":"a65e84006083b92176bd1040e9526f675bda875e8165f81f9f039df1b24c95de"},"schema_version":"1.0","source":{"id":"1311.5102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5102","created_at":"2026-05-18T03:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5102v1","created_at":"2026-05-18T03:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5102","created_at":"2026-05-18T03:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"P6JLFMWA7XFN","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P6JLFMWA7XFN6U3B","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P6JLFMWA","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b273a28fe318d9cd50bba9fdb5291b16f6d0c30acdf4826a025156f82d8a7d57","target":"graph","created_at":"2026-05-18T03:06:41Z","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"},"paper":{"abstract_excerpt":"We prove that 3-query linear locally correctable codes over the Reals of dimension $d$ require block length $n>d^{2+\\lambda}$ for some fixed, positive $\\lambda >0$. Geometrically, this means that if $n$ vectors in $R^d$ are such that each vector is spanned by a linear number of disjoint triples of others, then it must be that $n > d^{2+\\lambda}$. This improves the known quadratic lower bounds (e.g. {KdW04, Wood07}). While a modest improvement, we expect that the new techniques introduced in this work will be useful for further progress on lower bounds of locally correctable and decodable codes","authors_text":"Avi Wigderson, Shubhangi Saraf, Zeev Dvir","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-20T15:39:38Z","title":"Breaking the quadratic barrier for 3-LCCs over the Reals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5102","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:40ad1b721021efa4c7aa2218b899572f2dfe04be1867de6b927f6c549592bb4f","target":"record","created_at":"2026-05-18T03:06:41Z","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":"dfa6a852de55cbe3d0d4d435736747f3fb7060c8e838152f626f6c0b6fbbc870","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-20T15:39:38Z","title_canon_sha256":"a65e84006083b92176bd1040e9526f675bda875e8165f81f9f039df1b24c95de"},"schema_version":"1.0","source":{"id":"1311.5102","kind":"arxiv","version":1}},"canonical_sha256":"7f92b2b2c0fdcadf5361a56b3d94c70a5be9ffd1a42b79d9a4c7a54e72847254","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f92b2b2c0fdcadf5361a56b3d94c70a5be9ffd1a42b79d9a4c7a54e72847254","first_computed_at":"2026-05-18T03:06:41.999359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:41.999359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IhtyD6IM24uLk6TFZjLczNm/eglgU7n+J89BKQyesDvsSfB3y7XB3R+uzDqtXjJCjJ7TmLZRcGiGt/9Y7modCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:41.999903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40ad1b721021efa4c7aa2218b899572f2dfe04be1867de6b927f6c549592bb4f","sha256:b273a28fe318d9cd50bba9fdb5291b16f6d0c30acdf4826a025156f82d8a7d57"],"state_sha256":"1b30574670ed516661b731b31df115374c10cd8d9e7fac51fa24ca2b132b71c4"}