{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O6KDPTGWCGO3D7PRN54QQMFOXM","short_pith_number":"pith:O6KDPTGW","schema_version":"1.0","canonical_sha256":"779437ccd6119db1fdf16f790830aebb04153a6d092effd417827435b9ab36c6","source":{"kind":"arxiv","id":"1805.07592","version":1},"attestation_state":"computed","paper":{"title":"Adaptively Pruning Features for Boosted Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Javed Aslam, Jesse Anderton, Maryam Aziz","submitted_at":"2018-05-19T13:44:57Z","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"},"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":"1805.07592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T13:44:57Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4aed1e4b83f3445f835ba02ea56cd0574fe9010a07215441a1a292792479146d","abstract_canon_sha256":"faa6c65bfab18539728338348dafff60cef1bd3f710fe1878b211f0ada7ed187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.122444Z","signature_b64":"If49uTUbKBSR1Fs55dd/d2FUigpZjxk67kINPg24dPsDe3m4cpv6MHmNbFfnIagtJmeFTsCUA4K/taZNtxvfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779437ccd6119db1fdf16f790830aebb04153a6d092effd417827435b9ab36c6","last_reissued_at":"2026-05-18T00:15:33.121824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.121824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptively Pruning Features for Boosted Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Javed Aslam, Jesse Anderton, Maryam Aziz","submitted_at":"2018-05-19T13:44:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07592","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07592","created_at":"2026-05-18T00:15:33.121904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07592v1","created_at":"2026-05-18T00:15:33.121904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07592","created_at":"2026-05-18T00:15:33.121904+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6KDPTGWCGO3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6KDPTGWCGO3D7PR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6KDPTGW","created_at":"2026-05-18T12:32:43.782077+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/O6KDPTGWCGO3D7PRN54QQMFOXM","json":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM.json","graph_json":"https://pith.science/api/pith-number/O6KDPTGWCGO3D7PRN54QQMFOXM/graph.json","events_json":"https://pith.science/api/pith-number/O6KDPTGWCGO3D7PRN54QQMFOXM/events.json","paper":"https://pith.science/paper/O6KDPTGW"},"agent_actions":{"view_html":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM","download_json":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM.json","view_paper":"https://pith.science/paper/O6KDPTGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07592&json=true","fetch_graph":"https://pith.science/api/pith-number/O6KDPTGWCGO3D7PRN54QQMFOXM/graph.json","fetch_events":"https://pith.science/api/pith-number/O6KDPTGWCGO3D7PRN54QQMFOXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM/action/storage_attestation","attest_author":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM/action/author_attestation","sign_citation":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM/action/citation_signature","submit_replication":"https://pith.science/pith/O6KDPTGWCGO3D7PRN54QQMFOXM/action/replication_record"}},"created_at":"2026-05-18T00:15:33.121904+00:00","updated_at":"2026-05-18T00:15:33.121904+00:00"}