{"as_of":"2026-08-21T13:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7dea0df101a516d57740b0855072ab3ce7ab75d558e4bbd00a43fdd5ff47d092","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-21T06:32:19.484+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-09T21:48:59.236659Z","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-09T21:49:00.175391Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.01720","last_updated":"2024-08-30T14:18:45Z","snapshot_observed_at":"2026-08-16T16:41:36.328864Z","submitted_at":"2022-08-02T20:07:38Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs","version":4},"cited_work":{"arxiv_id":"2208.01720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.01720","snapshot_observed_at":"2026-08-09T21:49:00.175391Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs","venue":"cs.DM","work_id":"88368e38-a6bb-45e5-afbc-6a36719aeca8","year":2022},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.236659Z"},"links":{"cited_paper":"/paper/2208.01720","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:88cfc94a2e2ac3024b0f68b5b2c8783f43d7744c0667a08145963981067617a7","observation_id":"6414a389-ff14-4f5a-8430-c502ab0697b0","resolution":{"observed_at":"2026-08-09T21:49:00.179115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.01720/citation-record","integrity":"/paper/2208.01720/integrity","json":"/paper/2208.01720/citation-record.json","paper":"/paper/2208.01720"},"outbound":[],"paper":{"arxiv_id":"2208.01720","last_updated":"2024-08-30T14:18:45Z","latest_version":4,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T16:41:36.328864Z","submitted_at":"2022-08-02T20:07:38Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2208.01720."}