{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VCQQMX54GKDHWRZKK37TIJVVVI","short_pith_number":"pith:VCQQMX54","schema_version":"1.0","canonical_sha256":"a8a1065fbc32867b472a56ff3426b5aa3f89a8eecbc7fd0360d8d83113b681cd","source":{"kind":"arxiv","id":"1201.2834","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.2834","created_at":"2026-05-18T03:52:01.232724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2834v3","created_at":"2026-05-18T03:52:01.232724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2834","created_at":"2026-05-18T03:52:01.232724+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCQQMX54GKDH","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCQQMX54GKDHWRZK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCQQMX54","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.07094","citing_title":"Randomise Alone, Reach as a Team","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI","json":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI.json","graph_json":"https://pith.science/api/pith-number/VCQQMX54GKDHWRZKK37TIJVVVI/graph.json","events_json":"https://pith.science/api/pith-number/VCQQMX54GKDHWRZKK37TIJVVVI/events.json","paper":"https://pith.science/paper/VCQQMX54"},"agent_actions":{"view_html":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI","download_json":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI.json","view_paper":"https://pith.science/paper/VCQQMX54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2834&json=true","fetch_graph":"https://pith.science/api/pith-number/VCQQMX54GKDHWRZKK37TIJVVVI/graph.json","fetch_events":"https://pith.science/api/pith-number/VCQQMX54GKDHWRZKK37TIJVVVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/action/storage_attestation","attest_author":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/action/author_attestation","sign_citation":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/action/citation_signature","submit_replication":"https://pith.science/pith/VCQQMX54GKDHWRZKK37TIJVVVI/action/replication_record"}},"created_at":"2026-05-18T03:52:01.232724+00:00","updated_at":"2026-05-18T03:52:01.232724+00:00"}