{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MSGXDVWB3JDJYHYI3DYBY3R2IO","short_pith_number":"pith:MSGXDVWB","schema_version":"1.0","canonical_sha256":"648d71d6c1da469c1f08d8f01c6e3a43b3da3bbbb6095c86f91414aedf092e1a","source":{"kind":"arxiv","id":"2507.19859","version":1},"attestation_state":"computed","paper":{"title":"Improved 2-Approximate Shortest Paths for close vertex pairs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta","submitted_at":"2025-07-26T08:24:09Z","abstract_excerpt":"An influential result by Dor, Halperin, and Zwick (FOCS 1996, SICOMP 2000) implies an algorithm that can compute approximate shortest paths for all vertex pairs in $\\tilde{O}(n^{2+O\\left(\\frac{1}{k}\\right )})$ time, ensuring that the output distance is at most twice the actual shortest path, provided the pairs are at least $k$ apart, where $k \\ge 2$. We present the first improvement on this result in over 25 years. Our algorithm achieves roughly same $\\tilde{O}(n^{2+\\frac{1}{k}})$ runtime but applies to vertex pairs merely $O(\\log k)$ apart, where $\\log k \\ge 1$. When $k=\\log n$, the running t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.19859","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-26T08:24:09Z","cross_cats_sorted":[],"title_canon_sha256":"027d23be9b3f8f9dc848fdcb70cb71ab78c8a263e37c06d712b46ab3dc4a1c0e","abstract_canon_sha256":"955de67a59a833301cf49e7c3c05616cd4f0d3e80db5052d230eb37aeaa91a3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:43.668102Z","signature_b64":"cYH0xQHAIONMpaicfGjLXE8/cgdienjwjx+87KwToyLEJ2ROI2TdYS9jiUv2i+T+jYrf5D+4cyhUn1ZlPZo9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"648d71d6c1da469c1f08d8f01c6e3a43b3da3bbbb6095c86f91414aedf092e1a","last_reissued_at":"2026-07-05T11:43:43.667258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:43.667258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved 2-Approximate Shortest Paths for close vertex pairs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta","submitted_at":"2025-07-26T08:24:09Z","abstract_excerpt":"An influential result by Dor, Halperin, and Zwick (FOCS 1996, SICOMP 2000) implies an algorithm that can compute approximate shortest paths for all vertex pairs in $\\tilde{O}(n^{2+O\\left(\\frac{1}{k}\\right )})$ time, ensuring that the output distance is at most twice the actual shortest path, provided the pairs are at least $k$ apart, where $k \\ge 2$. We present the first improvement on this result in over 25 years. Our algorithm achieves roughly same $\\tilde{O}(n^{2+\\frac{1}{k}})$ runtime but applies to vertex pairs merely $O(\\log k)$ apart, where $\\log k \\ge 1$. When $k=\\log n$, the running t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19859","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.19859/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.19859","created_at":"2026-07-05T11:43:43.667355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19859v1","created_at":"2026-07-05T11:43:43.667355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19859","created_at":"2026-07-05T11:43:43.667355+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSGXDVWB3JDJ","created_at":"2026-07-05T11:43:43.667355+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSGXDVWB3JDJYHYI","created_at":"2026-07-05T11:43:43.667355+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSGXDVWB","created_at":"2026-07-05T11:43:43.667355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO","json":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO.json","graph_json":"https://pith.science/api/pith-number/MSGXDVWB3JDJYHYI3DYBY3R2IO/graph.json","events_json":"https://pith.science/api/pith-number/MSGXDVWB3JDJYHYI3DYBY3R2IO/events.json","paper":"https://pith.science/paper/MSGXDVWB"},"agent_actions":{"view_html":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO","download_json":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO.json","view_paper":"https://pith.science/paper/MSGXDVWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19859&json=true","fetch_graph":"https://pith.science/api/pith-number/MSGXDVWB3JDJYHYI3DYBY3R2IO/graph.json","fetch_events":"https://pith.science/api/pith-number/MSGXDVWB3JDJYHYI3DYBY3R2IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/action/storage_attestation","attest_author":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/action/author_attestation","sign_citation":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/action/citation_signature","submit_replication":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/action/replication_record"}},"created_at":"2026-07-05T11:43:43.667355+00:00","updated_at":"2026-07-05T11:43:43.667355+00:00"}