{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OKIXJEAWN33LFCQGSCAFHVTEEI","short_pith_number":"pith:OKIXJEAW","canonical_record":{"source":{"id":"1204.5613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-25T10:59:41Z","cross_cats_sorted":[],"title_canon_sha256":"593ecee6e2bd05267621b05b0bab2fc8b60cfba3d0b2d41b3e65eb8572e8e0da","abstract_canon_sha256":"2b9bed21946a1eeeb9e67f543db64ea2251a5852f20f98c273bdd7a07e9ecb62"},"schema_version":"1.0"},"canonical_sha256":"72917490166ef6b28a06908053d6642230c9e7085c145c25da7c00d945b32ce8","source":{"kind":"arxiv","id":"1204.5613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5613","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5613v1","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5613","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"OKIXJEAWN33L","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OKIXJEAWN33LFCQG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OKIXJEAW","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OKIXJEAWN33LFCQGSCAFHVTEEI","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-25T10:59:41Z","cross_cats_sorted":[],"title_canon_sha256":"593ecee6e2bd05267621b05b0bab2fc8b60cfba3d0b2d41b3e65eb8572e8e0da","abstract_canon_sha256":"2b9bed21946a1eeeb9e67f543db64ea2251a5852f20f98c273bdd7a07e9ecb62"},"schema_version":"1.0"},"canonical_sha256":"72917490166ef6b28a06908053d6642230c9e7085c145c25da7c00d945b32ce8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.976789Z","signature_b64":"Gx1llxStWeKI1GzeVfRoDoBqa+NV72IwGdLBMkKo8pGa92dUNNdCDQvTAPtDQzLzs5QkU+dKefS2EG8DTjwxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72917490166ef6b28a06908053d6642230c9e7085c145c25da7c00d945b32ce8","last_reissued_at":"2026-05-18T02:21:15.976263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.976263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5613","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-18T02:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+uGAgjfl43Tdy9+vqibxyGOBbFFLzJ+T51x28bRIPPzuX+bzx1WZizCMWqcfzcFqb9GveUKeqZ7ovbeWAmJNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:02:37.790698Z"},"content_sha256":"cba7d193a82b95fcae50adfacf2ad83c0f6c0da30e45fd2a18c808849404294c","schema_version":"1.0","event_id":"sha256:cba7d193a82b95fcae50adfacf2ad83c0f6c0da30e45fd2a18c808849404294c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OKIXJEAWN33LFCQGSCAFHVTEEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rerouting shortest paths in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Paul Bonsma","submitted_at":"2012-04-25T10:59:41Z","abstract_excerpt":"A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists from P to Q. This problem is PSPACE-hard in general, but we show that it can be solved in polynomial time if G is planar. To this end, we introduce a dynamic programming method for reconfiguration problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5613","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-18T02:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUIFa4gWl+9xGyfDcPBdHYjPdWCcu8YczVPNii1e4hJ2mQJmGtxKhrdwHADjneSdjpdKur4E13pojdDWNyMuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:02:37.791395Z"},"content_sha256":"35e346af403ba589913bcbf87f8e5988b55dd80e06cf36c80f5f4249f0be520a","schema_version":"1.0","event_id":"sha256:35e346af403ba589913bcbf87f8e5988b55dd80e06cf36c80f5f4249f0be520a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKIXJEAWN33LFCQGSCAFHVTEEI/bundle.json","state_url":"https://pith.science/pith/OKIXJEAWN33LFCQGSCAFHVTEEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKIXJEAWN33LFCQGSCAFHVTEEI/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-05-28T19:02:37Z","links":{"resolver":"https://pith.science/pith/OKIXJEAWN33LFCQGSCAFHVTEEI","bundle":"https://pith.science/pith/OKIXJEAWN33LFCQGSCAFHVTEEI/bundle.json","state":"https://pith.science/pith/OKIXJEAWN33LFCQGSCAFHVTEEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKIXJEAWN33LFCQGSCAFHVTEEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OKIXJEAWN33LFCQGSCAFHVTEEI","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":"2b9bed21946a1eeeb9e67f543db64ea2251a5852f20f98c273bdd7a07e9ecb62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-25T10:59:41Z","title_canon_sha256":"593ecee6e2bd05267621b05b0bab2fc8b60cfba3d0b2d41b3e65eb8572e8e0da"},"schema_version":"1.0","source":{"id":"1204.5613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5613","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5613v1","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5613","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"OKIXJEAWN33L","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OKIXJEAWN33LFCQG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OKIXJEAW","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:35e346af403ba589913bcbf87f8e5988b55dd80e06cf36c80f5f4249f0be520a","target":"graph","created_at":"2026-05-18T02:21:15Z","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":"A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists from P to Q. This problem is PSPACE-hard in general, but we show that it can be solved in polynomial time if G is planar. To this end, we introduce a dynamic programming method for reconfiguration problems.","authors_text":"Paul Bonsma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-25T10:59:41Z","title":"Rerouting shortest paths in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5613","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:cba7d193a82b95fcae50adfacf2ad83c0f6c0da30e45fd2a18c808849404294c","target":"record","created_at":"2026-05-18T02:21:15Z","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":"2b9bed21946a1eeeb9e67f543db64ea2251a5852f20f98c273bdd7a07e9ecb62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-25T10:59:41Z","title_canon_sha256":"593ecee6e2bd05267621b05b0bab2fc8b60cfba3d0b2d41b3e65eb8572e8e0da"},"schema_version":"1.0","source":{"id":"1204.5613","kind":"arxiv","version":1}},"canonical_sha256":"72917490166ef6b28a06908053d6642230c9e7085c145c25da7c00d945b32ce8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72917490166ef6b28a06908053d6642230c9e7085c145c25da7c00d945b32ce8","first_computed_at":"2026-05-18T02:21:15.976263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:15.976263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gx1llxStWeKI1GzeVfRoDoBqa+NV72IwGdLBMkKo8pGa92dUNNdCDQvTAPtDQzLzs5QkU+dKefS2EG8DTjwxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:15.976789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cba7d193a82b95fcae50adfacf2ad83c0f6c0da30e45fd2a18c808849404294c","sha256:35e346af403ba589913bcbf87f8e5988b55dd80e06cf36c80f5f4249f0be520a"],"state_sha256":"228be024968b8f889847002f307c9c40df47afa7af0a7d3489af58fa5a42c5f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXLA8/o19BT5N4hBD/Dns5rzQEjZsnJHYxjPctY3RAnWPOB7ZGiDAF7Fsma9rN5QLX3q6AAZYfaLIU6qi8PIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:02:37.795403Z","bundle_sha256":"2f4283e80a0a6687903f4ad0fe26dcf927ec6061bc45c5ca8170a1f176fac750"}}