{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4CWVCQYQVO3NQFTCYNFFVBHGCK","short_pith_number":"pith:4CWVCQYQ","schema_version":"1.0","canonical_sha256":"e0ad514310abb6d81662c34a5a84e612a5e089e24ecea3a14b6ade36294be004","source":{"kind":"arxiv","id":"1205.1473","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Expected Termination Time in One-Counter Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Anton\\'in Ku\\v{c}era, Dominik Wojtczak, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2012-05-04T14:21:11Z","abstract_excerpt":"We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision processes. Since the value may be irrational and an optimal strategy may be rather complicated, we concentrate on the problems of approximating the value up to a given error epsilon > 0 and computing a finite representation of an epsilon-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorit"},"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":"1205.1473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-05-04T14:21:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e48e5c92ba5ac1650aa1a7dd6e5594da51f0dfbf057918f26a0b3dc93c995045","abstract_canon_sha256":"4ac2f694525d85cdbcf2702970b15f2d9d57926d477698b170d494fe1748827e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:11.110850Z","signature_b64":"RJpuJmmwOJu4JZQOm5cOiYnsnEhnrMWvY5K3UlcsImlWcjy0ByTEMzYFohBDIiPivi9eHhSF8gol+dR651R+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0ad514310abb6d81662c34a5a84e612a5e089e24ecea3a14b6ade36294be004","last_reissued_at":"2026-05-18T03:56:11.110213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:11.110213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Expected Termination Time in One-Counter Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Anton\\'in Ku\\v{c}era, Dominik Wojtczak, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2012-05-04T14:21:11Z","abstract_excerpt":"We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision processes. Since the value may be irrational and an optimal strategy may be rather complicated, we concentrate on the problems of approximating the value up to a given error epsilon > 0 and computing a finite representation of an epsilon-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1473","kind":"arxiv","version":1},"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":"1205.1473","created_at":"2026-05-18T03:56:11.110308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1473v1","created_at":"2026-05-18T03:56:11.110308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1473","created_at":"2026-05-18T03:56:11.110308+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CWVCQYQVO3N","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CWVCQYQVO3NQFTC","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CWVCQYQ","created_at":"2026-05-18T12:26:53.410803+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/4CWVCQYQVO3NQFTCYNFFVBHGCK","json":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK.json","graph_json":"https://pith.science/api/pith-number/4CWVCQYQVO3NQFTCYNFFVBHGCK/graph.json","events_json":"https://pith.science/api/pith-number/4CWVCQYQVO3NQFTCYNFFVBHGCK/events.json","paper":"https://pith.science/paper/4CWVCQYQ"},"agent_actions":{"view_html":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK","download_json":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK.json","view_paper":"https://pith.science/paper/4CWVCQYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1473&json=true","fetch_graph":"https://pith.science/api/pith-number/4CWVCQYQVO3NQFTCYNFFVBHGCK/graph.json","fetch_events":"https://pith.science/api/pith-number/4CWVCQYQVO3NQFTCYNFFVBHGCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK/action/storage_attestation","attest_author":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK/action/author_attestation","sign_citation":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK/action/citation_signature","submit_replication":"https://pith.science/pith/4CWVCQYQVO3NQFTCYNFFVBHGCK/action/replication_record"}},"created_at":"2026-05-18T03:56:11.110308+00:00","updated_at":"2026-05-18T03:56:11.110308+00:00"}