{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VAYPSUYQ73AXLBWNTE4GKIYHTC","short_pith_number":"pith:VAYPSUYQ","schema_version":"1.0","canonical_sha256":"a830f95310fec17586cd993865230798984b1aceeb8ac7c2ee46ea7365660a6e","source":{"kind":"arxiv","id":"cs/0601044","version":1},"attestation_state":"computed","paper":{"title":"Genetic Programming, Validation Sets, and Parsimony Pressure","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christian Gagn\\'e (INRIA Futurs, IIS), LVSN, Marco Tomassini (IIS), Marc Parizeau (LVSN), Marc Schoenauer (INRIA Futurs)","submitted_at":"2006-01-11T15:39:16Z","abstract_excerpt":"Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited number of samples. This paper is an investigation on two methods to improve generalization in GP-based learning: 1) the selection of the best-of-run individuals using a three data sets methodology, and 2) the application of parsimony pressure in order to reduce the complexity of the solutions. Results using GP in a binary classification setup show that while the accuracy on the test sets is preserved, with less varian"},"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":"cs/0601044","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2006-01-11T15:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"e91bf3416b6a0a32769e8d1f0d1110d40b8e58598634b094eed37d1ad7df5575","abstract_canon_sha256":"56e16f87ef94c71fffd79875f43674ed970cfeb6716d23d58734a87a92f67fde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.877444Z","signature_b64":"UbNmQif4CwXE5R9L7wg4kp6IT47ah2jV1dUNu8+hHiVhzc38w0Lm7qFLWCYJ09s2NIHpT0VhwSkSIvvhfHNZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a830f95310fec17586cd993865230798984b1aceeb8ac7c2ee46ea7365660a6e","last_reissued_at":"2026-05-18T01:08:54.876902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.876902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic Programming, Validation Sets, and Parsimony Pressure","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christian Gagn\\'e (INRIA Futurs, IIS), LVSN, Marco Tomassini (IIS), Marc Parizeau (LVSN), Marc Schoenauer (INRIA Futurs)","submitted_at":"2006-01-11T15:39:16Z","abstract_excerpt":"Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited number of samples. This paper is an investigation on two methods to improve generalization in GP-based learning: 1) the selection of the best-of-run individuals using a three data sets methodology, and 2) the application of parsimony pressure in order to reduce the complexity of the solutions. Results using GP in a binary classification setup show that while the accuracy on the test sets is preserved, with less varian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0601044","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":"cs/0601044","created_at":"2026-05-18T01:08:54.876993+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0601044v1","created_at":"2026-05-18T01:08:54.876993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0601044","created_at":"2026-05-18T01:08:54.876993+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAYPSUYQ73AX","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAYPSUYQ73AXLBWN","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAYPSUYQ","created_at":"2026-05-18T12:25:54.717736+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/VAYPSUYQ73AXLBWNTE4GKIYHTC","json":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC.json","graph_json":"https://pith.science/api/pith-number/VAYPSUYQ73AXLBWNTE4GKIYHTC/graph.json","events_json":"https://pith.science/api/pith-number/VAYPSUYQ73AXLBWNTE4GKIYHTC/events.json","paper":"https://pith.science/paper/VAYPSUYQ"},"agent_actions":{"view_html":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC","download_json":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC.json","view_paper":"https://pith.science/paper/VAYPSUYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0601044&json=true","fetch_graph":"https://pith.science/api/pith-number/VAYPSUYQ73AXLBWNTE4GKIYHTC/graph.json","fetch_events":"https://pith.science/api/pith-number/VAYPSUYQ73AXLBWNTE4GKIYHTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC/action/storage_attestation","attest_author":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC/action/author_attestation","sign_citation":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC/action/citation_signature","submit_replication":"https://pith.science/pith/VAYPSUYQ73AXLBWNTE4GKIYHTC/action/replication_record"}},"created_at":"2026-05-18T01:08:54.876993+00:00","updated_at":"2026-05-18T01:08:54.876993+00:00"}