{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KN2KHGDJUZY3ZXA4WARTQL522O","short_pith_number":"pith:KN2KHGDJ","schema_version":"1.0","canonical_sha256":"5374a39869a671bcdc1cb023382fbad3b33d2d0f253e8b92d4433872e28219fb","source":{"kind":"arxiv","id":"1906.10179","version":1},"attestation_state":"computed","paper":{"title":"The Power of Unbiased Recursive Partitioning: A Unifying View of CTree, MOB, and GUIDE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Achim Zeileis, Lisa Schlosser, Torsten Hothorn","submitted_at":"2019-06-24T19:04:42Z","abstract_excerpt":"A core step of every algorithm for learning regression trees is the selection of the best splitting variable from the available covariates and the corresponding split point. Early tree algorithms (e.g., AID, CART) employed greedy search strategies, directly comparing all possible split points in all available covariates. However, subsequent research showed that this is biased towards selecting covariates with more potential split points. Therefore, unbiased recursive partitioning algorithms have been suggested (e.g., QUEST, GUIDE, CTree, MOB) that first select the covariate based on statistica"},"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":"1906.10179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-06-24T19:04:42Z","cross_cats_sorted":[],"title_canon_sha256":"0eb112a5b0f1a0565dc8117a9e361954cd922594ce86a98b8e8f64a4f86c3326","abstract_canon_sha256":"3d7e3dd1ad988fc1d8969c7774dbb32caa808a52621936df04ec2b2f675a7618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:32.017524Z","signature_b64":"imhtcXwl44QBcERq4/+VO6WK4At13V1JXm/pbiMry7lH2DTbRhFIZmU9TFukZ458TP+MmIDlSMjaZCA7yzIqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5374a39869a671bcdc1cb023382fbad3b33d2d0f253e8b92d4433872e28219fb","last_reissued_at":"2026-05-17T23:42:32.016929Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:32.016929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Unbiased Recursive Partitioning: A Unifying View of CTree, MOB, and GUIDE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Achim Zeileis, Lisa Schlosser, Torsten Hothorn","submitted_at":"2019-06-24T19:04:42Z","abstract_excerpt":"A core step of every algorithm for learning regression trees is the selection of the best splitting variable from the available covariates and the corresponding split point. Early tree algorithms (e.g., AID, CART) employed greedy search strategies, directly comparing all possible split points in all available covariates. However, subsequent research showed that this is biased towards selecting covariates with more potential split points. Therefore, unbiased recursive partitioning algorithms have been suggested (e.g., QUEST, GUIDE, CTree, MOB) that first select the covariate based on statistica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10179","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":"1906.10179","created_at":"2026-05-17T23:42:32.017013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10179v1","created_at":"2026-05-17T23:42:32.017013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10179","created_at":"2026-05-17T23:42:32.017013+00:00"},{"alias_kind":"pith_short_12","alias_value":"KN2KHGDJUZY3","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KN2KHGDJUZY3ZXA4","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KN2KHGDJ","created_at":"2026-05-18T12:33:21.387695+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/KN2KHGDJUZY3ZXA4WARTQL522O","json":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O.json","graph_json":"https://pith.science/api/pith-number/KN2KHGDJUZY3ZXA4WARTQL522O/graph.json","events_json":"https://pith.science/api/pith-number/KN2KHGDJUZY3ZXA4WARTQL522O/events.json","paper":"https://pith.science/paper/KN2KHGDJ"},"agent_actions":{"view_html":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O","download_json":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O.json","view_paper":"https://pith.science/paper/KN2KHGDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10179&json=true","fetch_graph":"https://pith.science/api/pith-number/KN2KHGDJUZY3ZXA4WARTQL522O/graph.json","fetch_events":"https://pith.science/api/pith-number/KN2KHGDJUZY3ZXA4WARTQL522O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O/action/storage_attestation","attest_author":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O/action/author_attestation","sign_citation":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O/action/citation_signature","submit_replication":"https://pith.science/pith/KN2KHGDJUZY3ZXA4WARTQL522O/action/replication_record"}},"created_at":"2026-05-17T23:42:32.017013+00:00","updated_at":"2026-05-17T23:42:32.017013+00:00"}