{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2ITUX3EYFKCQ2LOTB7YTU2BKCT","short_pith_number":"pith:2ITUX3EY","schema_version":"1.0","canonical_sha256":"d2274bec982a850d2dd30ff13a682a14d8bb1a6a1ba2984435ca890585a178c8","source":{"kind":"arxiv","id":"2608.07309","version":1},"attestation_state":"computed","paper":{"title":"Improved Quantum Algorithms for Subset Sum and $k$-SUM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander S. Kulikov, Ivan Mihajlin, Maksim Levitskii, Nikolai Chukhin","submitted_at":"2026-08-07T15:04:27Z","abstract_excerpt":"The Subset Sum problem asks whether, given $n$ integers and a target, some subset of the integers sums to the target. Its best known worst-case running time is $O^*(2^{n/2})$ (Horowitz and Sahni, 1974), whereas the best quantum upper bound is $O^*(2^{n/3})$ (Bernstein, Jeffery, Lange, and Meurer, 2013). The $k$-SUM problem is a parameterized version of Subset Sum asking whether there are $k$ integers that sum to the target. The best classical upper bound for it is $\\widetilde O(n^{\\lceil k/2\\rceil})$, whereas the best quantum running time is $\\widetilde O(n^{k/3})$ (Tani, 2009). For random ins"},"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":"2608.07309","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-07T15:04:27Z","cross_cats_sorted":[],"title_canon_sha256":"582dde8b2952fe5df1262ff1a0990c77040ff15189d7125f75a62d9d8157658c","abstract_canon_sha256":"642d3055bd6d5b67ae093be56b7faa1b2616220f70a3f41e9f02f450445d4dc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:14:56.792281Z","signature_b64":"Xua3G0sFW5F7Xa9UkKzhCNRLW/uJoUrCBkCOCtBwKO8y2pO4mwoTaigP4i0CCwhaKDDIs2WnEJiX5nySaZaNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2274bec982a850d2dd30ff13a682a14d8bb1a6a1ba2984435ca890585a178c8","last_reissued_at":"2026-08-10T01:14:56.789334Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:14:56.789334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Algorithms for Subset Sum and $k$-SUM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander S. Kulikov, Ivan Mihajlin, Maksim Levitskii, Nikolai Chukhin","submitted_at":"2026-08-07T15:04:27Z","abstract_excerpt":"The Subset Sum problem asks whether, given $n$ integers and a target, some subset of the integers sums to the target. Its best known worst-case running time is $O^*(2^{n/2})$ (Horowitz and Sahni, 1974), whereas the best quantum upper bound is $O^*(2^{n/3})$ (Bernstein, Jeffery, Lange, and Meurer, 2013). The $k$-SUM problem is a parameterized version of Subset Sum asking whether there are $k$ integers that sum to the target. The best classical upper bound for it is $\\widetilde O(n^{\\lceil k/2\\rceil})$, whereas the best quantum running time is $\\widetilde O(n^{k/3})$ (Tani, 2009). For random ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07309","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.07309/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.07309","created_at":"2026-08-10T01:14:56.790882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07309v1","created_at":"2026-08-10T01:14:56.790882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07309","created_at":"2026-08-10T01:14:56.790882+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ITUX3EYFKCQ","created_at":"2026-08-10T01:14:56.790882+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ITUX3EYFKCQ2LOT","created_at":"2026-08-10T01:14:56.790882+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ITUX3EY","created_at":"2026-08-10T01:14:56.790882+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/2ITUX3EYFKCQ2LOTB7YTU2BKCT","json":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT.json","graph_json":"https://pith.science/api/pith-number/2ITUX3EYFKCQ2LOTB7YTU2BKCT/graph.json","events_json":"https://pith.science/api/pith-number/2ITUX3EYFKCQ2LOTB7YTU2BKCT/events.json","paper":"https://pith.science/paper/2ITUX3EY"},"agent_actions":{"view_html":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT","download_json":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT.json","view_paper":"https://pith.science/paper/2ITUX3EY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07309&json=true","fetch_graph":"https://pith.science/api/pith-number/2ITUX3EYFKCQ2LOTB7YTU2BKCT/graph.json","fetch_events":"https://pith.science/api/pith-number/2ITUX3EYFKCQ2LOTB7YTU2BKCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT/action/storage_attestation","attest_author":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT/action/author_attestation","sign_citation":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT/action/citation_signature","submit_replication":"https://pith.science/pith/2ITUX3EYFKCQ2LOTB7YTU2BKCT/action/replication_record"}},"created_at":"2026-08-10T01:14:56.790882+00:00","updated_at":"2026-08-10T01:14:56.790882+00:00"}