{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4SKJVNMMU4ARNE5WFLO45JHGHU","short_pith_number":"pith:4SKJVNMM","schema_version":"1.0","canonical_sha256":"e4949ab58ca7011693b62addcea4e63d1553e6922acadd5e657e16ac8778b2f8","source":{"kind":"arxiv","id":"1809.04520","version":1},"attestation_state":"computed","paper":{"title":"Genetic algorithms with DNN-based trainable crossover as an example of partial specialization of general search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Alexey Potapov, Sergey Rodionov","submitted_at":"2018-07-18T10:14:58Z","abstract_excerpt":"Universal induction relies on some general search procedure that is doomed to be inefficient. One possibility to achieve both generality and efficiency is to specialize this procedure w.r.t. any given narrow task. However, complete specialization that implies direct mapping from the task parameters to solutions (discriminative models) without search is not always possible. In this paper, partial specialization of general search is considered in the form of genetic algorithms (GAs) with a specialized crossover operator. We perform a feasibility study of this idea implementing such an operator i"},"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":"1809.04520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-18T10:14:58Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f84484b9d5bcb04976c12d068dba85e027d3d4dfe2a03d3228f07c72ece6545c","abstract_canon_sha256":"558d3a3f1a873f76644fdf8da2cb4ca4b4db0a951577a6c32f854a3c4b71735e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:52.056435Z","signature_b64":"kuA2XGvjJ9bi2xLiYAwKwTyYq8dhzeTyyRNq+ZNb7q/RzETf5KnQCMHmcnNvysPFeJieyxgZbGPrfvySFQ1gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4949ab58ca7011693b62addcea4e63d1553e6922acadd5e657e16ac8778b2f8","last_reissued_at":"2026-05-18T00:05:52.055735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:52.055735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic algorithms with DNN-based trainable crossover as an example of partial specialization of general search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Alexey Potapov, Sergey Rodionov","submitted_at":"2018-07-18T10:14:58Z","abstract_excerpt":"Universal induction relies on some general search procedure that is doomed to be inefficient. One possibility to achieve both generality and efficiency is to specialize this procedure w.r.t. any given narrow task. However, complete specialization that implies direct mapping from the task parameters to solutions (discriminative models) without search is not always possible. In this paper, partial specialization of general search is considered in the form of genetic algorithms (GAs) with a specialized crossover operator. We perform a feasibility study of this idea implementing such an operator i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04520","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":"1809.04520","created_at":"2026-05-18T00:05:52.055856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04520v1","created_at":"2026-05-18T00:05:52.055856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04520","created_at":"2026-05-18T00:05:52.055856+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SKJVNMMU4AR","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SKJVNMMU4ARNE5W","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SKJVNMM","created_at":"2026-05-18T12:32:05.422762+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/4SKJVNMMU4ARNE5WFLO45JHGHU","json":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU.json","graph_json":"https://pith.science/api/pith-number/4SKJVNMMU4ARNE5WFLO45JHGHU/graph.json","events_json":"https://pith.science/api/pith-number/4SKJVNMMU4ARNE5WFLO45JHGHU/events.json","paper":"https://pith.science/paper/4SKJVNMM"},"agent_actions":{"view_html":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU","download_json":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU.json","view_paper":"https://pith.science/paper/4SKJVNMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04520&json=true","fetch_graph":"https://pith.science/api/pith-number/4SKJVNMMU4ARNE5WFLO45JHGHU/graph.json","fetch_events":"https://pith.science/api/pith-number/4SKJVNMMU4ARNE5WFLO45JHGHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU/action/storage_attestation","attest_author":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU/action/author_attestation","sign_citation":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU/action/citation_signature","submit_replication":"https://pith.science/pith/4SKJVNMMU4ARNE5WFLO45JHGHU/action/replication_record"}},"created_at":"2026-05-18T00:05:52.055856+00:00","updated_at":"2026-05-18T00:05:52.055856+00:00"}