{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JNIVQLACDGGN3YYH2SEEOT46WM","short_pith_number":"pith:JNIVQLAC","schema_version":"1.0","canonical_sha256":"4b51582c02198cdde307d488474f9eb30c2531c971b6e0bf919643755e7b9159","source":{"kind":"arxiv","id":"1410.6973","version":2},"attestation_state":"computed","paper":{"title":"Differentially- and non-differentially-private random decision trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, Krzysztof Choromanski, Mariusz Bojarski, Yann LeCun","submitted_at":"2014-10-26T00:16:16Z","abstract_excerpt":"We consider supervised learning with random decision trees, where the tree construction is completely random. The method is popularly used and works well in practice despite the simplicity of the setting, but its statistical mechanism is not yet well-understood. In this paper we provide strong theoretical guarantees regarding learning with random decision trees. We analyze and compare three different variants of the algorithm that have minimal memory requirements: majority voting, threshold averaging and probabilistic averaging. The random structure of the tree enables us to adapt these method"},"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":"1410.6973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-26T00:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"9fa69b7589f6b61553893e4c10be23aed5c02b8990dc74813a80c2b07d6ee07e","abstract_canon_sha256":"f89d84aceb2d9e5dec28bc79a68ce6f58efd4e81dcaa1bd1e6c184f4e1914c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:56.886188Z","signature_b64":"fkux/VIp6xH3tRIkwP6XSrJPKn/D00mdYNq87csLU3U8tgSs9QoLBxXxRbOSzgzOrNIBc7T94uFCszoeWwyACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b51582c02198cdde307d488474f9eb30c2531c971b6e0bf919643755e7b9159","last_reissued_at":"2026-05-18T02:27:56.885645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:56.885645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially- and non-differentially-private random decision trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, Krzysztof Choromanski, Mariusz Bojarski, Yann LeCun","submitted_at":"2014-10-26T00:16:16Z","abstract_excerpt":"We consider supervised learning with random decision trees, where the tree construction is completely random. The method is popularly used and works well in practice despite the simplicity of the setting, but its statistical mechanism is not yet well-understood. In this paper we provide strong theoretical guarantees regarding learning with random decision trees. We analyze and compare three different variants of the algorithm that have minimal memory requirements: majority voting, threshold averaging and probabilistic averaging. The random structure of the tree enables us to adapt these method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6973","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":"1410.6973","created_at":"2026-05-18T02:27:56.885721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6973v2","created_at":"2026-05-18T02:27:56.885721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6973","created_at":"2026-05-18T02:27:56.885721+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNIVQLACDGGN","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNIVQLACDGGN3YYH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNIVQLAC","created_at":"2026-05-18T12:28:33.132498+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/JNIVQLACDGGN3YYH2SEEOT46WM","json":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM.json","graph_json":"https://pith.science/api/pith-number/JNIVQLACDGGN3YYH2SEEOT46WM/graph.json","events_json":"https://pith.science/api/pith-number/JNIVQLACDGGN3YYH2SEEOT46WM/events.json","paper":"https://pith.science/paper/JNIVQLAC"},"agent_actions":{"view_html":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM","download_json":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM.json","view_paper":"https://pith.science/paper/JNIVQLAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6973&json=true","fetch_graph":"https://pith.science/api/pith-number/JNIVQLACDGGN3YYH2SEEOT46WM/graph.json","fetch_events":"https://pith.science/api/pith-number/JNIVQLACDGGN3YYH2SEEOT46WM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM/action/storage_attestation","attest_author":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM/action/author_attestation","sign_citation":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM/action/citation_signature","submit_replication":"https://pith.science/pith/JNIVQLACDGGN3YYH2SEEOT46WM/action/replication_record"}},"created_at":"2026-05-18T02:27:56.885721+00:00","updated_at":"2026-05-18T02:27:56.885721+00:00"}