{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I6CHOLKD5VFSPWYYUVBL56DSAE","short_pith_number":"pith:I6CHOLKD","schema_version":"1.0","canonical_sha256":"4784772d43ed4b27db18a542bef8720113123520ea40a0e9497d58a05d22c98d","source":{"kind":"arxiv","id":"2506.20814","version":1},"attestation_state":"computed","paper":{"title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Kozak, Antoni Zajko, Dawid P{\\l}udowski, Jakub Piwko, J\\k{e}drzej Ruci\\'nski, Katarzyna Wo\\'znica, Mateusz Zacharecki, Patryzja \\.Zak","submitted_at":"2025-06-25T20:26:04Z","abstract_excerpt":"Ensemble learning has proven effective in boosting predictive performance, but traditional methods such as bagging, boosting, and dynamic ensemble selection (DES) suffer from high computational cost and limited adaptability to heterogeneous data distributions. To address these limitations, we propose Hellsemble, a novel and interpretable ensemble framework for binary classification that leverages dataset complexity during both training and inference. Hellsemble incrementally partitions the dataset into circles of difficulty by iteratively passing misclassified instances from simpler models to "},"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":"2506.20814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-25T20:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"776ea4499c1c1d5daf8489a979c70c4b9d213e65e767f5e5cc7ac47bcd93a52e","abstract_canon_sha256":"5d6f4f135af2252d5bfd5a375f2c16e592734499b55f85345647ef1c80208fd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:34.570767Z","signature_b64":"dqTbG8oKrWA9LMbGACrKbOFIjVIShH7KwK2lDBHxYK412PMjrx0NaVcf2chIn4GNRbSomljyYJIkaHe2PfhmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4784772d43ed4b27db18a542bef8720113123520ea40a0e9497d58a05d22c98d","last_reissued_at":"2026-07-05T11:27:34.570278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:34.570278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Kozak, Antoni Zajko, Dawid P{\\l}udowski, Jakub Piwko, J\\k{e}drzej Ruci\\'nski, Katarzyna Wo\\'znica, Mateusz Zacharecki, Patryzja \\.Zak","submitted_at":"2025-06-25T20:26:04Z","abstract_excerpt":"Ensemble learning has proven effective in boosting predictive performance, but traditional methods such as bagging, boosting, and dynamic ensemble selection (DES) suffer from high computational cost and limited adaptability to heterogeneous data distributions. To address these limitations, we propose Hellsemble, a novel and interpretable ensemble framework for binary classification that leverages dataset complexity during both training and inference. Hellsemble incrementally partitions the dataset into circles of difficulty by iteratively passing misclassified instances from simpler models to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20814","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/2506.20814/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.20814","created_at":"2026-07-05T11:27:34.570336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20814v1","created_at":"2026-07-05T11:27:34.570336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20814","created_at":"2026-07-05T11:27:34.570336+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6CHOLKD5VFS","created_at":"2026-07-05T11:27:34.570336+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6CHOLKD5VFSPWYY","created_at":"2026-07-05T11:27:34.570336+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6CHOLKD","created_at":"2026-07-05T11:27:34.570336+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/I6CHOLKD5VFSPWYYUVBL56DSAE","json":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE.json","graph_json":"https://pith.science/api/pith-number/I6CHOLKD5VFSPWYYUVBL56DSAE/graph.json","events_json":"https://pith.science/api/pith-number/I6CHOLKD5VFSPWYYUVBL56DSAE/events.json","paper":"https://pith.science/paper/I6CHOLKD"},"agent_actions":{"view_html":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE","download_json":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE.json","view_paper":"https://pith.science/paper/I6CHOLKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20814&json=true","fetch_graph":"https://pith.science/api/pith-number/I6CHOLKD5VFSPWYYUVBL56DSAE/graph.json","fetch_events":"https://pith.science/api/pith-number/I6CHOLKD5VFSPWYYUVBL56DSAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE/action/storage_attestation","attest_author":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE/action/author_attestation","sign_citation":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE/action/citation_signature","submit_replication":"https://pith.science/pith/I6CHOLKD5VFSPWYYUVBL56DSAE/action/replication_record"}},"created_at":"2026-07-05T11:27:34.570336+00:00","updated_at":"2026-07-05T11:27:34.570336+00:00"}