Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T18:37:42.159809Z
Paper Citation Record · LEDGER
On Incremental Approximate Shortest Paths in Directed Graphs
As of 11 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2502.10348.
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-11T06:34:44.6726+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
45 of 45 outbound references displayed
- verified exact1
- verified fuzzy43
- unresolved1
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation cb049fc6-c2c9-4b72-ba7d-63f610bed205 · outbound
This paper cites More asymmetry yields faster matrix multiplication.
On Incremental Approximate Shortest Paths in Directed Graphs More asymmetry yields faster matrix multiplication
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.862680Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 1276b567-8ea1-48a1-b33d-589167ec22b6 · outbound
This paper cites Algorithms and hardness for diameter in dynamic graphs.
On Incremental Approximate Shortest Paths in Directed Graphs Algorithms and hardness for diameter in dynamic graphs
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.849583Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation ec30af73-b0b5-42f0-9744-bdef8f32f9fc · outbound
This paper cites Italiano, Alberto Marchetti - Spaccamela, and Umberto Nanni.
On Incremental Approximate Shortest Paths in Directed Graphs Italiano, Alberto Marchetti - Spaccamela, and Umberto Nanni
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.836077Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 5d491e7f-23fa-4a29-8195-c1dd98419768 · outbound
This paper cites Popular conjectures imply strong lower bounds for dynamic problems.
On Incremental Approximate Shortest Paths in Directed Graphs Popular conjectures imply strong lower bounds for dynamic problems
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.823989Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation d4c5a24b-e6d9-4a5e-8494-5c3c45863e44 · outbound
This paper cites Fully dynamic shortest path reporting against an adaptive adversary.
On Incremental Approximate Shortest Paths in Directed Graphs Fully dynamic shortest path reporting against an adaptive adversary
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.812758Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation fcc9ca1a-e911-4468-a05e-1c2e90b434a9 · outbound
This paper cites Consequences of faster alignment of sequences.
On Incremental Approximate Shortest Paths in Directed Graphs Consequences of faster alignment of sequences
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.799939Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation b460d8fb-4256-49cf-a12e-388a100de1ec · outbound
This paper cites Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time.
On Incremental Approximate Shortest Paths in Directed Graphs Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.788246Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation cf4e3ffb-f493-4d16-8ef0-8d3450edea35 · outbound
This paper cites Maintaining shortest paths under deletions in weighted directed graphs.
On Incremental Approximate Shortest Paths in Directed Graphs Maintaining shortest paths under deletions in weighted directed graphs
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.777177Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 3d59751d-77e8-4dd7-b6a4-fa5040d50b7f · outbound
This paper cites Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing.
On Incremental Approximate Shortest Paths in Directed Graphs Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.765492Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 1ac120f0-8449-4761-b8db-154822a6430e · outbound
This paper cites Deterministic decremental SSSP and approximate min-cost flow in almost-linear time.
On Incremental Approximate Shortest Paths in Directed Graphs Deterministic decremental SSSP and approximate min-cost flow in almost-linear time
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.752883Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation dc2fd602-78b9-43b8-88ee-5783bd3bdd80 · outbound
This paper cites Near-optimal decremental SSSP in dense weighted digraphs.
On Incremental Approximate Shortest Paths in Directed Graphs Near-optimal decremental SSSP in dense weighted digraphs
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.736884Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation de2d31de-a140-4036-84da-6071545f3c6e · outbound
This paper cites an unresolved cited work.
On Incremental Approximate Shortest Paths in Directed Graphs Unresolved cited work
Reference 12
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T18:37:42.722384Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation cce67aae-e20e-49c2-a83b-1603be626eea · outbound
This paper cites Improving viterbi is hard: Better runtimes imply faster clique algorithms.
On Incremental Approximate Shortest Paths in Directed Graphs Improving viterbi is hard: Better runtimes imply faster clique algorithms
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.709968Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 4dac278b-e4d9-4869-90a5-df9afba346b5 · outbound
This paper cites Near-optimal approximate decremental all pairs shortest paths.
On Incremental Approximate Shortest Paths in Directed Graphs Near-optimal approximate decremental all pairs shortest paths
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.696411Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation cdd9bbdb-9db8-46d2-a2e6-fe9cb002e7b6 · outbound
This paper cites Liu, Simon Meierhans, and Maximilian Probst Gutenberg.
On Incremental Approximate Shortest Paths in Directed Graphs Liu, Simon Meierhans, and Maximilian Probst Gutenberg
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.682124Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation ff4449ec-7803-42bd-b006-ddbf60bd301d · outbound
This paper cites Incremental single source shortest paths in sparse digraphs.
On Incremental Approximate Shortest Paths in Directed Graphs Incremental single source shortest paths in sparse digraphs
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.669958Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 59bdbe3a-490e-422a-b683-02993605d72a · outbound
This paper cites Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths.
On Incremental Approximate Shortest Paths in Directed Graphs Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.657511Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 2a460280-eb3c-4e35-b9a7-18486ace9da6 · outbound
This paper cites New tradeoffs for decremental approximate all-pairs shortest paths.
On Incremental Approximate Shortest Paths in Directed Graphs New tradeoffs for decremental approximate all-pairs shortest paths
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.644936Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 00ada52d-1493-41a1-ae4d-2cc5c0e1d263 · outbound
This paper cites Italiano.
On Incremental Approximate Shortest Paths in Directed Graphs Italiano
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.631688Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 9e5d352f-5ec0-42a9-8fbf-aa4349ecc56a · outbound
This paper cites Bounded-leg distance and reachability oracles.
On Incremental Approximate Shortest Paths in Directed Graphs Bounded-leg distance and reachability oracles
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.619174Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 7f57c86f-5483-4d56-90c4-0e195f30d8d6 · outbound
This paper cites Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time.
On Incremental Approximate Shortest Paths in Directed Graphs Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.606037Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation e2b8a1a4-2f75-47c0-9b1a-b08da80f808f · outbound
This paper cites Driscoll, Neil Sarnak, Daniel Dominic Sleator, and Robert Endre Tarjan.
On Incremental Approximate Shortest Paths in Directed Graphs Driscoll, Neil Sarnak, Daniel Dominic Sleator, and Robert Endre Tarjan
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.590917Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f267d42a-6871-446d-95d9-5adc50cb4504 · outbound
This paper cites An on-line edge-deletion problem.
On Incremental Approximate Shortest Paths in Directed Graphs An on-line edge-deletion problem
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.576546Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 2919eb38-efe0-4fa7-8ae9-e3f60f1dc567 · outbound
This paper cites Bootstrapping dynamic distance oracles.
On Incremental Approximate Shortest Paths in Directed Graphs Bootstrapping dynamic distance oracles
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.559538Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 374f82ff-932d-4d0b-bf1a-9e2693f14f97 · outbound
This paper cites Deterministic incremental APSP with polylogarithmic update time and stretch.
On Incremental Approximate Shortest Paths in Directed Graphs Deterministic incremental APSP with polylogarithmic update time and stretch
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.543073Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f61ad043-3c9a-425d-89d9-876c94c30f4b · outbound
This paper cites New algorithms and hardness for incremental single-source shortest paths in directed graphs.
On Incremental Approximate Shortest Paths in Directed Graphs New algorithms and hardness for incremental single-source shortest paths in directed graphs
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.523674Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 548bde8a-f9c0-4d6e-a54f-5db3aa3d093e · outbound
This paper cites Fully dynamic biconnectivity and transitive closure.
On Incremental Approximate Shortest Paths in Directed Graphs Fully dynamic biconnectivity and transitive closure
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.508134Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation e046ee53-8625-428a-92a0-f54e4aaeb4e2 · outbound
This paper cites Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs.
On Incremental Approximate Shortest Paths in Directed Graphs Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.491012Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 30e6429f-4c6c-4073-8339-9445a7d0246f · outbound
This paper cites Improved algorithms for decremental single-source reachability on directed graphs.
On Incremental Approximate Shortest Paths in Directed Graphs Improved algorithms for decremental single-source reachability on directed graphs
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.472921Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation b2a9f80f-3642-4664-ae8d-368e85c9c07d · outbound
This paper cites Dynamic deterministic constant-approximate distance oracles with n\( ^ \( \) \) worst-case update time.
On Incremental Approximate Shortest Paths in Directed Graphs Dynamic deterministic constant-approximate distance oracles with n\( ^ \( \) \) worst-case update time
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.456090Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 58a6756b-72af-48da-be01-0527196f3c3b · outbound
This paper cites Italiano.
On Incremental Approximate Shortest Paths in Directed Graphs Italiano
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.437315Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 1d51903c-c2fe-445e-a013-abaed30fe335 · outbound
This paper cites Tight dynamic problem lower bounds from generalized BMM and omv.
On Incremental Approximate Shortest Paths in Directed Graphs Tight dynamic problem lower bounds from generalized BMM and omv
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.417982Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation d6bebc74-0295-4338-8884-fcd6b25a0586 · outbound
This paper cites Reliable hubs for partially-dynamic all-pairs shortest paths in directed graphs.
On Incremental Approximate Shortest Paths in Directed Graphs Reliable hubs for partially-dynamic all-pairs shortest paths in directed graphs
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.401049Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation a3ff9043-61a1-4fdc-abd3-6b335c3a2052 · outbound
This paper cites Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs.
On Incremental Approximate Shortest Paths in Directed Graphs Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.382428Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 1813467d-0ac0-4e21-bd3d-7c1cfc16662c · outbound
This paper cites Incremental SSSP for sparse digraphs beyond the hopset barrier.
On Incremental Approximate Shortest Paths in Directed Graphs Incremental SSSP for sparse digraphs beyond the hopset barrier
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.364668Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 0face4a8-f4b8-44c6-ad97-97be2bcf746d · outbound
This paper cites A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications.
On Incremental Approximate Shortest Paths in Directed Graphs A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.347313Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation c2b24f47-29ee-42ac-9830-870b199f63af · outbound
This paper cites Ryan Williams.
On Incremental Approximate Shortest Paths in Directed Graphs Ryan Williams
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.332722Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 1d71a9ce-a188-4ee3-9fad-9080488bab92 · outbound
This paper cites Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms.
On Incremental Approximate Shortest Paths in Directed Graphs Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.318007Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 8ae3ed51-6c21-4c7c-936e-36961d8ef966 · outbound
This paper cites Fully dynamic all-pairs shortest paths: Likely optimal worst-case update time.
On Incremental Approximate Shortest Paths in Directed Graphs Fully dynamic all-pairs shortest paths: Likely optimal worst-case update time
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.302041Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 4073fbfc-0a0a-4f76-9d71-cacfe8a7eac3 · outbound
This paper cites Incremental Approximate Single-Source Shortest Paths with Predictions.
On Incremental Approximate Shortest Paths in Directed Graphs Incremental Approximate Single-Source Shortest Paths with Predictions
Reference 40
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T18:37:42.206393Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f6a9d94e-11f2-4a64-9e19-dbdaffe48abb · outbound
This paper cites On bounded leg shortest paths problems.
On Incremental Approximate Shortest Paths in Directed Graphs On bounded leg shortest paths problems
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.285872Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 79a504db-10e4-46e0-897d-23f08748f01a · outbound
This paper cites On dynamic shortest paths problems.
On Incremental Approximate Shortest Paths in Directed Graphs On dynamic shortest paths problems
Reference 42
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.271629Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 7ee300e0-8cb1-4829-8f6f-e8fb6afea5fd · outbound
This paper cites Combining all pairs shortest paths and all pairs bottleneck paths problems.
On Incremental Approximate Shortest Paths in Directed Graphs Combining all pairs shortest paths and all pairs bottleneck paths problems
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.255752Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 8c7f4e2d-ebfa-459a-815d-2d4e9345aa53 · outbound
This paper cites Fine-grained optimality of partially dynamic shortest paths and more.
On Incremental Approximate Shortest Paths in Directed Graphs Fine-grained optimality of partially dynamic shortest paths and more
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.235255Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation e6a41bd7-1f7c-44ec-8dd0-b25f171e0e4a · outbound
This paper cites Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time.
On Incremental Approximate Shortest Paths in Directed Graphs Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T18:37:42.221739Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Pith citing papers
No inbound Pith citation observations are available.