{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TJLUNSR3DYO3XTXZCYTC5OD4HL","short_pith_number":"pith:TJLUNSR3","schema_version":"1.0","canonical_sha256":"9a5746ca3b1e1dbbcef916262eb87c3af73def8da82e93ac6d8d000eae255cbf","source":{"kind":"arxiv","id":"2606.12840","version":1},"attestation_state":"computed","paper":{"title":"CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Hayden McTavish, Margo Seltzer, Varun Babbar, Yixiao Wang","submitted_at":"2026-06-11T03:07:51Z","abstract_excerpt":"Regression trees are among the most interpretable yet expressive model classes in machine learning. Historically, greedy induction has been the dominant approach for constructing well-performing regression trees. While optimal methods based on dynamic programming and branch-and-bound exist, they are computationally prohibitive for general linear regression trees, despite often achieving substantially better performance than greedy approaches. Recent work has shown that specialized lookahead strategies can dramatically improve runtime while maintaining near-optimal performance, primarily in cla"},"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":"2606.12840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-11T03:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"c0a9da4b8b7443bbdd84325423356bf1fdd320a88c47d37566495f938ccd2056","abstract_canon_sha256":"cb8d631072bad2038c89f22fa3d704ee1f16768c53da3f189d0ee487001abbb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:53.636246Z","signature_b64":"7hVBzInpYvItrARhnK+gRI/DeGgpbw6L8XQ5VksYJQRoS8oe+w7ep9wvxvkDVrJpv9x6QTjeSq3gxXVEkGk8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5746ca3b1e1dbbcef916262eb87c3af73def8da82e93ac6d8d000eae255cbf","last_reissued_at":"2026-06-12T01:08:53.635412Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:53.635412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Hayden McTavish, Margo Seltzer, Varun Babbar, Yixiao Wang","submitted_at":"2026-06-11T03:07:51Z","abstract_excerpt":"Regression trees are among the most interpretable yet expressive model classes in machine learning. Historically, greedy induction has been the dominant approach for constructing well-performing regression trees. While optimal methods based on dynamic programming and branch-and-bound exist, they are computationally prohibitive for general linear regression trees, despite often achieving substantially better performance than greedy approaches. Recent work has shown that specialized lookahead strategies can dramatically improve runtime while maintaining near-optimal performance, primarily in cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12840","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/2606.12840/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":"2606.12840","created_at":"2026-06-12T01:08:53.635544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12840v1","created_at":"2026-06-12T01:08:53.635544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12840","created_at":"2026-06-12T01:08:53.635544+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJLUNSR3DYO3","created_at":"2026-06-12T01:08:53.635544+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJLUNSR3DYO3XTXZ","created_at":"2026-06-12T01:08:53.635544+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJLUNSR3","created_at":"2026-06-12T01:08:53.635544+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/TJLUNSR3DYO3XTXZCYTC5OD4HL","json":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL.json","graph_json":"https://pith.science/api/pith-number/TJLUNSR3DYO3XTXZCYTC5OD4HL/graph.json","events_json":"https://pith.science/api/pith-number/TJLUNSR3DYO3XTXZCYTC5OD4HL/events.json","paper":"https://pith.science/paper/TJLUNSR3"},"agent_actions":{"view_html":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL","download_json":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL.json","view_paper":"https://pith.science/paper/TJLUNSR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12840&json=true","fetch_graph":"https://pith.science/api/pith-number/TJLUNSR3DYO3XTXZCYTC5OD4HL/graph.json","fetch_events":"https://pith.science/api/pith-number/TJLUNSR3DYO3XTXZCYTC5OD4HL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL/action/storage_attestation","attest_author":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL/action/author_attestation","sign_citation":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL/action/citation_signature","submit_replication":"https://pith.science/pith/TJLUNSR3DYO3XTXZCYTC5OD4HL/action/replication_record"}},"created_at":"2026-06-12T01:08:53.635544+00:00","updated_at":"2026-06-12T01:08:53.635544+00:00"}