{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MSGXDVWB3JDJYHYI3DYBY3R2IO","short_pith_number":"pith:MSGXDVWB","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"},"canonical_sha256":"648d71d6c1da469c1f08d8f01c6e3a43b3da3bbbb6095c86f91414aedf092e1a","source":{"kind":"arxiv","id":"2507.19859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19859","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19859v1","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19859","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"MSGXDVWB3JDJ","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"MSGXDVWB3JDJYHYI","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"MSGXDVWB","created_at":"2026-07-05T11:43:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MSGXDVWB3JDJYHYI3DYBY3R2IO","target":"record","payload":{"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"},"canonical_sha256":"648d71d6c1da469c1f08d8f01c6e3a43b3da3bbbb6095c86f91414aedf092e1a","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"},"source_kind":"arxiv","source_id":"2507.19859","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2j+p9zyGNCAPpLpr2NNkC2Fd3rh5Ody8XcHY6Z8zfRqAP6ERu47THOR/D7NUJbOZyZzgMc9ar2eG0xkopvnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:33:58.074152Z"},"content_sha256":"3f5f5dd4d2ba3c56a993b9cf2fdea52e4af917c3204c5f75110d69a547926a3f","schema_version":"1.0","event_id":"sha256:3f5f5dd4d2ba3c56a993b9cf2fdea52e4af917c3204c5f75110d69a547926a3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MSGXDVWB3JDJYHYI3DYBY3R2IO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuIws9xK+RUjOgO2/PLU86N8LKDLrrHB4taVIYzv5iqAa0XvMeS7uLPjK8HpvVwqS5gUhFlG5ZxIIqWAfCV7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:33:58.074651Z"},"content_sha256":"b1b99e2ceee0820ba86c4374b59dd41bc30fc0dcd52527cfa4cf957effe7f1e3","schema_version":"1.0","event_id":"sha256:b1b99e2ceee0820ba86c4374b59dd41bc30fc0dcd52527cfa4cf957effe7f1e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/bundle.json","state_url":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T12:33:58Z","links":{"resolver":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO","bundle":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/bundle.json","state":"https://pith.science/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSGXDVWB3JDJYHYI3DYBY3R2IO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MSGXDVWB3JDJYHYI3DYBY3R2IO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"955de67a59a833301cf49e7c3c05616cd4f0d3e80db5052d230eb37aeaa91a3f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-26T08:24:09Z","title_canon_sha256":"027d23be9b3f8f9dc848fdcb70cb71ab78c8a263e37c06d712b46ab3dc4a1c0e"},"schema_version":"1.0","source":{"id":"2507.19859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19859","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19859v1","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19859","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"MSGXDVWB3JDJ","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"MSGXDVWB3JDJYHYI","created_at":"2026-07-05T11:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"MSGXDVWB","created_at":"2026-07-05T11:43:43Z"}],"graph_snapshots":[{"event_id":"sha256:b1b99e2ceee0820ba86c4374b59dd41bc30fc0dcd52527cfa4cf957effe7f1e3","target":"graph","created_at":"2026-07-05T11:43:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.19859/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Manoj Gupta","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-26T08:24:09Z","title":"Improved 2-Approximate Shortest Paths for close vertex pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19859","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3f5f5dd4d2ba3c56a993b9cf2fdea52e4af917c3204c5f75110d69a547926a3f","target":"record","created_at":"2026-07-05T11:43:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"955de67a59a833301cf49e7c3c05616cd4f0d3e80db5052d230eb37aeaa91a3f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-26T08:24:09Z","title_canon_sha256":"027d23be9b3f8f9dc848fdcb70cb71ab78c8a263e37c06d712b46ab3dc4a1c0e"},"schema_version":"1.0","source":{"id":"2507.19859","kind":"arxiv","version":1}},"canonical_sha256":"648d71d6c1da469c1f08d8f01c6e3a43b3da3bbbb6095c86f91414aedf092e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"648d71d6c1da469c1f08d8f01c6e3a43b3da3bbbb6095c86f91414aedf092e1a","first_computed_at":"2026-07-05T11:43:43.667258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:43.667258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYH0xQHAIONMpaicfGjLXE8/cgdienjwjx+87KwToyLEJ2ROI2TdYS9jiUv2i+T+jYrf5D+4cyhUn1ZlPZo9BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:43.668102Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f5f5dd4d2ba3c56a993b9cf2fdea52e4af917c3204c5f75110d69a547926a3f","sha256:b1b99e2ceee0820ba86c4374b59dd41bc30fc0dcd52527cfa4cf957effe7f1e3"],"state_sha256":"60b13d47c630015f3c0630c53d3d22260f507570514c74892f8afcef7b586bc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6b1Ys9TO2Gt4GOp2rorPINLWGGtGvJJenahHG/iZl1SlM9cbpU8gK0gA1f4jXDepMjy7oa7PO3eECOVggZqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:33:58.079105Z","bundle_sha256":"166244379d399eec52cc00462a078e9785e8bf67fb421ae885e3ab18a3240729"}}