{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Z4RI62QJE34RTJXPH24I6N2JNN","short_pith_number":"pith:Z4RI62QJ","schema_version":"1.0","canonical_sha256":"cf228f6a0926f919a6ef3eb88f37496b4172c7d61c02c8592c51389db1e6254b","source":{"kind":"arxiv","id":"2001.00234","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Quantum Annealing: A Quantum-Assisted Learning Automata Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Milton Halem, Ramin Ayanzadeh, Tim Finin","submitted_at":"2020-01-01T16:41:58Z","abstract_excerpt":"We introduce the reinforcement quantum annealing (RQA) scheme in which an intelligent agent interacts with a quantum annealer that plays the stochastic environment role of learning automata and tries to iteratively find better Ising Hamiltonians for the given problem of interest. As a proof-of-concept, we propose a novel approach for reducing the NP-complete problem of Boolean satisfiability (SAT) to minimizing Ising Hamiltonians and show how to apply the RQA for increasing the probability of finding the global optimum. Our experimental results on two different benchmark SAT problems (namely f"},"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":"2001.00234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-01T16:41:58Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d362dd0be0941f5b07b92ab923c5736493cc2b80f0de01dfbcddf8a591be3d4a","abstract_canon_sha256":"cb9ea88c4562a37eaad584ac8d4efbddb8b50eee96aa479743a55a4a2fdda313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:22.240397Z","signature_b64":"VB1a/9UVv5zsi6ySqfdB99dKEkCZ5TvDM0DaQWmd3naEXH7r54uUKe9BaBe5+4dVzk2kbI5tN73BQ5tI790EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf228f6a0926f919a6ef3eb88f37496b4172c7d61c02c8592c51389db1e6254b","last_reissued_at":"2026-07-05T00:29:22.240006Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:22.240006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Quantum Annealing: A Quantum-Assisted Learning Automata Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Milton Halem, Ramin Ayanzadeh, Tim Finin","submitted_at":"2020-01-01T16:41:58Z","abstract_excerpt":"We introduce the reinforcement quantum annealing (RQA) scheme in which an intelligent agent interacts with a quantum annealer that plays the stochastic environment role of learning automata and tries to iteratively find better Ising Hamiltonians for the given problem of interest. As a proof-of-concept, we propose a novel approach for reducing the NP-complete problem of Boolean satisfiability (SAT) to minimizing Ising Hamiltonians and show how to apply the RQA for increasing the probability of finding the global optimum. Our experimental results on two different benchmark SAT problems (namely f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00234","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.00234/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.00234","created_at":"2026-07-05T00:29:22.240063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.00234v1","created_at":"2026-07-05T00:29:22.240063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00234","created_at":"2026-07-05T00:29:22.240063+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4RI62QJE34R","created_at":"2026-07-05T00:29:22.240063+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4RI62QJE34RTJXP","created_at":"2026-07-05T00:29:22.240063+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4RI62QJ","created_at":"2026-07-05T00:29:22.240063+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/Z4RI62QJE34RTJXPH24I6N2JNN","json":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN.json","graph_json":"https://pith.science/api/pith-number/Z4RI62QJE34RTJXPH24I6N2JNN/graph.json","events_json":"https://pith.science/api/pith-number/Z4RI62QJE34RTJXPH24I6N2JNN/events.json","paper":"https://pith.science/paper/Z4RI62QJ"},"agent_actions":{"view_html":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN","download_json":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN.json","view_paper":"https://pith.science/paper/Z4RI62QJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.00234&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4RI62QJE34RTJXPH24I6N2JNN/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4RI62QJE34RTJXPH24I6N2JNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN/action/storage_attestation","attest_author":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN/action/author_attestation","sign_citation":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN/action/citation_signature","submit_replication":"https://pith.science/pith/Z4RI62QJE34RTJXPH24I6N2JNN/action/replication_record"}},"created_at":"2026-07-05T00:29:22.240063+00:00","updated_at":"2026-07-05T00:29:22.240063+00:00"}