Pith. sign in

Paper Citation Record · LEDGER

Improved 2-Approximate Shortest Paths for close vertex pairs

As of 18 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.

pith.paper-citation-record.v1
2507.19859 v1

Coverage vector

measured 28 of 28 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T14:10:36.916250Z

measured 28 of 28 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

28 of 28 outbound references displayed

  • verified exact1
  • verified fuzzy26
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8c0b8585-25ae-4c16-8aef-ad788ca09767 · outbound

This paper cites Fast estimation of diameter and shortest paths (without matrix multiplication).

Improved 2-Approximate Shortest Paths for close vertex pairs Fast estimation of diameter and shortest paths (without matrix multiplication)

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.198293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.828214Z digest=sha256:5dec56510b810b25f7cecdf696efbc2c3dbb70f462989b3ea241c0ed1dce1afc

Observation aeae4b03-0f6b-4db0-ace9-c6535e1404f0 · outbound

This paper cites An almost 2-approximation for all-pairs of shortest paths in subquadratic time.

Improved 2-Approximate Shortest Paths for close vertex pairs An almost 2-approximation for all-pairs of shortest paths in subquadratic time

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.189581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.831788Z digest=sha256:c8203b9ddbeff7636bfcd61173e7457e697a4c2847de822d04f90a3dc5d5ac3a

Observation b57f531c-4d43-4446-997e-2e6f2c6ee611 · outbound

This paper cites A refined laser method and faster matrix multiplication.

Improved 2-Approximate Shortest Paths for close vertex pairs A refined laser method and faster matrix multiplication

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.180973Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.835301Z digest=sha256:5ba029f4bd33fd28abfbaf81ecb17ed918e311b0ddb97ae50ccc2553c620d700

Observation d0f5e962-1a46-4f7c-9e8d-3e98b9f7111d · outbound

This paper cites Faster algorithms for approximate distance oracles and all-pairs small stretch paths.

Improved 2-Approximate Shortest Paths for close vertex pairs Faster algorithms for approximate distance oracles and all-pairs small stretch paths

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.171695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.839082Z digest=sha256:7150dd9e3118107f4005ed1190b7c02d281e75a2041a1f43eaf93c2b01903c54

Observation 91e7b514-2346-4c7d-b0db-51c8a785c166 · outbound

This paper cites Faster approximation of distances in graphs.

Improved 2-Approximate Shortest Paths for close vertex pairs Faster approximation of distances in graphs

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.163216Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.843005Z digest=sha256:4b9de2a0f2383839956781f9ba9c36e2b9b5776f9903a53b59aae33e7507433d

Observation cbdfab59-6b2a-4e81-8cb6-82c4d47f6a94 · outbound

This paper cites Approximate distance oracles with constant query time.

Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with constant query time

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.154384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.846750Z digest=sha256:b53ae58c9a729c5805f209241d85ddc5a106790369c37f2ae6e981f9f2f551b0

Observation 6fe2e68f-77a1-4068-898f-8093806167c7 · outbound

This paper cites Approximate distance oracles with improved bounds.

Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with improved bounds

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.144835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.850076Z digest=sha256:d16a0f5f995e3c6c855b89704658a4bd048c549811c8d76a001e089543db5abd

Observation 2f096c24-ca56-4ba8-806a-a47c7a209d41 · outbound

This paper cites All-pairs small-stretch paths.

Improved 2-Approximate Shortest Paths for close vertex pairs All-pairs small-stretch paths

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.135372Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.853177Z digest=sha256:5c8bea05212724b6098a38e246996698b75e1ec6befe41c3a1089941012d8496

Observation 74ef797f-0ddb-46dc-880d-508dd9cb1624 · outbound

This paper cites Nearly 2-approximate distance oracles in subquadratic time.

Improved 2-Approximate Shortest Paths for close vertex pairs Nearly 2-approximate distance oracles in subquadratic time

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.126428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.856253Z digest=sha256:c962918a568324e0632d69c1beda92b819ff3923fc7781efcbfda3d3961d822c

