{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RMMLJ2IB6CH5EIY4NLOYVDSWIY","short_pith_number":"pith:RMMLJ2IB","canonical_record":{"source":{"id":"2302.03931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-08T08:11:10Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"f97353871fc0dda36639aa120d0b0ea39233b40c040a8e4918b564b2c2befec4","abstract_canon_sha256":"c4188e74a927bf8b41a6f2f216d057a0ae82b2765312098f9786f794bd15e9e8"},"schema_version":"1.0"},"canonical_sha256":"8b18b4e901f08fd2231c6add8a8e56461109dab173ecb64fd8eae9662ed2d38e","source":{"kind":"arxiv","id":"2302.03931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03931","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03931v1","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03931","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"RMMLJ2IB6CH5","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"pith_short_16","alias_value":"RMMLJ2IB6CH5EIY4","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"pith_short_8","alias_value":"RMMLJ2IB","created_at":"2026-07-05T08:41:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RMMLJ2IB6CH5EIY4NLOYVDSWIY","target":"record","payload":{"canonical_record":{"source":{"id":"2302.03931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-08T08:11:10Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"f97353871fc0dda36639aa120d0b0ea39233b40c040a8e4918b564b2c2befec4","abstract_canon_sha256":"c4188e74a927bf8b41a6f2f216d057a0ae82b2765312098f9786f794bd15e9e8"},"schema_version":"1.0"},"canonical_sha256":"8b18b4e901f08fd2231c6add8a8e56461109dab173ecb64fd8eae9662ed2d38e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:36.643356Z","signature_b64":"Wdt90SyA+9F/eObJy/x8MyU6h5kTJ7LDWF2NSSiN0Inejfn2zTFtkpzIJu/Dtgy5knQZ2JqUHadYd79Lr/vqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b18b4e901f08fd2231c6add8a8e56461109dab173ecb64fd8eae9662ed2d38e","last_reissued_at":"2026-07-05T08:41:36.642959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:36.642959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.03931","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-05T08:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmnMIs0nekb9i7YeGbz6/WBVxDo2B0sESK9H+xuodWsDIGhm5ZGjdij1VajdM2SlNmmDscMhJU2jTMC2m85xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:41:04.357182Z"},"content_sha256":"d50a1dd9e63b048e89ac82aa967516b49f5d7c56deb0f5ea7bc63562c96cfeae","schema_version":"1.0","event_id":"sha256:d50a1dd9e63b048e89ac82aa967516b49f5d7c56deb0f5ea7bc63562c96cfeae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RMMLJ2IB6CH5EIY4NLOYVDSWIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Linear Model Trees by PILOT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Jakob Raymaekers, Peter J. Rousseeuw, Ruicong Yao, Tim Verdonck","submitted_at":"2023-02-08T08:11:10Z","abstract_excerpt":"Linear model trees are regression trees that incorporate linear models in the leaf nodes. This preserves the intuitive interpretation of decision trees and at the same time enables them to better capture linear relationships, which is hard for standard decision trees. But most existing methods for fitting linear model trees are time consuming and therefore not scalable to large data sets. In addition, they are more prone to overfitting and extrapolation issues than standard regression trees. In this paper we introduce PILOT, a new algorithm for linear model trees that is fast, regularized, sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03931","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/2302.03931/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-05T08:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpA0iipHY6X2mkapGNPQo3+oaX9hUf586J6GiWCueRfYL8hubEEP52RYbAExpbnvqK4J5fpp3lswHag3nfs/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:41:04.357578Z"},"content_sha256":"12f9d2947cb916bb65249d0867c0e45b747eb319cb324c1f3bbbb4c13e4abf40","schema_version":"1.0","event_id":"sha256:12f9d2947cb916bb65249d0867c0e45b747eb319cb324c1f3bbbb4c13e4abf40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY/bundle.json","state_url":"https://pith.science/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY/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-08-19T13:41:04Z","links":{"resolver":"https://pith.science/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY","bundle":"https://pith.science/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY/bundle.json","state":"https://pith.science/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMMLJ2IB6CH5EIY4NLOYVDSWIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RMMLJ2IB6CH5EIY4NLOYVDSWIY","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":"c4188e74a927bf8b41a6f2f216d057a0ae82b2765312098f9786f794bd15e9e8","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-08T08:11:10Z","title_canon_sha256":"f97353871fc0dda36639aa120d0b0ea39233b40c040a8e4918b564b2c2befec4"},"schema_version":"1.0","source":{"id":"2302.03931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03931","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03931v1","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03931","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"RMMLJ2IB6CH5","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"pith_short_16","alias_value":"RMMLJ2IB6CH5EIY4","created_at":"2026-07-05T08:41:36Z"},{"alias_kind":"pith_short_8","alias_value":"RMMLJ2IB","created_at":"2026-07-05T08:41:36Z"}],"graph_snapshots":[{"event_id":"sha256:12f9d2947cb916bb65249d0867c0e45b747eb319cb324c1f3bbbb4c13e4abf40","target":"graph","created_at":"2026-07-05T08:41:36Z","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/2302.03931/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear model trees are regression trees that incorporate linear models in the leaf nodes. This preserves the intuitive interpretation of decision trees and at the same time enables them to better capture linear relationships, which is hard for standard decision trees. But most existing methods for fitting linear model trees are time consuming and therefore not scalable to large data sets. In addition, they are more prone to overfitting and extrapolation issues than standard regression trees. In this paper we introduce PILOT, a new algorithm for linear model trees that is fast, regularized, sta","authors_text":"Jakob Raymaekers, Peter J. Rousseeuw, Ruicong Yao, Tim Verdonck","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-08T08:11:10Z","title":"Fast Linear Model Trees by PILOT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03931","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:d50a1dd9e63b048e89ac82aa967516b49f5d7c56deb0f5ea7bc63562c96cfeae","target":"record","created_at":"2026-07-05T08:41:36Z","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":"c4188e74a927bf8b41a6f2f216d057a0ae82b2765312098f9786f794bd15e9e8","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-08T08:11:10Z","title_canon_sha256":"f97353871fc0dda36639aa120d0b0ea39233b40c040a8e4918b564b2c2befec4"},"schema_version":"1.0","source":{"id":"2302.03931","kind":"arxiv","version":1}},"canonical_sha256":"8b18b4e901f08fd2231c6add8a8e56461109dab173ecb64fd8eae9662ed2d38e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b18b4e901f08fd2231c6add8a8e56461109dab173ecb64fd8eae9662ed2d38e","first_computed_at":"2026-07-05T08:41:36.642959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:41:36.642959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wdt90SyA+9F/eObJy/x8MyU6h5kTJ7LDWF2NSSiN0Inejfn2zTFtkpzIJu/Dtgy5knQZ2JqUHadYd79Lr/vqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:41:36.643356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.03931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d50a1dd9e63b048e89ac82aa967516b49f5d7c56deb0f5ea7bc63562c96cfeae","sha256:12f9d2947cb916bb65249d0867c0e45b747eb319cb324c1f3bbbb4c13e4abf40"],"state_sha256":"2ae8d95d9de56bff8b6bb7eb27b72b2ade8dea953efc44de489a2a0b3331d9ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rX2ATAU+ul+aW3o24fH8smt/Q7dbW05ZaSkNsDUHdS3RAZsh1YeYIfDhwyocBy5YMRqlV6LBeq2y3iN/cIleBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:41:04.361371Z","bundle_sha256":"a386c59d425178adb5b8c423d9fbac56836554fd21734e9255cc91f64f84dce0"}}