{"as_of":"2026-08-12T18:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6bccf6457f9a5360087172ba9e3243e12619b36b47771296ce94ada81ba8ab9","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-12T06:34:41.77262+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-07-31T17:52:58.439061Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.03011","last_updated":"2024-01-05T15:59:06Z","snapshot_observed_at":"2026-08-07T10:45:49.754336Z","submitted_at":"2024-01-05T15:59:06Z","title":"A Note on the Complexity of Graph Recoloring","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03011","snapshot_observed_at":"2026-07-31T17:52:58.439061Z","title":"Computing Research Repository , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28099","last_updated":"2026-07-30T12:10:08Z","snapshot_observed_at":"2026-08-12T11:57:06.051053Z","submitted_at":"2026-07-30T12:10:08Z","title":"Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-31T17:52:58.439061Z"},"links":{"cited_paper":"/paper/2401.03011","citing_paper":"/paper/2607.28099"},"observation_digest":"sha256:5b18b6298f960fc9622184c4782b6a6962ee28a718a73387660d7e01e34ae2b1","observation_id":"01d91434-f716-4544-8b0e-7149820a5ba9","resolution":{"observed_at":"2026-07-31T17:52:58.439061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.03011/citation-record","integrity":"/paper/2401.03011/integrity","json":"/paper/2401.03011/citation-record.json","paper":"/paper/2401.03011"},"outbound":[],"paper":{"arxiv_id":"2401.03011","last_updated":"2024-01-05T15:59:06Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T10:45:49.754336Z","submitted_at":"2024-01-05T15:59:06Z","title":"A Note on the Complexity of Graph Recoloring"},"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 1 inbound Pith citation observation for arXiv:2401.03011."}