Pith. sign in

Paper Citation Record · LEDGER

Approximate Single Source Dual Fault Tolerant Distance Oracle

As of 10 August 2026, this Paper Citation Record lists 100 of 243 outbound references and 0 inbound Pith citation observations for arXiv:2607.02999.

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

pith.paper-citation-record.v1
2607.02999 v2

Coverage vector

measured 100 of 243 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T09:01:34.334124Z

measured 100 of 100 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

100 of 243 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved100
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c2c7c31f-897e-4d95-b757-2b46739ff470 · outbound

This paper cites Improved Distance (Sensitivity) Oracles with Subquadratic Space , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Improved Distance (Sensitivity) Oracles with Subquadratic Space , booktitle =

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:25.633376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:25.633376Z digest=sha256:e1045883a471c629c1c58279319d395f5ac249bc6a19af5e6661286c46a3599f

Observation faad0aac-2784-4ec7-b35f-ca3e6e53c741 · outbound

This paper cites Approximate Distance Sensitivity Oracles in Subquadratic Space , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Approximate Distance Sensitivity Oracles in Subquadratic Space , booktitle =

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:25.761569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:25.761569Z digest=sha256:dd93e9d21923ad831a59df7604fb8f0baa17b81e2682b4835c9190fe069ccd40

Observation 1aaac6f2-e7f3-4b24-a0f7-81ed9af53c3e · outbound

This paper cites Incremental Topological Sort and Cycle Detection in Expected Total Time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Incremental Topological Sort and Cycle Detection in Expected Total Time , year =

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:25.870557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:25.870557Z digest=sha256:288d7cab3bef0d17b729930b98796ecb8d2d62978f58bbea494214d2007af5c9

Observation 5e2970ef-b867-4424-b7ad-29a070754d2f · outbound

This paper cites An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model , year =

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.030513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.030513Z digest=sha256:6f3095985ec9578cba4b68f55a56eb8cd337adb8d0bc704286584f993098b21c

Observation 9d5e6e76-7ca0-4b45-873e-20f056b1ab38 · outbound

This paper cites Workshop on Algorithms and Data Structures , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Workshop on Algorithms and Data Structures , pages=

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.202527Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.202527Z digest=sha256:072fb6930f36331c6ee48888cc385d693f0efa06af0016a8921abe8c4f9698a6

Observation 341eb966-39f7-4a00-88e1-b19cd85baa14 · outbound

This paper cites 2010 , publisher=.

Approximate Single Source Dual Fault Tolerant Distance Oracle 2010 , publisher=

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.339156Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.339156Z digest=sha256:4e5a5aa133c9ba83df7ff0a658022e37126f377edb08199e1482cf778171f610

Observation 2b095f61-25d0-4e56-aaae-83b4f8400039 · outbound

This paper cites Algorithmica , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Algorithmica , volume=

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.469422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.469422Z digest=sha256:662127665141625b84019382848d32e9a0600ef1078d8094ccd808a3df3cd3de

Observation b8e45b3c-0d0e-495f-88b3-d7bfd5e691da · outbound

This paper cites Nearly 2-Approximate Distance Oracles in Subquadratic Time , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Nearly 2-Approximate Distance Oracles in Subquadratic Time , booktitle =

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.582504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.582504Z digest=sha256:2ebfd2eb56427bc0478b1066289971acf2175c7d3c94954fe7be0bc7a3b752f5

Observation d37930b7-9efd-41c2-97cb-40a220654ba3 · outbound

This paper cites Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.715971Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.715971Z digest=sha256:42e23879251361931b38578588d17b2be025a77bddf043b40f27450cae819605

Observation 050e6746-30a1-4e8d-bf90-96e62e62b37d · outbound

This paper cites Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35 , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35 , pages=

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.841185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.841185Z digest=sha256:f98cffd54c53cb6ba6300e33cfd1d84615be4da68eaa064b765cb0f582d0ac40

Observation 95c99cf5-0147-4a2b-b3dd-420db7043b6d · outbound

This paper cites 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:26.960445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:26.960445Z digest=sha256:eb659ff38989b93f61e93de682794f75ffd10e20e6fc5714b0dc1d7489f97e4e

Observation b7bc2f1b-6aba-4d8a-ba2e-11e7bafebb61 · outbound

This paper cites SIAM Journal on Computing , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle SIAM Journal on Computing , volume=

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.174415Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.174415Z digest=sha256:2624b6bc65faaa673f508bf34f9432fa08ee3f4e2577aebed80c8ea4a1fdf83a

