{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JUACQYHVSXUJMN2P2MZIHCFJZN","short_pith_number":"pith:JUACQYHV","schema_version":"1.0","canonical_sha256":"4d002860f595e896374fd3328388a9cb71173b132caf546e59fbbd120b4872ce","source":{"kind":"arxiv","id":"2403.12420","version":1},"attestation_state":"computed","paper":{"title":"Bin Packing Optimization via Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Baoying Wang, Huixu Dong","submitted_at":"2024-03-19T04:07:45Z","abstract_excerpt":"The Bin Packing Problem (BPP) has attracted enthusiastic research interest recently, owing to widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be packed into boxes. Object packing order and placement strategy are the two crucial optimization objectives of the BPP. However, existing optimization methods for BPP, such as the genetic algorithm (GA), emerge as the main issues in highly computational cost and relatively low accuracy, making it difficult to implement in realistic scenarios. To well relieve "},"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":"2403.12420","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-19T04:07:45Z","cross_cats_sorted":[],"title_canon_sha256":"a386b852bf0c5abf7404916989fc355a4b184a74124612322d02944f52ac846d","abstract_canon_sha256":"e63151bdbc10c2f4bf0396c42e8f811f7196b9e6d38418049754d686f56fb484"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:01.222369Z","signature_b64":"vZNvpm/D9+/kh7kDtu8v3ZTSWaPlacrs4UMof9gK3AJL93iAN4lU96Ea5rpXmW3UlPJXJIlWt8jmSXGem4BJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d002860f595e896374fd3328388a9cb71173b132caf546e59fbbd120b4872ce","last_reissued_at":"2026-07-05T07:58:01.221847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:01.221847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bin Packing Optimization via Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Baoying Wang, Huixu Dong","submitted_at":"2024-03-19T04:07:45Z","abstract_excerpt":"The Bin Packing Problem (BPP) has attracted enthusiastic research interest recently, owing to widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be packed into boxes. Object packing order and placement strategy are the two crucial optimization objectives of the BPP. However, existing optimization methods for BPP, such as the genetic algorithm (GA), emerge as the main issues in highly computational cost and relatively low accuracy, making it difficult to implement in realistic scenarios. To well relieve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12420","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/2403.12420/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":"2403.12420","created_at":"2026-07-05T07:58:01.221910+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12420v1","created_at":"2026-07-05T07:58:01.221910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12420","created_at":"2026-07-05T07:58:01.221910+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUACQYHVSXUJ","created_at":"2026-07-05T07:58:01.221910+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUACQYHVSXUJMN2P","created_at":"2026-07-05T07:58:01.221910+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUACQYHV","created_at":"2026-07-05T07:58:01.221910+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12954","citing_title":"Towards Reliable Sequential Object Picking in Clutter: The Runner-up Solution to RGMC 2025","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN","json":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN.json","graph_json":"https://pith.science/api/pith-number/JUACQYHVSXUJMN2P2MZIHCFJZN/graph.json","events_json":"https://pith.science/api/pith-number/JUACQYHVSXUJMN2P2MZIHCFJZN/events.json","paper":"https://pith.science/paper/JUACQYHV"},"agent_actions":{"view_html":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN","download_json":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN.json","view_paper":"https://pith.science/paper/JUACQYHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12420&json=true","fetch_graph":"https://pith.science/api/pith-number/JUACQYHVSXUJMN2P2MZIHCFJZN/graph.json","fetch_events":"https://pith.science/api/pith-number/JUACQYHVSXUJMN2P2MZIHCFJZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN/action/storage_attestation","attest_author":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN/action/author_attestation","sign_citation":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN/action/citation_signature","submit_replication":"https://pith.science/pith/JUACQYHVSXUJMN2P2MZIHCFJZN/action/replication_record"}},"created_at":"2026-07-05T07:58:01.221910+00:00","updated_at":"2026-07-05T07:58:01.221910+00:00"}