{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q7T5QQHVDQHJZWYONZ3H2RLVZZ","short_pith_number":"pith:Q7T5QQHV","canonical_record":{"source":{"id":"1708.02068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-07T11:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"3038c754299b3beb57aa9f316fc3d6f973ef45be0012505af11d3dd67980580d","abstract_canon_sha256":"7c711ece3366b326c13c6b5ce1d95a00c76176f1e88941bb10705f25d1ca5829"},"schema_version":"1.0"},"canonical_sha256":"87e7d840f51c0e9cdb0e6e767d4575ce4a8e3f926ed1cfcca768bd380430a6e3","source":{"kind":"arxiv","id":"1708.02068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02068","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02068v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02068","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"Q7T5QQHVDQHJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q7T5QQHVDQHJZWYO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q7T5QQHV","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q7T5QQHVDQHJZWYONZ3H2RLVZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-07T11:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"3038c754299b3beb57aa9f316fc3d6f973ef45be0012505af11d3dd67980580d","abstract_canon_sha256":"7c711ece3366b326c13c6b5ce1d95a00c76176f1e88941bb10705f25d1ca5829"},"schema_version":"1.0"},"canonical_sha256":"87e7d840f51c0e9cdb0e6e767d4575ce4a8e3f926ed1cfcca768bd380430a6e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.400415Z","signature_b64":"zv8DppYt6FVorl9XBw5iqrsXoBCpDjKgOgOvRqtPLgwrKeJ4MwFvDb6eNLXWpTxEFaUiBs1mC9AyBRFzXkB/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e7d840f51c0e9cdb0e6e767d4575ce4a8e3f926ed1cfcca768bd380430a6e3","last_reissued_at":"2026-05-18T00:38:32.399987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.399987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02068","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-18T00:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PsQiMYdEVbYfo4XvxPkbio+MkQsFgwBWR7ShIGpOg6IcAFvGXieycI+veqe8l8vdxz4WP9yGpUDCvkudn55rBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:06:29.930953Z"},"content_sha256":"1f929766be2e0dd601afb23cc8ed131e360b8272eba81c1cfac168af6f41ed0c","schema_version":"1.0","event_id":"sha256:1f929766be2e0dd601afb23cc8ed131e360b8272eba81c1cfac168af6f41ed0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q7T5QQHVDQHJZWYONZ3H2RLVZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Noisy Optimisation with the Sliding Window Compact Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Diego P\\'erez-Li\\'ebana, Jialin Liu, Simon M. Lucas","submitted_at":"2017-08-07T11:07:57Z","abstract_excerpt":"The compact genetic algorithm is an Estimation of Distribution Algorithm for binary optimisation problems. Unlike the standard Genetic Algorithm, no cross-over or mutation is involved. Instead, the compact Genetic Algorithm uses a virtual population represented as a probability distribution over the set of binary strings. At each optimisation iteration, exactly two individuals are generated by sampling from the distribution, and compared exactly once to determine a winner and a loser. The probability distribution is then adjusted to increase the likelihood of generating individuals similar to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02068","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-18T00:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVMXueOT5GOd72ivOEK0Ov4N+c/gxjt4ePcteigwJ9YazMWHkTvmquyq03LyJGPRDKyXoGM7xW+3hb9bnVv5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:06:29.931294Z"},"content_sha256":"2b17a5e6957b9f9d6a6bf2cad902e00a7c52df28f3a356ba9a7b5f3b87bedf87","schema_version":"1.0","event_id":"sha256:2b17a5e6957b9f9d6a6bf2cad902e00a7c52df28f3a356ba9a7b5f3b87bedf87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ/bundle.json","state_url":"https://pith.science/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ/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-06-05T13:06:29Z","links":{"resolver":"https://pith.science/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ","bundle":"https://pith.science/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ/bundle.json","state":"https://pith.science/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7T5QQHVDQHJZWYONZ3H2RLVZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q7T5QQHVDQHJZWYONZ3H2RLVZZ","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":"7c711ece3366b326c13c6b5ce1d95a00c76176f1e88941bb10705f25d1ca5829","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-07T11:07:57Z","title_canon_sha256":"3038c754299b3beb57aa9f316fc3d6f973ef45be0012505af11d3dd67980580d"},"schema_version":"1.0","source":{"id":"1708.02068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02068","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02068v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02068","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"Q7T5QQHVDQHJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q7T5QQHVDQHJZWYO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q7T5QQHV","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b17a5e6957b9f9d6a6bf2cad902e00a7c52df28f3a356ba9a7b5f3b87bedf87","target":"graph","created_at":"2026-05-18T00:38:32Z","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":"The compact genetic algorithm is an Estimation of Distribution Algorithm for binary optimisation problems. Unlike the standard Genetic Algorithm, no cross-over or mutation is involved. Instead, the compact Genetic Algorithm uses a virtual population represented as a probability distribution over the set of binary strings. At each optimisation iteration, exactly two individuals are generated by sampling from the distribution, and compared exactly once to determine a winner and a loser. The probability distribution is then adjusted to increase the likelihood of generating individuals similar to ","authors_text":"Diego P\\'erez-Li\\'ebana, Jialin Liu, Simon M. Lucas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-07T11:07:57Z","title":"Efficient Noisy Optimisation with the Sliding Window Compact Genetic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02068","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:1f929766be2e0dd601afb23cc8ed131e360b8272eba81c1cfac168af6f41ed0c","target":"record","created_at":"2026-05-18T00:38:32Z","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":"7c711ece3366b326c13c6b5ce1d95a00c76176f1e88941bb10705f25d1ca5829","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-08-07T11:07:57Z","title_canon_sha256":"3038c754299b3beb57aa9f316fc3d6f973ef45be0012505af11d3dd67980580d"},"schema_version":"1.0","source":{"id":"1708.02068","kind":"arxiv","version":1}},"canonical_sha256":"87e7d840f51c0e9cdb0e6e767d4575ce4a8e3f926ed1cfcca768bd380430a6e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87e7d840f51c0e9cdb0e6e767d4575ce4a8e3f926ed1cfcca768bd380430a6e3","first_computed_at":"2026-05-18T00:38:32.399987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:32.399987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zv8DppYt6FVorl9XBw5iqrsXoBCpDjKgOgOvRqtPLgwrKeJ4MwFvDb6eNLXWpTxEFaUiBs1mC9AyBRFzXkB/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:32.400415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f929766be2e0dd601afb23cc8ed131e360b8272eba81c1cfac168af6f41ed0c","sha256:2b17a5e6957b9f9d6a6bf2cad902e00a7c52df28f3a356ba9a7b5f3b87bedf87"],"state_sha256":"87dc6fdbc89d8be8aa9a331c9b479eeff0035f8063b809695dd532684116ff60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwEocy/kf02dC1TSG2RcXlMzpl0Ec6BHw5mtVE6hg0nuaeaQV7JCGEfd/bMgtgeHIXUI+VAFUxz3ZWGpFJGyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:06:29.933169Z","bundle_sha256":"6209c7a25080d2f28b7ca15529eeda6fb1d55c1f1b9990f2c2f320810f7825d5"}}