{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C4KHIGT4ZB5A67FO4HFOUDZ6XM","short_pith_number":"pith:C4KHIGT4","canonical_record":{"source":{"id":"1701.01768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-06T22:13:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a7573f016b9cc418c7e6b2be3884db69224f87da56bc3982d30e8086475ea83","abstract_canon_sha256":"082142c875648ccb09a2ea147ee24fc2c56460ec0f066672e00b3aca0171c3b2"},"schema_version":"1.0"},"canonical_sha256":"1714741a7cc87a0f7caee1caea0f3ebb1e25c40117413ae90be9ba2b4d6d4050","source":{"kind":"arxiv","id":"1701.01768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01768","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01768v1","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01768","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"C4KHIGT4ZB5A","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C4KHIGT4ZB5A67FO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C4KHIGT4","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C4KHIGT4ZB5A67FO4HFOUDZ6XM","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-06T22:13:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a7573f016b9cc418c7e6b2be3884db69224f87da56bc3982d30e8086475ea83","abstract_canon_sha256":"082142c875648ccb09a2ea147ee24fc2c56460ec0f066672e00b3aca0171c3b2"},"schema_version":"1.0"},"canonical_sha256":"1714741a7cc87a0f7caee1caea0f3ebb1e25c40117413ae90be9ba2b4d6d4050","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:15.155212Z","signature_b64":"PzRx/ZXtg0iOs1Vd+Tqf1QZqkfyd8bptDPY8lmufuGB8/K8/VgFY8tUg5Le+i4zwDi1yFbFfXnpGoi/UlpNmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1714741a7cc87a0f7caee1caea0f3ebb1e25c40117413ae90be9ba2b4d6d4050","last_reissued_at":"2026-05-18T00:53:15.154827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:15.154827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01768","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:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DL3Hmj/Dn94eT2r7r1xeBejQYZTGk8UpUV07qO9zsgcH8zm0NSGf8xiGgbf7CJBftgSGJweanGTl/V6dY1bHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:27:30.681548Z"},"content_sha256":"8b9f8a34de0e18524f206a48e75fe1f56f8b3871ef6514b666e8fba62f688e78","schema_version":"1.0","event_id":"sha256:8b9f8a34de0e18524f206a48e75fe1f56f8b3871ef6514b666e8fba62f688e78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C4KHIGT4ZB5A67FO4HFOUDZ6XM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Haul Quasi Network Flow Model for Vertical Alignment Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Shahadat Hossain, Vahid Beiranvand, Warren Hare, Yves Lucet","submitted_at":"2017-01-06T22:13:21Z","abstract_excerpt":"The vertical alignment optimization problem for road design aims to generate a vertical alignment of a new road with a minimum cost, while satisfying safety and design constraints. We present a new model called multi-haul quasi network flow (MH-QNF) for vertical alignment optimization that improves the accuracy and reliability of previous mixed integer linear programming models. We evaluate the performance of the new model compared to two state-of-the-art models in the field: the complete transportation graph (CTG) and the quasi network flow (QNF) models. The numerical results show that, withi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01768","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:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJGBwMEo+FXL415lP6XEC9JovfjvyKyuDeOeMjj/LYIxpx5Cva+eCZmpqE3VwGdv33SZJkQ650b59jbmxigLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:27:30.682223Z"},"content_sha256":"f5f8f6d184cb46d2d459d9d4ac7dbe8f255c530744490d451c811b5256111277","schema_version":"1.0","event_id":"sha256:f5f8f6d184cb46d2d459d9d4ac7dbe8f255c530744490d451c811b5256111277"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/bundle.json","state_url":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/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-22T16:27:30Z","links":{"resolver":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM","bundle":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/bundle.json","state":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C4KHIGT4ZB5A67FO4HFOUDZ6XM","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":"082142c875648ccb09a2ea147ee24fc2c56460ec0f066672e00b3aca0171c3b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-06T22:13:21Z","title_canon_sha256":"2a7573f016b9cc418c7e6b2be3884db69224f87da56bc3982d30e8086475ea83"},"schema_version":"1.0","source":{"id":"1701.01768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01768","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01768v1","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01768","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"C4KHIGT4ZB5A","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C4KHIGT4ZB5A67FO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C4KHIGT4","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:f5f8f6d184cb46d2d459d9d4ac7dbe8f255c530744490d451c811b5256111277","target":"graph","created_at":"2026-05-18T00:53:15Z","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":"The vertical alignment optimization problem for road design aims to generate a vertical alignment of a new road with a minimum cost, while satisfying safety and design constraints. We present a new model called multi-haul quasi network flow (MH-QNF) for vertical alignment optimization that improves the accuracy and reliability of previous mixed integer linear programming models. We evaluate the performance of the new model compared to two state-of-the-art models in the field: the complete transportation graph (CTG) and the quasi network flow (QNF) models. The numerical results show that, withi","authors_text":"Shahadat Hossain, Vahid Beiranvand, Warren Hare, Yves Lucet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-06T22:13:21Z","title":"Multi-Haul Quasi Network Flow Model for Vertical Alignment Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01768","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:8b9f8a34de0e18524f206a48e75fe1f56f8b3871ef6514b666e8fba62f688e78","target":"record","created_at":"2026-05-18T00:53:15Z","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":"082142c875648ccb09a2ea147ee24fc2c56460ec0f066672e00b3aca0171c3b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-06T22:13:21Z","title_canon_sha256":"2a7573f016b9cc418c7e6b2be3884db69224f87da56bc3982d30e8086475ea83"},"schema_version":"1.0","source":{"id":"1701.01768","kind":"arxiv","version":1}},"canonical_sha256":"1714741a7cc87a0f7caee1caea0f3ebb1e25c40117413ae90be9ba2b4d6d4050","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1714741a7cc87a0f7caee1caea0f3ebb1e25c40117413ae90be9ba2b4d6d4050","first_computed_at":"2026-05-18T00:53:15.154827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:15.154827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PzRx/ZXtg0iOs1Vd+Tqf1QZqkfyd8bptDPY8lmufuGB8/K8/VgFY8tUg5Le+i4zwDi1yFbFfXnpGoi/UlpNmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:15.155212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b9f8a34de0e18524f206a48e75fe1f56f8b3871ef6514b666e8fba62f688e78","sha256:f5f8f6d184cb46d2d459d9d4ac7dbe8f255c530744490d451c811b5256111277"],"state_sha256":"da1772cdd4759c6ace99b8775bf51ed99913794404f19c3a87a6cfb0ccb04432"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQBDV4Utg9Q4g7PhyxhUAkf+uS3BL/fU71iNwSK23fJVpmOH3ciw/Cz2bHlc5oVQim+d9PGeNNEg7kQnzVpLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:27:30.685279Z","bundle_sha256":"f43ed8afbb2df00f303ecfd1b91fc428d882d3d8b975106efb13eb4094dcce69"}}