Pith. sign in

Paper Citation Record · LEDGER

Some Applications of Coding Theory in Computational Complexity

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

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

pith.paper-citation-record.v1
cs/0409044 v1

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.567783Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-12T15:31:30.052333Z

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 240dd1a4-f739-44ef-95d1-05d0d38b1237 · inbound

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs cites this paper.

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T15:31:29.922522Z digest=sha256:0fba0286642e50b79e1f3d3ce4a14586aefc9da36ad57d498a0accd47ebeb026

Observation 65bdf34b-c28e-4ca8-b0dd-3d4930df3f72 · inbound

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

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Some Applications of Coding Theory in Computational Complexity

Reference 34

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.567783Z digest=sha256:928f322e90a9488f9d3f37a97d2f06a9b8fc64494f37a5823b5fcf0981d5231d