Pith. sign in

Paper Citation Record · LEDGER

Improved 2-Approximate Shortest Paths for close vertex pairs

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.

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-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.828214Z digest=sha256:59593ec1756312266bfb5d6409da8f0bfcf780d5903042033fb335d18582dba4

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.835301Z digest=sha256:1a8fecaeac6e36ec8f78fe333517f56200d662fbfda8270deb3a8ea47d158c4e

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.853177Z digest=sha256:016c461624f90ed71a26d272de7cbc4dbc0717c0530a0ae7b9d2e8a5a2878bf0

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.868411Z digest=sha256:8a893db2b3cefd62f7bd404cad23e71a39fb826b3dfa5913e84a0470170361dd

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.874733Z digest=sha256:466a07c5ee85f880689e41f2ae4ad244bfbad06a179cb94b757d75935c829adb

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.877643Z digest=sha256:9acf745609b2e4d6b41e0af8bb48afe9143f9050662d5b2a2dd52e9867b4d532

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.881120Z digest=sha256:2547437ce89dbdd5dc124cfb26df54b8fa8011bf59fbbfec71245fd6d33c19ed

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.900493Z digest=sha256:4ac1ee929c00227863de30f0822da8766e678e7b63b449fbce1d266efda0c781

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

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

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.910345Z digest=sha256:1cb024260d81dc120662d2770cd9b4369ab76e885e7eae621589dfab29395d3c

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.913263Z digest=sha256:6a0858989684784887000653552a9fb7b11251be79b42a4af01db5c9aa01d1a6

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-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-06T14:10:36.916250Z digest=sha256:7ba44728888cf3aeedfd571ca1f56079ee0728ecf71a2dde824cdd66f539d513

Pith citing papers

No inbound Pith citation observations are available.