{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LGNN24DB6ZCEIR3WMWID6YP47W","short_pith_number":"pith:LGNN24DB","schema_version":"1.0","canonical_sha256":"599add7061f64444477665903f61fcfd8cade9f15848e80dfa2f6525d5a3e3ce","source":{"kind":"arxiv","id":"1412.6388","version":1},"attestation_state":"computed","paper":{"title":"Distributed Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ethem Alpayd{\\i}n, Ozan \\.Irsoy","submitted_at":"2014-12-19T15:44:02Z","abstract_excerpt":"Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly trained with backpropagation, like a neural network. Even though this continuity allows it to be used in hierarchical representation learning, the learned representations are local: Activation makes a soft selection among all root-to-leaf paths in a tree. In this work we extend the budding tree and propose the distributed tree where the children use different"},"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":"1412.6388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-19T15:44:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f2bd7c38e9479d6a2e8eb7ddb4d3f2679ec142640783c64e996805f8de041666","abstract_canon_sha256":"9db10f473bf148778360372c30324adf3866df5aaf6e345a875b92e2119c4a76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.617435Z","signature_b64":"JN5kaMjJoB4sEnp98dnom8Q8omgkpA4HAy7zFLu5dOOOnzy4RUwM1N4LXKxAEyOs3maxxigStIerGSebuM0cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"599add7061f64444477665903f61fcfd8cade9f15848e80dfa2f6525d5a3e3ce","last_reissued_at":"2026-05-18T02:30:53.616929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.616929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ethem Alpayd{\\i}n, Ozan \\.Irsoy","submitted_at":"2014-12-19T15:44:02Z","abstract_excerpt":"Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly trained with backpropagation, like a neural network. Even though this continuity allows it to be used in hierarchical representation learning, the learned representations are local: Activation makes a soft selection among all root-to-leaf paths in a tree. In this work we extend the budding tree and propose the distributed tree where the children use different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6388","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":"1412.6388","created_at":"2026-05-18T02:30:53.616995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6388v1","created_at":"2026-05-18T02:30:53.616995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6388","created_at":"2026-05-18T02:30:53.616995+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGNN24DB6ZCE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGNN24DB6ZCEIR3W","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGNN24DB","created_at":"2026-05-18T12:28:38.356838+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/LGNN24DB6ZCEIR3WMWID6YP47W","json":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W.json","graph_json":"https://pith.science/api/pith-number/LGNN24DB6ZCEIR3WMWID6YP47W/graph.json","events_json":"https://pith.science/api/pith-number/LGNN24DB6ZCEIR3WMWID6YP47W/events.json","paper":"https://pith.science/paper/LGNN24DB"},"agent_actions":{"view_html":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W","download_json":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W.json","view_paper":"https://pith.science/paper/LGNN24DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6388&json=true","fetch_graph":"https://pith.science/api/pith-number/LGNN24DB6ZCEIR3WMWID6YP47W/graph.json","fetch_events":"https://pith.science/api/pith-number/LGNN24DB6ZCEIR3WMWID6YP47W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W/action/storage_attestation","attest_author":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W/action/author_attestation","sign_citation":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W/action/citation_signature","submit_replication":"https://pith.science/pith/LGNN24DB6ZCEIR3WMWID6YP47W/action/replication_record"}},"created_at":"2026-05-18T02:30:53.616995+00:00","updated_at":"2026-05-18T02:30:53.616995+00:00"}