{"as_of":"2026-08-18T23:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7d7510470c372e0353166ff0cdbac28782c483009cd5678e0135c1282bc6c1b","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-06-30T14:42:45.908201Z","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-18T06:34:40.430872+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/2605.24130/citation-record","integrity":"/paper/2605.24130/integrity","json":"/paper/2605.24130/citation-record.json","paper":"/paper/2605.24130"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T22:05:43.385414Z","title":"Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts: I. Anagnostides, C. Lenzen, B. Haeupler, G. Zuzic, T. Gouleakis","venue":null,"work_id":"26c21d4f-02d4-47eb-856f-85832b332bd3","year":2023},"citing_paper":{"arxiv_id":"2605.24130","last_updated":"2026-05-22T18:48:17Z","snapshot_observed_at":"2026-08-08T08:30:35.337899Z","submitted_at":"2026-05-22T18:48:17Z","title":"A Tight Bound on Localization of Electrical Flows","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T14:42:45.908201Z"},"links":{"citing_paper":"/paper/2605.24130"},"observation_digest":"sha256:b8a1dde1c14e09894abc673568188ce2dff4f3c244dfc4354de20a9ab090f47f","observation_id":"2994b9c6-3302-49b4-9ba7-ed5ccd24aa60","resolution":{"observed_at":"2026-07-08T22:05:43.386830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14666","last_updated":"2025-05-20T17:54:15Z","snapshot_observed_at":"2026-08-07T20:41:31.799017Z","submitted_at":"2025-05-20T17:54:15Z","title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","version":1},"cited_work":{"arxiv_id":"2505.14666","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14666","snapshot_observed_at":"2026-06-30T14:44:45.089768Z","title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","venue":null,"work_id":"497fcabb-d259-4033-a9a7-51fdabcd2ef4","year":2017},"citing_paper":{"arxiv_id":"2605.24130","last_updated":"2026-05-22T18:48:17Z","snapshot_observed_at":"2026-08-08T08:30:35.337899Z","submitted_at":"2026-05-22T18:48:17Z","title":"A Tight Bound on Localization of Electrical Flows","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T14:42:45.908201Z"},"links":{"cited_paper":"/paper/2505.14666","citing_paper":"/paper/2605.24130"},"observation_digest":"sha256:bb6ac9b0abfb46478aefb2613cb366d26e8b73bdd72005f10dc2b03f32a03e7d","observation_id":"9a35dc6b-3a4e-449b-8fef-e6a8bfca2f0b","resolution":{"observed_at":"2026-06-30T14:44:45.091599Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-08T22:05:43.383549Z","title":"An almost-linear time algorithm for uniform random spanning tree generation","venue":null,"work_id":"5dad8308-97d9-4b79-8e0e-d7278b9794d9","year":1998},"citing_paper":{"arxiv_id":"2605.24130","last_updated":"2026-05-22T18:48:17Z","snapshot_observed_at":"2026-08-08T08:30:35.337899Z","submitted_at":"2026-05-22T18:48:17Z","title":"A Tight Bound on Localization of Electrical Flows","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T14:42:45.908201Z"},"links":{"citing_paper":"/paper/2605.24130"},"observation_digest":"sha256:20ab81dcdaaa0ba267324e9feecde37b755159e8ada9df188a28d4d7c15611da","observation_id":"ab5190b8-f05a-41fb-9f32-1ef3c22ec63b","resolution":{"observed_at":"2026-07-08T22:05:43.384785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.24130","last_updated":"2026-05-22T18:48:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T08:30:35.337899Z","submitted_at":"2026-05-22T18:48:17Z","title":"A Tight Bound on Localization of Electrical Flows"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2605.24130."}