Observation 78d346af-8131-4548-9799-6939b642a2ba · outbound

This paper cites European Symposium on Algorithms , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle European Symposium on Algorithms , pages=

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.340678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.340678Z digest=sha256:17a2a08062659f1747635aed2281e6756e570347ec5435eb98945c24696eb3ea

Observation ccf9e256-a58f-4435-bb28-32ffe3f81cbb · outbound

This paper cites SIAM Journal on Computing , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle SIAM Journal on Computing , volume=

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.405912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.405912Z digest=sha256:61b41a153533e2d46f81c96f5fd0567a597f244d4b8f9e0b43e1d8460e476c2a

Observation 4a3a3fe7-94ef-4a78-b4e3-a209d9ef35d5 · outbound

This paper cites 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.485148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.485148Z digest=sha256:651f85870bf3610c337e4ac017c1cdf324de3a43b29ca5df34192c7f59b96868

Observation a81e2ccd-56f6-46f3-a126-aa810ad21a64 · outbound

This paper cites Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.564819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.564819Z digest=sha256:bc36342dd7b2b8bae18a46f0a38b75a4ee44b5912060e5781c7e6cd134b6a8cb

Observation 0fc0c97c-583e-4ecc-ac9d-f19478f57e3e · outbound

This paper cites International Colloquium on Automata, Languages, and Programming , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle International Colloquium on Automata, Languages, and Programming , pages=

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.648713Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.648713Z digest=sha256:c017551be53529d7ca24bf54dc55ad5d389c8f55da493555db1c67b05ad89534

Observation 318b5371-0183-4398-8388-b048ac47f2b9 · outbound

This paper cites ACM SIGACT News , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle ACM SIGACT News , volume=

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.727912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.727912Z digest=sha256:43c293bd6d64961eab676735ba5d89ce6600aa8606d65e0c0449792e011238ef

Observation 72f0e6e1-5a73-4947-a0fb-7e8c1bc8e6f7 · outbound

This paper cites Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.769910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.769910Z digest=sha256:35b2f0d4b655e9391ed259ed9f1666d7069f28e38e748a98e01633a124c70267

Observation a6a3580d-16e3-47b9-a80f-804dccd0fcb5 · outbound

This paper cites TheoretiCS , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle TheoretiCS , volume=

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.852765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.852765Z digest=sha256:fb0f221659ab9cd2ff46db6eaf0201fa51aa0545dd6c76b202e1957dfb41baa8

Observation f95bbe8a-7504-4808-a2f4-081599407743 · outbound

This paper cites Approximate Distance Sensitivity Oracles in Subquadratic Space , journal =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Approximate Distance Sensitivity Oracles in Subquadratic Space , journal =

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:27.985767Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:27.985767Z digest=sha256:7e41ddbbac2b197dc899531ca668c4232b1f3d9b0ff45739e87772b6dc962245

Observation 7afe5495-732a-4190-83b7-27c9989e2830 · outbound

This paper cites Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees , journal =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees , journal =

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.131720Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.131720Z digest=sha256:1e31b6e119c335f8f7d3e42f1a4ca3272c8d4c63e30b3d62336122df45288464

Observation 028d475e-5333-49c3-9cbb-85f6fcda2f01 · outbound

This paper cites Journal of computer and system sciences , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Journal of computer and system sciences , volume=

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.275545Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.275545Z digest=sha256:18529da02410c171e981e79714211616bdbd67ebc55e060e7c94c06347a98d3c

Observation 6a79855d-20aa-4b9b-b8e0-e50ca8e59af7 · outbound

This paper cites Journal of Algorithms , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Journal of Algorithms , volume=

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.368907Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.368907Z digest=sha256:4714dc846ced8519d0fc6cdc1d9aec8bb7da4e914f1774e5bf86fcb356a19a1b

Observation d1da6ec3-4bd7-40f5-80f0-90c8b9c5d0b3 · outbound

This paper cites All-pairs nearly 2-approximate shortest paths in.

Approximate Single Source Dual Fault Tolerant Distance Oracle All-pairs nearly 2-approximate shortest paths in

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.502886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.502886Z digest=sha256:7ea3dcd6d1694ac5e0e4d70b9cab8e48efbefcb43cdb1fd05d8cd7fde226e16d

Observation 6367d682-0085-4037-b632-7f8f2b2abbf5 · outbound

This paper cites 43rd International Colloquium on Automata, Languages, and Programming,.

