Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-05T15:36:03.758322Z
Paper Citation Record · LEDGER
Distributed Sparsest Cut via Eigenvalue Estimation
As of 16 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2508.19898.
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-15T06:32:42.880941+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
10 of 10 outbound references displayed
- verified exact2
- verified fuzzy1
- unresolved3
- parse uncertain0
- malformed identifier1
- metadata mismatch3
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 64a0359f-265c-4c7f-9e91-eda259cb9481 · outbound
This paper cites We investigate the numerical stability of this case.
Distributed Sparsest Cut via Eigenvalue Estimation We investigate the numerical stability of this case
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T15:36:03.988687Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation a1c6045b-2e9e-41a7-aac6-de22dbe673a3 · outbound
This paper cites Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal.
Distributed Sparsest Cut via Eigenvalue Estimation Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
Reference 55
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-05T15:36:03.955212Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation a9b14478-e5c1-43f4-988b-3c007f4a4e73 · outbound
This paper cites An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations.
Distributed Sparsest Cut via Eigenvalue Estimation An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
Reference 226
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T15:36:03.743374Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b56cdcef-7e41-4f45-afc5-9286097e8205 · outbound
This paper cites Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back.
Distributed Sparsest Cut via Eigenvalue Estimation Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back
Reference 262
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T15:36:03.811919Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation b0adc626-9653-42b5-974a-0f7c84d2f6d2 · outbound
This paper cites Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators.
Distributed Sparsest Cut via Eigenvalue Estimation Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Reference 335
- Resolution
- malformed identifier
- local_arxiv, observed 2026-08-05T15:36:03.967107Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation 2842cefa-0843-4ea1-9d98-5523308fe23c · outbound
This paper cites Nearly Maximum Flows in Nearly Linear Time.
Distributed Sparsest Cut via Eigenvalue Estimation Nearly Maximum Flows in Nearly Linear Time
Reference 2013
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T15:36:03.752748Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4d50162f-b8db-4d68-9356-d986d04c0873 · outbound
This paper cites Minimum Cost Flow in the CONGEST Model.
Distributed Sparsest Cut via Eigenvalue Estimation Minimum Cost Flow in the CONGEST Model
Reference 2015
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T15:36:03.790522Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation 7d9d46d5-f2d8-48ba-a5f9-8e45b7265d8b · outbound
This paper cites New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms.
Distributed Sparsest Cut via Eigenvalue Estimation New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
Reference 2017
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T15:36:03.740675Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 490afdcc-4556-43ad-b79a-01f81e079de3 · outbound
This paper cites Faster Parallel Algorithm for Approximate Shortest Path.
Distributed Sparsest Cut via Eigenvalue Estimation Faster Parallel Algorithm for Approximate Shortest Path
Reference 2020
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-05T15:36:03.823308Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation fff22871-acbe-450b-9349-f19b9dea75bd · outbound
This paper cites Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts.
Distributed Sparsest Cut via Eigenvalue Estimation Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
Reference 2022
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-05T15:36:03.979022Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Pith citing papers
No inbound Pith citation observations are available.