Pith. sign in

Paper Citation Record · LEDGER

Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs

As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.06513.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2404.06513 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:34:46.469953Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-02T23:47:27.477181Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 4fae3958-2ac1-40a1-b0ed-4e378f2e97d3 · inbound

Improved Lower Bounds for all Odd-Query Locally Decodable Codes cites this paper.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.469953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.469953Z digest=sha256:b5b6c9005bb32563644a78fd08e429839edd6694eaa2042c4755a3d363715826

Observation 2dc82c1c-20e7-4f27-bf1d-3509650c173c · inbound

Kikuchi Graphs of Random Hypergraphs are Approximately Johnson cites this paper.

Kikuchi Graphs of Random Hypergraphs are Approximately Johnson Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-07-02T23:47:27.478781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-06-27T17:58:42.283848Z digest=sha256:9034f16d78b272034a055a75a6c846b744bcc1f631fd3ece0f9b0b16e8fd0340