{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K5NIE6ZP2RJVP4HJQ4MGPXZEKL","short_pith_number":"pith:K5NIE6ZP","schema_version":"1.0","canonical_sha256":"575a827b2fd45357f0e9871867df2452dc9759f520fb1aa65577462c7ef50184","source":{"kind":"arxiv","id":"1707.00451","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.00451","created_at":"2026-05-18T00:41:03.333697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00451v1","created_at":"2026-05-18T00:41:03.333697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00451","created_at":"2026-05-18T00:41:03.333697+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5NIE6ZP2RJV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5NIE6ZP2RJVP4HJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5NIE6ZP","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL","json":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL.json","graph_json":"https://pith.science/api/pith-number/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/graph.json","events_json":"https://pith.science/api/pith-number/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/events.json","paper":"https://pith.science/paper/K5NIE6ZP"},"agent_actions":{"view_html":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL","download_json":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL.json","view_paper":"https://pith.science/paper/K5NIE6ZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00451&json=true","fetch_graph":"https://pith.science/api/pith-number/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/graph.json","fetch_events":"https://pith.science/api/pith-number/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/action/storage_attestation","attest_author":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/action/author_attestation","sign_citation":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/action/citation_signature","submit_replication":"https://pith.science/pith/K5NIE6ZP2RJVP4HJQ4MGPXZEKL/action/replication_record"}},"created_at":"2026-05-18T00:41:03.333697+00:00","updated_at":"2026-05-18T00:41:03.333697+00:00"}