{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZEQMLEUKHFI5FNW5F7D6E35CP3","short_pith_number":"pith:ZEQMLEUK","canonical_record":{"source":{"id":"1102.4121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-21T02:30:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5d56aadacc4325827cd2e85f30c64744742f67c54597f698e16d0307e6d2041a","abstract_canon_sha256":"cd8973a22ad28849661467480e65ada43dab2857415954dd782ed6d540b622d1"},"schema_version":"1.0"},"canonical_sha256":"c920c5928a3951d2b6dd2fc7e26fa27ed171cd74babc585735935c3bcacdf733","source":{"kind":"arxiv","id":"1102.4121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4121","created_at":"2026-05-18T04:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4121v1","created_at":"2026-05-18T04:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4121","created_at":"2026-05-18T04:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZEQMLEUKHFI5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZEQMLEUKHFI5FNW5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZEQMLEUK","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZEQMLEUKHFI5FNW5F7D6E35CP3","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-21T02:30:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5d56aadacc4325827cd2e85f30c64744742f67c54597f698e16d0307e6d2041a","abstract_canon_sha256":"cd8973a22ad28849661467480e65ada43dab2857415954dd782ed6d540b622d1"},"schema_version":"1.0"},"canonical_sha256":"c920c5928a3951d2b6dd2fc7e26fa27ed171cd74babc585735935c3bcacdf733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:18.949435Z","signature_b64":"+3R5AyzUw9C5kd+3AuwlBaSe/q584zafWHQ7bfkynrGvfzqQv+eb8zHM8iTp0Sbl2bL9DCZdxB4P/c0An4SFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c920c5928a3951d2b6dd2fc7e26fa27ed171cd74babc585735935c3bcacdf733","last_reissued_at":"2026-05-18T04:28:18.948566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:18.948566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4121","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-18T04:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVgVtUwBBElF+qXoPyaZbCEJhe2Rl/ZlmRLgvDyJ8XiNG/W7gfoBoghiKb+zg8avKeY1JH7sWQe7vmwLmSFgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:48:28.530189Z"},"content_sha256":"760bf44503ebe5f32db38dcf74b2fbd2c4e8fee8abcb81a15f8e9aa951ce1531","schema_version":"1.0","event_id":"sha256:760bf44503ebe5f32db38dcf74b2fbd2c4e8fee8abcb81a15f8e9aa951ce1531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZEQMLEUKHFI5FNW5F7D6E35CP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronizing Objectives for Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Belgium), ENS Cachan & CNRS, France), Laurent Doyen (LSV, Mahsa Shirmohammadi (Universit\\'e Libre de Bruxelles, Thierry Massart (Universit\\'e Libre de Bruxelles","submitted_at":"2011-02-21T02:30:55Z","abstract_excerpt":"We introduce synchronizing objectives for Markov decision processes (MDP). Intuitively, a synchronizing objective requires that eventually, at every step there is a state  which concentrates almost all the probability mass.  In particular, it implies that the probabilistic system behaves in the long run like a deterministic system: eventually, the current state of the MDP can be identified with almost certainty.\n  We study the problem of deciding the existence of a strategy to enforce a synchronizing objective in MDPs. We show that the problem is decidable for general strategies, as well as fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4121","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-18T04:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gbbPUHfYRYxyP9HKGtkKotE4PVsE/t501UivPvDU3XvIdvowMX1vupHMk1miwIXEICCwZ0ZNnra4PMkYbkDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:48:28.530950Z"},"content_sha256":"687cdd03ba9ae56e9f9d2139d811679cf388bfb5e3fe041df428dca879016ff3","schema_version":"1.0","event_id":"sha256:687cdd03ba9ae56e9f9d2139d811679cf388bfb5e3fe041df428dca879016ff3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3/bundle.json","state_url":"https://pith.science/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3/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-10T05:48:28Z","links":{"resolver":"https://pith.science/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3","bundle":"https://pith.science/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3/bundle.json","state":"https://pith.science/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEQMLEUKHFI5FNW5F7D6E35CP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZEQMLEUKHFI5FNW5F7D6E35CP3","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":"cd8973a22ad28849661467480e65ada43dab2857415954dd782ed6d540b622d1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-21T02:30:55Z","title_canon_sha256":"5d56aadacc4325827cd2e85f30c64744742f67c54597f698e16d0307e6d2041a"},"schema_version":"1.0","source":{"id":"1102.4121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4121","created_at":"2026-05-18T04:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4121v1","created_at":"2026-05-18T04:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4121","created_at":"2026-05-18T04:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZEQMLEUKHFI5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZEQMLEUKHFI5FNW5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZEQMLEUK","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:687cdd03ba9ae56e9f9d2139d811679cf388bfb5e3fe041df428dca879016ff3","target":"graph","created_at":"2026-05-18T04:28:18Z","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":"We introduce synchronizing objectives for Markov decision processes (MDP). Intuitively, a synchronizing objective requires that eventually, at every step there is a state  which concentrates almost all the probability mass.  In particular, it implies that the probabilistic system behaves in the long run like a deterministic system: eventually, the current state of the MDP can be identified with almost certainty.\n  We study the problem of deciding the existence of a strategy to enforce a synchronizing objective in MDPs. We show that the problem is decidable for general strategies, as well as fo","authors_text":"Belgium), ENS Cachan & CNRS, France), Laurent Doyen (LSV, Mahsa Shirmohammadi (Universit\\'e Libre de Bruxelles, Thierry Massart (Universit\\'e Libre de Bruxelles","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-21T02:30:55Z","title":"Synchronizing Objectives for Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4121","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:760bf44503ebe5f32db38dcf74b2fbd2c4e8fee8abcb81a15f8e9aa951ce1531","target":"record","created_at":"2026-05-18T04:28:18Z","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":"cd8973a22ad28849661467480e65ada43dab2857415954dd782ed6d540b622d1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-21T02:30:55Z","title_canon_sha256":"5d56aadacc4325827cd2e85f30c64744742f67c54597f698e16d0307e6d2041a"},"schema_version":"1.0","source":{"id":"1102.4121","kind":"arxiv","version":1}},"canonical_sha256":"c920c5928a3951d2b6dd2fc7e26fa27ed171cd74babc585735935c3bcacdf733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c920c5928a3951d2b6dd2fc7e26fa27ed171cd74babc585735935c3bcacdf733","first_computed_at":"2026-05-18T04:28:18.948566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:18.948566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3R5AyzUw9C5kd+3AuwlBaSe/q584zafWHQ7bfkynrGvfzqQv+eb8zHM8iTp0Sbl2bL9DCZdxB4P/c0An4SFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:18.949435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:760bf44503ebe5f32db38dcf74b2fbd2c4e8fee8abcb81a15f8e9aa951ce1531","sha256:687cdd03ba9ae56e9f9d2139d811679cf388bfb5e3fe041df428dca879016ff3"],"state_sha256":"c061da7b1202a065cf891241fe32758ce5c47f75bc7b3748fadca6e644e49722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4o4olzONL8OUECTUyNpbM78mURVLJYEndYw/V4O90+CVr5c9+lL5RBKTrgaCLFcTsc/+VdXli8derY5Ip1VCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:48:28.535120Z","bundle_sha256":"784841a656ff12c82bbec939cf636e58d294e3a0cdb30178c69a8f5c3e327930"}}