{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HCE2IAK4BTLEUG6YVPGFQTFMTY","short_pith_number":"pith:HCE2IAK4","canonical_record":{"source":{"id":"1508.03064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T05:12:47Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"1cc7a81d261c1de1318f6b387a372fc6011e7d48c726eed8ae81f58b1de2c3f5","abstract_canon_sha256":"ec8a8f681b48f6069971a67cdf5f8b6fb47b5552be0bb07083e566be6be8998b"},"schema_version":"1.0"},"canonical_sha256":"3889a4015c0cd64a1bd8abcc584cac9e203a6bc579f0d63350bcc3d0b0196f04","source":{"kind":"arxiv","id":"1508.03064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03064","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03064v1","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03064","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"pith_short_12","alias_value":"HCE2IAK4BTLE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HCE2IAK4BTLEUG6Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HCE2IAK4","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HCE2IAK4BTLEUG6YVPGFQTFMTY","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T05:12:47Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"1cc7a81d261c1de1318f6b387a372fc6011e7d48c726eed8ae81f58b1de2c3f5","abstract_canon_sha256":"ec8a8f681b48f6069971a67cdf5f8b6fb47b5552be0bb07083e566be6be8998b"},"schema_version":"1.0"},"canonical_sha256":"3889a4015c0cd64a1bd8abcc584cac9e203a6bc579f0d63350bcc3d0b0196f04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:21.853676Z","signature_b64":"YYmZ66DQj6db2RT2yfRiT3nMtuQrcd2+WGCzOIT1cAtOgS6Pp3uFBLrXDbOaxlNpUEfn9OtaJMkQVpysJ2S2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3889a4015c0cd64a1bd8abcc584cac9e203a6bc579f0d63350bcc3d0b0196f04","last_reissued_at":"2026-05-18T01:35:21.853028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:21.853028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03064","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-18T01:35:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1T8ZE7ApzEpGUIf1phNKP9Z/reY0GZSlLdY1hm4WwtlNYp0ESAXdeyzcqRfpO50+ZFmItmnlZsSwzU06a/pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:51:38.505012Z"},"content_sha256":"d78d66859b742616c747c5f64263985e18c68659a8d74d6cc13f445445cff0ba","schema_version":"1.0","event_id":"sha256:d78d66859b742616c747c5f64263985e18c68659a8d74d6cc13f445445cff0ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HCE2IAK4BTLEUG6YVPGFQTFMTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Path Selection for new Highway Alignments using Discrete Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.DS","authors_text":"Warren Hare, Yasha Pushak, Yves Lucet","submitted_at":"2015-07-30T05:12:47Z","abstract_excerpt":"This paper addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further consider combinations of techniques for reducing the costs associated with the computation and increasing the accuracy of the cost formulation. Numerical results for five algorithms to solve the dissimilar multipath problem show that a \"bidirectional approach\" yields the fastest running times and the most robust algorithm. Further modifications of the algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03064","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-18T01:35:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYzEiKOgwS39yAPqSygW60E5KRyiBWb6QmtLOUwKm/ExZUaV8XYGmvP1tvz/1uU2P7lDPnZw/9zEqox5T7W4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:51:38.505678Z"},"content_sha256":"b93f16321ad4485cb3f8a4f2a74aa6ba9752555d71c789907d30e6544bd64dd9","schema_version":"1.0","event_id":"sha256:b93f16321ad4485cb3f8a4f2a74aa6ba9752555d71c789907d30e6544bd64dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY/bundle.json","state_url":"https://pith.science/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY/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-23T00:51:38Z","links":{"resolver":"https://pith.science/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY","bundle":"https://pith.science/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY/bundle.json","state":"https://pith.science/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCE2IAK4BTLEUG6YVPGFQTFMTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HCE2IAK4BTLEUG6YVPGFQTFMTY","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":"ec8a8f681b48f6069971a67cdf5f8b6fb47b5552be0bb07083e566be6be8998b","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T05:12:47Z","title_canon_sha256":"1cc7a81d261c1de1318f6b387a372fc6011e7d48c726eed8ae81f58b1de2c3f5"},"schema_version":"1.0","source":{"id":"1508.03064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03064","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03064v1","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03064","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"pith_short_12","alias_value":"HCE2IAK4BTLE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HCE2IAK4BTLEUG6Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HCE2IAK4","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:b93f16321ad4485cb3f8a4f2a74aa6ba9752555d71c789907d30e6544bd64dd9","target":"graph","created_at":"2026-05-18T01:35:21Z","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 addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further consider combinations of techniques for reducing the costs associated with the computation and increasing the accuracy of the cost formulation. Numerical results for five algorithms to solve the dissimilar multipath problem show that a \"bidirectional approach\" yields the fastest running times and the most robust algorithm. Further modifications of the algori","authors_text":"Warren Hare, Yasha Pushak, Yves Lucet","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T05:12:47Z","title":"Multiple-Path Selection for new Highway Alignments using Discrete Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03064","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:d78d66859b742616c747c5f64263985e18c68659a8d74d6cc13f445445cff0ba","target":"record","created_at":"2026-05-18T01:35:21Z","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":"ec8a8f681b48f6069971a67cdf5f8b6fb47b5552be0bb07083e566be6be8998b","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-30T05:12:47Z","title_canon_sha256":"1cc7a81d261c1de1318f6b387a372fc6011e7d48c726eed8ae81f58b1de2c3f5"},"schema_version":"1.0","source":{"id":"1508.03064","kind":"arxiv","version":1}},"canonical_sha256":"3889a4015c0cd64a1bd8abcc584cac9e203a6bc579f0d63350bcc3d0b0196f04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3889a4015c0cd64a1bd8abcc584cac9e203a6bc579f0d63350bcc3d0b0196f04","first_computed_at":"2026-05-18T01:35:21.853028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:21.853028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYmZ66DQj6db2RT2yfRiT3nMtuQrcd2+WGCzOIT1cAtOgS6Pp3uFBLrXDbOaxlNpUEfn9OtaJMkQVpysJ2S2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:21.853676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d78d66859b742616c747c5f64263985e18c68659a8d74d6cc13f445445cff0ba","sha256:b93f16321ad4485cb3f8a4f2a74aa6ba9752555d71c789907d30e6544bd64dd9"],"state_sha256":"a480b690eb8be9e852ac295785686b36b8afc0f3be4865c34979a8bde360c3f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkJ0IuoHoqtznLohDMHOxAh/lsrIrcPY/tvr0VC4QD7brR5xoWcsDbgrENzoAr/C1seenXjX3qED4VxRIiPvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:51:38.509023Z","bundle_sha256":"45aa14ccac133adfccd9beadf93334d72b8d546fac5622c6071422ccf1a6c87b"}}