{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T225ZNFHGE7D24FI5DP7NPY7ZJ","short_pith_number":"pith:T225ZNFH","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"},"canonical_sha256":"9eb5dcb4a7313e3d70a8e8dff6bf1fca617969c32d402687732def1210f456db","source":{"kind":"arxiv","id":"1505.00908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00908","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00908v1","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00908","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"T225ZNFHGE7D","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T225ZNFHGE7D24FI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T225ZNFH","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T225ZNFHGE7D24FI5DP7NPY7ZJ","target":"record","payload":{"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"},"canonical_sha256":"9eb5dcb4a7313e3d70a8e8dff6bf1fca617969c32d402687732def1210f456db","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"},"source_kind":"arxiv","source_id":"1505.00908","source_version":1,"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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiXCiOs17+wTTFAI+ANxe4lcjz3thRixlIUzrErM7s3N7q7xPyT6o90UF+YB94FzlSADUG+hO0grGtAi8wBOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:23:08.275528Z"},"content_sha256":"5cb49e4c19da44cd8d1f01ce3e7791c2cc854559042341348498b7daf7a09f47","schema_version":"1.0","event_id":"sha256:5cb49e4c19da44cd8d1f01ce3e7791c2cc854559042341348498b7daf7a09f47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T225ZNFHGE7D24FI5DP7NPY7ZJ","target":"graph","payload":{"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"},"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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWu4++c5cQfJAVF+UJwb9RILfdpeLSMJq5OmyZiylH0NEj5rHOBSU6nT9W3hP5iP+6kYLH9mUOkqduPnIyRLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:23:08.275873Z"},"content_sha256":"e2e920c38bec66f11b2b910547d5753bd3792324de55e02ab5b00e5af0f3cea7","schema_version":"1.0","event_id":"sha256:e2e920c38bec66f11b2b910547d5753bd3792324de55e02ab5b00e5af0f3cea7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/bundle.json","state_url":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/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-11T10:23:08Z","links":{"resolver":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ","bundle":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/bundle.json","state":"https://pith.science/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T225ZNFHGE7D24FI5DP7NPY7ZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T225ZNFHGE7D24FI5DP7NPY7ZJ","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":"77437a8f5f1687f742c993248ee710eae01b221197bfe2f6213ea106a41a6987","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-05T07:58:40Z","title_canon_sha256":"b57dd3ac0111e57c5d8fd5c7d25021ec32f36a3d6623f37b5e902200af54854c"},"schema_version":"1.0","source":{"id":"1505.00908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00908","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00908v1","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00908","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"T225ZNFHGE7D","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T225ZNFHGE7D24FI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T225ZNFH","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:e2e920c38bec66f11b2b910547d5753bd3792324de55e02ab5b00e5af0f3cea7","target":"graph","created_at":"2026-05-18T01:26:02Z","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":"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","authors_text":"Aur\\'elia L\\'eon, Ludovic Denoyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-05T07:58:40Z","title":"Reinforced Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00908","kind":"arxiv","version":1},"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:5cb49e4c19da44cd8d1f01ce3e7791c2cc854559042341348498b7daf7a09f47","target":"record","created_at":"2026-05-18T01:26:02Z","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":"77437a8f5f1687f742c993248ee710eae01b221197bfe2f6213ea106a41a6987","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-05T07:58:40Z","title_canon_sha256":"b57dd3ac0111e57c5d8fd5c7d25021ec32f36a3d6623f37b5e902200af54854c"},"schema_version":"1.0","source":{"id":"1505.00908","kind":"arxiv","version":1}},"canonical_sha256":"9eb5dcb4a7313e3d70a8e8dff6bf1fca617969c32d402687732def1210f456db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eb5dcb4a7313e3d70a8e8dff6bf1fca617969c32d402687732def1210f456db","first_computed_at":"2026-05-18T01:26:02.762909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:02.762909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DLUYQp46ogcE0dedha1VJ+oc0aLPgVx1vrPV2ogMAr8itBAzr+sAC1iZv2EohA3ix8rGr3iONp0kMBuooMMTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:02.763368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cb49e4c19da44cd8d1f01ce3e7791c2cc854559042341348498b7daf7a09f47","sha256:e2e920c38bec66f11b2b910547d5753bd3792324de55e02ab5b00e5af0f3cea7"],"state_sha256":"4b1ca6c8db98cf9491b6a8f8f484fe384c114a6345a802e6ae904b8eecf4fdef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ug1ee3KnVbJSSwPRgESFK/pQirCdH1n8ThvhkrjDxXpTshR90lW/B6n7Ww9g81YQ6YYG2JB5k8ryOQglu1iCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:23:08.277805Z","bundle_sha256":"7920c6ad587782ea03e2847d838389fb37ad311b262f15c98dd0cbb6ea610349"}}