{"as_of":"2026-08-22T19:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5d5b778fad6bf7bfb65509b812f969b5bf0a163ee5d276037e2cb5dc517d0f0","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:27:58.808353Z","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-08-14T05:27:58.947513Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.10153","last_updated":"2017-08-09T12:51:07Z","snapshot_observed_at":"2026-08-14T20:50:34.271053Z","submitted_at":"2017-06-30T11:49:41Z","title":"Parameterized Complexity of CSP for Infinite Constraint Languages","version":4},"cited_work":{"arxiv_id":"1706.10153","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.10153","snapshot_observed_at":"2026-08-14T05:27:58.947513Z","title":"Parameterized Complexity of CSP for Infinite Constraint Languages","venue":"cs.CC","work_id":"992072a8-194c-4d1e-a804-5f7977c3f4bd","year":2017},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.808353Z"},"links":{"cited_paper":"/paper/1706.10153","citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:ea8a83b18c6dfabb804b195a539d3dcb2e5497f1812587e32a6602d49e25b6cc","observation_id":"b8c92cd6-7ab2-465a-996b-22903808e9ef","resolution":{"observed_at":"2026-08-14T05:27:58.954667Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1706.10153/citation-record","integrity":"/paper/1706.10153/integrity","json":"/paper/1706.10153/citation-record.json","paper":"/paper/1706.10153"},"outbound":[],"paper":{"arxiv_id":"1706.10153","last_updated":"2017-08-09T12:51:07Z","latest_version":4,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-14T20:50:34.271053Z","submitted_at":"2017-06-30T11:49:41Z","title":"Parameterized Complexity of CSP for Infinite Constraint Languages"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1706.10153."}