{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IIAN4OZU4K3APPJ4QRDDR5KCR7","short_pith_number":"pith:IIAN4OZU","schema_version":"1.0","canonical_sha256":"4200de3b34e2b607bd3c844638f5428fc6e0c0db2390929ff924550a789f2a1e","source":{"kind":"arxiv","id":"1508.06019","version":1},"attestation_state":"computed","paper":{"title":"Dense Subset Sum may be the hardest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof, Mikko Koivisto, Per Austrin, Petteri Kaski","submitted_at":"2015-08-25T03:14:53Z","abstract_excerpt":"The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by Horowitz and Sahni [J. ACM 1974] can be beaten in the worst-case setting by a \"truly faster\", $O^*(2^{(0.5-\\delta)n})$-time algorithm, with some constant $\\delta > 0$. Continuing an earlier work [STACS 2015], we study Subset Sum parameterized by the maximum bin size $\\beta$, defined as the largest number of subsets of the $n$ input integers that yield the same sum."},"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":"1508.06019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-25T03:14:53Z","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"title_canon_sha256":"43e8b52e8d84f66b7b2f586b3b53832659ef5f22360d4fa9a4dcec6e993bfb26","abstract_canon_sha256":"d4593ae2e9022aad27b170fd9b5a54c0d9cef4ac892ba53e945ec95d90bbf0ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:47.105029Z","signature_b64":"u5mv+Ao3U17FDzlktuCgfe6QHHzdVo63KdayT8BcDAi9+bdHxnEu9yD68BB02nLMsIZNjbKaCp9wJzGKe+AXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4200de3b34e2b607bd3c844638f5428fc6e0c0db2390929ff924550a789f2a1e","last_reissued_at":"2026-05-18T01:34:47.104358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:47.104358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense Subset Sum may be the hardest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Jesper Nederlof, Mikko Koivisto, Per Austrin, Petteri Kaski","submitted_at":"2015-08-25T03:14:53Z","abstract_excerpt":"The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by Horowitz and Sahni [J. ACM 1974] can be beaten in the worst-case setting by a \"truly faster\", $O^*(2^{(0.5-\\delta)n})$-time algorithm, with some constant $\\delta > 0$. Continuing an earlier work [STACS 2015], we study Subset Sum parameterized by the maximum bin size $\\beta$, defined as the largest number of subsets of the $n$ input integers that yield the same sum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.06019","created_at":"2026-05-18T01:34:47.104467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06019v1","created_at":"2026-05-18T01:34:47.104467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06019","created_at":"2026-05-18T01:34:47.104467+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIAN4OZU4K3A","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIAN4OZU4K3APPJ4","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIAN4OZU","created_at":"2026-05-18T12:29:25.134429+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/IIAN4OZU4K3APPJ4QRDDR5KCR7","json":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7.json","graph_json":"https://pith.science/api/pith-number/IIAN4OZU4K3APPJ4QRDDR5KCR7/graph.json","events_json":"https://pith.science/api/pith-number/IIAN4OZU4K3APPJ4QRDDR5KCR7/events.json","paper":"https://pith.science/paper/IIAN4OZU"},"agent_actions":{"view_html":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7","download_json":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7.json","view_paper":"https://pith.science/paper/IIAN4OZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06019&json=true","fetch_graph":"https://pith.science/api/pith-number/IIAN4OZU4K3APPJ4QRDDR5KCR7/graph.json","fetch_events":"https://pith.science/api/pith-number/IIAN4OZU4K3APPJ4QRDDR5KCR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7/action/storage_attestation","attest_author":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7/action/author_attestation","sign_citation":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7/action/citation_signature","submit_replication":"https://pith.science/pith/IIAN4OZU4K3APPJ4QRDDR5KCR7/action/replication_record"}},"created_at":"2026-05-18T01:34:47.104467+00:00","updated_at":"2026-05-18T01:34:47.104467+00:00"}