{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KVWIDFUUKKYEJJJTFQTWWJXQKZ","short_pith_number":"pith:KVWIDFUU","canonical_record":{"source":{"id":"2202.12466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-02-25T02:38:24Z","cross_cats_sorted":[],"title_canon_sha256":"650f1a826714761e0c5a42d7b073ea53750d9b28fb079178f16d0fd9ce6a26db","abstract_canon_sha256":"8280243673acdf28d6f55369c34304e90e6357814fcfe6b32c2947baf08d21b2"},"schema_version":"1.0"},"canonical_sha256":"556c81969452b044a5332c276b26f0565c117f4e920e6c56eb025a790e4deaf4","source":{"kind":"arxiv","id":"2202.12466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.12466","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"2202.12466v1","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.12466","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"KVWIDFUUKKYE","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"pith_short_16","alias_value":"KVWIDFUUKKYEJJJT","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"pith_short_8","alias_value":"KVWIDFUU","created_at":"2026-07-05T03:59:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KVWIDFUUKKYEJJJTFQTWWJXQKZ","target":"record","payload":{"canonical_record":{"source":{"id":"2202.12466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-02-25T02:38:24Z","cross_cats_sorted":[],"title_canon_sha256":"650f1a826714761e0c5a42d7b073ea53750d9b28fb079178f16d0fd9ce6a26db","abstract_canon_sha256":"8280243673acdf28d6f55369c34304e90e6357814fcfe6b32c2947baf08d21b2"},"schema_version":"1.0"},"canonical_sha256":"556c81969452b044a5332c276b26f0565c117f4e920e6c56eb025a790e4deaf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:55.512271Z","signature_b64":"UlSBdF5TCBD97D7DLJdQXd67yMHd/AdXG/2rYe56vde7yvNYyUwvfJV/Hxz+ZnYhF30gfOQDp6jGxuhwuDZ2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556c81969452b044a5332c276b26f0565c117f4e920e6c56eb025a790e4deaf4","last_reissued_at":"2026-07-05T03:59:55.511847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:55.511847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.12466","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-07-05T03:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tbabpwi9or1bQGVbVOz9zGtL2pJwG+qwn1GQRz28nhe4rErOxbq1/QZ43dnav8miEfMbP4YQhZhKtx0cpfImBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:47:17.372868Z"},"content_sha256":"9f4ba02751267408359655ed91b9889fe32735837957a643825d543fa74b8d58","schema_version":"1.0","event_id":"sha256:9f4ba02751267408359655ed91b9889fe32735837957a643825d543fa74b8d58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KVWIDFUUKKYEJJJTFQTWWJXQKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fei Ni, Jiahui Duan, Lei Chen, Mingxuan Yuan, Xialiang Tong, Zhenan He","submitted_at":"2022-02-25T02:38:24Z","abstract_excerpt":"The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transportation cost. In this NP-hard combinatorial optimization problem, the position and quantity of each item in the box are strictly restricted by complex constraints and special customer requirements. Existing approaches are hard to obtain the optimal solution since rigorous constraints cannot be handled within a reasonable computation load. In this paper, for handling this difficulty, the packing knowledge is extracted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.12466","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/2202.12466/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"},"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-07-05T03:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nmo9S4LHh/urAr/cUeRt9qbT3JEUTCcJPMMe3r7Vr44IAWQYM0urBsdZY81OwPX6Mnz2WWDq2/8UtUCZrt9CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:47:17.373429Z"},"content_sha256":"1c88d59526a5c8333c803027b55cace899e0ee77da5b49142d4604ef3f43c6e4","schema_version":"1.0","event_id":"sha256:1c88d59526a5c8333c803027b55cace899e0ee77da5b49142d4604ef3f43c6e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ/bundle.json","state_url":"https://pith.science/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ/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-08-21T18:47:17Z","links":{"resolver":"https://pith.science/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ","bundle":"https://pith.science/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ/bundle.json","state":"https://pith.science/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVWIDFUUKKYEJJJTFQTWWJXQKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KVWIDFUUKKYEJJJTFQTWWJXQKZ","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":"8280243673acdf28d6f55369c34304e90e6357814fcfe6b32c2947baf08d21b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-02-25T02:38:24Z","title_canon_sha256":"650f1a826714761e0c5a42d7b073ea53750d9b28fb079178f16d0fd9ce6a26db"},"schema_version":"1.0","source":{"id":"2202.12466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.12466","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"2202.12466v1","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.12466","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"KVWIDFUUKKYE","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"pith_short_16","alias_value":"KVWIDFUUKKYEJJJT","created_at":"2026-07-05T03:59:55Z"},{"alias_kind":"pith_short_8","alias_value":"KVWIDFUU","created_at":"2026-07-05T03:59:55Z"}],"graph_snapshots":[{"event_id":"sha256:1c88d59526a5c8333c803027b55cace899e0ee77da5b49142d4604ef3f43c6e4","target":"graph","created_at":"2026-07-05T03:59:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.12466/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transportation cost. In this NP-hard combinatorial optimization problem, the position and quantity of each item in the box are strictly restricted by complex constraints and special customer requirements. Existing approaches are hard to obtain the optimal solution since rigorous constraints cannot be handled within a reasonable computation load. In this paper, for handling this difficulty, the packing knowledge is extracted ","authors_text":"Fei Ni, Jiahui Duan, Lei Chen, Mingxuan Yuan, Xialiang Tong, Zhenan He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-02-25T02:38:24Z","title":"A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.12466","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:9f4ba02751267408359655ed91b9889fe32735837957a643825d543fa74b8d58","target":"record","created_at":"2026-07-05T03:59:55Z","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":"8280243673acdf28d6f55369c34304e90e6357814fcfe6b32c2947baf08d21b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-02-25T02:38:24Z","title_canon_sha256":"650f1a826714761e0c5a42d7b073ea53750d9b28fb079178f16d0fd9ce6a26db"},"schema_version":"1.0","source":{"id":"2202.12466","kind":"arxiv","version":1}},"canonical_sha256":"556c81969452b044a5332c276b26f0565c117f4e920e6c56eb025a790e4deaf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"556c81969452b044a5332c276b26f0565c117f4e920e6c56eb025a790e4deaf4","first_computed_at":"2026-07-05T03:59:55.511847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:59:55.511847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlSBdF5TCBD97D7DLJdQXd67yMHd/AdXG/2rYe56vde7yvNYyUwvfJV/Hxz+ZnYhF30gfOQDp6jGxuhwuDZ2BA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:59:55.512271Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.12466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f4ba02751267408359655ed91b9889fe32735837957a643825d543fa74b8d58","sha256:1c88d59526a5c8333c803027b55cace899e0ee77da5b49142d4604ef3f43c6e4"],"state_sha256":"e66ef4460d9612456961250628fa659cd9cf47d2194ca5b2626e9cd4a5fe3b61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8J/vv04VPqO3B/APCN/4BXAjzZDuc39rZTYtfDl3DcYnKD6sXcIb/0KnIuB7ULoCYRcM/VKSYKLRVPwPNWuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:47:17.378206Z","bundle_sha256":"addede9c7e72ebac55469f259552e9e1df804fb2993271ae3ce9431e4bd208ab"}}