{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VD2M564GMGQ3TRYFJLZBS24PMC","short_pith_number":"pith:VD2M564G","canonical_record":{"source":{"id":"2501.10126","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-17T11:30:31Z","cross_cats_sorted":[],"title_canon_sha256":"4a073c6b683b14ed016cbc55c9ed18ae1f306e289dd6eee6c70a0f2e72df4237","abstract_canon_sha256":"70028d9c50ffa1163c5f1da8decbd160c1b24beafb899249d3dd02a60dd059f1"},"schema_version":"1.0"},"canonical_sha256":"a8f4cefb8661a1b9c7054af2196b8f60b45da0932adaf0f60d1412565ef19a21","source":{"kind":"arxiv","id":"2501.10126","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10126","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10126v2","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10126","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"VD2M564GMGQ3","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"pith_short_16","alias_value":"VD2M564GMGQ3TRYF","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"pith_short_8","alias_value":"VD2M564G","created_at":"2026-07-05T11:07:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VD2M564GMGQ3TRYFJLZBS24PMC","target":"record","payload":{"canonical_record":{"source":{"id":"2501.10126","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-17T11:30:31Z","cross_cats_sorted":[],"title_canon_sha256":"4a073c6b683b14ed016cbc55c9ed18ae1f306e289dd6eee6c70a0f2e72df4237","abstract_canon_sha256":"70028d9c50ffa1163c5f1da8decbd160c1b24beafb899249d3dd02a60dd059f1"},"schema_version":"1.0"},"canonical_sha256":"a8f4cefb8661a1b9c7054af2196b8f60b45da0932adaf0f60d1412565ef19a21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:19.104783Z","signature_b64":"Fn63MPAazgCzbDRin1qCYjpUDCyNn3ucyqVMBaEQQebQFE7S7d0s1gQcn9jZSB//wBlWQlOVrooIP+F9WqlWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8f4cefb8661a1b9c7054af2196b8f60b45da0932adaf0f60d1412565ef19a21","last_reissued_at":"2026-07-05T11:07:19.104208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:19.104208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.10126","source_version":2,"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-05T11:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfpmYPi+GHgUkDIvwFbwksvUCY3x9/bNsAGiaqMBzUsldedicNe9ve8tQ1RXopMrzmW94vkLY95Ka7um82BdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:16:05.465418Z"},"content_sha256":"07604ec96150fefcfcca022dac0d7bd80ab485d83f024b9321382ea3ddd06a65","schema_version":"1.0","event_id":"sha256:07604ec96150fefcfcca022dac0d7bd80ab485d83f024b9321382ea3ddd06a65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VD2M564GMGQ3TRYFJLZBS24PMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Decision Trees for MDPs with Deductive Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Filip Mac\\'ak, Milan \\v{C}e\\v{s}ka, Roman Andriushchenko, Sebastian Junges","submitted_at":"2025-01-17T11:30:31Z","abstract_excerpt":"Markov decision processes (MDPs) describe sequential decision-making processes; MDP policies return for every state in that process an advised action. Classical algorithms can efficiently compute policies that are optimal with respect to, e.g., reachability probabilities. However, these policies are then given in a tabular format. A longstanding challenge is to represent optimal or almost-optimal policies concisely, e.g., as decision trees. This paper makes two contributions towards this challenge: first, an SMT-based approach to encode a given (optimal) policy as a small decision tree, and se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10126","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/2501.10126/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-05T11:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTIQWobv0/V/G6ppq2J+nEVLvhLyuOHrGUvywExI1W6Kw8n+hKu1x+HDx2aQ9itVv9qbAzz8aY4sC/uwf3r0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:16:05.467189Z"},"content_sha256":"ce73ff6b96d379480d06228fdcd863421ab5276bc84b15ce59357394302d214e","schema_version":"1.0","event_id":"sha256:ce73ff6b96d379480d06228fdcd863421ab5276bc84b15ce59357394302d214e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VD2M564GMGQ3TRYFJLZBS24PMC/bundle.json","state_url":"https://pith.science/pith/VD2M564GMGQ3TRYFJLZBS24PMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VD2M564GMGQ3TRYFJLZBS24PMC/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-11T03:16:05Z","links":{"resolver":"https://pith.science/pith/VD2M564GMGQ3TRYFJLZBS24PMC","bundle":"https://pith.science/pith/VD2M564GMGQ3TRYFJLZBS24PMC/bundle.json","state":"https://pith.science/pith/VD2M564GMGQ3TRYFJLZBS24PMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VD2M564GMGQ3TRYFJLZBS24PMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VD2M564GMGQ3TRYFJLZBS24PMC","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":"70028d9c50ffa1163c5f1da8decbd160c1b24beafb899249d3dd02a60dd059f1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-17T11:30:31Z","title_canon_sha256":"4a073c6b683b14ed016cbc55c9ed18ae1f306e289dd6eee6c70a0f2e72df4237"},"schema_version":"1.0","source":{"id":"2501.10126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10126","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10126v2","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10126","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"VD2M564GMGQ3","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"pith_short_16","alias_value":"VD2M564GMGQ3TRYF","created_at":"2026-07-05T11:07:19Z"},{"alias_kind":"pith_short_8","alias_value":"VD2M564G","created_at":"2026-07-05T11:07:19Z"}],"graph_snapshots":[{"event_id":"sha256:ce73ff6b96d379480d06228fdcd863421ab5276bc84b15ce59357394302d214e","target":"graph","created_at":"2026-07-05T11:07:19Z","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/2501.10126/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Markov decision processes (MDPs) describe sequential decision-making processes; MDP policies return for every state in that process an advised action. Classical algorithms can efficiently compute policies that are optimal with respect to, e.g., reachability probabilities. However, these policies are then given in a tabular format. A longstanding challenge is to represent optimal or almost-optimal policies concisely, e.g., as decision trees. This paper makes two contributions towards this challenge: first, an SMT-based approach to encode a given (optimal) policy as a small decision tree, and se","authors_text":"Filip Mac\\'ak, Milan \\v{C}e\\v{s}ka, Roman Andriushchenko, Sebastian Junges","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-17T11:30:31Z","title":"Small Decision Trees for MDPs with Deductive Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10126","kind":"arxiv","version":2},"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:07604ec96150fefcfcca022dac0d7bd80ab485d83f024b9321382ea3ddd06a65","target":"record","created_at":"2026-07-05T11:07:19Z","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":"70028d9c50ffa1163c5f1da8decbd160c1b24beafb899249d3dd02a60dd059f1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-17T11:30:31Z","title_canon_sha256":"4a073c6b683b14ed016cbc55c9ed18ae1f306e289dd6eee6c70a0f2e72df4237"},"schema_version":"1.0","source":{"id":"2501.10126","kind":"arxiv","version":2}},"canonical_sha256":"a8f4cefb8661a1b9c7054af2196b8f60b45da0932adaf0f60d1412565ef19a21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8f4cefb8661a1b9c7054af2196b8f60b45da0932adaf0f60d1412565ef19a21","first_computed_at":"2026-07-05T11:07:19.104208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:07:19.104208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fn63MPAazgCzbDRin1qCYjpUDCyNn3ucyqVMBaEQQebQFE7S7d0s1gQcn9jZSB//wBlWQlOVrooIP+F9WqlWCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:07:19.104783Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.10126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07604ec96150fefcfcca022dac0d7bd80ab485d83f024b9321382ea3ddd06a65","sha256:ce73ff6b96d379480d06228fdcd863421ab5276bc84b15ce59357394302d214e"],"state_sha256":"71cdbab56b7bafc6bb208a02cd11fde1ffed0c304c713201da492e21019c5036"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvqD38UMfBxv9dRutFfDpYK+TlOL+rn6DKAeXNFlTVJuPVVRbCTHLek7KKj+GMowTjz+IzvqfY5R/fegU/W5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:16:05.472283Z","bundle_sha256":"956c5c7b79ce635f2d60d08d66c75e207e5a9cd0e62c56f51959d8089a47b082"}}