Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T14:10:36.916250Z
Paper Citation Record · LEDGER
As of 10 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2507.19859.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T14:10:36.916250Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
28 of 28 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 8c0b8585-25ae-4c16-8aef-ad788ca09767 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Fast estimation of diameter and shortest paths (without matrix multiplication)
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation aeae4b03-0f6b-4db0-ace9-c6535e1404f0 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation b57f531c-4d43-4446-997e-2e6f2c6ee611 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs A refined laser method and faster matrix multiplication
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d0f5e962-1a46-4f7c-9e8d-3e98b9f7111d · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Faster algorithms for approximate distance oracles and all-pairs small stretch paths
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 91e7b514-2346-4c7d-b0db-51c8a785c166 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Faster approximation of distances in graphs
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation cbdfab59-6b2a-4e81-8cb6-82c4d47f6a94 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with constant query time
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 6fe2e68f-77a1-4068-898f-8093806167c7 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with improved bounds
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 2f096c24-ca56-4ba8-806a-a47c7a209d41 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs All-pairs small-stretch paths
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 74ef797f-0ddb-46dc-880d-508dd9cb1624 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Nearly 2-approximate distance oracles in subquadratic time
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d6bbcc4a-ab43-44d9-9a7d-f1243098301b · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Fast 2-approximate all-pairs shortest paths
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 6ccd1a83-5ce2-49c8-824f-156e4eda1b29 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs All-pairs almost shortest paths
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 3bc62de0-e941-48f2-b092-d1affa7d5ead · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs New additive approximations for shortest paths and cycles
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation add7c66b-7569-4a33-8411-4c79df5b9fe2 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Improved bounds for rectangular monotone min-plus product and applications
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 2559195e-50df-422d-bab9-4177342009cf · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Faster matrix multiplication via asymmetric hashing
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation cd1642c6-b482-447e-b2d3-f02b6ab0e296 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Faster algorithms for all-pairs small stretch distances in weighted graphs
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation a0d363f6-9b8b-484c-9dac-49215b990d68 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Additive Spanners and Distance Oracles in Quadratic Time
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 7e9d35e6-0b45-407d-a7fa-8cf1510d9153 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Powers of tensors and fast matrix multiplication
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 73335ed0-3712-4605-a560-28a6a10267de · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Distance oracles beyond the thorup-zwick bound
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 599e138d-ab84-46c1-a3d1-052f7a66c5f6 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs New algorithms for all pairs approximate shortest paths
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 80015f5c-fb10-456f-87e5-fbb638fb6b86 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs On the all-pairs-shortest-path problem in unweighted undirected graphs
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 09a333e0-696d-4c1f-977b-5a5c10ee22d6 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs All-pairs approximate shortest paths and distance oracle preprocessing
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 1690fea3-508f-4176-adf7-ed8484fa941c · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs On the complexity of matrix multiplication
Reference 22
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a7a8d903-bd5a-4149-9b2a-7087dff31f7d · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Faster approximate all pairs shortest paths
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation ea7a5b30-d51e-40cc-81a2-c854edce9b4c · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Compact routing schemes
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 23fe4096-6437-4df5-a6ed-487b7f6865e4 · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Multiplying matrices faster than coppersmith-winograd
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation ad6c5c3d-45cc-4c27-8e82-618ed297edbf · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with improved preprocessing time
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 3b6df51a-3d5c-4035-9cdd-83eeef49198e · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with improved query time
Reference 27
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 61d2aff9-85fe-4e24-a8db-2d48403a2ead · outbound
Improved 2-Approximate Shortest Paths for close vertex pairs New bounds for matrix multiplication: from alpha to omega
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
No inbound Pith citation observations are available.