{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JZL3MYGHGO22JBI2WPCS336UID","short_pith_number":"pith:JZL3MYGH","schema_version":"1.0","canonical_sha256":"4e57b660c733b5a4851ab3c52defd440e79024ea060ed9ace876a23cbaea0817","source":{"kind":"arxiv","id":"1708.05930","version":1},"attestation_state":"computed","paper":{"title":"Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haoyuan Hu, Longfei Wang, Xiaodong Zhang, Xiaowei Yan, Yinghui Xu","submitted_at":"2017-08-20T03:53:04Z","abstract_excerpt":"In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of cuboid-shaped items must be put into a bin one by one orthogonally. The objective is to find a way to place these items that can minimize the surface area of the bin. This problem is based on the fact that there is no fixed-sized bin in many real business scenarios and the cost of a bin is proportional to its surface area. Our research shows that this problem is NP-hard. Based on previous research on 3D BPP, the surface area is determined by the sequence, spatial locations and orientations of items. Amo"},"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":"1708.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-20T03:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"4b6be68df718d4c783e3944270982dbd5b624370a119f41a2b7a4929d8d14d5e","abstract_canon_sha256":"b1559c34adb7797300bfd911e51f702eff23c46c2106398453a9b75e5cf6997f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.760934Z","signature_b64":"ODV4Qfeodx1ZdAJSSqeo2dZvnJ5R9jx7UWDZokRw9abQwsWX0OHx2IRVfg0SAB1OuMdlvnusDL2TcRUppHl5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e57b660c733b5a4851ab3c52defd440e79024ea060ed9ace876a23cbaea0817","last_reissued_at":"2026-05-18T00:37:43.760184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.760184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haoyuan Hu, Longfei Wang, Xiaodong Zhang, Xiaowei Yan, Yinghui Xu","submitted_at":"2017-08-20T03:53:04Z","abstract_excerpt":"In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of cuboid-shaped items must be put into a bin one by one orthogonally. The objective is to find a way to place these items that can minimize the surface area of the bin. This problem is based on the fact that there is no fixed-sized bin in many real business scenarios and the cost of a bin is proportional to its surface area. Our research shows that this problem is NP-hard. Based on previous research on 3D BPP, the surface area is determined by the sequence, spatial locations and orientations of items. Amo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05930","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":"1708.05930","created_at":"2026-05-18T00:37:43.760321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05930v1","created_at":"2026-05-18T00:37:43.760321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05930","created_at":"2026-05-18T00:37:43.760321+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZL3MYGHGO22","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZL3MYGHGO22JBI2","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZL3MYGH","created_at":"2026-05-18T12:31:24.725408+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/JZL3MYGHGO22JBI2WPCS336UID","json":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID.json","graph_json":"https://pith.science/api/pith-number/JZL3MYGHGO22JBI2WPCS336UID/graph.json","events_json":"https://pith.science/api/pith-number/JZL3MYGHGO22JBI2WPCS336UID/events.json","paper":"https://pith.science/paper/JZL3MYGH"},"agent_actions":{"view_html":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID","download_json":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID.json","view_paper":"https://pith.science/paper/JZL3MYGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05930&json=true","fetch_graph":"https://pith.science/api/pith-number/JZL3MYGHGO22JBI2WPCS336UID/graph.json","fetch_events":"https://pith.science/api/pith-number/JZL3MYGHGO22JBI2WPCS336UID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/action/storage_attestation","attest_author":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/action/author_attestation","sign_citation":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/action/citation_signature","submit_replication":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/action/replication_record"}},"created_at":"2026-05-18T00:37:43.760321+00:00","updated_at":"2026-05-18T00:37:43.760321+00:00"}