{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O6KDPTGWCGO3D7PRN54QQMFOXM","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":"faa6c65bfab18539728338348dafff60cef1bd3f710fe1878b211f0ada7ed187","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T13:44:57Z","title_canon_sha256":"4aed1e4b83f3445f835ba02ea56cd0574fe9010a07215441a1a292792479146d"},"schema_version":"1.0","source":{"id":"1805.07592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07592","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07592v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07592","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"O6KDPTGWCGO3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O6KDPTGWCGO3D7PR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O6KDPTGW","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:4c5530589278c53a7fcf5356f073f02e84b4e73e9051009fd212022dac105907","target":"graph","created_at":"2026-05-18T00:15:33Z","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":"Boosted decision trees enjoy popularity in a variety of applications; however, for large-scale datasets, the cost of training a decision tree in each round can be prohibitively expensive. Inspired by ideas from the multi-arm bandit literature, we develop a highly efficient algorithm for computing exact greedy-optimal decision trees, outperforming the state-of-the-art Quick Boost method. We further develop a framework for deriving lower bounds on the problem that applies to a wide family of conceivable algorithms for the task (including our algorithm and Quick Boost), and we demonstrate empiric","authors_text":"Javed Aslam, Jesse Anderton, Maryam Aziz","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T13:44:57Z","title":"Adaptively Pruning Features for Boosted Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07592","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:f75caaa344da33b33136ff35998368ec31ba2afe9bf8a26405e00d12e26e3e58","target":"record","created_at":"2026-05-18T00:15:33Z","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":"faa6c65bfab18539728338348dafff60cef1bd3f710fe1878b211f0ada7ed187","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T13:44:57Z","title_canon_sha256":"4aed1e4b83f3445f835ba02ea56cd0574fe9010a07215441a1a292792479146d"},"schema_version":"1.0","source":{"id":"1805.07592","kind":"arxiv","version":1}},"canonical_sha256":"779437ccd6119db1fdf16f790830aebb04153a6d092effd417827435b9ab36c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"779437ccd6119db1fdf16f790830aebb04153a6d092effd417827435b9ab36c6","first_computed_at":"2026-05-18T00:15:33.121824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:33.121824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"If49uTUbKBSR1Fs55dd/d2FUigpZjxk67kINPg24dPsDe3m4cpv6MHmNbFfnIagtJmeFTsCUA4K/taZNtxvfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:33.122444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f75caaa344da33b33136ff35998368ec31ba2afe9bf8a26405e00d12e26e3e58","sha256:4c5530589278c53a7fcf5356f073f02e84b4e73e9051009fd212022dac105907"],"state_sha256":"b4822c006668295b0a9ab8b915f0a3f150b4c00dfeffe402ab552b9aad4800ce"}