{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C6MCWUS4LK2MTNSOSAOTIKT75Q","short_pith_number":"pith:C6MCWUS4","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"},"canonical_sha256":"17982b525c5ab4c9b64e901d342a7fec054a265c65342b427d4b51fe417a1b63","source":{"kind":"arxiv","id":"1712.06989","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06989","created_at":"2026-05-18T00:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06989v2","created_at":"2026-05-18T00:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06989","created_at":"2026-05-18T00:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"C6MCWUS4LK2M","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C6MCWUS4LK2MTNSO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C6MCWUS4","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C6MCWUS4LK2MTNSOSAOTIKT75Q","target":"record","payload":{"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"},"canonical_sha256":"17982b525c5ab4c9b64e901d342a7fec054a265c65342b427d4b51fe417a1b63","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"},"source_kind":"arxiv","source_id":"1712.06989","source_version":2,"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-18T00:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XquJVAjFRyVhnr7jMLyIhs/SlkOKpIKEzGeeBKis7P47L9Dg2dtKuHnBrjtb2OndIxJ3JNE0w6XlnmNnv49DAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:41:17.590531Z"},"content_sha256":"e57723d4df7a025e7d0294d617fd25550b62272d7ffda827a944f14a504a22c3","schema_version":"1.0","event_id":"sha256:e57723d4df7a025e7d0294d617fd25550b62272d7ffda827a944f14a504a22c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C6MCWUS4LK2MTNSOSAOTIKT75Q","target":"graph","payload":{"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"},"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-18T00:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwjI4Nw3x4Nk0A8LRIp2Ex5jB14LYkG79TjNI+xiRXRjUEkIruoljjsT61mvaw8EzkBHIs0/NYwQVj/HG/EXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:41:17.590878Z"},"content_sha256":"7acc87c154faa7645ea79ab47560047b9003011de24c8048e648e226499de561","schema_version":"1.0","event_id":"sha256:7acc87c154faa7645ea79ab47560047b9003011de24c8048e648e226499de561"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/bundle.json","state_url":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/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-04T01:41:17Z","links":{"resolver":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q","bundle":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/bundle.json","state":"https://pith.science/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6MCWUS4LK2MTNSOSAOTIKT75Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C6MCWUS4LK2MTNSOSAOTIKT75Q","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":"3bcdcf7dad0929107e58b7e95f3e9f4a9a9cd5b5f96c6d3071a60740008d6c33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T15:32:37Z","title_canon_sha256":"c68af66d7071bcf696fabdb587455bb49e5a0ff969e9c3dbe348929aea6962ec"},"schema_version":"1.0","source":{"id":"1712.06989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06989","created_at":"2026-05-18T00:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06989v2","created_at":"2026-05-18T00:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06989","created_at":"2026-05-18T00:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"C6MCWUS4LK2M","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C6MCWUS4LK2MTNSO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C6MCWUS4","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:7acc87c154faa7645ea79ab47560047b9003011de24c8048e648e226499de561","target":"graph","created_at":"2026-05-18T00:27:31Z","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":"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.","authors_text":"Jianbo Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T15:32:37Z","title":"A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06989","kind":"arxiv","version":2},"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:e57723d4df7a025e7d0294d617fd25550b62272d7ffda827a944f14a504a22c3","target":"record","created_at":"2026-05-18T00:27:31Z","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":"3bcdcf7dad0929107e58b7e95f3e9f4a9a9cd5b5f96c6d3071a60740008d6c33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T15:32:37Z","title_canon_sha256":"c68af66d7071bcf696fabdb587455bb49e5a0ff969e9c3dbe348929aea6962ec"},"schema_version":"1.0","source":{"id":"1712.06989","kind":"arxiv","version":2}},"canonical_sha256":"17982b525c5ab4c9b64e901d342a7fec054a265c65342b427d4b51fe417a1b63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17982b525c5ab4c9b64e901d342a7fec054a265c65342b427d4b51fe417a1b63","first_computed_at":"2026-05-18T00:27:31.326154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:31.326154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L8/7M6ZFJwdygXPM0liXPZj00b3/ezBG4r153hQ9WNCNSMajh2GvA51EtYeknVIHYETUvNOfkBUje3Tw8X2oCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:31.326889Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e57723d4df7a025e7d0294d617fd25550b62272d7ffda827a944f14a504a22c3","sha256:7acc87c154faa7645ea79ab47560047b9003011de24c8048e648e226499de561"],"state_sha256":"bfbd6fe7c57c662ed219ebaa51de79228413abb3152c54ad0d5579a4e8de9485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dzPUMhWYiGdPKZsxMcGV5oJAQqjF0sKMUt8k/RdN7QQxJAyjJ8vf/vaWWkgBgONN/5YSqTxZN4Y+3blIw4cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:41:17.593021Z","bundle_sha256":"1a6aeaf237953f3a94abfa1003397d86298be90e9f1b346170858e2b0a21c1b2"}}