Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T14:26:05.887587Z
Paper Citation Record · LEDGER
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
As of 21 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.03473.
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-21T06:32:19.484+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
21 of 21 outbound references displayed
- verified exact0
- verified fuzzy15
- unresolved6
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 59fa2c29-5980-4e61-a3b0-ec625dacd4e2 · outbound
This paper cites Cattaneo, P.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Cattaneo, P
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.180545Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation e8250751-f6d1-49de-a3b7-69248d5c17cd · outbound
This paper cites Chin and D.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Chin and D
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.167596Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation ae7e555d-fc71-4370-be24-ba1df8409efa · outbound
This paper cites an unresolved cited work.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:26:06.154909Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation a8d5bf3c-42c9-4d41-a37a-eb0adfbdc9e2 · outbound
This paper cites Das and M.C.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Das and M.C
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.142367Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 51d7d69c-3510-40f5-b0f9-c162b1d64c55 · outbound
This paper cites Frederickson.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Frederickson
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.129424Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 21487b38-8b2d-4f8d-9657-7b594e78cea1 · outbound
This paper cites Gabow and R.E.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Gabow and R.E
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.116486Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation cc268f6b-2073-4a11-b5cc-53d46058721f · outbound
This paper cites Gabow and R.E.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Gabow and R.E
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.104368Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 65bb9238-273e-4941-bb35-6a0f7267e77c · outbound
This paper cites Henzinger and V.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Henzinger and V
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.092115Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation dd991f6f-c28a-45df-9ccb-f41819119ecf · outbound
This paper cites an unresolved cited work.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Unresolved cited work
Reference 9
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:26:06.078719Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation c68dff55-b4fb-4936-8a86-8ea1f0913a2d · outbound
This paper cites Hsu, R.-H.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Hsu, R.-H
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.064818Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 8a25e402-1f09-4a4c-947f-d7fb373dd142 · outbound
This paper cites Iwano and N.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Iwano and N
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.050953Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation f058f841-77b9-4751-aa2a-0c98bb5f6e2a · outbound
This paper cites Karger, P.N.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Karger, P.N
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.037612Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 7edaad9f-d3fb-4cd8-b8a7-40932aed9a15 · outbound
This paper cites Katajainen and J.L.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Katajainen and J.L
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.025756Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 72138d4b-d412-4240-9d9c-5bcff6fa0bd3 · outbound
This paper cites Kooshesh and R.R.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Kooshesh and R.R
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.013877Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 6ef4ad12-0b40-4676-86cf-1b1a2fbff6a3 · outbound
This paper cites Kruskal, Jr.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Kruskal, Jr
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:06.000960Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation da530f1b-12dd-4148-9851-232682dc9981 · outbound
This paper cites an unresolved cited work.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Unresolved cited work
Reference 16
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:26:05.986710Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 05a19247-6fd3-4927-b736-b04cc185ab78 · outbound
This paper cites an unresolved cited work.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Unresolved cited work
Reference 17
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:26:05.972593Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 78e6c9c0-c3ca-4678-b6ca-2c13a4f38139 · outbound
This paper cites Spira and A.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Spira and A
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:05.959217Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 8a5faf74-0df8-4a74-b1ec-8d2490328578 · outbound
This paper cites Suraweera, P.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Suraweera, P
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:26:05.945265Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 60f648bc-5bcc-4b6f-9e0e-90169882b494 · outbound
This paper cites an unresolved cited work.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Unresolved cited work
Reference 20
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:26:05.933225Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 05bf9cbb-5b3d-4128-a086-b0041db4cdf2 · outbound
This paper cites an unresolved cited work.
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Unresolved cited work
Reference 21
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:26:05.919783Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Pith citing papers
No inbound Pith citation observations are available.