{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FWMLN3RO75PNFC7GRJOQSO7XEG","short_pith_number":"pith:FWMLN3RO","canonical_record":{"source":{"id":"1511.06905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-21T17:32:42Z","cross_cats_sorted":[],"title_canon_sha256":"ecaca420b20e44781543490ac605f3290c8ea47f8c32fb5693745f5cc48c38b5","abstract_canon_sha256":"a8a068b0c43cfe1a9acc18b00ba6ba9416e808c81e68bf5cc7dc193c0d7a9f54"},"schema_version":"1.0"},"canonical_sha256":"2d98b6ee2eff5ed28be68a5d093bf721af546f3b345e5af9345db991837bc3b1","source":{"kind":"arxiv","id":"1511.06905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06905","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06905v1","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06905","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"FWMLN3RO75PN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FWMLN3RO75PNFC7G","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FWMLN3RO","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FWMLN3RO75PNFC7GRJOQSO7XEG","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-21T17:32:42Z","cross_cats_sorted":[],"title_canon_sha256":"ecaca420b20e44781543490ac605f3290c8ea47f8c32fb5693745f5cc48c38b5","abstract_canon_sha256":"a8a068b0c43cfe1a9acc18b00ba6ba9416e808c81e68bf5cc7dc193c0d7a9f54"},"schema_version":"1.0"},"canonical_sha256":"2d98b6ee2eff5ed28be68a5d093bf721af546f3b345e5af9345db991837bc3b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:17.184338Z","signature_b64":"EPQL+5iomXDFWEHVCWVYR+JOqdbXSue+8R7Z4b6UB5OHbCV01N5xahg775IQJ04Twgijzh+ihOcqzcCoYdz8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d98b6ee2eff5ed28be68a5d093bf721af546f3b345e5af9345db991837bc3b1","last_reissued_at":"2026-05-18T01:26:17.183763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:17.183763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06905","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-18T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0RL+a6WWFOKX2tPpiIkvmclyNyhyBgOwEtXnncSyd/dqesgJ29GoxsyqtmP0tilFJwYogW9vXJIO4GbJVE2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:10:52.059126Z"},"content_sha256":"852e4889ef87600a4d5c0faaf9547739458457204532e172ef5cf6b78367308f","schema_version":"1.0","event_id":"sha256:852e4889ef87600a4d5c0faaf9547739458457204532e172ef5cf6b78367308f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FWMLN3RO75PNFC7GRJOQSO7XEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Algorithm For Replacement Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anjeneya Swami Kare","submitted_at":"2015-11-21T17:32:42Z","abstract_excerpt":"Let G=(V,E)(|V|=n and |E|=m) be an undirected graph with positive edge weights. Let P_{G}(s, t) be a shortest s-t path in G. Let l be the number of edges in P_{G}(s, t). The \\emph{Edge Replacement Path} problem is to compute a shortest s-t path in G\\{e}, for every edge e in P_{G}(s, t). The \\emph{Node Replacement Path} problem is to compute a shortest s-t path in G\\{v}, for every vertex v in P_{G}(s, t). In this paper we present an O(T_{SPT}(G)+m+l^2) time and O(m+l^2) space algorithm for both the problems. Where, T_{SPT}(G) is the asymptotic time to compute a single source shortest path tree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06905","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-18T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhAdH+/vQXa8LEReFsg5EF/Xjszft3ZiYKNEwAbUt57YoL/M22njIvWFlmqxwQtyYm1fA2OS8sOIR6c4ucy8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:10:52.059481Z"},"content_sha256":"8d1f41ccce5572bd54ff01860dd6a646f336c4ce0adcb5b089cca5da69e89cc9","schema_version":"1.0","event_id":"sha256:8d1f41ccce5572bd54ff01860dd6a646f336c4ce0adcb5b089cca5da69e89cc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWMLN3RO75PNFC7GRJOQSO7XEG/bundle.json","state_url":"https://pith.science/pith/FWMLN3RO75PNFC7GRJOQSO7XEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWMLN3RO75PNFC7GRJOQSO7XEG/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-02T07:10:52Z","links":{"resolver":"https://pith.science/pith/FWMLN3RO75PNFC7GRJOQSO7XEG","bundle":"https://pith.science/pith/FWMLN3RO75PNFC7GRJOQSO7XEG/bundle.json","state":"https://pith.science/pith/FWMLN3RO75PNFC7GRJOQSO7XEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWMLN3RO75PNFC7GRJOQSO7XEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FWMLN3RO75PNFC7GRJOQSO7XEG","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":"a8a068b0c43cfe1a9acc18b00ba6ba9416e808c81e68bf5cc7dc193c0d7a9f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-21T17:32:42Z","title_canon_sha256":"ecaca420b20e44781543490ac605f3290c8ea47f8c32fb5693745f5cc48c38b5"},"schema_version":"1.0","source":{"id":"1511.06905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06905","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06905v1","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06905","created_at":"2026-05-18T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"FWMLN3RO75PN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FWMLN3RO75PNFC7G","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FWMLN3RO","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:8d1f41ccce5572bd54ff01860dd6a646f336c4ce0adcb5b089cca5da69e89cc9","target":"graph","created_at":"2026-05-18T01:26:17Z","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":"Let G=(V,E)(|V|=n and |E|=m) be an undirected graph with positive edge weights. Let P_{G}(s, t) be a shortest s-t path in G. Let l be the number of edges in P_{G}(s, t). The \\emph{Edge Replacement Path} problem is to compute a shortest s-t path in G\\{e}, for every edge e in P_{G}(s, t). The \\emph{Node Replacement Path} problem is to compute a shortest s-t path in G\\{v}, for every vertex v in P_{G}(s, t). In this paper we present an O(T_{SPT}(G)+m+l^2) time and O(m+l^2) space algorithm for both the problems. Where, T_{SPT}(G) is the asymptotic time to compute a single source shortest path tree ","authors_text":"Anjeneya Swami Kare","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-21T17:32:42Z","title":"A Simple Algorithm For Replacement Paths Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06905","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:852e4889ef87600a4d5c0faaf9547739458457204532e172ef5cf6b78367308f","target":"record","created_at":"2026-05-18T01:26:17Z","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":"a8a068b0c43cfe1a9acc18b00ba6ba9416e808c81e68bf5cc7dc193c0d7a9f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-21T17:32:42Z","title_canon_sha256":"ecaca420b20e44781543490ac605f3290c8ea47f8c32fb5693745f5cc48c38b5"},"schema_version":"1.0","source":{"id":"1511.06905","kind":"arxiv","version":1}},"canonical_sha256":"2d98b6ee2eff5ed28be68a5d093bf721af546f3b345e5af9345db991837bc3b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d98b6ee2eff5ed28be68a5d093bf721af546f3b345e5af9345db991837bc3b1","first_computed_at":"2026-05-18T01:26:17.183763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:17.183763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EPQL+5iomXDFWEHVCWVYR+JOqdbXSue+8R7Z4b6UB5OHbCV01N5xahg775IQJ04Twgijzh+ihOcqzcCoYdz8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:17.184338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:852e4889ef87600a4d5c0faaf9547739458457204532e172ef5cf6b78367308f","sha256:8d1f41ccce5572bd54ff01860dd6a646f336c4ce0adcb5b089cca5da69e89cc9"],"state_sha256":"f22153a67f9d20536a5d720ff6f1c7828ae13a2225a11121038be412dc7885c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5wb4v1lNwPCfYTV4raSJ/GJSLq0HdhoY32ghUYWxkk+t3isvT1KPrMHS/feTL/WAP4BiEapgZH7hcYpgpZbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:10:52.061401Z","bundle_sha256":"10018d9b6503d0c8a2713b63446558931dbb0d394334361125704156528c79b2"}}