Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-06-30T14:42:45.908201Z
Paper Citation Record · LEDGER
A Tight Bound on Localization of Electrical Flows
As of 19 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2605.24130.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
3 of 3 outbound references displayed
- verified exact1
- verified fuzzy2
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 2994b9c6-3302-49b4-9ba7-ed5ccd24aa60 · outbound
This paper cites Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts: I. Anagnostides, C. Lenzen, B. Haeupler, G. Zuzic, T. Gouleakis.
A Tight Bound on Localization of Electrical Flows Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts: I. Anagnostides, C. Lenzen, B. Haeupler, G. Zuzic, T. Gouleakis
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-08T22:05:43.386830Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 9a35dc6b-3a4e-449b-8fef-e6a8bfca2f0b · outbound
This paper cites Approximate Spanning Tree Counting from Uncorrelated Edge Sets.
A Tight Bound on Localization of Electrical Flows Approximate Spanning Tree Counting from Uncorrelated Edge Sets
Reference 2
- Resolution
- verified exact
- arxiv_id, observed 2026-06-30T14:44:45.091599Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation ab5190b8-f05a-41fb-9f32-1ef3c22ec63b · outbound
This paper cites An almost-linear time algorithm for uniform random spanning tree generation.
A Tight Bound on Localization of Electrical Flows An almost-linear time algorithm for uniform random spanning tree generation
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-08T22:05:43.384785Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Pith citing papers
No inbound Pith citation observations are available.