{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AEPWUQNUDUJNHCXBPMSYY2SLXE","short_pith_number":"pith:AEPWUQNU","schema_version":"1.0","canonical_sha256":"011f6a41b41d12d38ae17b258c6a4bb90ab3c6262867c62b89c6696cb3c117bf","source":{"kind":"arxiv","id":"1701.02110","version":2},"attestation_state":"computed","paper":{"title":"Transformation Forests","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Achim Zeileis, Torsten Hothorn","submitted_at":"2017-01-09T09:52:03Z","abstract_excerpt":"Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and visualisation. Information about the whole underlying conditional distribution is, however, not available from these models. A more general understanding of regression models as models for conditional distributions allows much broader inference from such models, for example the computation of prediction intervals. Several random forest-type algorithms aim at est"},"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":"1701.02110","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2017-01-09T09:52:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fd01e23253f0086bb9cdd69f26fd1b0ee78a91b4136fea043f10c22205a8cda2","abstract_canon_sha256":"b28610bb587ba5b570445c6ff8211f77f9a8b3fde34e150ab18c70931c1d92d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:37.453327Z","signature_b64":"wjP92ASEqYt9BFLzFzgeRTbVvySO4IZOQt+GwGSByVJEbJkyXTi7+asu7UloZCmqayTeyIlaSRlM9pLZLpwpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"011f6a41b41d12d38ae17b258c6a4bb90ab3c6262867c62b89c6696cb3c117bf","last_reissued_at":"2026-05-18T00:26:37.452664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:37.452664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformation Forests","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Achim Zeileis, Torsten Hothorn","submitted_at":"2017-01-09T09:52:03Z","abstract_excerpt":"Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and visualisation. Information about the whole underlying conditional distribution is, however, not available from these models. A more general understanding of regression models as models for conditional distributions allows much broader inference from such models, for example the computation of prediction intervals. Several random forest-type algorithms aim at est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02110","kind":"arxiv","version":2},"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":"1701.02110","created_at":"2026-05-18T00:26:37.452775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02110v2","created_at":"2026-05-18T00:26:37.452775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02110","created_at":"2026-05-18T00:26:37.452775+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEPWUQNUDUJN","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEPWUQNUDUJNHCXB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEPWUQNU","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10179","citing_title":"The Power of Unbiased Recursive Partitioning: A Unifying View of CTree, MOB, and GUIDE","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE","json":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE.json","graph_json":"https://pith.science/api/pith-number/AEPWUQNUDUJNHCXBPMSYY2SLXE/graph.json","events_json":"https://pith.science/api/pith-number/AEPWUQNUDUJNHCXBPMSYY2SLXE/events.json","paper":"https://pith.science/paper/AEPWUQNU"},"agent_actions":{"view_html":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE","download_json":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE.json","view_paper":"https://pith.science/paper/AEPWUQNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02110&json=true","fetch_graph":"https://pith.science/api/pith-number/AEPWUQNUDUJNHCXBPMSYY2SLXE/graph.json","fetch_events":"https://pith.science/api/pith-number/AEPWUQNUDUJNHCXBPMSYY2SLXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE/action/storage_attestation","attest_author":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE/action/author_attestation","sign_citation":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE/action/citation_signature","submit_replication":"https://pith.science/pith/AEPWUQNUDUJNHCXBPMSYY2SLXE/action/replication_record"}},"created_at":"2026-05-18T00:26:37.452775+00:00","updated_at":"2026-05-18T00:26:37.452775+00:00"}