Paper Citation Record · LEDGER

Incremental Approximate Single-Source Shortest Paths with Predictions

As of 12 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 1 inbound Pith citation observation for arXiv:2502.08125.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.08125 v1

Coverage vector

measured 47 of 47 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T10:55:25.924794Z

measured 48 of 48 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T18:37:42.131811Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-07T18:37:42.198411Z

Reference resolution

47 of 47 outbound references displayed

verified exact1
verified fuzzy46
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 598ecbfd-7a84-4fc6-96ea-b07cef3626cc · outbound

This paper cites Sorting with predic tions.

Incremental Approximate Single-Source Shortest Paths with Predictions Sorting with predic tions

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.443504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6d131348-a763-4aa9-8848-24408a808f4b · outbound

This paper cites Learning-augment ed priority queues.

Incremental Approximate Single-Source Shortest Paths with Predictions Learning-augment ed priority queues

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.434170Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 9865e98e-18ca-4b13-979d-cf64ae6938d4 · outbound

This paper cites Bercea, Jakob Bæk Tejs Houen, and Rasmus Pagh.

Incremental Approximate Single-Source Shortest Paths with Predictions Bercea, Jakob Bæk Tejs Houen, and Rasmus Pagh

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.424028Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a71b5df4-57ff-4385-ad3e-f842844b74b4 · outbound

This paper cites Fully dynamic (2+ ε) approximate all-pairs shortest paths with fast query and close to linear update time.

Incremental Approximate Single-Source Shortest Paths with Predictions Fully dynamic (2+ ε) approximate all-pairs shortest paths with fast query and close to linear update time

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.413705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8acb7b1b-5250-4c09-b2a9-b6b0d446bf95 · outbound

This paper cites Maintaining shortest paths under dele tions in weighted directed graphs.

Incremental Approximate Single-Source Shortest Paths with Predictions Maintaining shortest paths under dele tions in weighted directed graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.401762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c6fe0b8b-1490-4dd6-ad0b-008aa158d90c · outbound

This paper cites Deterministic decremental SSSP and approximate min-cost ﬂow in almost-li near time.

Incremental Approximate Single-Source Shortest Paths with Predictions Deterministic decremental SSSP and approximate min-cost ﬂow in almost-li near time

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.391349Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1a32d30e-406f-44a7-8002-09c8e7ce0782 · outbound

This paper cites Near-optimal decre- mental SSSP in dense weighted digraphs.

Incremental Approximate Single-Source Shortest Paths with Predictions Near-optimal decre- mental SSSP in dense weighted digraphs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.380469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 7e3bd53f-8359-439b-bcfd-b2e193875917 · outbound

This paper cites Adaptive probing policies for shortest path routing.

Incremental Approximate Single-Source Shortest Paths with Predictions Adaptive probing policies for shortest path routing

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.369029Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 48430694-0415-40e1-ae93-abd88fd44c71 · outbound

This paper cites Incremental single sour ce shortest paths in sparse digraphs.

Incremental Approximate Single-Source Shortest Paths with Predictions Incremental single sour ce shortest paths in sparse digraphs

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.358238Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f5d1bffe-3717-485e-86af-e7bcb66dbd79 · outbound

This paper cites On the Power of Learning-Augmented Search Trees.

Incremental Approximate Single-Source Shortest Paths with Predictions On the Power of Learning-Augmented Search Trees

Reference 10

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:55:25.958941Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3c7db9a7-cf25-44c8-a225-2137647ad7f7 · outbound

This paper cites From WiscKey to Bourbon: A learned index for log-structured merge trees.

Incremental Approximate Single-Source Shortest Paths with Predictions From WiscKey to Bourbon: A learned index for log-structured merge trees

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.346966Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 500d7769-1f59-4884-a7ac-76b113cfa949 · outbound

This paper cites Predictive ﬂows for faster ford-fulkerson.

Incremental Approximate Single-Source Shortest Paths with Predictions Predictive ﬂows for faster ford-fulkerson

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.335828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2096b127-befc-4f7d-9774-25402e891cba · outbound

This paper cites ALEX: an updatable adaptive learned index.

Incremental Approximate Single-Source Shortest Paths with Predictions ALEX: an updatable adaptive learned index

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.324030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c1c2fe9c-b6e3-4898-bee8-be3c4e29fb6e · outbound

This paper cites Binary search with distributional p redictions.

Incremental Approximate Single-Source Shortest Paths with Predictions Binary search with distributional p redictions

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.312127Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0e9e5f3c-2986-48f9-b81c-3de33a0e98db · outbound

