{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2ITUX3EYFKCQ2LOTB7YTU2BKCT","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":"642d3055bd6d5b67ae093be56b7faa1b2616220f70a3f41e9f02f450445d4dc7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-07T15:04:27Z","title_canon_sha256":"582dde8b2952fe5df1262ff1a0990c77040ff15189d7125f75a62d9d8157658c"},"schema_version":"1.0","source":{"id":"2608.07309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07309","created_at":"2026-08-10T01:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07309v1","created_at":"2026-08-10T01:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07309","created_at":"2026-08-10T01:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"2ITUX3EYFKCQ","created_at":"2026-08-10T01:14:56Z"},{"alias_kind":"pith_short_16","alias_value":"2ITUX3EYFKCQ2LOT","created_at":"2026-08-10T01:14:56Z"},{"alias_kind":"pith_short_8","alias_value":"2ITUX3EY","created_at":"2026-08-10T01:14:56Z"}],"graph_snapshots":[{"event_id":"sha256:90784124cfc14556c1f7429375ebbb22d9e2e1f19b7736fabaadac9ca8490e4b","target":"graph","created_at":"2026-08-10T01:14:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.07309/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander S. Kulikov, Ivan Mihajlin, Maksim Levitskii, Nikolai Chukhin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-07T15:04:27Z","title":"Improved Quantum Algorithms for Subset Sum and $k$-SUM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07309","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:df93a4a6fbf88fe74d40b76683448c01d14bb61dfe724e5043a2fae065eef86e","target":"record","created_at":"2026-08-10T01:14:56Z","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":"642d3055bd6d5b67ae093be56b7faa1b2616220f70a3f41e9f02f450445d4dc7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-07T15:04:27Z","title_canon_sha256":"582dde8b2952fe5df1262ff1a0990c77040ff15189d7125f75a62d9d8157658c"},"schema_version":"1.0","source":{"id":"2608.07309","kind":"arxiv","version":1}},"canonical_sha256":"d2274bec982a850d2dd30ff13a682a14d8bb1a6a1ba2984435ca890585a178c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2274bec982a850d2dd30ff13a682a14d8bb1a6a1ba2984435ca890585a178c8","first_computed_at":"2026-08-10T01:14:56.789334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:14:56.789334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xua3G0sFW5F7Xa9UkKzhCNRLW/uJoUrCBkCOCtBwKO8y2pO4mwoTaigP4i0CCwhaKDDIs2WnEJiX5nySaZaNAg==","signature_status":"signed_v1","signed_at":"2026-08-10T01:14:56.792281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df93a4a6fbf88fe74d40b76683448c01d14bb61dfe724e5043a2fae065eef86e","sha256:90784124cfc14556c1f7429375ebbb22d9e2e1f19b7736fabaadac9ca8490e4b"],"state_sha256":"ab5fcf83f59ae9b025d7c6653f4fc6531d6647b09c2b925a24a253b15a8aba63"}