{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3EF3IG5EKSLSSRVSQNLTOWF7XS","short_pith_number":"pith:3EF3IG5E","canonical_record":{"source":{"id":"1009.3217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-16T16:26:51Z","cross_cats_sorted":[],"title_canon_sha256":"11241ea19422615ade615ce249dd07882f9ab3baa4556c3e8714fc74fce10b8c","abstract_canon_sha256":"13e29409a3b4e0a86d4ed9940eafe9c766d7943859c735cbc45f1e2f3fc9e7cb"},"schema_version":"1.0"},"canonical_sha256":"d90bb41ba454972946b283573758bfbcb0cbca31e8a8b1a302dd56aaf2f9d5c4","source":{"kind":"arxiv","id":"1009.3217","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3217","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3217v2","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3217","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"pith_short_12","alias_value":"3EF3IG5EKSLS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3EF3IG5EKSLSSRVS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3EF3IG5E","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3EF3IG5EKSLSSRVSQNLTOWF7XS","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-16T16:26:51Z","cross_cats_sorted":[],"title_canon_sha256":"11241ea19422615ade615ce249dd07882f9ab3baa4556c3e8714fc74fce10b8c","abstract_canon_sha256":"13e29409a3b4e0a86d4ed9940eafe9c766d7943859c735cbc45f1e2f3fc9e7cb"},"schema_version":"1.0"},"canonical_sha256":"d90bb41ba454972946b283573758bfbcb0cbca31e8a8b1a302dd56aaf2f9d5c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:12.995172Z","signature_b64":"c5Zjnke0nx3Gb9VYBnTeyi2PphGit7XvotqOmVnI9004cnf3iRs0poxukqbF6iLkzG8bqdd1MQuAMu3gMs9kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d90bb41ba454972946b283573758bfbcb0cbca31e8a8b1a302dd56aaf2f9d5c4","last_reissued_at":"2026-05-18T03:57:12.994364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:12.994364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3217","source_version":2,"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-18T03:57:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CIqYeTnvHxm2bWyKXXp0NWqXmDsxXPM1vJt+VXr5Eht3kqGQ50qKeCnMyGLeTAVCXovLd9PyL19JJcb+EfiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:31:35.428681Z"},"content_sha256":"b6002950d07dbfac6abe994229481de95f2d36d27bc69669c1873c568f1408d6","schema_version":"1.0","event_id":"sha256:b6002950d07dbfac6abe994229481de95f2d36d27bc69669c1873c568f1408d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3EF3IG5EKSLSSRVSQNLTOWF7XS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Rerouting Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Paul Bonsma","submitted_at":"2010-09-16T16:26:51Z","abstract_excerpt":"The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and ends with Q, such that subsequent paths differ in only one vertex. This is called a rerouting sequence.\n  This problem is shown to be PSPACE-complete. For claw-free graphs and chordal graphs, it is shown that the problem can be solved in polynomial time, and that shortest rerouting sequences have linear length. For these classes, it is also shown that decidi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3217","kind":"arxiv","version":2},"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-18T03:57:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCbaUdpOArUH3uQluBYCSCZCj9Vt/pKCUDUY0TY/2Ntantu0z7u4tOwnbTomOr8v9diYgc0hg/zk6YPWozq0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:31:35.429013Z"},"content_sha256":"841b235c5dff3495b1fa282ad891d16ead80492c62993e3d4962edc6b763af6d","schema_version":"1.0","event_id":"sha256:841b235c5dff3495b1fa282ad891d16ead80492c62993e3d4962edc6b763af6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS/bundle.json","state_url":"https://pith.science/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS/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-20T18:31:35Z","links":{"resolver":"https://pith.science/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS","bundle":"https://pith.science/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS/bundle.json","state":"https://pith.science/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EF3IG5EKSLSSRVSQNLTOWF7XS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3EF3IG5EKSLSSRVSQNLTOWF7XS","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":"13e29409a3b4e0a86d4ed9940eafe9c766d7943859c735cbc45f1e2f3fc9e7cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-16T16:26:51Z","title_canon_sha256":"11241ea19422615ade615ce249dd07882f9ab3baa4556c3e8714fc74fce10b8c"},"schema_version":"1.0","source":{"id":"1009.3217","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3217","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3217v2","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3217","created_at":"2026-05-18T03:57:12Z"},{"alias_kind":"pith_short_12","alias_value":"3EF3IG5EKSLS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3EF3IG5EKSLSSRVS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3EF3IG5E","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:841b235c5dff3495b1fa282ad891d16ead80492c62993e3d4962edc6b763af6d","target":"graph","created_at":"2026-05-18T03:57:12Z","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":"The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and ends with Q, such that subsequent paths differ in only one vertex. This is called a rerouting sequence.\n  This problem is shown to be PSPACE-complete. For claw-free graphs and chordal graphs, it is shown that the problem can be solved in polynomial time, and that shortest rerouting sequences have linear length. For these classes, it is also shown that decidi","authors_text":"Paul Bonsma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-16T16:26:51Z","title":"The Complexity of Rerouting Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3217","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:b6002950d07dbfac6abe994229481de95f2d36d27bc69669c1873c568f1408d6","target":"record","created_at":"2026-05-18T03:57:12Z","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":"13e29409a3b4e0a86d4ed9940eafe9c766d7943859c735cbc45f1e2f3fc9e7cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-16T16:26:51Z","title_canon_sha256":"11241ea19422615ade615ce249dd07882f9ab3baa4556c3e8714fc74fce10b8c"},"schema_version":"1.0","source":{"id":"1009.3217","kind":"arxiv","version":2}},"canonical_sha256":"d90bb41ba454972946b283573758bfbcb0cbca31e8a8b1a302dd56aaf2f9d5c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d90bb41ba454972946b283573758bfbcb0cbca31e8a8b1a302dd56aaf2f9d5c4","first_computed_at":"2026-05-18T03:57:12.994364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:12.994364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5Zjnke0nx3Gb9VYBnTeyi2PphGit7XvotqOmVnI9004cnf3iRs0poxukqbF6iLkzG8bqdd1MQuAMu3gMs9kCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:12.995172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3217","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6002950d07dbfac6abe994229481de95f2d36d27bc69669c1873c568f1408d6","sha256:841b235c5dff3495b1fa282ad891d16ead80492c62993e3d4962edc6b763af6d"],"state_sha256":"70980eaabbc7a56593490199da4dc3014063eca6050254ade964fe8d628889aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSHSmeDmouKigMDeI55vqrC0fiBU3yopYXiiUVTx7+rXNh+6ICT6S3XwgiyrS9475GEyeECfBURnw6zkxw1lCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:31:35.430831Z","bundle_sha256":"d6bec957b52611abebe2e434772efc642110f5e654b26bb2dba5aaff290d09ed"}}