{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QKQQHJINMJ6GOTDYTVPSFFJ7LO","short_pith_number":"pith:QKQQHJIN","schema_version":"1.0","canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","source":{"kind":"arxiv","id":"1507.02318","version":3},"attestation_state":"computed","paper":{"title":"A Faster Pseudopolynomial Time Algorithm for Subset Sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Xu, Konstantinos Koiliaris","submitted_at":"2015-07-08T21:38:20Z","abstract_excerpt":"Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable subset sums up to an integer $u$ in $\\widetilde{O}\\!\\left(\\min\\{\\sqrt{n}u,u^{4/3},\\sigma\\}\\right)$, where $\\sigma$ is the sum of all elements in $S$ and $\\widetilde{O}$ hides polylogarithmic factors. This result improves upon the standard dynamic programming algorithm that runs in $O(nu)$ time. To the best of our knowledge, the new algorithm is the fastest gener"},"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":"1507.02318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"27f633e74883a0e10d66596b43788ae4e7638f4e99481f67574c0c15d96bfe6c","abstract_canon_sha256":"30ce6d463f7652dabc618cd15a573cdeb1c07cc56f2ba60a01fd22d2927244b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.723845Z","signature_b64":"Nc44OVCdwRUG23vccUCVN1KulNkwmk9nfnHOKbkQJIhHaLYLnFAiasEbCLsG5M1gF9sZ9yYHlRt2h80k3rkLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","last_reissued_at":"2026-05-18T00:55:25.723245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.723245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Pseudopolynomial Time Algorithm for Subset Sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Xu, Konstantinos Koiliaris","submitted_at":"2015-07-08T21:38:20Z","abstract_excerpt":"Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable subset sums up to an integer $u$ in $\\widetilde{O}\\!\\left(\\min\\{\\sqrt{n}u,u^{4/3},\\sigma\\}\\right)$, where $\\sigma$ is the sum of all elements in $S$ and $\\widetilde{O}$ hides polylogarithmic factors. This result improves upon the standard dynamic programming algorithm that runs in $O(nu)$ time. To the best of our knowledge, the new algorithm is the fastest gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02318","kind":"arxiv","version":3},"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":"1507.02318","created_at":"2026-05-18T00:55:25.723365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02318v3","created_at":"2026-05-18T00:55:25.723365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02318","created_at":"2026-05-18T00:55:25.723365+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKQQHJINMJ6G","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKQQHJINMJ6GOTDY","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKQQHJIN","created_at":"2026-05-18T12:29:37.295048+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/QKQQHJINMJ6GOTDYTVPSFFJ7LO","json":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO.json","graph_json":"https://pith.science/api/pith-number/QKQQHJINMJ6GOTDYTVPSFFJ7LO/graph.json","events_json":"https://pith.science/api/pith-number/QKQQHJINMJ6GOTDYTVPSFFJ7LO/events.json","paper":"https://pith.science/paper/QKQQHJIN"},"agent_actions":{"view_html":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO","download_json":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO.json","view_paper":"https://pith.science/paper/QKQQHJIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02318&json=true","fetch_graph":"https://pith.science/api/pith-number/QKQQHJINMJ6GOTDYTVPSFFJ7LO/graph.json","fetch_events":"https://pith.science/api/pith-number/QKQQHJINMJ6GOTDYTVPSFFJ7LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/action/storage_attestation","attest_author":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/action/author_attestation","sign_citation":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/action/citation_signature","submit_replication":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/action/replication_record"}},"created_at":"2026-05-18T00:55:25.723365+00:00","updated_at":"2026-05-18T00:55:25.723365+00:00"}