{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5WTVXNUORB5J7NT7F5AZ52DMW4","short_pith_number":"pith:5WTVXNUO","canonical_record":{"source":{"id":"1801.07668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-23T17:29:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5580bc1f8b06228bdd1e57b6e97e0562a83a715c699cee4f272b2b36e663ca87","abstract_canon_sha256":"c2a0ea72c563dfa84277b7c1573998dcf42432f104feacd22c7db251ef3424a3"},"schema_version":"1.0"},"canonical_sha256":"eda75bb68e887a9fb67f2f419ee86cb72844b3266423a1b67d657992ad058074","source":{"kind":"arxiv","id":"1801.07668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07668","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07668v1","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07668","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"5WTVXNUORB5J","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5WTVXNUORB5J7NT7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5WTVXNUO","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5WTVXNUORB5J7NT7F5AZ52DMW4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-23T17:29:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5580bc1f8b06228bdd1e57b6e97e0562a83a715c699cee4f272b2b36e663ca87","abstract_canon_sha256":"c2a0ea72c563dfa84277b7c1573998dcf42432f104feacd22c7db251ef3424a3"},"schema_version":"1.0"},"canonical_sha256":"eda75bb68e887a9fb67f2f419ee86cb72844b3266423a1b67d657992ad058074","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.540888Z","signature_b64":"R+hbXZGYkj10gFTm/zjorix3XYFSBZPHwbBOWDttJrx26SHSD0IcDtSdy7rJS4Hh+/VMq1c5YxpLJSYAT9KiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eda75bb68e887a9fb67f2f419ee86cb72844b3266423a1b67d657992ad058074","last_reissued_at":"2026-05-17T23:43:28.540341Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.540341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07668","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-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIneGHO9gFSey11XgcTmdrU6YTbCLbOKiTUC/5Fe58Uee2L/76jj7mQTojdA9+PK3GDrAmomUjLbJx94NbmICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:04:39.044794Z"},"content_sha256":"c893978bc9dd125813e111da431ed4be843eca957e0f6138872ea741d8955acf","schema_version":"1.0","event_id":"sha256:c893978bc9dd125813e111da431ed4be843eca957e0f6138872ea741d8955acf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5WTVXNUORB5J7NT7F5AZ52DMW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning Techniques for Mixed Ensembles of Genetic Programming Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Ivo Gon\\c{c}alves, Leonardo Vanneschi, Luca Manzoni, Mauro Castelli","submitted_at":"2018-01-23T17:29:22Z","abstract_excerpt":"The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the variance and they usually generalize better than single models. Despite these advantages, building ensemble of GP models is not a well-developed topic in the evolutionary computation community. To fill this gap, we propose a strategy that blends individuals produced by standard syntax-based GP and individuals produced by geometric semantic genetic programmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07668","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-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUD0R6UOZrx/I7M9VSmw+kXTZ08/NMPdj7MBTnHk7mpI54cmxiCwDS5IbCLXip5aex1DjOIKoY4sn/2iNNeXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:04:39.045148Z"},"content_sha256":"10def18013b2e5d1bcbd0152d300ac5e97bde3b4d77418b532706a253e6f17e5","schema_version":"1.0","event_id":"sha256:10def18013b2e5d1bcbd0152d300ac5e97bde3b4d77418b532706a253e6f17e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WTVXNUORB5J7NT7F5AZ52DMW4/bundle.json","state_url":"https://pith.science/pith/5WTVXNUORB5J7NT7F5AZ52DMW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WTVXNUORB5J7NT7F5AZ52DMW4/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-03T14:04:39Z","links":{"resolver":"https://pith.science/pith/5WTVXNUORB5J7NT7F5AZ52DMW4","bundle":"https://pith.science/pith/5WTVXNUORB5J7NT7F5AZ52DMW4/bundle.json","state":"https://pith.science/pith/5WTVXNUORB5J7NT7F5AZ52DMW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WTVXNUORB5J7NT7F5AZ52DMW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5WTVXNUORB5J7NT7F5AZ52DMW4","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":"c2a0ea72c563dfa84277b7c1573998dcf42432f104feacd22c7db251ef3424a3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-23T17:29:22Z","title_canon_sha256":"5580bc1f8b06228bdd1e57b6e97e0562a83a715c699cee4f272b2b36e663ca87"},"schema_version":"1.0","source":{"id":"1801.07668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07668","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07668v1","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07668","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"5WTVXNUORB5J","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5WTVXNUORB5J7NT7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5WTVXNUO","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:10def18013b2e5d1bcbd0152d300ac5e97bde3b4d77418b532706a253e6f17e5","target":"graph","created_at":"2026-05-17T23:43:28Z","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":"The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the variance and they usually generalize better than single models. Despite these advantages, building ensemble of GP models is not a well-developed topic in the evolutionary computation community. To fill this gap, we propose a strategy that blends individuals produced by standard syntax-based GP and individuals produced by geometric semantic genetic programmi","authors_text":"Ivo Gon\\c{c}alves, Leonardo Vanneschi, Luca Manzoni, Mauro Castelli","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-23T17:29:22Z","title":"Pruning Techniques for Mixed Ensembles of Genetic Programming Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07668","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:c893978bc9dd125813e111da431ed4be843eca957e0f6138872ea741d8955acf","target":"record","created_at":"2026-05-17T23:43:28Z","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":"c2a0ea72c563dfa84277b7c1573998dcf42432f104feacd22c7db251ef3424a3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-23T17:29:22Z","title_canon_sha256":"5580bc1f8b06228bdd1e57b6e97e0562a83a715c699cee4f272b2b36e663ca87"},"schema_version":"1.0","source":{"id":"1801.07668","kind":"arxiv","version":1}},"canonical_sha256":"eda75bb68e887a9fb67f2f419ee86cb72844b3266423a1b67d657992ad058074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eda75bb68e887a9fb67f2f419ee86cb72844b3266423a1b67d657992ad058074","first_computed_at":"2026-05-17T23:43:28.540341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:28.540341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R+hbXZGYkj10gFTm/zjorix3XYFSBZPHwbBOWDttJrx26SHSD0IcDtSdy7rJS4Hh+/VMq1c5YxpLJSYAT9KiBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:28.540888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c893978bc9dd125813e111da431ed4be843eca957e0f6138872ea741d8955acf","sha256:10def18013b2e5d1bcbd0152d300ac5e97bde3b4d77418b532706a253e6f17e5"],"state_sha256":"b9a957a8e0de75c46c3cf52fcb1b6d8b4aeb3422a2916feab085a15a4ff26bef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOyU8myQqlgVBd0PIz5PzZJAqV5M88MIyhmVhAfDRi63MsFpKKpD9tRbd0b+RfzBRHH6eyXZaDm3mpqoE1X9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:04:39.047075Z","bundle_sha256":"673e664a27a54d5979f6bfac18efd589b4049430e7686b7477c6609e9f144485"}}