{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZDK2J2XX6ZZQQ3AHATXJLRMNN2","short_pith_number":"pith:ZDK2J2XX","schema_version":"1.0","canonical_sha256":"c8d5a4eaf7f673086c0704ee95c58d6ea6663f5d5a0fa012f376e86cd1110ab5","source":{"kind":"arxiv","id":"1104.4978","version":2},"attestation_state":"computed","paper":{"title":"Approximating the Termination Value of One-Counter MDPs and Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era, Kousha Etessami, Tom\\'a\\v{s} Br\\'azdil, V\\'aclav Bro\\v{z}ek","submitted_at":"2011-04-26T17:42:51Z","abstract_excerpt":"One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter stack alphabet). A key objective for the analysis and verification of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems (\"is the optimal term"},"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":"1104.4978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-26T17:42:51Z","cross_cats_sorted":[],"title_canon_sha256":"7b34905e88f7d6e4b869497e9af65b834157325fdd325a152aff7528500db40f","abstract_canon_sha256":"6c27b40822b3bde2ae367432e7b9b88f895430b0d348e7f6d3a9982b8b3da69f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:14.809302Z","signature_b64":"VmOUgxe34WeD0YsthUomIKXFRTynbJU0fnt28NgioXcwlNN/HomkuRAdEh57Pn2kBKXU9R38KyGU8I04XT6hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8d5a4eaf7f673086c0704ee95c58d6ea6663f5d5a0fa012f376e86cd1110ab5","last_reissued_at":"2026-05-18T04:17:14.808704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:14.808704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Termination Value of One-Counter MDPs and Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era, Kousha Etessami, Tom\\'a\\v{s} Br\\'azdil, V\\'aclav Bro\\v{z}ek","submitted_at":"2011-04-26T17:42:51Z","abstract_excerpt":"One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter stack alphabet). A key objective for the analysis and verification of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems (\"is the optimal term"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4978","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":""},"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":"1104.4978","created_at":"2026-05-18T04:17:14.808780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4978v2","created_at":"2026-05-18T04:17:14.808780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4978","created_at":"2026-05-18T04:17:14.808780+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDK2J2XX6ZZQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDK2J2XX6ZZQQ3AH","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDK2J2XX","created_at":"2026-05-18T12:26:47.523578+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/ZDK2J2XX6ZZQQ3AHATXJLRMNN2","json":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2.json","graph_json":"https://pith.science/api/pith-number/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/graph.json","events_json":"https://pith.science/api/pith-number/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/events.json","paper":"https://pith.science/paper/ZDK2J2XX"},"agent_actions":{"view_html":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2","download_json":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2.json","view_paper":"https://pith.science/paper/ZDK2J2XX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4978&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/action/storage_attestation","attest_author":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/action/author_attestation","sign_citation":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/action/citation_signature","submit_replication":"https://pith.science/pith/ZDK2J2XX6ZZQQ3AHATXJLRMNN2/action/replication_record"}},"created_at":"2026-05-18T04:17:14.808780+00:00","updated_at":"2026-05-18T04:17:14.808780+00:00"}