{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WJECPUJG6KZNI6B55O6FDEJ3GG","short_pith_number":"pith:WJECPUJG","canonical_record":{"source":{"id":"2411.14276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T16:31:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"40196dfa3be4d5901d4954a1b9373103d4e24426e11fb5f7f18de524e21883ce","abstract_canon_sha256":"01da5ff347a5b2dfba0636c2898f8d8bd914fe5beba39d113c28c681e47ba850"},"schema_version":"1.0"},"canonical_sha256":"b24827d126f2b2d4783debbc51913b31bd8deb6be67b2d07821724b318a27ac6","source":{"kind":"arxiv","id":"2411.14276","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14276","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14276v2","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14276","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"WJECPUJG6KZN","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_16","alias_value":"WJECPUJG6KZNI6B5","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_8","alias_value":"WJECPUJG","created_at":"2026-07-05T11:58:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WJECPUJG6KZNI6B55O6FDEJ3GG","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T16:31:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"40196dfa3be4d5901d4954a1b9373103d4e24426e11fb5f7f18de524e21883ce","abstract_canon_sha256":"01da5ff347a5b2dfba0636c2898f8d8bd914fe5beba39d113c28c681e47ba850"},"schema_version":"1.0"},"canonical_sha256":"b24827d126f2b2d4783debbc51913b31bd8deb6be67b2d07821724b318a27ac6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:22.017689Z","signature_b64":"CHJ2uUFbxEh73JUHt7FXd7taeaSFnBtyGZV00f46HqkYoDSCGWaH6mqAZSLyXgO7VyZZxla2cAF3vo0GXSNBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b24827d126f2b2d4783debbc51913b31bd8deb6be67b2d07821724b318a27ac6","last_reissued_at":"2026-07-05T11:58:22.017258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:22.017258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14276","source_version":2,"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-05T11:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0NDxqINNRX7VRBlSEMKH+sUoT7ultRex+Sn+OTs3LE/8KxUSjm9gN0nI0dFzFi903ICPD80PEJxTvevJ+AfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:39:28.753689Z"},"content_sha256":"b65b64dda021a8b9fa56e3c553d098b155a8d1c7b10b1d9248bd8e7fd16081b8","schema_version":"1.0","event_id":"sha256:b65b64dda021a8b9fa56e3c553d098b155a8d1c7b10b1d9248bd8e7fd16081b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WJECPUJG6KZNI6B55O6FDEJ3GG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $k^{\\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Oliver Janzer, Peter Manohar","submitted_at":"2024-11-21T16:31:26Z","abstract_excerpt":"A code $C \\colon \\{0,1\\}^k \\to \\{0,1\\}^n$ is a $q$-query locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \\in \\{0,1\\}^k$ with good confidence by querying a corrupted string $\\tilde{x}$ of the codeword $x = C(b)$ in at most $q$ coordinates. For $2$ queries, the Hadamard code is a $2$-LDC of length $n = 2^k$, and this code is in fact essentially optimal. For $q \\geq 3$, there is a large gap in our understanding: the best constructions achieve $n = \\exp(k^{o(1)})$, while prior to the recent work of [AGKM23], the best lower bounds were $n \\geq \\tilde{\\Omeg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14276","kind":"arxiv","version":2},"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.14276/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-05T11:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGSxzkFGi/ajghXPQ8hkGOT4SWpxJfccJZuXalilXjIw6Yt/OZ2GJASPHtX12znse+M+0N5E4Eb1cz/kqyVjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:39:28.754188Z"},"content_sha256":"5e02e40f77025e4ace4cd0401d764738e098f7fd6c2029412be3a29772860641","schema_version":"1.0","event_id":"sha256:5e02e40f77025e4ace4cd0401d764738e098f7fd6c2029412be3a29772860641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJECPUJG6KZNI6B55O6FDEJ3GG/bundle.json","state_url":"https://pith.science/pith/WJECPUJG6KZNI6B55O6FDEJ3GG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJECPUJG6KZNI6B55O6FDEJ3GG/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-15T21:39:28Z","links":{"resolver":"https://pith.science/pith/WJECPUJG6KZNI6B55O6FDEJ3GG","bundle":"https://pith.science/pith/WJECPUJG6KZNI6B55O6FDEJ3GG/bundle.json","state":"https://pith.science/pith/WJECPUJG6KZNI6B55O6FDEJ3GG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJECPUJG6KZNI6B55O6FDEJ3GG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WJECPUJG6KZNI6B55O6FDEJ3GG","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":"01da5ff347a5b2dfba0636c2898f8d8bd914fe5beba39d113c28c681e47ba850","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T16:31:26Z","title_canon_sha256":"40196dfa3be4d5901d4954a1b9373103d4e24426e11fb5f7f18de524e21883ce"},"schema_version":"1.0","source":{"id":"2411.14276","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14276","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14276v2","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14276","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"WJECPUJG6KZN","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_16","alias_value":"WJECPUJG6KZNI6B5","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_8","alias_value":"WJECPUJG","created_at":"2026-07-05T11:58:22Z"}],"graph_snapshots":[{"event_id":"sha256:5e02e40f77025e4ace4cd0401d764738e098f7fd6c2029412be3a29772860641","target":"graph","created_at":"2026-07-05T11:58:22Z","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.14276/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A code $C \\colon \\{0,1\\}^k \\to \\{0,1\\}^n$ is a $q$-query locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \\in \\{0,1\\}^k$ with good confidence by querying a corrupted string $\\tilde{x}$ of the codeword $x = C(b)$ in at most $q$ coordinates. For $2$ queries, the Hadamard code is a $2$-LDC of length $n = 2^k$, and this code is in fact essentially optimal. For $q \\geq 3$, there is a large gap in our understanding: the best constructions achieve $n = \\exp(k^{o(1)})$, while prior to the recent work of [AGKM23], the best lower bounds were $n \\geq \\tilde{\\Omeg","authors_text":"Oliver Janzer, Peter Manohar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T16:31:26Z","title":"A $k^{\\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14276","kind":"arxiv","version":2},"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:b65b64dda021a8b9fa56e3c553d098b155a8d1c7b10b1d9248bd8e7fd16081b8","target":"record","created_at":"2026-07-05T11:58:22Z","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":"01da5ff347a5b2dfba0636c2898f8d8bd914fe5beba39d113c28c681e47ba850","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-21T16:31:26Z","title_canon_sha256":"40196dfa3be4d5901d4954a1b9373103d4e24426e11fb5f7f18de524e21883ce"},"schema_version":"1.0","source":{"id":"2411.14276","kind":"arxiv","version":2}},"canonical_sha256":"b24827d126f2b2d4783debbc51913b31bd8deb6be67b2d07821724b318a27ac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b24827d126f2b2d4783debbc51913b31bd8deb6be67b2d07821724b318a27ac6","first_computed_at":"2026-07-05T11:58:22.017258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:22.017258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CHJ2uUFbxEh73JUHt7FXd7taeaSFnBtyGZV00f46HqkYoDSCGWaH6mqAZSLyXgO7VyZZxla2cAF3vo0GXSNBCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:22.017689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14276","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b65b64dda021a8b9fa56e3c553d098b155a8d1c7b10b1d9248bd8e7fd16081b8","sha256:5e02e40f77025e4ace4cd0401d764738e098f7fd6c2029412be3a29772860641"],"state_sha256":"ccb09d7bb1625ca524070c3eaa49fab5b3cec94ac1bd3921164d89e079910f29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfNmnIyI0sIjbcutvMPJ5RVoFkylKs+mFKrYKoSWE3dlINMyFe1WKqsETcC3jJF0RVUxAeGvM1qs4SBAwyIwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T21:39:28.759504Z","bundle_sha256":"bc7779bc592ea063b0b135477d6cb633a08c197307cfafa7359e110610934765"}}