{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","short_pith_number":"pith:DXN64TPD","canonical_record":{"source":{"id":"2607.25925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-28T16:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"7393fe93729cfdc04426f6dc947d4eb7c50d5279a25194db7c7c936e6791289e","abstract_canon_sha256":"ac8cf5bee6e5ab46709f115113654a22fe4cc6f7f632e22e213231b701505bed"},"schema_version":"1.0"},"canonical_sha256":"1ddbee4de3f9511d75fa97882a8e7410ddb089ebf48040e6ce277f591652d0ff","source":{"kind":"arxiv","id":"2607.25925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25925","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25925v1","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25925","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"DXN64TPD7FIR","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_16","alias_value":"DXN64TPD7FIR25P2","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_8","alias_value":"DXN64TPD","created_at":"2026-07-29T01:26:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"record","payload":{"canonical_record":{"source":{"id":"2607.25925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-28T16:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"7393fe93729cfdc04426f6dc947d4eb7c50d5279a25194db7c7c936e6791289e","abstract_canon_sha256":"ac8cf5bee6e5ab46709f115113654a22fe4cc6f7f632e22e213231b701505bed"},"schema_version":"1.0"},"canonical_sha256":"1ddbee4de3f9511d75fa97882a8e7410ddb089ebf48040e6ce277f591652d0ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:11.467086Z","signature_b64":"dAEM8WC1QBb/aMtl8DOt3iL4x8UNjFG6JA2Y43y9QiPtiWHZnu2lkATXDVVxPi7AE/JDDV+mkk828aCL4pw3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ddbee4de3f9511d75fa97882a8e7410ddb089ebf48040e6ce277f591652d0ff","last_reissued_at":"2026-07-29T01:26:11.466256Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:11.466256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.25925","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-29T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bGx2blzZp/58+NCaqBtlcukOIfVIWwBUtfNcDZB5UugGffwqBnTtAQrhpluoyzhMW9Y9OBifyvzZZDFfQjeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.977625Z"},"content_sha256":"0c2c3e459d3cdf11fb6d044b9832496567fcc1b1360d05991fc6fe606533ca67","schema_version":"1.0","event_id":"sha256:0c2c3e459d3cdf11fb6d044b9832496567fcc1b1360d05991fc6fe606533ca67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"dtControl2+$\\varepsilon$: Trading Optimality for Explainability in MDPs via Decision Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jan K\\v{r}et\\'insk\\'y, Maximilian Weininger, Sabine Rieder, Tereza Kinsk\\'a, Tobias Meggendorfer","submitted_at":"2026-07-28T16:15:11Z","abstract_excerpt":"Over the past decade, decision trees have been used to represent controllers (a.k.a. policies) in an explainable way, with dtControl2 as a current state-of-the-art tool. However, for systems that are large or have many corner cases, even such representations tend to be too complex and not human-comprehensible. Unfortunately, reducing the size of the decision tree is not straightforward, as missing just a single crucial case might result in an incorrect controller. We tackle this issue in the setting of Markov decision processes, extending dtControl2 by \"$\\varepsilon$\" functionality: Given an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25925","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/2607.25925/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-29T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/Ucziai0uwpNKEI4appkO46QtL1/kBYNUm2HBa/PDA1Aiflm+p+OvtMoAbYPYAzIptwhB6xHRqBCrPG66FCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.978556Z"},"content_sha256":"7b5af22ecdbf4e56d1c00245f0ec64b0fdd0cbaddda4104968532df4302ea56c","schema_version":"1.0","event_id":"sha256:7b5af22ecdbf4e56d1c00245f0ec64b0fdd0cbaddda4104968532df4302ea56c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-01090-4_34) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"K ˇretínský, J., Meggendorfer, T., Sickert, S.: Owl: A library forω-words, automata, and LTL. In: ATV A. Lecture Notes in Computer Science, vol. 11138, pp. 543–550. Springer (2018). https://doi.org/10.1007/978-3-030- 01090-4_34","arxiv_id":"2607.25925","detector":"doi_compliance","evidence":{"ref_index":49,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-030-","reconstructed_doi":"10.1007/978-3-030-01090-4_34"},"severity":"advisory","ref_index":49,"audited_at":"2026-08-01T01:12:48.403074Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-01090-4_34","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"efca49ce70427640bbf9f46ebd1f7eb19efff52ece17ce47b551afa7e0c32c36","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14822,"payload_sha256":"4e8874a372461111c3010c2c18c77db8eeb55c99d2b75ccec7dc970724ce19f9","signature_b64":"TKvJNqx482vn65umwA0p9rXkdTgT3sieGkO25e8sdh2BR3GcJL0Ms2IbqCqOzUiZuLlfqk++6iVLoWBv7eEvCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCiDukg1kOvtAhJbSHoJ0tOBPzwjPgOX5Njf1deR2AyfsI5WpDeXAvCRWerbC/Z42noZQpN9LMhAVSU7lEFnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.986470Z"},"content_sha256":"5a5fb578de75ddbdbacb4131bbe5bd95343f38526f63160ff3bd0ac7bc452cf3","schema_version":"1.0","event_id":"sha256:5a5fb578de75ddbdbacb4131bbe5bd95343f38526f63160ff3bd0ac7bc452cf3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/3-540-45605-8_5) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"D’Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and refinement strategies for probabilistic analysis. In: PAPM-PROBMIV. LNCS, vol. 2399, pp. 57–76. Springer (2002). https://doi.org/10.1007/3- 540-45605-8_5","arxiv_id":"2607.25925","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/3-","reconstructed_doi":"10.1007/3-540-45605-8_5"},"severity":"advisory","ref_index":24,"audited_at":"2026-08-01T01:12:48.403074Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/3-540-45605-8_5","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"120ff4bb09b9b5a098f168c47501d346a17934ffcac426b2e04437e3311d33c7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14821,"payload_sha256":"d8aebce97ea87ded855c5c9183490e3d6eef015ec26bb2168456cddc8d8e3603","signature_b64":"KdpfKzGhqLjfiZWarR6r1Stl++RwMDrG+ygYcqw9cENdRf9iM0QIwZiClVQQzL+oiWqN2OYZqNCWJMATI8/oBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XbLqK4XQzMt25WEur/locyxeNCGZOujtRiY91QMRhpquALuzBre4+s+NBbk3fJg1kUjig5DDDu/TvpevFVOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.987302Z"},"content_sha256":"fa2d2a061a230e87e07d55e1bf579c3f1c2dbce5c7703f9eefd67e80edc2168d","schema_version":"1.0","event_id":"sha256:fa2d2a061a230e87e07d55e1bf579c3f1c2dbce5c7703f9eefd67e80edc2168d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10703-013-0183-7) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Chen, T., Forejt, V ., Kwiatkowska, M.Z., Parker, D., Simaitis, A.: Automatic verification of competitive stochastic systems. Formal Meth- ods Syst. Des.43(1), 61–92 (2013). https://doi.org/10.1007/s10703-013- 0183-7","arxiv_id":"2607.25925","detector":"doi_compliance","evidence":{"ref_index":21,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10703-013-","reconstructed_doi":"10.1007/s10703-013-0183-7"},"severity":"advisory","ref_index":21,"audited_at":"2026-08-01T01:12:48.403074Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10703-013-0183-7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"db55a3c467fff03774c25db3d1b93ff2101372e31c50beca2f90321300ae1b2c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14820,"payload_sha256":"81b89d7b008a4f7740a057e803ad45038d2918d6c515d5a4aaf6f1a44f8c3745","signature_b64":"9TBE7vPAOnF4vopbU35eWJBZ0o2Ra0xGMDsOOVfGwLdJW1EvwX++fmA2ippn8HQJnr8voNP8MVSghKCPKXfgDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OfrzMJ3s/xjqVUdekqLeiGb8fiKOaITfKXXRbcj0SICpabhVcsY8VvLrOEglnkTCU+KUoTPUTL9HAo8LowOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.988026Z"},"content_sha256":"c3a18351afc7faf99fa1ad8101ba72f0157abdfb9d0f817058b102c9f214b499","schema_version":"1.0","event_id":"sha256:c3a18351afc7faf99fa1ad8101ba72f0157abdfb9d0f817058b102c9f214b499"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-031-90653-4_7) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., Zilken, D.: Fixed point certificates for reachability and expected rewards in MDPs. In: TACAS (2). Lecture Notes in Computer Science, vol. 15697, pp. 130–151. Springe","arxiv_id":"2607.25925","detector":"doi_compliance","evidence":{"ref_index":20,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-031-","reconstructed_doi":"10.1007/978-3-031-90653-4_7"},"severity":"advisory","ref_index":20,"audited_at":"2026-08-01T01:12:48.403074Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-031-90653-4_7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3f0cbb0fbb403b62ffa34031e26d59b343b3d029f7cb63c0d5f13d4926f4c0a1","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14819,"payload_sha256":"625efddd028dd240946749fa60012614c8cce0b09cffcac04216214df4eb5d15","signature_b64":"4V0FPMEoHVPwllVkVOqgZObvaNVyf82FOF1M4ZUF2I7k2qUITxF4bNXeDxTJd88Z+6Ie9RkKmNSCl4L7YeXtDA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gs2MKy5OZzbQL5sG4EJlQaNgOwYC2+pl+1nBhfqMqPj0aLM02Og5YLHP3Ax6ATPR6Ikfocf/uR1lTibOzTz1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.988733Z"},"content_sha256":"d504e0801f1020b498d7d6389e6313d9c35aadfa7fc583c59921be6ec471a0ab","schema_version":"1.0","event_id":"sha256:d504e0801f1020b498d7d6389e6313d9c35aadfa7fc583c59921be6ec471a0ab"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-83723-5_15) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Budde, C.E., Hartmanns, A., Klauck, M., K ˇretínský, J., Parker, D., Quatmann, T., Turrini, A., Zhang, Z.: On correctness, precision, and performance in quantitative verification - QComp 2020 competition report. In: ISoLA (4). Lecture Notes","arxiv_id":"2607.25925","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-030-83723-","reconstructed_doi":"10.1007/978-3-030-83723-5_15"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-01T01:12:48.403074Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-83723-5_15","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ac37d3b6ab3859f3d0f51ec4cdd38ef31006277c286f3bee7e31cecddbb5503d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14818,"payload_sha256":"03ee7127726c011db4951471393959f2cc132edcb3746a5d16503a0c1df21c94","signature_b64":"9lkLQJHrt0M3Q/9q7g6u8mDAH9N7LzGssfs6u84yQa1LvXKDqFcDbC+UAnF01ObO8xgykZGAVfD2noTlX0h1Bg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gq1hEJ7u7NYx4H/RdaXtLSi0vWv1tqluhLSkoSTXoU68ok/bwkwiHgct4/3qa1bZDp9dqfk6u5Fh2eXORLJBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.989439Z"},"content_sha256":"115cd8a2b35ae0fe79c14c21065ba6801c71ff9e1299453fa05010175da3afc1","schema_version":"1.0","event_id":"sha256:115cd8a2b35ae0fe79c14c21065ba6801c71ff9e1299453fa05010175da3afc1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-21690-4_10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., K ˇretínský, J.: Counterexample explanation by learning small strategies in Markov decision processes. In: CA V (1). Lecture Notes in Computer Science, vol. 9206, pp. 158–177. Springer ","arxiv_id":"2607.25925","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-","reconstructed_doi":"10.1007/978-3-319-21690-4_10"},"severity":"advisory","ref_index":14,"audited_at":"2026-08-01T01:12:48.403074Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-319-21690-4_10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0edec3226ff3b4ef72c396a553b4266dafb800bfa8719d9d90a1434508ced668","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14817,"payload_sha256":"e97558f98b1d48840bbb1924fdbe6e9f6c13aac34c662fed0c7db4b87e06d903","signature_b64":"DEcbIrNwJRgXaSwSGPva4SnYEmlDspiWz47CvmH9uVn7c2gXh+J+ONZN2IbKUjvr9l1OpyjsYTajT/pgYV8wCw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T01:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1GVpuixPwdIWSso7a9ZUF8AMwE/8JSkK/KhViB0iRcW90KzfQujE9SvN1kumIXvtmwNOums4/IKVkca4VuvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:50:45.990160Z"},"content_sha256":"5dcb743505bf0880b33e11e4c30d509fb582996bcfea6711ab185cdef5f4e88d","schema_version":"1.0","event_id":"sha256:5dcb743505bf0880b33e11e4c30d509fb582996bcfea6711ab185cdef5f4e88d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXN64TPD7FIR25P2S6ECVDTUCD/bundle.json","state_url":"https://pith.science/pith/DXN64TPD7FIR25P2S6ECVDTUCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXN64TPD7FIR25P2S6ECVDTUCD/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-11T02:50:45Z","links":{"resolver":"https://pith.science/pith/DXN64TPD7FIR25P2S6ECVDTUCD","bundle":"https://pith.science/pith/DXN64TPD7FIR25P2S6ECVDTUCD/bundle.json","state":"https://pith.science/pith/DXN64TPD7FIR25P2S6ECVDTUCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXN64TPD7FIR25P2S6ECVDTUCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DXN64TPD7FIR25P2S6ECVDTUCD","merge_version":"pith-open-graph-merge-v1","event_count":8,"valid_event_count":8,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ac8cf5bee6e5ab46709f115113654a22fe4cc6f7f632e22e213231b701505bed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-28T16:15:11Z","title_canon_sha256":"7393fe93729cfdc04426f6dc947d4eb7c50d5279a25194db7c7c936e6791289e"},"schema_version":"1.0","source":{"id":"2607.25925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25925","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25925v1","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25925","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"DXN64TPD7FIR","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_16","alias_value":"DXN64TPD7FIR25P2","created_at":"2026-07-29T01:26:11Z"},{"alias_kind":"pith_short_8","alias_value":"DXN64TPD","created_at":"2026-07-29T01:26:11Z"}],"graph_snapshots":[{"event_id":"sha256:7b5af22ecdbf4e56d1c00245f0ec64b0fdd0cbaddda4104968532df4302ea56c","target":"graph","created_at":"2026-07-29T01:26:11Z","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/2607.25925/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Over the past decade, decision trees have been used to represent controllers (a.k.a. policies) in an explainable way, with dtControl2 as a current state-of-the-art tool. However, for systems that are large or have many corner cases, even such representations tend to be too complex and not human-comprehensible. Unfortunately, reducing the size of the decision tree is not straightforward, as missing just a single crucial case might result in an incorrect controller. We tackle this issue in the setting of Markov decision processes, extending dtControl2 by \"$\\varepsilon$\" functionality: Given an a","authors_text":"Jan K\\v{r}et\\'insk\\'y, Maximilian Weininger, Sabine Rieder, Tereza Kinsk\\'a, Tobias Meggendorfer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-28T16:15:11Z","title":"dtControl2+$\\varepsilon$: Trading Optimality for Explainability in MDPs via Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25925","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:0c2c3e459d3cdf11fb6d044b9832496567fcc1b1360d05991fc6fe606533ca67","target":"record","created_at":"2026-07-29T01:26:11Z","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":"ac8cf5bee6e5ab46709f115113654a22fe4cc6f7f632e22e213231b701505bed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-28T16:15:11Z","title_canon_sha256":"7393fe93729cfdc04426f6dc947d4eb7c50d5279a25194db7c7c936e6791289e"},"schema_version":"1.0","source":{"id":"2607.25925","kind":"arxiv","version":1}},"canonical_sha256":"1ddbee4de3f9511d75fa97882a8e7410ddb089ebf48040e6ce277f591652d0ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ddbee4de3f9511d75fa97882a8e7410ddb089ebf48040e6ce277f591652d0ff","first_computed_at":"2026-07-29T01:26:11.466256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T01:26:11.466256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dAEM8WC1QBb/aMtl8DOt3iL4x8UNjFG6JA2Y43y9QiPtiWHZnu2lkATXDVVxPi7AE/JDDV+mkk828aCL4pw3DA==","signature_status":"signed_v1","signed_at":"2026-07-29T01:26:11.467086Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.25925","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:115cd8a2b35ae0fe79c14c21065ba6801c71ff9e1299453fa05010175da3afc1","sha256:5a5fb578de75ddbdbacb4131bbe5bd95343f38526f63160ff3bd0ac7bc452cf3","sha256:5dcb743505bf0880b33e11e4c30d509fb582996bcfea6711ab185cdef5f4e88d","sha256:c3a18351afc7faf99fa1ad8101ba72f0157abdfb9d0f817058b102c9f214b499","sha256:d504e0801f1020b498d7d6389e6313d9c35aadfa7fc583c59921be6ec471a0ab","sha256:fa2d2a061a230e87e07d55e1bf579c3f1c2dbce5c7703f9eefd67e80edc2168d"]}],"invalid_events":[],"applied_event_ids":["sha256:0c2c3e459d3cdf11fb6d044b9832496567fcc1b1360d05991fc6fe606533ca67","sha256:7b5af22ecdbf4e56d1c00245f0ec64b0fdd0cbaddda4104968532df4302ea56c"],"state_sha256":"6f10b12591acbeed23708639798d69bc3180bd1e5d84a05544a69a2b5e941828"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PhdVaftM0wCOXG59y8psM6uCcJFhB+9jj9ABVEr1QUJzFl/egi79dapryBZIgmk9Cc3TTJSK5rtzwsRxypzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:50:45.995061Z","bundle_sha256":"a63b2718c5ec02e0b17bb811cbfc4d3b466c0059fda4446245ef473e5c8a8e46"}}