{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AQPVVETVCCSCMCKZNIKCA7UQQC","short_pith_number":"pith:AQPVVETV","canonical_record":{"source":{"id":"1807.02611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-07T04:40:32Z","cross_cats_sorted":[],"title_canon_sha256":"0c757af94e229ddf4e66f13feca3f9ecd654c52ff7d7f4d668c23655fe1537d1","abstract_canon_sha256":"a5f73ce560cfe0b4b84cb02386d5f578fae03fd569ef468d62c5c6a7ac1e746a"},"schema_version":"1.0"},"canonical_sha256":"041f5a927510a42609596a14207e90808212db730d1555f40451231c6ce2b33d","source":{"kind":"arxiv","id":"1807.02611","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02611","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02611v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02611","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"AQPVVETVCCSC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQPVVETVCCSCMCKZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQPVVETV","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AQPVVETVCCSCMCKZNIKCA7UQQC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-07T04:40:32Z","cross_cats_sorted":[],"title_canon_sha256":"0c757af94e229ddf4e66f13feca3f9ecd654c52ff7d7f4d668c23655fe1537d1","abstract_canon_sha256":"a5f73ce560cfe0b4b84cb02386d5f578fae03fd569ef468d62c5c6a7ac1e746a"},"schema_version":"1.0"},"canonical_sha256":"041f5a927510a42609596a14207e90808212db730d1555f40451231c6ce2b33d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.278063Z","signature_b64":"oEIwKSfOBjbDucMtFW2SURKbXUJLt8+jlIX7ggwPswztN0OMQpjV8g+cfrdcTY7RLUSkEWquaewNxHO2Rd/WCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"041f5a927510a42609596a14207e90808212db730d1555f40451231c6ce2b33d","last_reissued_at":"2026-05-18T00:10:44.277459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.277459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02611","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cp6C29hHbODzUUiNBnbecoB8grma0bwKRAMl/X7GvZRyF0Vr+FFR9bNuKHDXtH6EMY/qZxG+ezW6bxA9+jzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:59:48.569121Z"},"content_sha256":"5ea24c491615e1050b210841f4f75617cdd1e0bf3a351979a4af3b630737afcb","schema_version":"1.0","event_id":"sha256:5ea24c491615e1050b210841f4f75617cdd1e0bf3a351979a4af3b630737afcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AQPVVETVCCSCMCKZNIKCA7UQQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms for Subset Sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lihua Liu, Zhengjun Cao","submitted_at":"2018-07-07T04:40:32Z","abstract_excerpt":"Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search, divide-and-conquer method, and Bellman's dynamic programming method. However, none of them could generate universal and light code. In this paper, we present a new deterministic algorithm based on a novel data arrangement, which could generate such code and return all solutions. If n is small enough, it is efficient for usual purpose. We also present a probabilistic versi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02611","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfloYKcoqREgdm88NyO/dQrVYPVOpY/pBWA2tOJWiblFkszNcPRWwnO/Ek3jCDeizm181StD9WXaRGj40kseDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:59:48.569489Z"},"content_sha256":"9548340222a0d57853e74bd21b6fe113c035634cb5c0d2616d971326481c50c3","schema_version":"1.0","event_id":"sha256:9548340222a0d57853e74bd21b6fe113c035634cb5c0d2616d971326481c50c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/bundle.json","state_url":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/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-02T22:59:48Z","links":{"resolver":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC","bundle":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/bundle.json","state":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AQPVVETVCCSCMCKZNIKCA7UQQC","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":"a5f73ce560cfe0b4b84cb02386d5f578fae03fd569ef468d62c5c6a7ac1e746a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-07T04:40:32Z","title_canon_sha256":"0c757af94e229ddf4e66f13feca3f9ecd654c52ff7d7f4d668c23655fe1537d1"},"schema_version":"1.0","source":{"id":"1807.02611","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02611","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02611v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02611","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"AQPVVETVCCSC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQPVVETVCCSCMCKZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQPVVETV","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:9548340222a0d57853e74bd21b6fe113c035634cb5c0d2616d971326481c50c3","target":"graph","created_at":"2026-05-18T00:10:44Z","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":"Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search, divide-and-conquer method, and Bellman's dynamic programming method. However, none of them could generate universal and light code. In this paper, we present a new deterministic algorithm based on a novel data arrangement, which could generate such code and return all solutions. If n is small enough, it is efficient for usual purpose. We also present a probabilistic versi","authors_text":"Lihua Liu, Zhengjun Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-07T04:40:32Z","title":"New Algorithms for Subset Sum Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02611","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:5ea24c491615e1050b210841f4f75617cdd1e0bf3a351979a4af3b630737afcb","target":"record","created_at":"2026-05-18T00:10:44Z","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":"a5f73ce560cfe0b4b84cb02386d5f578fae03fd569ef468d62c5c6a7ac1e746a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-07T04:40:32Z","title_canon_sha256":"0c757af94e229ddf4e66f13feca3f9ecd654c52ff7d7f4d668c23655fe1537d1"},"schema_version":"1.0","source":{"id":"1807.02611","kind":"arxiv","version":2}},"canonical_sha256":"041f5a927510a42609596a14207e90808212db730d1555f40451231c6ce2b33d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"041f5a927510a42609596a14207e90808212db730d1555f40451231c6ce2b33d","first_computed_at":"2026-05-18T00:10:44.277459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.277459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oEIwKSfOBjbDucMtFW2SURKbXUJLt8+jlIX7ggwPswztN0OMQpjV8g+cfrdcTY7RLUSkEWquaewNxHO2Rd/WCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.278063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02611","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ea24c491615e1050b210841f4f75617cdd1e0bf3a351979a4af3b630737afcb","sha256:9548340222a0d57853e74bd21b6fe113c035634cb5c0d2616d971326481c50c3"],"state_sha256":"df620becd04141ca438b74815c1d37d09c76526ff92c95bb2b189de17e191ea1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FI5NbqcfLrLeBK8lTrf54W5MG1Su/h+HyVZhQe4zVmg552JkNvV9IOicvKa8wKUvjfFcfJIsHfBRTsOv+c4xBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:59:48.571438Z","bundle_sha256":"7dae5c6cb261af055054cda6eebbec3d885c7abd713fd1ba28ecdb73d95aa18f"}}