{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JF4LUD4QTDKBMOO6IIT5YI74Y6","short_pith_number":"pith:JF4LUD4Q","schema_version":"1.0","canonical_sha256":"4978ba0f9098d41639de4227dc23fcc785c632f8434277329329c0648d6035c4","source":{"kind":"arxiv","id":"1502.05533","version":5},"attestation_state":"computed","paper":{"title":"Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.CC","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","submitted_at":"2015-02-19T11:39:01Z","abstract_excerpt":"We give polynomial time algorithms for quantitative (and qualitative) reachability analysis for Branching Markov Decision Processes (BMDPs). Specifically, given a BMDP, and given an initial population, where the objective of the controller is to maximize (or minimize) the probability of eventually reaching a population that contains an object of a desired (or undesired) type, we give algorithms for approximating the supremum (infimum) reachability probability, within desired precision epsilon > 0, in time polynomial in the encoding size of the BMDP and in log(1/epsilon). We furthermore give P-"},"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":"1502.05533","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-19T11:39:01Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"035d020c460d8f6225b0fb95f71a6942adeee95780d163c886623c34590f343c","abstract_canon_sha256":"a63dc0ab78e294b11e81ab15921dd1a59522ecd61c0845105ee85b3e27e7134f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:33.255121Z","signature_b64":"7PvvUA2Fy2ynCVOr8zpHEhdXCydaowBcdQGHsMsk9StC3pMo192M6hBlwFgsuUaqKekaEJr/gKc+lhS9DEaKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4978ba0f9098d41639de4227dc23fcc785c632f8434277329329c0648d6035c4","last_reissued_at":"2026-05-18T01:17:33.254511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:33.254511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.CC","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","submitted_at":"2015-02-19T11:39:01Z","abstract_excerpt":"We give polynomial time algorithms for quantitative (and qualitative) reachability analysis for Branching Markov Decision Processes (BMDPs). Specifically, given a BMDP, and given an initial population, where the objective of the controller is to maximize (or minimize) the probability of eventually reaching a population that contains an object of a desired (or undesired) type, we give algorithms for approximating the supremum (infimum) reachability probability, within desired precision epsilon > 0, in time polynomial in the encoding size of the BMDP and in log(1/epsilon). We furthermore give P-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05533","kind":"arxiv","version":5},"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":"1502.05533","created_at":"2026-05-18T01:17:33.254628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05533v5","created_at":"2026-05-18T01:17:33.254628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05533","created_at":"2026-05-18T01:17:33.254628+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF4LUD4QTDKB","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF4LUD4QTDKBMOO6","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF4LUD4Q","created_at":"2026-05-18T12:29:27.538025+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/JF4LUD4QTDKBMOO6IIT5YI74Y6","json":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6.json","graph_json":"https://pith.science/api/pith-number/JF4LUD4QTDKBMOO6IIT5YI74Y6/graph.json","events_json":"https://pith.science/api/pith-number/JF4LUD4QTDKBMOO6IIT5YI74Y6/events.json","paper":"https://pith.science/paper/JF4LUD4Q"},"agent_actions":{"view_html":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6","download_json":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6.json","view_paper":"https://pith.science/paper/JF4LUD4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05533&json=true","fetch_graph":"https://pith.science/api/pith-number/JF4LUD4QTDKBMOO6IIT5YI74Y6/graph.json","fetch_events":"https://pith.science/api/pith-number/JF4LUD4QTDKBMOO6IIT5YI74Y6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/action/storage_attestation","attest_author":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/action/author_attestation","sign_citation":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/action/citation_signature","submit_replication":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/action/replication_record"}},"created_at":"2026-05-18T01:17:33.254628+00:00","updated_at":"2026-05-18T01:17:33.254628+00:00"}