{"as_of":"2026-08-16T09:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1424b09d72c38d0b0c1f86ffff865ddb48230f414f6cbdb551921404e19c4af","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:55:22.245548Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.06460/citation-record","integrity":"/paper/1908.06460/integrity","json":"/paper/1908.06460/citation-record.json","paper":"/paper/1908.06460"},"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:55:22.310233Z","title":null,"venue":null,"work_id":"36dea390-1de8-48c4-a568-090f9d2d0c33","year":null},"citing_paper":{"arxiv_id":"1908.06460","last_updated":"2019-08-18T15:15:38Z","snapshot_observed_at":"2026-08-16T02:25:00.932440Z","submitted_at":"2019-08-18T15:15:38Z","title":"A New k-Shortest Path Search Approach based on Graph Reduction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:22.234908Z"},"links":{"citing_paper":"/paper/1908.06460"},"observation_digest":"sha256:07de590764c8167ffc3cf7b3c9ecbcde6607ce17e8c5a174a84e0a7f1381e8fe","observation_id":"13bed307-28c5-4570-86e0-e14461320ca7","resolution":{"observed_at":"2026-08-14T12:55:22.314786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"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:55:22.295227Z","title":"The path from 𝑠 is enqueued into 𝑄","venue":null,"work_id":"3251b975-166b-438c-be3e-3959738d3205","year":null},"citing_paper":{"arxiv_id":"1908.06460","last_updated":"2019-08-18T15:15:38Z","snapshot_observed_at":"2026-08-16T02:25:00.932440Z","submitted_at":"2019-08-18T15:15:38Z","title":"A New k-Shortest Path Search Approach based on Graph Reduction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:22.240467Z"},"links":{"citing_paper":"/paper/1908.06460"},"observation_digest":"sha256:35651b555d3fd92fffcf15a21b232d5549fe049e4f69851e041d6daaf5231f41","observation_id":"87290cea-8915-4c0e-a5e8-e7e1913e1dcf","resolution":{"observed_at":"2026-08-14T12:55:22.300263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"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:55:22.277160Z","title":"𝑄 only keeps the top-𝑘 shortest paths","venue":null,"work_id":"859ca251-6ef5-42c0-8e21-0b861fe2a346","year":null},"citing_paper":{"arxiv_id":"1908.06460","last_updated":"2019-08-18T15:15:38Z","snapshot_observed_at":"2026-08-16T02:25:00.932440Z","submitted_at":"2019-08-18T15:15:38Z","title":"A New k-Shortest Path Search Approach based on Graph Reduction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:22.245548Z"},"links":{"citing_paper":"/paper/1908.06460"},"observation_digest":"sha256:a442e1993a3cb917078f94d671acd100f7e3637ed491375e4df11a00b64c534f","observation_id":"6bf283df-9387-4455-83cb-204665e548ce","resolution":{"observed_at":"2026-08-14T12:55:22.284001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06460","last_updated":"2019-08-18T15:15:38Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T02:25:00.932440Z","submitted_at":"2019-08-18T15:15:38Z","title":"A New k-Shortest Path Search Approach based on Graph Reduction"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":3},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:1908.06460."}