{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CHBHYNIQETXBGYB6RMKTQTPPA5","short_pith_number":"pith:CHBHYNIQ","canonical_record":{"source":{"id":"1103.1065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-05T16:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"438446f0925c91095bbcf5790ed38b2881fc91301720cf8e255f282ecd5189de","abstract_canon_sha256":"0740a7d0fe2599278ef92f6a94087db0788ebe05a77b84c4778d45d1945e4925"},"schema_version":"1.0"},"canonical_sha256":"11c27c351024ee13603e8b15384def076d442155ef40850e1ec4550591be0e35","source":{"kind":"arxiv","id":"1103.1065","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1065","created_at":"2026-05-18T04:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1065v3","created_at":"2026-05-18T04:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1065","created_at":"2026-05-18T04:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"CHBHYNIQETXB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CHBHYNIQETXBGYB6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CHBHYNIQ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CHBHYNIQETXBGYB6RMKTQTPPA5","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-05T16:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"438446f0925c91095bbcf5790ed38b2881fc91301720cf8e255f282ecd5189de","abstract_canon_sha256":"0740a7d0fe2599278ef92f6a94087db0788ebe05a77b84c4778d45d1945e4925"},"schema_version":"1.0"},"canonical_sha256":"11c27c351024ee13603e8b15384def076d442155ef40850e1ec4550591be0e35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:21.986227Z","signature_b64":"n8ZDvwc8SoBJB1FjtI2I6oobmonICrVTMKlKaTukgpLSNA0lrjZP3ntIh4TOtZAQ5vMPyt683d6m2O6MY/7vCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c27c351024ee13603e8b15384def076d442155ef40850e1ec4550591be0e35","last_reissued_at":"2026-05-18T04:20:21.985618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:21.985618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1065","source_version":3,"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:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dURbT4+mCHPiRYP3L7wECPRBoigge6/6XTFk1/j+vpE2M8bDXtggtXXzdg3hpPRa9v9xMrAUJfv7stUc72/dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:00:47.845737Z"},"content_sha256":"101f8cc2a30224e56f63da014eaff8ffeaf962fdd1bc5aada307a939ee42d22a","schema_version":"1.0","event_id":"sha256:101f8cc2a30224e56f63da014eaff8ffeaf962fdd1bc5aada307a939ee42d22a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CHBHYNIQETXBGYB6RMKTQTPPA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Strategies in Infinite-state Stochastic Reachability Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"V\\'aclav Bro\\v{z}ek","submitted_at":"2011-03-05T16:29:49Z","abstract_excerpt":"We consider perfect-information reachability stochastic games for 2 players on infinite graphs. We identify a subclass of such games, and prove two interesting properties of it: first, Player Max always has optimal strategies in games from this subclass, and second, these games are strongly determined. The subclass is defined by the property that the set of all values can only have one accumulation point -- 0. Our results nicely mirror recent results for finitely-branching games, where, on the contrary, Player Min always has optimal strategies. However, our proof methods are substantially diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1065","kind":"arxiv","version":3},"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:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wZf9MKqoUOWZDA52l5sVEc9c2wojB3ej6WUWLjN9QqDjP1jYXpK6zG36h7DsEKUaa7w0pbUd15ZJM3VDAnbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:00:47.846268Z"},"content_sha256":"c02fc339bceb005e7b843d12f197a0954dcd1cff530e9faa58a9a3ac403e02ed","schema_version":"1.0","event_id":"sha256:c02fc339bceb005e7b843d12f197a0954dcd1cff530e9faa58a9a3ac403e02ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHBHYNIQETXBGYB6RMKTQTPPA5/bundle.json","state_url":"https://pith.science/pith/CHBHYNIQETXBGYB6RMKTQTPPA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHBHYNIQETXBGYB6RMKTQTPPA5/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-06-03T14:00:47Z","links":{"resolver":"https://pith.science/pith/CHBHYNIQETXBGYB6RMKTQTPPA5","bundle":"https://pith.science/pith/CHBHYNIQETXBGYB6RMKTQTPPA5/bundle.json","state":"https://pith.science/pith/CHBHYNIQETXBGYB6RMKTQTPPA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHBHYNIQETXBGYB6RMKTQTPPA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CHBHYNIQETXBGYB6RMKTQTPPA5","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":"0740a7d0fe2599278ef92f6a94087db0788ebe05a77b84c4778d45d1945e4925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-05T16:29:49Z","title_canon_sha256":"438446f0925c91095bbcf5790ed38b2881fc91301720cf8e255f282ecd5189de"},"schema_version":"1.0","source":{"id":"1103.1065","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1065","created_at":"2026-05-18T04:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1065v3","created_at":"2026-05-18T04:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1065","created_at":"2026-05-18T04:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"CHBHYNIQETXB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CHBHYNIQETXBGYB6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CHBHYNIQ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:c02fc339bceb005e7b843d12f197a0954dcd1cff530e9faa58a9a3ac403e02ed","target":"graph","created_at":"2026-05-18T04:20:21Z","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 perfect-information reachability stochastic games for 2 players on infinite graphs. We identify a subclass of such games, and prove two interesting properties of it: first, Player Max always has optimal strategies in games from this subclass, and second, these games are strongly determined. The subclass is defined by the property that the set of all values can only have one accumulation point -- 0. Our results nicely mirror recent results for finitely-branching games, where, on the contrary, Player Min always has optimal strategies. However, our proof methods are substantially diff","authors_text":"V\\'aclav Bro\\v{z}ek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-05T16:29:49Z","title":"Optimal Strategies in Infinite-state Stochastic Reachability Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1065","kind":"arxiv","version":3},"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:101f8cc2a30224e56f63da014eaff8ffeaf962fdd1bc5aada307a939ee42d22a","target":"record","created_at":"2026-05-18T04:20:21Z","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":"0740a7d0fe2599278ef92f6a94087db0788ebe05a77b84c4778d45d1945e4925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-05T16:29:49Z","title_canon_sha256":"438446f0925c91095bbcf5790ed38b2881fc91301720cf8e255f282ecd5189de"},"schema_version":"1.0","source":{"id":"1103.1065","kind":"arxiv","version":3}},"canonical_sha256":"11c27c351024ee13603e8b15384def076d442155ef40850e1ec4550591be0e35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11c27c351024ee13603e8b15384def076d442155ef40850e1ec4550591be0e35","first_computed_at":"2026-05-18T04:20:21.985618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:21.985618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8ZDvwc8SoBJB1FjtI2I6oobmonICrVTMKlKaTukgpLSNA0lrjZP3ntIh4TOtZAQ5vMPyt683d6m2O6MY/7vCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:21.986227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1065","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:101f8cc2a30224e56f63da014eaff8ffeaf962fdd1bc5aada307a939ee42d22a","sha256:c02fc339bceb005e7b843d12f197a0954dcd1cff530e9faa58a9a3ac403e02ed"],"state_sha256":"bb01e3d40a8516172bb95e88da6283e919d1bcdf6dcd04d650788485797dcaf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8DQcymVloMUQjVhvxm9d0FX4rWo8HnzaqJk2LajZZkaA0C1LQv1A/dqliE2MzTSkvJMFsIkc9UqAWs9UGKxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:00:47.848779Z","bundle_sha256":"4b14239daf3470d031589ac1a3e9cba52f869efbc5bf88e2a945c4d78d7cef4c"}}