{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TCJCCDJC2IL36IMV6AJHNWWNY4","short_pith_number":"pith:TCJCCDJC","schema_version":"1.0","canonical_sha256":"9892210d22d217bf2195f01276dacdc710f5224d76e6edc591d7b32e0ee0918b","source":{"kind":"arxiv","id":"1707.08730","version":4},"attestation_state":"computed","paper":{"title":"A Quantum Approach to Subset-Sum and Similar Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Ammar Daskin","submitted_at":"2017-07-27T07:33:05Z","abstract_excerpt":"In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games. Under described certain assumptions, we show that the exact solution of the subset sum problem my be obtained in polynomial time and the exponential speed-up over the classical algorithms may be possible. We give a numerical example and discuss the complexity of the approach and its further application to the knapsack problem."},"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":"1707.08730","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-27T07:33:05Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"c67de1b0d1450b8a92c1194b10e49eab0e2262426dde58f926e1d9c170c2279d","abstract_canon_sha256":"ff582303d17bb70369ce1f3a74b8bcc90769205fc97f1b4ba44863d364cb628c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:34.808604Z","signature_b64":"V6AFu1ytcPsWPkXIjcZb5jxtajqTW90QyUqQBoSUO6jz0ZyfwKo66YM5KPvf268qmvbIUI7ZQl1Jo41IBNg+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9892210d22d217bf2195f01276dacdc710f5224d76e6edc591d7b32e0ee0918b","last_reissued_at":"2026-05-18T00:34:34.808132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:34.808132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Approach to Subset-Sum and Similar Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Ammar Daskin","submitted_at":"2017-07-27T07:33:05Z","abstract_excerpt":"In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games. Under described certain assumptions, we show that the exact solution of the subset sum problem my be obtained in polynomial time and the exponential speed-up over the classical algorithms may be possible. We give a numerical example and discuss the complexity of the approach and its further application to the knapsack problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08730","kind":"arxiv","version":4},"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":"1707.08730","created_at":"2026-05-18T00:34:34.808200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08730v4","created_at":"2026-05-18T00:34:34.808200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08730","created_at":"2026-05-18T00:34:34.808200+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCJCCDJC2IL3","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCJCCDJC2IL36IMV","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCJCCDJC","created_at":"2026-05-18T12:31:46.661854+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/TCJCCDJC2IL36IMV6AJHNWWNY4","json":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4.json","graph_json":"https://pith.science/api/pith-number/TCJCCDJC2IL36IMV6AJHNWWNY4/graph.json","events_json":"https://pith.science/api/pith-number/TCJCCDJC2IL36IMV6AJHNWWNY4/events.json","paper":"https://pith.science/paper/TCJCCDJC"},"agent_actions":{"view_html":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4","download_json":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4.json","view_paper":"https://pith.science/paper/TCJCCDJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08730&json=true","fetch_graph":"https://pith.science/api/pith-number/TCJCCDJC2IL36IMV6AJHNWWNY4/graph.json","fetch_events":"https://pith.science/api/pith-number/TCJCCDJC2IL36IMV6AJHNWWNY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4/action/storage_attestation","attest_author":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4/action/author_attestation","sign_citation":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4/action/citation_signature","submit_replication":"https://pith.science/pith/TCJCCDJC2IL36IMV6AJHNWWNY4/action/replication_record"}},"created_at":"2026-05-18T00:34:34.808200+00:00","updated_at":"2026-05-18T00:34:34.808200+00:00"}