{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IIAN4OZU4K3APPJ4QRDDR5KCR7","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":"d4593ae2e9022aad27b170fd9b5a54c0d9cef4ac892ba53e945ec95d90bbf0ef","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-25T03:14:53Z","title_canon_sha256":"43e8b52e8d84f66b7b2f586b3b53832659ef5f22360d4fa9a4dcec6e993bfb26"},"schema_version":"1.0","source":{"id":"1508.06019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06019","created_at":"2026-05-18T01:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06019v1","created_at":"2026-05-18T01:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06019","created_at":"2026-05-18T01:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"IIAN4OZU4K3A","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IIAN4OZU4K3APPJ4","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IIAN4OZU","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:98ff2a0105b731c5b2ccfe95e0749c402d8ba840d1fafd1a2a6aec9824066720","target":"graph","created_at":"2026-05-18T01:34:47Z","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 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.","authors_text":"Jesper Nederlof, Mikko Koivisto, Per Austrin, Petteri Kaski","cross_cats":["cs.CC","cs.DM","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-25T03:14:53Z","title":"Dense Subset Sum may be the hardest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06019","kind":"arxiv","version":1},"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:15ad5634f1914f31381568842431eacb0e80f61e86a5c170087b5414096e92ae","target":"record","created_at":"2026-05-18T01:34:47Z","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":"d4593ae2e9022aad27b170fd9b5a54c0d9cef4ac892ba53e945ec95d90bbf0ef","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-25T03:14:53Z","title_canon_sha256":"43e8b52e8d84f66b7b2f586b3b53832659ef5f22360d4fa9a4dcec6e993bfb26"},"schema_version":"1.0","source":{"id":"1508.06019","kind":"arxiv","version":1}},"canonical_sha256":"4200de3b34e2b607bd3c844638f5428fc6e0c0db2390929ff924550a789f2a1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4200de3b34e2b607bd3c844638f5428fc6e0c0db2390929ff924550a789f2a1e","first_computed_at":"2026-05-18T01:34:47.104358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:47.104358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5mv+Ao3U17FDzlktuCgfe6QHHzdVo63KdayT8BcDAi9+bdHxnEu9yD68BB02nLMsIZNjbKaCp9wJzGKe+AXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:47.105029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15ad5634f1914f31381568842431eacb0e80f61e86a5c170087b5414096e92ae","sha256:98ff2a0105b731c5b2ccfe95e0749c402d8ba840d1fafd1a2a6aec9824066720"],"state_sha256":"aeab2262307c87f069aceeaf35e2759806c6b6f5ccf82b04d084f72e5dd105fc"}