{"as_of":"2026-08-16T04:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aee66d9839e8dfb53e839d8346cafdf25f37b548f164ddc446ba64c4ae4d8c65","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:41:43.284468Z","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-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.06798/citation-record","integrity":"/paper/1908.06798/integrity","json":"/paper/1908.06798/citation-record.json","paper":"/paper/1908.06798"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:43.382945Z","title":"Breadth-first search","venue":null,"work_id":"49dc4f9d-b350-42c2-b14b-3a03fdc5b602","year":1962},"citing_paper":{"arxiv_id":"1908.06798","last_updated":"2019-08-19T13:44:57Z","snapshot_observed_at":"2026-08-16T02:24:27.856122Z","submitted_at":"2019-08-19T13:44:57Z","title":"A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:43.284468Z"},"links":{"citing_paper":"/paper/1908.06798"},"observation_digest":"sha256:8d0e552cfa954190746856d74f69f0a71c1a59373230cb2a16669e9c94ba5c76","observation_id":"cba4d431-b680-4da1-ad39-d1aa82d70ccb","resolution":{"observed_at":"2026-08-14T12:41:43.395744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06798","last_updated":"2019-08-19T13:44:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T02:24:27.856122Z","submitted_at":"2019-08-19T13:44:57Z","title":"A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":1},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 1 of 1 outbound references and 0 inbound Pith citation observations for arXiv:1908.06798."}