{"as_of":"2026-08-23T22:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db0a845968b09f5a8d4c3a75bbd3d6892c2036bc704e1c1465bf6b78649d38a8","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-23T06:30:58.430688+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-08-10T18:09:16.265791Z","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.089623Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.05390","last_updated":"2022-01-14T11:03:24Z","snapshot_observed_at":"2026-08-17T08:51:57.023871Z","submitted_at":"2022-01-14T11:03:24Z","title":"Delay-Robust Routes in Temporal Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.05390","snapshot_observed_at":"2026-08-10T18:09:16.265791Z","title":"Delay- Robust Routes in Temporal Graphs , January 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.265791Z"},"links":{"cited_paper":"/paper/2201.05390","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:88800e53cd8c4f34b4aec56511f20ec80c4b7227841faeb40130ec2bae7cb72c","observation_id":"ab3c9a6a-8caa-455d-a3fc-49e07de4da41","resolution":{"observed_at":"2026-08-10T18:09:16.265791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05390","last_updated":"2022-01-14T11:03:24Z","snapshot_observed_at":"2026-08-17T08:51:57.023871Z","submitted_at":"2022-01-14T11:03:24Z","title":"Delay-Robust Routes in Temporal Graphs","version":1},"cited_work":{"arxiv_id":"2201.05390","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.05390","snapshot_observed_at":"2026-08-09T21:49:00.089623Z","title":"Delay-Robust Routes in Temporal Graphs","venue":"cs.DS","work_id":"7390050f-7058-4a45-a5c7-99c6ac2240e3","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":11,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.265484Z"},"links":{"cited_paper":"/paper/2201.05390","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:78e21237b9d7ab13a4f92e9f45e0e06fd81b13d374937d4293cc00ce7fd6adfe","observation_id":"c3684bc6-a8ab-4bb7-ad02-b8ca8d09d829","resolution":{"observed_at":"2026-08-09T21:49:00.093163Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.05390/citation-record","integrity":"/paper/2201.05390/integrity","json":"/paper/2201.05390/citation-record.json","paper":"/paper/2201.05390"},"outbound":[],"paper":{"arxiv_id":"2201.05390","last_updated":"2022-01-14T11:03:24Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T08:51:57.023871Z","submitted_at":"2022-01-14T11:03:24Z","title":"Delay-Robust Routes 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.05390."}