{"as_of":"2026-08-17T11:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:67e73111be290d814de02083cbb08d126328c30fb727a4b08e073b9e0b20038a","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:51.356432Z","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":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.06806/citation-record","integrity":"/paper/1908.06806/integrity","json":"/paper/1908.06806/citation-record.json","paper":"/paper/1908.06806"},"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:51.386612Z","title":"Breadth-first search","venue":null,"work_id":"778e24c3-53e7-4b27-ba9a-a52593b83a50","year":1962},"citing_paper":{"arxiv_id":"1908.06806","last_updated":"2019-08-19T13:55:35Z","snapshot_observed_at":"2026-08-17T05:25:20.197034Z","submitted_at":"2019-08-19T13:55:35Z","title":"A New Fast Unweighted 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:51.356432Z"},"links":{"citing_paper":"/paper/1908.06806"},"observation_digest":"sha256:803c53db7f9e70acee9e9f95d795473722d2bfca190061151eae79996ef76989","observation_id":"991eea13-a69e-47ef-bd30-09bcbad86c08","resolution":{"observed_at":"2026-08-14T12:41:51.392368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"1908.06806","last_updated":"2019-08-19T13:55:35Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T05:25:20.197034Z","submitted_at":"2019-08-19T13:55:35Z","title":"A New Fast Unweighted 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-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 1 of 1 outbound references and 0 inbound Pith citation observations for arXiv:1908.06806."}