{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VNZ2UXGLNVY3DPYP233Z4YMCXX","short_pith_number":"pith:VNZ2UXGL","schema_version":"1.0","canonical_sha256":"ab73aa5ccb6d71b1bf0fd6f79e6182bdea5ca06df3141a3621a0d2cccd01851e","source":{"kind":"arxiv","id":"1612.02684","version":3},"attestation_state":"computed","paper":{"title":"Fixpoint Approximation of Strategic Abilities under Imperfect Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.MA","authors_text":"Damian Kurpiewski, Micha{\\l} Knapik, Wojciech Jamroga","submitted_at":"2016-12-08T15:07:57Z","abstract_excerpt":"Model checking of strategic ability under imperfect information is known to be hard. The complexity results range from NP-completeness to undecidability, depending on the precise setup of the problem. No less importantly, fixpoint equivalences do not generally hold for imperfect information strategies, which seriously hampers incremental synthesis of winning strategies. In this paper, we propose translations of ATLir formulae that provide lower and upper bounds for their truth values, and are cheaper to verify than the original specifications. That is, if the expression is verified as true the"},"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":"1612.02684","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-12-08T15:07:57Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"0c64198d7b33ad8d368f7c423396957cadeeee6f9280316661948fc4062b95a3","abstract_canon_sha256":"a45e7dcf5c7fb817cf41a6e7a89819249eb82dce5616ec253f97f7cb505e6c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:53.613552Z","signature_b64":"QKoIktZ7PybvMgTHdompF3dpeucBawQJwzKL1bhCVLXRgQCSlukTXzZkb+1Pq3CfijiSOm+10xnkjd1489DpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab73aa5ccb6d71b1bf0fd6f79e6182bdea5ca06df3141a3621a0d2cccd01851e","last_reissued_at":"2026-05-18T00:48:53.612800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:53.612800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixpoint Approximation of Strategic Abilities under Imperfect Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.MA","authors_text":"Damian Kurpiewski, Micha{\\l} Knapik, Wojciech Jamroga","submitted_at":"2016-12-08T15:07:57Z","abstract_excerpt":"Model checking of strategic ability under imperfect information is known to be hard. The complexity results range from NP-completeness to undecidability, depending on the precise setup of the problem. No less importantly, fixpoint equivalences do not generally hold for imperfect information strategies, which seriously hampers incremental synthesis of winning strategies. In this paper, we propose translations of ATLir formulae that provide lower and upper bounds for their truth values, and are cheaper to verify than the original specifications. That is, if the expression is verified as true the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02684","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":"1612.02684","created_at":"2026-05-18T00:48:53.612926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02684v3","created_at":"2026-05-18T00:48:53.612926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02684","created_at":"2026-05-18T00:48:53.612926+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNZ2UXGLNVY3","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNZ2UXGLNVY3DPYP","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNZ2UXGL","created_at":"2026-05-18T12:30:48.956258+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/VNZ2UXGLNVY3DPYP233Z4YMCXX","json":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX.json","graph_json":"https://pith.science/api/pith-number/VNZ2UXGLNVY3DPYP233Z4YMCXX/graph.json","events_json":"https://pith.science/api/pith-number/VNZ2UXGLNVY3DPYP233Z4YMCXX/events.json","paper":"https://pith.science/paper/VNZ2UXGL"},"agent_actions":{"view_html":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX","download_json":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX.json","view_paper":"https://pith.science/paper/VNZ2UXGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02684&json=true","fetch_graph":"https://pith.science/api/pith-number/VNZ2UXGLNVY3DPYP233Z4YMCXX/graph.json","fetch_events":"https://pith.science/api/pith-number/VNZ2UXGLNVY3DPYP233Z4YMCXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX/action/storage_attestation","attest_author":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX/action/author_attestation","sign_citation":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX/action/citation_signature","submit_replication":"https://pith.science/pith/VNZ2UXGLNVY3DPYP233Z4YMCXX/action/replication_record"}},"created_at":"2026-05-18T00:48:53.612926+00:00","updated_at":"2026-05-18T00:48:53.612926+00:00"}