{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6MDE2PBFQXXV2H7MXI3YYQALJ3","short_pith_number":"pith:6MDE2PBF","canonical_record":{"source":{"id":"1705.09385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-25T22:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"02497f787b2b5419f6dbc310b7b08c15cc198a79415c030fb1beda0cee75cfc6","abstract_canon_sha256":"1a37916fe55b0d3e9679f98f2b1d6a005dbd2347e35bc1c8e264888c79d8b8fd"},"schema_version":"1.0"},"canonical_sha256":"f3064d3c2585ef5d1fecba378c400b4ee946158d8c577b92458f1249452b43ac","source":{"kind":"arxiv","id":"1705.09385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09385","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09385v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09385","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"6MDE2PBFQXXV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6MDE2PBFQXXV2H7M","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6MDE2PBF","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6MDE2PBFQXXV2H7MXI3YYQALJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-25T22:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"02497f787b2b5419f6dbc310b7b08c15cc198a79415c030fb1beda0cee75cfc6","abstract_canon_sha256":"1a37916fe55b0d3e9679f98f2b1d6a005dbd2347e35bc1c8e264888c79d8b8fd"},"schema_version":"1.0"},"canonical_sha256":"f3064d3c2585ef5d1fecba378c400b4ee946158d8c577b92458f1249452b43ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.849993Z","signature_b64":"3kHqKnO1t21V5T3XbFoom5EjYd1kipTfuaKQlDwyp01pqditQgVjE4KR2vR2Ye3GhkV/J3yyoyFawBHU8fjRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3064d3c2585ef5d1fecba378c400b4ee946158d8c577b92458f1249452b43ac","last_reissued_at":"2026-05-18T00:43:38.849369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.849369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09385","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjzCadd605whza0IJkLdEObEEdrCjrXw3oEq1hwcP+NbrRj/Zozpby/858E+seY562okgdvj6sir97M1ui/+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:04.496122Z"},"content_sha256":"8b6d1d08a615d24c25009066691cdf1f99fa19a16aafcaa296b4aea804637005","schema_version":"1.0","event_id":"sha256:8b6d1d08a615d24c25009066691cdf1f99fa19a16aafcaa296b4aea804637005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6MDE2PBFQXXV2H7MXI3YYQALJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguration graphs of shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Beth Novick, Brett Werner, John Asplund, Kossi Edoh, Ruth Haas, Yulia Hristova","submitted_at":"2017-05-25T22:54:15Z","abstract_excerpt":"For a graph $G$ and $a,b\\in V(G)$, the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S(G,a,b)$. The vertex set of $S(G,a,b)$ is the set of all shortest paths between $a$ and $b$ in $G$. Two vertices in $V(S(G,a,b))$ are adjacent, if their corresponding paths in $G$ differ by exactly one vertex. This paper examines the properties of shortest path graphs. Results include establishing classes of graphs that appear as shortest path graphs, decompositions and sums involving shortest path graphs, and the complete classification of shortest path graphs with gir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09385","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWyn0y0xDgr1Rbt7c1HXF0ns2jBU2wfSS0KCOnqQ6p04s6dLPE3B+q1Z7rI4rodYbEsK4ObcMAiwc+RI1HSnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:04.496474Z"},"content_sha256":"36c9cd44d0e60c8811e4e612b17f317cc20d824ee6380af9907fcbc5984ea290","schema_version":"1.0","event_id":"sha256:36c9cd44d0e60c8811e4e612b17f317cc20d824ee6380af9907fcbc5984ea290"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3/bundle.json","state_url":"https://pith.science/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3/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-31T03:19:04Z","links":{"resolver":"https://pith.science/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3","bundle":"https://pith.science/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3/bundle.json","state":"https://pith.science/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MDE2PBFQXXV2H7MXI3YYQALJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6MDE2PBFQXXV2H7MXI3YYQALJ3","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":"1a37916fe55b0d3e9679f98f2b1d6a005dbd2347e35bc1c8e264888c79d8b8fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-25T22:54:15Z","title_canon_sha256":"02497f787b2b5419f6dbc310b7b08c15cc198a79415c030fb1beda0cee75cfc6"},"schema_version":"1.0","source":{"id":"1705.09385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09385","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09385v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09385","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"6MDE2PBFQXXV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6MDE2PBFQXXV2H7M","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6MDE2PBF","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:36c9cd44d0e60c8811e4e612b17f317cc20d824ee6380af9907fcbc5984ea290","target":"graph","created_at":"2026-05-18T00:43:38Z","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":"For a graph $G$ and $a,b\\in V(G)$, the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S(G,a,b)$. The vertex set of $S(G,a,b)$ is the set of all shortest paths between $a$ and $b$ in $G$. Two vertices in $V(S(G,a,b))$ are adjacent, if their corresponding paths in $G$ differ by exactly one vertex. This paper examines the properties of shortest path graphs. Results include establishing classes of graphs that appear as shortest path graphs, decompositions and sums involving shortest path graphs, and the complete classification of shortest path graphs with gir","authors_text":"Beth Novick, Brett Werner, John Asplund, Kossi Edoh, Ruth Haas, Yulia Hristova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-25T22:54:15Z","title":"Reconfiguration graphs of shortest paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09385","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:8b6d1d08a615d24c25009066691cdf1f99fa19a16aafcaa296b4aea804637005","target":"record","created_at":"2026-05-18T00:43:38Z","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":"1a37916fe55b0d3e9679f98f2b1d6a005dbd2347e35bc1c8e264888c79d8b8fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-25T22:54:15Z","title_canon_sha256":"02497f787b2b5419f6dbc310b7b08c15cc198a79415c030fb1beda0cee75cfc6"},"schema_version":"1.0","source":{"id":"1705.09385","kind":"arxiv","version":1}},"canonical_sha256":"f3064d3c2585ef5d1fecba378c400b4ee946158d8c577b92458f1249452b43ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3064d3c2585ef5d1fecba378c400b4ee946158d8c577b92458f1249452b43ac","first_computed_at":"2026-05-18T00:43:38.849369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.849369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3kHqKnO1t21V5T3XbFoom5EjYd1kipTfuaKQlDwyp01pqditQgVjE4KR2vR2Ye3GhkV/J3yyoyFawBHU8fjRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.849993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b6d1d08a615d24c25009066691cdf1f99fa19a16aafcaa296b4aea804637005","sha256:36c9cd44d0e60c8811e4e612b17f317cc20d824ee6380af9907fcbc5984ea290"],"state_sha256":"7e4cbac02767bae748a90bce3fc22578c13b92a25591e4ee182c4559efc355f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STmQ2yoj6/zGkjZP9t2hPLgvFCBnMdOxjaZrmd1B0czg5UdRrmXdZLrLcMLGd279mn3uTfH2WaEhhlN4vhI+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:19:04.498280Z","bundle_sha256":"f78cf2ed849e2803462e2a51e7428da88530e72979df89b612a772c28ced8de2"}}