{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AYNBPUDTKBFSWC3CRCOS53IQPY","short_pith_number":"pith:AYNBPUDT","schema_version":"1.0","canonical_sha256":"061a17d073504b2b0b62889d2eed107e1ce5e480618831a60cc4bafa059181c8","source":{"kind":"arxiv","id":"1605.02156","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Simulation and Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Massimo Cairo, Romeo Rizzi","submitted_at":"2016-05-07T08:18:31Z","abstract_excerpt":"Computing the simulation preorder of a given Kripke structure (i.e., a directed graph with $n$ labeled vertices) has crucial applications in model checking of temporal logic. It amounts to solving a specific two-players reachability game, called simulation game. We offer the first conditional lower bounds for this problem, and we relate its complexity (for computation, verification, and certification) to some variants of $n\\times n$ matrix multiplication.\n  We show that any $O(n^{\\alpha})$-time algorithm for simulation games, even restricting to acyclic games/structures, can be used to compute"},"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":"1605.02156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-07T08:18:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9c73ae6d9688a0db94a6fc608f1203a810b087c96e05429cc1a8bdcd9dfe6b48","abstract_canon_sha256":"c974fc8c55a1ecc807afe8be3feafc321256742c75004a4cc23384799f1f5286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:20.561191Z","signature_b64":"EbQGXy3n2nqyH4frxkZNFZ5GSExx3LkYIy+QNKdS0nQapIqegcGeSPOkmed4JLNRTlL+DAvx/qiU21MEE7YEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"061a17d073504b2b0b62889d2eed107e1ce5e480618831a60cc4bafa059181c8","last_reissued_at":"2026-05-18T01:07:20.560759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:20.560759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Simulation and Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Massimo Cairo, Romeo Rizzi","submitted_at":"2016-05-07T08:18:31Z","abstract_excerpt":"Computing the simulation preorder of a given Kripke structure (i.e., a directed graph with $n$ labeled vertices) has crucial applications in model checking of temporal logic. It amounts to solving a specific two-players reachability game, called simulation game. We offer the first conditional lower bounds for this problem, and we relate its complexity (for computation, verification, and certification) to some variants of $n\\times n$ matrix multiplication.\n  We show that any $O(n^{\\alpha})$-time algorithm for simulation games, even restricting to acyclic games/structures, can be used to compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02156","kind":"arxiv","version":2},"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":"1605.02156","created_at":"2026-05-18T01:07:20.560824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02156v2","created_at":"2026-05-18T01:07:20.560824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02156","created_at":"2026-05-18T01:07:20.560824+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYNBPUDTKBFS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYNBPUDTKBFSWC3C","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYNBPUDT","created_at":"2026-05-18T12:30:07.202191+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/AYNBPUDTKBFSWC3CRCOS53IQPY","json":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY.json","graph_json":"https://pith.science/api/pith-number/AYNBPUDTKBFSWC3CRCOS53IQPY/graph.json","events_json":"https://pith.science/api/pith-number/AYNBPUDTKBFSWC3CRCOS53IQPY/events.json","paper":"https://pith.science/paper/AYNBPUDT"},"agent_actions":{"view_html":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY","download_json":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY.json","view_paper":"https://pith.science/paper/AYNBPUDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02156&json=true","fetch_graph":"https://pith.science/api/pith-number/AYNBPUDTKBFSWC3CRCOS53IQPY/graph.json","fetch_events":"https://pith.science/api/pith-number/AYNBPUDTKBFSWC3CRCOS53IQPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/action/storage_attestation","attest_author":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/action/author_attestation","sign_citation":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/action/citation_signature","submit_replication":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/action/replication_record"}},"created_at":"2026-05-18T01:07:20.560824+00:00","updated_at":"2026-05-18T01:07:20.560824+00:00"}