{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:AWXNW2ABAU5N5TJEZEKAVFKPNM","short_pith_number":"pith:AWXNW2AB","canonical_record":{"source":{"id":"2206.04266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-09T04:23:26Z","cross_cats_sorted":[],"title_canon_sha256":"1547ffa7571f30c8840728524eda2761081ae1efdd3e48cf890a89bacfbe0b32","abstract_canon_sha256":"c4b8f0768343db538e296340df4ccbfb4cef2646aa697b3e743f6d9392c68700"},"schema_version":"1.0"},"canonical_sha256":"05aedb6801053adecd24c9140a954f6b153a6577ac528125906b0412be29c5a9","source":{"kind":"arxiv","id":"2206.04266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.04266","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"2206.04266v1","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04266","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"AWXNW2ABAU5N","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWXNW2ABAU5N5TJE","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWXNW2AB","created_at":"2026-07-05T04:30:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:AWXNW2ABAU5N5TJEZEKAVFKPNM","target":"record","payload":{"canonical_record":{"source":{"id":"2206.04266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-09T04:23:26Z","cross_cats_sorted":[],"title_canon_sha256":"1547ffa7571f30c8840728524eda2761081ae1efdd3e48cf890a89bacfbe0b32","abstract_canon_sha256":"c4b8f0768343db538e296340df4ccbfb4cef2646aa697b3e743f6d9392c68700"},"schema_version":"1.0"},"canonical_sha256":"05aedb6801053adecd24c9140a954f6b153a6577ac528125906b0412be29c5a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:24.876167Z","signature_b64":"160Jb1R3nlXigQQWsrn2UbXQgzgksDxkLojNStzZy9VumiJnM+UbwiH/xXwCJ2zKXY8Y2/SIzC7vdvqX6SDECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05aedb6801053adecd24c9140a954f6b153a6577ac528125906b0412be29c5a9","last_reissued_at":"2026-07-05T04:30:24.875664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:24.875664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.04266","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-07-05T04:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYL1PpdjWZPXUSZqSqaQONqktSV3zUvxAz4wsHWzU3XsesOMd2LwHcpbFhKbYwtyZBZSyCcNcz002ZoBz5RuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:16:26.941428Z"},"content_sha256":"565c84e1b1080f44e0e5f007afc1022232c857a07dd9d7d2dc82ff5be3b517f3","schema_version":"1.0","event_id":"sha256:565c84e1b1080f44e0e5f007afc1022232c857a07dd9d7d2dc82ff5be3b517f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:AWXNW2ABAU5N5TJEZEKAVFKPNM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"There is no Accuracy-Interpretability Tradeoff in Reinforcement Learning for Mazes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Michal Moshkovitz, Yishay Mansour","submitted_at":"2022-06-09T04:23:26Z","abstract_excerpt":"Interpretability is an essential building block for trustworthiness in reinforcement learning systems. However, interpretability might come at the cost of deteriorated performance, leading many researchers to build complex models. Our goal is to analyze the cost of interpretability. We show that in certain cases, one can achieve policy interpretability while maintaining its optimality. We focus on a classical problem from reinforcement learning: mazes with $k$ obstacles in $\\mathbb{R}^d$. We prove the existence of a small decision tree with a linear function at each inner node and depth $O(\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04266","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/2206.04266/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"},"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-07-05T04:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8nZTPFF99pL6Tgzds1mhXf9iWI2OdIpKjicP7bxK1rmf69wJ/yPVUeHC6it5KoYCVJ1DKNLBOiHsM5qIJxICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:16:26.941985Z"},"content_sha256":"ba8d4fd4b0a3f53f0a3f9da57c530f548fb29416085d9fec0b600d2732dd1b36","schema_version":"1.0","event_id":"sha256:ba8d4fd4b0a3f53f0a3f9da57c530f548fb29416085d9fec0b600d2732dd1b36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM/bundle.json","state_url":"https://pith.science/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM/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-08-09T10:16:26Z","links":{"resolver":"https://pith.science/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM","bundle":"https://pith.science/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM/bundle.json","state":"https://pith.science/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWXNW2ABAU5N5TJEZEKAVFKPNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:AWXNW2ABAU5N5TJEZEKAVFKPNM","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":"c4b8f0768343db538e296340df4ccbfb4cef2646aa697b3e743f6d9392c68700","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-09T04:23:26Z","title_canon_sha256":"1547ffa7571f30c8840728524eda2761081ae1efdd3e48cf890a89bacfbe0b32"},"schema_version":"1.0","source":{"id":"2206.04266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.04266","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"2206.04266v1","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04266","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"AWXNW2ABAU5N","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWXNW2ABAU5N5TJE","created_at":"2026-07-05T04:30:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWXNW2AB","created_at":"2026-07-05T04:30:24Z"}],"graph_snapshots":[{"event_id":"sha256:ba8d4fd4b0a3f53f0a3f9da57c530f548fb29416085d9fec0b600d2732dd1b36","target":"graph","created_at":"2026-07-05T04:30:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.04266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Interpretability is an essential building block for trustworthiness in reinforcement learning systems. However, interpretability might come at the cost of deteriorated performance, leading many researchers to build complex models. Our goal is to analyze the cost of interpretability. We show that in certain cases, one can achieve policy interpretability while maintaining its optimality. We focus on a classical problem from reinforcement learning: mazes with $k$ obstacles in $\\mathbb{R}^d$. We prove the existence of a small decision tree with a linear function at each inner node and depth $O(\\lo","authors_text":"Cynthia Rudin, Michal Moshkovitz, Yishay Mansour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-09T04:23:26Z","title":"There is no Accuracy-Interpretability Tradeoff in Reinforcement Learning for Mazes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04266","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:565c84e1b1080f44e0e5f007afc1022232c857a07dd9d7d2dc82ff5be3b517f3","target":"record","created_at":"2026-07-05T04:30:24Z","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":"c4b8f0768343db538e296340df4ccbfb4cef2646aa697b3e743f6d9392c68700","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-09T04:23:26Z","title_canon_sha256":"1547ffa7571f30c8840728524eda2761081ae1efdd3e48cf890a89bacfbe0b32"},"schema_version":"1.0","source":{"id":"2206.04266","kind":"arxiv","version":1}},"canonical_sha256":"05aedb6801053adecd24c9140a954f6b153a6577ac528125906b0412be29c5a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05aedb6801053adecd24c9140a954f6b153a6577ac528125906b0412be29c5a9","first_computed_at":"2026-07-05T04:30:24.875664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:30:24.875664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"160Jb1R3nlXigQQWsrn2UbXQgzgksDxkLojNStzZy9VumiJnM+UbwiH/xXwCJ2zKXY8Y2/SIzC7vdvqX6SDECQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:30:24.876167Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.04266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:565c84e1b1080f44e0e5f007afc1022232c857a07dd9d7d2dc82ff5be3b517f3","sha256:ba8d4fd4b0a3f53f0a3f9da57c530f548fb29416085d9fec0b600d2732dd1b36"],"state_sha256":"81ab41e7cfb1437b41da5b1fda1a3f2ba53bdb4e4fd7ee8ee6da3519a67eaac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrYEAkaqypC9Sn+Is1x45FGSDl1oJiZmMxiysr38YN26Kna/YkF8Kdx/Wm7Gr+0LIclD+2zsUSUgDKPjsFhqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T10:16:26.945966Z","bundle_sha256":"8d151718b9b0842c84ef21f323bfaa8bd4016c0514cafc3a3afad818a03774bf"}}