{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VCQQMX54GKDHWRZKK37TIJVVVI","short_pith_number":"pith:VCQQMX54","canonical_record":{"source":{"id":"1201.2834","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-13T13:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"f09d8c54b5e252cb644baf2fd37696a45385c9ba7a7b7e2730963636b887f747","abstract_canon_sha256":"069f70341cef1f6794e5350e9cbee9cc1b9f0aac7fbe82054b9795d2a588f39c"},"schema_version":"1.0"},"canonical_sha256":"a8a1065fbc32867b472a56ff3426b5aa3f89a8eecbc7fd0360d8d83113b681cd","source":{"kind":"arxiv","id":"1201.2834","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2834","created_at":"2026-05-18T03:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2834v3","created_at":"2026-05-18T03:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2834","created_at":"2026-05-18T03:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"VCQQMX54GKDH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VCQQMX54GKDHWRZK","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VCQQMX54","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VCQQMX54GKDHWRZKK37TIJVVVI","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2834","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-13T13:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"f09d8c54b5e252cb644baf2fd37696a45385c9ba7a7b7e2730963636b887f747","abstract_canon_sha256":"069f70341cef1f6794e5350e9cbee9cc1b9f0aac7fbe82054b9795d2a588f39c"},"schema_version":"1.0"},"canonical_sha256":"a8a1065fbc32867b472a56ff3426b5aa3f89a8eecbc7fd0360d8d83113b681cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:01.233374Z","signature_b64":"cD6R9V/P3h4FjzXERDJhO4/vmQ60qPolKFruL4lNsO/UEtPtLWGHwwcNW/UTlFjAMJ78jDlLxjA0tnYlsIaFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a1065fbc32867b472a56ff3426b5aa3f89a8eecbc7fd0360d8d83113b681cd","last_reissued_at":"2026-05-18T03:52:01.232598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:01.232598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2834","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-18T03:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mrCMbERg50I0l5SuFh1DIQ65oYxznKd8ie8UmuIuUvKHjn5bJ2+F95PT8dAiYSogSBbzmrW2/WyWq26M/E5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:53:35.074906Z"},"content_sha256":"6281e4fb2849ce3b0c7909f97eb3d0e9570da9c66a3ac02b02c670bb04b5a6b3","schema_version":"1.0","event_id":"sha256:6281e4fb2849ce3b0c7909f97eb3d0e9570da9c66a3ac02b02c670bb04b5a6b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VCQQMX54GKDHWRZKK37TIJVVVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategy Improvement for Concurrent Reachability and Safety Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger","submitted_at":"2012-01-13T13:38:21Z","abstract_excerpt":"We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of the fact that in concurrent reachability games, for all $\\epsilon>0$, memoryless $\\epsilon$-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an $\\epsilon$-optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2834","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-18T03:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHZT5peHaE0ZoqcBNWk8zu+Q84500sC2XGS1JZXJT+uWyWZRMV8MgMDNbLa2wBmtyiPTGWcrQmk1vVc+FhjICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:53:35.075574Z"},"content_sha256":"f4ffd7f0ee3f6558fd377bc2a9d92b99a458a1e3a22f2a004fa6517db79d4c67","schema_version":"1.0","event_id":"sha256:f4ffd7f0ee3f6558fd377bc2a9d92b99a458a1e3a22f2a004fa6517db79d4c67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/bundle.json","state_url":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCQQMX54GKDHWRZKK37TIJVVVI/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-26T07:53:35Z","links":{"resolver":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI","bundle":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/bundle.json","state":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCQQMX54GKDHWRZKK37TIJVVVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VCQQMX54GKDHWRZKK37TIJVVVI","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":"069f70341cef1f6794e5350e9cbee9cc1b9f0aac7fbe82054b9795d2a588f39c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-13T13:38:21Z","title_canon_sha256":"f09d8c54b5e252cb644baf2fd37696a45385c9ba7a7b7e2730963636b887f747"},"schema_version":"1.0","source":{"id":"1201.2834","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2834","created_at":"2026-05-18T03:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2834v3","created_at":"2026-05-18T03:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2834","created_at":"2026-05-18T03:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"VCQQMX54GKDH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VCQQMX54GKDHWRZK","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VCQQMX54","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:f4ffd7f0ee3f6558fd377bc2a9d92b99a458a1e3a22f2a004fa6517db79d4c67","target":"graph","created_at":"2026-05-18T03:52:01Z","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 concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of the fact that in concurrent reachability games, for all $\\epsilon>0$, memoryless $\\epsilon$-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an $\\epsilon$-optima","authors_text":"Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-13T13:38:21Z","title":"Strategy Improvement for Concurrent Reachability and Safety Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2834","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:6281e4fb2849ce3b0c7909f97eb3d0e9570da9c66a3ac02b02c670bb04b5a6b3","target":"record","created_at":"2026-05-18T03:52:01Z","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":"069f70341cef1f6794e5350e9cbee9cc1b9f0aac7fbe82054b9795d2a588f39c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-13T13:38:21Z","title_canon_sha256":"f09d8c54b5e252cb644baf2fd37696a45385c9ba7a7b7e2730963636b887f747"},"schema_version":"1.0","source":{"id":"1201.2834","kind":"arxiv","version":3}},"canonical_sha256":"a8a1065fbc32867b472a56ff3426b5aa3f89a8eecbc7fd0360d8d83113b681cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8a1065fbc32867b472a56ff3426b5aa3f89a8eecbc7fd0360d8d83113b681cd","first_computed_at":"2026-05-18T03:52:01.232598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:01.232598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cD6R9V/P3h4FjzXERDJhO4/vmQ60qPolKFruL4lNsO/UEtPtLWGHwwcNW/UTlFjAMJ78jDlLxjA0tnYlsIaFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:01.233374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2834","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6281e4fb2849ce3b0c7909f97eb3d0e9570da9c66a3ac02b02c670bb04b5a6b3","sha256:f4ffd7f0ee3f6558fd377bc2a9d92b99a458a1e3a22f2a004fa6517db79d4c67"],"state_sha256":"4fe0bf6c63b8633815ad52b8ded240357d00632c4e5752d099c64fc31332a3de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWGznN9szJYFoLbNieupmIBvMSJnapmKwffF17tFWVVBBNJqvlyFZ/qHcKO4RUL6ura5IAU1QyDzoNWeiuRcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:53:35.079386Z","bundle_sha256":"a5e92928fe2604ee85955b46daf67ae39669a265a691c56ae11a91138092045b"}}