{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HZUEOKYDM6CCDOKDQAW7TJ4XKI","short_pith_number":"pith:HZUEOKYD","schema_version":"1.0","canonical_sha256":"3e68472b03678421b943802df9a79752242c055bcb367065943b83a6300a3f84","source":{"kind":"arxiv","id":"1812.02565","version":1},"attestation_state":"computed","paper":{"title":"A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Haoyuan Hu, Kunpeng Han, Longfei Wang, Xinhang Zhang, Yinghui Xu, Ying Zhang, Zhijun Sun","submitted_at":"2018-11-29T05:26:23Z","abstract_excerpt":"Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of cuboid-shaped items should be packed into bins with given and fixed-sizes (length, width and height) to minimize the number of bins that are used. However, a novel bin design problem is proposed in this paper. The decision variables are the geometric sizes of bins, and the objective is to minimize the total surface area. To solve the problem, a low computational-com"},"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":"1812.02565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-29T05:26:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"43638b46b6c972590faa2ada6eba276f2840a3e2646f1bc49940c1346ba5f5cb","abstract_canon_sha256":"539dcac07cb14a0dcf2a62e416bed2a96a592d5038a18cc00efb6d32c4cac050"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:52.086884Z","signature_b64":"APYzrQ+mG6OAJrT32GckN+V5MRHauKjKpsffNsRVTVg0KoW1seY7EfcWAYWl1OWew037TFiU9gP+UX1uhuPFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e68472b03678421b943802df9a79752242c055bcb367065943b83a6300a3f84","last_reissued_at":"2026-05-17T23:58:52.086203Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:52.086203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Haoyuan Hu, Kunpeng Han, Longfei Wang, Xinhang Zhang, Yinghui Xu, Ying Zhang, Zhijun Sun","submitted_at":"2018-11-29T05:26:23Z","abstract_excerpt":"Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of cuboid-shaped items should be packed into bins with given and fixed-sizes (length, width and height) to minimize the number of bins that are used. However, a novel bin design problem is proposed in this paper. The decision variables are the geometric sizes of bins, and the objective is to minimize the total surface area. To solve the problem, a low computational-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02565","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":"1812.02565","created_at":"2026-05-17T23:58:52.086298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02565v1","created_at":"2026-05-17T23:58:52.086298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02565","created_at":"2026-05-17T23:58:52.086298+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZUEOKYDM6CC","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZUEOKYDM6CCDOKD","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZUEOKYD","created_at":"2026-05-18T12:32:28.185984+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/HZUEOKYDM6CCDOKDQAW7TJ4XKI","json":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI.json","graph_json":"https://pith.science/api/pith-number/HZUEOKYDM6CCDOKDQAW7TJ4XKI/graph.json","events_json":"https://pith.science/api/pith-number/HZUEOKYDM6CCDOKDQAW7TJ4XKI/events.json","paper":"https://pith.science/paper/HZUEOKYD"},"agent_actions":{"view_html":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI","download_json":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI.json","view_paper":"https://pith.science/paper/HZUEOKYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02565&json=true","fetch_graph":"https://pith.science/api/pith-number/HZUEOKYDM6CCDOKDQAW7TJ4XKI/graph.json","fetch_events":"https://pith.science/api/pith-number/HZUEOKYDM6CCDOKDQAW7TJ4XKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI/action/storage_attestation","attest_author":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI/action/author_attestation","sign_citation":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI/action/citation_signature","submit_replication":"https://pith.science/pith/HZUEOKYDM6CCDOKDQAW7TJ4XKI/action/replication_record"}},"created_at":"2026-05-17T23:58:52.086298+00:00","updated_at":"2026-05-17T23:58:52.086298+00:00"}