{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BDR7PXKQK3NYYA34YJ7ZU35KZN","short_pith_number":"pith:BDR7PXKQ","canonical_record":{"source":{"id":"1907.00275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T20:34:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7cbafb5ca2d675245e5a953007961ad4ead3d02ab733b5ccce4370e3664a0cd0","abstract_canon_sha256":"b316d8098c77c7f6bb6d23899846f365ccc033286d8175f0388fa3f695e20b0c"},"schema_version":"1.0"},"canonical_sha256":"08e3f7dd5056db8c037cc27f9a6faacb5e792824624f95fee206d8fe12bf1720","source":{"kind":"arxiv","id":"1907.00275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00275","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00275v1","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00275","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"BDR7PXKQK3NY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BDR7PXKQK3NYYA34","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BDR7PXKQ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BDR7PXKQK3NYYA34YJ7ZU35KZN","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T20:34:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7cbafb5ca2d675245e5a953007961ad4ead3d02ab733b5ccce4370e3664a0cd0","abstract_canon_sha256":"b316d8098c77c7f6bb6d23899846f365ccc033286d8175f0388fa3f695e20b0c"},"schema_version":"1.0"},"canonical_sha256":"08e3f7dd5056db8c037cc27f9a6faacb5e792824624f95fee206d8fe12bf1720","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.251644Z","signature_b64":"HCijnsU0KFQyFJAzdh2NRkR6r7OPR6vnakHQMegsYmDrUi7YuVfg51HEN9xbGYIjNe2o9R9oQzbKWlA6MAMmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e3f7dd5056db8c037cc27f9a6faacb5e792824624f95fee206d8fe12bf1720","last_reissued_at":"2026-05-17T23:41:52.251034Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.251034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00275","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-05-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwgTP28veeTSVO/7xGOdXtIvICDrcqXOPO/5tzlMaEJQnE5EHTzk77IEMJjh5FLMlN3LTGCsxvfyUehJ0ey7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:49:51.044095Z"},"content_sha256":"381a7fafa6e5db3b89ef85d561bc337e5de821def20dd5acca62fdbae4f44f32","schema_version":"1.0","event_id":"sha256:381a7fafa6e5db3b89ef85d561bc337e5de821def20dd5acca62fdbae4f44f32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BDR7PXKQK3NYYA34YJ7ZU35KZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Regularized Piecewise-Linear Regression Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gilles Blanchard, Leonidas Lefakis, Oleksandr Zadorozhnyi","submitted_at":"2019-06-29T20:34:06Z","abstract_excerpt":"We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on Rademacher complexity framework, we present new high-probability upper bounds for the generalization error for the proposed classes of regularized regression decision tree algorithms, including LASSO-type, and $\\ell_{2}$ regularization for linear models at the leaves. Theoretical result are further extended by considering a general type of variable selection p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00275","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"},"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-05-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1s6fCLtus7chJ3EKvy0xoOv0HEgwm2cV3Zw5AhvMVXnnkTzfKWEsCZp/3HvgwG6xdLGr9Gp9pcc2KA5fbbviBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:49:51.044448Z"},"content_sha256":"0c3e7928e87cedbd15a078fdf108dc50ffa50d8a32a7ff4ee82a289bae0f828d","schema_version":"1.0","event_id":"sha256:0c3e7928e87cedbd15a078fdf108dc50ffa50d8a32a7ff4ee82a289bae0f828d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN/bundle.json","state_url":"https://pith.science/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN/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-06-28T13:49:51Z","links":{"resolver":"https://pith.science/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN","bundle":"https://pith.science/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN/bundle.json","state":"https://pith.science/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDR7PXKQK3NYYA34YJ7ZU35KZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BDR7PXKQK3NYYA34YJ7ZU35KZN","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":"b316d8098c77c7f6bb6d23899846f365ccc033286d8175f0388fa3f695e20b0c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T20:34:06Z","title_canon_sha256":"7cbafb5ca2d675245e5a953007961ad4ead3d02ab733b5ccce4370e3664a0cd0"},"schema_version":"1.0","source":{"id":"1907.00275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00275","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00275v1","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00275","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"BDR7PXKQK3NY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BDR7PXKQK3NYYA34","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BDR7PXKQ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:0c3e7928e87cedbd15a078fdf108dc50ffa50d8a32a7ff4ee82a289bae0f828d","target":"graph","created_at":"2026-05-17T23:41:52Z","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"},"paper":{"abstract_excerpt":"We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on Rademacher complexity framework, we present new high-probability upper bounds for the generalization error for the proposed classes of regularized regression decision tree algorithms, including LASSO-type, and $\\ell_{2}$ regularization for linear models at the leaves. Theoretical result are further extended by considering a general type of variable selection p","authors_text":"Gilles Blanchard, Leonidas Lefakis, Oleksandr Zadorozhnyi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T20:34:06Z","title":"Efficient Regularized Piecewise-Linear Regression Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00275","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:381a7fafa6e5db3b89ef85d561bc337e5de821def20dd5acca62fdbae4f44f32","target":"record","created_at":"2026-05-17T23:41:52Z","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":"b316d8098c77c7f6bb6d23899846f365ccc033286d8175f0388fa3f695e20b0c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-29T20:34:06Z","title_canon_sha256":"7cbafb5ca2d675245e5a953007961ad4ead3d02ab733b5ccce4370e3664a0cd0"},"schema_version":"1.0","source":{"id":"1907.00275","kind":"arxiv","version":1}},"canonical_sha256":"08e3f7dd5056db8c037cc27f9a6faacb5e792824624f95fee206d8fe12bf1720","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08e3f7dd5056db8c037cc27f9a6faacb5e792824624f95fee206d8fe12bf1720","first_computed_at":"2026-05-17T23:41:52.251034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:52.251034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HCijnsU0KFQyFJAzdh2NRkR6r7OPR6vnakHQMegsYmDrUi7YuVfg51HEN9xbGYIjNe2o9R9oQzbKWlA6MAMmAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:52.251644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:381a7fafa6e5db3b89ef85d561bc337e5de821def20dd5acca62fdbae4f44f32","sha256:0c3e7928e87cedbd15a078fdf108dc50ffa50d8a32a7ff4ee82a289bae0f828d"],"state_sha256":"5725704bf0098d84587697251426bf447d9676aded82e0b2fd128ce03580eb72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxznoiNbUf/CWeCxbOCkDW0QNCYq9B7r+HMBygCD92OmnvvLgfo+3H422r7I58VwyJHJNS2mCyyiQQVCm54IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:49:51.046282Z","bundle_sha256":"701fab03a8b64bab85f2ccb0e7ea39c8a819424658915c3927c3693d3b30fff8"}}