{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VBVPTRIFZEU27ELFR6RBA5FLGL","short_pith_number":"pith:VBVPTRIF","canonical_record":{"source":{"id":"1903.04966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-12T14:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"6e709df64688daa86b371739049c6cb3409ed70f40599ea0cf3c89a93db20e5a","abstract_canon_sha256":"255ee54171475cf14ed81c88eea57e128918cd2ec7ae143c27d1c7237ad3bbda"},"schema_version":"1.0"},"canonical_sha256":"a86af9c505c929af91658fa21074ab32eaacf4c337d5edc2dfe2c924089a02a2","source":{"kind":"arxiv","id":"1903.04966","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04966","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04966v2","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04966","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"VBVPTRIFZEU2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VBVPTRIFZEU27ELF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VBVPTRIF","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VBVPTRIFZEU27ELFR6RBA5FLGL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-12T14:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"6e709df64688daa86b371739049c6cb3409ed70f40599ea0cf3c89a93db20e5a","abstract_canon_sha256":"255ee54171475cf14ed81c88eea57e128918cd2ec7ae143c27d1c7237ad3bbda"},"schema_version":"1.0"},"canonical_sha256":"a86af9c505c929af91658fa21074ab32eaacf4c337d5edc2dfe2c924089a02a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:25.471662Z","signature_b64":"eD1cUXuGtaf8O2odZEACrZro4BVaVgL9hHcMObwpT1Biydi7XkW6dmmUdUrjIAfXiCvpXXq35FWxK/TYYwB4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86af9c505c929af91658fa21074ab32eaacf4c337d5edc2dfe2c924089a02a2","last_reissued_at":"2026-05-17T23:51:25.471180Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:25.471180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04966","source_version":2,"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QesiA6DrVicBvpzhYMGXK2yZnmMW/W4UN1reTyNW0kb+gD3wlojGJ+1BasEmhfGjunREORZYufddXT4/P0HbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:29:00.122783Z"},"content_sha256":"f58e61d9881875345944b9566cd43c0f0a35ef5a10ff44a83fc2dbcfda5f92d8","schema_version":"1.0","event_id":"sha256:f58e61d9881875345944b9566cd43c0f0a35ef5a10ff44a83fc2dbcfda5f92d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VBVPTRIFZEU27ELFR6RBA5FLGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterated two-phase local search for the Set-Union Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jin-Kao Hao, Zequn Wei","submitted_at":"2019-03-12T14:48:24Z","abstract_excerpt":"The Set-union Knapsack Problem (SUKP) is a generalization of the popular 0-1 knapsack problem. Given a set of weighted elements and a set of items with profits where each item is composed of a subset of elements, the SUKP involves packing a subset of items in a capacity-constrained knapsack such that the total profit of the selected items is maximized while their weights do not exceed the knapsack capacity. In this work, we present an effective iterated two-phase local search algorithm for this NP-hard combinatorial optimization problem. The proposed algorithm iterates through two search phase"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04966","kind":"arxiv","version":2},"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ctt2qSCvAI3h31xsYSgceLREknm7b2x79EAoS+fXQG+fnIkZEKOcApZyymF8GWZDtOtapPoVjanWh+WLQZWTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:29:00.123336Z"},"content_sha256":"b5c0de2e826e091ad10446411fd70b811b6f0b49c9d334b7c0e843cfe0e1d0f8","schema_version":"1.0","event_id":"sha256:b5c0de2e826e091ad10446411fd70b811b6f0b49c9d334b7c0e843cfe0e1d0f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBVPTRIFZEU27ELFR6RBA5FLGL/bundle.json","state_url":"https://pith.science/pith/VBVPTRIFZEU27ELFR6RBA5FLGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBVPTRIFZEU27ELFR6RBA5FLGL/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-02T00:29:00Z","links":{"resolver":"https://pith.science/pith/VBVPTRIFZEU27ELFR6RBA5FLGL","bundle":"https://pith.science/pith/VBVPTRIFZEU27ELFR6RBA5FLGL/bundle.json","state":"https://pith.science/pith/VBVPTRIFZEU27ELFR6RBA5FLGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBVPTRIFZEU27ELFR6RBA5FLGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VBVPTRIFZEU27ELFR6RBA5FLGL","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":"255ee54171475cf14ed81c88eea57e128918cd2ec7ae143c27d1c7237ad3bbda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-12T14:48:24Z","title_canon_sha256":"6e709df64688daa86b371739049c6cb3409ed70f40599ea0cf3c89a93db20e5a"},"schema_version":"1.0","source":{"id":"1903.04966","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04966","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04966v2","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04966","created_at":"2026-05-17T23:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"VBVPTRIFZEU2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VBVPTRIFZEU27ELF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VBVPTRIF","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:b5c0de2e826e091ad10446411fd70b811b6f0b49c9d334b7c0e843cfe0e1d0f8","target":"graph","created_at":"2026-05-17T23:51:25Z","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":"The Set-union Knapsack Problem (SUKP) is a generalization of the popular 0-1 knapsack problem. Given a set of weighted elements and a set of items with profits where each item is composed of a subset of elements, the SUKP involves packing a subset of items in a capacity-constrained knapsack such that the total profit of the selected items is maximized while their weights do not exceed the knapsack capacity. In this work, we present an effective iterated two-phase local search algorithm for this NP-hard combinatorial optimization problem. The proposed algorithm iterates through two search phase","authors_text":"Jin-Kao Hao, Zequn Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-12T14:48:24Z","title":"Iterated two-phase local search for the Set-Union Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04966","kind":"arxiv","version":2},"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:f58e61d9881875345944b9566cd43c0f0a35ef5a10ff44a83fc2dbcfda5f92d8","target":"record","created_at":"2026-05-17T23:51:25Z","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":"255ee54171475cf14ed81c88eea57e128918cd2ec7ae143c27d1c7237ad3bbda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-12T14:48:24Z","title_canon_sha256":"6e709df64688daa86b371739049c6cb3409ed70f40599ea0cf3c89a93db20e5a"},"schema_version":"1.0","source":{"id":"1903.04966","kind":"arxiv","version":2}},"canonical_sha256":"a86af9c505c929af91658fa21074ab32eaacf4c337d5edc2dfe2c924089a02a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a86af9c505c929af91658fa21074ab32eaacf4c337d5edc2dfe2c924089a02a2","first_computed_at":"2026-05-17T23:51:25.471180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:25.471180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eD1cUXuGtaf8O2odZEACrZro4BVaVgL9hHcMObwpT1Biydi7XkW6dmmUdUrjIAfXiCvpXXq35FWxK/TYYwB4BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:25.471662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04966","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f58e61d9881875345944b9566cd43c0f0a35ef5a10ff44a83fc2dbcfda5f92d8","sha256:b5c0de2e826e091ad10446411fd70b811b6f0b49c9d334b7c0e843cfe0e1d0f8"],"state_sha256":"e201cc3774f923c126fad99aa3e10aa5e72305edfb753584dae8c26753b0aee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFZ9J6JljOtgXRY+dmge4FPpIxwBrskFStBEIWpr8ySrmR6gI4zHFk9f9I29dQUS0YzmBeg/KuRLEZqTw0UyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:29:00.125565Z","bundle_sha256":"ff9af7b6e3f93d69f6813812c2b7c2f5099658149b048f835fcfb4c384d572cf"}}