{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LJ5IIBJF5VVGKSBG6PS2VR3P52","short_pith_number":"pith:LJ5IIBJF","schema_version":"1.0","canonical_sha256":"5a7a840525ed6a654826f3e5aac76feea9d4057cc16abf7890201bb774498cbf","source":{"kind":"arxiv","id":"1604.01942","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Synchronizing Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Laurent Doyen, Mahsa Shirmohammadi, Thierry Massart","submitted_at":"2016-04-07T10:01:51Z","abstract_excerpt":"We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is p-synchronizing if the probability mass is at least p in a single state, or in a given set of states. We consider four temporal synchronizing modes: a sequence of probability distributions is always p-synchronizing, eventually p-synchronizing, weakly p-synchronizing, or strongly p-synchronizing if, respectively, all, some, infinitely many, or all but finitely many distributions in the sequence are p-synchronizing.\n  For each synchronizing mode, an MDP c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.01942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-04-07T10:01:51Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f516b574f375e3c2dd7a38307db07ed3cc4892968b249fdc759849372d5986b5","abstract_canon_sha256":"4c84be287890b4798cee2cc011dac0cbcb4f5cc0dce24846222bc5c4ad9118b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:07.589444Z","signature_b64":"Xuv2HtaPYJ0Dm3RYaVIgBPhOSPOsEViHgOuzm+IeVikFdzy5VL5JxkcN5UcZ3TIMThGduU8deIvots/RHpP3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7a840525ed6a654826f3e5aac76feea9d4057cc16abf7890201bb774498cbf","last_reissued_at":"2026-05-18T00:20:07.588941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:07.588941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Synchronizing Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Laurent Doyen, Mahsa Shirmohammadi, Thierry Massart","submitted_at":"2016-04-07T10:01:51Z","abstract_excerpt":"We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is p-synchronizing if the probability mass is at least p in a single state, or in a given set of states. We consider four temporal synchronizing modes: a sequence of probability distributions is always p-synchronizing, eventually p-synchronizing, weakly p-synchronizing, or strongly p-synchronizing if, respectively, all, some, infinitely many, or all but finitely many distributions in the sequence are p-synchronizing.\n  For each synchronizing mode, an MDP c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01942","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.01942","created_at":"2026-05-18T00:20:07.589010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01942v2","created_at":"2026-05-18T00:20:07.589010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01942","created_at":"2026-05-18T00:20:07.589010+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ5IIBJF5VVG","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ5IIBJF5VVGKSBG","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ5IIBJF","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52","json":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52.json","graph_json":"https://pith.science/api/pith-number/LJ5IIBJF5VVGKSBG6PS2VR3P52/graph.json","events_json":"https://pith.science/api/pith-number/LJ5IIBJF5VVGKSBG6PS2VR3P52/events.json","paper":"https://pith.science/paper/LJ5IIBJF"},"agent_actions":{"view_html":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52","download_json":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52.json","view_paper":"https://pith.science/paper/LJ5IIBJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01942&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ5IIBJF5VVGKSBG6PS2VR3P52/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ5IIBJF5VVGKSBG6PS2VR3P52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52/action/storage_attestation","attest_author":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52/action/author_attestation","sign_citation":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52/action/citation_signature","submit_replication":"https://pith.science/pith/LJ5IIBJF5VVGKSBG6PS2VR3P52/action/replication_record"}},"created_at":"2026-05-18T00:20:07.589010+00:00","updated_at":"2026-05-18T00:20:07.589010+00:00"}