Pith. sign in

Paper Citation Record · LEDGER

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH

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

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

pith.paper-citation-record.v1
2404.08870 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-12T06:34:41.77262+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-06T21:08:15.702792Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T11:16:02.984610Z

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 39e6c22f-b1e2-4566-9eea-93d44d8d010e · inbound

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs cites this paper.

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-06T21:08:15.702792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T21:08:15.702792Z digest=sha256:6fdb6c9ceafba8263d1e01c306841b6930b9138347bdf679c24e35b825ea4498

Observation 48e0eccd-8eb9-4eb6-899a-27a51c130a02 · inbound

Optimal FPT-Approximability for Modular Linear Equations cites this paper.

Optimal FPT-Approximability for Modular Linear Equations Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH

Reference 12

Resolution
verified exact
arxiv_id, observed 2026-05-11T11:16:02.988408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-05-10T15:04:35.728420Z digest=sha256:40d21d64ecff6c0c9ee500fbf2a43d2049716e3c1f7b73ffb9d1067ee85807bc