{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VBSCCLTWMUAZAHGS5CQGJNVHOP","short_pith_number":"pith:VBSCCLTW","canonical_record":{"source":{"id":"1009.5636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-09-28T17:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"66f630238f7e38d72c3f2c9f15de0fbd04dd8d934c1ff7d42449c3d1949b64dc","abstract_canon_sha256":"cf2940fa3317ea2a1cd26cfb4fe213d3ffe4fb735e58e6bb94f1e19deae4bd4f"},"schema_version":"1.0"},"canonical_sha256":"a864212e766501901cd2e8a064b6a773df677bcdd44e34d0bd7f6cfe953e9e25","source":{"kind":"arxiv","id":"1009.5636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5636","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5636v1","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5636","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"VBSCCLTWMUAZ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBSCCLTWMUAZAHGS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBSCCLTW","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VBSCCLTWMUAZAHGS5CQGJNVHOP","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-09-28T17:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"66f630238f7e38d72c3f2c9f15de0fbd04dd8d934c1ff7d42449c3d1949b64dc","abstract_canon_sha256":"cf2940fa3317ea2a1cd26cfb4fe213d3ffe4fb735e58e6bb94f1e19deae4bd4f"},"schema_version":"1.0"},"canonical_sha256":"a864212e766501901cd2e8a064b6a773df677bcdd44e34d0bd7f6cfe953e9e25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:09.713533Z","signature_b64":"aI26kmjGoKF3EcRytGRzfn/N2DHResaw4R6JkOqfH9ll1gcbx09HiVW6BBKT0Tn0gs9TXolbv+dzvjq165gVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a864212e766501901cd2e8a064b6a773df677bcdd44e34d0bd7f6cfe953e9e25","last_reissued_at":"2026-05-18T04:40:09.713014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:09.713014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5636","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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZB0WV4MPJywwHtM6Mj5KfHLH4eCJ9LFDC4e1KqRoDrWimbWOb+RJbf/nL6Fdu3Jt/nFfpiby+981Ncw/ZLsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:18:42.479901Z"},"content_sha256":"e7ba06d3d65bdff062024f4bbd73b800de7da4677df618cf02e8a75c8675bfd1","schema_version":"1.0","event_id":"sha256:e7ba06d3d65bdff062024f4bbd73b800de7da4677df618cf02e8a75c8675bfd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VBSCCLTWMUAZAHGS5CQGJNVHOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Counter Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kousha Etessami, Tom\\'a\\v{s} Br\\'azdil, V\\'aclav Bro\\v{z}ek","submitted_at":"2010-09-28T17:28:41Z","abstract_excerpt":"We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stochastic games played on the transition graph of classic one-counter automata. We study primarily the termination objective, where the goal of one player is to maximize the probability of reaching counter value 0, while the other player wishes to avoid this. Partly motivated by the goal of understanding termination objectives, we also study certain \"limit\" and \"long run average\" reward objectives that are closely related"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5636","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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z22TJc3KN9HP+Vhr4OFvmAtZOMJ3jYlv+eBPFDTOceXtKvmHdG+uDNKo5DdtzebNgcM2Fm7K4DX8jWi2CgaGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:18:42.480591Z"},"content_sha256":"2f9ab3dd2cbf8bbaa8898163f9a2fe3eca343607c99aac8eb69d4376002624cd","schema_version":"1.0","event_id":"sha256:2f9ab3dd2cbf8bbaa8898163f9a2fe3eca343607c99aac8eb69d4376002624cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP/bundle.json","state_url":"https://pith.science/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP/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-31T18:18:42Z","links":{"resolver":"https://pith.science/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP","bundle":"https://pith.science/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP/bundle.json","state":"https://pith.science/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBSCCLTWMUAZAHGS5CQGJNVHOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VBSCCLTWMUAZAHGS5CQGJNVHOP","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":"cf2940fa3317ea2a1cd26cfb4fe213d3ffe4fb735e58e6bb94f1e19deae4bd4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-09-28T17:28:41Z","title_canon_sha256":"66f630238f7e38d72c3f2c9f15de0fbd04dd8d934c1ff7d42449c3d1949b64dc"},"schema_version":"1.0","source":{"id":"1009.5636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5636","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5636v1","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5636","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"VBSCCLTWMUAZ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBSCCLTWMUAZAHGS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBSCCLTW","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:2f9ab3dd2cbf8bbaa8898163f9a2fe3eca343607c99aac8eb69d4376002624cd","target":"graph","created_at":"2026-05-18T04:40:09Z","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 study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stochastic games played on the transition graph of classic one-counter automata. We study primarily the termination objective, where the goal of one player is to maximize the probability of reaching counter value 0, while the other player wishes to avoid this. Partly motivated by the goal of understanding termination objectives, we also study certain \"limit\" and \"long run average\" reward objectives that are closely related","authors_text":"Kousha Etessami, 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-09-28T17:28:41Z","title":"One-Counter Stochastic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5636","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:e7ba06d3d65bdff062024f4bbd73b800de7da4677df618cf02e8a75c8675bfd1","target":"record","created_at":"2026-05-18T04:40:09Z","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":"cf2940fa3317ea2a1cd26cfb4fe213d3ffe4fb735e58e6bb94f1e19deae4bd4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-09-28T17:28:41Z","title_canon_sha256":"66f630238f7e38d72c3f2c9f15de0fbd04dd8d934c1ff7d42449c3d1949b64dc"},"schema_version":"1.0","source":{"id":"1009.5636","kind":"arxiv","version":1}},"canonical_sha256":"a864212e766501901cd2e8a064b6a773df677bcdd44e34d0bd7f6cfe953e9e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a864212e766501901cd2e8a064b6a773df677bcdd44e34d0bd7f6cfe953e9e25","first_computed_at":"2026-05-18T04:40:09.713014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:09.713014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aI26kmjGoKF3EcRytGRzfn/N2DHResaw4R6JkOqfH9ll1gcbx09HiVW6BBKT0Tn0gs9TXolbv+dzvjq165gVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:09.713533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7ba06d3d65bdff062024f4bbd73b800de7da4677df618cf02e8a75c8675bfd1","sha256:2f9ab3dd2cbf8bbaa8898163f9a2fe3eca343607c99aac8eb69d4376002624cd"],"state_sha256":"7d8396d6bb3fab546192cf6b09ec839f3e028b8fe97620501532559515dc0f1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XY03ZJPMO0lNxOvTeg+2zQ+K+hu+cVs9kSm+uqSkCxaNvMFFqIRuCq7hgkNNXb3AlK3YZEk5vzc98+7awEtmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:18:42.484536Z","bundle_sha256":"6ed4fdbccde62766023bab3ea57343c085b4339718d67bd86a7e7c10d373aa91"}}