{"as_of":"2026-08-13T19:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c5f535c3d75fe8508c754830875697ed00666cafe314f7307862d7fe9bdd9c77","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:31:29.956811Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.14276/citation-record","integrity":"/paper/2411.14276/integrity","json":"/paper/2411.14276/citation-record.json","paper":"/paper/2411.14276"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.786144Z","title":"Near-tight bounds for 3-query locally correctable binary linear codes via rainbow cycles","venue":null,"work_id":"436d1a29-1a0d-45cf-b916-ecb6422e8f64","year":2024},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.461756Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:3449e8d3e77298034065dae8ffae257d49715dac26ad464fc596f4f3b3768a48","observation_id":"aab1676d-99cf-4d56-81ef-b680f192b3d7","resolution":{"observed_at":"2026-08-12T15:31:30.795641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-13T16:40:26.504501Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14361","snapshot_observed_at":"2026-08-12T15:31:29.746373Z","title":"Kothari, and Andrew D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.746373Z"},"links":{"cited_paper":"/paper/2411.14361","citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:f1103c17344bc340f1db39e26e5fb69f615729bf52599e53c792ca2ada191baa","observation_id":"38cceb38-3891-4ecb-b6f3-93d6c958fc02","resolution":{"observed_at":"2026-08-12T15:31:29.746373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.625632Z","title":"Noisy Tensor Completion via the Sum-of-Squares Hierarchy","venue":null,"work_id":"00030a79-1d39-4fd3-874a-f02b80ca26da","year":2016},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.765344Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:e7e1518486fbfb7264fe54922fbbd42347d8797f69b0760cc9e92641312d5562","observation_id":"15a57630-a026-4a32-ae66-240797eebe74","resolution":{"observed_at":"2026-08-12T15:31:30.637274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.516148Z","title":"3-query locally decodable codes of subexponential length","venue":null,"work_id":"b22ec28a-656f-427d-ae21-92419b32cae9","year":2009},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.816959Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:5be29c0853a9ccb2b8faba265cd7163209450ac21a1f5d35d2931cb4550d2630","observation_id":"7e8a23e2-4d0f-4684-aae2-4b492d62ad04","resolution":{"observed_at":"2026-08-12T15:31:30.526809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.428460Z","title":"On the hardness of information-theoretic multiparty computation","venue":null,"work_id":"68c94408-64a2-486e-ab82-72e55a1369d8","year":2004},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.864211Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:ce0f844cf40706530ae0e762621027623c23e2dfa01e599302864e8a71e45e18","observation_id":"65a0fbcb-542c-4f47-8d89-62d2d0c62d64","resolution":{"observed_at":"2026-08-12T15:31:30.439628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.369778Z","title":"Exponentiallowerboundsforsmooth3-lccsand sharp bounds for designs","venue":null,"work_id":"1d4d1ce8-ff31-41bc-aa9a-cab96c4de363","year":2024},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.888645Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:a3d72221dad745c0027d3362fdd66843553006e02890d877e9204824701f360e","observation_id":"dd92c6ed-b523-4efe-b726-eee339364a26","resolution":{"observed_at":"2026-08-12T15:31:30.378433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.306091Z","title":"Strongly refuting random CSPs below the spectral threshold","venue":null,"work_id":"276c8023-fdbe-4e53-b91f-d28f5e9e1be2","year":2017},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.914534Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:10ef669908f7b228dea92e8961ceb3e14765c6626ed23df4ea808bcc871a1597","observation_id":"67090dba-4bfd-4f34-86d8-766259e7ad1f","resolution":{"observed_at":"2026-08-12T15:31:30.314775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.187869Z","title":"A stronger bound for linear 3-lcc","venue":null,"work_id":"7b552fae-ea42-46c9-92e5-9ea4303df10d","year":2024},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.956811Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:3ff9d641524509be10a5eb60b87f5bec349555a1bd4ea1e654dd98924de95735","observation_id":"30fe9018-9330-498c-bb3c-8b44bde58be3","resolution":{"observed_at":"2026-08-12T15:31:30.201521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.337894Z","title":"Romashchenko","venue":null,"work_id":"b7c023e3-9abe-4902-be19-8cbecc288924","year":2006},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.903750Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:dea956ef349f64547a2770d7d7297179045be89e8f6264b1e3a491dfae4b2831","observation_id":"d5c206cd-2705-407a-bd6b-94243fafc535","resolution":{"observed_at":"2026-08-12T15:31:30.345165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.655872Z","title":"Allen, Ryan O’Donnell, and David Witmer","venue":null,"work_id":"38becf2d-dac2-4911-8dab-02dbced2b645","year":2015},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.498771Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:593ecf496e59ede5d5c9a32b4ef9dc75d6c001847dbea7549ba565337f31af8e","observation_id":"2f6f9dad-42e4-4e65-aa00-d51d6c0b30eb","resolution":{"observed_at":"2026-08-12T15:31:30.665990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.395910Z","title":"Kothari and Peter Manohar","venue":null,"work_id":"9688382a-82b7-4819-9561-da3bb4d0d402","year":2024},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.881875Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:414cdaa8ecba254961cff525318c47353729f3c9aa3710bff21f6d4a22d9c32c","observation_id":"e199c482-7fd0-4fc4-80cd-22cda48b7d12","resolution":{"observed_at":"2026-08-12T15:31:30.403776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.540476Z","title":"Onmatrixrigidityandlocallyself-correctablecodes","venue":null,"work_id":"b572ecf6-dac9-44f7-9f59-5f26e9ffa099","year":2010},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.805388Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:f64022386d61c7f62cacd228449cb1db41599cc9d1f137f0135627db0296d0d6","observation_id":"b96f2876-1022-43ff-9dca-4a1861f2013c","resolution":{"observed_at":"2026-08-12T15:31:30.548285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.456844Z","title":"Kothari, and Sidhanth Mohanty","venue":null,"work_id":"56600b16-02e4-49bb-bed6-d14a8845c4e2","year":2023},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.833498Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:995035fcc0ee1326b1871d2c640b2a4adb5d756063fa4f5eeb2f136d5572b7a2","observation_id":"025d727d-1b63-48b3-ae0b-f9b7e330721d","resolution":{"observed_at":"2026-08-12T15:31:30.465707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.593093Z","title":"Efficient and error-correcting data structures for membership and polynomial evaluation","venue":null,"work_id":"7e760047-e37c-402a-ad22-a39c775c0a47","year":2010},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.779826Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:3a80af29537b31bcb353009c09151bceb981661c84bed525442366e9c5b09b78","observation_id":"44d38dae-6128-4b14-94e4-2894f298ba03","resolution":{"observed_at":"2026-08-12T15:31:30.604024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.487769Z","title":"Kothari, and Peter Manohar","venue":null,"work_id":"8a3bea11-ae8f-4341-807a-edaa3e225d9e","year":2022},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.824550Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:fb243db405c27b877e5cc0a67ee8d1c5c9d6f01359cd46034e8fdabbd029fc00","observation_id":"94563aae-9668-49de-865e-0f8054b2133a","resolution":{"observed_at":"2026-08-12T15:31:30.497780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.563026Z","title":"Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits","venue":null,"work_id":"24b133e5-2f26-499d-9ab8-bb657a33bbce","year":2005},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.796080Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:de59e70293ba77e0e6942a7f4f2dbad2658a4b40726077529455de3628633b40","observation_id":"67954c91-f7e8-4b01-b7be-4975a3d59de3","resolution":{"observed_at":"2026-08-12T15:31:30.569496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.271493Z","title":"Wein, Ahmed El Alaoui, and Cristopher Moore","venue":null,"work_id":"4e991f88-dffb-482d-9956-2ea6b45d3fba","year":2019},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.936485Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:035c6da151f213b16b61df7c7682343413a6e8ba55a2163dd424c7f74793b46f","observation_id":"37a9a1aa-a982-4150-a55e-68a80b97322c","resolution":{"observed_at":"2026-08-12T15:31:30.281175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0409044","last_updated":"2004-09-24T02:38:24Z","snapshot_observed_at":"2026-08-13T14:33:14.196109Z","submitted_at":"2004-09-24T02:38:24Z","title":"Some Applications of Coding Theory in Computational Complexity","version":1},"cited_work":{"arxiv_id":"cs/0409044","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0409044","snapshot_observed_at":"2026-08-12T15:31:30.052333Z","title":"Some Applications of Coding Theory in Computational Complexity","venue":"cs.CC","work_id":"d30b390a-467e-49f5-bf58-2a5e8dbc01cb","year":2004},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.922522Z"},"links":{"cited_paper":"/paper/cs/0409044","citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:5face552c08e1403ef131e187d2c7f97dfc2f59d767f731848157aaf52aeacd4","observation_id":"240dd1a4-f739-44ef-95d1-05d0d38b1237","resolution":{"observed_at":"2026-08-12T15:31:30.064052Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.239236Z","title":"Error-correcting data structures","venue":null,"work_id":"112876d0-9107-4846-bdd4-407e2490b7a6","year":2009},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.946165Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:c83c27a1bee5d9d34d0ce2236e74e24c584d25e6b635ac6c62d5b99570460896","observation_id":"358afede-bcaa-4671-a310-d812f5dda56b","resolution":{"observed_at":"2026-08-12T15:31:30.247653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.693065Z","title":"Kothari, and Peter Manohar","venue":null,"work_id":"ba2b7b6d-7393-40a1-ab9e-93ca80ef9c48","year":2023},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.482189Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:ab3d49ae5bb7db743a9125bcf7d6e2301419d55edbaa4ded205772250bc57ec1","observation_id":"2f094452-8e71-49da-a87d-9e9e7e6ce6b0","resolution":{"observed_at":"2026-08-12T15:31:30.701116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11590","last_updated":"2024-11-25T19:47:41Z","snapshot_observed_at":"2026-08-13T04:38:12.840720Z","submitted_at":"2024-01-21T20:42:12Z","title":"Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11590","snapshot_observed_at":"2026-08-12T15:31:29.846927Z","title":"Kothari, Sidhanth Mohanty, David Munhá Correia, and Benny Sudakov","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.846927Z"},"links":{"cited_paper":"/paper/2401.11590","citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:ed1c45a61dfd8015a6585d4636ef4c0ed1f6d4da53c57b25f3298bf7fc24ed91","observation_id":"c2bbb60e-4819-4eb5-896c-523d19b4723d","resolution":{"observed_at":"2026-08-12T15:31:29.846927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:31:30.740015Z","title":null,"venue":null,"work_id":"68a36b45-6f7f-4bbd-84be-56349b30cc5a","year":2021},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.472289Z"},"links":{"citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:b07bb536e183774beff28b9189ab270bcbb5d90d7f0f270a5778c9d1dec67047","observation_id":"4a662901-f12e-44e3-88fa-937123bdd6de","resolution":{"observed_at":"2026-08-12T15:31:30.751926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","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"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":22},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2411.14276."}