Observation d6bbcc4a-ab43-44d9-9a7d-f1243098301b · outbound

This paper cites Fast 2-approximate all-pairs shortest paths.

Improved 2-Approximate Shortest Paths for close vertex pairs Fast 2-approximate all-pairs shortest paths

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.117840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.859525Z digest=sha256:d697e4b9e85115b5464b0ddb0af148557aedfc8a6ebd3451ff58f79551c31846

Observation 6ccd1a83-5ce2-49c8-824f-156e4eda1b29 · outbound

This paper cites All-pairs almost shortest paths.

Improved 2-Approximate Shortest Paths for close vertex pairs All-pairs almost shortest paths

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.109116Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.862438Z digest=sha256:b799a1320d3d1254b6fa132a8798af61f27bb129c0e58bd6982d7f0a6b650578

Observation 3bc62de0-e941-48f2-b092-d1affa7d5ead · outbound

This paper cites New additive approximations for shortest paths and cycles.

Improved 2-Approximate Shortest Paths for close vertex pairs New additive approximations for shortest paths and cycles

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.100079Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.865446Z digest=sha256:dbd6e746790b46c4ce7f5e3394b60e28d02eb266c951e2ed768c72f92636e991

Observation add7c66b-7569-4a33-8411-4c79df5b9fe2 · outbound

This paper cites Improved bounds for rectangular monotone min-plus product and applications.

Improved 2-Approximate Shortest Paths for close vertex pairs Improved bounds for rectangular monotone min-plus product and applications

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.090740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.868411Z digest=sha256:4ee609975bf4c219336c1d7052ed04427e04a4d3c4921c3d346ecc61e5a7b06b

Observation 2559195e-50df-422d-bab9-4177342009cf · outbound

This paper cites Faster matrix multiplication via asymmetric hashing.

Improved 2-Approximate Shortest Paths for close vertex pairs Faster matrix multiplication via asymmetric hashing

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.080877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.871162Z digest=sha256:0437ef7f51cbb3d134f3a6138ae82a36c36ab2b14a886f78170fd3834dacdb45

Observation cd1642c6-b482-447e-b2d3-f02b6ab0e296 · outbound

This paper cites Faster algorithms for all-pairs small stretch distances in weighted graphs.

Improved 2-Approximate Shortest Paths for close vertex pairs Faster algorithms for all-pairs small stretch distances in weighted graphs

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.069730Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.874733Z digest=sha256:5956bd9ab685aef544bd9c0aa67b55beba871d3be02baad43f632acf828b66b7

Observation a0d363f6-9b8b-484c-9dac-49215b990d68 · outbound

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

Improved 2-Approximate Shortest Paths for close vertex pairs Additive Spanners and Distance Oracles in Quadratic Time

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-08-06T14:10:36.948563Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.877643Z digest=sha256:2a801b45439638b08db360772b8eca9049455ae12f18194c9df288bc88325741

Observation 7e9d35e6-0b45-407d-a7fa-8cf1510d9153 · outbound

This paper cites Powers of tensors and fast matrix multiplication.

Improved 2-Approximate Shortest Paths for close vertex pairs Powers of tensors and fast matrix multiplication

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.058611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.881120Z digest=sha256:968c263341facc3c3095c26b8a2e25fcbc38f0578b501f76e27d731dc3abfc53

Observation 73335ed0-3712-4605-a560-28a6a10267de · outbound

This paper cites Distance oracles beyond the thorup-zwick bound.

Improved 2-Approximate Shortest Paths for close vertex pairs Distance oracles beyond the thorup-zwick bound

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.049767Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.884514Z digest=sha256:f43106f27ff8fa2138a9a85937cab5a82ce3c98d4e82914c9e83665c71d24061

Observation 599e138d-ab84-46c1-a3d1-052f7a66c5f6 · outbound

This paper cites New algorithms for all pairs approximate shortest paths.

