{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XZK6YVME4FWUCX47PYFLRYL45Z","short_pith_number":"pith:XZK6YVME","schema_version":"1.0","canonical_sha256":"be55ec5584e16d415f9f7e0ab8e17cee6342e3f9ed2f827f265e72fa75dc7c93","source":{"kind":"arxiv","id":"2104.07278","version":5},"attestation_state":"computed","paper":{"title":"Stochastic Processes with Expected Stopping Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen","submitted_at":"2021-04-15T07:12:19Z","abstract_excerpt":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected tota"},"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":"2104.07278","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-04-15T07:12:19Z","cross_cats_sorted":[],"title_canon_sha256":"b0d296bfe0bb2425b141c92c8be7fd4784df6d66a97177916d89f9616dce5b6e","abstract_canon_sha256":"cc901fe3d31199220bfa7c5d75fa73ab520d60d39dbe22793621f4e6a6141795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:07.838373Z","signature_b64":"u/UFQBUX+o4TQB2weGI9p/HSvh4OQacZZYlHVEKaTfzhnBEXKkJbA3dhDZ85eA/U+tqMo3mbW5uFRrtFE+0qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be55ec5584e16d415f9f7e0ab8e17cee6342e3f9ed2f827f265e72fa75dc7c93","last_reissued_at":"2026-07-05T09:34:07.837868Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:07.837868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Processes with Expected Stopping Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen","submitted_at":"2021-04-15T07:12:19Z","abstract_excerpt":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected tota"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07278","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.07278/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":"2104.07278","created_at":"2026-07-05T09:34:07.837927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.07278v5","created_at":"2026-07-05T09:34:07.837927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07278","created_at":"2026-07-05T09:34:07.837927+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZK6YVME4FWU","created_at":"2026-07-05T09:34:07.837927+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZK6YVME4FWUCX47","created_at":"2026-07-05T09:34:07.837927+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZK6YVME","created_at":"2026-07-05T09:34:07.837927+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/XZK6YVME4FWUCX47PYFLRYL45Z","json":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z.json","graph_json":"https://pith.science/api/pith-number/XZK6YVME4FWUCX47PYFLRYL45Z/graph.json","events_json":"https://pith.science/api/pith-number/XZK6YVME4FWUCX47PYFLRYL45Z/events.json","paper":"https://pith.science/paper/XZK6YVME"},"agent_actions":{"view_html":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z","download_json":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z.json","view_paper":"https://pith.science/paper/XZK6YVME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.07278&json=true","fetch_graph":"https://pith.science/api/pith-number/XZK6YVME4FWUCX47PYFLRYL45Z/graph.json","fetch_events":"https://pith.science/api/pith-number/XZK6YVME4FWUCX47PYFLRYL45Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z/action/storage_attestation","attest_author":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z/action/author_attestation","sign_citation":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z/action/citation_signature","submit_replication":"https://pith.science/pith/XZK6YVME4FWUCX47PYFLRYL45Z/action/replication_record"}},"created_at":"2026-07-05T09:34:07.837927+00:00","updated_at":"2026-07-05T09:34:07.837927+00:00"}