{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CTEPH675H6NZ5THUNTFLZP3NJP","short_pith_number":"pith:CTEPH675","canonical_record":{"source":{"id":"1905.07483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-17T21:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"9e371164b13fb964e11b5f51b3a8af2124a26965d41ba667ce79eb0148d27c1b","abstract_canon_sha256":"23dc8d698d61bb63e2e860888dc1c1beab9a97f7d5e11559dcb7dad4dc39ee91"},"schema_version":"1.0"},"canonical_sha256":"14c8f3fbfd3f9b9eccf46ccabcbf6d4bcdef04c08eed32df5f9ead5192ab2d21","source":{"kind":"arxiv","id":"1905.07483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07483","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07483v1","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07483","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"CTEPH675H6NZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTEPH675H6NZ5THU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTEPH675","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CTEPH675H6NZ5THUNTFLZP3NJP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-17T21:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"9e371164b13fb964e11b5f51b3a8af2124a26965d41ba667ce79eb0148d27c1b","abstract_canon_sha256":"23dc8d698d61bb63e2e860888dc1c1beab9a97f7d5e11559dcb7dad4dc39ee91"},"schema_version":"1.0"},"canonical_sha256":"14c8f3fbfd3f9b9eccf46ccabcbf6d4bcdef04c08eed32df5f9ead5192ab2d21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:49.612210Z","signature_b64":"OjrywUJWi7zzzf+S8/poXxloI8OPdDuvs75+whZjMS9F6Fx/Hv2DrpBEPgsswbYkp4FEvtcWMG5CdpYV8UDRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14c8f3fbfd3f9b9eccf46ccabcbf6d4bcdef04c08eed32df5f9ead5192ab2d21","last_reissued_at":"2026-05-17T23:45:49.611562Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:49.611562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07483","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-05-17T23:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPuB8qc3j7TS2GHKo+fqfZGGmB9G+5//OX+JWq5wHU0A4gNSM88fT7EWcP3zUMbO3KDct8l/NO4OgT3YRijCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:02.711504Z"},"content_sha256":"6d53b3d682ec0557c120bf0a8581b6d9021eb6051d451c903f8aa80f6e1f64ab","schema_version":"1.0","event_id":"sha256:6d53b3d682ec0557c120bf0a8581b6d9021eb6051d451c903f8aa80f6e1f64ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CTEPH675H6NZ5THUNTFLZP3NJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noga Alon, Sarel Cohen, Shiri Chechik","submitted_at":"2019-05-17T21:16:39Z","abstract_excerpt":"In this work we derandomize two central results in graph algorithms, replacement paths and distance sensitivity oracles (DSOs) matching in both cases the running time of the randomized algorithms.\n  For the replacement paths problem, let G = (V,E) be a directed unweighted graph with n vertices and m edges and let P be a shortest path from s to t in G. The {\\sl replacement paths} problem is to find for every edge e \\in P the shortest path from s to t avoiding e. Roditty and Zwick [ICALP 2005] obtained a randomized algorithm with running time of ~O(m \\sqrt{n}). Here we provide the first determin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07483","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":""},"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-05-17T23:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTyDw59GR3nSVO57G6Ual/5zYuRA95MEgSrxjgAKIhkQnRGo9xiWKpxPzGbEpdjRYRhPWbYKDl73UHSbzsitBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:02.711849Z"},"content_sha256":"ca6c365d79a4fd7c4f98c56f0dfd4fc301aff0cbba80d5fe1815da041148a924","schema_version":"1.0","event_id":"sha256:ca6c365d79a4fd7c4f98c56f0dfd4fc301aff0cbba80d5fe1815da041148a924"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTEPH675H6NZ5THUNTFLZP3NJP/bundle.json","state_url":"https://pith.science/pith/CTEPH675H6NZ5THUNTFLZP3NJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTEPH675H6NZ5THUNTFLZP3NJP/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-06-03T11:25:02Z","links":{"resolver":"https://pith.science/pith/CTEPH675H6NZ5THUNTFLZP3NJP","bundle":"https://pith.science/pith/CTEPH675H6NZ5THUNTFLZP3NJP/bundle.json","state":"https://pith.science/pith/CTEPH675H6NZ5THUNTFLZP3NJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTEPH675H6NZ5THUNTFLZP3NJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CTEPH675H6NZ5THUNTFLZP3NJP","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":"23dc8d698d61bb63e2e860888dc1c1beab9a97f7d5e11559dcb7dad4dc39ee91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-17T21:16:39Z","title_canon_sha256":"9e371164b13fb964e11b5f51b3a8af2124a26965d41ba667ce79eb0148d27c1b"},"schema_version":"1.0","source":{"id":"1905.07483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07483","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07483v1","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07483","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"CTEPH675H6NZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CTEPH675H6NZ5THU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CTEPH675","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ca6c365d79a4fd7c4f98c56f0dfd4fc301aff0cbba80d5fe1815da041148a924","target":"graph","created_at":"2026-05-17T23:45:49Z","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"},"paper":{"abstract_excerpt":"In this work we derandomize two central results in graph algorithms, replacement paths and distance sensitivity oracles (DSOs) matching in both cases the running time of the randomized algorithms.\n  For the replacement paths problem, let G = (V,E) be a directed unweighted graph with n vertices and m edges and let P be a shortest path from s to t in G. The {\\sl replacement paths} problem is to find for every edge e \\in P the shortest path from s to t avoiding e. Roditty and Zwick [ICALP 2005] obtained a randomized algorithm with running time of ~O(m \\sqrt{n}). Here we provide the first determin","authors_text":"Noga Alon, Sarel Cohen, Shiri Chechik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-17T21:16:39Z","title":"Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07483","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:6d53b3d682ec0557c120bf0a8581b6d9021eb6051d451c903f8aa80f6e1f64ab","target":"record","created_at":"2026-05-17T23:45:49Z","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":"23dc8d698d61bb63e2e860888dc1c1beab9a97f7d5e11559dcb7dad4dc39ee91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-17T21:16:39Z","title_canon_sha256":"9e371164b13fb964e11b5f51b3a8af2124a26965d41ba667ce79eb0148d27c1b"},"schema_version":"1.0","source":{"id":"1905.07483","kind":"arxiv","version":1}},"canonical_sha256":"14c8f3fbfd3f9b9eccf46ccabcbf6d4bcdef04c08eed32df5f9ead5192ab2d21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14c8f3fbfd3f9b9eccf46ccabcbf6d4bcdef04c08eed32df5f9ead5192ab2d21","first_computed_at":"2026-05-17T23:45:49.611562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:49.611562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OjrywUJWi7zzzf+S8/poXxloI8OPdDuvs75+whZjMS9F6Fx/Hv2DrpBEPgsswbYkp4FEvtcWMG5CdpYV8UDRAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:49.612210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d53b3d682ec0557c120bf0a8581b6d9021eb6051d451c903f8aa80f6e1f64ab","sha256:ca6c365d79a4fd7c4f98c56f0dfd4fc301aff0cbba80d5fe1815da041148a924"],"state_sha256":"82a1a68827987fc1b3e254aee84427dd298e19af6e6a874dc848c28105aeb6dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4E9BFg2BrcSXMwvXmDIJHqFhkT4f1RntoVM0M0RFKj2QokwNMeKnD2+6P2k6ghBH0mG20hPLTG/bInx89g6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:25:02.713754Z","bundle_sha256":"095b49d1c257dcf913fbb61bcf84e215041abb49eb0db374127ae2128c579a9d"}}