{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JCY67IVQIQOSOJ5STSHTMZUZDK","short_pith_number":"pith:JCY67IVQ","schema_version":"1.0","canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","source":{"kind":"arxiv","id":"1503.06395","version":1},"attestation_state":"computed","paper":{"title":"Quantum search algorithm tailored to clause satisfaction problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2015-03-22T07:03:03Z","abstract_excerpt":"Many important computer science problems can be reduced to clause satisfaction problem. We are given $n$ Boolean variables $x_{k}$ and $m$ clauses $c_{j}$ where each clause is a function of values of some of the variables. We want to find an assignment $i$ of variables for which all $m$ clauses are satisfied. Let $f_{j}(i)$ be a binary function which is $1$ if $j^{\\rm th}$ clause is satisfied by the assignment $i$ else $f_{j}(i) = 0$. Then the solution is $r$ for which $f(i=r) = 1$, where $f(i)$ is the AND function of all $f_{j}(i)$. In quantum computing, Grover`s algorithm can be used to find"},"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":"1503.06395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-22T07:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"5415b8285a7ab66d0dfd8b429675979fdb804e2e4505f4fc20f064d50d69cb7b","abstract_canon_sha256":"b6ff0d9b9c2954d1c57c40533fb92e6c4d27ffb784792020d452846666ddca94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:01.163705Z","signature_b64":"SalNF+lnigOuw/u7LTnwM73sZfwbfUfdb7bKy16T36W9CEwZZBdpuKaN5gTDNw3XoYcOcLVOB30tov5iyNMPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b1efa2b0441d2727b29c8f3666991a87ff35b5786df67922fdda218d776257","last_reissued_at":"2026-05-18T01:55:01.163029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:01.163029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum search algorithm tailored to clause satisfaction problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2015-03-22T07:03:03Z","abstract_excerpt":"Many important computer science problems can be reduced to clause satisfaction problem. We are given $n$ Boolean variables $x_{k}$ and $m$ clauses $c_{j}$ where each clause is a function of values of some of the variables. We want to find an assignment $i$ of variables for which all $m$ clauses are satisfied. Let $f_{j}(i)$ be a binary function which is $1$ if $j^{\\rm th}$ clause is satisfied by the assignment $i$ else $f_{j}(i) = 0$. Then the solution is $r$ for which $f(i=r) = 1$, where $f(i)$ is the AND function of all $f_{j}(i)$. In quantum computing, Grover`s algorithm can be used to find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06395","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":"1503.06395","created_at":"2026-05-18T01:55:01.163113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06395v1","created_at":"2026-05-18T01:55:01.163113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06395","created_at":"2026-05-18T01:55:01.163113+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCY67IVQIQOS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCY67IVQIQOSOJ5S","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCY67IVQ","created_at":"2026-05-18T12:29:27.538025+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/JCY67IVQIQOSOJ5STSHTMZUZDK","json":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK.json","graph_json":"https://pith.science/api/pith-number/JCY67IVQIQOSOJ5STSHTMZUZDK/graph.json","events_json":"https://pith.science/api/pith-number/JCY67IVQIQOSOJ5STSHTMZUZDK/events.json","paper":"https://pith.science/paper/JCY67IVQ"},"agent_actions":{"view_html":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK","download_json":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK.json","view_paper":"https://pith.science/paper/JCY67IVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06395&json=true","fetch_graph":"https://pith.science/api/pith-number/JCY67IVQIQOSOJ5STSHTMZUZDK/graph.json","fetch_events":"https://pith.science/api/pith-number/JCY67IVQIQOSOJ5STSHTMZUZDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/action/storage_attestation","attest_author":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/action/author_attestation","sign_citation":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/action/citation_signature","submit_replication":"https://pith.science/pith/JCY67IVQIQOSOJ5STSHTMZUZDK/action/replication_record"}},"created_at":"2026-05-18T01:55:01.163113+00:00","updated_at":"2026-05-18T01:55:01.163113+00:00"}