This paper cites Faster matchings via learned duals.

Incremental Approximate Single-Source Shortest Paths with Predictions Faster matchings via learned duals

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.301183Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation cf16921f-05d7-480c-9d1a-1f37b5b3d491 · outbound

This paper cites learning.

Incremental Approximate Single-Source Shortest Paths with Predictions learning

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.291221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3a50e329-999b-4c43-9362-19af217c520a · outbound

This paper cites Deterministic algorithms for decre- mental approximate shortest paths: Faster and simpler.

Incremental Approximate Single-Source Shortest Paths with Predictions Deterministic algorithms for decre- mental approximate shortest paths: Faster and simpler

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.281264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2fff3f0d-c84e-4fff-bec3-e5fa8e652712 · outbound

This paper cites Sublinear-time decremental algorithms for single-source reachability and shortest pa ths on directed graphs.

Incremental Approximate Single-Source Shortest Paths with Predictions Sublinear-time decremental algorithms for single-source reachability and shortest pa ths on directed graphs

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.271430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 068d3034-7ecc-40f5-ba61-718603201a76 · outbound

This paper cites Improved algorithms for decremental single-source reachability on directed gr aphs.

Incremental Approximate Single-Source Shortest Paths with Predictions Improved algorithms for decremental single-source reachability on directed gr aphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.259019Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 55bd8bc1-dba7-4034-9635-47596661f7c9 · outbound

This paper cites Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and de randomization.

Incremental Approximate Single-Source Shortest Paths with Predictions Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and de randomization

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.247931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3738772d-0c7f-4f93-8b0a-1c8e24a56cff · outbound

This paper cites Seybold, and Ch ristopher Y e.

Incremental Approximate Single-Source Shortest Paths with Predictions Seybold, and Ch ristopher Y e

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.237637Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fc88f56d-586e-4729-befb-c7f203253428 · outbound

This paper cites Fully dynamic biconnectivity and transitive closure.

Incremental Approximate Single-Source Shortest Paths with Predictions Fully dynamic biconnectivity and transitive closure

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.227293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation cd88e2ac-6852-4279-8338-5857da92cbab · outbound

This paper cites Learning-based frequency estimation algorithms.

Incremental Approximate Single-Source Shortest Paths with Predictions Learning-based frequency estimation algorithms

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.217396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f3154460-665b-4482-a52b-c4b5565f6f8f · outbound

This paper cites Online page migration with ML advice.

Incremental Approximate Single-Source Shortest Paths with Predictions Online page migration with ML advice

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.208031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2f7a9cb2-1578-4f93-a9ac-8a9eb6be599b · outbound

This paper cites Onlin e algorithms for weighted paging with predictions.

Incremental Approximate Single-Source Shortest Paths with Predictions Onlin e algorithms for weighted paging with predictions

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.197662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 20589312-253f-4cda-9b54-5ee922985cfd · outbound

This paper cites Chi, Jeffrey Dean, and Neo klis Polyzotis.

Incremental Approximate Single-Source Shortest Paths with Predictions Chi, Jeffrey Dean, and Neo klis Polyzotis

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.188048Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fe0acc77-4c29-4b24-a893-4cddacd33bd4 · outbound

This paper cites Incremental sssp for sparse digraphs beyond the hopset barrier.

Incremental Approximate Single-Source Shortest Paths with Predictions Incremental sssp for sparse digraphs beyond the hopset barrier

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.177316Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dcc5d991-8d14-4eec-8637-748f38fa98c3 · outbound

This paper cites Speeding up bellman ford via minimum vi- olation permutations.

Incremental Approximate Single-Source Shortest Paths with Predictions Speeding up bellman ford via minimum vi- olation permutations

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.166950Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1747e776-5892-4d4d-bebd-6ae16b7ee1f1 · outbound

This paper cites Learning aug mented binary search trees.

Incremental Approximate Single-Source Shortest Paths with Predictions Learning aug mented binary search trees

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.156021Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e9447ebf-7246-496c-8635-462f76e73616 · outbound

This paper cites Woodruff.

Incremental Approximate Single-Source Shortest Paths with Predictions Woodruff

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.144383Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4f3f2f2d-dde3-4ded-aaf1-fac221fcf170 · outbound

This paper cites Liu and V aidehi Srinivas.

Incremental Approximate Single-Source Shortest Paths with Predictions Liu and V aidehi Srinivas

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.134542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c624940f-924c-47f9-8726-f3ecf7a7164b · outbound

