{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ERBKTZJW4CFIPPUHDRGPCTEJPW","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":"101569300e32116076aaa5c617321b164f1f9bc38065ba2a67b212a5720c4ce4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T07:44:56Z","title_canon_sha256":"e578289685db26ffac4eaa9d07f94c73a3a93b45bd3900c1084ea971d5f3a800"},"schema_version":"1.0","source":{"id":"2005.09262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.09262","created_at":"2026-07-05T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2005.09262v2","created_at":"2026-07-05T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09262","created_at":"2026-07-05T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"ERBKTZJW4CFI","created_at":"2026-07-05T01:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"ERBKTZJW4CFIPPUH","created_at":"2026-07-05T01:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"ERBKTZJW","created_at":"2026-07-05T01:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:743cf2b44b25e4524f1dfb64bab0ffd917bbfbc91a97a34cef7ad4294c34ceaa","target":"graph","created_at":"2026-07-05T01:04:52Z","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/2005.09262/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph $G$, $s$ and $t$, find shortest paths from $s$ to $t$ avoiding each edge $e$ on the shortest path from $s$ to $t$. These paths are called replacement paths in literature. For an undirected and unweighted graph, (Malik, Mittal, and Gupta, Operation Research Letters, 1989) and (Hershberger and Suri, FOCS 2001) designed an algorithm that solves the replacement path problem in $\\tilde O(m+n)$ time. It is natural to ask whether we can generalize the replacement path problem: {\\em can we find a","authors_text":"Manoj Gupta, Nitiksha Modi, Rahul Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T07:44:56Z","title":"Multiple Source Replacement Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09262","kind":"arxiv","version":2},"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:96c92a0e4235f1d9998dedc8ecf1d0ff4f8b0c2f21261a0c75f0e2c5ed8a5bf8","target":"record","created_at":"2026-07-05T01:04:52Z","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":"101569300e32116076aaa5c617321b164f1f9bc38065ba2a67b212a5720c4ce4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T07:44:56Z","title_canon_sha256":"e578289685db26ffac4eaa9d07f94c73a3a93b45bd3900c1084ea971d5f3a800"},"schema_version":"1.0","source":{"id":"2005.09262","kind":"arxiv","version":2}},"canonical_sha256":"2442a9e536e08a87be871c4cf14c897dbcac044d0c7a15da29cb0bf7d10852f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2442a9e536e08a87be871c4cf14c897dbcac044d0c7a15da29cb0bf7d10852f6","first_computed_at":"2026-07-05T01:04:52.338379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:04:52.338379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zIFdpD9X1LL+I3e/rHuwacVSmahwsLhZ1g6rjzo8YJQAXwXaVnyEYQUuxyvxvDxrOcQiVuOMFxKeffGuUzY2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:04:52.338727Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.09262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96c92a0e4235f1d9998dedc8ecf1d0ff4f8b0c2f21261a0c75f0e2c5ed8a5bf8","sha256:743cf2b44b25e4524f1dfb64bab0ffd917bbfbc91a97a34cef7ad4294c34ceaa"],"state_sha256":"533cbb7f52a8306cc948bbf859f929fa40bb3f975c73aa3b9187e37f08b3a558"}