{"as_of":"2026-08-16T18:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c152bd430f23aec0a091f2e9ec32b1a2e21fa595cf62127d2874ccdfb193d31","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-16T06:30:59.297886+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-05T15:36:03.734093Z","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-05T15:36:03.963877Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.01956","last_updated":"2019-11-05T17:33:02Z","snapshot_observed_at":"2026-08-14T14:28:12.178125Z","submitted_at":"2019-11-05T17:33:02Z","title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","version":1},"cited_work":{"arxiv_id":"1911.01956","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.01956","snapshot_observed_at":"2026-08-05T15:36:03.963877Z","title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators","venue":"cs.DS","work_id":"2be2bc05-8190-4bd8-9de6-14b50d2bd8bc","year":2019},"citing_paper":{"arxiv_id":"2508.19898","last_updated":"2026-06-26T09:07:41Z","snapshot_observed_at":"2026-08-05T15:35:47.993121Z","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation","version":2},"reference_index":335,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.734093Z"},"links":{"cited_paper":"/paper/1911.01956","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:112e2b7ffeab8c9b4ddc26eb32ae4e43b25251b76e53c7c2bcbe63450bbb567f","observation_id":"b0adc626-9653-42b5-974a-0f7c84d2f6d2","resolution":{"observed_at":"2026-08-05T15:36:03.967107Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1911.01956/citation-record","integrity":"/paper/1911.01956/integrity","json":"/paper/1911.01956/citation-record.json","paper":"/paper/1911.01956"},"outbound":[],"paper":{"arxiv_id":"1911.01956","last_updated":"2019-11-05T17:33:02Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T14:28:12.178125Z","submitted_at":"2019-11-05T17:33:02Z","title":"Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1911.01956."}