{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YXPHW7ONOZSL643MRXR5L47NO7","short_pith_number":"pith:YXPHW7ON","schema_version":"1.0","canonical_sha256":"c5de7b7dcd7664bf736c8de3d5f3ed77eb79d711165e6cf0166667126f7fd920","source":{"kind":"arxiv","id":"2108.09830","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for reachability problems on stochastic Markov reward models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LO","cs.NA"],"primary_cat":"math.NA","authors_text":"Irfan Muhammad","submitted_at":"2021-08-22T20:32:03Z","abstract_excerpt":"We study and develop the stochastic Markov reward model (sMRM), which extends the Markov chain where transition time/reward as modelled as random variables. Techniques are presented to enable computing first-passage time distributions (or reward distributions) with high accuracy for only modestly sized systems when solved for on a single computer. In contrast, naive simulations technique scale and are sufficient for a plethora of problems where high accuracy is not an issue, but this work perhaps would be valuable when extremely accurate solutions are demanded if it can be modelled precisely ("},"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":"2108.09830","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NA","submitted_at":"2021-08-22T20:32:03Z","cross_cats_sorted":["cs.LO","cs.NA"],"title_canon_sha256":"e5d11a47a06f94692745b4b3e693c602770e60955d8ff5aed3c230facac2c409","abstract_canon_sha256":"b26a8dcf08e566f3e6573d73d5a028f7f71a3689e19bba61b73bac8af0b0e4e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:07.801044Z","signature_b64":"L74sRgURq9aLCloXWvg2zJsyOcQcIN2htXrIzChyXwJKkGwAg9P3LrQhxqzE5vxmunqzcAXkraruQi7/hjKHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5de7b7dcd7664bf736c8de3d5f3ed77eb79d711165e6cf0166667126f7fd920","last_reissued_at":"2026-07-05T04:48:07.800704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:07.800704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for reachability problems on stochastic Markov reward models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LO","cs.NA"],"primary_cat":"math.NA","authors_text":"Irfan Muhammad","submitted_at":"2021-08-22T20:32:03Z","abstract_excerpt":"We study and develop the stochastic Markov reward model (sMRM), which extends the Markov chain where transition time/reward as modelled as random variables. Techniques are presented to enable computing first-passage time distributions (or reward distributions) with high accuracy for only modestly sized systems when solved for on a single computer. In contrast, naive simulations technique scale and are sufficient for a plethora of problems where high accuracy is not an issue, but this work perhaps would be valuable when extremely accurate solutions are demanded if it can be modelled precisely ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09830","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/2108.09830/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2108.09830","created_at":"2026-07-05T04:48:07.800760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.09830v2","created_at":"2026-07-05T04:48:07.800760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09830","created_at":"2026-07-05T04:48:07.800760+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXPHW7ONOZSL","created_at":"2026-07-05T04:48:07.800760+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXPHW7ONOZSL643M","created_at":"2026-07-05T04:48:07.800760+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXPHW7ON","created_at":"2026-07-05T04:48:07.800760+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/YXPHW7ONOZSL643MRXR5L47NO7","json":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7.json","graph_json":"https://pith.science/api/pith-number/YXPHW7ONOZSL643MRXR5L47NO7/graph.json","events_json":"https://pith.science/api/pith-number/YXPHW7ONOZSL643MRXR5L47NO7/events.json","paper":"https://pith.science/paper/YXPHW7ON"},"agent_actions":{"view_html":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7","download_json":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7.json","view_paper":"https://pith.science/paper/YXPHW7ON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.09830&json=true","fetch_graph":"https://pith.science/api/pith-number/YXPHW7ONOZSL643MRXR5L47NO7/graph.json","fetch_events":"https://pith.science/api/pith-number/YXPHW7ONOZSL643MRXR5L47NO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7/action/storage_attestation","attest_author":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7/action/author_attestation","sign_citation":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7/action/citation_signature","submit_replication":"https://pith.science/pith/YXPHW7ONOZSL643MRXR5L47NO7/action/replication_record"}},"created_at":"2026-07-05T04:48:07.800760+00:00","updated_at":"2026-07-05T04:48:07.800760+00:00"}