{"as_of":"2026-08-21T06:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:208d9780b96fc77be737a787b9ada1399bd1df329311a48a0763718dc27c21b6","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:03:17.567570Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T00:56:41.094896Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-08-14T10:57:25.809107Z","title":"A birthday re petition theorem and complexity of approximating dense CSPs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-20T06:21:51.045995Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.809107Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:c1b6998488ad5a69c86acf591233a0d0427e996d8671e7f76255e4e121795039","observation_id":"9b653bba-16f9-48e6-83d0-1b1cda740446","resolution":{"observed_at":"2026-08-14T10:57:25.809107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-08-14T05:27:58.841154Z","title":"A birthday repetition theorem and complexity of approximating dense CSP s","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.841154Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:e478a366d439d646ce28de7cbdb1d26d633326d7407d48bc5a04fd8c61a23e36","observation_id":"e0f145de-e02b-44fd-aa62-10185aea6347","resolution":{"observed_at":"2026-08-14T05:27:58.841154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-08-15T23:03:17.567570Z","title":"A birthday repetition theorem and complexity of approximating dense csps","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.567570Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:268fe591715961c2a7a11992fb3ac576064f8f80006f82b2aaf07f8fca7174fa","observation_id":"370329ec-2518-41c9-982f-5d0fa49a3848","resolution":{"observed_at":"2026-08-15T23:03:17.567570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1607.02986 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-14T18:16:37.547462Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":129,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:8b98a07d6bcaff6d9466be04203463490e246062281e7a8b7589f0fba80eefcf","observation_id":"6d23e16c-2558-4b66-a7e9-de6309d4bcb7","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":"1607.02986","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-07-10T00:56:41.094896Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","venue":"cs.CC","work_id":"3271f997-7e15-4290-bf4e-57c9505f718d","year":2016},"citing_paper":{"arxiv_id":"2607.06852","last_updated":"2026-07-07T23:07:33Z","snapshot_observed_at":"2026-08-17T03:32:04.121185Z","submitted_at":"2026-07-07T23:07:33Z","title":"On the Approximability of Parameterized Minimum Monotone Satisfying Assignment","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-07-10T00:51:14.927492Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/2607.06852"},"observation_digest":"sha256:463ca21da2761b1c15372f995fed0d1ec3d7f8f4c620b9746cd77388e3189aae","observation_id":"c3dd1f81-7b0d-4e59-ba64-4455263111d5","resolution":{"observed_at":"2026-07-10T00:56:41.096259Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1607.02986/citation-record","integrity":"/paper/1607.02986/integrity","json":"/paper/1607.02986/citation-record.json","paper":"/paper/1607.02986"},"outbound":[],"paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"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."}