{"as_of":"2026-08-16T23:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00520e4d717e7676f4c5943556d3806ec2eb945507f275e925916172537b7460","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.730395Z","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.975338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.05151","last_updated":"2022-05-14T13:52:59Z","snapshot_observed_at":"2026-08-16T17:57:24.791259Z","submitted_at":"2021-09-11T01:45:34Z","title":"Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts","version":3},"cited_work":{"arxiv_id":"2109.05151","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.05151","snapshot_observed_at":"2026-08-05T15:36:03.975338Z","title":"Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts","venue":"cs.DC","work_id":"a9dc0828-a72e-4d1c-aa3c-3c7d59b4028f","year":2021},"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":2022,"source":"pdf_text","source_observed_at":"2026-08-05T15:36:03.730395Z"},"links":{"cited_paper":"/paper/2109.05151","citing_paper":"/paper/2508.19898"},"observation_digest":"sha256:0eef972718fbd67f9ad6e3f41bb2c16dbd31979ad2d82fc780220d7efd409640","observation_id":"fff22871-acbe-450b-9349-f19b9dea75bd","resolution":{"observed_at":"2026-08-05T15:36:03.979022Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2109.05151/citation-record","integrity":"/paper/2109.05151/integrity","json":"/paper/2109.05151/citation-record.json","paper":"/paper/2109.05151"},"outbound":[],"paper":{"arxiv_id":"2109.05151","last_updated":"2022-05-14T13:52:59Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T17:57:24.791259Z","submitted_at":"2021-09-11T01:45:34Z","title":"Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts"},"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:2109.05151."}