{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C4KHIGT4ZB5A67FO4HFOUDZ6XM","short_pith_number":"pith:C4KHIGT4","schema_version":"1.0","canonical_sha256":"1714741a7cc87a0f7caee1caea0f3ebb1e25c40117413ae90be9ba2b4d6d4050","source":{"kind":"arxiv","id":"1701.01768","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.01768","created_at":"2026-05-18T00:53:15.154892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01768v1","created_at":"2026-05-18T00:53:15.154892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01768","created_at":"2026-05-18T00:53:15.154892+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4KHIGT4ZB5A","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4KHIGT4ZB5A67FO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4KHIGT4","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM","json":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM.json","graph_json":"https://pith.science/api/pith-number/C4KHIGT4ZB5A67FO4HFOUDZ6XM/graph.json","events_json":"https://pith.science/api/pith-number/C4KHIGT4ZB5A67FO4HFOUDZ6XM/events.json","paper":"https://pith.science/paper/C4KHIGT4"},"agent_actions":{"view_html":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM","download_json":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM.json","view_paper":"https://pith.science/paper/C4KHIGT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01768&json=true","fetch_graph":"https://pith.science/api/pith-number/C4KHIGT4ZB5A67FO4HFOUDZ6XM/graph.json","fetch_events":"https://pith.science/api/pith-number/C4KHIGT4ZB5A67FO4HFOUDZ6XM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/action/storage_attestation","attest_author":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/action/author_attestation","sign_citation":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/action/citation_signature","submit_replication":"https://pith.science/pith/C4KHIGT4ZB5A67FO4HFOUDZ6XM/action/replication_record"}},"created_at":"2026-05-18T00:53:15.154892+00:00","updated_at":"2026-05-18T00:53:15.154892+00:00"}