Approximate Single Source Dual Fault Tolerant Distance Oracle 43rd International Colloquium on Automata, Languages, and Programming,

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.660759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.660759Z digest=sha256:2e549296e7c43cc038e72f5cbf80ac150b2635fc0ddc7264432e1647212e6c11

Observation c79f6f32-ca6b-403a-856a-ba8b29996d64 · outbound

This paper cites Compact routing schemes , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Compact routing schemes , year =

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.824608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.824608Z digest=sha256:b52fbed474e510ccb585648824cbe40f7b42d20f3fc75e7cfc8dbd0e7b5cd054

Observation 091d6c5d-edfd-4cdd-be44-a46f47d6aeea · outbound

This paper cites Negative-Weight Single-Source Shortest Paths in Near-linear Time.

Approximate Single Source Dual Fault Tolerant Distance Oracle Negative-Weight Single-Source Shortest Paths in Near-linear Time

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:28.948253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:28.948253Z digest=sha256:d8fcd07256686786b59b299e84637dcfb061ca05b0bfd4134a692e0e42204096

Observation 39767d74-339c-4152-8696-c1a75394c9e2 · outbound

This paper cites A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths , year =

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.100820Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.100820Z digest=sha256:3ad252fe6f01ba1edf0a544a1308da483dca0de09feffd89e1cad31ecf8c2280

Observation 2bdae90a-aecb-47d3-a5c3-3eb607006d57 · outbound

This paper cites Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , year =

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.261617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.261617Z digest=sha256:624359cef0fe33d1b2998d956efd93f42edc6eed2a918a0398fb59f2f319b350

Observation 1b2e89bc-2b26-4a2a-9d35-aed027ce7593 · outbound

This paper cites Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs , year =

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.430266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.430266Z digest=sha256:700a2c26db3d9198f418d35de02fd365dd49b3c8ec4ac7705a4168a29aada667

Observation c6a522aa-e9cd-4bd2-8fe3-dc496702c6a2 · outbound

This paper cites Information Processing Letters , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Information Processing Letters , volume=

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.560898Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.560898Z digest=sha256:a11357dae00b32a4383a8adbe81ac552a04977f8bdc03174b16ab0d2abda95c1

Observation 0187f081-c18f-40b3-9d39-480c7163bc76 · outbound

This paper cites Fast 2-Approximate All-Pairs Shortest Paths , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Fast 2-Approximate All-Pairs Shortest Paths , booktitle =

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.692798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.692798Z digest=sha256:e5f68e168d013ce91911fb4635aec09ee3b6f2da28eef99979952f1e8f8a0da5

Observation db27488f-03ba-4406-8d22-e876dfb5eecd · outbound

This paper cites New Algorithms for All Pairs Approximate Shortest Paths , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle New Algorithms for All Pairs Approximate Shortest Paths , booktitle =

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.838269Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.838269Z digest=sha256:179b01538fa9b0a0cfe1582e290e600d1e71cf44692958d802f65f979b232869

Observation 02626664-9893-47c2-90bd-0f422eb9299e · outbound

This paper cites Faster Approximate All Pairs Shortest Paths , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Faster Approximate All Pairs Shortest Paths , booktitle =

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:29.960926Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:29.960926Z digest=sha256:f449745093fca6e4a57b17bcb43db5aacccc8caa89ce0117dcd7edd98d0f6e93

Observation fd999e3f-5556-40dc-a226-0a9a9ad8a7cb · outbound

This paper cites 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=.

Approximate Single Source Dual Fault Tolerant Distance Oracle 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.019854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.019854Z digest=sha256:9af4fe4dcded674261b1dd965eab2bc3fffa2dc435e91749576c638b2c9c90fa

Observation 2df458c8-39a4-4b38-9cdb-c8bd1d2efa8a · outbound

This paper cites SIAM Journal on Computing , volume=.

Approximate Single Source Dual Fault Tolerant Distance Oracle SIAM Journal on Computing , volume=

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.102971Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.102971Z digest=sha256:5b9543350b315a2cb10a04f63538976e21d13270114470bf28fdd96645077526

Observation bb86722e-7360-4966-97a7-82d3966d5ac4 · outbound

This paper cites Distributed weighted min-cut in nearly-optimal time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Distributed weighted min-cut in nearly-optimal time , year =

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.147773Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.147773Z digest=sha256:83dba9b800d0423b30774628095843db3e1789ddd2d42d2aca57a7cc21143f82

