{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q24M5PV5UIRJXODYWRSOESFNDF","short_pith_number":"pith:Q24M5PV5","schema_version":"1.0","canonical_sha256":"86b8cebebda2229bb878b464e248ad196c7bc4f313c1503f721fb12d583e2004","source":{"kind":"arxiv","id":"2003.12918","version":2},"attestation_state":"computed","paper":{"title":"The Backhaul Profit Maximization Problem: Optimization Models and Solution Procedures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew Junfang Yu, Eli V. Olinick, Yuanyuan Dong, Yulan Bai","submitted_at":"2020-03-29T01:23:15Z","abstract_excerpt":"We present a compact mixed integer program (MIP) for the backhaul profit maximization problem in which a freight carrier seeks to generate profit from an empty delivery vehicle's backhaul trip from its last scheduled delivery to its depot by allowing it to deviate from the least expensive (or fastest) route to accept delivery requests between various points on the route as allowed by its capacity and required return time. The MIP is inspired by a novel representation of multicommodity flow that significantly reduces the size of the constraint matrix and the linear programming upper bound on op"},"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":"2003.12918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-29T01:23:15Z","cross_cats_sorted":[],"title_canon_sha256":"c31a40483bab9e1ed4571e52d4167bc47045fbee012fd9b56844c7dff4289f2c","abstract_canon_sha256":"4c41c74b0391e8b6c160d3099bf3ad5980fe11cf0812ec6a385bf229e792b2ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:14.593216Z","signature_b64":"C1HTrB/Q0LfUXWYDBEH8TQQssK4cMZ/7pgiWQvleaZbJ9v5tP7gH1UbScDztXQqxAg4nlfzCXGLUgZ81P69PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86b8cebebda2229bb878b464e248ad196c7bc4f313c1503f721fb12d583e2004","last_reissued_at":"2026-07-05T01:10:14.592740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:14.592740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Backhaul Profit Maximization Problem: Optimization Models and Solution Procedures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew Junfang Yu, Eli V. Olinick, Yuanyuan Dong, Yulan Bai","submitted_at":"2020-03-29T01:23:15Z","abstract_excerpt":"We present a compact mixed integer program (MIP) for the backhaul profit maximization problem in which a freight carrier seeks to generate profit from an empty delivery vehicle's backhaul trip from its last scheduled delivery to its depot by allowing it to deviate from the least expensive (or fastest) route to accept delivery requests between various points on the route as allowed by its capacity and required return time. The MIP is inspired by a novel representation of multicommodity flow that significantly reduces the size of the constraint matrix and the linear programming upper bound on op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12918","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.12918/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":"2003.12918","created_at":"2026-07-05T01:10:14.592798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.12918v2","created_at":"2026-07-05T01:10:14.592798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12918","created_at":"2026-07-05T01:10:14.592798+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q24M5PV5UIRJ","created_at":"2026-07-05T01:10:14.592798+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q24M5PV5UIRJXODY","created_at":"2026-07-05T01:10:14.592798+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q24M5PV5","created_at":"2026-07-05T01:10:14.592798+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/Q24M5PV5UIRJXODYWRSOESFNDF","json":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF.json","graph_json":"https://pith.science/api/pith-number/Q24M5PV5UIRJXODYWRSOESFNDF/graph.json","events_json":"https://pith.science/api/pith-number/Q24M5PV5UIRJXODYWRSOESFNDF/events.json","paper":"https://pith.science/paper/Q24M5PV5"},"agent_actions":{"view_html":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF","download_json":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF.json","view_paper":"https://pith.science/paper/Q24M5PV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.12918&json=true","fetch_graph":"https://pith.science/api/pith-number/Q24M5PV5UIRJXODYWRSOESFNDF/graph.json","fetch_events":"https://pith.science/api/pith-number/Q24M5PV5UIRJXODYWRSOESFNDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF/action/storage_attestation","attest_author":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF/action/author_attestation","sign_citation":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF/action/citation_signature","submit_replication":"https://pith.science/pith/Q24M5PV5UIRJXODYWRSOESFNDF/action/replication_record"}},"created_at":"2026-07-05T01:10:14.592798+00:00","updated_at":"2026-07-05T01:10:14.592798+00:00"}