{"as_of":"2026-08-13T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd68df4b5e6491163b1a6c4b37fc829246c571db565fb4e796cbd21e48fa5861","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-12T06:34:41.77262+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:2c16ecaaaf8ba21d2d5da6b751cea6c2a7f3efe77bd58c1bd4650280edd25832","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:13:47.080718Z","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:fbeaa4cbf0f195ecd9edcf6f496c25a12a75025322970922e34f75bdff536b33","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:92915951cc7f1b3ea8e10c30099a417a92d69163b9871b63a576962032c605b0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:24573d036ec0997db06d4b0b44c135c9f2e44351160c69af3ed5f87b226442d3","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:363954863c676bb73bde556a00dc0455a937f8e686d8947735d4dd3d69aef04b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:1ad7a18769774a96c5b025761bdae4bbf6864ec67f1f72ad28cdf32eb0d9ec14","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:c944fa8f15bc2bcc350a66564354f325ccbfa395076037ac1c57985a1cf69c9e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:8ebc31cd6acf4de690d1ffcfc0330c75c435d64f838feec2a14d457147390eec","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:713a55d8c9b499fa7c6bbd185de0d35bced3554ac392e3b83b762356836620ba","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:3381586a9f5b392dda01daf85b85b157a8ada6bd1a5f2c4ec86875ad356df786","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:f4df1aa9ee59f17ec1a833164101bd9ecb8855c4dc64db11bbda8c4471e6c488","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:39037c61a284808fcf605feaf9415eec3a644784d7f734e70f0c25265d2d99d2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:7ab797f616605c1a54937301845a07100e34f2c8c5d3b784e7ba837a13ecd688","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:93950d926539b0c26d5de9720969cab2ba619dfdb2ddf35772bd381cfd0ecdb0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:076aafa5da12c136fafdefc5ff87438d229a1adc2bf3cb0c2ecbf044ee61494f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:7d58aa06311487ea817ae3306eb09cf60028a841b2e8bc2e2fb9e215d2f4d869","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:5007da3719db08935b7afad2f7717b28eaa52c9acd58d77ec4a633f62e7988f2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-07T03:06:00.568661Z","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:7ffde7883a1b1f3788d59b969fa398c69d59e404d7870a5100b8a7239d97a7b1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:1cdb219b0b534f0a3451c769620c7e7364afd99d37ec55c2cc96594743a3511d","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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:de7daf4ae846555dd6534e4cf637686174e0b9763f2d02d03d106e22195e8cf4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-06T17:18:32.330256Z","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:c5c535a7f986aee6b445905f3957666f618895ef4b853963ead639e1d19493fb","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:3e4af2dc093555808b4e38c0270efec72c4c3eb512fe5efca5a2edb618b018a0","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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."}