{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SRSDLRFCB56G76FRZCGAKAN5HM","short_pith_number":"pith:SRSDLRFC","canonical_record":{"source":{"id":"2607.00857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"de19bfb829d16d5eb35e8859bc94cd449304b2918f5d72d4b1058682d6a688e5","abstract_canon_sha256":"6398c1375dad6b789d0f79e098c10a40a882f706d1105e37844be37259780610"},"schema_version":"1.0"},"canonical_sha256":"946435c4a20f7c6ff8b1c88c0501bd3b1477c3a849528bb009231c509a9e4003","source":{"kind":"arxiv","id":"2607.00857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00857","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00857v1","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00857","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"SRSDLRFCB56G","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"SRSDLRFCB56G76FR","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"SRSDLRFC","created_at":"2026-07-02T01:18:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SRSDLRFCB56G76FRZCGAKAN5HM","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"de19bfb829d16d5eb35e8859bc94cd449304b2918f5d72d4b1058682d6a688e5","abstract_canon_sha256":"6398c1375dad6b789d0f79e098c10a40a882f706d1105e37844be37259780610"},"schema_version":"1.0"},"canonical_sha256":"946435c4a20f7c6ff8b1c88c0501bd3b1477c3a849528bb009231c509a9e4003","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:21.584472Z","signature_b64":"GLCtNuFq02wHYnrfSCC4IH3WXe2pMA7YPd5mKf27TMUC4fbkdSqp9teZhy59W52CcM9f4Z2wQm134WdqtohdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"946435c4a20f7c6ff8b1c88c0501bd3b1477c3a849528bb009231c509a9e4003","last_reissued_at":"2026-07-02T01:18:21.584120Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:21.584120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00857","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-02T01:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iBsgNq04LdVsPW8Gym2WMbtCuKeM4oyjqbFFQhPOdy6Vn8xBNN9SeesjcQu1ZgcpOmj2NL1G5bDARmTH8gL1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:53:20.210646Z"},"content_sha256":"4ecf447b7bc70b3a9c7462ede8caeef689ef812c91503cb4da7716b3d09908d0","schema_version":"1.0","event_id":"sha256:4ecf447b7bc70b3a9c7462ede8caeef689ef812c91503cb4da7716b3d09908d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SRSDLRFCB56G76FRZCGAKAN5HM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Warm-Starting All-Pairs Shortest Paths with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Polak, Jonas Schmidt","submitted_at":"2026-07-01T12:22:28Z","abstract_excerpt":"One of the three key hypotheses of fine-grained complexity asserts that computing All-Pairs Shortest Paths (APSP) requires cubic time, up to subpolynomial factors, in the worst case. We initiate the study of APSP in the paradigm of algorithms with predictions, also known as learning-augmented algorithms. We propose an APSP algorithm that takes as additional input a \\emph{prediction} (e.g., given by a model learned from similar instances seen in the past) consisting of sets of vertices causing the shortest \\emph{detour} for each pair of vertices. The algorithm runs in time $\\mathcal{O}(n^{2.83}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00857","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/2607.00857/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-02T01:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1h3eV494v+El7Ag/W5qlFvwqi8mGs/FhVJ/D8yKQTEcQeOlCqPeXrQOmwqmxQ48Icv5e/g3LyIG8LefDH4jTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:53:20.211019Z"},"content_sha256":"5a93635ff7e2ea25ce5f53ac27e3e64bf6e7063ad0faf802a9c24e5e169fd2b2","schema_version":"1.0","event_id":"sha256:5a93635ff7e2ea25ce5f53ac27e3e64bf6e7063ad0faf802a9c24e5e169fd2b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRSDLRFCB56G76FRZCGAKAN5HM/bundle.json","state_url":"https://pith.science/pith/SRSDLRFCB56G76FRZCGAKAN5HM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRSDLRFCB56G76FRZCGAKAN5HM/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-07-02T22:53:20Z","links":{"resolver":"https://pith.science/pith/SRSDLRFCB56G76FRZCGAKAN5HM","bundle":"https://pith.science/pith/SRSDLRFCB56G76FRZCGAKAN5HM/bundle.json","state":"https://pith.science/pith/SRSDLRFCB56G76FRZCGAKAN5HM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRSDLRFCB56G76FRZCGAKAN5HM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SRSDLRFCB56G76FRZCGAKAN5HM","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":"6398c1375dad6b789d0f79e098c10a40a882f706d1105e37844be37259780610","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:22:28Z","title_canon_sha256":"de19bfb829d16d5eb35e8859bc94cd449304b2918f5d72d4b1058682d6a688e5"},"schema_version":"1.0","source":{"id":"2607.00857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00857","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00857v1","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00857","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"SRSDLRFCB56G","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"SRSDLRFCB56G76FR","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"SRSDLRFC","created_at":"2026-07-02T01:18:21Z"}],"graph_snapshots":[{"event_id":"sha256:5a93635ff7e2ea25ce5f53ac27e3e64bf6e7063ad0faf802a9c24e5e169fd2b2","target":"graph","created_at":"2026-07-02T01:18:21Z","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/2607.00857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the three key hypotheses of fine-grained complexity asserts that computing All-Pairs Shortest Paths (APSP) requires cubic time, up to subpolynomial factors, in the worst case. We initiate the study of APSP in the paradigm of algorithms with predictions, also known as learning-augmented algorithms. We propose an APSP algorithm that takes as additional input a \\emph{prediction} (e.g., given by a model learned from similar instances seen in the past) consisting of sets of vertices causing the shortest \\emph{detour} for each pair of vertices. The algorithm runs in time $\\mathcal{O}(n^{2.83}","authors_text":"Adam Polak, Jonas Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:22:28Z","title":"Warm-Starting All-Pairs Shortest Paths with Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00857","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:4ecf447b7bc70b3a9c7462ede8caeef689ef812c91503cb4da7716b3d09908d0","target":"record","created_at":"2026-07-02T01:18:21Z","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":"6398c1375dad6b789d0f79e098c10a40a882f706d1105e37844be37259780610","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:22:28Z","title_canon_sha256":"de19bfb829d16d5eb35e8859bc94cd449304b2918f5d72d4b1058682d6a688e5"},"schema_version":"1.0","source":{"id":"2607.00857","kind":"arxiv","version":1}},"canonical_sha256":"946435c4a20f7c6ff8b1c88c0501bd3b1477c3a849528bb009231c509a9e4003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"946435c4a20f7c6ff8b1c88c0501bd3b1477c3a849528bb009231c509a9e4003","first_computed_at":"2026-07-02T01:18:21.584120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:21.584120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLCtNuFq02wHYnrfSCC4IH3WXe2pMA7YPd5mKf27TMUC4fbkdSqp9teZhy59W52CcM9f4Z2wQm134WdqtohdAQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:21.584472Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ecf447b7bc70b3a9c7462ede8caeef689ef812c91503cb4da7716b3d09908d0","sha256:5a93635ff7e2ea25ce5f53ac27e3e64bf6e7063ad0faf802a9c24e5e169fd2b2"],"state_sha256":"bcc78bc27ee4a86d4c7a24dcb92ab128c9532ff753803f105513b3bcafc508fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GS11kNFhz/raHFnCTxSD4bHGPH/IZFzLOi+TkvtltKlnn3a+wAV+eulCxdNpSU8iLXIhPUBmGyC/aQD+sKo0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T22:53:20.212985Z","bundle_sha256":"987dcbff751fc8de2b8e476344f914e3d1ade48ce36ff11955c1c70a6310840c"}}