{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J7VPLK7CFGFL6WN7E6WJIBBWQ4","short_pith_number":"pith:J7VPLK7C","schema_version":"1.0","canonical_sha256":"4feaf5abe2298abf59bf27ac940436872efc653add94f99b5140c97c996108a3","source":{"kind":"arxiv","id":"1811.02524","version":1},"attestation_state":"computed","paper":{"title":"Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Aidan Roy, Fabian Chudak, Roberto Sebastiani, Stefano Varotti, William Macready, Zhengbing Bian","submitted_at":"2018-11-06T17:46:41Z","abstract_excerpt":"Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms allow for the optimization of quadratic objectives defined over binary variables (qubits), also known as Ising problems. In the last decade, QA systems as implemented by D-Wave have scaled with Moore-like growth. Current architectures provide 2048 sparsely-connected qubits, and continued exponential growth is anticipated, together with increased connectivity. We explore the feasibility of such architectures for solvin"},"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":"1811.02524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-11-06T17:46:41Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"626b75644f2ea176cfcb12b79604d28b9d7bb8fbf1294f00911fb058f2cabc4e","abstract_canon_sha256":"1d971761b0c957949e85228c7ec8d45f91d3822b2f8a93828b3acfe687c66b71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.004335Z","signature_b64":"sQ6NrTgFg5IiGArPAWoRY3NBEJNCjBt8hyo61NqigVW6vy1nkADTc5BAD/yC490p+Nh6Ct7Ez8TGFJQmKFAwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4feaf5abe2298abf59bf27ac940436872efc653add94f99b5140c97c996108a3","last_reissued_at":"2026-05-18T00:01:24.003830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.003830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Aidan Roy, Fabian Chudak, Roberto Sebastiani, Stefano Varotti, William Macready, Zhengbing Bian","submitted_at":"2018-11-06T17:46:41Z","abstract_excerpt":"Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms allow for the optimization of quadratic objectives defined over binary variables (qubits), also known as Ising problems. In the last decade, QA systems as implemented by D-Wave have scaled with Moore-like growth. Current architectures provide 2048 sparsely-connected qubits, and continued exponential growth is anticipated, together with increased connectivity. We explore the feasibility of such architectures for solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02524","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":"1811.02524","created_at":"2026-05-18T00:01:24.003909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02524v1","created_at":"2026-05-18T00:01:24.003909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02524","created_at":"2026-05-18T00:01:24.003909+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7VPLK7CFGFL","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7VPLK7CFGFL6WN7","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7VPLK7C","created_at":"2026-05-18T12:32:31.084164+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/J7VPLK7CFGFL6WN7E6WJIBBWQ4","json":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4.json","graph_json":"https://pith.science/api/pith-number/J7VPLK7CFGFL6WN7E6WJIBBWQ4/graph.json","events_json":"https://pith.science/api/pith-number/J7VPLK7CFGFL6WN7E6WJIBBWQ4/events.json","paper":"https://pith.science/paper/J7VPLK7C"},"agent_actions":{"view_html":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4","download_json":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4.json","view_paper":"https://pith.science/paper/J7VPLK7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02524&json=true","fetch_graph":"https://pith.science/api/pith-number/J7VPLK7CFGFL6WN7E6WJIBBWQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/J7VPLK7CFGFL6WN7E6WJIBBWQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4/action/storage_attestation","attest_author":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4/action/author_attestation","sign_citation":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4/action/citation_signature","submit_replication":"https://pith.science/pith/J7VPLK7CFGFL6WN7E6WJIBBWQ4/action/replication_record"}},"created_at":"2026-05-18T00:01:24.003909+00:00","updated_at":"2026-05-18T00:01:24.003909+00:00"}