{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K5NIE6ZP2RJVP4HJQ4MGPXZEKL","short_pith_number":"pith:K5NIE6ZP","canonical_record":{"source":{"id":"1707.00451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-03T09:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"b55dad30a71a55e548228acc04f4440a7ce2640a75f951e37bf069d8f9d42714","abstract_canon_sha256":"2711673a9366c27cdd46cbfd2ae3daf6af59d3c40ccba5db0683f7caeb8b4638"},"schema_version":"1.0"},"canonical_sha256":"575a827b2fd45357f0e9871867df2452dc9759f520fb1aa65577462c7ef50184","source":{"kind":"arxiv","id":"1707.00451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00451","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00451v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00451","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"K5NIE6ZP2RJV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K5NIE6ZP2RJVP4HJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K5NIE6ZP","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K5NIE6ZP2RJVP4HJQ4MGPXZEKL","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-03T09:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"b55dad30a71a55e548228acc04f4440a7ce2640a75f951e37bf069d8f9d42714","abstract_canon_sha256":"2711673a9366c27cdd46cbfd2ae3daf6af59d3c40ccba5db0683f7caeb8b4638"},"schema_version":"1.0"},"canonical_sha256":"575a827b2fd45357f0e9871867df2452dc9759f520fb1aa65577462c7ef50184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:03.334137Z","signature_b64":"jNqND2fitLNWoqcRzR9Yit6LC3wf/ivjGrUGhfLtW2IC5sWhuXDFvfdqKUxRVxOG1EaoISksNx+zop3EOG9fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575a827b2fd45357f0e9871867df2452dc9759f520fb1aa65577462c7ef50184","last_reissued_at":"2026-05-18T00:41:03.333621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:03.333621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00451","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:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoJUTnuOXh0FDhuB5w7nJwnRihX8M7ymlkVlSThojwuC97p7O8mhbzYA9/Rz1CnfWTlBAZDd2dtk1kEt4uzCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:48:11.991352Z"},"content_sha256":"970ba5c51c2c80c1ae1dadae18669ee22ae5260dd669d87bae6b69031aaab1cc","schema_version":"1.0","event_id":"sha256:970ba5c51c2c80c1ae1dadae18669ee22ae5260dd669d87bae6b69031aaab1cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K5NIE6ZP2RJVP4HJQ4MGPXZEKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distance Between Populations for n-Points Crossover in Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Gianpiero Cattaneo, Leonardo Vanneschi, Luca Manzoni, Mauro Castelli","submitted_at":"2017-07-03T09:04:52Z","abstract_excerpt":"Genetic algorithms (GAs) are an optimization technique that has been successfully used on many real-world problems. There exist different approaches to their theoretical study. In this paper we complete a recently presented approach to model one-point crossover using pretopologies (or Cech topologies) in two ways. First, we extend it to the case of n-points crossover. Then, we experimentally study how the distance distribution changes when the number of crossover points increases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00451","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:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0qO7XTeBzDCnOEbswSXddcBlzW8bym5Gp8OxFoeapsjd4WaJqBsDY4Q56XXf00u7cZzMVl276Wo1OnxXF4gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:48:11.991710Z"},"content_sha256":"7813b6b2813dfbc79e53c26da40d166311a20a97c681c1dccbadd3b33e00e498","schema_version":"1.0","event_id":"sha256:7813b6b2813dfbc79e53c26da40d166311a20a97c681c1dccbadd3b33e00e498"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/bundle.json","state_url":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/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-21T14:48:11Z","links":{"resolver":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL","bundle":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/bundle.json","state":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K5NIE6ZP2RJVP4HJQ4MGPXZEKL","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":"2711673a9366c27cdd46cbfd2ae3daf6af59d3c40ccba5db0683f7caeb8b4638","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-03T09:04:52Z","title_canon_sha256":"b55dad30a71a55e548228acc04f4440a7ce2640a75f951e37bf069d8f9d42714"},"schema_version":"1.0","source":{"id":"1707.00451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00451","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00451v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00451","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"K5NIE6ZP2RJV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K5NIE6ZP2RJVP4HJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K5NIE6ZP","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:7813b6b2813dfbc79e53c26da40d166311a20a97c681c1dccbadd3b33e00e498","target":"graph","created_at":"2026-05-18T00:41:03Z","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 (GAs) are an optimization technique that has been successfully used on many real-world problems. There exist different approaches to their theoretical study. In this paper we complete a recently presented approach to model one-point crossover using pretopologies (or Cech topologies) in two ways. First, we extend it to the case of n-points crossover. Then, we experimentally study how the distance distribution changes when the number of crossover points increases.","authors_text":"Gianpiero Cattaneo, Leonardo Vanneschi, Luca Manzoni, Mauro Castelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-03T09:04:52Z","title":"A Distance Between Populations for n-Points Crossover in Genetic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00451","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:970ba5c51c2c80c1ae1dadae18669ee22ae5260dd669d87bae6b69031aaab1cc","target":"record","created_at":"2026-05-18T00:41:03Z","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":"2711673a9366c27cdd46cbfd2ae3daf6af59d3c40ccba5db0683f7caeb8b4638","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-03T09:04:52Z","title_canon_sha256":"b55dad30a71a55e548228acc04f4440a7ce2640a75f951e37bf069d8f9d42714"},"schema_version":"1.0","source":{"id":"1707.00451","kind":"arxiv","version":1}},"canonical_sha256":"575a827b2fd45357f0e9871867df2452dc9759f520fb1aa65577462c7ef50184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"575a827b2fd45357f0e9871867df2452dc9759f520fb1aa65577462c7ef50184","first_computed_at":"2026-05-18T00:41:03.333621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:03.333621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jNqND2fitLNWoqcRzR9Yit6LC3wf/ivjGrUGhfLtW2IC5sWhuXDFvfdqKUxRVxOG1EaoISksNx+zop3EOG9fDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:03.334137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:970ba5c51c2c80c1ae1dadae18669ee22ae5260dd669d87bae6b69031aaab1cc","sha256:7813b6b2813dfbc79e53c26da40d166311a20a97c681c1dccbadd3b33e00e498"],"state_sha256":"b57a2f32ddf1c9edd411c91dc16f139034a826c5a1b58d8c44da24340e582a02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbBPigM4686Xwqv6kLthWHtVqdnN7bIeVHNfjI+BcFmSWLB8Z/wc+OPUPM6Cn0LX8yGpzgQbggu2LwEP5fEHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:48:11.994544Z","bundle_sha256":"120b57f03979cf4c5a4b5842052b485cccd82c6e581974279ddc696459df08af"}}