{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OVISFK6XSXHYI2M5DOFVL4ORLI","short_pith_number":"pith:OVISFK6X","schema_version":"1.0","canonical_sha256":"755122abd795cf84699d1b8b55f1d15a3ffb0d2cf009e7b5a43206300822380e","source":{"kind":"arxiv","id":"2402.00992","version":1},"attestation_state":"computed","paper":{"title":"Routing Model for Multicommodity Freight in an Intermodal Network under Disruptions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Majbah Uddin, Nathan Huynh","submitted_at":"2024-02-01T20:10:45Z","abstract_excerpt":"This paper presents a mathematical model for the routing of multicommodity freight in an intermodal network under disruptions. A stochastic mixed-integer program was formulated to minimize not only operational costs of various modes and transfer costs at terminals but also penalty costs associated with unsatisfied demands. The sample average approximation algorithm was used to solve this challenging problem. The developed model was then applied to two networks-a hypothetical 15-node network and an actual intermodal network in the Gulf Coast, Southeastern, and Mid-Atlantic regions of the United"},"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":"2402.00992","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-01T20:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"64a716c971796118a3000cf257177eca6af37f09a730c324684ef02333545373","abstract_canon_sha256":"2d8a6b145493b1cac6f76f34df7bb0a83d3af7a6b341412f8e9ab035c5eb8eb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:29.053672Z","signature_b64":"s7pGGR1O4hn478aUl4JPPgxHPKu7H8Sk3uaK/6reIV9fINB9DPsQlw4KoTlD84+Tj+iRQUdbXo3pfSkK3BdwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"755122abd795cf84699d1b8b55f1d15a3ffb0d2cf009e7b5a43206300822380e","last_reissued_at":"2026-07-05T07:40:29.053309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:29.053309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing Model for Multicommodity Freight in an Intermodal Network under Disruptions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Majbah Uddin, Nathan Huynh","submitted_at":"2024-02-01T20:10:45Z","abstract_excerpt":"This paper presents a mathematical model for the routing of multicommodity freight in an intermodal network under disruptions. A stochastic mixed-integer program was formulated to minimize not only operational costs of various modes and transfer costs at terminals but also penalty costs associated with unsatisfied demands. The sample average approximation algorithm was used to solve this challenging problem. The developed model was then applied to two networks-a hypothetical 15-node network and an actual intermodal network in the Gulf Coast, Southeastern, and Mid-Atlantic regions of the United"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00992","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.00992/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.00992","created_at":"2026-07-05T07:40:29.053371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.00992v1","created_at":"2026-07-05T07:40:29.053371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00992","created_at":"2026-07-05T07:40:29.053371+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVISFK6XSXHY","created_at":"2026-07-05T07:40:29.053371+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVISFK6XSXHYI2M5","created_at":"2026-07-05T07:40:29.053371+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVISFK6X","created_at":"2026-07-05T07:40:29.053371+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/OVISFK6XSXHYI2M5DOFVL4ORLI","json":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI.json","graph_json":"https://pith.science/api/pith-number/OVISFK6XSXHYI2M5DOFVL4ORLI/graph.json","events_json":"https://pith.science/api/pith-number/OVISFK6XSXHYI2M5DOFVL4ORLI/events.json","paper":"https://pith.science/paper/OVISFK6X"},"agent_actions":{"view_html":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI","download_json":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI.json","view_paper":"https://pith.science/paper/OVISFK6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.00992&json=true","fetch_graph":"https://pith.science/api/pith-number/OVISFK6XSXHYI2M5DOFVL4ORLI/graph.json","fetch_events":"https://pith.science/api/pith-number/OVISFK6XSXHYI2M5DOFVL4ORLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI/action/storage_attestation","attest_author":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI/action/author_attestation","sign_citation":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI/action/citation_signature","submit_replication":"https://pith.science/pith/OVISFK6XSXHYI2M5DOFVL4ORLI/action/replication_record"}},"created_at":"2026-07-05T07:40:29.053371+00:00","updated_at":"2026-07-05T07:40:29.053371+00:00"}