{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C6MCWUS4LK2MTNSOSAOTIKT75Q","short_pith_number":"pith:C6MCWUS4","schema_version":"1.0","canonical_sha256":"17982b525c5ab4c9b64e901d342a7fec054a265c65342b427d4b51fe417a1b63","source":{"kind":"arxiv","id":"1712.06989","version":2},"attestation_state":"computed","paper":{"title":"A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianbo Ye","submitted_at":"2017-12-19T15:32:37Z","abstract_excerpt":"This short article presents a new implementation for decision trees. By introducing pre-sorted deques, the leaf-wise greedy tree growing strategy no longer needs to re-sort data at each node, and takes O(kn) time and O(1) extra memory locating the best split and branching. The consistent, superior performance - plus its simplicity and guarantee in producing the same classification results as the standard decision trees - makes the new implementation a drop-in replacement for depth-wise tree induction with strong performance."},"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":"1712.06989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T15:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"c68af66d7071bcf696fabdb587455bb49e5a0ff969e9c3dbe348929aea6962ec","abstract_canon_sha256":"3bcdcf7dad0929107e58b7e95f3e9f4a9a9cd5b5f96c6d3071a60740008d6c33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:31.326889Z","signature_b64":"L8/7M6ZFJwdygXPM0liXPZj00b3/ezBG4r153hQ9WNCNSMajh2GvA51EtYeknVIHYETUvNOfkBUje3Tw8X2oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17982b525c5ab4c9b64e901d342a7fec054a265c65342b427d4b51fe417a1b63","last_reissued_at":"2026-05-18T00:27:31.326154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:31.326154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianbo Ye","submitted_at":"2017-12-19T15:32:37Z","abstract_excerpt":"This short article presents a new implementation for decision trees. By introducing pre-sorted deques, the leaf-wise greedy tree growing strategy no longer needs to re-sort data at each node, and takes O(kn) time and O(1) extra memory locating the best split and branching. The consistent, superior performance - plus its simplicity and guarantee in producing the same classification results as the standard decision trees - makes the new implementation a drop-in replacement for depth-wise tree induction with strong performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06989","kind":"arxiv","version":2},"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":"1712.06989","created_at":"2026-05-18T00:27:31.326272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06989v2","created_at":"2026-05-18T00:27:31.326272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06989","created_at":"2026-05-18T00:27:31.326272+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6MCWUS4LK2M","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6MCWUS4LK2MTNSO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6MCWUS4","created_at":"2026-05-18T12:31:08.081275+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/C6MCWUS4LK2MTNSOSAOTIKT75Q","json":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q.json","graph_json":"https://pith.science/api/pith-number/C6MCWUS4LK2MTNSOSAOTIKT75Q/graph.json","events_json":"https://pith.science/api/pith-number/C6MCWUS4LK2MTNSOSAOTIKT75Q/events.json","paper":"https://pith.science/paper/C6MCWUS4"},"agent_actions":{"view_html":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q","download_json":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q.json","view_paper":"https://pith.science/paper/C6MCWUS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06989&json=true","fetch_graph":"https://pith.science/api/pith-number/C6MCWUS4LK2MTNSOSAOTIKT75Q/graph.json","fetch_events":"https://pith.science/api/pith-number/C6MCWUS4LK2MTNSOSAOTIKT75Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/action/storage_attestation","attest_author":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/action/author_attestation","sign_citation":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/action/citation_signature","submit_replication":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/action/replication_record"}},"created_at":"2026-05-18T00:27:31.326272+00:00","updated_at":"2026-05-18T00:27:31.326272+00:00"}