{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UX74SFFHEQ2BU2WAAIF2P7CNJG","short_pith_number":"pith:UX74SFFH","canonical_record":{"source":{"id":"1804.09745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T18:28:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"07cc05da19c470c9721b07f136b6b6f8699b7ac42e5df88f616165ee7942a04b","abstract_canon_sha256":"a42d8514f821bc9e790dcecf52e1202e62d4b6ead23a90e5a1ecb242d19f1958"},"schema_version":"1.0"},"canonical_sha256":"a5ffc914a724341a6ac0020ba7fc4d49b6e486a21e00356eac3cfac4984915f3","source":{"kind":"arxiv","id":"1804.09745","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09745","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09745v2","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09745","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"UX74SFFHEQ2B","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UX74SFFHEQ2BU2WA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UX74SFFH","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UX74SFFHEQ2BU2WAAIF2P7CNJG","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T18:28:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"07cc05da19c470c9721b07f136b6b6f8699b7ac42e5df88f616165ee7942a04b","abstract_canon_sha256":"a42d8514f821bc9e790dcecf52e1202e62d4b6ead23a90e5a1ecb242d19f1958"},"schema_version":"1.0"},"canonical_sha256":"a5ffc914a724341a6ac0020ba7fc4d49b6e486a21e00356eac3cfac4984915f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:59.859303Z","signature_b64":"WHvJ5lcbCKhkNm33r7nyNrXBok4e8djaWjhPOANqmjqk+W71MWNQM1Zlw08brKffbSNgb8xUNhl2dwqr6UeQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ffc914a724341a6ac0020ba7fc4d49b6e486a21e00356eac3cfac4984915f3","last_reissued_at":"2026-05-18T00:02:59.858695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:59.858695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09745","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-18T00:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMEPkx9wEwnYuOYzcuA/jDWWvYmzxRyyyJwun0gPNlgxobyiS9i1wjQ6u5qXDkF1G0QCEEMUMRFwVHApeza9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:23:44.881861Z"},"content_sha256":"93a6d320ce098b52491677a8561aa5869bfed7ed103f22796af8b07a832ce9c3","schema_version":"1.0","event_id":"sha256:93a6d320ce098b52491677a8561aa5869bfed7ed103f22796af8b07a832ce9c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UX74SFFHEQ2BU2WAAIF2P7CNJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Structure of Unique Shortest Paths in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Greg Bodwin","submitted_at":"2018-04-25T18:28:06Z","abstract_excerpt":"This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph with arbitrary real edge weights. We say that such a path system is strongly metrizable.\n  An easy fact implicit in the literature is that a strongly metrizable path system must be consistent, meaning that no two of its paths may intersect, split apart, and then intersect again. Our main result characterizes strong metrizability via some new forbidden inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09745","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-18T00:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6amAI4Wljp/z0iUPGrjFWwPpRA2amGbqZ2SzSvbokZ5viH4NXmh9cU3M+/ImXk8FA6PclrblydZz9MoyH4FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:23:44.882531Z"},"content_sha256":"6404cab3ac1562351c0f60b6ea4c0ff1f573883c72ad3b8475a269db721fb096","schema_version":"1.0","event_id":"sha256:6404cab3ac1562351c0f60b6ea4c0ff1f573883c72ad3b8475a269db721fb096"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG/bundle.json","state_url":"https://pith.science/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG/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-26T10:23:44Z","links":{"resolver":"https://pith.science/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG","bundle":"https://pith.science/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG/bundle.json","state":"https://pith.science/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UX74SFFHEQ2BU2WAAIF2P7CNJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UX74SFFHEQ2BU2WAAIF2P7CNJG","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":"a42d8514f821bc9e790dcecf52e1202e62d4b6ead23a90e5a1ecb242d19f1958","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T18:28:06Z","title_canon_sha256":"07cc05da19c470c9721b07f136b6b6f8699b7ac42e5df88f616165ee7942a04b"},"schema_version":"1.0","source":{"id":"1804.09745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09745","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09745v2","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09745","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"UX74SFFHEQ2B","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UX74SFFHEQ2BU2WA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UX74SFFH","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:6404cab3ac1562351c0f60b6ea4c0ff1f573883c72ad3b8475a269db721fb096","target":"graph","created_at":"2026-05-18T00:02:59Z","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":"This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph with arbitrary real edge weights. We say that such a path system is strongly metrizable.\n  An easy fact implicit in the literature is that a strongly metrizable path system must be consistent, meaning that no two of its paths may intersect, split apart, and then intersect again. Our main result characterizes strong metrizability via some new forbidden inter","authors_text":"Greg Bodwin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T18:28:06Z","title":"On the Structure of Unique Shortest Paths in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09745","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:93a6d320ce098b52491677a8561aa5869bfed7ed103f22796af8b07a832ce9c3","target":"record","created_at":"2026-05-18T00:02:59Z","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":"a42d8514f821bc9e790dcecf52e1202e62d4b6ead23a90e5a1ecb242d19f1958","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T18:28:06Z","title_canon_sha256":"07cc05da19c470c9721b07f136b6b6f8699b7ac42e5df88f616165ee7942a04b"},"schema_version":"1.0","source":{"id":"1804.09745","kind":"arxiv","version":2}},"canonical_sha256":"a5ffc914a724341a6ac0020ba7fc4d49b6e486a21e00356eac3cfac4984915f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5ffc914a724341a6ac0020ba7fc4d49b6e486a21e00356eac3cfac4984915f3","first_computed_at":"2026-05-18T00:02:59.858695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:59.858695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WHvJ5lcbCKhkNm33r7nyNrXBok4e8djaWjhPOANqmjqk+W71MWNQM1Zlw08brKffbSNgb8xUNhl2dwqr6UeQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:59.859303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93a6d320ce098b52491677a8561aa5869bfed7ed103f22796af8b07a832ce9c3","sha256:6404cab3ac1562351c0f60b6ea4c0ff1f573883c72ad3b8475a269db721fb096"],"state_sha256":"27183c67f1aed04bd1975be006e00ad79762742783ab08eb75bc5890e8967c06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISFUdPvU8E45V8klnxOsGTSHsa+PNN4xgRxL6O+ro9MYfoIfQdy4GLjGDJ6yFVHxjTP16T+NIBuRzu9dgm4DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:23:44.885847Z","bundle_sha256":"c7dc204e012df8b0d567eb7c775e0b592f15a20b0934f4f674b5211dbaca191e"}}