Observation d95d84e1-d71e-4f33-ae10-59f24429d464 · outbound

This paper cites Vertex connectivity in poly-logarithmic max-flows , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Vertex connectivity in poly-logarithmic max-flows , year =

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.217241Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.217241Z digest=sha256:e6bc9918248a04c4bf115cc5be417f876ce2ccbabccfbedb92b7bfab1e2c58ae

Observation 83c1558b-1426-40dc-8347-7ede338bd205 · outbound

This paper cites A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , year =

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.306528Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.306528Z digest=sha256:ab68489a8462818b91cee1b32019a732b2d7586b0e29061c3905d850248360ba

Observation 84851c9f-5634-4732-ba93-0f48921618ec · outbound

This paper cites Weighted min-cut: sequential, cut-query, and streaming algorithms , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Weighted min-cut: sequential, cut-query, and streaming algorithms , year =

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.480470Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.480470Z digest=sha256:37f6b0c9c3426c3f89470d7f6746d75dc329d2f31f938bc6f264e347be6a2495

Observation ea9e2302-848a-4372-b798-15468b412212 · outbound

This paper cites Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.

Approximate Single Source Dual Fault Tolerant Distance Oracle Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.614825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.614825Z digest=sha256:7e750d1753f8d933bf73fd1ee4139ed50c9fad8523e07b58fa6abac5d641e4dd

Observation f95c21d8-5c26-4eb0-8414-9afd46750713 · outbound

This paper cites Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time , year =

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.723109Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.723109Z digest=sha256:d0a3f39723615f0a9d39b6376d6238715f9bb14f88237baf54cbb02871d017bc

Observation 3e3bda0c-a568-4807-b9b3-d962480372a6 · outbound

This paper cites Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , year =

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.815507Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.815507Z digest=sha256:10128edd2db578008850a26b49569c5d2ae58b20663b632d14f6641d10c502a9

Observation afed8a74-5a4c-4732-af7b-8dd210c6a939 · outbound

This paper cites Distributed exact weighted all-pairs shortest paths in near-linear time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Distributed exact weighted all-pairs shortest paths in near-linear time , year =

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.861604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.861604Z digest=sha256:0e09b6978825c2d663ff673ab6cafb34d6e3c1d072f8bac61fb46ce05cf2cdd5

Observation 5fd66c78-e977-4bc9-afc1-ffd9c8f0269f · outbound

This paper cites Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , year =

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:30.918890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:30.918890Z digest=sha256:06a8a56a7a76b4f74738e8937faffb8415db46721f63c4bf7f4fed0136a2839d

Observation 66600e71-4737-4ca3-9eae-4d902b701375 · outbound

This paper cites A Faster Distributed Single-Source Shortest Paths Algorithm , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle A Faster Distributed Single-Source Shortest Paths Algorithm , year =

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.017384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.017384Z digest=sha256:05033599e8584c35bc57ca87f355bad5b5164d76f78778b5cb4b1595a115e3f5

Observation f95f8698-8e81-4a10-8340-b1f4f32198d7 · outbound

This paper cites Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks , year =

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.104863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.104863Z digest=sha256:01fcac4d21c708384b39327808c64ac0d93629d57204b5ef0b805a5615f08ccd

Observation 6080c0da-2d21-4c8c-bab4-5ded96deb86d · outbound

This paper cites Distributed Exact Weighted All-Pairs Shortest Paths in.

Approximate Single Source Dual Fault Tolerant Distance Oracle Distributed Exact Weighted All-Pairs Shortest Paths in

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.178057Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.178057Z digest=sha256:e61e97d10d8b27d00a9f8cfde8e8fc73be685692acbf5b91529e0197ec7aed5c

Observation 01dddca3-c793-4709-a098-f7f35a8b3330 · outbound

This paper cites Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , year =

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.281840Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.281840Z digest=sha256:6634454f82361cc7b95489b16465478bddd3ddbef43a779db443cc04ae2ffba4

Observation 466896dd-c41b-43f2-ad56-463829602b96 · outbound

