{"as_of":"2026-08-10T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c97634f362afed995fb30d9fd9d6a81a289a875e763fcfc1c72494808f2d9ec","coverage":[{"denominator":243,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T09:01:34.334124Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.02999/citation-record","integrity":"/paper/2607.02999/integrity","json":"/paper/2607.02999/citation-record.json","paper":"/paper/2607.02999"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:25.633376Z","title":"Improved Distance (Sensitivity) Oracles with Subquadratic Space , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:25.633376Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:e1045883a471c629c1c58279319d395f5ac249bc6a19af5e6661286c46a3599f","observation_id":"c2c7c31f-897e-4d95-b757-2b46739ff470","resolution":{"observed_at":"2026-08-02T09:01:25.633376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:25.761569Z","title":"Approximate Distance Sensitivity Oracles in Subquadratic Space , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:25.761569Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:dd93e9d21923ad831a59df7604fb8f0baa17b81e2682b4835c9190fe069ccd40","observation_id":"faad0aac-2784-4ec7-b35f-ca3e6e53c741","resolution":{"observed_at":"2026-08-02T09:01:25.761569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:25.870557Z","title":"Incremental Topological Sort and Cycle Detection in Expected Total Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:25.870557Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:288d7cab3bef0d17b729930b98796ecb8d2d62978f58bbea494214d2007af5c9","observation_id":"1aaac6f2-e7f3-4b24-a0f7-81ed9af53c3e","resolution":{"observed_at":"2026-08-02T09:01:25.870557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.030513Z","title":"An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model , year =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.030513Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:6f3095985ec9578cba4b68f55a56eb8cd337adb8d0bc704286584f993098b21c","observation_id":"5e2970ef-b867-4424-b7ad-29a070754d2f","resolution":{"observed_at":"2026-08-02T09:01:26.030513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.202527Z","title":"Workshop on Algorithms and Data Structures , pages=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.202527Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:072fb6930f36331c6ee48888cc385d693f0efa06af0016a8921abe8c4f9698a6","observation_id":"9d5e6e76-7ca0-4b45-873e-20f056b1ab38","resolution":{"observed_at":"2026-08-02T09:01:26.202527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.339156Z","title":"2010 , publisher=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.339156Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:4e5a5aa133c9ba83df7ff0a658022e37126f377edb08199e1482cf778171f610","observation_id":"341eb966-39f7-4a00-88e1-b19cd85baa14","resolution":{"observed_at":"2026-08-02T09:01:26.339156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.469422Z","title":"Algorithmica , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.469422Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:662127665141625b84019382848d32e9a0600ef1078d8094ccd808a3df3cd3de","observation_id":"2b095f61-25d0-4e56-aaae-83b4f8400039","resolution":{"observed_at":"2026-08-02T09:01:26.469422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.582504Z","title":"Nearly 2-Approximate Distance Oracles in Subquadratic Time , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.582504Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:2ebfd2eb56427bc0478b1066289971acf2175c7d3c94954fe7be0bc7a3b752f5","observation_id":"b8e45b3c-0d0e-495f-88b3-d7bfd5e691da","resolution":{"observed_at":"2026-08-02T09:01:26.582504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.715971Z","title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.715971Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:42e23879251361931b38578588d17b2be025a77bddf043b40f27450cae819605","observation_id":"d37930b7-9efd-41c2-97cb-40a220654ba3","resolution":{"observed_at":"2026-08-02T09:01:26.715971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.841185Z","title":"Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35 , pages=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.841185Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:f98cffd54c53cb6ba6300e33cfd1d84615be4da68eaa064b765cb0f582d0ac40","observation_id":"050e6746-30a1-4e8d-bf90-96e62e62b37d","resolution":{"observed_at":"2026-08-02T09:01:26.841185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:26.960445Z","title":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:26.960445Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:eb659ff38989b93f61e93de682794f75ffd10e20e6fc5714b0dc1d7489f97e4e","observation_id":"95c99cf5-0147-4a2b-b3dd-420db7043b6d","resolution":{"observed_at":"2026-08-02T09:01:26.960445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.174415Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.174415Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:2624b6bc65faaa673f508bf34f9432fa08ee3f4e2577aebed80c8ea4a1fdf83a","observation_id":"b7bc2f1b-6aba-4d8a-ba2e-11e7bafebb61","resolution":{"observed_at":"2026-08-02T09:01:27.174415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.340678Z","title":"European Symposium on Algorithms , pages=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.340678Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:17a2a08062659f1747635aed2281e6756e570347ec5435eb98945c24696eb3ea","observation_id":"78d346af-8131-4548-9799-6939b642a2ba","resolution":{"observed_at":"2026-08-02T09:01:27.340678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.405912Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.405912Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:61b41a153533e2d46f81c96f5fd0567a597f244d4b8f9e0b43e1d8460e476c2a","observation_id":"ccf9e256-a58f-4435-bb28-32ffe3f81cbb","resolution":{"observed_at":"2026-08-02T09:01:27.405912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.485148Z","title":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.485148Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:651f85870bf3610c337e4ac017c1cdf324de3a43b29ca5df34192c7f59b96868","observation_id":"4a3a3fe7-94ef-4a78-b4e3-a209d9ef35d5","resolution":{"observed_at":"2026-08-02T09:01:27.485148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.564819Z","title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.564819Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:bc36342dd7b2b8bae18a46f0a38b75a4ee44b5912060e5781c7e6cd134b6a8cb","observation_id":"a81e2ccd-56f6-46f3-a126-aa810ad21a64","resolution":{"observed_at":"2026-08-02T09:01:27.564819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.648713Z","title":"International Colloquium on Automata, Languages, and Programming , pages=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.648713Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:c017551be53529d7ca24bf54dc55ad5d389c8f55da493555db1c67b05ad89534","observation_id":"0fc0c97c-583e-4ecc-ac9d-f19478f57e3e","resolution":{"observed_at":"2026-08-02T09:01:27.648713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.727912Z","title":"ACM SIGACT News , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.727912Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:43c293bd6d64961eab676735ba5d89ce6600aa8606d65e0c0449792e011238ef","observation_id":"318b5371-0183-4398-8388-b048ac47f2b9","resolution":{"observed_at":"2026-08-02T09:01:27.727912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.769910Z","title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.769910Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:35b2f0d4b655e9391ed259ed9f1666d7069f28e38e748a98e01633a124c70267","observation_id":"72f0e6e1-5a73-4947-a0fb-7e8c1bc8e6f7","resolution":{"observed_at":"2026-08-02T09:01:27.769910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.852765Z","title":"TheoretiCS , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.852765Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:fb0f221659ab9cd2ff46db6eaf0201fa51aa0545dd6c76b202e1957dfb41baa8","observation_id":"a6a3580d-16e3-47b9-a80f-804dccd0fcb5","resolution":{"observed_at":"2026-08-02T09:01:27.852765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:27.985767Z","title":"Approximate Distance Sensitivity Oracles in Subquadratic Space , journal =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:27.985767Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7e41ddbbac2b197dc899531ca668c4232b1f3d9b0ff45739e87772b6dc962245","observation_id":"f95bbe8a-7504-4808-a2f4-081599407743","resolution":{"observed_at":"2026-08-02T09:01:27.985767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:28.131720Z","title":"Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees , journal =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.131720Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:1e31b6e119c335f8f7d3e42f1a4ca3272c8d4c63e30b3d62336122df45288464","observation_id":"7afe5495-732a-4190-83b7-27c9989e2830","resolution":{"observed_at":"2026-08-02T09:01:28.131720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:28.275545Z","title":"Journal of computer and system sciences , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.275545Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:18529da02410c171e981e79714211616bdbd67ebc55e060e7c94c06347a98d3c","observation_id":"028d475e-5333-49c3-9cbb-85f6fcda2f01","resolution":{"observed_at":"2026-08-02T09:01:28.275545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:28.368907Z","title":"Journal of Algorithms , volume=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.368907Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:4714dc846ced8519d0fc6cdc1d9aec8bb7da4e914f1774e5bf86fcb356a19a1b","observation_id":"6a79855d-20aa-4b9b-b8e0-e50ca8e59af7","resolution":{"observed_at":"2026-08-02T09:01:28.368907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:28.502886Z","title":"All-pairs nearly 2-approximate shortest paths in","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.502886Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7ea3dcd6d1694ac5e0e4d70b9cab8e48efbefcb43cdb1fd05d8cd7fde226e16d","observation_id":"d1da6ec3-4bd7-40f5-80f0-90c8b9c5d0b3","resolution":{"observed_at":"2026-08-02T09:01:28.502886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:28.660759Z","title":"43rd International Colloquium on Automata, Languages, and Programming,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.660759Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:2e549296e7c43cc038e72f5cbf80ac150b2635fc0ddc7264432e1647212e6c11","observation_id":"6367d682-0085-4037-b632-7f8f2b2abbf5","resolution":{"observed_at":"2026-08-02T09:01:28.660759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:28.824608Z","title":"Compact routing schemes , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.824608Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:b52fbed474e510ccb585648824cbe40f7b42d20f3fc75e7cfc8dbd0e7b5cd054","observation_id":"c79f6f32-ca6b-403a-856a-ba8b29996d64","resolution":{"observed_at":"2026-08-02T09:01:28.824608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.03456","last_updated":"2025-05-20T06:32:21Z","snapshot_observed_at":"2026-08-02T07:41:10.608026Z","submitted_at":"2022-03-07T15:15:09Z","title":"Negative-Weight Single-Source Shortest Paths in Near-linear Time","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.03456","snapshot_observed_at":"2026-08-02T09:01:28.948253Z","title":"CoRR , title =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:28.948253Z"},"links":{"cited_paper":"/paper/2203.03456","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:d8fcd07256686786b59b299e84637dcfb061ca05b0bfd4134a692e0e42204096","observation_id":"091d6c5d-edfd-4cdd-be44-a46f47d6aeea","resolution":{"observed_at":"2026-08-02T09:01:28.948253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.100820Z","title":"A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.100820Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:3ad252fe6f01ba1edf0a544a1308da483dca0de09feffd89e1cad31ecf8c2280","observation_id":"39767d74-339c-4152-8696-c1a75394c9e2","resolution":{"observed_at":"2026-08-02T09:01:29.100820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.261617Z","title":"Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.261617Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:624359cef0fe33d1b2998d956efd93f42edc6eed2a918a0398fb59f2f319b350","observation_id":"2bdae90a-aecb-47d3-a5c3-3eb607006d57","resolution":{"observed_at":"2026-08-02T09:01:29.261617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.430266Z","title":"Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.430266Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:700a2c26db3d9198f418d35de02fd365dd49b3c8ec4ac7705a4168a29aada667","observation_id":"1b2e89bc-2b26-4a2a-9d35-aed027ce7593","resolution":{"observed_at":"2026-08-02T09:01:29.430266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.560898Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.560898Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:a11357dae00b32a4383a8adbe81ac552a04977f8bdc03174b16ab0d2abda95c1","observation_id":"c6a522aa-e9cd-4bd2-8fe3-dc496702c6a2","resolution":{"observed_at":"2026-08-02T09:01:29.560898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.692798Z","title":"Fast 2-Approximate All-Pairs Shortest Paths , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.692798Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:e5f68e168d013ce91911fb4635aec09ee3b6f2da28eef99979952f1e8f8a0da5","observation_id":"0187f081-c18f-40b3-9d39-480c7163bc76","resolution":{"observed_at":"2026-08-02T09:01:29.692798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.838269Z","title":"New Algorithms for All Pairs Approximate Shortest Paths , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.838269Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:179b01538fa9b0a0cfe1582e290e600d1e71cf44692958d802f65f979b232869","observation_id":"db27488f-03ba-4406-8d22-e876dfb5eecd","resolution":{"observed_at":"2026-08-02T09:01:29.838269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:29.960926Z","title":"Faster Approximate All Pairs Shortest Paths , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:29.960926Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:f449745093fca6e4a57b17bcb43db5aacccc8caa89ce0117dcd7edd98d0f6e93","observation_id":"02626664-9893-47c2-90bd-0f422eb9299e","resolution":{"observed_at":"2026-08-02T09:01:29.960926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.019854Z","title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.019854Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:9af4fe4dcded674261b1dd965eab2bc3fffa2dc435e91749576c638b2c9c90fa","observation_id":"fd999e3f-5556-40dc-a226-0a9a9ad8a7cb","resolution":{"observed_at":"2026-08-02T09:01:30.019854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.102971Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.102971Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:5b9543350b315a2cb10a04f63538976e21d13270114470bf28fdd96645077526","observation_id":"2df458c8-39a4-4b38-9cdb-c8bd1d2efa8a","resolution":{"observed_at":"2026-08-02T09:01:30.102971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.147773Z","title":"Distributed weighted min-cut in nearly-optimal time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.147773Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:83dba9b800d0423b30774628095843db3e1789ddd2d42d2aca57a7cc21143f82","observation_id":"bb86722e-7360-4966-97a7-82d3966d5ac4","resolution":{"observed_at":"2026-08-02T09:01:30.147773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.217241Z","title":"Vertex connectivity in poly-logarithmic max-flows , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.217241Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:e6bc9918248a04c4bf115cc5be417f876ce2ccbabccfbedb92b7bfab1e2c58ae","observation_id":"d95d84e1-d71e-4f33-ae10-59f24429d464","resolution":{"observed_at":"2026-08-02T09:01:30.217241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.306528Z","title":"A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.306528Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:ab68489a8462818b91cee1b32019a732b2d7586b0e29061c3905d850248360ba","observation_id":"83c1558b-1426-40dc-8347-7ede338bd205","resolution":{"observed_at":"2026-08-02T09:01:30.306528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.480470Z","title":"Weighted min-cut: sequential, cut-query, and streaming algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.480470Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:37f6b0c9c3426c3f89470d7f6746d75dc329d2f31f938bc6f264e347be6a2495","observation_id":"84851c9f-5634-4732-ba93-0f48921618ec","resolution":{"observed_at":"2026-08-02T09:01:30.480470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08432","last_updated":"2020-11-10T09:27:32Z","snapshot_observed_at":"2026-08-09T15:10:39.159531Z","submitted_at":"2020-04-17T19:51:47Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08432","snapshot_observed_at":"2026-08-02T09:01:30.614825Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , year =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.614825Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7e750d1753f8d933bf73fd1ee4139ed50c9fad8523e07b58fa6abac5d641e4dd","observation_id":"ea9e2302-848a-4372-b798-15468b412212","resolution":{"observed_at":"2026-08-02T09:01:30.614825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.723109Z","title":"Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.723109Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:d0a3f39723615f0a9d39b6376d6238715f9bb14f88237baf54cbb02871d017bc","observation_id":"f95c21d8-5c26-4eb0-8414-9afd46750713","resolution":{"observed_at":"2026-08-02T09:01:30.723109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.815507Z","title":"Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.815507Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:10128edd2db578008850a26b49569c5d2ae58b20663b632d14f6641d10c502a9","observation_id":"3e3bda0c-a568-4807-b9b3-d962480372a6","resolution":{"observed_at":"2026-08-02T09:01:30.815507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.861604Z","title":"Distributed exact weighted all-pairs shortest paths in near-linear time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.861604Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:0e09b6978825c2d663ff673ab6cafb34d6e3c1d072f8bac61fb46ce05cf2cdd5","observation_id":"afed8a74-5a4c-4732-af7b-8dd210c6a939","resolution":{"observed_at":"2026-08-02T09:01:30.861604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:30.918890Z","title":"Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:30.918890Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:06a8a56a7a76b4f74738e8937faffb8415db46721f63c4bf7f4fed0136a2839d","observation_id":"5fd66c78-e977-4bc9-afc1-ffd9c8f0269f","resolution":{"observed_at":"2026-08-02T09:01:30.918890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.017384Z","title":"A Faster Distributed Single-Source Shortest Paths Algorithm , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.017384Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:05033599e8584c35bc57ca87f355bad5b5164d76f78778b5cb4b1595a115e3f5","observation_id":"66600e71-4737-4ca3-9eae-4d902b701375","resolution":{"observed_at":"2026-08-02T09:01:31.017384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.104863Z","title":"Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.104863Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:01fcac4d21c708384b39327808c64ac0d93629d57204b5ef0b805a5615f08ccd","observation_id":"f95f8698-8e81-4a10-8340-b1f4f32198d7","resolution":{"observed_at":"2026-08-02T09:01:31.104863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.178057Z","title":"Distributed Exact Weighted All-Pairs Shortest Paths in","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.178057Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:e61e97d10d8b27d00a9f8cfde8e8fc73be685692acbf5b91529e0197ec7aed5c","observation_id":"6080c0da-2d21-4c8c-bab4-5ded96deb86d","resolution":{"observed_at":"2026-08-02T09:01:31.178057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.281840Z","title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.281840Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:6634454f82361cc7b95489b16465478bddd3ddbef43a779db443cc04ae2ffba4","observation_id":"01dddca3-c793-4709-a098-f7f35a8b3330","resolution":{"observed_at":"2026-08-02T09:01:31.281840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.388472Z","title":"Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n\\(","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.388472Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:ba453c8cb40ea4b81dc54a739169cf1cea39ae07f5bb7a4f8f56d2a641168b2b","observation_id":"466896dd-c41b-43f2-ad56-463829602b96","resolution":{"observed_at":"2026-08-02T09:01:31.388472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.498492Z","title":"Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.498492Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:4fea1c7c56a84fe044db756add45bad041d70802e2207208fcde10dcc0d55277","observation_id":"c343d737-244c-477a-bdc1-418ddeaf0fea","resolution":{"observed_at":"2026-08-02T09:01:31.498492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.600934Z","title":"New deterministic approximation algorithms for fully dynamic matching , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.600934Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:d8c3e6771dc6b98adfb0d9819ae119e16fd82b2faa8c81d745038e2c1133ffac","observation_id":"c24ea061-9017-467b-baf5-28a292fe49c2","resolution":{"observed_at":"2026-08-02T09:01:31.600934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.707428Z","title":"Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.707428Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:049f0dad557eaacc954a31d93abd93638faffba722620870bdcc54df29eff4fe","observation_id":"96fe8bdd-07d8-4df2-9306-fdb115f0498f","resolution":{"observed_at":"2026-08-02T09:01:31.707428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.813576Z","title":"Tsourakakis , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.813576Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:62917f8fae130f73e34cfc3f2778fcb7426a3944280b1a6b24b2f0ee6f5d2508","observation_id":"d24c3510-9e29-442c-933d-7289d68cf354","resolution":{"observed_at":"2026-08-02T09:01:31.813576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:31.903388Z","title":"Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:31.903388Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:57b1a6dd21eb7a6dd07b4fa250a3de1804c782fd79340831b936a8e584650451","observation_id":"5879fc43-4807-4408-99a5-8d3cc584fcef","resolution":{"observed_at":"2026-08-02T09:01:31.903388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.042468Z","title":"Faster Algorithms for Semi-Matching Problems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.042468Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:838e29a489cc38680c2bc15378967967941e6ecac88526008cc5d8efa5db4e35","observation_id":"b8adddcf-3b0a-40ee-9af9-1e8b962ca1b9","resolution":{"observed_at":"2026-08-02T09:01:32.042468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.132894Z","title":"Almost-Tight Distributed Minimum Cut Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.132894Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:a09b8ca52c816d61ab0318b299382e4a3acee43f5fd7f2b25313edfc178dc898","observation_id":"e74c74a4-a9ea-4f57-8918-ca55fdfd3f29","resolution":{"observed_at":"2026-08-02T09:01:32.132894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.201431Z","title":"2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.201431Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:21aa3153862b2e7d026b81696c5ce3f04d91c42807020df5faa41c912a106b1d","observation_id":"06547039-bc70-4996-9da7-d32b71dde387","resolution":{"observed_at":"2026-08-02T09:01:32.201431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.331438Z","title":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.331438Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:eb1d332bb4bfe5734e5100e411b6eeb88c34d8ba3437ff6cf8f8318147775d51","observation_id":"9e658c21-56e0-4cc5-a37b-8a1e89bef220","resolution":{"observed_at":"2026-08-02T09:01:32.331438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.448629Z","title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.448629Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:f0d0b914cd8bd9c2ab88a67475c869af11adff131070b186168a79a74a478bb4","observation_id":"807daabb-2dcc-45ad-b9ad-5ffe32d51454","resolution":{"observed_at":"2026-08-02T09:01:32.448629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.558076Z","title":"Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.558076Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:9c83294ccb5682128c4aaf4ec50d100978827383c59368a77a745a31a8e418b5","observation_id":"c634c8b2-19d1-42e7-9685-f5dd35cf2f62","resolution":{"observed_at":"2026-08-02T09:01:32.558076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.684252Z","title":"Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.684252Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:3ab66dcdaa05b9129bb89fc8464a823e0b43c0abd95c6ec4773eb775c8df75a6","observation_id":"1078c88f-f50c-41d3-8eba-ca31d3751b38","resolution":{"observed_at":"2026-08-02T09:01:32.684252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04473","last_updated":"2017-04-14T16:36:22Z","snapshot_observed_at":"2026-08-09T15:04:36.878932Z","submitted_at":"2017-04-14T16:36:22Z","title":"Additive Spanners and Distance Oracles in Quadratic Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04473","snapshot_observed_at":"2026-08-02T09:01:32.825395Z","title":"Additive Spanners and Distance Oracles in Quadratic Time , journal =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.825395Z"},"links":{"cited_paper":"/paper/1704.04473","citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:554f4dbd33c6bedad78d72ea2ce91674df6282c8b26caa40e7ea098e1be82802","observation_id":"ee9b14e2-c7c0-4a0a-89a8-24a7c4c2ddea","resolution":{"observed_at":"2026-08-02T09:01:32.825395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:32.982957Z","title":"Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths , year =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:32.982957Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:a0b72d0f0f5ffdb7e0f60fd87c5bd62aa74068c85b2a476a475f36931a8ad498","observation_id":"adfe1fe8-adb1-4af3-9307-e10bbdef5ffb","resolution":{"observed_at":"2026-08-02T09:01:32.982957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.103887Z","title":"Theory Comput","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.103887Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:f5716d5aed75e462b8a8e8c09b8e460525badfaaed53aa65bd36093916a67dd4","observation_id":"c8409338-1880-448b-9e12-c95f5fa95ee4","resolution":{"observed_at":"2026-08-02T09:01:33.103887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.180337Z","title":"Weighted dynamic finger in binary search trees , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.180337Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:4e6603df8947e9d62ce10fdc809b38efdb8b0ed3c9fd55fcd36f6829ce4be504","observation_id":"f0d36a20-b717-44df-928b-1b377e8bed48","resolution":{"observed_at":"2026-08-02T09:01:33.180337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.297124Z","title":"42nd Annual Symposium on Foundations of Computer Science,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.297124Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:e5dc575f5944f1ff19be7cec2dfdc6cd8a03d5e1a67f712ca4f51242d6fea948","observation_id":"e18a7ea8-c1bd-4848-9934-00187bcebc78","resolution":{"observed_at":"2026-08-02T09:01:33.297124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.421289Z","title":"Distributed Computing - 28th International Symposium,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.421289Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:0eeafc8136400320dd6f1052240c25357b53af3568a26d9ca41651b875ac2484","observation_id":"1fc2651f-5ff6-47ca-b7ce-e5c04fa479ee","resolution":{"observed_at":"2026-08-02T09:01:33.421289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.543606Z","title":"Upper bounds for time-space trade-offs in sorting and selection , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.543606Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:0e997d8725a7b6dfb543eb496538adae6a223d1168f7416d938ec4d147671aa4","observation_id":"6380a6c5-2738-4062-8238-cf0bc96571d8","resolution":{"observed_at":"2026-08-02T09:01:33.543606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.652597Z","title":"Upper Bounds for Maximally Greedy Binary Search Trees , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.652597Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:f976ca1a8934a6b4c5d35b1b5adb42cc42691ed7c02b94bfc18905e1dd39b9fe","observation_id":"2b48cf80-a274-4f8b-8826-358298252559","resolution":{"observed_at":"2026-08-02T09:01:33.652597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.732540Z","title":"Lawrence and Wegman, Mark N","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.732540Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:52bd425e41ce48b8fb7a4b8ac4b2256c4102f6bbe2a3135327dce1d5998501e9","observation_id":"59ef3370-c4c1-4754-978d-314611570c5f","resolution":{"observed_at":"2026-08-02T09:01:33.732540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.787179Z","title":"Truthful unit-demand auctions with budgets revisited , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.787179Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:237388b3b3865343f86cc58bede4aac7c1877d1af1730bb2cc7684691a46cb84","observation_id":"11af6192-cd8e-4963-ae69-f2054bff8d9e","resolution":{"observed_at":"2026-08-02T09:01:33.787179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.871412Z","title":"Towards polynomial lower bounds for dynamic problems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.871412Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:ff139a1c9b54303a55b9ab613f5fd77969b006335553eeaa6bff4416350d7acf","observation_id":"0b1b1790-723c-4660-acff-32d9f851bb6b","resolution":{"observed_at":"2026-08-02T09:01:33.871412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:33.950822Z","title":"The State of the Art in Dynamic Graph Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:33.950822Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:86893acac1c45d4ac7038ded48a0d27662aa48ccc0ec1f7b8575bb955c53b37b","observation_id":"e79fbf34-0f37-460c-98a6-f543a592012a","resolution":{"observed_at":"2026-08-02T09:01:33.950822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.034802Z","title":"The Power of Vertex Sparsifiers in Dynamic Graph Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.034802Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:a873b1e5cb670602dd3d09ababa6cf26fd1590d4a36a853167eb33095b73d5f4","observation_id":"5f33197a-5e5f-4bbb-829f-bc296dff0ae1","resolution":{"observed_at":"2026-08-02T09:01:34.034802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.118632Z","title":"The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.118632Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:39dab2d8a84cfa71eb623aa6ffc579f26e09f678f4a3f8f761c1d1594fbde8c3","observation_id":"52c7b6c8-b4c1-4380-b0a7-08304b6f3dba","resolution":{"observed_at":"2026-08-02T09:01:34.118632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.223569Z","title":"The power of deferral: maintaining a constant-competitive steiner tree online , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.223569Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:91dcd6953b44d698f4a1a29e0be349dc47c8ddc3c8cf38382387860e16180c88","observation_id":"a926a597-a321-4634-9c52-4105dbc20bc3","resolution":{"observed_at":"2026-08-02T09:01:34.223569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.271749Z","title":"Bender and Martin Farach","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.271749Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:a0bab86c9650995c9fb8e1d960e0da643b8335263f2cc1efb2e264133d14696b","observation_id":"d3d84da4-c592-48a3-bdc1-01e6c4cafd00","resolution":{"observed_at":"2026-08-02T09:01:34.271749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.274881Z","title":"The k most vital arcs in the shortest path problem , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.274881Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7ce0111a6c6cb0716920dbffa9dc9146c752e8bcc26b8d3d2de764a9ee5f0df6","observation_id":"517ed3af-d0a2-46c0-96a1-93ad5b6c3e62","resolution":{"observed_at":"2026-08-02T09:01:34.274881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.277816Z","title":"The discrepancy method - randomness and complexity , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.277816Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:410cc36f3c8936480450486e012f7592e10521111f8601a4cb09c99a130858f8","observation_id":"4d4a494c-f498-41ad-8a96-335360fe4437","resolution":{"observed_at":"2026-08-02T09:01:34.277816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.280764Z","title":"and Hopcroft, John E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.280764Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:254277d8cb7ac6109f5ef56d897a66ae3ec1d5ad198ea8af283b4fa2b17ac78a","observation_id":"336f01b1-a8b1-4843-8fcf-cf151943cebf","resolution":{"observed_at":"2026-08-02T09:01:34.280764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.283855Z","title":"Symbolic algorithms for qualitative analysis of Markov decision processes with B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.283855Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:25556ab7fb5ec2b4298d24447532b3f4c68562c6a5df99d95786288dbf1d468f","observation_id":"64d2f6fa-25c1-4206-bbc5-a1e4dc91db6f","resolution":{"observed_at":"2026-08-02T09:01:34.283855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.287111Z","title":"Subquadratic dynamic path reporting in directed graphs against an adaptive adversary , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.287111Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:852eaf21dab1c15318cd3b3fc2cc4fde20b382e987a129c4b8d416e84c46cc41","observation_id":"e1d4d8f1-6618-47e4-a385-f571839b9f09","resolution":{"observed_at":"2026-08-02T09:01:34.287111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.290639Z","title":"Ryan , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.290639Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:239cd7857ef7abf20dbea52c600d95450947d78ddca404705c65fde4c65d290a","observation_id":"f0a8a04b-e20d-40b8-9d3b-5716b5a22767","resolution":{"observed_at":"2026-08-02T09:01:34.290639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.293553Z","title":"Italiano and Amnon Nissenzweig , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.293553Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:ec1ee9e1222a6d9bd514fafc03aa0bd88363a458641e6fdca7c29e9604061fba","observation_id":"cae02f34-11fb-4f7f-84c3-82f167e0f68f","resolution":{"observed_at":"2026-08-02T09:01:34.293553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.296317Z","title":"Sparse Fault-Tolerant","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.296317Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:c73a811e6989cc04cf714b9c46305b6f04d1a81080ad5f27105f4e7f123a6ec3","observation_id":"a80aaa61-3b6f-4e1e-a13e-553bfba8aee0","resolution":{"observed_at":"2026-08-02T09:01:34.296317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.299471Z","title":"Space--time trade-offs for stack-based algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.299471Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:eada8ce328f281f6dda5026b7db810a9c5c4829691fa9085a65a7350fe076457","observation_id":"4d96ec94-0dc2-4eba-9a76-869f51ada3f8","resolution":{"observed_at":"2026-08-02T09:01:34.299471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.302282Z","title":"Simultaneously Load Balancing for Every p-norm, With Reassignments , year =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.302282Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:7e2eb681a4f087e67ecdc985b9154357a42a36a40ff715f0c84de5178435d566","observation_id":"44ed1525-e08c-47fd-822e-97d9442cc659","resolution":{"observed_at":"2026-08-02T09:01:34.302282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.305501Z","title":"Simple deterministic algorithms for fully dynamic maximal matching , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.305501Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:ab8aaf4b25700b3dd7b36a054612a38b7121ff2d3d0854edc0a372b357c5f752","observation_id":"a62d8e2c-8995-4c74-951e-67473b828daf","resolution":{"observed_at":"2026-08-02T09:01:34.305501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.308450Z","title":"Shortest paths in directed planar graphs with negative lengths: A linear-space O (n log 2 n)-time algorithm , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.308450Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:ad38888d349c52e93ab3bdd55c3444ff4808b5d4017b0c70c82bb9c7527d2495","observation_id":"2c064686-9da1-4523-8151-8fad83ba62e6","resolution":{"observed_at":"2026-08-02T09:01:34.308450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.311178Z","title":"Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.311178Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:af24e3ccd64401c0329d7739177de25dadb42fe99f24b0ec41f91ae7b8bbecb8","observation_id":"a1819689-21bc-4163-a34f-a70cfa512979","resolution":{"observed_at":"2026-08-02T09:01:34.311178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.313774Z","title":"Sensitive Distance and Reachability Oracles for Large Batch Updates , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.313774Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:29c13e8508cb3e1a30d2960b99b6ad042eca5fcdc425ce2900a2ddd207ed0a9b","observation_id":"19d6d720-54c4-414a-9ae2-8664ba28cd6b","resolution":{"observed_at":"2026-08-02T09:01:34.313774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.316477Z","title":"Self-Adjusting Binary Search Trees , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.316477Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:1de9f786e781efae0b17e37943e22b17189a8d3d83c33e37f45460052d19e2dc","observation_id":"56cba00e-da56-4bdd-aa3f-b43a983a5959","resolution":{"observed_at":"2026-08-02T09:01:34.316477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.319365Z","title":"Scaling algorithms for approximate and exact maximum weight matching , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.319365Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:0730de2353793249608cd0a1c6f7dfe5cd2ce74a1d844ce044df3045036a2051","observation_id":"0db45601-fc94-45fc-a202-a90f61eb7a28","resolution":{"observed_at":"2026-08-02T09:01:34.319365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.322567Z","title":"Distributed Computing , title =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.322567Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:513fc7661d1f0710ee823200f7b5399afdbb22cf2409c82c419da895c58eb0ef","observation_id":"b9aefeb5-e916-43e7-81d0-3da4fceb227b","resolution":{"observed_at":"2026-08-02T09:01:34.322567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.325459Z","title":"Replacement paths via fast matrix multiplication , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.325459Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:9772a1f79fab2c079b1d0ffc4de8a98988b67c6d1671aa2f81569f658331a2b3","observation_id":"74400594-17a1-4c94-8df4-e408c40d8918","resolution":{"observed_at":"2026-08-02T09:01:34.325459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.328428Z","title":"Replacement paths and k simple shortest paths in unweighted directed graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.328428Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:4511aa83f8a8b373523295d4cb2a1f3acb20e5b5e728f5137fea4f8a66589101","observation_id":"4d51be5c-c22f-4ffb-995a-69001c955d32","resolution":{"observed_at":"2026-08-02T09:01:34.328428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.331088Z","title":"Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.331088Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:f7e770f7a00b0b91e13da537e5aedec3c4411a3f04a48b9f789f310eb53741e9","observation_id":"7d927b58-c20c-4fdf-9b38-9e44e3a45814","resolution":{"observed_at":"2026-08-02T09:01:34.331088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:01:34.334124Z","title":"Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-02T09:01:34.334124Z"},"links":{"citing_paper":"/paper/2607.02999"},"observation_digest":"sha256:fb932376f38628b5330cadaa953cd800c96ef5ebf0e3b92a5bf0383a41163a93","observation_id":"30a61a51-a85c-4ae4-a76c-bc06ada20437","resolution":{"observed_at":"2026-08-02T09:01:34.334124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.02999","last_updated":"2026-07-18T16:50:21Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T09:01:23.266924Z","submitted_at":"2026-07-03T06:33:14Z","title":"Approximate Single Source Dual Fault Tolerant Distance Oracle"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":243},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}