{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:V45Z3MTUKBBOKTYUHIJMQFMS2F","short_pith_number":"pith:V45Z3MTU","canonical_record":{"source":{"id":"1407.5396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-21T07:28:33Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"9cd01413547c5523511dad9297d5fb5ff0346b7672093971345365ee8b4c5ae1","abstract_canon_sha256":"9d125275e8989928c10dd58f4f14cc2814673e819d594c389c579dc7d16532e4"},"schema_version":"1.0"},"canonical_sha256":"af3b9db2745042e54f143a12c81592d144b3afafac0729d32304d2c2457ac6ce","source":{"kind":"arxiv","id":"1407.5396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5396","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5396v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5396","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"V45Z3MTUKBBO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V45Z3MTUKBBOKTYU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V45Z3MTU","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:V45Z3MTUKBBOKTYUHIJMQFMS2F","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-21T07:28:33Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"9cd01413547c5523511dad9297d5fb5ff0346b7672093971345365ee8b4c5ae1","abstract_canon_sha256":"9d125275e8989928c10dd58f4f14cc2814673e819d594c389c579dc7d16532e4"},"schema_version":"1.0"},"canonical_sha256":"af3b9db2745042e54f143a12c81592d144b3afafac0729d32304d2c2457ac6ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:14.105822Z","signature_b64":"7ZNKDHJh6gIjX0GuMbdjIChmOCz35AjCdfvtLoi/0O1K9+C4AcNHCskBCX6ZoQDeyTPXl9kt0z0tAFeXVxYdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3b9db2745042e54f143a12c81592d144b3afafac0729d32304d2c2457ac6ce","last_reissued_at":"2026-05-18T02:47:14.105272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:14.105272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5396","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-05-18T02:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tghUia+g5bwHydKCzD6haCsEzDszFgzN8rvpq8xGpj0gkwZ5aDi768q3cuBRVPasZSbDIRrLUxQYPhy2tIUNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:07.530691Z"},"content_sha256":"dfc9ec6df0e294c63be390de7b2fae14910fbc03a5337ca6651d14488210b55d","schema_version":"1.0","event_id":"sha256:dfc9ec6df0e294c63be390de7b2fae14910fbc03a5337ca6651d14488210b55d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:V45Z3MTUKBBOKTYUHIJMQFMS2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SY"],"primary_cat":"cs.LO","authors_text":"Aaron Bohy (Universit\\'e de Mons), Jean-Fran\\c{c}ois Raskin (Universit\\'e Libre de Bruxelles), V\\'eronique Bruy\\`ere (Universit\\'e de Mons)","submitted_at":"2014-07-21T07:28:33Z","abstract_excerpt":"When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in the quantitative setting of expected mean-payoff. This algorithm, based on the strategy iteration algorithm of Howard and Veinott, efficiently combines symbolic and explicit data structures, and uses binary decision diagrams as symbolic representation. The aim of this paper is to show that the new data structure of pseudo-antichains (an extension "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5396","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":""},"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-05-18T02:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ktlefL2jcuqz6EPb29CYze1WYhRbHc8JshfVQpXJ2Mkz7N75Tnn1a7ji8G9JL8JlhJLnnR24HuD4pgOzzLNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:07.531083Z"},"content_sha256":"3227ccdf4611980de742bdd342b0d2ef35e157d00b8a5ef61d22fd9427f07c47","schema_version":"1.0","event_id":"sha256:3227ccdf4611980de742bdd342b0d2ef35e157d00b8a5ef61d22fd9427f07c47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F/bundle.json","state_url":"https://pith.science/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F/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-06-02T13:06:07Z","links":{"resolver":"https://pith.science/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F","bundle":"https://pith.science/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F/bundle.json","state":"https://pith.science/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V45Z3MTUKBBOKTYUHIJMQFMS2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:V45Z3MTUKBBOKTYUHIJMQFMS2F","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":"9d125275e8989928c10dd58f4f14cc2814673e819d594c389c579dc7d16532e4","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-21T07:28:33Z","title_canon_sha256":"9cd01413547c5523511dad9297d5fb5ff0346b7672093971345365ee8b4c5ae1"},"schema_version":"1.0","source":{"id":"1407.5396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5396","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5396v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5396","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"V45Z3MTUKBBO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V45Z3MTUKBBOKTYU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V45Z3MTU","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:3227ccdf4611980de742bdd342b0d2ef35e157d00b8a5ef61d22fd9427f07c47","target":"graph","created_at":"2026-05-18T02:47:14Z","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"},"paper":{"abstract_excerpt":"When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in the quantitative setting of expected mean-payoff. This algorithm, based on the strategy iteration algorithm of Howard and Veinott, efficiently combines symbolic and explicit data structures, and uses binary decision diagrams as symbolic representation. The aim of this paper is to show that the new data structure of pseudo-antichains (an extension ","authors_text":"Aaron Bohy (Universit\\'e de Mons), Jean-Fran\\c{c}ois Raskin (Universit\\'e Libre de Bruxelles), V\\'eronique Bruy\\`ere (Universit\\'e de Mons)","cross_cats":["cs.DS","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-21T07:28:33Z","title":"Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5396","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:dfc9ec6df0e294c63be390de7b2fae14910fbc03a5337ca6651d14488210b55d","target":"record","created_at":"2026-05-18T02:47:14Z","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":"9d125275e8989928c10dd58f4f14cc2814673e819d594c389c579dc7d16532e4","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-21T07:28:33Z","title_canon_sha256":"9cd01413547c5523511dad9297d5fb5ff0346b7672093971345365ee8b4c5ae1"},"schema_version":"1.0","source":{"id":"1407.5396","kind":"arxiv","version":1}},"canonical_sha256":"af3b9db2745042e54f143a12c81592d144b3afafac0729d32304d2c2457ac6ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af3b9db2745042e54f143a12c81592d144b3afafac0729d32304d2c2457ac6ce","first_computed_at":"2026-05-18T02:47:14.105272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:14.105272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZNKDHJh6gIjX0GuMbdjIChmOCz35AjCdfvtLoi/0O1K9+C4AcNHCskBCX6ZoQDeyTPXl9kt0z0tAFeXVxYdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:14.105822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfc9ec6df0e294c63be390de7b2fae14910fbc03a5337ca6651d14488210b55d","sha256:3227ccdf4611980de742bdd342b0d2ef35e157d00b8a5ef61d22fd9427f07c47"],"state_sha256":"a50930436002d04952f7e26bd1642ae6fd1ff91f3b7a4ec8a5794ac04d45275f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aaToVgpv0DbPajHJQ8b6XZT1r+wwfkfvPa3y2wH30ExZxjdlXJSqsyj5WtsJ6WberzDZCwG0T7PbAZiU9vVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:06:07.533061Z","bundle_sha256":"2a59d692108ff114c0d29f7081c6f0c723539afa00aa65291bea7a7a5d4d879d"}}