{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YFNQSPRGSNQY3VBJ2SOW3TAJOW","short_pith_number":"pith:YFNQSPRG","schema_version":"1.0","canonical_sha256":"c15b093e2693618dd429d49d6dcc0975be0a3db98ba61a7ea92bee36067db62a","source":{"kind":"arxiv","id":"1907.00707","version":1},"attestation_state":"computed","paper":{"title":"Quantum-Assisted Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"quant-ph","authors_text":"Alexandre Fr\\'echette, Hartmut Neven, Hossein Sadeghi, James King, Masoud Mohseni, Mohammad H. Amin, Sergei V. Isakov, William Bernoudy","submitted_at":"2019-06-24T06:08:07Z","abstract_excerpt":"Genetic algorithms, which mimic evolutionary processes to solve optimization problems, can be enhanced by using powerful semi-local search algorithms as mutation operators. Here, we introduce reverse quantum annealing, a class of quantum evolutions that can be used for performing families of quasi-local or quasi-nonlocal search starting from a classical state, as novel sources of mutations. Reverse annealing enables the development of genetic algorithms that use quantum fluctuation for mutations and classical mechanisms for the crossovers -- we refer to these as Quantum-Assisted Genetic Algori"},"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":"1907.00707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-24T06:08:07Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"fe23eb4bc31f5f8291fcbbefd3d8bfbef31876fe35d18f11b8d8901cfd699603","abstract_canon_sha256":"640ae9761b2731bf519fb01138c5e6935b09eb375ee347e916d36c7e31fe5dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:48.380659Z","signature_b64":"OuXQ744x7wyb8wqTRU4k8IODs05OeqxMAO4MQ7WWGqE3MpPd90HRFg8RVuqp6QZYFlTk5R/LVIpFv7q8f787BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c15b093e2693618dd429d49d6dcc0975be0a3db98ba61a7ea92bee36067db62a","last_reissued_at":"2026-05-17T23:41:48.379986Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:48.379986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Assisted Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"quant-ph","authors_text":"Alexandre Fr\\'echette, Hartmut Neven, Hossein Sadeghi, James King, Masoud Mohseni, Mohammad H. Amin, Sergei V. Isakov, William Bernoudy","submitted_at":"2019-06-24T06:08:07Z","abstract_excerpt":"Genetic algorithms, which mimic evolutionary processes to solve optimization problems, can be enhanced by using powerful semi-local search algorithms as mutation operators. Here, we introduce reverse quantum annealing, a class of quantum evolutions that can be used for performing families of quasi-local or quasi-nonlocal search starting from a classical state, as novel sources of mutations. Reverse annealing enables the development of genetic algorithms that use quantum fluctuation for mutations and classical mechanisms for the crossovers -- we refer to these as Quantum-Assisted Genetic Algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00707","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":"1907.00707","created_at":"2026-05-17T23:41:48.380082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00707v1","created_at":"2026-05-17T23:41:48.380082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00707","created_at":"2026-05-17T23:41:48.380082+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFNQSPRGSNQY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFNQSPRGSNQY3VBJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFNQSPRG","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2411.10406","citing_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","ref_index":179,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW","json":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW.json","graph_json":"https://pith.science/api/pith-number/YFNQSPRGSNQY3VBJ2SOW3TAJOW/graph.json","events_json":"https://pith.science/api/pith-number/YFNQSPRGSNQY3VBJ2SOW3TAJOW/events.json","paper":"https://pith.science/paper/YFNQSPRG"},"agent_actions":{"view_html":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW","download_json":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW.json","view_paper":"https://pith.science/paper/YFNQSPRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00707&json=true","fetch_graph":"https://pith.science/api/pith-number/YFNQSPRGSNQY3VBJ2SOW3TAJOW/graph.json","fetch_events":"https://pith.science/api/pith-number/YFNQSPRGSNQY3VBJ2SOW3TAJOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/action/storage_attestation","attest_author":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/action/author_attestation","sign_citation":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/action/citation_signature","submit_replication":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/action/replication_record"}},"created_at":"2026-05-17T23:41:48.380082+00:00","updated_at":"2026-05-17T23:41:48.380082+00:00"}