{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TBSXXN7L6CERH5DJBX3GAWUU75","short_pith_number":"pith:TBSXXN7L","canonical_record":{"source":{"id":"2608.07151","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-07T12:14:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"61d69622ee1b8d785ac9560a59e5383fa7e9523c3a02489e74d95d90376b86a1","abstract_canon_sha256":"201f26c8b12c5c2ac2469a4992b600cf921f649565595e3efb54821ca8263398"},"schema_version":"1.0"},"canonical_sha256":"98657bb7ebf08913f4690df6605a94ff7c8fb3188c1d7ab2f65e921ed0c7cbb6","source":{"kind":"arxiv","id":"2608.07151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07151","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07151v1","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07151","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"TBSXXN7L6CER","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"TBSXXN7L6CERH5DJ","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"TBSXXN7L","created_at":"2026-08-10T01:14:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TBSXXN7L6CERH5DJBX3GAWUU75","target":"record","payload":{"canonical_record":{"source":{"id":"2608.07151","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-07T12:14:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"61d69622ee1b8d785ac9560a59e5383fa7e9523c3a02489e74d95d90376b86a1","abstract_canon_sha256":"201f26c8b12c5c2ac2469a4992b600cf921f649565595e3efb54821ca8263398"},"schema_version":"1.0"},"canonical_sha256":"98657bb7ebf08913f4690df6605a94ff7c8fb3188c1d7ab2f65e921ed0c7cbb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:14:27.780185Z","signature_b64":"wK0ABY0Prq+J9RjJ6rqHNRCEnkBlKO3Nq6fup4rkjz4BXZjCGaqDX32BpXIsW+7rhCfk3KZXaGxbmNeanJn4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98657bb7ebf08913f4690df6605a94ff7c8fb3188c1d7ab2f65e921ed0c7cbb6","last_reissued_at":"2026-08-10T01:14:27.777855Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:14:27.777855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.07151","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-08-10T01:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJ6OPIJMIeG9UJEGRzzYMDsYk31ReHIk2qWogZRDHoJOnmFKSyTJvDGndNSyvTIftCNB01oHdNp1ETHkJiaQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:26:26.319536Z"},"content_sha256":"65ab0e4e69b93727d852ce7cf6c6e4b91d3f875d95c346ac39bd16c5ef8e551f","schema_version":"1.0","event_id":"sha256:65ab0e4e69b93727d852ce7cf6c6e4b91d3f875d95c346ac39bd16c5ef8e551f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TBSXXN7L6CERH5DJBX3GAWUU75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpretable reinforcement learning with decision-tree pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mark Leon Ringer, Michel Tokic","submitted_at":"2026-08-07T12:14:33Z","abstract_excerpt":"Reinforcement learning policies are difficult to inspect, but interpreting them is a prerequisite for trustworthiness. Converting a trained policy into explicit decision-tree rules improves transparency and the resulting artifacts often remain too complex for human understanding. We present a pruning process that simplifies such rule-based policies while preserving task performance and making edits to the policy auditable. The process defines a small set of structural and usage-aware operators and evaluates candidate edits by re-executing the policy to measure return and interpretability proxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07151","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/2608.07151/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-08-10T01:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VP+fRpY6M/ueaZjQBAi1hJ/ZNQ7u6xbYatxx7FuGAZ2GNsQWIxLio1v0Yh9EccHsbih04eKfhOP1G1SdmTOPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:26:26.320467Z"},"content_sha256":"00e6a89010f3ac6719d610f330cce1520e16b734b22b9463a50e8f3baf097b0f","schema_version":"1.0","event_id":"sha256:00e6a89010f3ac6719d610f330cce1520e16b734b22b9463a50e8f3baf097b0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBSXXN7L6CERH5DJBX3GAWUU75/bundle.json","state_url":"https://pith.science/pith/TBSXXN7L6CERH5DJBX3GAWUU75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBSXXN7L6CERH5DJBX3GAWUU75/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-15T00:26:26Z","links":{"resolver":"https://pith.science/pith/TBSXXN7L6CERH5DJBX3GAWUU75","bundle":"https://pith.science/pith/TBSXXN7L6CERH5DJBX3GAWUU75/bundle.json","state":"https://pith.science/pith/TBSXXN7L6CERH5DJBX3GAWUU75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBSXXN7L6CERH5DJBX3GAWUU75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TBSXXN7L6CERH5DJBX3GAWUU75","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":"201f26c8b12c5c2ac2469a4992b600cf921f649565595e3efb54821ca8263398","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-07T12:14:33Z","title_canon_sha256":"61d69622ee1b8d785ac9560a59e5383fa7e9523c3a02489e74d95d90376b86a1"},"schema_version":"1.0","source":{"id":"2608.07151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07151","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07151v1","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07151","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"TBSXXN7L6CER","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"TBSXXN7L6CERH5DJ","created_at":"2026-08-10T01:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"TBSXXN7L","created_at":"2026-08-10T01:14:27Z"}],"graph_snapshots":[{"event_id":"sha256:00e6a89010f3ac6719d610f330cce1520e16b734b22b9463a50e8f3baf097b0f","target":"graph","created_at":"2026-08-10T01:14:27Z","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/2608.07151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reinforcement learning policies are difficult to inspect, but interpreting them is a prerequisite for trustworthiness. Converting a trained policy into explicit decision-tree rules improves transparency and the resulting artifacts often remain too complex for human understanding. We present a pruning process that simplifies such rule-based policies while preserving task performance and making edits to the policy auditable. The process defines a small set of structural and usage-aware operators and evaluates candidate edits by re-executing the policy to measure return and interpretability proxi","authors_text":"Mark Leon Ringer, Michel Tokic","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-07T12:14:33Z","title":"Interpretable reinforcement learning with decision-tree pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07151","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:65ab0e4e69b93727d852ce7cf6c6e4b91d3f875d95c346ac39bd16c5ef8e551f","target":"record","created_at":"2026-08-10T01:14:27Z","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":"201f26c8b12c5c2ac2469a4992b600cf921f649565595e3efb54821ca8263398","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-07T12:14:33Z","title_canon_sha256":"61d69622ee1b8d785ac9560a59e5383fa7e9523c3a02489e74d95d90376b86a1"},"schema_version":"1.0","source":{"id":"2608.07151","kind":"arxiv","version":1}},"canonical_sha256":"98657bb7ebf08913f4690df6605a94ff7c8fb3188c1d7ab2f65e921ed0c7cbb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98657bb7ebf08913f4690df6605a94ff7c8fb3188c1d7ab2f65e921ed0c7cbb6","first_computed_at":"2026-08-10T01:14:27.777855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:14:27.777855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wK0ABY0Prq+J9RjJ6rqHNRCEnkBlKO3Nq6fup4rkjz4BXZjCGaqDX32BpXIsW+7rhCfk3KZXaGxbmNeanJn4Aw==","signature_status":"signed_v1","signed_at":"2026-08-10T01:14:27.780185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65ab0e4e69b93727d852ce7cf6c6e4b91d3f875d95c346ac39bd16c5ef8e551f","sha256:00e6a89010f3ac6719d610f330cce1520e16b734b22b9463a50e8f3baf097b0f"],"state_sha256":"cf752d1827df69e6466930687778aacacad96529f6a9837157a24299ec447a8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5O6OE5JUYMt9K34H8o0FFJNN2dOwbVJfLrxP0ASusqfxOSk7XCvZGjSCxb7IiS4pND8qNo9xlc+DH+XUX/qMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:26:26.327873Z","bundle_sha256":"bf5ae74625b98b3cf16ad6338091e58baaeb0eba7082453ba85e817e7ff533e0"}}