{"as_of":"2026-08-12T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca4b514befc4061bb0847a1398ab208c851b9e6d847c18c010d5a374511b7225","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T12:12:44.455418Z","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-07-06T05:03:07.915233Z","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-07T00:28:34.694919Z","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:7ffb2e19a8f77deff0d2d64574a741085ea11b523cc28e3ae682042bb4a59660","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-07-06T05:03:07.915233Z","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-03T23:12:04.892414Z","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:156ae165c702fc0d0c64656a47b2034929461cb20e7a617d0cdb35be45cade50","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07-06T05:03:07.915233Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}