{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JNTSDY7AGRRUM5BGDUS3MD5EPH","short_pith_number":"pith:JNTSDY7A","schema_version":"1.0","canonical_sha256":"4b6721e3e034634674261d25b60fa479ffce62ca52d53fafb08e6f6b39f5bac5","source":{"kind":"arxiv","id":"1809.03107","version":1},"attestation_state":"computed","paper":{"title":"Multi-weighted Markov Decision Processes with Reachability Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mauricio Gonz\\'alez, Mickael Randour, Nicolas Markey, Patricia Bouyer","submitted_at":"2018-09-10T02:34:59Z","abstract_excerpt":"In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reachability condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasabili"},"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":"1809.03107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"001f7b30c86978f2ffc9013f6330f0b743ac180a76bd93801c854955b21559ee","abstract_canon_sha256":"c1da47997fa977fcd782662d026c33b41992100ce65d911ca8bfebb21d5a2ede"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:09.982773Z","signature_b64":"w7CpJhQmRTIX0slHCPvJES4jT2YBuOEtKrjWz6NEALAv/M33oW7S3rD5V9VwZ3buuyEgdlBiHBStx7XpB06nDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6721e3e034634674261d25b60fa479ffce62ca52d53fafb08e6f6b39f5bac5","last_reissued_at":"2026-05-18T00:06:09.982151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:09.982151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-weighted Markov Decision Processes with Reachability Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mauricio Gonz\\'alez, Mickael Randour, Nicolas Markey, Patricia Bouyer","submitted_at":"2018-09-10T02:34:59Z","abstract_excerpt":"In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reachability condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03107","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.03107","created_at":"2026-05-18T00:06:09.982225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03107v1","created_at":"2026-05-18T00:06:09.982225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03107","created_at":"2026-05-18T00:06:09.982225+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNTSDY7AGRRU","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNTSDY7AGRRUM5BG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNTSDY7A","created_at":"2026-05-18T12:32:31.084164+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/JNTSDY7AGRRUM5BGDUS3MD5EPH","json":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH.json","graph_json":"https://pith.science/api/pith-number/JNTSDY7AGRRUM5BGDUS3MD5EPH/graph.json","events_json":"https://pith.science/api/pith-number/JNTSDY7AGRRUM5BGDUS3MD5EPH/events.json","paper":"https://pith.science/paper/JNTSDY7A"},"agent_actions":{"view_html":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH","download_json":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH.json","view_paper":"https://pith.science/paper/JNTSDY7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03107&json=true","fetch_graph":"https://pith.science/api/pith-number/JNTSDY7AGRRUM5BGDUS3MD5EPH/graph.json","fetch_events":"https://pith.science/api/pith-number/JNTSDY7AGRRUM5BGDUS3MD5EPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH/action/storage_attestation","attest_author":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH/action/author_attestation","sign_citation":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH/action/citation_signature","submit_replication":"https://pith.science/pith/JNTSDY7AGRRUM5BGDUS3MD5EPH/action/replication_record"}},"created_at":"2026-05-18T00:06:09.982225+00:00","updated_at":"2026-05-18T00:06:09.982225+00:00"}