This paper cites Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n\(.

Approximate Single Source Dual Fault Tolerant Distance Oracle Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n\(

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.388472Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.388472Z digest=sha256:ba453c8cb40ea4b81dc54a739169cf1cea39ae07f5bb7a4f8f56d2a641168b2b

Observation c343d737-244c-477a-bdc1-418ddeaf0fea · outbound

This paper cites Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , year =

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.498492Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.498492Z digest=sha256:4fea1c7c56a84fe044db756add45bad041d70802e2207208fcde10dcc0d55277

Observation c24ea061-9017-467b-baf5-28a292fe49c2 · outbound

This paper cites New deterministic approximation algorithms for fully dynamic matching , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle New deterministic approximation algorithms for fully dynamic matching , year =

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.600934Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.600934Z digest=sha256:d8c3e6771dc6b98adfb0d9819ae119e16fd82b2faa8c81d745038e2c1133ffac

Observation 96fe8bdd-07d8-4df2-9306-fdb115f0498f · outbound

This paper cites Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs , year =

Reference 54

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.707428Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.707428Z digest=sha256:049f0dad557eaacc954a31d93abd93638faffba722620870bdcc54df29eff4fe

Observation d24c3510-9e29-442c-933d-7289d68cf354 · outbound

This paper cites Tsourakakis , booktitle =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Tsourakakis , booktitle =

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.813576Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.813576Z digest=sha256:62917f8fae130f73e34cfc3f2778fcb7426a3944280b1a6b24b2f0ee6f5d2508

Observation 5879fc43-4807-4408-99a5-8d3cc584fcef · outbound

This paper cites Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , year =

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:31.903388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:31.903388Z digest=sha256:57b1a6dd21eb7a6dd07b4fa250a3de1804c782fd79340831b936a8e584650451

Observation b8adddcf-3b0a-40ee-9af9-1e8b962ca1b9 · outbound

This paper cites Faster Algorithms for Semi-Matching Problems , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Faster Algorithms for Semi-Matching Problems , year =

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.042468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.042468Z digest=sha256:838e29a489cc38680c2bc15378967967941e6ecac88526008cc5d8efa5db4e35

Observation e74c74a4-a9ea-4f57-8918-ca55fdfd3f29 · outbound

This paper cites Almost-Tight Distributed Minimum Cut Algorithms , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Almost-Tight Distributed Minimum Cut Algorithms , year =

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.132894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.132894Z digest=sha256:a09b8ca52c816d61ab0318b299382e4a3acee43f5fd7f2b25313edfc178dc898

Observation 06547039-bc70-4996-9da7-d32b71dde387 · outbound

This paper cites 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.201431Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.201431Z digest=sha256:21aa3153862b2e7d026b81696c5ce3f04d91c42807020df5faa41c912a106b1d

Observation 9e658c21-56e0-4cc5-a37b-8a1e89bef220 · outbound

This paper cites Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.331438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.331438Z digest=sha256:eb1d332bb4bfe5734e5100e411b6eeb88c34d8ba3437ff6cf8f8318147775d51

Observation 807daabb-2dcc-45ad-b9ad-5ffe32d51454 · outbound

This paper cites Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.448629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.448629Z digest=sha256:f0d0b914cd8bd9c2ab88a67475c869af11adff131070b186168a79a74a478bb4

Observation c634c8b2-19d1-42e7-9685-f5dd35cf2f62 · outbound

This paper cites Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.558076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.558076Z digest=sha256:9c83294ccb5682128c4aaf4ec50d100978827383c59368a77a745a31a8e418b5

Observation 1078c88f-f50c-41d3-8eba-ca31d3751b38 · outbound

This paper cites Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=.

Approximate Single Source Dual Fault Tolerant Distance Oracle Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.684252Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.684252Z digest=sha256:3ab66dcdaa05b9129bb89fc8464a823e0b43c0abd95c6ec4773eb775c8df75a6

Observation ee9b14e2-c7c0-4a0a-89a8-24a7c4c2ddea · outbound

This paper cites Additive Spanners and Distance Oracles in Quadratic Time.

Approximate Single Source Dual Fault Tolerant Distance Oracle Additive Spanners and Distance Oracles in Quadratic Time

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.825395Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.825395Z digest=sha256:554f4dbd33c6bedad78d72ea2ce91674df6282c8b26caa40e7ea098e1be82802

Observation adfe1fe8-adb1-4af3-9307-e10bbdef5ffb · outbound

This paper cites Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths , year =

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:32.982957Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:32.982957Z digest=sha256:a0b72d0f0f5ffdb7e0f60fd87c5bd62aa74068c85b2a476a475f36931a8ad498

Observation c8409338-1880-448b-9e12-c95f5fa95ee4 · outbound

This paper cites Theory Comput.

Approximate Single Source Dual Fault Tolerant Distance Oracle Theory Comput

Reference 66

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.103887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.103887Z digest=sha256:f5716d5aed75e462b8a8e8c09b8e460525badfaaed53aa65bd36093916a67dd4

Observation f0d36a20-b717-44df-928b-1b377e8bed48 · outbound

This paper cites Weighted dynamic finger in binary search trees , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Weighted dynamic finger in binary search trees , year =

Reference 67

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.180337Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.180337Z digest=sha256:4e6603df8947e9d62ce10fdc809b38efdb8b0ed3c9fd55fcd36f6829ce4be504

Observation e18a7ea8-c1bd-4848-9934-00187bcebc78 · outbound

This paper cites 42nd Annual Symposium on Foundations of Computer Science,.

Approximate Single Source Dual Fault Tolerant Distance Oracle 42nd Annual Symposium on Foundations of Computer Science,

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.297124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.297124Z digest=sha256:e5dc575f5944f1ff19be7cec2dfdc6cd8a03d5e1a67f712ca4f51242d6fea948

Observation 1fc2651f-5ff6-47ca-b7ce-e5c04fa479ee · outbound

This paper cites Distributed Computing - 28th International Symposium,.

Approximate Single Source Dual Fault Tolerant Distance Oracle Distributed Computing - 28th International Symposium,

Reference 69

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.421289Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.421289Z digest=sha256:0eeafc8136400320dd6f1052240c25357b53af3568a26d9ca41651b875ac2484

Observation 6380a6c5-2738-4062-8238-cf0bc96571d8 · outbound

This paper cites Upper bounds for time-space trade-offs in sorting and selection , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Upper bounds for time-space trade-offs in sorting and selection , year =

Reference 70

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.543606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.543606Z digest=sha256:0e997d8725a7b6dfb543eb496538adae6a223d1168f7416d938ec4d147671aa4

Observation 2b48cf80-a274-4f8b-8826-358298252559 · outbound

This paper cites Upper Bounds for Maximally Greedy Binary Search Trees , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Upper Bounds for Maximally Greedy Binary Search Trees , year =

Reference 71

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.652597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.652597Z digest=sha256:f976ca1a8934a6b4c5d35b1b5adb42cc42691ed7c02b94bfc18905e1dd39b9fe

Observation 59ef3370-c4c1-4754-978d-314611570c5f · outbound

This paper cites Lawrence and Wegman, Mark N.

Approximate Single Source Dual Fault Tolerant Distance Oracle Lawrence and Wegman, Mark N

Reference 72

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.732540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.732540Z digest=sha256:52bd425e41ce48b8fb7a4b8ac4b2256c4102f6bbe2a3135327dce1d5998501e9

Observation 11af6192-cd8e-4963-ae69-f2054bff8d9e · outbound

This paper cites Truthful unit-demand auctions with budgets revisited , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Truthful unit-demand auctions with budgets revisited , year =

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.787179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.787179Z digest=sha256:237388b3b3865343f86cc58bede4aac7c1877d1af1730bb2cc7684691a46cb84

Observation 0b1b1790-723c-4660-acff-32d9f851bb6b · outbound

This paper cites Towards polynomial lower bounds for dynamic problems , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Towards polynomial lower bounds for dynamic problems , year =

Reference 74

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.871412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.871412Z digest=sha256:ff139a1c9b54303a55b9ab613f5fd77969b006335553eeaa6bff4416350d7acf

Observation e79fbf34-0f37-460c-98a6-f543a592012a · outbound

This paper cites The State of the Art in Dynamic Graph Algorithms , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle The State of the Art in Dynamic Graph Algorithms , year =

Reference 75

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:33.950822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:33.950822Z digest=sha256:86893acac1c45d4ac7038ded48a0d27662aa48ccc0ec1f7b8575bb955c53b37b

Observation 5f33197a-5e5f-4bbb-829f-bc296dff0ae1 · outbound

This paper cites The Power of Vertex Sparsifiers in Dynamic Graph Algorithms , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle The Power of Vertex Sparsifiers in Dynamic Graph Algorithms , year =

Reference 76

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.034802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.034802Z digest=sha256:a873b1e5cb670602dd3d09ababa6cf26fd1590d4a36a853167eb33095b73d5f4

Observation 52c7b6c8-b4c1-4380-b0a7-08304b6f3dba · outbound

This paper cites The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree , year =

Reference 77

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.118632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.118632Z digest=sha256:39dab2d8a84cfa71eb623aa6ffc579f26e09f678f4a3f8f761c1d1594fbde8c3

Observation a926a597-a321-4634-9c52-4105dbc20bc3 · outbound

This paper cites The power of deferral: maintaining a constant-competitive steiner tree online , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle The power of deferral: maintaining a constant-competitive steiner tree online , year =

Reference 78

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.223569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.223569Z digest=sha256:91dcd6953b44d698f4a1a29e0be349dc47c8ddc3c8cf38382387860e16180c88

Observation d3d84da4-c592-48a3-bdc1-01e6c4cafd00 · outbound

This paper cites Bender and Martin Farach.

Approximate Single Source Dual Fault Tolerant Distance Oracle Bender and Martin Farach

Reference 79

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.271749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.271749Z digest=sha256:a0bab86c9650995c9fb8e1d960e0da643b8335263f2cc1efb2e264133d14696b

Observation 517ed3af-d0a2-46c0-96a1-93ad5b6c3e62 · outbound

This paper cites The k most vital arcs in the shortest path problem , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle The k most vital arcs in the shortest path problem , year =

Reference 80

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.274881Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.274881Z digest=sha256:7ce0111a6c6cb0716920dbffa9dc9146c752e8bcc26b8d3d2de764a9ee5f0df6

Observation 4d4a494c-f498-41ad-8a96-335360fe4437 · outbound

This paper cites The discrepancy method - randomness and complexity , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle The discrepancy method - randomness and complexity , year =

Reference 81

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.277816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.277816Z digest=sha256:410cc36f3c8936480450486e012f7592e10521111f8601a4cb09c99a130858f8

Observation 336f01b1-a8b1-4843-8fcf-cf151943cebf · outbound

This paper cites and Hopcroft, John E.

Approximate Single Source Dual Fault Tolerant Distance Oracle and Hopcroft, John E

Reference 82

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.280764Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.280764Z digest=sha256:254277d8cb7ac6109f5ef56d897a66ae3ec1d5ad198ea8af283b4fa2b17ac78a

Observation 64d2f6fa-25c1-4206-bbc5-a1e4dc91db6f · outbound

This paper cites Symbolic algorithms for qualitative analysis of Markov decision processes with B.

Approximate Single Source Dual Fault Tolerant Distance Oracle Symbolic algorithms for qualitative analysis of Markov decision processes with B

Reference 83

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.283855Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.283855Z digest=sha256:25556ab7fb5ec2b4298d24447532b3f4c68562c6a5df99d95786288dbf1d468f

Observation e1d4d8f1-6618-47e4-a385-f571839b9f09 · outbound

This paper cites Subquadratic dynamic path reporting in directed graphs against an adaptive adversary , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Subquadratic dynamic path reporting in directed graphs against an adaptive adversary , year =

Reference 84

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.287111Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.287111Z digest=sha256:852eaf21dab1c15318cd3b3fc2cc4fde20b382e987a129c4b8d416e84c46cc41

Observation f0a8a04b-e20d-40b8-9d3b-5716b5a22767 · outbound

This paper cites Ryan , journal =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Ryan , journal =

Reference 85

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.290639Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.290639Z digest=sha256:239cd7857ef7abf20dbea52c600d95450947d78ddca404705c65fde4c65d290a

Observation cae02f34-11fb-4f7f-84c3-82f167e0f68f · outbound

This paper cites Italiano and Amnon Nissenzweig , journal =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Italiano and Amnon Nissenzweig , journal =

Reference 86

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.293553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.293553Z digest=sha256:ec1ee9e1222a6d9bd514fafc03aa0bd88363a458641e6fdca7c29e9604061fba

Observation a80aaa61-3b6f-4e1e-a13e-553bfba8aee0 · outbound

This paper cites Sparse Fault-Tolerant.

Approximate Single Source Dual Fault Tolerant Distance Oracle Sparse Fault-Tolerant

Reference 87

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.296317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.296317Z digest=sha256:c73a811e6989cc04cf714b9c46305b6f04d1a81080ad5f27105f4e7f123a6ec3

Observation 4d96ec94-0dc2-4eba-9a76-869f51ada3f8 · outbound

This paper cites Space--time trade-offs for stack-based algorithms , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Space--time trade-offs for stack-based algorithms , year =

Reference 88

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.299471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.299471Z digest=sha256:eada8ce328f281f6dda5026b7db810a9c5c4829691fa9085a65a7350fe076457

Observation 44ed1525-e08c-47fd-822e-97d9442cc659 · outbound

This paper cites Simultaneously Load Balancing for Every p-norm, With Reassignments , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Simultaneously Load Balancing for Every p-norm, With Reassignments , year =

Reference 89

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.302282Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.302282Z digest=sha256:7e2eb681a4f087e67ecdc985b9154357a42a36a40ff715f0c84de5178435d566

Observation a62d8e2c-8995-4c74-951e-67473b828daf · outbound

This paper cites Simple deterministic algorithms for fully dynamic maximal matching , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Simple deterministic algorithms for fully dynamic maximal matching , year =

Reference 90

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.305501Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.305501Z digest=sha256:ab8aaf4b25700b3dd7b36a054612a38b7121ff2d3d0854edc0a372b357c5f752

Observation 2c064686-9da1-4523-8151-8fad83ba62e6 · outbound

This paper cites Shortest paths in directed planar graphs with negative lengths: A linear-space O (n log 2 n)-time algorithm , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Shortest paths in directed planar graphs with negative lengths: A linear-space O (n log 2 n)-time algorithm , year =

Reference 91

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.308450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.308450Z digest=sha256:ad38888d349c52e93ab3bdd55c3444ff4808b5d4017b0c70c82bb9c7527d2495

Observation a1819689-21bc-4163-a34f-a70cfa512979 · outbound

This paper cites Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form , year =

Reference 92

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.311178Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.311178Z digest=sha256:af24e3ccd64401c0329d7739177de25dadb42fe99f24b0ec41f91ae7b8bbecb8

Observation 19d6d720-54c4-414a-9ae2-8664ba28cd6b · outbound

This paper cites Sensitive Distance and Reachability Oracles for Large Batch Updates , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Sensitive Distance and Reachability Oracles for Large Batch Updates , year =

Reference 93

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.313774Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.313774Z digest=sha256:29c13e8508cb3e1a30d2960b99b6ad042eca5fcdc425ce2900a2ddd207ed0a9b

Observation 56cba00e-da56-4bdd-aa3f-b43a983a5959 · outbound

This paper cites Self-Adjusting Binary Search Trees , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Self-Adjusting Binary Search Trees , year =

Reference 94

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.316477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.316477Z digest=sha256:1de9f786e781efae0b17e37943e22b17189a8d3d83c33e37f45460052d19e2dc

Observation 0db45601-fc94-45fc-a202-a90f61eb7a28 · outbound

This paper cites Scaling algorithms for approximate and exact maximum weight matching , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Scaling algorithms for approximate and exact maximum weight matching , year =

Reference 95

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.319365Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.319365Z digest=sha256:0730de2353793249608cd0a1c6f7dfe5cd2ce74a1d844ce044df3045036a2051

Observation b9aefeb5-e916-43e7-81d0-3da4fceb227b · outbound

This paper cites Distributed Computing , title =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Distributed Computing , title =

Reference 96

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.322567Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.322567Z digest=sha256:513fc7661d1f0710ee823200f7b5399afdbb22cf2409c82c419da895c58eb0ef

Observation 74400594-17a1-4c94-8df4-e408c40d8918 · outbound

This paper cites Replacement paths via fast matrix multiplication , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Replacement paths via fast matrix multiplication , year =

Reference 97

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.325459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.325459Z digest=sha256:9772a1f79fab2c079b1d0ffc4de8a98988b67c6d1671aa2f81569f658331a2b3

Observation 4d51be5c-c22f-4ffb-995a-69001c955d32 · outbound

This paper cites Replacement paths and k simple shortest paths in unweighted directed graphs , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Replacement paths and k simple shortest paths in unweighted directed graphs , year =

Reference 98

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.328428Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.328428Z digest=sha256:4511aa83f8a8b373523295d4cb2a1f3acb20e5b5e728f5137fea4f8a66589101

Observation 7d927b58-c20c-4fdf-9b38-9e44e3a45814 · outbound

This paper cites Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication , year =

Reference 99

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.331088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.331088Z digest=sha256:f7e770f7a00b0b91e13da537e5aedec3c4411a3f04a48b9f789f310eb53741e9

Observation 30a61a51-a85c-4ae4-a76c-bc06ada20437 · outbound

This paper cites Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation , year =.

Approximate Single Source Dual Fault Tolerant Distance Oracle Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation , year =

Reference 100

Resolution
unresolved
no resolver link, observed 2026-08-02T09:01:34.334124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T09:01:34.334124Z digest=sha256:fb932376f38628b5330cadaa953cd800c96ef5ebf0e3b92a5bf0383a41163a93

Pith citing papers

No inbound Pith citation observations are available.