{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:22CBNP4QJUI7H5VVPYPSXQTUQF","short_pith_number":"pith:22CBNP4Q","schema_version":"1.0","canonical_sha256":"d68416bf904d11f3f6b57e1f2bc274815c2a7d5ea3a4eac03bdb5de25a3e9af5","source":{"kind":"arxiv","id":"2307.04050","version":2},"attestation_state":"computed","paper":{"title":"Optimization-based Learning for Dynamic Load Planning in Trucking Service Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Alan Erera, Hanyu Zhang, Pascal Van Hentenryck, Reem Khir, Ritesh Ojha, Wenbo Chen","submitted_at":"2023-07-08T21:28:20Z","abstract_excerpt":"The load planning problem is a critical challenge in service network design for parcel carriers: it decides how many trailers to assign for dispatch over time between pairs of terminals. Another key challenge is to determine a flow plan, which specifies how parcel volumes are assigned to planned loads. This paper considers the Outbound Load Planning Problem (OLPP) that considers flow and load planning challenges jointly in order to adjust loads and flows as the demand forecast changes over time before the day of operations in a terminal. The paper aims at developing a decision-support tool to "},"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":"2307.04050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-08T21:28:20Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"31575fe0c2a587fef06a68a262bbd576b487a97bde259e7081d4e1039097c3a6","abstract_canon_sha256":"f7b6bf285a7a1ba30e878977ae71e8fb5dd750e14ade6e3192562c4715e32dd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:43.905737Z","signature_b64":"WZeQmva3ycUv4kQlPDdpsUI3eeAHw7GXNOYkfwPy41dPo4ymPb5xUgbNu8KgJlBukm95fRcZOhNdheqcqckDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d68416bf904d11f3f6b57e1f2bc274815c2a7d5ea3a4eac03bdb5de25a3e9af5","last_reissued_at":"2026-07-05T08:12:43.905212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:43.905212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization-based Learning for Dynamic Load Planning in Trucking Service Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Alan Erera, Hanyu Zhang, Pascal Van Hentenryck, Reem Khir, Ritesh Ojha, Wenbo Chen","submitted_at":"2023-07-08T21:28:20Z","abstract_excerpt":"The load planning problem is a critical challenge in service network design for parcel carriers: it decides how many trailers to assign for dispatch over time between pairs of terminals. Another key challenge is to determine a flow plan, which specifies how parcel volumes are assigned to planned loads. This paper considers the Outbound Load Planning Problem (OLPP) that considers flow and load planning challenges jointly in order to adjust loads and flows as the demand forecast changes over time before the day of operations in a terminal. The paper aims at developing a decision-support tool to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04050","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/2307.04050/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":"2307.04050","created_at":"2026-07-05T08:12:43.905279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04050v2","created_at":"2026-07-05T08:12:43.905279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04050","created_at":"2026-07-05T08:12:43.905279+00:00"},{"alias_kind":"pith_short_12","alias_value":"22CBNP4QJUI7","created_at":"2026-07-05T08:12:43.905279+00:00"},{"alias_kind":"pith_short_16","alias_value":"22CBNP4QJUI7H5VV","created_at":"2026-07-05T08:12:43.905279+00:00"},{"alias_kind":"pith_short_8","alias_value":"22CBNP4Q","created_at":"2026-07-05T08:12:43.905279+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/22CBNP4QJUI7H5VVPYPSXQTUQF","json":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF.json","graph_json":"https://pith.science/api/pith-number/22CBNP4QJUI7H5VVPYPSXQTUQF/graph.json","events_json":"https://pith.science/api/pith-number/22CBNP4QJUI7H5VVPYPSXQTUQF/events.json","paper":"https://pith.science/paper/22CBNP4Q"},"agent_actions":{"view_html":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF","download_json":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF.json","view_paper":"https://pith.science/paper/22CBNP4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04050&json=true","fetch_graph":"https://pith.science/api/pith-number/22CBNP4QJUI7H5VVPYPSXQTUQF/graph.json","fetch_events":"https://pith.science/api/pith-number/22CBNP4QJUI7H5VVPYPSXQTUQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF/action/storage_attestation","attest_author":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF/action/author_attestation","sign_citation":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF/action/citation_signature","submit_replication":"https://pith.science/pith/22CBNP4QJUI7H5VVPYPSXQTUQF/action/replication_record"}},"created_at":"2026-07-05T08:12:43.905279+00:00","updated_at":"2026-07-05T08:12:43.905279+00:00"}