{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SYAWQQJEOYLW55Z566BAFU3MHY","short_pith_number":"pith:SYAWQQJE","canonical_record":{"source":{"id":"1809.06831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T17:02:55Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0c80a773998e867e37c5fde82c3a203aef30be819438890105fdf1a541821068","abstract_canon_sha256":"856ec6967decc8af1c761f15be18f636836ec52e7cf0a5c0935d3ed43bf07e16"},"schema_version":"1.0"},"canonical_sha256":"960168412476176ef73df78202d36c3e068f760829d55b65391ba0407b916e25","source":{"kind":"arxiv","id":"1809.06831","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06831","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06831v2","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06831","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"SYAWQQJEOYLW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SYAWQQJEOYLW55Z5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SYAWQQJE","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SYAWQQJEOYLW55Z566BAFU3MHY","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T17:02:55Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0c80a773998e867e37c5fde82c3a203aef30be819438890105fdf1a541821068","abstract_canon_sha256":"856ec6967decc8af1c761f15be18f636836ec52e7cf0a5c0935d3ed43bf07e16"},"schema_version":"1.0"},"canonical_sha256":"960168412476176ef73df78202d36c3e068f760829d55b65391ba0407b916e25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.664594Z","signature_b64":"ktT7xMXv0iBPktuWdK6XYDvnJ/NV8HcWBYcmXuzY2M2fvnDyQQhfF9gOXouU0VXWNJVAQKLd6bOCoaNoqyKKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"960168412476176ef73df78202d36c3e068f760829d55b65391ba0407b916e25","last_reissued_at":"2026-05-18T00:02:24.663947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.663947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06831","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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiQAOjlTrD2AcsUkzgHMn8feB1AMoxPZId/utI5asIVF2Yvd/Qsivlio1ts33Ga+dxQibijfi60hNJTl9XeOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:37:50.102089Z"},"content_sha256":"4c77d339e24e511d14a736492a4ea37909dc70281f1451a682fffdd5f44945d1","schema_version":"1.0","event_id":"sha256:4c77d339e24e511d14a736492a4ea37909dc70281f1451a682fffdd5f44945d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SYAWQQJEOYLW55Z566BAFU3MHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding k-Dissimilar Paths with Minimum Collective Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"David B. Blumenthal, Johann Gamper, Panagiotis Bouros, Theodoros Chondrogiannis, Ulf Leser","submitted_at":"2018-09-18T17:02:55Z","abstract_excerpt":"Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \\theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06831","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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lg+hBoT3vDR8F1U7+zrWSZaxJmLR8xxKe+mYfdFiOQsarAQ9+lV9BioiUaV4FRYibjSg4Av6EGnR8cl3WIGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:37:50.102707Z"},"content_sha256":"03a1b62b79a8b2a45c6ae637c082b92367801c35a54d1062e9af04d935e4f6e2","schema_version":"1.0","event_id":"sha256:03a1b62b79a8b2a45c6ae637c082b92367801c35a54d1062e9af04d935e4f6e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYAWQQJEOYLW55Z566BAFU3MHY/bundle.json","state_url":"https://pith.science/pith/SYAWQQJEOYLW55Z566BAFU3MHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYAWQQJEOYLW55Z566BAFU3MHY/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-31T08:37:50Z","links":{"resolver":"https://pith.science/pith/SYAWQQJEOYLW55Z566BAFU3MHY","bundle":"https://pith.science/pith/SYAWQQJEOYLW55Z566BAFU3MHY/bundle.json","state":"https://pith.science/pith/SYAWQQJEOYLW55Z566BAFU3MHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYAWQQJEOYLW55Z566BAFU3MHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SYAWQQJEOYLW55Z566BAFU3MHY","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":"856ec6967decc8af1c761f15be18f636836ec52e7cf0a5c0935d3ed43bf07e16","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T17:02:55Z","title_canon_sha256":"0c80a773998e867e37c5fde82c3a203aef30be819438890105fdf1a541821068"},"schema_version":"1.0","source":{"id":"1809.06831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06831","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06831v2","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06831","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"SYAWQQJEOYLW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SYAWQQJEOYLW55Z5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SYAWQQJE","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:03a1b62b79a8b2a45c6ae637c082b92367801c35a54d1062e9af04d935e4f6e2","target":"graph","created_at":"2026-05-18T00:02:24Z","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":"Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \\theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohi","authors_text":"David B. Blumenthal, Johann Gamper, Panagiotis Bouros, Theodoros Chondrogiannis, Ulf Leser","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T17:02:55Z","title":"Finding k-Dissimilar Paths with Minimum Collective Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06831","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:4c77d339e24e511d14a736492a4ea37909dc70281f1451a682fffdd5f44945d1","target":"record","created_at":"2026-05-18T00:02:24Z","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":"856ec6967decc8af1c761f15be18f636836ec52e7cf0a5c0935d3ed43bf07e16","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T17:02:55Z","title_canon_sha256":"0c80a773998e867e37c5fde82c3a203aef30be819438890105fdf1a541821068"},"schema_version":"1.0","source":{"id":"1809.06831","kind":"arxiv","version":2}},"canonical_sha256":"960168412476176ef73df78202d36c3e068f760829d55b65391ba0407b916e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"960168412476176ef73df78202d36c3e068f760829d55b65391ba0407b916e25","first_computed_at":"2026-05-18T00:02:24.663947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.663947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ktT7xMXv0iBPktuWdK6XYDvnJ/NV8HcWBYcmXuzY2M2fvnDyQQhfF9gOXouU0VXWNJVAQKLd6bOCoaNoqyKKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.664594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c77d339e24e511d14a736492a4ea37909dc70281f1451a682fffdd5f44945d1","sha256:03a1b62b79a8b2a45c6ae637c082b92367801c35a54d1062e9af04d935e4f6e2"],"state_sha256":"d5238f3c43f0d8124932a83c56e7fa69c2b0ee7b558055d841dbf11ff3d1bf45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"249JfKcHxcKlCfCMKskNfWxiQvd0+td6CgPgaWsfwCLa9CckAj5W5ud/KOC4v/goI/dTzUg/4hy7wuHeoJZVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:37:50.111706Z","bundle_sha256":"5ef9ece74061df4b5cf79d96e10fb60bf2b700c582e3503808b2ff4b200b9cdc"}}