{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AQPVVETVCCSCMCKZNIKCA7UQQC","short_pith_number":"pith:AQPVVETV","schema_version":"1.0","canonical_sha256":"041f5a927510a42609596a14207e90808212db730d1555f40451231c6ce2b33d","source":{"kind":"arxiv","id":"1807.02611","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.02611","created_at":"2026-05-18T00:10:44.277557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02611v2","created_at":"2026-05-18T00:10:44.277557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02611","created_at":"2026-05-18T00:10:44.277557+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQPVVETVCCSC","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQPVVETVCCSCMCKZ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQPVVETV","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC","json":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC.json","graph_json":"https://pith.science/api/pith-number/AQPVVETVCCSCMCKZNIKCA7UQQC/graph.json","events_json":"https://pith.science/api/pith-number/AQPVVETVCCSCMCKZNIKCA7UQQC/events.json","paper":"https://pith.science/paper/AQPVVETV"},"agent_actions":{"view_html":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC","download_json":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC.json","view_paper":"https://pith.science/paper/AQPVVETV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02611&json=true","fetch_graph":"https://pith.science/api/pith-number/AQPVVETVCCSCMCKZNIKCA7UQQC/graph.json","fetch_events":"https://pith.science/api/pith-number/AQPVVETVCCSCMCKZNIKCA7UQQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/action/storage_attestation","attest_author":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/action/author_attestation","sign_citation":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/action/citation_signature","submit_replication":"https://pith.science/pith/AQPVVETVCCSCMCKZNIKCA7UQQC/action/replication_record"}},"created_at":"2026-05-18T00:10:44.277557+00:00","updated_at":"2026-05-18T00:10:44.277557+00:00"}