Pith. sign in

Paper Citation Record · LEDGER

A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

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

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

pith.paper-citation-record.v1
1607.02986 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-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-07-11T12:12:44.455418Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-10T00:56:41.094896Z

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 6d23e16c-2558-4b66-a7e9-de6309d4bcb7 · inbound

Active Learning on Adversarially Corrupted Graphs cites this paper.

Active Learning on Adversarially Corrupted Graphs A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

Reference 129

Resolution
unresolved
no resolver link, observed 2026-07-11T12:12:44.455418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T12:12:44.455418Z digest=sha256:7ffb2e19a8f77deff0d2d64574a741085ea11b523cc28e3ae682042bb4a59660

Observation c3dd1f81-7b0d-4e59-ba64-4455263111d5 · inbound

On the Approximability of Parameterized Minimum Monotone Satisfying Assignment cites this paper.

On the Approximability of Parameterized Minimum Monotone Satisfying Assignment A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

Reference 97

Resolution
metadata mismatch
local_arxiv, observed 2026-07-10T00:56:41.096259Z

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=arxiv_source observed=2026-07-10T00:51:14.927492Z digest=sha256:156ae165c702fc0d0c64656a47b2034929461cb20e7a617d0cdb35be45cade50