{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YFNQSPRGSNQY3VBJ2SOW3TAJOW","short_pith_number":"pith:YFNQSPRG","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"},"canonical_sha256":"c15b093e2693618dd429d49d6dcc0975be0a3db98ba61a7ea92bee36067db62a","source":{"kind":"arxiv","id":"1907.00707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00707","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00707v1","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00707","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"YFNQSPRGSNQY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YFNQSPRGSNQY3VBJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YFNQSPRG","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YFNQSPRGSNQY3VBJ2SOW3TAJOW","target":"record","payload":{"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"},"canonical_sha256":"c15b093e2693618dd429d49d6dcc0975be0a3db98ba61a7ea92bee36067db62a","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"},"source_kind":"arxiv","source_id":"1907.00707","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBncMObugYcZ7CNhtKTPCRna8zSeD5GlQXaumQLb2Kdgu1s6PRSzUPC2WNUAHcUMZYvbY2BsuAywN8uVfZjvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:05:31.457065Z"},"content_sha256":"fa29648dc7246708af7a058285ed3e4d48be422c5e59dc8fbcae68665dbda5fd","schema_version":"1.0","event_id":"sha256:fa29648dc7246708af7a058285ed3e4d48be422c5e59dc8fbcae68665dbda5fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YFNQSPRGSNQY3VBJ2SOW3TAJOW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hhip4xgpjAPcL0U1xu1IwAGuxclTVzu6WWj0L27PiIOr5DlZAqt6p5Hb6303uwooDNywkSfiqOWNMOqV3axUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:05:31.457737Z"},"content_sha256":"8c70556e479ba14225dfe935544756ddbe11b786e698182f04754f67a70e50b4","schema_version":"1.0","event_id":"sha256:8c70556e479ba14225dfe935544756ddbe11b786e698182f04754f67a70e50b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/bundle.json","state_url":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T15:05:31Z","links":{"resolver":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW","bundle":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/bundle.json","state":"https://pith.science/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFNQSPRGSNQY3VBJ2SOW3TAJOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YFNQSPRGSNQY3VBJ2SOW3TAJOW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"640ae9761b2731bf519fb01138c5e6935b09eb375ee347e916d36c7e31fe5dae","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-24T06:08:07Z","title_canon_sha256":"fe23eb4bc31f5f8291fcbbefd3d8bfbef31876fe35d18f11b8d8901cfd699603"},"schema_version":"1.0","source":{"id":"1907.00707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00707","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00707v1","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00707","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"YFNQSPRGSNQY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YFNQSPRGSNQY3VBJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YFNQSPRG","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:8c70556e479ba14225dfe935544756ddbe11b786e698182f04754f67a70e50b4","target":"graph","created_at":"2026-05-17T23:41:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandre Fr\\'echette, Hartmut Neven, Hossein Sadeghi, James King, Masoud Mohseni, Mohammad H. Amin, Sergei V. Isakov, William Bernoudy","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-24T06:08:07Z","title":"Quantum-Assisted Genetic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00707","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa29648dc7246708af7a058285ed3e4d48be422c5e59dc8fbcae68665dbda5fd","target":"record","created_at":"2026-05-17T23:41:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"640ae9761b2731bf519fb01138c5e6935b09eb375ee347e916d36c7e31fe5dae","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-24T06:08:07Z","title_canon_sha256":"fe23eb4bc31f5f8291fcbbefd3d8bfbef31876fe35d18f11b8d8901cfd699603"},"schema_version":"1.0","source":{"id":"1907.00707","kind":"arxiv","version":1}},"canonical_sha256":"c15b093e2693618dd429d49d6dcc0975be0a3db98ba61a7ea92bee36067db62a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c15b093e2693618dd429d49d6dcc0975be0a3db98ba61a7ea92bee36067db62a","first_computed_at":"2026-05-17T23:41:48.379986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:48.379986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OuXQ744x7wyb8wqTRU4k8IODs05OeqxMAO4MQ7WWGqE3MpPd90HRFg8RVuqp6QZYFlTk5R/LVIpFv7q8f787BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:48.380659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa29648dc7246708af7a058285ed3e4d48be422c5e59dc8fbcae68665dbda5fd","sha256:8c70556e479ba14225dfe935544756ddbe11b786e698182f04754f67a70e50b4"],"state_sha256":"0b43c3ed3c21355c31f6205ffe0f5fe59e3ce4f8383cba3e116992e3c65af312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tOD8dmrtF9pC/UI/3jrN6Qs0jZVLhYd7jvuQbbcU7a98DXowntLYvSVgwdOQfUmPtK03DtseGp9qw1lJAvyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:05:31.461346Z","bundle_sha256":"18dc9922dbb2d71fa7a8fd9ffb1f0820b9af873f4bdc4cc665bba0618561fde4"}}