{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:D3TQWSAKBLLHFO5TZEKOZNLF6J","short_pith_number":"pith:D3TQWSAK","canonical_record":{"source":{"id":"2211.15621","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-11-28T18:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"6c44eb9ab912f51bab9f78f716ff118dda870f598c7f3b35b9e9fa8243ec8166","abstract_canon_sha256":"cc9fc323675f4fc3f7fc806c9ce451fe5eac839d93da9688623d866756f9b866"},"schema_version":"1.0"},"canonical_sha256":"1ee70b480a0ad672bbb3c914ecb565f25e49eca0408b7d1aec627f93d6af4c62","source":{"kind":"arxiv","id":"2211.15621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.15621","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"2211.15621v1","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15621","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"D3TQWSAKBLLH","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"pith_short_16","alias_value":"D3TQWSAKBLLHFO5T","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"pith_short_8","alias_value":"D3TQWSAK","created_at":"2026-07-05T07:15:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:D3TQWSAKBLLHFO5TZEKOZNLF6J","target":"record","payload":{"canonical_record":{"source":{"id":"2211.15621","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-11-28T18:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"6c44eb9ab912f51bab9f78f716ff118dda870f598c7f3b35b9e9fa8243ec8166","abstract_canon_sha256":"cc9fc323675f4fc3f7fc806c9ce451fe5eac839d93da9688623d866756f9b866"},"schema_version":"1.0"},"canonical_sha256":"1ee70b480a0ad672bbb3c914ecb565f25e49eca0408b7d1aec627f93d6af4c62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:49.782270Z","signature_b64":"QbIrTGohDzsy8N2a9gN7lgyx2YwEQ7B1LXjr65tAmSxM7WFA7pupM0Cu9oWOHQHV9GJ6LYrGl+qBaEiCxDegBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee70b480a0ad672bbb3c914ecb565f25e49eca0408b7d1aec627f93d6af4c62","last_reissued_at":"2026-07-05T07:15:49.781745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:49.781745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.15621","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-07-05T07:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWy90qLKjaGOuewsTPecBkPKcrz1AAC6+IC+9No29du/V+6NDdH7BI2d++cQwd8Gr6AtsMIAlmAOGLEI7exvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T05:35:06.312963Z"},"content_sha256":"40bd2f9502992b489e85f2e9ef6140717e31f767e5383777f88454c757b20e62","schema_version":"1.0","event_id":"sha256:40bd2f9502992b489e85f2e9ef6140717e31f767e5383777f88454c757b20e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:D3TQWSAKBLLHFO5TZEKOZNLF6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Boosting Approach to Constructing an Ensemble Stack","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andrew Johnston, Brad Niblett, Jeffrey Schwartzentruber, Malcolm Heywood, Nur Zincir-Heywood, Zhilei Zhou, Ziyu Qiu","submitted_at":"2022-11-28T18:21:36Z","abstract_excerpt":"An approach to evolutionary ensemble learning for classification is proposed in which boosting is used to construct a stack of programs. Each application of boosting identifies a single champion and a residual dataset, i.e. the training records that thus far were not correctly classified. The next program is only trained against the residual, with the process iterating until some maximum ensemble size or no further residual remains. Training against a residual dataset actively reduces the cost of training. Deploying the ensemble as a stack also means that only one classifier might be necessary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15621","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.15621/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyh5oWQWfmndTGScptzD9gJ6ddD+bjBKwdaNapRk+a3ZSWLJyyitgdEhps1k2+5tkeNYrdTOOCp7bHdkDY0+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T05:35:06.313346Z"},"content_sha256":"64bf65e7737b8d14b53fc97c9c3f32b6103e3197060b8b6e3877f7c3009ce34c","schema_version":"1.0","event_id":"sha256:64bf65e7737b8d14b53fc97c9c3f32b6103e3197060b8b6e3877f7c3009ce34c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J/bundle.json","state_url":"https://pith.science/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J/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-07-27T05:35:06Z","links":{"resolver":"https://pith.science/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J","bundle":"https://pith.science/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J/bundle.json","state":"https://pith.science/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3TQWSAKBLLHFO5TZEKOZNLF6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:D3TQWSAKBLLHFO5TZEKOZNLF6J","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":"cc9fc323675f4fc3f7fc806c9ce451fe5eac839d93da9688623d866756f9b866","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-11-28T18:21:36Z","title_canon_sha256":"6c44eb9ab912f51bab9f78f716ff118dda870f598c7f3b35b9e9fa8243ec8166"},"schema_version":"1.0","source":{"id":"2211.15621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.15621","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"2211.15621v1","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15621","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"D3TQWSAKBLLH","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"pith_short_16","alias_value":"D3TQWSAKBLLHFO5T","created_at":"2026-07-05T07:15:49Z"},{"alias_kind":"pith_short_8","alias_value":"D3TQWSAK","created_at":"2026-07-05T07:15:49Z"}],"graph_snapshots":[{"event_id":"sha256:64bf65e7737b8d14b53fc97c9c3f32b6103e3197060b8b6e3877f7c3009ce34c","target":"graph","created_at":"2026-07-05T07:15:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.15621/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An approach to evolutionary ensemble learning for classification is proposed in which boosting is used to construct a stack of programs. Each application of boosting identifies a single champion and a residual dataset, i.e. the training records that thus far were not correctly classified. The next program is only trained against the residual, with the process iterating until some maximum ensemble size or no further residual remains. Training against a residual dataset actively reduces the cost of training. Deploying the ensemble as a stack also means that only one classifier might be necessary","authors_text":"Andrew Johnston, Brad Niblett, Jeffrey Schwartzentruber, Malcolm Heywood, Nur Zincir-Heywood, Zhilei Zhou, Ziyu Qiu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-11-28T18:21:36Z","title":"A Boosting Approach to Constructing an Ensemble Stack"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15621","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:40bd2f9502992b489e85f2e9ef6140717e31f767e5383777f88454c757b20e62","target":"record","created_at":"2026-07-05T07:15:49Z","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":"cc9fc323675f4fc3f7fc806c9ce451fe5eac839d93da9688623d866756f9b866","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-11-28T18:21:36Z","title_canon_sha256":"6c44eb9ab912f51bab9f78f716ff118dda870f598c7f3b35b9e9fa8243ec8166"},"schema_version":"1.0","source":{"id":"2211.15621","kind":"arxiv","version":1}},"canonical_sha256":"1ee70b480a0ad672bbb3c914ecb565f25e49eca0408b7d1aec627f93d6af4c62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee70b480a0ad672bbb3c914ecb565f25e49eca0408b7d1aec627f93d6af4c62","first_computed_at":"2026-07-05T07:15:49.781745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:15:49.781745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QbIrTGohDzsy8N2a9gN7lgyx2YwEQ7B1LXjr65tAmSxM7WFA7pupM0Cu9oWOHQHV9GJ6LYrGl+qBaEiCxDegBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:15:49.782270Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.15621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40bd2f9502992b489e85f2e9ef6140717e31f767e5383777f88454c757b20e62","sha256:64bf65e7737b8d14b53fc97c9c3f32b6103e3197060b8b6e3877f7c3009ce34c"],"state_sha256":"676937f13e8791122fd2c611d8c7642593803e840da2022200fc88e338596d0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xwMiYQvTfeEqKBZGtxJUBWrRqeNL2JdwcVjTnn80kfGpSGHtQFdLg17r4V6gTQUP8KNWJJ070ASbqsF/5GrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-27T05:35:06.315459Z","bundle_sha256":"975b249824b3d25006e82566ff0b336816cb014e126b27e152766ea0541ccf06"}}