{"as_of":"2026-08-10T04:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04806739eab4b58bbfc28aaca381dbc994b5ba6a1726955abc8da95dbe712c53","coverage":[{"denominator":242,"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-01T14:44:19.320528Z","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-09T06:31:02.800959+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.18714/citation-record","integrity":"/paper/2607.18714/integrity","json":"/paper/2607.18714/citation-record.json","paper":"/paper/2607.18714"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T14:44:06.704569Z","title":"Journal of the ACM , volume =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:06.704569Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ff13a01b2764ea609ecabde4997734044337333c5f55bf3ba4d4cd0c5ddddb92","observation_id":"74e2ecf6-cbf8-4c9d-981a-548deb95a9de","resolution":{"observed_at":"2026-08-01T14:44:06.704569Z","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-01T14:44:06.762339Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:06.762339Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:87970e104ab2df010a5bef5cbaf4a3d59b5f485eb41b6e6d307158b83b60985c","observation_id":"2bf0b0a5-0dcb-4f59-aa7a-ce5deaa75359","resolution":{"observed_at":"2026-08-01T14:44:06.762339Z","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-01T14:44:06.865433Z","title":"Journal of Complexity , volume =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:06.865433Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:2ce1d86209c65a16ecae6220d5b93291be3df400cba52b92d7f9857bb09827ea","observation_id":"0fec2e60-8af1-4743-bb18-fa2ceb890dc4","resolution":{"observed_at":"2026-08-01T14:44:06.865433Z","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-01T14:44:06.972754Z","title":"Improved Additive Approximation Algorithms for","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:06.972754Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b6cc7991f10e6a40d367c16873a2701306c852ec84adaf3857687b48fe7976c4","observation_id":"4596c994-79a0-41c2-8662-12ed1bc36be6","resolution":{"observed_at":"2026-08-01T14:44:06.972754Z","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-01T14:44:07.075937Z","title":"Incremental Topological Sort and Cycle Detection in Expected Total Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.075937Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:d77ea87367711c222a7e7809bfddb6a95eac6f86c9fb9c57db9371d5793fa40c","observation_id":"e407f475-5629-4fd7-b6b7-afe54fbb5465","resolution":{"observed_at":"2026-08-01T14:44:07.075937Z","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-01T14:44:07.133581Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.133581Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:8575c49be91017d8516dc084bc965d100e83ab1e415a2d5c6f5dbedec60e5737","observation_id":"67849ef6-50bf-449c-a1d5-557aab0aafe9","resolution":{"observed_at":"2026-08-01T14:44:07.133581Z","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-01T14:44:07.221552Z","title":"Workshop on Algorithms and Data Structures , pages=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.221552Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:018df53fe0c7a3db4b14c321e408218b249aaef602c29c9eb3dc9a5b6716a981","observation_id":"a03665c0-7ae4-42bd-a8ac-5c9de022dc0f","resolution":{"observed_at":"2026-08-01T14:44:07.221552Z","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-01T14:44:07.354632Z","title":"2010 , publisher=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.354632Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:1d5925f08dab344253aba61493874f75688568122ccdb3d0e5fd6e2bceba20a7","observation_id":"7517b6e0-2bb1-416d-9266-8c919f49db23","resolution":{"observed_at":"2026-08-01T14:44:07.354632Z","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-01T14:44:07.458117Z","title":"Algorithmica , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.458117Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:444696b241b2bea8c04fe794d88d0cf311bef16644af3adc57c4f51d47c4cf6a","observation_id":"2d0c243e-3450-49d9-9b25-3187acf40f4f","resolution":{"observed_at":"2026-08-01T14:44:07.458117Z","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-01T14:44:07.592426Z","title":"Nearly 2-Approximate Distance Oracles in Subquadratic Time , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.592426Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:9498cb57683bf64e1cdfa3d979861881073224a6b18287b80675f51cb6e6dff0","observation_id":"9eef5ef2-2bff-4d7e-bc14-60e133e53b7f","resolution":{"observed_at":"2026-08-01T14:44:07.592426Z","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-01T14:44:07.703673Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.703673Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:83da18831f123547e6a55f599bb8a2148534c8de6d63d4391ac4b64cc408163e","observation_id":"3380146c-5901-4cfc-ba95-f2a7d5bad877","resolution":{"observed_at":"2026-08-01T14:44:07.703673Z","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-01T14:44:07.817333Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.817333Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:328e7720748bbb00cf6a858663fb60f956ef5de3866b30b6bbad8cc904e20ffa","observation_id":"e7809fbf-91ea-4def-84e3-d4d4ed0a8ff4","resolution":{"observed_at":"2026-08-01T14:44:07.817333Z","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-01T14:44:07.969044Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:07.969044Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:1410912e813030679bfa93d5c4c63b842575d823f2fd763af456bc1f686e75b6","observation_id":"818dc335-a9ce-47d8-bca1-c5639f3ce7ae","resolution":{"observed_at":"2026-08-01T14:44:07.969044Z","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-01T14:44:08.115022Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:08.115022Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b90033fb3b532b838d2a9b2cb0b964da090fcee77bedbe5d0355c3c5207a9665","observation_id":"6effa060-f916-41c8-a390-7650639410d9","resolution":{"observed_at":"2026-08-01T14:44:08.115022Z","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-01T14:44:08.259096Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:08.259096Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:826d62e0f1e97ec69eeedd8cc89e88a98f853598c5c2fc2b063096cd8908c449","observation_id":"b048ed71-53bf-4923-926c-209180debc00","resolution":{"observed_at":"2026-08-01T14:44:08.259096Z","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-01T14:44:08.416384Z","title":"TheoretiCS , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:08.416384Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:7ae18f6df723098f52ec09e36d059051f4527b004366bb403eaa6c9db8cbe779","observation_id":"c11f0bf4-887f-4605-9b39-4b2690f00f75","resolution":{"observed_at":"2026-08-01T14:44:08.416384Z","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-01T14:44:08.561579Z","title":"Journal of computer and system sciences , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:08.561579Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b3df40a800af9102d1381f9ab1ca6ad7a54a216ec5e196ec95e2e61b6718bee7","observation_id":"507282d8-1394-4662-b632-cf91943c50d4","resolution":{"observed_at":"2026-08-01T14:44:08.561579Z","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-01T14:44:08.758650Z","title":"Journal of Algorithms , volume=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:08.758650Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:965b97fefefc448b16f59f9e28d68dcd1a98f48c265a3ff6023bdfe28c2393aa","observation_id":"7e7ded90-fc02-4374-9f09-45e8c38aab15","resolution":{"observed_at":"2026-08-01T14:44:08.758650Z","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-01T14:44:08.859554Z","title":"All-pairs nearly 2-approximate shortest paths in","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:08.859554Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:fd4836dbaa649d234ed4a63dc66a6c9dd642682cf5c460164dceae2b2db3e4db","observation_id":"2d81c694-f4ec-459c-b4e2-65de02622810","resolution":{"observed_at":"2026-08-01T14:44:08.859554Z","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-01T14:44:09.025702Z","title":"43rd International Colloquium on Automata, Languages, and Programming,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.025702Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:5c56eb5caeef35987fe50bed3eb3841f6ce381596bc2650bcb962588c6ed9f5b","observation_id":"abe2ab1f-3897-46ae-af9f-38b6856051f9","resolution":{"observed_at":"2026-08-01T14:44:09.025702Z","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-01T14:44:09.161187Z","title":"CoRR , title =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.161187Z"},"links":{"cited_paper":"/paper/2203.03456","citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:52614ce75a07ac1ca2e2a4acfef7641e100d869afd1eeb0656df3d6bbdaef234","observation_id":"bd1e2cb5-4666-4dd4-a0f4-b8b876d8dfac","resolution":{"observed_at":"2026-08-01T14:44:09.161187Z","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-01T14:44:09.279621Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.279621Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:d8e12abda817d356c225ea4b809e2b5d213b7775f87883b67d3023708c6353c2","observation_id":"d5e3bcba-fb17-450b-812a-0335f8aad99b","resolution":{"observed_at":"2026-08-01T14:44:09.279621Z","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-01T14:44:09.383866Z","title":"Dynamic Set Cover: Improved Amortized and Worst-Case Update Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.383866Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:26bd7a2fbaed326ad7250484b7c3394297997835ef79af2ba370265e6243faf9","observation_id":"d2c800af-ac5e-4463-9cf0-af2a79a63a38","resolution":{"observed_at":"2026-08-01T14:44:09.383866Z","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-01T14:44:09.537462Z","title":"Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.537462Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b73dbfe0a2dc4d79d01bbf185991ef2ce39a12d93e3dc522928a735ba397728c","observation_id":"0c98bb5e-7c9c-4e53-800e-ed628b79846b","resolution":{"observed_at":"2026-08-01T14:44:09.537462Z","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-01T14:44:09.634959Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.634959Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:4f66ff0c0d00c5334d81338f0dfcaccdf6c6efc63a6912ee81f606636739d689","observation_id":"b1284a07-5d33-4fb8-81bd-33ef30266cc6","resolution":{"observed_at":"2026-08-01T14:44:09.634959Z","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-01T14:44:09.759802Z","title":"Fast 2-Approximate All-Pairs Shortest Paths , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.759802Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:c764dd4176c00eb7941d9cda999e3ff86052d39e9f061f2a95492406b6da8a34","observation_id":"f237dbd4-46cf-4332-8610-864d75af06b6","resolution":{"observed_at":"2026-08-01T14:44:09.759802Z","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-01T14:44:09.900772Z","title":"New Algorithms for All Pairs Approximate Shortest Paths , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:09.900772Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:08a80e1036d16e9348a7798e68b3a91227c71d83288b085c74f9e1afcc0028c0","observation_id":"1625969a-af24-44b8-9688-34bf988d5fd5","resolution":{"observed_at":"2026-08-01T14:44:09.900772Z","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-01T14:44:10.034935Z","title":"Faster Approximate All Pairs Shortest Paths , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.034935Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:3196fac4b92625ea9fdfe400e6d17f64505d7019b819ea1eaeb415a9c918ed0c","observation_id":"101bf5f1-18ea-4aee-a6af-6d8acbe0ca8b","resolution":{"observed_at":"2026-08-01T14:44:10.034935Z","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-01T14:44:10.152320Z","title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , year=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.152320Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ffa5f255014f19ac7808d50322e8e3c45ef9743562efd9102b49473c14d8b622","observation_id":"89d7277d-341a-4ea4-86ff-f408753ef2c4","resolution":{"observed_at":"2026-08-01T14:44:10.152320Z","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-01T14:44:10.291120Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.291120Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b8e472279ff8fdfeab6984c3038786d55771b333a3411a6ea0dcd5044ed4cdab","observation_id":"751ecca4-5465-4f6e-a21b-ec6a4aaa8840","resolution":{"observed_at":"2026-08-01T14:44:10.291120Z","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-01T14:44:10.452230Z","title":"Distributed weighted min-cut in nearly-optimal time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.452230Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:2d01acb7a66710aae77cff103af6e4477328f647a0f2566fe1bd583168fddb87","observation_id":"21179dfb-43a5-4172-850b-6c19d8b12aed","resolution":{"observed_at":"2026-08-01T14:44:10.452230Z","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-01T14:44:10.548819Z","title":"Vertex connectivity in poly-logarithmic max-flows , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.548819Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:5797e4725ac78fbbeeeedfdb66c3bf40ed05f535626d26dc86a6c2cf318e9fa7","observation_id":"a06de212-1a45-490b-9de8-3cb72358db44","resolution":{"observed_at":"2026-08-01T14:44:10.548819Z","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-01T14:44:10.646490Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.646490Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:fe06455bd070def8989fa6e524ec641c4b03ff78213879252a5ba8dc3d4e78c8","observation_id":"1ced37d5-5e69-4224-ad4f-1d8d5cb2a639","resolution":{"observed_at":"2026-08-01T14:44:10.646490Z","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-01T14:44:10.764347Z","title":"Weighted min-cut: sequential, cut-query, and streaming algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.764347Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:59bc5b6deed9075d271c42c90fbb399fb2cc640c5140338de9c8207a50234273","observation_id":"63d15072-a1ad-40d1-a7ed-9dbb8fe1ab0b","resolution":{"observed_at":"2026-08-01T14:44:10.764347Z","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-01T14:44:10.888950Z","title":"Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , year =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.888950Z"},"links":{"cited_paper":"/paper/2004.08432","citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:f1767c600d7e0f105e5ee222ef56662698c1d6e723b54e41d26b23cbaacc60c1","observation_id":"555a86f5-7851-4612-840e-7939a194f6b7","resolution":{"observed_at":"2026-08-01T14:44:10.888950Z","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-01T14:44:10.990375Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:10.990375Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:858e1bf239942e3a3fd714de14ff28f2d9f324040d1139c26ee2537929589392","observation_id":"5ff5d00b-4799-404a-836e-507bec21c984","resolution":{"observed_at":"2026-08-01T14:44:10.990375Z","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-01T14:44:11.125696Z","title":"Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.125696Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:cec42a9bb9e37d0b7fe8375a24ebff51ece332018db6a1afcc9710e38c12bb24","observation_id":"880d2833-ed1a-41e8-95ae-4a8cc467611d","resolution":{"observed_at":"2026-08-01T14:44:11.125696Z","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-01T14:44:11.200774Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.200774Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:aa07919a3311756cb816b55fad23183f9401ebe55bbf0eb338c86273362b6574","observation_id":"f6fa0562-ef6e-49a7-bf22-733b28dd944d","resolution":{"observed_at":"2026-08-01T14:44:11.200774Z","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-01T14:44:11.361935Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.361935Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:f8a837003688cb63465e84d09c82c7b9a478c9ed7013cedb7fe0c35ae1aad242","observation_id":"e927be1e-19a2-4acf-9fec-d1dd6e62c112","resolution":{"observed_at":"2026-08-01T14:44:11.361935Z","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-01T14:44:11.503906Z","title":"A Faster Distributed Single-Source Shortest Paths Algorithm , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.503906Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:10439b35a1ac416061cb806169d2b1a6cb86d674b8edef2d36c19104e6425739","observation_id":"e376f59d-b0c6-4e1d-b77e-cf1f788baf6d","resolution":{"observed_at":"2026-08-01T14:44:11.503906Z","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-01T14:44:11.593577Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.593577Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b66ff1dbfcf294a71f824ffd16091c82d257334dab528168c705fe6f341aa966","observation_id":"53be401c-3df3-4d0e-bf1a-8f902321b6df","resolution":{"observed_at":"2026-08-01T14:44:11.593577Z","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-01T14:44:11.725092Z","title":"Distributed Exact Weighted All-Pairs Shortest Paths in","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.725092Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:2fd41de29fbbdbf570b121c5493f723299bb46a5127bb242935d5d02ad1c924a","observation_id":"1758d8ef-8f45-4880-a3b3-bf901c166653","resolution":{"observed_at":"2026-08-01T14:44:11.725092Z","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-01T14:44:11.863160Z","title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:11.863160Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:4dba999033034d8c6f9fd445f169fd0e18f622a5436687ad7d31bc5e3a08c6cf","observation_id":"757e110e-18e2-4eca-a2c7-8dced5c968b6","resolution":{"observed_at":"2026-08-01T14:44:11.863160Z","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-01T14:44:12.063693Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.063693Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ba9d42a12409f21c8d52c45823d63ac687146f651d1d117746fee2301743a2b1","observation_id":"ed2a2095-9f13-4d2a-b90b-4f211dc2947d","resolution":{"observed_at":"2026-08-01T14:44:12.063693Z","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-01T14:44:12.157772Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.157772Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ce1cd77bc847cad3c66ea02d60c9c5f5613d65d66365d7c14fe3b5bba6db1904","observation_id":"98348b7b-ec72-428e-a394-9fa6b1cb66e4","resolution":{"observed_at":"2026-08-01T14:44:12.157772Z","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-01T14:44:12.257521Z","title":"New deterministic approximation algorithms for fully dynamic matching , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.257521Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:3a0b8f202d09be3e5d352a4b0ffd4a0496e1539e32a39e1decd10e4a144fbc11","observation_id":"a8bf83f5-dbe6-4313-ab75-cf970785ad0d","resolution":{"observed_at":"2026-08-01T14:44:12.257521Z","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-01T14:44:12.419771Z","title":"Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.419771Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:1fac2d805fdd214cf8ea83c5b06e389c64a40fd6133fdec5ee95965108a28d8f","observation_id":"a906603b-fd21-4928-87fe-24bc1fc67013","resolution":{"observed_at":"2026-08-01T14:44:12.419771Z","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-01T14:44:12.522621Z","title":"Tsourakakis , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.522621Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ddc4960f810fc60f461151820036d2c0cb28cc6db19ade37d9472948212c4cc9","observation_id":"eae0997b-619d-466a-bb05-f07d4f5a7455","resolution":{"observed_at":"2026-08-01T14:44:12.522621Z","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-01T14:44:12.616083Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.616083Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:88a69ad47da777d9858ca148d57220d37f173ece373e2b096a7715088b6283d0","observation_id":"f2e08406-b037-4819-b333-0bf67a86653a","resolution":{"observed_at":"2026-08-01T14:44:12.616083Z","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-01T14:44:12.738092Z","title":"Faster Algorithms for Semi-Matching Problems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.738092Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:d7a6c514fc59d96040ddb137b348ee28766a80134405853817d53416da4d90b5","observation_id":"23daf8e7-c4cb-4389-93c6-9a528fddca7d","resolution":{"observed_at":"2026-08-01T14:44:12.738092Z","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-01T14:44:12.890618Z","title":"Almost-Tight Distributed Minimum Cut Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.890618Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:43444442c82b915342272ce41f6f9bde1d27ff05922c0723a663740e4648ce45","observation_id":"59823fc9-c42d-4e85-bccf-508cbef74592","resolution":{"observed_at":"2026-08-01T14:44:12.890618Z","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-01T14:44:12.995135Z","title":"2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:12.995135Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:2b6ed8d7ba28e26161e015c98b17f43530f9e40b8785e3a3115c3abc6050bc94","observation_id":"54909a9a-0558-421d-b2f2-9fe7b8ede131","resolution":{"observed_at":"2026-08-01T14:44:12.995135Z","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-01T14:44:13.159206Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.159206Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:e15dcab641f3e4b8d27641cb4be67cb783cf1b88d65afbfc20f37eb85b1f537c","observation_id":"ba22bca5-9478-4181-8ccb-7756bda52feb","resolution":{"observed_at":"2026-08-01T14:44:13.159206Z","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-01T14:44:13.294826Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.294826Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:e276b5322de552638b691e40cebe9bdc3f0677b020a40901458febd73d197ab5","observation_id":"367e8a00-d53f-4459-9327-af15e1ace597","resolution":{"observed_at":"2026-08-01T14:44:13.294826Z","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-01T14:44:13.399191Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.399191Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:f8070fd3f90869298296b952b822fb39341cecdeee6f96faad201d4d95ed9ddf","observation_id":"054e9e88-2172-4594-b7a3-ed0dcd2e3016","resolution":{"observed_at":"2026-08-01T14:44:13.399191Z","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-01T14:44:13.499312Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.499312Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:013d8b2c9e61bc0627f7f656018d61338efca0506554d5da0eae109cf8834be5","observation_id":"ac0c80fd-7ec4-49ea-a207-63dc2b1e8323","resolution":{"observed_at":"2026-08-01T14:44:13.499312Z","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-01T14:44:13.638257Z","title":"Additive Spanners and Distance Oracles in Quadratic Time , journal =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.638257Z"},"links":{"cited_paper":"/paper/1704.04473","citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:82902f514424c579c9f5dcb5173f13d154ac551481293cae53277db4c8559946","observation_id":"8c7c233d-a855-49d1-a803-157ddc2acaf3","resolution":{"observed_at":"2026-08-01T14:44:13.638257Z","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-01T14:44:13.874915Z","title":"Theory Comput","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.874915Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:c10a5f103315095d4dbb1cf5463926321fa9d315fc6a1ea0f386fa17364b348d","observation_id":"9a567530-6275-4e1f-8870-cdefca57fca3","resolution":{"observed_at":"2026-08-01T14:44:13.874915Z","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-01T14:44:13.966597Z","title":"Weighted dynamic finger in binary search trees , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:13.966597Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:c3b9db212c43cc674f6e1128950736e01d1209b7a55b0274c55c237a4214025b","observation_id":"065d36d1-374a-4f8a-b821-36966a6a3b39","resolution":{"observed_at":"2026-08-01T14:44:13.966597Z","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-01T14:44:14.105367Z","title":"42nd Annual Symposium on Foundations of Computer Science,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.105367Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:4b2fff9f5996aad04fadade667f047612b9683ba506fb4db1307401f3bf8c31d","observation_id":"5626e898-55c2-4801-a27a-9c556e83a979","resolution":{"observed_at":"2026-08-01T14:44:14.105367Z","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-01T14:44:14.179175Z","title":"Distributed Computing - 28th International Symposium,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.179175Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:1d3897ce21492dc7c0ef1445bceb98c76857df49d56f44839606b73a7c8b473f","observation_id":"0763d651-1b3a-4d2b-a449-0b256795726f","resolution":{"observed_at":"2026-08-01T14:44:14.179175Z","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-01T14:44:14.280201Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.280201Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ad7c1fbee791e1ccda3963c7a1d6ae94ec94a5b1569f6b60f1f1f493dc155a57","observation_id":"4f2ab3b2-ca3c-44a9-bc6e-28f3ed7a593a","resolution":{"observed_at":"2026-08-01T14:44:14.280201Z","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-01T14:44:14.382407Z","title":"Upper Bounds for Maximally Greedy Binary Search Trees , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.382407Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:479d7688f531972017757af557924191f6d19efafb0b2b15d73f836a2c519fda","observation_id":"97c9daf7-ea63-4148-a15f-a0db222255dd","resolution":{"observed_at":"2026-08-01T14:44:14.382407Z","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-01T14:44:14.535672Z","title":"Lawrence and Wegman, Mark N","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.535672Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:59d524a68cba9d449254169834d98faf18e1e6c8658e6fda76f312f6c00ef574","observation_id":"33d47ade-c845-4928-bb26-e05a5b66bd7a","resolution":{"observed_at":"2026-08-01T14:44:14.535672Z","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-01T14:44:14.607241Z","title":"Truthful unit-demand auctions with budgets revisited , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.607241Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:1f3eb12884b84e8bad8ad632c04263f1e045a930c511d92aae4a37af1de2a024","observation_id":"60e3b245-1177-4e7b-bbd1-1abe2145c54f","resolution":{"observed_at":"2026-08-01T14:44:14.607241Z","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-01T14:44:14.702492Z","title":"Towards polynomial lower bounds for dynamic problems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.702492Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:9515e6930977f4790ca078f3bc1f39249bd965b7f9384a34c347720dd0eec994","observation_id":"4316fdfe-3110-4a5c-813c-1aecd22c8e19","resolution":{"observed_at":"2026-08-01T14:44:14.702492Z","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-01T14:44:14.822582Z","title":"The State of the Art in Dynamic Graph Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.822582Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:2ed195a6279f556f425de78754593e7d1c8471a62c601f100d71069c0896b721","observation_id":"c8b145df-d7b7-4f6b-99a1-1965a46e076d","resolution":{"observed_at":"2026-08-01T14:44:14.822582Z","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-01T14:44:14.955235Z","title":"The Power of Vertex Sparsifiers in Dynamic Graph Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:14.955235Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:d4c88cddcce01b398921776f07a4ba6215b98ba288e3c4410fbe85145fa1d7b2","observation_id":"18844658-d839-4d8e-bc47-c829914e0358","resolution":{"observed_at":"2026-08-01T14:44:14.955235Z","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-01T14:44:15.067691Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.067691Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:852e7e33ec6ef29f00e9c31f1e6a9198cdb25b06caba14fe94dbc6f548788689","observation_id":"06540552-f22b-4b85-a52d-0ca1c125d38e","resolution":{"observed_at":"2026-08-01T14:44:15.067691Z","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-01T14:44:15.201929Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.201929Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ed54c9ffb3e34772ade1937a700d3f1aa41247e9d649d240730f206eb888ec32","observation_id":"fd1964cd-51d1-425b-9013-0623106e3583","resolution":{"observed_at":"2026-08-01T14:44:15.201929Z","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-01T14:44:15.337362Z","title":"Bender and Martin Farach","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.337362Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:6b21bdef037a65b8917947bd3d034b6f6dac5df8ce5b80805c04266d6716e1a5","observation_id":"c0400709-a973-47a7-bc72-ef4937a44943","resolution":{"observed_at":"2026-08-01T14:44:15.337362Z","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-01T14:44:15.494297Z","title":"The k most vital arcs in the shortest path problem , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.494297Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ba06c018b9a36179811b028e9012f66960d7471dbc5f9b18b83c7e76c83e4030","observation_id":"6db521e8-b183-457c-bd1d-4c944df06f8b","resolution":{"observed_at":"2026-08-01T14:44:15.494297Z","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-01T14:44:15.621178Z","title":"The discrepancy method - randomness and complexity , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.621178Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:3bbefdef14fa3a770b26feff8591ba98d3616cbd6e41d31e3e97385331cc7646","observation_id":"9fb2a2d8-e9ea-441f-b790-9e9942d1fc7e","resolution":{"observed_at":"2026-08-01T14:44:15.621178Z","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-01T14:44:15.712570Z","title":"and Hopcroft, John E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.712570Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:937f343f26d95e6546671f2a65baae19e424d4d546c9d883b811c35dd550a338","observation_id":"da0362d1-da31-45e0-b369-6b1e80702b1f","resolution":{"observed_at":"2026-08-01T14:44:15.712570Z","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-01T14:44:15.826121Z","title":"Symbolic algorithms for qualitative analysis of Markov decision processes with B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.826121Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:506a60a7c8129db6c0e52a3194a7df5fa95cb4c30d0a0abe7e9dd40198faeb0a","observation_id":"70b2ae84-0a11-48d0-b81d-f688cc54f32f","resolution":{"observed_at":"2026-08-01T14:44:15.826121Z","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-01T14:44:15.928544Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:15.928544Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:56a2f43b9659e3b3a4d11cfa8a826c212b29df02c2d28b5370fa2731fc62db80","observation_id":"f17c8ed4-1350-4bc7-add3-6e6ecca98b7d","resolution":{"observed_at":"2026-08-01T14:44:15.928544Z","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-01T14:44:16.130381Z","title":"Ryan , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:16.130381Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:370d1d5fda3b5401265c3f27c272cca2ecf8c82f644260d7718221371d45a829","observation_id":"7f9f0215-c3dc-42f1-91b7-c534bd20dc0d","resolution":{"observed_at":"2026-08-01T14:44:16.130381Z","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-01T14:44:16.298814Z","title":"Italiano and Amnon Nissenzweig , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:16.298814Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:1673d283581cec96ba30d4096290453da68b62be66092ed1dafed6b0e5ef9b41","observation_id":"f2fdc843-59e5-45dd-8e76-ca1534e5a663","resolution":{"observed_at":"2026-08-01T14:44:16.298814Z","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-01T14:44:16.492167Z","title":"Sparse Fault-Tolerant","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:16.492167Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:42e683cf7c193c9fbe81d34c2cb896443dd3c92ba2f8f4e11d043fd2d5766c3e","observation_id":"f3f1f996-c411-4efb-8334-bf8c01e3bfc4","resolution":{"observed_at":"2026-08-01T14:44:16.492167Z","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-01T14:44:16.665588Z","title":"Space--time trade-offs for stack-based algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:16.665588Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:a2ddf0c4e7f31811cd5fa3a2ecd23340a93901c572e623eb4f89eef1a0c0aab5","observation_id":"995dfdc5-baf3-4b8f-97a7-cb6241cdddc2","resolution":{"observed_at":"2026-08-01T14:44:16.665588Z","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-01T14:44:16.807372Z","title":"Simultaneously Load Balancing for Every p-norm, With Reassignments , year =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:16.807372Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:63cb519b933b44a0988cc4c1cdb1446dfe11cf9479889331a9d0a74ed2b2edb3","observation_id":"fc5acf56-d279-4c5e-85d6-b964893265c3","resolution":{"observed_at":"2026-08-01T14:44:16.807372Z","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-01T14:44:16.940882Z","title":"Simple deterministic algorithms for fully dynamic maximal matching , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:16.940882Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:e05bea65e52c2d381b850d7004b0831fedef80c9a05d8cdcbe57aaa22b821c94","observation_id":"e662a2f0-7106-4d5c-b55f-528473e4258d","resolution":{"observed_at":"2026-08-01T14:44:16.940882Z","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-01T14:44:17.054942Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:17.054942Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:430dbb0238a99606c10d1a041e1844f2fca5606d5cbedf2a89984dd2769df09b","observation_id":"3af56c7f-eefb-4b3e-9a5b-9a057eca7924","resolution":{"observed_at":"2026-08-01T14:44:17.054942Z","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-01T14:44:17.271519Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:17.271519Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ee143924cb7bb546f4b909fd307be4bd5d52ee6a45803a01e72e365d4c0d457a","observation_id":"fc4e7ea1-c959-439a-b75e-58231b34256c","resolution":{"observed_at":"2026-08-01T14:44:17.271519Z","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-01T14:44:17.421834Z","title":"Sensitive Distance and Reachability Oracles for Large Batch Updates , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:17.421834Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:f2dbd1a5cc4eef724dc7d95ad72d1bb66b71549574486a55ead4d65717756559","observation_id":"8b3f4a34-8624-4d16-b36a-2810fbb192f2","resolution":{"observed_at":"2026-08-01T14:44:17.421834Z","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-01T14:44:17.574944Z","title":"Self-Adjusting Binary Search Trees , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:17.574944Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:218854c74ca02ea750fe4f5cb05fb30a845aca71f1c9d4814c277cd7bacff0a9","observation_id":"77f80dc5-bd4b-4130-a023-2cfcbe806d10","resolution":{"observed_at":"2026-08-01T14:44:17.574944Z","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-01T14:44:17.743493Z","title":"Scaling algorithms for approximate and exact maximum weight matching , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:17.743493Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:287495b5cf898baed07fb7744901caba8d703bc4e976cec3b0dc0b10ffba2257","observation_id":"95d384a9-b867-4229-a099-734155bae4cc","resolution":{"observed_at":"2026-08-01T14:44:17.743493Z","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-01T14:44:17.882675Z","title":"Distributed Computing , title =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:17.882675Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b09f88603aa3625967ec9e597c9a1ed4b7f04ded4b59019d56379cb09974bce2","observation_id":"19267090-4fd1-4a4e-91a6-e930d029d3ea","resolution":{"observed_at":"2026-08-01T14:44:17.882675Z","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-01T14:44:18.105228Z","title":"Replacement paths via fast matrix multiplication , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.105228Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:262022469be5d19589b2d603c6f623062ad6542e9254fa8b067c4bda76416545","observation_id":"46b63f95-349b-46b9-824f-f63d19560bea","resolution":{"observed_at":"2026-08-01T14:44:18.105228Z","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-01T14:44:18.213347Z","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.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.213347Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:918996d647adcc5dd0cd4f9f52931b38f06b35cd274ee75e4cae3578170217fb","observation_id":"62631679-27e5-4d51-a16d-63f03414868d","resolution":{"observed_at":"2026-08-01T14:44:18.213347Z","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-01T14:44:18.331113Z","title":"Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.331113Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:6958097756611debd31fdbf4f0437599e31390c76a5b2b7688ecb9a666f17f40","observation_id":"2231d3ee-5788-4844-9926-47da18c8ea18","resolution":{"observed_at":"2026-08-01T14:44:18.331113Z","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-01T14:44:18.463883Z","title":"Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.463883Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:afebe52228f501d9cff9686f3b43257b21105f412d2697c7f213ee68ee2b0050","observation_id":"f9d65fdb-2fbb-4f5b-8c2f-e4833e829c21","resolution":{"observed_at":"2026-08-01T14:44:18.463883Z","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-01T14:44:18.566975Z","title":"Preserving Distances in Very Faulty Graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.566975Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:ee58803af3cf781f0b34796423a592670fe026240cda7aa30244c787c90b337d","observation_id":"5af02466-781a-4048-b590-2970e19e086d","resolution":{"observed_at":"2026-08-01T14:44:18.566975Z","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-01T14:44:18.620409Z","title":"Practical Minimum Cut Algorithms , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.620409Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:acf3d81dbb1a11e4ea59872be4f159ef9e2d933fe5dbb935dd6ebfd8566fd39a","observation_id":"82c400a6-f5c0-4e54-8f4c-2a4d9e531ce6","resolution":{"observed_at":"2026-08-01T14:44:18.620409Z","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-01T14:44:18.794464Z","title":"Powers of tensors and fast matrix multiplication , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.794464Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:a63679569f8739e162f953b6292593a6d3153a1286c1458f9afb62037119922f","observation_id":"48289df8-f220-4082-8901-5e479d3e3b93","resolution":{"observed_at":"2026-08-01T14:44:18.794464Z","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-01T14:44:18.927366Z","title":"Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:18.927366Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:b4e8c0f48d46ab410b64c0a3e185e096f4b733125f937f50c56797b6552c4ee9","observation_id":"4860395a-dbe5-419a-9d96-da9b4332403f","resolution":{"observed_at":"2026-08-01T14:44:18.927366Z","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-01T14:44:19.029376Z","title":"Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:19.029376Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:4417a0dc6547c7e4359f3bd60ee958315e74df9c34fba68460bb363f44e3856d","observation_id":"16505003-5563-4db3-b8ed-a071e92ab625","resolution":{"observed_at":"2026-08-01T14:44:19.029376Z","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-01T14:44:19.104034Z","title":"Edmonds , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:19.104034Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:540f60323504c5807d27fbdf466c76132ae2566ffbb66f8e94c8dba8538ad9c4","observation_id":"9c5539bb-3f20-42b8-b803-476bb972b0f1","resolution":{"observed_at":"2026-08-01T14:44:19.104034Z","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-01T14:44:19.207232Z","title":"Oracles for Distances Avoiding a Failed Node or Link , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:19.207232Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:02d53fc846f91dbf70ff88ee0599823d78f90522ef8515917052c73412334811","observation_id":"80fd35d9-1a0c-431e-aaed-d599e8596688","resolution":{"observed_at":"2026-08-01T14:44:19.207232Z","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-01T14:44:19.320528Z","title":"On the k-simple shortest paths problem in weighted directed graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-01T14:44:19.320528Z"},"links":{"citing_paper":"/paper/2607.18714"},"observation_digest":"sha256:d7459d98bcb8617be2127f0cbad79bf4817c6bfcad6fd605402d1a06d31fd650","observation_id":"f7ba5a6f-dc62-4374-887c-1bbfe2fa588c","resolution":{"observed_at":"2026-08-01T14:44:19.320528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18714","last_updated":"2026-07-21T05:11:13Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T15:04:53.799299Z","submitted_at":"2026-07-21T05:11:13Z","title":"$\\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost"},"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":242},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 100 of 242 outbound references and 0 inbound Pith citation observations for arXiv:2607.18714."}