Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T15:31:29.956811Z
Paper Citation Record · LEDGER
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
As of 14 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2411.14276.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
22 of 22 outbound references displayed
- verified exact1
- verified fuzzy18
- unresolved3
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation aab1676d-99cf-4d56-81ef-b680f192b3d7 · outbound
This paper cites Near-tight bounds for 3-query locally correctable binary linear codes via rainbow cycles.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Near-tight bounds for 3-query locally correctable binary linear codes via rainbow cycles
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.795641Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 38cceb38-3891-4ecb-b6f3-93d6c958fc02 · outbound
This paper cites Improved Lower Bounds for all Odd-Query Locally Decodable Codes.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Improved Lower Bounds for all Odd-Query Locally Decodable Codes
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T15:31:29.746373Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 15a57630-a026-4a32-ae66-240797eebe74 · outbound
This paper cites Noisy Tensor Completion via the Sum-of-Squares Hierarchy.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Noisy Tensor Completion via the Sum-of-Squares Hierarchy
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.637274Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 7e8a23e2-4d0f-4684-aae2-4b492d62ad04 · outbound
This paper cites 3-query locally decodable codes of subexponential length.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs 3-query locally decodable codes of subexponential length
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.526809Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 65a0fbcb-542c-4f47-8d89-62d2d0c62d64 · outbound
This paper cites On the hardness of information-theoretic multiparty computation.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs On the hardness of information-theoretic multiparty computation
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.439628Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation dd92c6ed-b523-4efe-b726-eee339364a26 · outbound
This paper cites Exponentiallowerboundsforsmooth3-lccsand sharp bounds for designs.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Exponentiallowerboundsforsmooth3-lccsand sharp bounds for designs
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.378433Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 67090dba-4bfd-4f34-86d8-766259e7ad1f · outbound
This paper cites Strongly refuting random CSPs below the spectral threshold.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Strongly refuting random CSPs below the spectral threshold
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.314775Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 30fe9018-9330-498c-bb3c-8b44bde58be3 · outbound
This paper cites A stronger bound for linear 3-lcc.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs A stronger bound for linear 3-lcc
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.201521Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation d5c206cd-2705-407a-bd6b-94243fafc535 · outbound
This paper cites Romashchenko.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Romashchenko
Reference 1991
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.345165Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 2f6f9dad-42e4-4e65-aa00-d51d6c0b30eb · outbound
This paper cites Allen, Ryan O’Donnell, and David Witmer.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Allen, Ryan O’Donnell, and David Witmer
Reference 1998
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.665990Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e199c482-7fd0-4fc4-80cd-22cda48b7d12 · outbound
This paper cites Kothari and Peter Manohar.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Kothari and Peter Manohar
Reference 2004
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.403776Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation b96f2876-1022-43ff-9dca-4a1861f2013c · outbound
This paper cites Onmatrixrigidityandlocallyself-correctablecodes.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Onmatrixrigidityandlocallyself-correctablecodes
Reference 2005
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.548285Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 025d727d-1b63-48b3-ae0b-f9b7e330721d · outbound
This paper cites Kothari, and Sidhanth Mohanty.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Kothari, and Sidhanth Mohanty
Reference 2006
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.465707Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 44d38dae-6128-4b14-94e4-2894f298ba03 · outbound
This paper cites Efficient and error-correcting data structures for membership and polynomial evaluation.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Efficient and error-correcting data structures for membership and polynomial evaluation
Reference 2007
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.604024Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 94563aae-9668-49de-865e-0f8054b2133a · outbound
This paper cites Kothari, and Peter Manohar.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Kothari, and Peter Manohar
Reference 2009
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.497780Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 67954c91-f7e8-4b01-b7be-4975a3d59de3 · outbound
This paper cites Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Reference 2010
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.569496Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 37a9a1aa-a982-4150-a55e-68a80b97322c · outbound
This paper cites Wein, Ahmed El Alaoui, and Cristopher Moore.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Wein, Ahmed El Alaoui, and Cristopher Moore
Reference 2015
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.281175Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 240dd1a4-f739-44ef-95d1-05d0d38b1237 · outbound
This paper cites Some Applications of Coding Theory in Computational Complexity.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Some Applications of Coding Theory in Computational Complexity
Reference 2017
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T15:31:30.064052Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 358afede-bcaa-4671-a310-d812f5dda56b · outbound
This paper cites Error-correcting data structures.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Error-correcting data structures
Reference 2019
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.247653Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 2f094452-8e71-49da-a87d-9e9e7e6ce6b0 · outbound
This paper cites Kothari, and Peter Manohar.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Kothari, and Peter Manohar
Reference 2021
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T15:31:30.701116Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation c2bbb60e-4819-4eb5-896c-523d19b4723d · outbound
This paper cites Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
Reference 2023
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T15:31:29.846927Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4a662901-f12e-44e3-88fa-937123bdd6de · outbound
This paper cites an unresolved cited work.
A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Unresolved cited work
Reference 2024
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T15:31:30.751926Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Pith citing papers
No inbound Pith citation observations are available.