{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4Q7ZU3HRKGQEATADWHBE2X45K2","short_pith_number":"pith:4Q7ZU3HR","schema_version":"1.0","canonical_sha256":"e43f9a6cf151a0404c03b1c24d5f9d56bc190080ea6d62cef833ed8f7dba3ed8","source":{"kind":"arxiv","id":"1410.4801","version":3},"attestation_state":"computed","paper":{"title":"Percentile Queries in Multi-Dimensional Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jean-Fran\\c{c}ois Raskin, Mickael Randour, Ocan Sankur","submitted_at":"2014-10-17T17:33:33Z","abstract_excerpt":"Markov decision processes (MDPs) with multi-dimensional weights are useful to analyze systems with multiple objectives that may be conflicting and require the analysis of trade-offs. We study the complexity of percentile queries in such MDPs and give algorithms to synthesize strategies that enforce such constraints. Given a multi-dimensional weighted MDP and a quantitative payoff function $f$, thresholds $v_i$ (one per dimension), and probability thresholds $\\alpha_i$, we show how to compute a single strategy to enforce that for all dimensions $i$, the probability of outcomes $\\rho$ satisfying"},"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":"1410.4801","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-17T17:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"75586d4c427096fa2601fa54b1ff30bb1c6faa35873a70ecd6033f04cbb8ff7a","abstract_canon_sha256":"9c2c011e8ae2e080b05b0753f1ecc71f56154dcb7ff09e9dc60932d99dbd0bd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:39.643545Z","signature_b64":"qe5jopfSIis6zbBOR8om4YNGwWZfX27l1uU5vzqwsA8uyOOCHrJtyVC8pz7qAmIH2csmNHR+DQBppUj6JBpUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e43f9a6cf151a0404c03b1c24d5f9d56bc190080ea6d62cef833ed8f7dba3ed8","last_reissued_at":"2026-05-18T00:55:39.642985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:39.642985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Percentile Queries in Multi-Dimensional Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jean-Fran\\c{c}ois Raskin, Mickael Randour, Ocan Sankur","submitted_at":"2014-10-17T17:33:33Z","abstract_excerpt":"Markov decision processes (MDPs) with multi-dimensional weights are useful to analyze systems with multiple objectives that may be conflicting and require the analysis of trade-offs. We study the complexity of percentile queries in such MDPs and give algorithms to synthesize strategies that enforce such constraints. Given a multi-dimensional weighted MDP and a quantitative payoff function $f$, thresholds $v_i$ (one per dimension), and probability thresholds $\\alpha_i$, we show how to compute a single strategy to enforce that for all dimensions $i$, the probability of outcomes $\\rho$ satisfying"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4801","kind":"arxiv","version":3},"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":"1410.4801","created_at":"2026-05-18T00:55:39.643062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4801v3","created_at":"2026-05-18T00:55:39.643062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4801","created_at":"2026-05-18T00:55:39.643062+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Q7ZU3HRKGQE","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Q7ZU3HRKGQEATAD","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Q7ZU3HR","created_at":"2026-05-18T12:28:14.216126+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/4Q7ZU3HRKGQEATADWHBE2X45K2","json":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2.json","graph_json":"https://pith.science/api/pith-number/4Q7ZU3HRKGQEATADWHBE2X45K2/graph.json","events_json":"https://pith.science/api/pith-number/4Q7ZU3HRKGQEATADWHBE2X45K2/events.json","paper":"https://pith.science/paper/4Q7ZU3HR"},"agent_actions":{"view_html":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2","download_json":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2.json","view_paper":"https://pith.science/paper/4Q7ZU3HR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4801&json=true","fetch_graph":"https://pith.science/api/pith-number/4Q7ZU3HRKGQEATADWHBE2X45K2/graph.json","fetch_events":"https://pith.science/api/pith-number/4Q7ZU3HRKGQEATADWHBE2X45K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2/action/storage_attestation","attest_author":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2/action/author_attestation","sign_citation":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2/action/citation_signature","submit_replication":"https://pith.science/pith/4Q7ZU3HRKGQEATADWHBE2X45K2/action/replication_record"}},"created_at":"2026-05-18T00:55:39.643062+00:00","updated_at":"2026-05-18T00:55:39.643062+00:00"}