{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HWSAZ6FOFZUFPRSWFWPJ3O2KD7","short_pith_number":"pith:HWSAZ6FO","schema_version":"1.0","canonical_sha256":"3da40cf8ae2e6857c6562d9e9dbb4a1ffd9456cbd83a50abe71bb6980ca4f369","source":{"kind":"arxiv","id":"1102.4225","version":1},"attestation_state":"computed","paper":{"title":"Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LO","authors_text":"Catalin Dima, Ferucio Laurentiu Tiplea","submitted_at":"2011-02-21T13:48:39Z","abstract_excerpt":"We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non-halting problem for Turing machines."},"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":"1102.4225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-21T13:48:39Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"1ded0318f67eebef8300791d8a9902befe7a657a671852207a275b91b08f29e5","abstract_canon_sha256":"4a4d50b32c94bbc34b706f13954fbebcf06fad9c6e93dd274ce2fa8c46316971"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:10.697641Z","signature_b64":"HT1+0TVW3/rZ7PbKVlKiJpt958T1vWTDqGdzMf9wlQWNy/mLFt/Q78DfzpioRB5scWGgBjQqlYy2ycMmLMbOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3da40cf8ae2e6857c6562d9e9dbb4a1ffd9456cbd83a50abe71bb6980ca4f369","last_reissued_at":"2026-05-18T04:28:10.697008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:10.697008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LO","authors_text":"Catalin Dima, Ferucio Laurentiu Tiplea","submitted_at":"2011-02-21T13:48:39Z","abstract_excerpt":"We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non-halting problem for Turing machines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4225","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.4225","created_at":"2026-05-18T04:28:10.697098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4225v1","created_at":"2026-05-18T04:28:10.697098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4225","created_at":"2026-05-18T04:28:10.697098+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWSAZ6FOFZUF","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWSAZ6FOFZUFPRSW","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWSAZ6FO","created_at":"2026-05-18T12:26:30.835961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7","json":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7.json","graph_json":"https://pith.science/api/pith-number/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/graph.json","events_json":"https://pith.science/api/pith-number/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/events.json","paper":"https://pith.science/paper/HWSAZ6FO"},"agent_actions":{"view_html":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7","download_json":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7.json","view_paper":"https://pith.science/paper/HWSAZ6FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4225&json=true","fetch_graph":"https://pith.science/api/pith-number/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/graph.json","fetch_events":"https://pith.science/api/pith-number/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/action/storage_attestation","attest_author":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/action/author_attestation","sign_citation":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/action/citation_signature","submit_replication":"https://pith.science/pith/HWSAZ6FOFZUFPRSWFWPJ3O2KD7/action/replication_record"}},"created_at":"2026-05-18T04:28:10.697098+00:00","updated_at":"2026-05-18T04:28:10.697098+00:00"}