{"as_of":"2026-08-20T22:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94751f559a88d27a2906903c5672dbc3974bf73893ac9f011e0a26f7ae6774ad","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-20T06:33:59.587034+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-16T12:09:16.630091Z","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-07T15:44:32.405731Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.18513","last_updated":"2025-04-19T17:41:03Z","snapshot_observed_at":"2026-08-20T14:03:19.837798Z","submitted_at":"2024-03-27T12:44:27Z","title":"Realizing temporal transportation trees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18513","snapshot_observed_at":"2026-08-16T12:09:16.630091Z","title":"Mertzios, Hendrik Molter, Nils Morawietz, and Paul G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.630091Z"},"links":{"cited_paper":"/paper/2403.18513","citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:0e12b16f049fe5d8d531866f41a609eb45ee3a29db250ba6b8e886190dad549f","observation_id":"cac4c61a-5281-4dc6-96b4-b6160e833c70","resolution":{"observed_at":"2026-08-16T12:09:16.630091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18513","last_updated":"2025-04-19T17:41:03Z","snapshot_observed_at":"2026-08-20T14:03:19.837798Z","submitted_at":"2024-03-27T12:44:27Z","title":"Realizing temporal transportation trees","version":3},"cited_work":{"arxiv_id":"2403.18513","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.18513","snapshot_observed_at":"2026-08-07T15:44:32.405731Z","title":"Realizing temporal transportation trees","venue":"cs.DS","work_id":"f78d5c95-1977-4c5d-bcf5-357b4a2521a8","year":2024},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.831533Z"},"links":{"cited_paper":"/paper/2403.18513","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:527ac280ea6e2732aa4549f15d7c19b11275c894318fb7222a1a8477578d1419","observation_id":"943860ff-9532-4b5b-af3c-9f6e6a8a6c87","resolution":{"observed_at":"2026-08-07T15:44:32.535581Z","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/2403.18513/citation-record","integrity":"/paper/2403.18513/integrity","json":"/paper/2403.18513/citation-record.json","paper":"/paper/2403.18513"},"outbound":[],"paper":{"arxiv_id":"2403.18513","last_updated":"2025-04-19T17:41:03Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T14:03:19.837798Z","submitted_at":"2024-03-27T12:44:27Z","title":"Realizing temporal transportation trees"},"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 2 inbound Pith citation observations for arXiv:2403.18513."}