{"as_of":"2026-08-14T09:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:44ae1c85a031f6495dc891dedeee90ea47ca7bfd4e5dcfffcf6e4e9c07f23423","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T10:55:25.924794Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T18:37:42.131811Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T18:37:42.198411Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"cited_work":{"arxiv_id":"2502.08125","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08125","snapshot_observed_at":"2026-08-07T18:37:42.198411Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","venue":"cs.DS","work_id":"bc11841b-591a-4086-a21b-a8ee404a7bbb","year":2025},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-12T14:33:51.217909Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.131811Z"},"links":{"cited_paper":"/paper/2502.08125","citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:0f17c3b4e1604418376ba01d40d1bf18d2f9ee48056f2d4a157a91b7e79ef05c","observation_id":"4073fbfc-0a0a-4f76-9d71-cacfe8a7eac3","resolution":{"observed_at":"2026-08-07T18:37:42.206393Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08125/citation-record","integrity":"/paper/2502.08125/integrity","json":"/paper/2502.08125/citation-record.json","paper":"/paper/2502.08125"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.440065Z","title":"Sorting with predic tions","venue":null,"work_id":"d92de1e1-fb99-4130-81c7-d2cba22838b3","year":2023},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.766254Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:f3da47874860aa76b94c7d191a3a32318986bc7781d2a34dd7def03468809255","observation_id":"598ecbfd-7a84-4fc6-96ea-b07cef3626cc","resolution":{"observed_at":"2026-08-08T10:55:26.443504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.430384Z","title":"Learning-augment ed priority queues","venue":null,"work_id":"2e28803f-a665-4649-a825-db370bf0e4a7","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.770396Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:5cefa478c709ab2ad407d472cb376fee79e90ce3a20695ca2815ecad7b645938","observation_id":"6d131348-a763-4aa9-8848-24408a808f4b","resolution":{"observed_at":"2026-08-08T10:55:26.434170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.420652Z","title":"Bercea, Jakob Bæk Tejs Houen, and Rasmus Pagh","venue":null,"work_id":"2bbfeb4f-30db-4f0b-99b1-fed5a7489c18","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.774697Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:0267adfc5be20a29785afa41043492861348e659cbc883248d29da62580437e3","observation_id":"9865e98e-18ca-4b13-979d-cf64ae6938d4","resolution":{"observed_at":"2026-08-08T10:55:26.424028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.409359Z","title":"Fully dynamic (2+ ε) approximate all-pairs shortest paths with fast query and close to linear update time","venue":null,"work_id":"490851fe-c107-41e8-a509-0da5ae47d8c8","year":2009},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.778689Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:c9ec98780f5f6349b1f5da061721c427fd1d712c6d12570bb4fd95c271a4b130","observation_id":"a71b5df4-57ff-4385-ad3e-f842844b74b4","resolution":{"observed_at":"2026-08-08T10:55:26.413705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.398287Z","title":"Maintaining shortest paths under dele tions in weighted directed graphs","venue":null,"work_id":"84085983-2875-4a27-9909-437e7a7f654a","year":2016},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.782425Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:5e4e4d75122530a93f223206c1ed267288e23e88e70262deaa5a3be865160635","observation_id":"8acb7b1b-5250-4c09-b2a9-b6b0d446bf95","resolution":{"observed_at":"2026-08-08T10:55:26.401762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.387395Z","title":"Deterministic decremental SSSP and approximate min-cost flow in almost-li near time","venue":null,"work_id":"ec4e1cf8-4601-4587-b3b2-60c9f46b631f","year":2021},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.786058Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:a5a824141d6929c1df731a491cd0be5d80d1f576f65a6cc5cf456093f3aec0b9","observation_id":"c6fe0b8b-1490-4dd6-ad0b-008aa158d90c","resolution":{"observed_at":"2026-08-08T10:55:26.391349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.376722Z","title":"Near-optimal decre- mental SSSP in dense weighted digraphs","venue":null,"work_id":"8d0170c6-8d7a-4eb2-a898-82c9d51101d8","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.789586Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:754284a1ce788bfd80763f079ca4b357e9aaabf7559bf5900a90fadefc753606","observation_id":"1a32d30e-406f-44a7-8002-09c8e7ce0782","resolution":{"observed_at":"2026-08-08T10:55:26.380469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.365481Z","title":"Adaptive probing policies for shortest path routing","venue":null,"work_id":"bbf951f2-ff9e-4860-ab77-55fbf02038b1","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.792620Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b23c6eb5b6825094ecbce2d38ebc76c8ab1e8e2a6876409a25ae6db5aa6728d7","observation_id":"7e3bd53f-8359-439b-bcfd-b2e193875917","resolution":{"observed_at":"2026-08-08T10:55:26.369029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.354190Z","title":"Incremental single sour ce shortest paths in sparse digraphs","venue":null,"work_id":"7703770b-a6cc-422e-a336-6e4a9f4dad9a","year":2021},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.795881Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:657e68e05e4bb3ef8e5eca8e66ea9477c6cc983d9475819d8dbb342338c7db94","observation_id":"48430694-0415-40e1-ae93-abd88fd44c71","resolution":{"observed_at":"2026-08-08T10:55:26.358238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09251","last_updated":"2025-05-15T04:46:39Z","snapshot_observed_at":"2026-08-13T13:40:44.731927Z","submitted_at":"2022-11-16T22:50:40Z","title":"On the Power of Learning-Augmented Search Trees","version":3},"cited_work":{"arxiv_id":"2211.09251","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.09251","snapshot_observed_at":"2026-08-08T10:55:25.953280Z","title":"On the Power of Learning-Augmented Search Trees","venue":"cs.DS","work_id":"63558d1b-2f73-41a9-a86f-8c6ba5141a18","year":2022},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.799162Z"},"links":{"cited_paper":"/paper/2211.09251","citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:421b6f1328c24afdae8a3bf121b53b884b3c0099227cd377a0c1a9ed660b718a","observation_id":"f5d1bffe-3717-485e-86af-e7bcb66dbd79","resolution":{"observed_at":"2026-08-08T10:55:25.958941Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.342590Z","title":"From WiscKey to Bourbon: A learned index for log-structured merge trees","venue":null,"work_id":"d24a8273-b02c-49c0-b405-7fcab79147e3","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.802840Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b3b2274ed8fbba39b66337216bfca22e9405af50fefe3b89a2e616d9d258b703","observation_id":"3c7db9a7-cf25-44c8-a225-2137647ad7f7","resolution":{"observed_at":"2026-08-08T10:55:26.346966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.331875Z","title":"Predictive flows for faster ford-fulkerson","venue":null,"work_id":"9e07b089-485c-429a-af0c-cfd348ba75cb","year":2023},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.806127Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:a127092759b1148671d005ce84a8cac2686dd4bb68b88c03bf261379302da86c","observation_id":"500d7769-1f59-4884-a7ac-76b113cfa949","resolution":{"observed_at":"2026-08-08T10:55:26.335828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.319240Z","title":"ALEX: an updatable adaptive learned index","venue":null,"work_id":"67260b8d-80c7-4c27-b7b2-94b45add9252","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.809590Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:0facf8a3b98305f9157ef291841c76276022ed8865670c656bf1a9e79d8318da","observation_id":"2096b127-befc-4f7d-9774-25402e891cba","resolution":{"observed_at":"2026-08-08T10:55:26.324030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.308058Z","title":"Binary search with distributional p redictions","venue":null,"work_id":"9bc98ca7-041c-4e8b-a4d6-65772bc6f4a0","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.812742Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:6d0ce136bb210fdd3de729068d7670ca8a14b1242cd4e401a0f92a8599245bb8","observation_id":"c1c2fe9c-b6e3-4898-bee8-be3c4e29fb6e","resolution":{"observed_at":"2026-08-08T10:55:26.312127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.297367Z","title":"Faster matchings via learned duals","venue":null,"work_id":"97635e69-7902-47d9-8103-d49a7b75c2d2","year":2021},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.815982Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:a12d324c21ede55e410c1ac77a8eb7d3fe2238cfac9a77d3e79b6d79a4a0be19","observation_id":"0e9e5f3c-2986-48f9-b81c-3de33a0e98db","resolution":{"observed_at":"2026-08-08T10:55:26.301183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.287726Z","title":"learning","venue":null,"work_id":"9058fb42-fa27-4caf-b0e1-82656119fc17","year":2021},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.819259Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:74ae4dd8cfcf853ee9cb74323dd152580aaa212b326f84a7c0707d55ff03ad14","observation_id":"cf16921f-05d7-480c-9d1a-1f37b5b3d491","resolution":{"observed_at":"2026-08-08T10:55:26.291221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.278056Z","title":"Deterministic algorithms for decre- mental approximate shortest paths: Faster and simpler","venue":null,"work_id":"a7f22daf-9900-45c9-b48a-366b9f613178","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.823371Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:445b058ce97f7ff8f0ca60cf82a00892264b3a87faaef5a4f177197f78ebfe5b","observation_id":"3a50e329-999b-4c43-9362-19af217c520a","resolution":{"observed_at":"2026-08-08T10:55:26.281264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.265735Z","title":"Sublinear-time decremental algorithms for single-source reachability and shortest pa ths on directed graphs","venue":null,"work_id":"ce1e51c6-00e3-4e11-8f4c-e9d9ac880972","year":2014},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.826849Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:bab2e5319e1fd03725ca096e663dfba9909caee283dd6f025d96ff3ed41f1a17","observation_id":"2fff3f0d-c84e-4fff-bec3-e5fa8e652712","resolution":{"observed_at":"2026-08-08T10:55:26.271430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.254349Z","title":"Improved algorithms for decremental single-source reachability on directed gr aphs","venue":null,"work_id":"14879d81-f018-4c3b-8473-2a72ba731fe2","year":2015},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.830229Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b1f1e5b929dde950260bdd36b7e42049446ebae4a6aea0461160ef555a74de88","observation_id":"068d3034-7ecc-40f5-ba61-718603201a76","resolution":{"observed_at":"2026-08-08T10:55:26.259019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.244287Z","title":"Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and de randomization","venue":null,"work_id":"809021da-e27a-49b0-911b-2aed017ec0f3","year":2016},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.833893Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:2501597b57ff815366df8dcd9c6c50e0da1aadf57519f20ca65113e7704fb94d","observation_id":"55bd8bc1-dba7-4034-9635-47596661f7c9","resolution":{"observed_at":"2026-08-08T10:55:26.247931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.233882Z","title":"Seybold, and Ch ristopher Y e","venue":null,"work_id":"6376f638-ef82-48ec-8c2b-58de306fab5e","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.837387Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:2cc6d4d03832d821aeaa2a05aca604c41bf3c20a7212cd6dc8875cb9c17c88f9","observation_id":"3738772d-0c7f-4f93-8b0a-1c8e24a56cff","resolution":{"observed_at":"2026-08-08T10:55:26.237637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.223149Z","title":"Fully dynamic biconnectivity and transitive closure","venue":null,"work_id":"d683a18b-969c-4499-a554-cd2855bf0e11","year":1995},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.840735Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:3b96c11f4e30271219a904c0de8332a9dff45e2c2101e0d7b66b38a8a55de4d0","observation_id":"fc88f56d-586e-4729-befb-c7f203253428","resolution":{"observed_at":"2026-08-08T10:55:26.227293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.213640Z","title":"Learning-based frequency estimation algorithms","venue":null,"work_id":"ceb7c059-bb4c-472b-8c75-1477fd45ee17","year":2019},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.844054Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:bbcd28bbbc3ce5b0d8315606a8013c20557b46644b36eb20d0286de0afebb111","observation_id":"cd88e2ac-6852-4279-8338-5857da92cbab","resolution":{"observed_at":"2026-08-08T10:55:26.217396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.204456Z","title":"Online page migration with ML advice","venue":null,"work_id":"fd43ea0c-fad1-42d6-982c-2eded26a0930","year":2022},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.848024Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:7abffefc169947e28647f30eef14afb5e820039fb338697ee4b8649b4118193a","observation_id":"f3154460-665b-4482-a52b-c4b5565f6f8f","resolution":{"observed_at":"2026-08-08T10:55:26.208031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.194226Z","title":"Onlin e algorithms for weighted paging with predictions","venue":null,"work_id":"5bbf0b79-c08e-4044-b8be-7db7867f5a3d","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.851354Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:daa63071e903ef4d7d6be30d73fef6947d96d11584aac67205effa124938929a","observation_id":"2f7a9cb2-1578-4f93-a9ac-8a9eb6be599b","resolution":{"observed_at":"2026-08-08T10:55:26.197662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.183877Z","title":"Chi, Jeffrey Dean, and Neo klis Polyzotis","venue":null,"work_id":"7a4d47cc-d711-453c-a2df-e0f0d50d0b8a","year":2018},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.854634Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:6e0d02213309ee8d890f7df731cbb27363b2c65142f6a59c2d99bbc16548e72c","observation_id":"20589312-253f-4cda-9b54-5ee922985cfd","resolution":{"observed_at":"2026-08-08T10:55:26.188048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.173351Z","title":"Incremental sssp for sparse digraphs beyond the hopset barrier","venue":null,"work_id":"8ee2a2c9-4ea8-4c0d-8e4b-b27ff56e13bb","year":2022},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.857925Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:8793449710638e1487ae02ad5dd5c38b389c5ab65c9081e8fdb3610ffc1efd4c","observation_id":"fe0acc77-4c29-4b24-a893-4cddacd33bd4","resolution":{"observed_at":"2026-08-08T10:55:26.177316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.163109Z","title":"Speeding up bellman ford via minimum vi- olation permutations","venue":null,"work_id":"bc139bf7-6961-485c-a9da-835ca2fde577","year":2023},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.861068Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:ae574a14c29e3e422bc4aec3a5e5dad26f4e1fa006d9747c066d3c4f2f1d1e28","observation_id":"dcc5d991-8d14-4eec-8637-748f38fa98c3","resolution":{"observed_at":"2026-08-08T10:55:26.166950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.152059Z","title":"Learning aug mented binary search trees","venue":null,"work_id":"f3ffd048-03ba-4c5d-99c6-abbae832e279","year":2022},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.864359Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:88dd66af671077cf48596072ab92bcebd0bc2cce3f962e7646c320ac4fe4ee4b","observation_id":"1747e776-5892-4d4d-bebd-6ae16b7ee1f1","resolution":{"observed_at":"2026-08-08T10:55:26.156021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.140971Z","title":"Woodruff","venue":null,"work_id":"544b2a40-df15-4f42-b5cc-b7e3b4f7b905","year":2022},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.867583Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b85db7894f920a363cf443fee9b1d72b0ba5e0d2fc924fa73c6cc79b2f6aa74e","observation_id":"e9447ebf-7246-496c-8635-462f76e73616","resolution":{"observed_at":"2026-08-08T10:55:26.144383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.129813Z","title":"Liu and V aidehi Srinivas","venue":null,"work_id":"94716f6d-4d5d-40b4-8ee1-ec44d550ffc9","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.871127Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:6ebf26777511e13e673b586fbd9a12f326e15824baca9ffbbacd24fc0817b16f","observation_id":"4f3f2f2d-dde3-4ded-aaf1-fac221fcf170","resolution":{"observed_at":"2026-08-08T10:55:26.134542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.119029Z","title":"Competit ive caching with machine learned advice","venue":null,"work_id":"505b28b5-34f7-4e00-b880-19ef076270b5","year":2021},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.874982Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b8c5dcfa23938c2b8690375e24eba6e2ee8bbdb99d07bffa7fb2af006cabe6bf","observation_id":"c624940f-924c-47f9-8726-f3ecf7a7164b","resolution":{"observed_at":"2026-08-08T10:55:26.122825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.107911Z","title":"Faster approximation schemes for fr actional multicommodity flow problems via dynamic graph algorithms","venue":null,"work_id":"d58d3c61-a56e-4a06-8bb9-4d7ee7f300b1","year":2010},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.878126Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:20653c9c58587ce87b3bfbeba3f6712b020564a6fda6900943cfe4bcdeef154a","observation_id":"01f3b65b-f8a2-4b6c-838b-82864f6922ea","resolution":{"observed_at":"2026-08-08T10:55:26.112217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.097794Z","title":"Online list labeling with predictions","venue":null,"work_id":"0e7075f3-8f14-4d9e-9b56-02bb3b60f927","year":2023},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.881344Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:a369eeb4786ac8504141d194ba9bd57bf61789a06b3115bb901400c294714118","observation_id":"4224e90c-405d-45ec-bba9-5160475b68f6","resolution":{"observed_at":"2026-08-08T10:55:26.101305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.088236Z","title":"Incremental topological ordering and cycle detection with predictions","venue":null,"work_id":"c7c95d1d-b9e9-4be5-b505-60b6c1183d33","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.884621Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b749db57ca17e6170974f8bd1a2a9e92a911cd7bbda16a520ffb11badfc703c7","observation_id":"14405ccd-daa7-40d0-a36f-c2e8f0bb3fbd","resolution":{"observed_at":"2026-08-08T10:55:26.091906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.077475Z","title":"A model for learned bloom filters and optimizing by sandwiching","venue":null,"work_id":"4049a249-2742-43ad-b93c-17ae85d55746","year":2018},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.888253Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:9526eaca7b394a77949f920c1998224528ee43e70de89a0d48d2bbe611c37614","observation_id":"216f84a6-40d4-47ad-af4d-ccef42e750f2","resolution":{"observed_at":"2026-08-08T10:55:26.081635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.067027Z","title":"Fully-dynamic-to- incremental reductions with known deletion order (e.g","venue":null,"work_id":"046b1998-8b21-4f1e-9261-157736596d65","year":2023},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.891672Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:e710018f12867a2d3fa9fab4cf0584d5940ce890caf4d84f381e70091f8cc0d9","observation_id":"deb7098a-4355-4c7f-b0ef-def194307e55","resolution":{"observed_at":"2026-08-08T10:55:26.070837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.056974Z","title":"Learning-augmented maximum flow","venue":null,"work_id":"bbba6f7a-914a-47bd-b27a-71e742c250f6","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.894660Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:37ae6e16f38efb3c56c13600266c11cb4ea96204a14eba3ac1667af342366b4d","observation_id":"1e61f0a4-e683-4df6-aa42-25251671c9fb","resolution":{"observed_at":"2026-08-08T10:55:26.060375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.047221Z","title":"New algorithms and hardness for incremental single-source shortest paths in directed graphs","venue":null,"work_id":"7ff7b465-1eb8-4f42-b372-16e15d88ccc2","year":2020},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.897729Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:4d5ba2ac4980290a3216dde301ec02b58d06f3e1abae71d48cfdcd7470cc911b","observation_id":"d3a15a3b-0ebf-4ae5-ac6b-7a80aae7b696","resolution":{"observed_at":"2026-08-08T10:55:26.050702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.037669Z","title":"On dynamic shortest paths pr oblems","venue":null,"work_id":"4375fa1e-93e5-485b-828c-9d19654d1614","year":2011},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.901369Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:1b43e020be9acf036bd8d781485f633594f2e3bf84e8998a51aa7a26f5aa5d99","observation_id":"aeb706c4-774b-4ad5-8436-977dc6b7b1e2","resolution":{"observed_at":"2026-08-08T10:55:26.041113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.028083Z","title":"Discrete-convex-anal ysis-based framework for warm-starting algorithms with predictions","venue":null,"work_id":"ad7dd929-2753-457a-ae36-8dd8348fd9a4","year":2022},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.904459Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:b5f098f7260641b2886ddd37ec172118b6346f87e1c1d6b6d1c211f70ffe82d6","observation_id":"a78040eb-1804-42ca-8a0a-91b12ab55392","resolution":{"observed_at":"2026-08-08T10:55:26.031387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.018127Z","title":"An on-line edge-deleti on problem","venue":null,"work_id":"51ee4242-2e39-4597-bc69-3c9abbf7fe03","year":1981},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.907556Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:ea4eb125d0e2bd7c2b74422b0781ded9374438c24846133222ae7fb7c1b6e728","observation_id":"6c9b7bf1-aad0-4820-97f5-42701ddc01de","resolution":{"observed_at":"2026-08-08T10:55:26.022122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:26.007121Z","title":"warm start","venue":null,"work_id":"66b03bdc-121d-405f-8b63-70c4507ace4b","year":2025},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.910803Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:d06dd4710ac5db0eb82f9a960aa040defb40d2d3bb53895883650bb200aefcbf","observation_id":"7548846b-3e5c-46df-94f1-1e380353d9de","resolution":{"observed_at":"2026-08-08T10:55:26.011581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:25.997298Z","title":"Partitioned learned bloom filters","venue":null,"work_id":"9eaa94d2-bc69-4d71-9d5f-2bd40080c6c0","year":2021},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.914656Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:fd803bbe0a3e73f0152ead56cb4196f340c5a35a8fee328d44b89c2d23b469a6","observation_id":"e19052ba-25f5-463c-a9a7-539a33821124","resolution":{"observed_at":"2026-08-08T10:55:26.000638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:25.987410Z","title":"On dynamic graph algorithms with predictions","venue":null,"work_id":"2a6c5267-a490-4f04-9bbe-e02501f4854b","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.918046Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:202e93afb89aded6e1f749b9237f5f705a935600d9f1a68a2a2229327a5feaa9","observation_id":"fdbf5334-f3c9-4ee6-895a-bd2f13ffaea4","resolution":{"observed_at":"2026-08-08T10:55:25.990926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:25.976625Z","title":"Robust learning-augmented dictionaries","venue":null,"work_id":"5ef0b61e-8754-4b9f-ba06-070d8b607420","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.921173Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:1dda65c36490f9f9472493fecce32001b68eec22f66bf93b9acaead56ab46acf","observation_id":"735800ed-7cc6-48fa-8c22-221966108f7a","resolution":{"observed_at":"2026-08-08T10:55:25.979959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:55:25.966055Z","title":"Robust learning-augmented dictionaries","venue":null,"work_id":"c66233bb-b2c0-4c48-a4d4-2d4a1cf176e9","year":2024},"citing_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:25.924794Z"},"links":{"citing_paper":"/paper/2502.08125"},"observation_digest":"sha256:0e8f7db3c10d812a0a66bccd0e63110c83e9d000a28865800c9e8c66ec5727e7","observation_id":"30d6551c-1cc5-49ac-8f67-137089cdeee4","resolution":{"observed_at":"2026-08-08T10:55:25.970270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":46},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 1 inbound Pith citation observation for arXiv:2502.08125."}