{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5DQTODIUIE2WD2VILYFFBRKYFL","short_pith_number":"pith:5DQTODIU","schema_version":"1.0","canonical_sha256":"e8e1370d14413561eaa85e0a50c5582afa63940695fb637618cf05079bd54524","source":{"kind":"arxiv","id":"1106.1978","version":3},"attestation_state":"computed","paper":{"title":"An Algorithm for Probabilistic Alternating Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Chenyi Zhang, Jun Pang","submitted_at":"2011-06-10T08:43:28Z","abstract_excerpt":"In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with respect to the behaviour of a subset of players. We propose a partition based algorithm for computing the largest PA-simulation, which is to our knowledge the first such algorithm that works in polynomial time, by extending the generalised coarsest partition problem (GCPP) in a game-based setting with mixed strategies. The algorithm has higher complexities than those in the literature for non-probabilistic simulation an"},"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":"1106.1978","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-06-10T08:43:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"305dc61a91f86c64823cf94ff148d1fa97f7fb3242664c7e606ceb279fc671f8","abstract_canon_sha256":"135cced525a96eeeef8e93c9b7b7bfc8d03dec41afa8cbdd539a8cce9bac26fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:44.003171Z","signature_b64":"qMxLjNB/4eNYRpd+K1ld8GIRc0Vixqj2gk1cGHJL2WY3k8Oks25GcekHPfKyOuvUBRa+2X9myypXW7bloaqiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8e1370d14413561eaa85e0a50c5582afa63940695fb637618cf05079bd54524","last_reissued_at":"2026-05-18T02:21:44.002676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:44.002676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Probabilistic Alternating Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Chenyi Zhang, Jun Pang","submitted_at":"2011-06-10T08:43:28Z","abstract_excerpt":"In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with respect to the behaviour of a subset of players. We propose a partition based algorithm for computing the largest PA-simulation, which is to our knowledge the first such algorithm that works in polynomial time, by extending the generalised coarsest partition problem (GCPP) in a game-based setting with mixed strategies. The algorithm has higher complexities than those in the literature for non-probabilistic simulation an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1978","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":"1106.1978","created_at":"2026-05-18T02:21:44.002762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1978v3","created_at":"2026-05-18T02:21:44.002762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1978","created_at":"2026-05-18T02:21:44.002762+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DQTODIUIE2W","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DQTODIUIE2WD2VI","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DQTODIU","created_at":"2026-05-18T12:26:20.644004+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/5DQTODIUIE2WD2VILYFFBRKYFL","json":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL.json","graph_json":"https://pith.science/api/pith-number/5DQTODIUIE2WD2VILYFFBRKYFL/graph.json","events_json":"https://pith.science/api/pith-number/5DQTODIUIE2WD2VILYFFBRKYFL/events.json","paper":"https://pith.science/paper/5DQTODIU"},"agent_actions":{"view_html":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL","download_json":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL.json","view_paper":"https://pith.science/paper/5DQTODIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1978&json=true","fetch_graph":"https://pith.science/api/pith-number/5DQTODIUIE2WD2VILYFFBRKYFL/graph.json","fetch_events":"https://pith.science/api/pith-number/5DQTODIUIE2WD2VILYFFBRKYFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL/action/storage_attestation","attest_author":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL/action/author_attestation","sign_citation":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL/action/citation_signature","submit_replication":"https://pith.science/pith/5DQTODIUIE2WD2VILYFFBRKYFL/action/replication_record"}},"created_at":"2026-05-18T02:21:44.002762+00:00","updated_at":"2026-05-18T02:21:44.002762+00:00"}