{"as_of":"2026-08-17T19:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:50dd30216e68b89d0b008dd8776eacb5d9bf8ba0e44235906fc2d8d825c2ba63","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-17T06:30:58.91139+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-16T00:36:54.451391Z","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-16T00:36:54.501484Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.00553","last_updated":"2017-10-29T15:15:14Z","snapshot_observed_at":"2026-08-14T20:36:45.584876Z","submitted_at":"2017-09-02T09:55:18Z","title":"Dynamic Shortest Path and Transitive Closure Algorithms: A Survey","version":2},"cited_work":{"arxiv_id":"1709.00553","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.00553","snapshot_observed_at":"2026-08-16T00:36:54.501484Z","title":"Dynamic Shortest Path and Transitive Closure Algorithms: A Survey","venue":"cs.DS","work_id":"0d69cc78-bfc7-41e7-a983-b292869a0388","year":2017},"citing_paper":{"arxiv_id":"2608.11641","last_updated":"2026-08-12T04:40:48Z","snapshot_observed_at":"2026-08-17T09:34:21.815153Z","submitted_at":"2026-08-12T04:40:48Z","title":"Energy-Aware Wind-Resilient Routing for Truck-Assisted Multi-UAV Delivery under Wind Uncertainty","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:36:54.451391Z"},"links":{"cited_paper":"/paper/1709.00553","citing_paper":"/paper/2608.11641"},"observation_digest":"sha256:631bf9b982f22b2ca5abcad3b4f589fac34f4836c93007993de27cade24de8a2","observation_id":"3c18726e-4497-4a5e-b2d2-17b41c4699e9","resolution":{"observed_at":"2026-08-16T00:36:54.506729Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1709.00553/citation-record","integrity":"/paper/1709.00553/integrity","json":"/paper/1709.00553/citation-record.json","paper":"/paper/1709.00553"},"outbound":[],"paper":{"arxiv_id":"1709.00553","last_updated":"2017-10-29T15:15:14Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T20:36:45.584876Z","submitted_at":"2017-09-02T09:55:18Z","title":"Dynamic Shortest Path and Transitive Closure Algorithms: A Survey"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1709.00553."}