{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6BQSOGGWCKMXUY6QN6LUOMPKRQ","short_pith_number":"pith:6BQSOGGW","schema_version":"1.0","canonical_sha256":"f0612718d612997a63d06f974731ea8c16f0be81557ee60cd82e70089d52e80e","source":{"kind":"arxiv","id":"2301.09937","version":1},"attestation_state":"computed","paper":{"title":"Explainable Deep Reinforcement Learning: State of the Art and Challenges","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"George A. Vouros","submitted_at":"2023-01-24T11:41:25Z","abstract_excerpt":"Interpretability, explainability and transparency are key issues to introducing Artificial Intelligence methods in many critical domains: This is important due to ethical concerns and trust issues strongly connected to reliability, robustness, auditability and fairness, and has important consequences towards keeping the human in the loop in high levels of automation, especially in critical cases for decision making, where both (human and the machine) play important roles. While the research community has given much attention to explainability of closed (or black) prediction boxes, there are tr"},"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":"2301.09937","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-24T11:41:25Z","cross_cats_sorted":[],"title_canon_sha256":"1032254d32c572f06cb66e85128ed99f28bca3b451428f1ea155b41f736164d4","abstract_canon_sha256":"281463846d002a8bcf067bddcd5dfd32f7ccbcb9765baf7fbe302d39c5ab0afc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:35.965656Z","signature_b64":"xoUqlWUW9I09irmutVtJdwnk156mMG7xTSYMrbpY1TyHA+MMfkn0CAI+RzVQfOXrGU8FCM+0vpHjDAMvsAQ3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0612718d612997a63d06f974731ea8c16f0be81557ee60cd82e70089d52e80e","last_reissued_at":"2026-07-05T05:35:35.965160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:35.965160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explainable Deep Reinforcement Learning: State of the Art and Challenges","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"George A. Vouros","submitted_at":"2023-01-24T11:41:25Z","abstract_excerpt":"Interpretability, explainability and transparency are key issues to introducing Artificial Intelligence methods in many critical domains: This is important due to ethical concerns and trust issues strongly connected to reliability, robustness, auditability and fairness, and has important consequences towards keeping the human in the loop in high levels of automation, especially in critical cases for decision making, where both (human and the machine) play important roles. While the research community has given much attention to explainability of closed (or black) prediction boxes, there are tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09937","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.09937/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":"2301.09937","created_at":"2026-07-05T05:35:35.965217+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.09937v1","created_at":"2026-07-05T05:35:35.965217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09937","created_at":"2026-07-05T05:35:35.965217+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BQSOGGWCKMX","created_at":"2026-07-05T05:35:35.965217+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BQSOGGWCKMXUY6Q","created_at":"2026-07-05T05:35:35.965217+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BQSOGGW","created_at":"2026-07-05T05:35:35.965217+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.03142","citing_title":"Co-Activation Graph Analysis of Safety-Verified and Explainable Deep Reinforcement Learning Policies","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ","json":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ.json","graph_json":"https://pith.science/api/pith-number/6BQSOGGWCKMXUY6QN6LUOMPKRQ/graph.json","events_json":"https://pith.science/api/pith-number/6BQSOGGWCKMXUY6QN6LUOMPKRQ/events.json","paper":"https://pith.science/paper/6BQSOGGW"},"agent_actions":{"view_html":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ","download_json":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ.json","view_paper":"https://pith.science/paper/6BQSOGGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.09937&json=true","fetch_graph":"https://pith.science/api/pith-number/6BQSOGGWCKMXUY6QN6LUOMPKRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6BQSOGGWCKMXUY6QN6LUOMPKRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ/action/storage_attestation","attest_author":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ/action/author_attestation","sign_citation":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ/action/citation_signature","submit_replication":"https://pith.science/pith/6BQSOGGWCKMXUY6QN6LUOMPKRQ/action/replication_record"}},"created_at":"2026-07-05T05:35:35.965217+00:00","updated_at":"2026-07-05T05:35:35.965217+00:00"}