{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:A3AUOHYVNCCU7OSCNUJHHCYHDL","short_pith_number":"pith:A3AUOHYV","canonical_record":{"source":{"id":"2411.14361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T18:00:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8c1acc6632f2ce478495f0237dd30abd8465591e2afbf068aeb52ed8aab84745","abstract_canon_sha256":"25417debc2098a284cce5114e6dbc803cfc52c4429612f0f3490e3a3449d64bc"},"schema_version":"1.0"},"canonical_sha256":"06c1471f1568854fba426d12738b071ad33129f6d12620acc905c7d1ba5e3857","source":{"kind":"arxiv","id":"2411.14361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14361","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14361v1","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14361","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"A3AUOHYVNCCU","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_16","alias_value":"A3AUOHYVNCCU7OSC","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_8","alias_value":"A3AUOHYV","created_at":"2026-07-05T09:38:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:A3AUOHYVNCCU7OSCNUJHHCYHDL","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T18:00:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8c1acc6632f2ce478495f0237dd30abd8465591e2afbf068aeb52ed8aab84745","abstract_canon_sha256":"25417debc2098a284cce5114e6dbc803cfc52c4429612f0f3490e3a3449d64bc"},"schema_version":"1.0"},"canonical_sha256":"06c1471f1568854fba426d12738b071ad33129f6d12620acc905c7d1ba5e3857","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:45.705825Z","signature_b64":"FNtPrDSLQBnz+mE2yTLoHgEWkx1jk+yJZrlPaNfr4i7Ra6fiqQbk4AfL0K42gM90jAfLyynR0jhnQGEAe4XJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06c1471f1568854fba426d12738b071ad33129f6d12620acc905c7d1ba5e3857","last_reissued_at":"2026-07-05T09:38:45.705221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:45.705221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14361","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-05T09:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OE2vYhpuum7of5TR3CS/IsicFUMJa3QisZ2M6i3ORI1HeCG1uyjs7iiVqQUPc/hRde/xqQK7eR4BNkQu7s7UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:42:30.799490Z"},"content_sha256":"d2e292e1889e0eec77be71078a72d97b336f60930673fb7ea25179ae7f8ee715","schema_version":"1.0","event_id":"sha256:d2e292e1889e0eec77be71078a72d97b336f60930673fb7ea25179ae7f8ee715"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:A3AUOHYVNCCU7OSCNUJHHCYHDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Andrew D. Lin, Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari","submitted_at":"2024-11-21T18:00:12Z","abstract_excerpt":"We prove that for every odd $q\\geq 3$, any $q$-query binary, possibly non-linear locally decodable code ($q$-LDC) $E:\\{\\pm1\\}^k \\rightarrow \\{\\pm1\\}^n$ must satisfy $k \\leq \\tilde{O}(n^{1-2/q})$. For even $q$, this bound was established in a sequence of prior works. For $q=3$, the above bound was achieved in a recent work of Alrabiah, Guruswami, Kothari and Manohar using an argument that crucially exploits known exponential lower bounds for $2$-LDCs. Their strategy hits an inherent bottleneck for $q \\geq 5$.\n  Our key insight is identifying a general sufficient condition on the hypergraph of l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14361","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/2411.14361/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-05T09:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KfKyyURdPCaHnAEfm5V/lw0SfvaKKLIZi3ApSZc0R26Sxf83+DnKdvVPYqD/87OTf5PzG/bsCCFiqiolRd6LAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:42:30.800311Z"},"content_sha256":"b1fd0abc179ce595ee1de4df8035d53a83adf492912f9853e01998cd57fc63e5","schema_version":"1.0","event_id":"sha256:b1fd0abc179ce595ee1de4df8035d53a83adf492912f9853e01998cd57fc63e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL/bundle.json","state_url":"https://pith.science/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL/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-15T00:42:30Z","links":{"resolver":"https://pith.science/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL","bundle":"https://pith.science/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL/bundle.json","state":"https://pith.science/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3AUOHYVNCCU7OSCNUJHHCYHDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:A3AUOHYVNCCU7OSCNUJHHCYHDL","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":"25417debc2098a284cce5114e6dbc803cfc52c4429612f0f3490e3a3449d64bc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T18:00:12Z","title_canon_sha256":"8c1acc6632f2ce478495f0237dd30abd8465591e2afbf068aeb52ed8aab84745"},"schema_version":"1.0","source":{"id":"2411.14361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14361","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14361v1","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14361","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"A3AUOHYVNCCU","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_16","alias_value":"A3AUOHYVNCCU7OSC","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_8","alias_value":"A3AUOHYV","created_at":"2026-07-05T09:38:45Z"}],"graph_snapshots":[{"event_id":"sha256:b1fd0abc179ce595ee1de4df8035d53a83adf492912f9853e01998cd57fc63e5","target":"graph","created_at":"2026-07-05T09:38:45Z","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/2411.14361/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that for every odd $q\\geq 3$, any $q$-query binary, possibly non-linear locally decodable code ($q$-LDC) $E:\\{\\pm1\\}^k \\rightarrow \\{\\pm1\\}^n$ must satisfy $k \\leq \\tilde{O}(n^{1-2/q})$. For even $q$, this bound was established in a sequence of prior works. For $q=3$, the above bound was achieved in a recent work of Alrabiah, Guruswami, Kothari and Manohar using an argument that crucially exploits known exponential lower bounds for $2$-LDCs. Their strategy hits an inherent bottleneck for $q \\geq 5$.\n  Our key insight is identifying a general sufficient condition on the hypergraph of l","authors_text":"Andrew D. Lin, Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14361","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:d2e292e1889e0eec77be71078a72d97b336f60930673fb7ea25179ae7f8ee715","target":"record","created_at":"2026-07-05T09:38:45Z","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":"25417debc2098a284cce5114e6dbc803cfc52c4429612f0f3490e3a3449d64bc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T18:00:12Z","title_canon_sha256":"8c1acc6632f2ce478495f0237dd30abd8465591e2afbf068aeb52ed8aab84745"},"schema_version":"1.0","source":{"id":"2411.14361","kind":"arxiv","version":1}},"canonical_sha256":"06c1471f1568854fba426d12738b071ad33129f6d12620acc905c7d1ba5e3857","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06c1471f1568854fba426d12738b071ad33129f6d12620acc905c7d1ba5e3857","first_computed_at":"2026-07-05T09:38:45.705221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:45.705221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FNtPrDSLQBnz+mE2yTLoHgEWkx1jk+yJZrlPaNfr4i7Ra6fiqQbk4AfL0K42gM90jAfLyynR0jhnQGEAe4XJDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:45.705825Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2e292e1889e0eec77be71078a72d97b336f60930673fb7ea25179ae7f8ee715","sha256:b1fd0abc179ce595ee1de4df8035d53a83adf492912f9853e01998cd57fc63e5"],"state_sha256":"69b7da6ba9cfbaedb534ea24aa63fc2f3c01e45075518f6ac88af5653050f7f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMZf0daDM3p64TPkK3975aUyUeCt7bN/wD3IVwFqhube08X/O8VFEdgDohyjq8AJmpaRnDUeCBKKApo/Jka2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:42:30.813678Z","bundle_sha256":"10c76a898646f18309faf1cc45a15af30211ddb3ec41fc58caa5560e7100bb3f"}}