{"as_of":"2026-08-11T08:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5cb48b9e8b77d379e46f5909a243be6633f4c2890fe1d286428740df9f7fca65","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-11T06:34:44.6726+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:aab5e6704b758d42cb7586db50761922da06810d6e847dc0c34de4616681a12b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:b56f5a8458735ff3b37f776c53ddc5de4c6db906fade2c689be520626404e1a3","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:54d9ee54ecf736256f4c1c51e40257310b062f27bc5942fe575a5c6003f3d70c","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:3a26e03a5ce5e8fd7f14c74a40f0098c5d53996d32e7670c884d730a99af80c8","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:4605ee937fe309d57a35a5df1fbb03c89428c5efd022e2c541521a74a0102286","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:cbeee18ad3665e73a2d729c37832fb8a2b2bab72d0f2743e6c3ae18e291087c8","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:afd6e458025933d1a6b92ff98656cde0786287c8bc5d9e1d61d4e015834e0d0a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:a69f103ebcb7e7ba6d985a03b7c08acb8261cf091e92d8c4198711bce734ce75","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:c3fd51b525e64dc6c7f35db7aede9c477744ad7c47e3aba49e8faa089374237b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:d3361b9cafe3fbca6d9d11c5a12187fd164b9726e71f5ca6d196d6843806c35c","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:7b27954c216c1b2c9831910e665cd8cbc7a96472a47488058edca82a0db9d264","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:b6d8f42cd0bf07b150dc8bb91d4467e97d4783f727681083ac07b7bbc66edd16","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:69596f54649ba42430648a17805a03f685df6140c1780b5bc673b023387a264f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:c58b7ff295b3ea38218503e84610ef219184cd4a1db23ff219b8b9c343c6744d","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:04f433252cb0174ae9a8c74ad2d583b6c1a1668d16b0ec250a01b4cc16787262","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:bfd333d1010cffcf6702e78cadf732a8f525bfdf07b26a698be0d32e2f8f18e8","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:44a38c3db999f6a1ccb92e13f64a13ab6b1b7fbb3a5acd7665d4df6de23708e9","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:cb539f061fdcc2a00e0e0d7544483ed35e6ca87679a6de058f526ed3e7ef5649","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:b90cdae43e49221b0041951ac374ad3ef806ae08445451ed1a1b5ff54de5e9b5","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:044e6777b7714e9f7bf384f6c1ef186687752e99d7d56b25cb71bc03194d2d9a","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:24a30834ce26c89c87e9e367ea588bb8e3759c7984e542b33e1d95eb3ee5ccc3","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:3159bc6b68d459d10673fc172530eb1a329d6a6a0d128dbde592e4ce134f346f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:0bfac6856a29824df9aafb5f32452127059c38cda60df525bb24618a1e02dd0f","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:87a2184a66b52a2812344fb841a454fb5976fe0f12481111dcb842b339cd3222","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:26451c53905def2ddace8bcf0a7057dc329e5409e6b283f1cad4784c03db2883","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:762b126e0508906f46673ae4a39b5155f213f18de9a82d2927c240eb2218d92d","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:00523c0e6c74e9fdd1ecd703d95800ac08d135f3b84cccddf3a10df984e24ef3","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2507.19859."}