{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MLMLJRNI2JQDM3NUQSIYNXGQVG","short_pith_number":"pith:MLMLJRNI","canonical_record":{"source":{"id":"1003.0118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-02-27T17:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"423cb0c0c9467df50122ec93cddd778d478f280b6650657df579bc6438ac7543","abstract_canon_sha256":"b6bdc0bee828fdb4d8f1dfa9facd7258248615a418a93e307244afa1d7214508"},"schema_version":"1.0"},"canonical_sha256":"62d8b4c5a8d260366db4849186dcd0a9b0e69b0f02b60319fe495299924fd95f","source":{"kind":"arxiv","id":"1003.0118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0118","created_at":"2026-05-18T04:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0118v1","created_at":"2026-05-18T04:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0118","created_at":"2026-05-18T04:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"MLMLJRNI2JQD","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MLMLJRNI2JQDM3NU","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MLMLJRNI","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MLMLJRNI2JQDM3NUQSIYNXGQVG","target":"record","payload":{"canonical_record":{"source":{"id":"1003.0118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-02-27T17:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"423cb0c0c9467df50122ec93cddd778d478f280b6650657df579bc6438ac7543","abstract_canon_sha256":"b6bdc0bee828fdb4d8f1dfa9facd7258248615a418a93e307244afa1d7214508"},"schema_version":"1.0"},"canonical_sha256":"62d8b4c5a8d260366db4849186dcd0a9b0e69b0f02b60319fe495299924fd95f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:31.970221Z","signature_b64":"RMqSnfdhk1SYmT80jPqsMN+vNzwhZQjU3krrpD+uD+8t2nLHUo3Ycesy1+BaDidW6Mq5s1HNRgLKEviiQBXdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62d8b4c5a8d260366db4849186dcd0a9b0e69b0f02b60319fe495299924fd95f","last_reissued_at":"2026-05-18T04:22:31.969678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:31.969678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.0118","source_version":1,"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-05-18T04:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wunUYFOzl6/on3PAUBPHXQd5p4DdcPWCepjsnikwUBu++oj53LR7bH4wRd3xtn0Pah5gxWyKyQhuvpOnTfzgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:04:23.968973Z"},"content_sha256":"98739e696fd84871aef38dad1bea2c556a0cb2909f7d2608f71ed86ed3924d78","schema_version":"1.0","event_id":"sha256:98739e696fd84871aef38dad1bea2c556a0cb2909f7d2608f71ed86ed3924d78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MLMLJRNI2JQDM3NUQSIYNXGQVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Qualitative Reachability in Stochastic BPA 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, Jan Obdr\\v{z}\\'alek, Tom\\'a\\v{s} Br\\'azdil, V\\'aclav Bro\\v{z}ek","submitted_at":"2010-02-27T17:42:19Z","abstract_excerpt":"We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is specified by a regular set of target configurations and a qualitative probability constraint `>0' or `=1'. The goal of one player is to maximize the probability of reaching the target set so that the constraint is satisfied, while the other player aims at the opposite. We show that the winner in such games can be determined in PTIME for the `>0' constraint, and both in NP and coNP for the `=1' constraint. Further, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0118","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"},"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-05-18T04:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvblVLfYUk/LcZVPuO3Z7AYkkGsLCYj/0yoNfOe4Zxrtwcg2VGuTZU6TloMDf8EB1gu3mR1zY2QpOvuiuzauAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:04:23.969570Z"},"content_sha256":"da023605ca63583d0599eac8c70d2e81aee203f11a98a1cb6c2c46a3f1b93e03","schema_version":"1.0","event_id":"sha256:da023605ca63583d0599eac8c70d2e81aee203f11a98a1cb6c2c46a3f1b93e03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG/bundle.json","state_url":"https://pith.science/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG/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-05-31T23:04:23Z","links":{"resolver":"https://pith.science/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG","bundle":"https://pith.science/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG/bundle.json","state":"https://pith.science/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLMLJRNI2JQDM3NUQSIYNXGQVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MLMLJRNI2JQDM3NUQSIYNXGQVG","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":"b6bdc0bee828fdb4d8f1dfa9facd7258248615a418a93e307244afa1d7214508","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-02-27T17:42:19Z","title_canon_sha256":"423cb0c0c9467df50122ec93cddd778d478f280b6650657df579bc6438ac7543"},"schema_version":"1.0","source":{"id":"1003.0118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0118","created_at":"2026-05-18T04:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0118v1","created_at":"2026-05-18T04:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0118","created_at":"2026-05-18T04:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"MLMLJRNI2JQD","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MLMLJRNI2JQDM3NU","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MLMLJRNI","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:da023605ca63583d0599eac8c70d2e81aee203f11a98a1cb6c2c46a3f1b93e03","target":"graph","created_at":"2026-05-18T04:22:31Z","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"},"paper":{"abstract_excerpt":"We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is specified by a regular set of target configurations and a qualitative probability constraint `>0' or `=1'. The goal of one player is to maximize the probability of reaching the target set so that the constraint is satisfied, while the other player aims at the opposite. We show that the winner in such games can be determined in PTIME for the `>0' constraint, and both in NP and coNP for the `=1' constraint. Further, we","authors_text":"Anton\\'in Ku\\v{c}era, Jan Obdr\\v{z}\\'alek, Tom\\'a\\v{s} Br\\'azdil, V\\'aclav Bro\\v{z}ek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-02-27T17:42:19Z","title":"Qualitative Reachability in Stochastic BPA Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0118","kind":"arxiv","version":1},"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:98739e696fd84871aef38dad1bea2c556a0cb2909f7d2608f71ed86ed3924d78","target":"record","created_at":"2026-05-18T04:22:31Z","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":"b6bdc0bee828fdb4d8f1dfa9facd7258248615a418a93e307244afa1d7214508","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-02-27T17:42:19Z","title_canon_sha256":"423cb0c0c9467df50122ec93cddd778d478f280b6650657df579bc6438ac7543"},"schema_version":"1.0","source":{"id":"1003.0118","kind":"arxiv","version":1}},"canonical_sha256":"62d8b4c5a8d260366db4849186dcd0a9b0e69b0f02b60319fe495299924fd95f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62d8b4c5a8d260366db4849186dcd0a9b0e69b0f02b60319fe495299924fd95f","first_computed_at":"2026-05-18T04:22:31.969678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:31.969678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMqSnfdhk1SYmT80jPqsMN+vNzwhZQjU3krrpD+uD+8t2nLHUo3Ycesy1+BaDidW6Mq5s1HNRgLKEviiQBXdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:31.970221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.0118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98739e696fd84871aef38dad1bea2c556a0cb2909f7d2608f71ed86ed3924d78","sha256:da023605ca63583d0599eac8c70d2e81aee203f11a98a1cb6c2c46a3f1b93e03"],"state_sha256":"0c0f2dd4dc47d5bb654221e20cfd7db94de095b09e4a5d50502cd2beca4922a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2Vcr1aHL9JCogZ/w7iXOfIA/lHTtzyDX5ojWT3j7pQ6TbCC7KXTooJIVpmTXBVts9fqCz9Fpy8/Hjrf0VICBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:04:23.972847Z","bundle_sha256":"72397a671ca6798eaafeb2f5e13bc5ec12e140bbcf3f355003d8c4cb4aed379c"}}