{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:KW2DB76J6MRYBC5SB447KFLS35","short_pith_number":"pith:KW2DB76J","schema_version":"1.0","canonical_sha256":"55b430ffc9f323808bb20f39f51572df786c928e3b9f764dace5605058951f8c","source":{"kind":"arxiv","id":"quant-ph/0411194","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithm to Solve Satisfiability Problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Wenjin Mao","submitted_at":"2004-11-29T14:45:18Z","abstract_excerpt":"A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit Exact Cover problems. The time cost of this algorithm on general SAT problems is discussed."},"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":"quant-ph/0411194","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-29T14:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"a444b9733f5b4da0497d1192e86668a8ce3edf1064cb3f340e6d435aa5edecec","abstract_canon_sha256":"5e8f68f5f58a109f1f543fd6caec5b50c8961f11bfcf767fc14f215bc0d33a8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:58.168440Z","signature_b64":"iRHZs/3y3jkES/rGjJ06Oymn88qEVad0w6AU/JgZsx2QCcVysBXOncNRDbA2oktOVmgN08d9ZuLkeGdHMX8cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b430ffc9f323808bb20f39f51572df786c928e3b9f764dace5605058951f8c","last_reissued_at":"2026-05-18T01:37:58.167821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:58.167821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm to Solve Satisfiability Problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Wenjin Mao","submitted_at":"2004-11-29T14:45:18Z","abstract_excerpt":"A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit Exact Cover problems. The time cost of this algorithm on general SAT problems is discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0411194","kind":"arxiv","version":2},"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":"quant-ph/0411194","created_at":"2026-05-18T01:37:58.167917+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0411194v2","created_at":"2026-05-18T01:37:58.167917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0411194","created_at":"2026-05-18T01:37:58.167917+00:00"},{"alias_kind":"pith_short_12","alias_value":"KW2DB76J6MRY","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"KW2DB76J6MRYBC5S","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"KW2DB76J","created_at":"2026-05-18T12:25:52.687210+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/KW2DB76J6MRYBC5SB447KFLS35","json":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35.json","graph_json":"https://pith.science/api/pith-number/KW2DB76J6MRYBC5SB447KFLS35/graph.json","events_json":"https://pith.science/api/pith-number/KW2DB76J6MRYBC5SB447KFLS35/events.json","paper":"https://pith.science/paper/KW2DB76J"},"agent_actions":{"view_html":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35","download_json":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35.json","view_paper":"https://pith.science/paper/KW2DB76J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0411194&json=true","fetch_graph":"https://pith.science/api/pith-number/KW2DB76J6MRYBC5SB447KFLS35/graph.json","fetch_events":"https://pith.science/api/pith-number/KW2DB76J6MRYBC5SB447KFLS35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35/action/storage_attestation","attest_author":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35/action/author_attestation","sign_citation":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35/action/citation_signature","submit_replication":"https://pith.science/pith/KW2DB76J6MRYBC5SB447KFLS35/action/replication_record"}},"created_at":"2026-05-18T01:37:58.167917+00:00","updated_at":"2026-05-18T01:37:58.167917+00:00"}