{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NMR54RPIPDROGTBJC6VGZWIIIG","short_pith_number":"pith:NMR54RPI","canonical_record":{"source":{"id":"2308.06298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-11T07:12:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8ba8049ba2d712fb4ef497d6a457043ed04df8b56cd81127d065985c37e3b1ed","abstract_canon_sha256":"0adeb8ff622a9d17d4d2e79b60350e775beacb05d92df23800059248fa05b29a"},"schema_version":"1.0"},"canonical_sha256":"6b23de45e878e2e34c2917aa6cd90841bb9ec43d826735ab9a032f55f843bac5","source":{"kind":"arxiv","id":"2308.06298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06298","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06298v2","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06298","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"NMR54RPIPDRO","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"pith_short_16","alias_value":"NMR54RPIPDROGTBJ","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"pith_short_8","alias_value":"NMR54RPI","created_at":"2026-07-05T10:58:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NMR54RPIPDROGTBJC6VGZWIIIG","target":"record","payload":{"canonical_record":{"source":{"id":"2308.06298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-11T07:12:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8ba8049ba2d712fb4ef497d6a457043ed04df8b56cd81127d065985c37e3b1ed","abstract_canon_sha256":"0adeb8ff622a9d17d4d2e79b60350e775beacb05d92df23800059248fa05b29a"},"schema_version":"1.0"},"canonical_sha256":"6b23de45e878e2e34c2917aa6cd90841bb9ec43d826735ab9a032f55f843bac5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:12.909271Z","signature_b64":"WSBaucwkQ2ZwjIeUweSFIfMkO0kGdmLNiHgUOOlG7814Nwg6jSnyKmOJ7MFIlyimykpl6mH/bDPq06RtgZCsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b23de45e878e2e34c2917aa6cd90841bb9ec43d826735ab9a032f55f843bac5","last_reissued_at":"2026-07-05T10:58:12.908774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:12.908774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.06298","source_version":2,"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-07-05T10:58:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnnJPdc6NYWgn19yObIw6Stjs1EUrNoGYMMUlCNRW+sDXcssI3kZtD7MEpc3TZuIq3gT6POtw0gow4PMPSoQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T11:16:20.712893Z"},"content_sha256":"a015523b6f495ea6abc593dcd8bcc4043cbdebc0753dc40ecb882f28cff6e1bc","schema_version":"1.0","event_id":"sha256:a015523b6f495ea6abc593dcd8bcc4043cbdebc0753dc40ecb882f28cff6e1bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NMR54RPIPDROGTBJC6VGZWIIIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On reachability of Markov decision processes: a novel state-classification-based PI approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Xianping Guo, Xin Guo, Yanyun Li","submitted_at":"2023-08-11T07:12:58Z","abstract_excerpt":"This paper concentrates on the reliability of a discrete-time controlled Markov system with finite states and actions, and aims to give an efficient algorithm for obtaining an optimal (control) policy that makes the system have the maximal reliability for every initial state. After establishing the existence of an optimal policy, for the computation of optimal policies, we introduce the concept of an absorbing set of a stationary policy, and find some characterization and a computational method of the absorbing sets. Using the largest absorbing set, we build a novel optimality equation (OE), a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06298","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.06298/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:58:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLTHbJjT4cbaXdrxt5Yt/9HTUb6H2Z5Kjj264sxkAR2CSBrQrNSDnKnwPero6LflMMTPF3y9mXOVAW4fZqfMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T11:16:20.713265Z"},"content_sha256":"1587e76dfb683e25a15982838a7e5268d0ec74fded801bda74ba33d0906b837c","schema_version":"1.0","event_id":"sha256:1587e76dfb683e25a15982838a7e5268d0ec74fded801bda74ba33d0906b837c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMR54RPIPDROGTBJC6VGZWIIIG/bundle.json","state_url":"https://pith.science/pith/NMR54RPIPDROGTBJC6VGZWIIIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMR54RPIPDROGTBJC6VGZWIIIG/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-07-10T11:16:20Z","links":{"resolver":"https://pith.science/pith/NMR54RPIPDROGTBJC6VGZWIIIG","bundle":"https://pith.science/pith/NMR54RPIPDROGTBJC6VGZWIIIG/bundle.json","state":"https://pith.science/pith/NMR54RPIPDROGTBJC6VGZWIIIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMR54RPIPDROGTBJC6VGZWIIIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NMR54RPIPDROGTBJC6VGZWIIIG","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":"0adeb8ff622a9d17d4d2e79b60350e775beacb05d92df23800059248fa05b29a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-11T07:12:58Z","title_canon_sha256":"8ba8049ba2d712fb4ef497d6a457043ed04df8b56cd81127d065985c37e3b1ed"},"schema_version":"1.0","source":{"id":"2308.06298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.06298","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"2308.06298v2","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06298","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"NMR54RPIPDRO","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"pith_short_16","alias_value":"NMR54RPIPDROGTBJ","created_at":"2026-07-05T10:58:12Z"},{"alias_kind":"pith_short_8","alias_value":"NMR54RPI","created_at":"2026-07-05T10:58:12Z"}],"graph_snapshots":[{"event_id":"sha256:1587e76dfb683e25a15982838a7e5268d0ec74fded801bda74ba33d0906b837c","target":"graph","created_at":"2026-07-05T10:58:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.06298/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper concentrates on the reliability of a discrete-time controlled Markov system with finite states and actions, and aims to give an efficient algorithm for obtaining an optimal (control) policy that makes the system have the maximal reliability for every initial state. After establishing the existence of an optimal policy, for the computation of optimal policies, we introduce the concept of an absorbing set of a stationary policy, and find some characterization and a computational method of the absorbing sets. Using the largest absorbing set, we build a novel optimality equation (OE), a","authors_text":"Xianping Guo, Xin Guo, Yanyun Li","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-11T07:12:58Z","title":"On reachability of Markov decision processes: a novel state-classification-based PI approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06298","kind":"arxiv","version":2},"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:a015523b6f495ea6abc593dcd8bcc4043cbdebc0753dc40ecb882f28cff6e1bc","target":"record","created_at":"2026-07-05T10:58:12Z","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":"0adeb8ff622a9d17d4d2e79b60350e775beacb05d92df23800059248fa05b29a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-11T07:12:58Z","title_canon_sha256":"8ba8049ba2d712fb4ef497d6a457043ed04df8b56cd81127d065985c37e3b1ed"},"schema_version":"1.0","source":{"id":"2308.06298","kind":"arxiv","version":2}},"canonical_sha256":"6b23de45e878e2e34c2917aa6cd90841bb9ec43d826735ab9a032f55f843bac5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b23de45e878e2e34c2917aa6cd90841bb9ec43d826735ab9a032f55f843bac5","first_computed_at":"2026-07-05T10:58:12.908774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:12.908774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WSBaucwkQ2ZwjIeUweSFIfMkO0kGdmLNiHgUOOlG7814Nwg6jSnyKmOJ7MFIlyimykpl6mH/bDPq06RtgZCsBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:12.909271Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.06298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a015523b6f495ea6abc593dcd8bcc4043cbdebc0753dc40ecb882f28cff6e1bc","sha256:1587e76dfb683e25a15982838a7e5268d0ec74fded801bda74ba33d0906b837c"],"state_sha256":"edc7aa390166b283e1aedb7246b70f6b101d671865961471d314d2370cc9b73b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4kjXvPCZLIoAkCmYM864bae50n7xWXmyyoKmhJ6571RkGUzqJLOzAcAmOWuglmCUPwFHGim0SP3e7puf8CwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T11:16:20.715222Z","bundle_sha256":"367ee4b20d7a0d5eacfc8680c57a53ec4a56db4dcf661ea5dd573899458a4dd6"}}