Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.12993.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T16:21:13.077839Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-06T16:21:13.243976Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation c8610172-6c83-4b00-9e91-37c6d055b2f8 · inbound
FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data cites this paper.
FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
Reference 4
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T16:21:13.248258Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.