{"as_of":"2026-08-10T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b9de4bf9592f55e2ca9c04e1f97de8301259f90bb1d0a3e8a1955a033b88aaa","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:10:36.916250Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.19859/citation-record","integrity":"/paper/2507.19859/integrity","json":"/paper/2507.19859/citation-record.json","paper":"/paper/2507.19859"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.194928Z","title":"Fast estimation of diameter and shortest paths (without matrix multiplication)","venue":null,"work_id":"0471aa23-76b2-40b6-b440-15709b1ec50d","year":1999},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.828214Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:59593ec1756312266bfb5d6409da8f0bfcf780d5903042033fb335d18582dba4","observation_id":"8c0b8585-25ae-4c16-8aef-ad788ca09767","resolution":{"observed_at":"2026-08-06T14:10:37.198293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.186391Z","title":"An almost 2-approximation for all-pairs of shortest paths in subquadratic time","venue":null,"work_id":"4c03bfdb-5951-4321-ac33-4067e553ead7","year":2020},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.831788Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:3e5e73889afa918c4499cb8f058aa9e6d0490762d939a954bb3d86c4199ae70f","observation_id":"aeae4b03-0f6b-4db0-ace9-c6535e1404f0","resolution":{"observed_at":"2026-08-06T14:10:37.189581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.177879Z","title":"A refined laser method and faster matrix multiplication","venue":null,"work_id":"2f651841-de20-4151-931a-5f60c8b87a5c","year":2024},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.835301Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:1a8fecaeac6e36ec8f78fe333517f56200d662fbfda8270deb3a8ea47d158c4e","observation_id":"b57f531c-4d43-4446-997e-2e6f2c6ee611","resolution":{"observed_at":"2026-08-06T14:10:37.180973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.168605Z","title":"Faster algorithms for approximate distance oracles and all-pairs small stretch paths","venue":null,"work_id":"e1831e88-a553-4040-8a7f-3ddc63b0d81d","year":2006},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.839082Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:fee42ec9f5f1a198e36feeef4f005cffc26bf9305a79117e24c4c362ae0993fb","observation_id":"d0f5e962-1a46-4f7c-9e8d-3e98b9f7111d","resolution":{"observed_at":"2026-08-06T14:10:37.171695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.159906Z","title":"Faster approximation of distances in graphs","venue":null,"work_id":"e4c3d280-3842-412a-bc81-2597e2fb8d91","year":2007},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.843005Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:b989cc1bb76368f05819087e99971b896651c15c9522bee027b0fb7a388115a4","observation_id":"91e7b514-2346-4c7d-b0db-51c8a785c166","resolution":{"observed_at":"2026-08-06T14:10:37.163216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.151054Z","title":"Approximate distance oracles with constant query time","venue":null,"work_id":"ab2b9c2a-bfbd-43ad-9ab5-4df4d9a9f7e7","year":2014},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.846750Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:dc9efa417e3194c1d7aaec8bb6844661347ba902292f679146c77d21cc2fa424","observation_id":"cbdfab59-6b2a-4e81-8cb6-82c4d47f6a94","resolution":{"observed_at":"2026-08-06T14:10:37.154384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.141750Z","title":"Approximate distance oracles with improved bounds","venue":null,"work_id":"ba18f342-92bc-44c4-9a61-b3c13f32c702","year":2015},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.850076Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:327ec5630780254c9ca22da37859a56a2724f305a57c0c927f7571117b1cc4ad","observation_id":"6fe2e68f-77a1-4068-898f-8093806167c7","resolution":{"observed_at":"2026-08-06T14:10:37.144835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.131879Z","title":"All-pairs small-stretch paths","venue":null,"work_id":"9f788d5e-aa84-4bcf-9003-d8141d6d2a31","year":2001},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.853177Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:016c461624f90ed71a26d272de7cbc4dbc0717c0530a0ae7b9d2e8a5a2878bf0","observation_id":"2f096c24-ca56-4ba8-806a-a47c7a209d41","resolution":{"observed_at":"2026-08-06T14:10:37.135372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.123000Z","title":"Nearly 2-approximate distance oracles in subquadratic time","venue":null,"work_id":"7aeaa316-9d1b-46ef-95e1-886666ba1a26","year":2022},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.856253Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:303e0592642f26dc97765d3ae42fcbe329b51b788051836aeea644e6840e80b1","observation_id":"74ef797f-0ddb-46dc-880d-508dd9cb1624","resolution":{"observed_at":"2026-08-06T14:10:37.126428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.114702Z","title":"Fast 2-approximate all-pairs shortest paths","venue":null,"work_id":"8fe38adf-38d0-4ca2-942f-c122f2c5b599","year":2024},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.859525Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:9df8c1e4541efb9fbddb0f712168813e051864b3c27446b50351ca8877f81ae5","observation_id":"d6bbcc4a-ab43-44d9-9a7d-f1243098301b","resolution":{"observed_at":"2026-08-06T14:10:37.117840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.106086Z","title":"All-pairs almost shortest paths","venue":null,"work_id":"a3f9c864-8d29-42d5-ac14-4eefafc3f420","year":2000},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.862438Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:4349c46cdddc69c2121a6b2d35521404095249a328999cd7503e38da70ba9e95","observation_id":"6ccd1a83-5ce2-49c8-824f-156e4eda1b29","resolution":{"observed_at":"2026-08-06T14:10:37.109116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.096229Z","title":"New additive approximations for shortest paths and cycles","venue":null,"work_id":"9b767f5b-2e90-4e6e-97a1-36b44b82f74c","year":2022},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.865446Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:32e32a5b259a63e9f896ad7ef3c268944d845b2caa6093962990869b97f37a2e","observation_id":"3bc62de0-e941-48f2-b092-d1affa7d5ead","resolution":{"observed_at":"2026-08-06T14:10:37.100079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.087231Z","title":"Improved bounds for rectangular monotone min-plus product and applications","venue":null,"work_id":"007e0500-84b5-46b6-96aa-9fab63527365","year":2023},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.868411Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:8a893db2b3cefd62f7bd404cad23e71a39fb826b3dfa5913e84a0470170361dd","observation_id":"add7c66b-7569-4a33-8411-4c79df5b9fe2","resolution":{"observed_at":"2026-08-06T14:10:37.090740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.076398Z","title":"Faster matrix multiplication via asymmetric hashing","venue":null,"work_id":"a15c0ece-0ce4-428a-8973-512452cfbcf0","year":2023},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.871162Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:f6e228c5a7674d2805a00a9d247ce84d6ce4e283be747fa7699e47d167afc79b","observation_id":"2559195e-50df-422d-bab9-4177342009cf","resolution":{"observed_at":"2026-08-06T14:10:37.080877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.065192Z","title":"Faster algorithms for all-pairs small stretch distances in weighted graphs","venue":null,"work_id":"565df576-233f-4d41-aafa-6a25162f3f31","year":2012},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.874733Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:466a07c5ee85f880689e41f2ae4ad244bfbad06a179cb94b757d75935c829adb","observation_id":"cd1642c6-b482-447e-b2d3-f02b6ab0e296","resolution":{"observed_at":"2026-08-06T14:10:37.069730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1704.04473","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.04473","snapshot_observed_at":"2026-08-06T14:10:36.942113Z","title":"Additive Spanners and Distance Oracles in Quadratic Time","venue":"cs.DS","work_id":"9afddeed-2214-4c30-aa75-35a7eef3159f","year":2017},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.877643Z"},"links":{"cited_paper":"/paper/1704.04473","citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:9acf745609b2e4d6b41e0af8bb48afe9143f9050662d5b2a2dd52e9867b4d532","observation_id":"a0d363f6-9b8b-484c-9dac-49215b990d68","resolution":{"observed_at":"2026-08-06T14:10:36.948563Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.055393Z","title":"Powers of tensors and fast matrix multiplication","venue":null,"work_id":"e78ce1f2-a866-4d43-9c3c-28ba84fb50f3","year":2014},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.881120Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:2547437ce89dbdd5dc124cfb26df54b8fa8011bf59fbbfec71245fd6d33c19ed","observation_id":"7e9d35e6-0b45-407d-a7fa-8cf1510d9153","resolution":{"observed_at":"2026-08-06T14:10:37.058611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.046585Z","title":"Distance oracles beyond the thorup-zwick bound","venue":null,"work_id":"d4a4c6a1-e60a-4fdc-9dd9-b49ec1ff1d69","year":2010},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.884514Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:f5ca1387c9a127de188cdfaa447ef439e13cc6e5b95de2d8fdea5751ca23bad6","observation_id":"73335ed0-3712-4605-a560-28a6a10267de","resolution":{"observed_at":"2026-08-06T14:10:37.049767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.037783Z","title":"New algorithms for all pairs approximate shortest paths","venue":null,"work_id":"57f998d3-d209-4ce0-b335-0c421753ad43","year":2023},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.887398Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:ae44ce578b9a910a45ac556a71eeb2192e01abc2777b2c6a4ba20559ae2c1fb7","observation_id":"599e138d-ab84-46c1-a3d1-052f7a66c5f6","resolution":{"observed_at":"2026-08-06T14:10:37.041012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.029032Z","title":"On the all-pairs-shortest-path problem in unweighted undirected graphs","venue":null,"work_id":"5581b2e0-c63c-4c45-973e-328736afc29e","year":1995},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.890962Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:9c4faa11217bd6eb5c7d9768d5e2eb7649bdda57a9cdd4f97ce3c66771475cf9","observation_id":"80015f5c-fb10-456f-87e5-fbb638fb6b86","resolution":{"observed_at":"2026-08-06T14:10:37.032227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.019949Z","title":"All-pairs approximate shortest paths and distance oracle preprocessing","venue":null,"work_id":"868cc6ce-67fc-45c2-a129-ab24a13eee22","year":2016},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.894558Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:0b118cb0113b67e869ecdbdb7fbd6f3514139c02612153778ba1694754c1e186","observation_id":"09a333e0-696d-4c1f-977b-5a5c10ee22d6","resolution":{"observed_at":"2026-08-06T14:10:37.023063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:36.897413Z","title":"On the complexity of matrix multiplication","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.897413Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:34c2e49afae9be0f6ac4cf6abff6e67a369ddd07b5178e19e37d8e364ed10088","observation_id":"1690fea3-508f-4176-adf7-ed8484fa941c","resolution":{"observed_at":"2026-08-06T14:10:36.897413Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:37.004523Z","title":"Faster approximate all pairs shortest paths","venue":null,"work_id":"90640a2f-38b4-495f-ad5c-3f29c010e58a","year":2024},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.900493Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:4ac1ee929c00227863de30f0822da8766e678e7b63b449fbce1d266efda0c781","observation_id":"a7a8d903-bd5a-4149-9b2a-7087dff31f7d","resolution":{"observed_at":"2026-08-06T14:10:37.007570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:36.994920Z","title":"Compact routing schemes","venue":null,"work_id":"28cbf24e-d6fc-41ca-8ce5-c49eef675d4c","year":2001},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.903851Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:d0ac2a513f280a9f646723f40ffb1e04ba9321d316dfacdc63e09ac8a14ee930","observation_id":"ea7a5b30-d51e-40cc-81a2-c854edce9b4c","resolution":{"observed_at":"2026-08-06T14:10:36.998304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:36.985922Z","title":"Multiplying matrices faster than coppersmith-winograd","venue":null,"work_id":"1651dc88-a2bb-4419-a991-445c9a1f0c91","year":2012},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.907447Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:e8276d4b87337a5371142ac6c6c63f034b03b688d9d4d11be24a7d21fd66d9a6","observation_id":"23fe4096-6437-4df5-a6ed-487b7f6865e4","resolution":{"observed_at":"2026-08-06T14:10:36.989197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:36.976282Z","title":"Approximate distance oracles with improved preprocessing time","venue":null,"work_id":"319023c8-6fc5-416d-bd6f-57c90ffe9a16","year":2012},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.910345Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:1cb024260d81dc120662d2770cd9b4369ab76e885e7eae621589dfab29395d3c","observation_id":"ad6c5c3d-45cc-4c27-8e82-618ed297edbf","resolution":{"observed_at":"2026-08-06T14:10:36.980144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:36.965698Z","title":"Approximate distance oracles with improved query time","venue":null,"work_id":"2b936228-0394-415c-bede-f2a93abe48ff","year":2013},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.913263Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:6a0858989684784887000653552a9fb7b11251be79b42a4af01db5c9aa01d1a6","observation_id":"3b6df51a-3d5c-4035-9cdd-83eeef49198e","resolution":{"observed_at":"2026-08-06T14:10:36.969151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:10:36.955501Z","title":"New bounds for matrix multiplication: from alpha to omega","venue":null,"work_id":"f02a8276-8f0b-428f-a65b-5acfb2cc6f50","year":2024},"citing_paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T14:10:36.916250Z"},"links":{"citing_paper":"/paper/2507.19859"},"observation_digest":"sha256:7ba44728888cf3aeedfd571ca1f56079ee0728ecf71a2dde824cdd66f539d513","observation_id":"61d2aff9-85fe-4e24-a8db-2d48403a2ead","resolution":{"observed_at":"2026-08-06T14:10:36.959228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.19859","last_updated":"2025-07-26T08:24:09Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T15:04:36.101252Z","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2507.19859."}