Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:44:11.207176Z
Paper Citation Record · LEDGER
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
As of 8 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2506.07571.
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-07T06:34:17.273281+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
32 of 32 outbound references displayed
- verified exact10
- verified fuzzy2
- unresolved16
- parse uncertain0
- malformed identifier0
- metadata mismatch4
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 84fa77a8-aa0a-4c5b-bd14-6d565dd17cc6 · outbound
This paper cites Agarwal, Matthew J.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Agarwal, Matthew J
Reference 1
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:13.803065Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f91b5fd4-e03a-4fab-a131-2f49d4bdd6c3 · outbound
This paper cites Improved bounds for the union of locally fat objects in the plane.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Improved bounds for the union of locally fat objects in the plane
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:06.968449Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7c8601b9-4e42-40e9-ad32-08bbd2034d3f · outbound
This paper cites an unresolved cited work.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Unresolved cited work
Reference 3
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-07T05:44:15.819959Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8c0f48d1-dfa8-4663-887b-0a7ebae90ce0 · outbound
This paper cites Shortest paths in intersection graphs of unit disks.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Shortest paths in intersection graphs of unit disks
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:07.228243Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1fbf9f47-3112-4ccc-aded-dbe101e7e506 · outbound
This paper cites an unresolved cited work.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Unresolved cited work
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:07.404092Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bd3ea6ed-fc92-4085-8cec-b31e9ba38dfb · outbound
This paper cites an unresolved cited work.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Unresolved cited work
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:07.565406Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a2625332-c3b1-4e3f-849f-b1b821ee661d · outbound
This paper cites an unresolved cited work.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Unresolved cited work
Reference 7
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:13.556036Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 50ab4bfe-faa9-4ed9-8089-032a1aba7c82 · outbound
This paper cites Chan and Zhengcheng Huang.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Chan and Zhengcheng Huang
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:07.811580Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 08e84b1e-261b-4387-8ebd-a0fc927eda9e · outbound
This paper cites Chan and Dimitrios Skrepetos.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Chan and Dimitrios Skrepetos
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:07.952589Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 183c29d9-3fc8-46d7-a717-82daa1b295da · outbound
This paper cites Chan and Dimitrios Skrepetos.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Chan and Dimitrios Skrepetos
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:08.100197Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 07adc9bd-a4a6-4aed-8da1-cd7e8109ad68 · outbound
This paper cites An optimal algorithm for intersecting three-dimensional convex polyhedra.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs An optimal algorithm for intersecting three-dimensional convex polyhedra
Reference 11
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:13.256858Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 1838a3f1-57cb-4a80-9089-4123aeb28da6 · outbound
This paper cites An optimal algorithm for intersecting line segments in the plane.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs An optimal algorithm for intersecting line segments in the plane
Reference 12
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-07T05:44:15.419898Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 5415914f-a661-4e55-ac2e-50916ac0eeab · outbound
This paper cites an unresolved cited work.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Unresolved cited work
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:08.526032Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 61f9b01e-1a76-463e-8c6e-3ee55e517eef · outbound
This paper cites Cormen, Charles E.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Cormen, Charles E
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:44:16.392239Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fa07d1b5-bf5c-4765-8da4-055a82c69a01 · outbound
This paper cites van Kreveld, and Mark H.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs van Kreveld, and Mark H
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:08.835613Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 068b2e24-2de6-4c3a-921b-fb5a7f659eef · outbound
This paper cites Algorithms in Combinatorial Geometry , volume 10 of EATCS Monographs on Theoretical Computer Science.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Algorithms in Combinatorial Geometry , volume 10 of EATCS Monographs on Theoretical Computer Science
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:08.988182Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 242f80b2-6a9c-4dbe-91ef-618415f3971b · outbound
This paper cites Guibas, and Jorge Stolfi.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Guibas, and Jorge Stolfi
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:09.149680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d7897ecb-4296-4bb6-9ddd-0669d4561aba · outbound
This paper cites an unresolved cited work.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Unresolved cited work
Reference 18
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:12.935379Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4368f696-99ee-4229-b511-93b1db0dabc3 · outbound
This paper cites Goodrich, and Jonathan Z.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Goodrich, and Jonathan Z
Reference 19
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:12.664874Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 36ae5a55-d2a7-481d-8857-b4354d9d9013 · outbound
This paper cites New lower bounds for H opcroft's problem.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs New lower bounds for H opcroft's problem
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:09.550357Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b1748580-c080-433c-954d-c2bba35e2596 · outbound
This paper cites A sweepline algorithm for V oronoi diagrams.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs A sweepline algorithm for V oronoi diagrams
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:09.658298Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 45b80c4b-b1a8-4f4f-b354-57ae910b7ee3 · outbound
This paper cites Algorithms for Fat Objects: Decompositions and Applications.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Algorithms for Fat Objects: Decompositions and Applications
Reference 22
- Resolution
- verified exact
- raw_fallback, observed 2026-08-07T05:44:15.058061Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0f55125f-0262-4b58-886b-bfa5fdf1302f · outbound
This paper cites Guibas and Jorge Stolfi.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Guibas and Jorge Stolfi
Reference 23
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-07T05:44:14.752645Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b6f89802-98d7-4215-afa6-49bbc9030e86 · outbound
This paper cites Geometric approximation algorithms , volume 173 of Mathematical Surveys and Monographs.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Geometric approximation algorithms , volume 173 of Mathematical Surveys and Monographs
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:10.032920Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 442d95de-335f-4814-af6b-edca75d458c1 · outbound
This paper cites Dynamic planar V oronoi diagrams for general distance functions and their algorithmic applications.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Dynamic planar V oronoi diagrams for general distance functions and their algorithmic applications
Reference 25
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:12.386310Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 619d5d8a-7bcf-4719-8939-6f21dae69f95 · outbound
This paper cites Kirkpatrick.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Kirkpatrick
Reference 26
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:12.083674Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8417575b-c0eb-4e3c-903c-59519335ee2d · outbound
This paper cites An algorithmic framework for the single source shortest path problem with applications to disk graphs.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs An algorithmic framework for the single source shortest path problem with applications to disk graphs
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:10.561189Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4bdf2cbf-dd00-412b-9a83-4293236c7110 · outbound
This paper cites Nearly optimal planar k nearest neighbors queries under general distance functions.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Nearly optimal planar k nearest neighbors queries under general distance functions
Reference 28
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:11.772249Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d9d1b702-816c-4539-9353-931554448aaf · outbound
This paper cites Lectures on Discrete Geometry , volume 212 of Graduate Texts in Mathematics.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Lectures on Discrete Geometry , volume 212 of Graduate Texts in Mathematics
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:44:16.110673Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 45fac9b7-4e6e-4045-a7fd-595fa0f9d5fe · outbound
This paper cites A fast planar partition algorithm, II.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs A fast planar partition algorithm, II
Reference 30
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-07T05:44:14.278358Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 06c90625-3aa6-47c6-8899-9c8605d92357 · outbound
This paper cites On bounded leg shortest paths problems.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs On bounded leg shortest paths problems
Reference 31
- Resolution
- verified exact
- doi, observed 2026-08-07T05:44:11.498819Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 39a418fe-eba0-4e6d-bd1b-6042eaf224f9 · outbound
This paper cites Willard and George S.
An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs Willard and George S
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:44:11.207176Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.