{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A2IFLKKCRHNCEND2TAHZFRAPM3","short_pith_number":"pith:A2IFLKKC","schema_version":"1.0","canonical_sha256":"069055a94289da22347a980f92c40f66f2a643073b9891740b32c1f53a6edc43","source":{"kind":"arxiv","id":"2009.14628","version":1},"attestation_state":"computed","paper":{"title":"Meta Partial Benders Decomposition for the Logistics Service Network Design Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fr\\'ed\\'eric Semet, Mike Hewitt, Nicolas Jozefowiez (LCOMS), Simon Belieres","submitted_at":"2020-09-30T12:44:43Z","abstract_excerpt":"Supply chain transportation operations often account for a large proportion of product total cost to market. Such operations can be optimized by solving the Logistics Service Network Design Problem (LSNDP), wherein a logistics service provider seeks to cost-effectively source and fulfill customer demands of products within a multi-echelon distribution network. However, many industrial settings yield instances of the LSNDP that are too large to be solved in reasonable run-times by off-the-shelf optimization solvers. We introduce an exact Benders decomposition algorithm based on partial decompos"},"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":"2009.14628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-09-30T12:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"eb987dc653c7900967a125050c1de1938bef52229fb5d567fc5a588865919ce5","abstract_canon_sha256":"98768ed8ab9707a4a7ebea815e42efc7fd96e8327758b3a4450be99b5f32b1ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:21.484345Z","signature_b64":"+57hJxxA1oPrjnc3m9Jn2D2M4c05AeZZf47zBBMvhRM/1rYA2tldtBPMsTGcs1C1bse6vq/7GbHk0k9V6dOnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069055a94289da22347a980f92c40f66f2a643073b9891740b32c1f53a6edc43","last_reissued_at":"2026-07-05T01:39:21.483943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:21.483943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta Partial Benders Decomposition for the Logistics Service Network Design Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fr\\'ed\\'eric Semet, Mike Hewitt, Nicolas Jozefowiez (LCOMS), Simon Belieres","submitted_at":"2020-09-30T12:44:43Z","abstract_excerpt":"Supply chain transportation operations often account for a large proportion of product total cost to market. Such operations can be optimized by solving the Logistics Service Network Design Problem (LSNDP), wherein a logistics service provider seeks to cost-effectively source and fulfill customer demands of products within a multi-echelon distribution network. However, many industrial settings yield instances of the LSNDP that are too large to be solved in reasonable run-times by off-the-shelf optimization solvers. We introduce an exact Benders decomposition algorithm based on partial decompos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.14628","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/2009.14628/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":"2009.14628","created_at":"2026-07-05T01:39:21.484005+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.14628v1","created_at":"2026-07-05T01:39:21.484005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.14628","created_at":"2026-07-05T01:39:21.484005+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2IFLKKCRHNC","created_at":"2026-07-05T01:39:21.484005+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2IFLKKCRHNCEND2","created_at":"2026-07-05T01:39:21.484005+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2IFLKKC","created_at":"2026-07-05T01:39:21.484005+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/A2IFLKKCRHNCEND2TAHZFRAPM3","json":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3.json","graph_json":"https://pith.science/api/pith-number/A2IFLKKCRHNCEND2TAHZFRAPM3/graph.json","events_json":"https://pith.science/api/pith-number/A2IFLKKCRHNCEND2TAHZFRAPM3/events.json","paper":"https://pith.science/paper/A2IFLKKC"},"agent_actions":{"view_html":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3","download_json":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3.json","view_paper":"https://pith.science/paper/A2IFLKKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.14628&json=true","fetch_graph":"https://pith.science/api/pith-number/A2IFLKKCRHNCEND2TAHZFRAPM3/graph.json","fetch_events":"https://pith.science/api/pith-number/A2IFLKKCRHNCEND2TAHZFRAPM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3/action/storage_attestation","attest_author":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3/action/author_attestation","sign_citation":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3/action/citation_signature","submit_replication":"https://pith.science/pith/A2IFLKKCRHNCEND2TAHZFRAPM3/action/replication_record"}},"created_at":"2026-07-05T01:39:21.484005+00:00","updated_at":"2026-07-05T01:39:21.484005+00:00"}