{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JF4LUD4QTDKBMOO6IIT5YI74Y6","short_pith_number":"pith:JF4LUD4Q","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"},"canonical_sha256":"4978ba0f9098d41639de4227dc23fcc785c632f8434277329329c0648d6035c4","source":{"kind":"arxiv","id":"1502.05533","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05533","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05533v5","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05533","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"JF4LUD4QTDKB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JF4LUD4QTDKBMOO6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JF4LUD4Q","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JF4LUD4QTDKBMOO6IIT5YI74Y6","target":"record","payload":{"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"},"canonical_sha256":"4978ba0f9098d41639de4227dc23fcc785c632f8434277329329c0648d6035c4","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"},"source_kind":"arxiv","source_id":"1502.05533","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdFbwuQikxcOw1ogg78Dnq2jdkudiHVBUJzBroSNjVq4yJemeYOz9fDIBoT48841FhE8qQiw31v7PJ3GFLg9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:39:24.720160Z"},"content_sha256":"75616a71842fdbdf13054ad536227585b29f8a7eda486780c837cbbdf1724546","schema_version":"1.0","event_id":"sha256:75616a71842fdbdf13054ad536227585b29f8a7eda486780c837cbbdf1724546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JF4LUD4QTDKBMOO6IIT5YI74Y6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUDboDW2L3ki0j0VEgZTPwbh3IQvEWSw1g/J6fvMxSOVdV3KBqLgL6cnQ7wnhFcV/2xCEX/pvLghCtbnT41uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:39:24.720511Z"},"content_sha256":"969acaa7fc8f1e1860e27b29feea454189690cf3ee110e95fcb61eefa39869a6","schema_version":"1.0","event_id":"sha256:969acaa7fc8f1e1860e27b29feea454189690cf3ee110e95fcb61eefa39869a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/bundle.json","state_url":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T20:39:24Z","links":{"resolver":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6","bundle":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/bundle.json","state":"https://pith.science/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF4LUD4QTDKBMOO6IIT5YI74Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JF4LUD4QTDKBMOO6IIT5YI74Y6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a63dc0ab78e294b11e81ab15921dd1a59522ecd61c0845105ee85b3e27e7134f","cross_cats_sorted":["cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-19T11:39:01Z","title_canon_sha256":"035d020c460d8f6225b0fb95f71a6942adeee95780d163c886623c34590f343c"},"schema_version":"1.0","source":{"id":"1502.05533","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05533","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05533v5","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05533","created_at":"2026-05-18T01:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"JF4LUD4QTDKB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JF4LUD4QTDKBMOO6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JF4LUD4Q","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:969acaa7fc8f1e1860e27b29feea454189690cf3ee110e95fcb61eefa39869a6","target":"graph","created_at":"2026-05-18T01:17:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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-","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","cross_cats":["cs.GT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-19T11:39:01Z","title":"Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05533","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:75616a71842fdbdf13054ad536227585b29f8a7eda486780c837cbbdf1724546","target":"record","created_at":"2026-05-18T01:17:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a63dc0ab78e294b11e81ab15921dd1a59522ecd61c0845105ee85b3e27e7134f","cross_cats_sorted":["cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-19T11:39:01Z","title_canon_sha256":"035d020c460d8f6225b0fb95f71a6942adeee95780d163c886623c34590f343c"},"schema_version":"1.0","source":{"id":"1502.05533","kind":"arxiv","version":5}},"canonical_sha256":"4978ba0f9098d41639de4227dc23fcc785c632f8434277329329c0648d6035c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4978ba0f9098d41639de4227dc23fcc785c632f8434277329329c0648d6035c4","first_computed_at":"2026-05-18T01:17:33.254511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:33.254511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7PvvUA2Fy2ynCVOr8zpHEhdXCydaowBcdQGHsMsk9StC3pMo192M6hBlwFgsuUaqKekaEJr/gKc+lhS9DEaKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:33.255121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05533","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75616a71842fdbdf13054ad536227585b29f8a7eda486780c837cbbdf1724546","sha256:969acaa7fc8f1e1860e27b29feea454189690cf3ee110e95fcb61eefa39869a6"],"state_sha256":"bc998466d71a5c1c6f8c62013ce1f6ea12f3e56effaa5a3ab55caf11d116d2a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUS2SjwRbtYWeXrpqDv4LBw6KIk/3F9nn+N6LQlBsnTgCx/tt/1x0O8c+4ZjvBWMNCKVsdVpP5hQ5yeewUpbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:39:24.722502Z","bundle_sha256":"e2450143fe74a8683d9608c65c652859afb828182366ad2fb65ca0f99ad6003e"}}