{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OSG363736O3SSULZCUQDBHNKVX","short_pith_number":"pith:OSG36373","schema_version":"1.0","canonical_sha256":"748dbf6ffbf3b72951791520309daaadd0bdcaba2c347187fa5393ef6581e240","source":{"kind":"arxiv","id":"2011.07553","version":2},"attestation_state":"computed","paper":{"title":"CDT: Cascading Decision Trees for Explainable Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Changjian Li, Gavin Weiguang Ding, Pablo Hernandez-Leal, Ruitong Huang, Zihan Ding","submitted_at":"2020-11-15T15:25:56Z","abstract_excerpt":"Deep Reinforcement Learning (DRL) has recently achieved significant advances in various domains. However, explaining the policy of RL agents still remains an open problem due to several factors, one being the complexity of explaining neural networks decisions. Recently, a group of works have used decision-tree-based models to learn explainable policies. Soft decision trees (SDTs) and discretized differentiable decision trees (DDTs) have been demonstrated to achieve both good performance and share the benefit of having explainable policies. In this work, we further improve the results for tree-"},"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":"2011.07553","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-15T15:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"f2d99bccce49b0dd7338467741ae7239685d175e15f17989e5116ab22e2ed5f9","abstract_canon_sha256":"e950e75842dec7185072094fb370beca1f166daefb85c1912a5ea1ac73e92890"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:30.861972Z","signature_b64":"sVplA80x3ZGU3Kjx5KrOZXcPFKTJpZpnCItuolFB+6PxRPAg2q6/Uj1RsgPc2e+qIVWhxZ/nh3YSrUfKFgyjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"748dbf6ffbf3b72951791520309daaadd0bdcaba2c347187fa5393ef6581e240","last_reissued_at":"2026-07-05T02:27:30.861497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:30.861497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CDT: Cascading Decision Trees for Explainable Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Changjian Li, Gavin Weiguang Ding, Pablo Hernandez-Leal, Ruitong Huang, Zihan Ding","submitted_at":"2020-11-15T15:25:56Z","abstract_excerpt":"Deep Reinforcement Learning (DRL) has recently achieved significant advances in various domains. However, explaining the policy of RL agents still remains an open problem due to several factors, one being the complexity of explaining neural networks decisions. Recently, a group of works have used decision-tree-based models to learn explainable policies. Soft decision trees (SDTs) and discretized differentiable decision trees (DDTs) have been demonstrated to achieve both good performance and share the benefit of having explainable policies. In this work, we further improve the results for tree-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07553","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/2011.07553/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.07553","created_at":"2026-07-05T02:27:30.861558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.07553v2","created_at":"2026-07-05T02:27:30.861558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07553","created_at":"2026-07-05T02:27:30.861558+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSG363736O3S","created_at":"2026-07-05T02:27:30.861558+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSG363736O3SSULZ","created_at":"2026-07-05T02:27:30.861558+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSG36373","created_at":"2026-07-05T02:27:30.861558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.12173","citing_title":"SkillTree: Explainable Skill-Based Deep Reinforcement Learning for Long-Horizon Control Tasks","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX","json":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX.json","graph_json":"https://pith.science/api/pith-number/OSG363736O3SSULZCUQDBHNKVX/graph.json","events_json":"https://pith.science/api/pith-number/OSG363736O3SSULZCUQDBHNKVX/events.json","paper":"https://pith.science/paper/OSG36373"},"agent_actions":{"view_html":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX","download_json":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX.json","view_paper":"https://pith.science/paper/OSG36373","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.07553&json=true","fetch_graph":"https://pith.science/api/pith-number/OSG363736O3SSULZCUQDBHNKVX/graph.json","fetch_events":"https://pith.science/api/pith-number/OSG363736O3SSULZCUQDBHNKVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX/action/storage_attestation","attest_author":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX/action/author_attestation","sign_citation":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX/action/citation_signature","submit_replication":"https://pith.science/pith/OSG363736O3SSULZCUQDBHNKVX/action/replication_record"}},"created_at":"2026-07-05T02:27:30.861558+00:00","updated_at":"2026-07-05T02:27:30.861558+00:00"}