{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DW2XTJY64IHXY3FDWUMATMMPLD","short_pith_number":"pith:DW2XTJY6","schema_version":"1.0","canonical_sha256":"1db579a71ee20f7c6ca3b51809b18f58ce490dfb658382841bffb14a89d6fe8e","source":{"kind":"arxiv","id":"1904.08577","version":1},"attestation_state":"computed","paper":{"title":"Semantic variation operators for multidimensional genetic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jason H. Moore, William La Cava","submitted_at":"2019-04-18T03:05:37Z","abstract_excerpt":"Multidimensional genetic programming represents candidate solutions as sets of programs, and thereby provides an interesting framework for exploiting building block identification. Towards this goal, we investigate the use of machine learning as a way to bias which components of programs are promoted, and propose two semantic operators to choose where useful building blocks are placed during crossover. A forward stagewise crossover operator we propose leads to significant improvements on a set of regression problems, and produces state-of-the-art results in a large benchmark study. We discuss "},"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":"1904.08577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-18T03:05:37Z","cross_cats_sorted":[],"title_canon_sha256":"3bd2f697f7cc18f3a115ed83828d547577cf642fb1c61b8a59dff83f609f42e0","abstract_canon_sha256":"9653af89c5d4bc0af44e2dae302565d65abfe5a05492e3f6354a086a2e694dc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:13.855052Z","signature_b64":"AUj+o15DZuSX87MNwtQg7DlA31ML3Kgs1g5Yge2vKyH+Tjqrusz1s+9LSlxpGmiKCPcdZLmjREUq0l7lNQZxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1db579a71ee20f7c6ca3b51809b18f58ce490dfb658382841bffb14a89d6fe8e","last_reissued_at":"2026-05-17T23:48:13.854347Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:13.854347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semantic variation operators for multidimensional genetic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jason H. Moore, William La Cava","submitted_at":"2019-04-18T03:05:37Z","abstract_excerpt":"Multidimensional genetic programming represents candidate solutions as sets of programs, and thereby provides an interesting framework for exploiting building block identification. Towards this goal, we investigate the use of machine learning as a way to bias which components of programs are promoted, and propose two semantic operators to choose where useful building blocks are placed during crossover. A forward stagewise crossover operator we propose leads to significant improvements on a set of regression problems, and produces state-of-the-art results in a large benchmark study. We discuss "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08577","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":"1904.08577","created_at":"2026-05-17T23:48:13.854473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08577v1","created_at":"2026-05-17T23:48:13.854473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08577","created_at":"2026-05-17T23:48:13.854473+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW2XTJY64IHX","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW2XTJY64IHXY3FD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW2XTJY6","created_at":"2026-05-18T12:33:15.570797+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/DW2XTJY64IHXY3FDWUMATMMPLD","json":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD.json","graph_json":"https://pith.science/api/pith-number/DW2XTJY64IHXY3FDWUMATMMPLD/graph.json","events_json":"https://pith.science/api/pith-number/DW2XTJY64IHXY3FDWUMATMMPLD/events.json","paper":"https://pith.science/paper/DW2XTJY6"},"agent_actions":{"view_html":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD","download_json":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD.json","view_paper":"https://pith.science/paper/DW2XTJY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08577&json=true","fetch_graph":"https://pith.science/api/pith-number/DW2XTJY64IHXY3FDWUMATMMPLD/graph.json","fetch_events":"https://pith.science/api/pith-number/DW2XTJY64IHXY3FDWUMATMMPLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD/action/storage_attestation","attest_author":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD/action/author_attestation","sign_citation":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD/action/citation_signature","submit_replication":"https://pith.science/pith/DW2XTJY64IHXY3FDWUMATMMPLD/action/replication_record"}},"created_at":"2026-05-17T23:48:13.854473+00:00","updated_at":"2026-05-17T23:48:13.854473+00:00"}