{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OHQNTTMZS2ELYTYYR6ZNXUMF4A","short_pith_number":"pith:OHQNTTMZ","canonical_record":{"source":{"id":"2405.20622","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T05:18:05Z","cross_cats_sorted":[],"title_canon_sha256":"a5efc5e172e532cebf658eba0e64e2fbea9971e7a6318eda4a794d0d26a96c0f","abstract_canon_sha256":"ca4d7ec5dcc8f1a8798475c54bfee2d3d6d293c4a66dfe3dbf704331910b0d9e"},"schema_version":"1.0"},"canonical_sha256":"71e0d9cd999688bc4f188fb2dbd185e01b134e29035c655edde0b9cb77b09107","source":{"kind":"arxiv","id":"2405.20622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.20622","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.20622v2","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20622","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"pith_short_12","alias_value":"OHQNTTMZS2EL","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"OHQNTTMZS2ELYTYY","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"OHQNTTMZ","created_at":"2026-07-05T08:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OHQNTTMZS2ELYTYYR6ZNXUMF4A","target":"record","payload":{"canonical_record":{"source":{"id":"2405.20622","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T05:18:05Z","cross_cats_sorted":[],"title_canon_sha256":"a5efc5e172e532cebf658eba0e64e2fbea9971e7a6318eda4a794d0d26a96c0f","abstract_canon_sha256":"ca4d7ec5dcc8f1a8798475c54bfee2d3d6d293c4a66dfe3dbf704331910b0d9e"},"schema_version":"1.0"},"canonical_sha256":"71e0d9cd999688bc4f188fb2dbd185e01b134e29035c655edde0b9cb77b09107","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:09.373067Z","signature_b64":"oB0sT6VBT270QUmC3vBTWFvbUq93qy2t41WD38vmi39B0N9DPWOrx92YiCWgB5WDcm53l88jMbTRbYf1+84cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71e0d9cd999688bc4f188fb2dbd185e01b134e29035c655edde0b9cb77b09107","last_reissued_at":"2026-07-05T08:27:09.372591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:09.372591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.20622","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-07-05T08:27:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"raJxmLnSYybWMO14+0t4rOtTrzpArCj8ib8drSf//vKeuVIL+P6B3plBhqqYtlJQWqZMDpem0j/r1bsopA4VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:51:37.767577Z"},"content_sha256":"63ef7570c8157d371699ffcce8214752da6ea6d3ad6b67593c0e3bc8b8fd14ef","schema_version":"1.0","event_id":"sha256:63ef7570c8157d371699ffcce8214752da6ea6d3ad6b67593c0e3bc8b8fd14ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OHQNTTMZS2ELYTYYR6ZNXUMF4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superfast Selection for Decision Tree Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gopal Gupta, Huaduo Wang","submitted_at":"2024-05-31T05:18:05Z","abstract_excerpt":"We present a novel and systematic method, called Superfast Selection, for selecting the \"optimal split\" for decision tree and feature selection algorithms over tabular data. The method speeds up split selection on a single feature by lowering the time complexity, from O(MN) (using the standard selection methods) to O(M), where M represents the number of input examples and N the number of unique values. Additionally, the need for pre-encoding, such as one-hot or integer encoding, for feature value heterogeneity is eliminated. To demonstrate the efficiency of Superfast Selection, we empower the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20622","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.20622/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"},"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-07-05T08:27:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ph2K8OX2FrrhLoPDgPJUiKDoBgVBGymA9bIPdcqYACqxw69ohRHLiyVahlrUHAqigOTRuHkruA63TlIp/0ecAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:51:37.768484Z"},"content_sha256":"f361161dc9bb89b113fbd027d312431bc6efe7f0278ccad716048bb332aab898","schema_version":"1.0","event_id":"sha256:f361161dc9bb89b113fbd027d312431bc6efe7f0278ccad716048bb332aab898"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A/bundle.json","state_url":"https://pith.science/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A/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-08-21T17:51:37Z","links":{"resolver":"https://pith.science/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A","bundle":"https://pith.science/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A/bundle.json","state":"https://pith.science/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHQNTTMZS2ELYTYYR6ZNXUMF4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OHQNTTMZS2ELYTYYR6ZNXUMF4A","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":"ca4d7ec5dcc8f1a8798475c54bfee2d3d6d293c4a66dfe3dbf704331910b0d9e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T05:18:05Z","title_canon_sha256":"a5efc5e172e532cebf658eba0e64e2fbea9971e7a6318eda4a794d0d26a96c0f"},"schema_version":"1.0","source":{"id":"2405.20622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.20622","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.20622v2","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20622","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"pith_short_12","alias_value":"OHQNTTMZS2EL","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"OHQNTTMZS2ELYTYY","created_at":"2026-07-05T08:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"OHQNTTMZ","created_at":"2026-07-05T08:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:f361161dc9bb89b113fbd027d312431bc6efe7f0278ccad716048bb332aab898","target":"graph","created_at":"2026-07-05T08:27:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.20622/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a novel and systematic method, called Superfast Selection, for selecting the \"optimal split\" for decision tree and feature selection algorithms over tabular data. The method speeds up split selection on a single feature by lowering the time complexity, from O(MN) (using the standard selection methods) to O(M), where M represents the number of input examples and N the number of unique values. Additionally, the need for pre-encoding, such as one-hot or integer encoding, for feature value heterogeneity is eliminated. To demonstrate the efficiency of Superfast Selection, we empower the ","authors_text":"Gopal Gupta, Huaduo Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T05:18:05Z","title":"Superfast Selection for Decision Tree Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20622","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:63ef7570c8157d371699ffcce8214752da6ea6d3ad6b67593c0e3bc8b8fd14ef","target":"record","created_at":"2026-07-05T08:27:09Z","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":"ca4d7ec5dcc8f1a8798475c54bfee2d3d6d293c4a66dfe3dbf704331910b0d9e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T05:18:05Z","title_canon_sha256":"a5efc5e172e532cebf658eba0e64e2fbea9971e7a6318eda4a794d0d26a96c0f"},"schema_version":"1.0","source":{"id":"2405.20622","kind":"arxiv","version":2}},"canonical_sha256":"71e0d9cd999688bc4f188fb2dbd185e01b134e29035c655edde0b9cb77b09107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71e0d9cd999688bc4f188fb2dbd185e01b134e29035c655edde0b9cb77b09107","first_computed_at":"2026-07-05T08:27:09.372591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:09.372591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oB0sT6VBT270QUmC3vBTWFvbUq93qy2t41WD38vmi39B0N9DPWOrx92YiCWgB5WDcm53l88jMbTRbYf1+84cBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:09.373067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.20622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63ef7570c8157d371699ffcce8214752da6ea6d3ad6b67593c0e3bc8b8fd14ef","sha256:f361161dc9bb89b113fbd027d312431bc6efe7f0278ccad716048bb332aab898"],"state_sha256":"c347e61fcfeb14e0daad7e0c5b395ae97838ba95601fb2d059e92e060f9991cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPWeh2YFTd3s8ltC3Ud5+kAcIBC9gN7QTsDuM6VhMak9Mj3P8atwVUkrHizWPAn1PGKdSbWYZHfi9Wy+n98NDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:51:37.775313Z","bundle_sha256":"5123305e7356f223ff82726b30a404b9f504fa4c719b6985d296c25cbea7edba"}}