{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VHKELX4DHPZNQSZ6W3UQ7Z2JGM","short_pith_number":"pith:VHKELX4D","canonical_record":{"source":{"id":"1906.05929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T10:56:18Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"ffb86ca0b5376aa0904321b33b63747f950ccba0ec0189330aa04ea8c57042e5","abstract_canon_sha256":"44eb0c56cd2abe7bb4aece74020dbf7a75763b0d9ed1abb1a9bd66e5cc31485a"},"schema_version":"1.0"},"canonical_sha256":"a9d445df833bf2d84b3eb6e90fe7493310d2e185aa9f7f0a5042c992b7f27332","source":{"kind":"arxiv","id":"1906.05929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05929","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05929v1","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05929","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"VHKELX4DHPZN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VHKELX4DHPZNQSZ6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VHKELX4D","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VHKELX4DHPZNQSZ6W3UQ7Z2JGM","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T10:56:18Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"ffb86ca0b5376aa0904321b33b63747f950ccba0ec0189330aa04ea8c57042e5","abstract_canon_sha256":"44eb0c56cd2abe7bb4aece74020dbf7a75763b0d9ed1abb1a9bd66e5cc31485a"},"schema_version":"1.0"},"canonical_sha256":"a9d445df833bf2d84b3eb6e90fe7493310d2e185aa9f7f0a5042c992b7f27332","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:20.295994Z","signature_b64":"mRoc/bpPSXNG8D4JrSBiqStmg73eHXEA+wwHq1iY9SiQ6bxwUINs+uAbvQ8Gamc1L4FUebOu/jk/X6C3inMIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d445df833bf2d84b3eb6e90fe7493310d2e185aa9f7f0a5042c992b7f27332","last_reissued_at":"2026-05-17T23:43:20.295346Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:20.295346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05929","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-17T23:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeVUGBRVW6h+1+BaaDqzF5oLlyah3ZUIKIwQB24cipV13SiaevoBCtEyHmslnPzNpcUBN2ZvL2Wusbzsvn35BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:56:20.885407Z"},"content_sha256":"315833761e91271987174c4c2b2c6c52b60208a105530a61c4c09b1643cec315","schema_version":"1.0","event_id":"sha256:315833761e91271987174c4c2b2c6c52b60208a105530a61c4c09b1643cec315"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VHKELX4DHPZNQSZ6W3UQ7Z2JGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Large-Scale 0-1 Knapsack Problems and its Application to Point Cloud Resampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Seyedmazloom, Chen Feng, Dongeun Lee, Duanshun Li, Giridhar Ramachandran, Jing Liu, Kookjin Lee, Noseong Park, Rajesh Ganesan, Vadim Sokolov","submitted_at":"2019-06-11T10:56:18Z","abstract_excerpt":"0-1 knapsack is of fundamental importance in computer science, business, operations research, etc. In this paper, we present a deep learning technique-based method to solve large-scale 0-1 knapsack problems where the number of products (items) is large and/or the values of products are not necessarily predetermined but decided by an external value assignment function during the optimization process. Our solution is greatly inspired by the method of Lagrange multiplier and some recent adoptions of game theory to deep learning. After formally defining our proposed method based on them, we develo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05929","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-17T23:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9Z/F6lLcmMSS6n9owljilEufO5nKdvlIrxnMmA+FAezZiYBgQY+wPxy7513T7MdCifbMP82JV+oaZS0o1hYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:56:20.885766Z"},"content_sha256":"288737ead76efcc5ef6ef7b6d9857f7b9d11cb8a003cc943f9a3c5d3b7b3397b","schema_version":"1.0","event_id":"sha256:288737ead76efcc5ef6ef7b6d9857f7b9d11cb8a003cc943f9a3c5d3b7b3397b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM/bundle.json","state_url":"https://pith.science/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM/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-27T07:56:20Z","links":{"resolver":"https://pith.science/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM","bundle":"https://pith.science/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM/bundle.json","state":"https://pith.science/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHKELX4DHPZNQSZ6W3UQ7Z2JGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VHKELX4DHPZNQSZ6W3UQ7Z2JGM","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":"44eb0c56cd2abe7bb4aece74020dbf7a75763b0d9ed1abb1a9bd66e5cc31485a","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T10:56:18Z","title_canon_sha256":"ffb86ca0b5376aa0904321b33b63747f950ccba0ec0189330aa04ea8c57042e5"},"schema_version":"1.0","source":{"id":"1906.05929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05929","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05929v1","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05929","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"VHKELX4DHPZN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VHKELX4DHPZNQSZ6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VHKELX4D","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:288737ead76efcc5ef6ef7b6d9857f7b9d11cb8a003cc943f9a3c5d3b7b3397b","target":"graph","created_at":"2026-05-17T23:43:20Z","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":"0-1 knapsack is of fundamental importance in computer science, business, operations research, etc. In this paper, we present a deep learning technique-based method to solve large-scale 0-1 knapsack problems where the number of products (items) is large and/or the values of products are not necessarily predetermined but decided by an external value assignment function during the optimization process. Our solution is greatly inspired by the method of Lagrange multiplier and some recent adoptions of game theory to deep learning. After formally defining our proposed method based on them, we develo","authors_text":"Ali Seyedmazloom, Chen Feng, Dongeun Lee, Duanshun Li, Giridhar Ramachandran, Jing Liu, Kookjin Lee, Noseong Park, Rajesh Ganesan, Vadim Sokolov","cross_cats":["cs.CV","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T10:56:18Z","title":"Solving Large-Scale 0-1 Knapsack Problems and its Application to Point Cloud Resampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05929","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:315833761e91271987174c4c2b2c6c52b60208a105530a61c4c09b1643cec315","target":"record","created_at":"2026-05-17T23:43:20Z","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":"44eb0c56cd2abe7bb4aece74020dbf7a75763b0d9ed1abb1a9bd66e5cc31485a","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T10:56:18Z","title_canon_sha256":"ffb86ca0b5376aa0904321b33b63747f950ccba0ec0189330aa04ea8c57042e5"},"schema_version":"1.0","source":{"id":"1906.05929","kind":"arxiv","version":1}},"canonical_sha256":"a9d445df833bf2d84b3eb6e90fe7493310d2e185aa9f7f0a5042c992b7f27332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9d445df833bf2d84b3eb6e90fe7493310d2e185aa9f7f0a5042c992b7f27332","first_computed_at":"2026-05-17T23:43:20.295346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:20.295346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mRoc/bpPSXNG8D4JrSBiqStmg73eHXEA+wwHq1iY9SiQ6bxwUINs+uAbvQ8Gamc1L4FUebOu/jk/X6C3inMIBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:20.295994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:315833761e91271987174c4c2b2c6c52b60208a105530a61c4c09b1643cec315","sha256:288737ead76efcc5ef6ef7b6d9857f7b9d11cb8a003cc943f9a3c5d3b7b3397b"],"state_sha256":"77121b24e22877533db5ec41a674345b05a781325c8ee7a18515bf7fd0a960a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvk5glaLYbktgDgw3vZ5/9amySnVGFMvyqIFuZvsQIiwJdz1P7b4i7IGX22o1RySyllyCFJqhnT88q0UtPeKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T07:56:20.887579Z","bundle_sha256":"e752e8ae652f7b5843345ceec709e74efd5ccfd8b158d51e5418e31bc8a48ad1"}}