Improved 2-Approximate Shortest Paths for close vertex pairs New algorithms for all pairs approximate shortest paths

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.041012Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.887398Z digest=sha256:edcf5f3893c5b6d2609af93c269c923865a8fadc27903bd0c0cea5a41aa50524

Observation 80015f5c-fb10-456f-87e5-fbb638fb6b86 · outbound

This paper cites On the all-pairs-shortest-path problem in unweighted undirected graphs.

Improved 2-Approximate Shortest Paths for close vertex pairs On the all-pairs-shortest-path problem in unweighted undirected graphs

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.032227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.890962Z digest=sha256:e0d8bc1259a0b4f582d104aee47e834e812f2f8948f3098dcd38e8818dc9b7cb

Observation 09a333e0-696d-4c1f-977b-5a5c10ee22d6 · outbound

This paper cites All-pairs approximate shortest paths and distance oracle preprocessing.

Improved 2-Approximate Shortest Paths for close vertex pairs All-pairs approximate shortest paths and distance oracle preprocessing

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.023063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.894558Z digest=sha256:bdcbdc9845fd56095bfe51d08d156f960ab558dd8a61062923e553130b0acc2d

Observation 1690fea3-508f-4176-adf7-ed8484fa941c · outbound

This paper cites On the complexity of matrix multiplication.

Improved 2-Approximate Shortest Paths for close vertex pairs On the complexity of matrix multiplication

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-06T14:10:36.897413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:10:36.897413Z digest=sha256:34c2e49afae9be0f6ac4cf6abff6e67a369ddd07b5178e19e37d8e364ed10088

Observation a7a8d903-bd5a-4149-9b2a-7087dff31f7d · outbound

This paper cites Faster approximate all pairs shortest paths.

Improved 2-Approximate Shortest Paths for close vertex pairs Faster approximate all pairs shortest paths

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:37.007570Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.900493Z digest=sha256:6618d206d9d33006ae0b1c9b00f249e42fb02d2428e417a16f8cc20212855a84

Observation ea7a5b30-d51e-40cc-81a2-c854edce9b4c · outbound

This paper cites Compact routing schemes.

Improved 2-Approximate Shortest Paths for close vertex pairs Compact routing schemes

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:36.998304Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.903851Z digest=sha256:c00ade1f5b12aa4914d18a3bca6531ea5960f370c763c4b0d2cd0a2cba1d4a11

Observation 23fe4096-6437-4df5-a6ed-487b7f6865e4 · outbound

This paper cites Multiplying matrices faster than coppersmith-winograd.

Improved 2-Approximate Shortest Paths for close vertex pairs Multiplying matrices faster than coppersmith-winograd

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:36.989197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.907447Z digest=sha256:bb06a6d64d6f1f4cbfdfee7988606c01067b5a70b3fe59e86a6b23dba23493b8

Observation ad6c5c3d-45cc-4c27-8e82-618ed297edbf · outbound

This paper cites Approximate distance oracles with improved preprocessing time.

Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with improved preprocessing time

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:36.980144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.910345Z digest=sha256:5d2e33703c84a771daeb42c6c7fe688737c3d07cc7e6d832d93985bbb9c30933

Observation 3b6df51a-3d5c-4035-9cdd-83eeef49198e · outbound

This paper cites Approximate distance oracles with improved query time.

Improved 2-Approximate Shortest Paths for close vertex pairs Approximate distance oracles with improved query time

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:36.969151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.913263Z digest=sha256:905f8d6519cdd01259d8f49747c4637206ca45313bbffa54276f6aa7605bb4bf

Observation 61d2aff9-85fe-4e24-a8db-2d48403a2ead · outbound

This paper cites New bounds for matrix multiplication: from alpha to omega.

Improved 2-Approximate Shortest Paths for close vertex pairs New bounds for matrix multiplication: from alpha to omega

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:10:36.959228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.916250Z digest=sha256:96f0ccafbe1889a99b9136fb5a6eeaf6bcae873c8a7c7d82c934f2f3eea1781c

Pith citing papers

No inbound Pith citation observations are available.