{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:5W2GMQ3OI4IOOJIYUCKB426IG6","short_pith_number":"pith:5W2GMQ3O","schema_version":"1.0","canonical_sha256":"edb466436e4710e72518a0941e6bc837a5c9f1d9835eedb713edae8f53586c42","source":{"kind":"arxiv","id":"0810.5728","version":2},"attestation_state":"computed","paper":{"title":"Multi-Objective Model Checking of Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.LO","authors_text":"Kousha Etessami, Marta Kwiatkowska, Mihalis Yannakakis, Moshe Y. Vardi","submitted_at":"2008-10-31T16:18:14Z","abstract_excerpt":"We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (\\omega -regular or LTL) properties \\varphi\\_i, and probabilities r\\_i \\epsilon [0,1], i=1,...,k, we ask whether there exists a strategy \\sigma for the controller such that, for all i, the probability that a trajectory of M controlled by \\sigma satisfies \\varphi\\_i is at least r\\_i. We provide an algorithm that decides whether there exists such a strategy and if so produces it, and which runs in time polynomial in the size o"},"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":"0810.5728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-10-31T16:18:14Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"e9f61ce2a7e7a73ac7847918a68cefb1abc02bcbf6a2b524c28e184de371b654","abstract_canon_sha256":"31c410945253ea3be6a4b62ddfc25da5e916b965abde046bfb3d837e8dedd5a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.671074Z","signature_b64":"9gJUz+AuPse4MMsB7NTRJ2c+eCxatFoNV46ilk77vKFk7MpqPFn127q7RbK9FGAA/syOihTbCHdLhMco82+tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb466436e4710e72518a0941e6bc837a5c9f1d9835eedb713edae8f53586c42","last_reissued_at":"2026-05-18T01:37:40.670471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.670471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Objective Model Checking of Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.LO","authors_text":"Kousha Etessami, Marta Kwiatkowska, Mihalis Yannakakis, Moshe Y. Vardi","submitted_at":"2008-10-31T16:18:14Z","abstract_excerpt":"We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (\\omega -regular or LTL) properties \\varphi\\_i, and probabilities r\\_i \\epsilon [0,1], i=1,...,k, we ask whether there exists a strategy \\sigma for the controller such that, for all i, the probability that a trajectory of M controlled by \\sigma satisfies \\varphi\\_i is at least r\\_i. We provide an algorithm that decides whether there exists such a strategy and if so produces it, and which runs in time polynomial in the size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.5728","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":"0810.5728","created_at":"2026-05-18T01:37:40.670562+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.5728v2","created_at":"2026-05-18T01:37:40.670562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.5728","created_at":"2026-05-18T01:37:40.670562+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W2GMQ3OI4IO","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W2GMQ3OI4IOOJIY","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W2GMQ3O","created_at":"2026-05-18T12:25:56.245647+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/5W2GMQ3OI4IOOJIYUCKB426IG6","json":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6.json","graph_json":"https://pith.science/api/pith-number/5W2GMQ3OI4IOOJIYUCKB426IG6/graph.json","events_json":"https://pith.science/api/pith-number/5W2GMQ3OI4IOOJIYUCKB426IG6/events.json","paper":"https://pith.science/paper/5W2GMQ3O"},"agent_actions":{"view_html":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6","download_json":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6.json","view_paper":"https://pith.science/paper/5W2GMQ3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.5728&json=true","fetch_graph":"https://pith.science/api/pith-number/5W2GMQ3OI4IOOJIYUCKB426IG6/graph.json","fetch_events":"https://pith.science/api/pith-number/5W2GMQ3OI4IOOJIYUCKB426IG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6/action/storage_attestation","attest_author":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6/action/author_attestation","sign_citation":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6/action/citation_signature","submit_replication":"https://pith.science/pith/5W2GMQ3OI4IOOJIYUCKB426IG6/action/replication_record"}},"created_at":"2026-05-18T01:37:40.670562+00:00","updated_at":"2026-05-18T01:37:40.670562+00:00"}