Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T15:45:35.872365Z
Paper Citation Record · LEDGER
Approximate Spanning Tree Counting from Uncorrelated Edge Sets
As of 18 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 1 inbound Pith citation observation for arXiv:2505.14666.
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-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-30T14:42:45.908201Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-06-30T14:44:45.089768Z
Reference resolution
19 of 19 outbound references displayed
- verified exact2
- verified fuzzy10
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch5
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation b19449dd-499f-4a34-8f62-b22cf586c106 · outbound
This paper cites Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:39.612295Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 646ae3ac-9245-4f6a-803d-6aa7aa94bada · outbound
This paper cites Bipartite matching in nearly-linear time on moderately dense graphs.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Bipartite matching in nearly-linear time on moderately dense graphs
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:39.333069Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation d661e331-4333-473f-afbe-373bacbd8ab0 · outbound
This paper cites an unresolved cited work.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Unresolved cited work
Reference 7
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T15:45:39.033869Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation c7459970-3b76-41f3-854f-9e3d89ca2c96 · outbound
This paper cites Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees
Reference 11
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-07T15:45:37.352070Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 1886dc79-9335-480e-9225-1ae2a9d941fe · outbound
This paper cites Minor Sparsifiers and the Distributed Laplacian Paradigm.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Minor Sparsifiers and the Distributed Laplacian Paradigm
Reference 12
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-07T15:45:37.174810Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 82537b80-a2a9-4541-be1f-958d6fbc71bd · outbound
This paper cites Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
Reference 13
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T15:45:37.025286Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 048ecc44-8d90-4dfd-bafa-22e6b752bc13 · outbound
This paper cites An almost-linear time algorithm for uniform random spanning tree generation.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets An almost-linear time algorithm for uniform random spanning tree generation
Reference 17
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-07T15:45:36.767882Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 15ee78a5-23a6-4ae0-865a-2a13e535aeeb · outbound
This paper cites Localization of Electrical Flows.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Localization of Electrical Flows
Reference 18
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T15:45:36.514529Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation c62afea8-e0bc-4467-8c46-36d582f0d481 · outbound
This paper cites Modified log-sobolev inequalities for strongly log-concave distributions.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Modified log-sobolev inequalities for strongly log-concave distributions
Reference 1989
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:38.732264Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 02b8a6d5-5877-4adc-ae8b-a6eb47881a87 · outbound
This paper cites Spectral subspace sparsification.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Spectral subspace sparsification
Reference 1993
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:38.347679Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 0e51a701-2140-4d2a-833e-680c7d342ebd · outbound
This paper cites Kelner and Aleksander Madry.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Kelner and Aleksander Madry
Reference 2006
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:38.562253Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 9a1da9d4-e75b-4b52-bf76-abeae3a33e71 · outbound
This paper cites [V+13] Nisheeth K Vishnoi et al.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets [V+13] Nisheeth K Vishnoi et al
Reference 2014
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T15:45:35.872365Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 556c47f4-8277-46ff-b04f-093554a24c81 · outbound
This paper cites Sampling Random Spanning Trees Faster than Matrix Multiplication.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Sampling Random Spanning Trees Faster than Matrix Multiplication
Reference 2017
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-07T15:45:37.555859Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation fe315bef-0226-43aa-9109-2b2e1dd0757c · outbound
This paper cites Fast generation of random spanning trees and the effective resistance metric.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Fast generation of random spanning trees and the effective resistance metric
Reference 2018
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:38.160698Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 5426fb60-b72e-4333-ab90-1cbe8788e3e7 · outbound
This paper cites Liu, and Thuy-Duong Vuong.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Liu, and Thuy-Duong Vuong
Reference 2019
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:39.853331Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation b8bd2a27-387b-4dc3-ae89-1cfeb9ba23e5 · outbound
This paper cites Domain spar- sification of discrete distributions using entropic independence.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Domain spar- sification of discrete distributions using entropic independence
Reference 2020
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:40.775412Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation a3af403e-04a1-4258-b4c5-ab943b59816b · outbound
This paper cites Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
Reference 2021
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:40.324880Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 6d6aa6d0-c6dc-4c4f-bd14-f0ba3818f706 · outbound
This paper cites Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
Reference 2022
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T15:45:40.475496Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation c53df55a-c08a-4ded-b0e2-b5ccf124829d · outbound
This paper cites Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
Reference 2023
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-07T15:45:37.846323Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Pith citing papers
Observation 9a35dc6b-3a4e-449b-8fef-e6a8bfca2f0b · inbound
A Tight Bound on Localization of Electrical Flows cites this paper.
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-18T06:34:40.430872+00:00.