{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YQFFIUH3J7GU4ZG2GJCCUJOUIF","short_pith_number":"pith:YQFFIUH3","canonical_record":{"source":{"id":"1704.08470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T08:15:11Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"955f732a85f89766683b8b787d38ad6ab553ac3aa8d632fe156b114805f1074c","abstract_canon_sha256":"d959573904efa7fcfe8c260f0e21ac87a86f87ee994c7334aae73fff57c0390c"},"schema_version":"1.0"},"canonical_sha256":"c40a5450fb4fcd4e64da32442a25d4416078beb324c8e24adfaa8a330206c736","source":{"kind":"arxiv","id":"1704.08470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08470","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08470v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08470","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"YQFFIUH3J7GU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQFFIUH3J7GU4ZG2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQFFIUH3","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YQFFIUH3J7GU4ZG2GJCCUJOUIF","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T08:15:11Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"955f732a85f89766683b8b787d38ad6ab553ac3aa8d632fe156b114805f1074c","abstract_canon_sha256":"d959573904efa7fcfe8c260f0e21ac87a86f87ee994c7334aae73fff57c0390c"},"schema_version":"1.0"},"canonical_sha256":"c40a5450fb4fcd4e64da32442a25d4416078beb324c8e24adfaa8a330206c736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.613125Z","signature_b64":"qj/AOU07bwUrAdtU0HJ4Y34ULcVH3+zg7nGq9n0/uuHGKvDmiIG8KW5tn4F8FfXNu8WXEc8J+9hWd9JkdX2NAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c40a5450fb4fcd4e64da32442a25d4416078beb324c8e24adfaa8a330206c736","last_reissued_at":"2026-05-18T00:45:27.612717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.612717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08470","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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGYFZjwjKsp0+lq+pH/0qVgEa6BPgEur5sAzzYNQ1RFsKwhFbApwkiv1pJYgRBEoyYEzWz2oOgQ+K32U6TDUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:59:08.548889Z"},"content_sha256":"1b5d4c5a70a90b614a3eb85f5b5610b0f7a6657ce37cb1ffa8899909533fd8dc","schema_version":"1.0","event_id":"sha256:1b5d4c5a70a90b614a3eb85f5b5610b0f7a6657ce37cb1ffa8899909533fd8dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YQFFIUH3J7GU4ZG2GJCCUJOUIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Trivikram Dokka","submitted_at":"2017-04-27T08:15:11Z","abstract_excerpt":"Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the network may not be known. This lead to the development of robust shortest path problems, where all possible arc travel times are contained in a so-called uncertainty set of possible outcomes.\n  Research in robust shortest path problems typically assumes this set to be given, and provides complexity results as well as algorithms depending on its shape. However, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08470","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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQPdIWVBLwzU8/PY2icvaz1OK5XCwUDl49/YCEmez2Cu62jHVY9PIxolU5nhOmgqAYmZItRfrUffVc9nbmDqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:59:08.549239Z"},"content_sha256":"2f960a3ed648020df672fc3ffe44ba72018bfa2afe36f900dd1dfd25ee282180","schema_version":"1.0","event_id":"sha256:2f960a3ed648020df672fc3ffe44ba72018bfa2afe36f900dd1dfd25ee282180"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF/bundle.json","state_url":"https://pith.science/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF/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-21T18:59:08Z","links":{"resolver":"https://pith.science/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF","bundle":"https://pith.science/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF/bundle.json","state":"https://pith.science/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQFFIUH3J7GU4ZG2GJCCUJOUIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YQFFIUH3J7GU4ZG2GJCCUJOUIF","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":"d959573904efa7fcfe8c260f0e21ac87a86f87ee994c7334aae73fff57c0390c","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T08:15:11Z","title_canon_sha256":"955f732a85f89766683b8b787d38ad6ab553ac3aa8d632fe156b114805f1074c"},"schema_version":"1.0","source":{"id":"1704.08470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08470","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08470v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08470","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"YQFFIUH3J7GU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQFFIUH3J7GU4ZG2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQFFIUH3","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:2f960a3ed648020df672fc3ffe44ba72018bfa2afe36f900dd1dfd25ee282180","target":"graph","created_at":"2026-05-18T00:45:27Z","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":"Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the network may not be known. This lead to the development of robust shortest path problems, where all possible arc travel times are contained in a so-called uncertainty set of possible outcomes.\n  Research in robust shortest path problems typically assumes this set to be given, and provides complexity results as well as algorithms depending on its shape. However, ","authors_text":"Marc Goerigk, Trivikram Dokka","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T08:15:11Z","title":"An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08470","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:1b5d4c5a70a90b614a3eb85f5b5610b0f7a6657ce37cb1ffa8899909533fd8dc","target":"record","created_at":"2026-05-18T00:45:27Z","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":"d959573904efa7fcfe8c260f0e21ac87a86f87ee994c7334aae73fff57c0390c","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T08:15:11Z","title_canon_sha256":"955f732a85f89766683b8b787d38ad6ab553ac3aa8d632fe156b114805f1074c"},"schema_version":"1.0","source":{"id":"1704.08470","kind":"arxiv","version":1}},"canonical_sha256":"c40a5450fb4fcd4e64da32442a25d4416078beb324c8e24adfaa8a330206c736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c40a5450fb4fcd4e64da32442a25d4416078beb324c8e24adfaa8a330206c736","first_computed_at":"2026-05-18T00:45:27.612717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.612717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qj/AOU07bwUrAdtU0HJ4Y34ULcVH3+zg7nGq9n0/uuHGKvDmiIG8KW5tn4F8FfXNu8WXEc8J+9hWd9JkdX2NAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.613125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b5d4c5a70a90b614a3eb85f5b5610b0f7a6657ce37cb1ffa8899909533fd8dc","sha256:2f960a3ed648020df672fc3ffe44ba72018bfa2afe36f900dd1dfd25ee282180"],"state_sha256":"d54fe776c6cce94dd9bb49ffc87fda7dd115df388a3708a480a5658541fabf72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OO39ZY46y5uVBLlZJjmhQ0w39iRNqH2VkMZf5d6nFU4Eh/Flj3kG5ZIfJ/qqWSDR205/a0QNJ2ccMNLoY1FoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:59:08.551244Z","bundle_sha256":"8c5ec47066b3579225893d2ab8bf7d68d9a247c4fbca4b884f516b9622694e33"}}