Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1607.02986.
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-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T23:03:17.567570Z
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 9b653bba-16f9-48e6-83d0-1b1cda740446 · inbound
Hardness Amplification of Optimization Problems cites this paper.
Hardness Amplification of Optimization Problems A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
Reference 1989
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T10:57:25.809107Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e0f145de-e02b-44fd-aa62-10185aea6347 · inbound
Parameterized Intractability of Even Set and Shortest Vector Problem cites this paper.
Parameterized Intractability of Even Set and Shortest Vector Problem A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
Reference 44
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T05:27:58.841154Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 370329ec-2518-41c9-982f-5d0fa49a3848 · inbound
Learning-Augmented Algorithms for Boolean Satisfiability cites this paper.
Learning-Augmented Algorithms for Boolean Satisfiability A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
Reference 43
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T23:03:17.567570Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
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.
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-20T06:33:59.587034+00:00.