{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YWLVQIUCLU5PY7FVUULL6F2KVS","short_pith_number":"pith:YWLVQIUC","canonical_record":{"source":{"id":"2203.15039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-28T19:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"fc857609645b182dbcd645fa7fa6c20cef68fe433292d60450da02c6a8ff57b3","abstract_canon_sha256":"4048a20dcb22960c295ad49c80c9b083f0d005d19ec17b57151b9ca63536e429"},"schema_version":"1.0"},"canonical_sha256":"c5975822825d3afc7cb5a516bf174aacaa29ea7de9252c51f829c9e59a28e10e","source":{"kind":"arxiv","id":"2203.15039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15039","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15039v1","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15039","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"pith_short_12","alias_value":"YWLVQIUCLU5P","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"YWLVQIUCLU5PY7FV","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"YWLVQIUC","created_at":"2026-07-05T08:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YWLVQIUCLU5PY7FVUULL6F2KVS","target":"record","payload":{"canonical_record":{"source":{"id":"2203.15039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-28T19:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"fc857609645b182dbcd645fa7fa6c20cef68fe433292d60450da02c6a8ff57b3","abstract_canon_sha256":"4048a20dcb22960c295ad49c80c9b083f0d005d19ec17b57151b9ca63536e429"},"schema_version":"1.0"},"canonical_sha256":"c5975822825d3afc7cb5a516bf174aacaa29ea7de9252c51f829c9e59a28e10e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:59.382413Z","signature_b64":"UYcvgsIXfM3NhupQa+WOF1k0cY2ReI0tYR0PqezN4eqGaNjchfqo8eTZ+ezuIeqdsCfuGwrMHrwMfimAc0fhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5975822825d3afc7cb5a516bf174aacaa29ea7de9252c51f829c9e59a28e10e","last_reissued_at":"2026-07-05T08:27:59.381938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:59.381938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.15039","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-07-05T08:27:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqNcAPkDw6Eb+odmwiIcxW9ejqoHiGZDHsBnyuMk/EqLllAUTd8T/FB4sIL6DhaLnLfZkRhLJAHrPOL2t0enCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:52:46.292054Z"},"content_sha256":"4ec7e83afc736e76090ead89bc39860efb0f68e0509a1b9b7a12f9d3c73ae565","schema_version":"1.0","event_id":"sha256:4ec7e83afc736e76090ead89bc39860efb0f68e0509a1b9b7a12f9d3c73ae565"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YWLVQIUCLU5PY7FVUULL6F2KVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Genetic Algorithm with Individuals in Multiple Registers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giancarlo Gatti, Mikel Sanz, Rub\\'en Ibarrondo","submitted_at":"2022-03-28T19:05:03Z","abstract_excerpt":"Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution, which are characterized by successfully finding robust solutions for optimization problems. Here, we propose a subroutine-based quantum genetic algorithm with individuals codified in independent registers. This distinctive codification allows our proposal to depict all the fundamental elements characterizing genetic algorithms, i.e. population-based search with selection of many individuals, crossover, and mutation. Our subroutine-based construction permits us to consider several variants of the algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15039","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/2203.15039/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"},"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-07-05T08:27:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjxwiBXrFWoipunsV+gd53fGfolj5Vvcru8ROCuKL50hFPv0Mbil3Ighp6mGftdtlV1RA4nFu+oZhwJav6f/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:52:46.292604Z"},"content_sha256":"61953b3ae2cbf5c300bde7cff8d7ddc4347775fd443649413c913be4df2ad39f","schema_version":"1.0","event_id":"sha256:61953b3ae2cbf5c300bde7cff8d7ddc4347775fd443649413c913be4df2ad39f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWLVQIUCLU5PY7FVUULL6F2KVS/bundle.json","state_url":"https://pith.science/pith/YWLVQIUCLU5PY7FVUULL6F2KVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWLVQIUCLU5PY7FVUULL6F2KVS/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-08-04T08:52:46Z","links":{"resolver":"https://pith.science/pith/YWLVQIUCLU5PY7FVUULL6F2KVS","bundle":"https://pith.science/pith/YWLVQIUCLU5PY7FVUULL6F2KVS/bundle.json","state":"https://pith.science/pith/YWLVQIUCLU5PY7FVUULL6F2KVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWLVQIUCLU5PY7FVUULL6F2KVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YWLVQIUCLU5PY7FVUULL6F2KVS","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":"4048a20dcb22960c295ad49c80c9b083f0d005d19ec17b57151b9ca63536e429","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-28T19:05:03Z","title_canon_sha256":"fc857609645b182dbcd645fa7fa6c20cef68fe433292d60450da02c6a8ff57b3"},"schema_version":"1.0","source":{"id":"2203.15039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15039","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15039v1","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15039","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"pith_short_12","alias_value":"YWLVQIUCLU5P","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"YWLVQIUCLU5PY7FV","created_at":"2026-07-05T08:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"YWLVQIUC","created_at":"2026-07-05T08:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:61953b3ae2cbf5c300bde7cff8d7ddc4347775fd443649413c913be4df2ad39f","target":"graph","created_at":"2026-07-05T08:27:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.15039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution, which are characterized by successfully finding robust solutions for optimization problems. Here, we propose a subroutine-based quantum genetic algorithm with individuals codified in independent registers. This distinctive codification allows our proposal to depict all the fundamental elements characterizing genetic algorithms, i.e. population-based search with selection of many individuals, crossover, and mutation. Our subroutine-based construction permits us to consider several variants of the algorithm","authors_text":"Giancarlo Gatti, Mikel Sanz, Rub\\'en Ibarrondo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-28T19:05:03Z","title":"Quantum Genetic Algorithm with Individuals in Multiple Registers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15039","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:4ec7e83afc736e76090ead89bc39860efb0f68e0509a1b9b7a12f9d3c73ae565","target":"record","created_at":"2026-07-05T08:27:59Z","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":"4048a20dcb22960c295ad49c80c9b083f0d005d19ec17b57151b9ca63536e429","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-28T19:05:03Z","title_canon_sha256":"fc857609645b182dbcd645fa7fa6c20cef68fe433292d60450da02c6a8ff57b3"},"schema_version":"1.0","source":{"id":"2203.15039","kind":"arxiv","version":1}},"canonical_sha256":"c5975822825d3afc7cb5a516bf174aacaa29ea7de9252c51f829c9e59a28e10e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5975822825d3afc7cb5a516bf174aacaa29ea7de9252c51f829c9e59a28e10e","first_computed_at":"2026-07-05T08:27:59.381938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:59.381938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UYcvgsIXfM3NhupQa+WOF1k0cY2ReI0tYR0PqezN4eqGaNjchfqo8eTZ+ezuIeqdsCfuGwrMHrwMfimAc0fhAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:59.382413Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.15039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ec7e83afc736e76090ead89bc39860efb0f68e0509a1b9b7a12f9d3c73ae565","sha256:61953b3ae2cbf5c300bde7cff8d7ddc4347775fd443649413c913be4df2ad39f"],"state_sha256":"36fd400c53ea9f646a5ac874700690eecb8e570cb9d188676eced5639ac54e62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOHF6OIUx2JNK/lvZyNnScHXj62Tx8Q/LaIb9jWQQndvoVOZ5pbrZogNC4ZT/u1kNhpGAiWosLMF0YIOAQNdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:52:46.296739Z","bundle_sha256":"d5e814edeae5b71b7f9516db732a5281445f2e1bcc89c9b66826ee605f78978d"}}