{"as_of":"2026-08-20T21:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5772b35a8628899826d2d975f7bcb47e85a7b7cd747352c53e92c948190601d1","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-20T06:33:59.587034+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-10T18:09:16.285344Z","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-10T18:09:16.377307Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.10503","last_updated":"2023-01-25T10:27:11Z","snapshot_observed_at":"2026-08-20T09:15:12.644100Z","submitted_at":"2023-01-25T10:27:11Z","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","version":1},"cited_work":{"arxiv_id":"2301.10503","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.10503","snapshot_observed_at":"2026-08-10T18:09:16.377307Z","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","venue":"cs.DS","work_id":"21acf2e0-810f-488c-8ee0-3f8a749dad30","year":2023},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.285344Z"},"links":{"cited_paper":"/paper/2301.10503","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:da7e684c0659e16b4c0d7613384312e5229b348982cc6793af65803feb2607b5","observation_id":"7f6bc768-1c7c-4cc1-bb1b-66b06eb726ae","resolution":{"observed_at":"2026-08-10T18:09:16.382422Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2301.10503/citation-record","integrity":"/paper/2301.10503/integrity","json":"/paper/2301.10503/citation-record.json","paper":"/paper/2301.10503"},"outbound":[],"paper":{"arxiv_id":"2301.10503","last_updated":"2023-01-25T10:27:11Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T09:15:12.644100Z","submitted_at":"2023-01-25T10:27:11Z","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2301.10503."}