{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T225ZNFHGE7D24FI5DP7NPY7ZJ","short_pith_number":"pith:T225ZNFH","schema_version":"1.0","canonical_sha256":"9eb5dcb4a7313e3d70a8e8dff6bf1fca617969c32d402687732def1210f456db","source":{"kind":"arxiv","id":"1505.00908","version":1},"attestation_state":"computed","paper":{"title":"Reinforced Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aur\\'elia L\\'eon, Ludovic Denoyer","submitted_at":"2015-05-05T07:58:40Z","abstract_excerpt":"In order to speed-up classification models when facing a large number of categories, one usual approach consists in organizing the categories in a particular structure, this structure being then used as a way to speed-up the prediction computation. This is for example the case when using error-correcting codes or even hierarchies of categories. But in the majority of approaches, this structure is chosen \\textit{by hand}, or during a preliminary step, and not integrated in the learning process. We propose a new model called Reinforced Decision Tree which simultaneously learns how to organize ca"},"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":"1505.00908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-05T07:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"b57dd3ac0111e57c5d8fd5c7d25021ec32f36a3d6623f37b5e902200af54854c","abstract_canon_sha256":"77437a8f5f1687f742c993248ee710eae01b221197bfe2f6213ea106a41a6987"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.763368Z","signature_b64":"DLUYQp46ogcE0dedha1VJ+oc0aLPgVx1vrPV2ogMAr8itBAzr+sAC1iZv2EohA3ix8rGr3iONp0kMBuooMMTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb5dcb4a7313e3d70a8e8dff6bf1fca617969c32d402687732def1210f456db","last_reissued_at":"2026-05-18T01:26:02.762909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.762909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforced Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aur\\'elia L\\'eon, Ludovic Denoyer","submitted_at":"2015-05-05T07:58:40Z","abstract_excerpt":"In order to speed-up classification models when facing a large number of categories, one usual approach consists in organizing the categories in a particular structure, this structure being then used as a way to speed-up the prediction computation. This is for example the case when using error-correcting codes or even hierarchies of categories. But in the majority of approaches, this structure is chosen \\textit{by hand}, or during a preliminary step, and not integrated in the learning process. We propose a new model called Reinforced Decision Tree which simultaneously learns how to organize ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00908","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":"1505.00908","created_at":"2026-05-18T01:26:02.762975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00908v1","created_at":"2026-05-18T01:26:02.762975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00908","created_at":"2026-05-18T01:26:02.762975+00:00"},{"alias_kind":"pith_short_12","alias_value":"T225ZNFHGE7D","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T225ZNFHGE7D24FI","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T225ZNFH","created_at":"2026-05-18T12:29:42.218222+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/T225ZNFHGE7D24FI5DP7NPY7ZJ","json":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ.json","graph_json":"https://pith.science/api/pith-number/T225ZNFHGE7D24FI5DP7NPY7ZJ/graph.json","events_json":"https://pith.science/api/pith-number/T225ZNFHGE7D24FI5DP7NPY7ZJ/events.json","paper":"https://pith.science/paper/T225ZNFH"},"agent_actions":{"view_html":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ","download_json":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ.json","view_paper":"https://pith.science/paper/T225ZNFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00908&json=true","fetch_graph":"https://pith.science/api/pith-number/T225ZNFHGE7D24FI5DP7NPY7ZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/T225ZNFHGE7D24FI5DP7NPY7ZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/action/storage_attestation","attest_author":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/action/author_attestation","sign_citation":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/action/citation_signature","submit_replication":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/action/replication_record"}},"created_at":"2026-05-18T01:26:02.762975+00:00","updated_at":"2026-05-18T01:26:02.762975+00:00"}