{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JZL3MYGHGO22JBI2WPCS336UID","short_pith_number":"pith:JZL3MYGH","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"},"canonical_sha256":"4e57b660c733b5a4851ab3c52defd440e79024ea060ed9ace876a23cbaea0817","source":{"kind":"arxiv","id":"1708.05930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05930","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05930v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05930","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"JZL3MYGHGO22","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JZL3MYGHGO22JBI2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JZL3MYGH","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JZL3MYGHGO22JBI2WPCS336UID","target":"record","payload":{"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"},"canonical_sha256":"4e57b660c733b5a4851ab3c52defd440e79024ea060ed9ace876a23cbaea0817","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"},"source_kind":"arxiv","source_id":"1708.05930","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jil7CCKpJMnt8xQ34GaYtwqf3GPKH5zfL0NAwCnSaKpJJMhNDftLwmNiPN8oNP4DjIh2wNSJH0+8OfAZiFpFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:27:57.904306Z"},"content_sha256":"3a8395aa7929bb213595da00a9bbb8d8be2f4a1d805b7b37d4d354a59a2d5488","schema_version":"1.0","event_id":"sha256:3a8395aa7929bb213595da00a9bbb8d8be2f4a1d805b7b37d4d354a59a2d5488"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JZL3MYGHGO22JBI2WPCS336UID","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmLBitNHiTewnyED44F2DkcyWGdO3cy/xOUtw3Y7UTNUrKQYA26Ax4tC4e/OUIAQBraRCP7KnSmpd1MVsc95BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:27:57.904677Z"},"content_sha256":"6b4ef5619fc33c6711dfa58eeef43ae91163d9aff3fb720708296020a4b67ebc","schema_version":"1.0","event_id":"sha256:6b4ef5619fc33c6711dfa58eeef43ae91163d9aff3fb720708296020a4b67ebc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/bundle.json","state_url":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZL3MYGHGO22JBI2WPCS336UID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T15:27:57Z","links":{"resolver":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID","bundle":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/bundle.json","state":"https://pith.science/pith/JZL3MYGHGO22JBI2WPCS336UID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZL3MYGHGO22JBI2WPCS336UID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JZL3MYGHGO22JBI2WPCS336UID","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b1559c34adb7797300bfd911e51f702eff23c46c2106398453a9b75e5cf6997f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-20T03:53:04Z","title_canon_sha256":"4b6be68df718d4c783e3944270982dbd5b624370a119f41a2b7a4929d8d14d5e"},"schema_version":"1.0","source":{"id":"1708.05930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05930","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05930v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05930","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"JZL3MYGHGO22","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JZL3MYGHGO22JBI2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JZL3MYGH","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6b4ef5619fc33c6711dfa58eeef43ae91163d9aff3fb720708296020a4b67ebc","target":"graph","created_at":"2026-05-18T00:37:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Haoyuan Hu, Longfei Wang, Xiaodong Zhang, Xiaowei Yan, Yinghui Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-20T03:53:04Z","title":"Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05930","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a8395aa7929bb213595da00a9bbb8d8be2f4a1d805b7b37d4d354a59a2d5488","target":"record","created_at":"2026-05-18T00:37:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b1559c34adb7797300bfd911e51f702eff23c46c2106398453a9b75e5cf6997f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-20T03:53:04Z","title_canon_sha256":"4b6be68df718d4c783e3944270982dbd5b624370a119f41a2b7a4929d8d14d5e"},"schema_version":"1.0","source":{"id":"1708.05930","kind":"arxiv","version":1}},"canonical_sha256":"4e57b660c733b5a4851ab3c52defd440e79024ea060ed9ace876a23cbaea0817","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e57b660c733b5a4851ab3c52defd440e79024ea060ed9ace876a23cbaea0817","first_computed_at":"2026-05-18T00:37:43.760184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.760184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ODV4Qfeodx1ZdAJSSqeo2dZvnJ5R9jx7UWDZokRw9abQwsWX0OHx2IRVfg0SAB1OuMdlvnusDL2TcRUppHl5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.760934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a8395aa7929bb213595da00a9bbb8d8be2f4a1d805b7b37d4d354a59a2d5488","sha256:6b4ef5619fc33c6711dfa58eeef43ae91163d9aff3fb720708296020a4b67ebc"],"state_sha256":"2aedbc05dfa71c650aaa70e51fe9abc811845344e0f2f2f73d3d825aa0e36f10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jlv4Oc5mS3pz1EThBnIbvhauVRfWu6ahj/UbQhHM1EvfDPvey75EQYZjI++j06yRM1aSapFb4VUkDpxVWa/mAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:27:57.906828Z","bundle_sha256":"bc181663addd4af3a3b4d1689fa387f5184118004d7e31eb44e4f6645d33b08f"}}