This paper cites Competit ive caching with machine learned advice.

Incremental Approximate Single-Source Shortest Paths with Predictions Competit ive caching with machine learned advice

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.122825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 01f3b65b-f8a2-4b6c-838b-82864f6922ea · outbound

This paper cites Faster approximation schemes for fr actional multicommodity ﬂow problems via dynamic graph algorithms.

Incremental Approximate Single-Source Shortest Paths with Predictions Faster approximation schemes for fr actional multicommodity ﬂow problems via dynamic graph algorithms

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.112217Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4224e90c-405d-45ec-bba9-5160475b68f6 · outbound

This paper cites Online list labeling with predictions.

Incremental Approximate Single-Source Shortest Paths with Predictions Online list labeling with predictions

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.101305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 14405ccd-daa7-40d0-a36f-c2e8f0bb3fbd · outbound

This paper cites Incremental topological ordering and cycle detection with predictions.

Incremental Approximate Single-Source Shortest Paths with Predictions Incremental topological ordering and cycle detection with predictions

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.091906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 216f84a6-40d4-47ad-af4d-ccef42e750f2 · outbound

This paper cites A model for learned bloom ﬁlters and optimizing by sandwiching.

Incremental Approximate Single-Source Shortest Paths with Predictions A model for learned bloom ﬁlters and optimizing by sandwiching

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.081635Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation deb7098a-4355-4c7f-b0ef-def194307e55 · outbound

This paper cites Fully-dynamic-to- incremental reductions with known deletion order (e.g.

Incremental Approximate Single-Source Shortest Paths with Predictions Fully-dynamic-to- incremental reductions with known deletion order (e.g

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.070837Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1e61f0a4-e683-4df6-aa42-25251671c9fb · outbound

This paper cites Learning-augmented maximum ﬂow.

Incremental Approximate Single-Source Shortest Paths with Predictions Learning-augmented maximum ﬂow

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.060375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d3a15a3b-0ebf-4ae5-ac6b-7a80aae7b696 · outbound

This paper cites New algorithms and hardness for incremental single-source shortest paths in directed graphs.

Incremental Approximate Single-Source Shortest Paths with Predictions New algorithms and hardness for incremental single-source shortest paths in directed graphs

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.050702Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation aeb706c4-774b-4ad5-8436-977dc6b7b1e2 · outbound

This paper cites On dynamic shortest paths pr oblems.

Incremental Approximate Single-Source Shortest Paths with Predictions On dynamic shortest paths pr oblems

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.041113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a78040eb-1804-42ca-8a0a-91b12ab55392 · outbound

This paper cites Discrete-convex-anal ysis-based framework for warm-starting algorithms with predictions.

Incremental Approximate Single-Source Shortest Paths with Predictions Discrete-convex-anal ysis-based framework for warm-starting algorithms with predictions

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.031387Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6c9b7bf1-aad0-4820-97f5-42701ddc01de · outbound

This paper cites An on-line edge-deleti on problem.

Incremental Approximate Single-Source Shortest Paths with Predictions An on-line edge-deleti on problem

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.022122Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 7548846b-3e5c-46df-94f1-1e380353d9de · outbound

This paper cites warm start.

Incremental Approximate Single-Source Shortest Paths with Predictions warm start

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.011581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e19052ba-25f5-463c-a9a7-539a33821124 · outbound

This paper cites Partitioned learned bloom ﬁlters.

Incremental Approximate Single-Source Shortest Paths with Predictions Partitioned learned bloom ﬁlters

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:26.000638Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fdbf5334-f3c9-4ee6-895a-bd2f13ffaea4 · outbound

This paper cites On dynamic graph algorithms with predictions.

Incremental Approximate Single-Source Shortest Paths with Predictions On dynamic graph algorithms with predictions

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:25.990926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 735800ed-7cc6-48fa-8c22-221966108f7a · outbound

This paper cites Robust learning-augmented dictionaries.

Incremental Approximate Single-Source Shortest Paths with Predictions Robust learning-augmented dictionaries

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:25.979959Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 30d6551c-1cc5-49ac-8f67-137089cdeee4 · outbound

This paper cites Robust learning-augmented dictionaries.

Incremental Approximate Single-Source Shortest Paths with Predictions Robust learning-augmented dictionaries

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:55:25.970270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Pith citing papers

Observation 4073fbfc-0a0a-4f76-9d71-cacfe8a7eac3 · inbound

On Incremental Approximate Shortest Paths in Directed Graphs cites this paper.

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-12T06:34:41.77262+00:00.