{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AYNBPUDTKBFSWC3CRCOS53IQPY","short_pith_number":"pith:AYNBPUDT","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"},"canonical_sha256":"061a17d073504b2b0b62889d2eed107e1ce5e480618831a60cc4bafa059181c8","source":{"kind":"arxiv","id":"1605.02156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02156","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02156v2","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02156","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"AYNBPUDTKBFS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AYNBPUDTKBFSWC3C","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AYNBPUDT","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AYNBPUDTKBFSWC3CRCOS53IQPY","target":"record","payload":{"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"},"canonical_sha256":"061a17d073504b2b0b62889d2eed107e1ce5e480618831a60cc4bafa059181c8","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"},"source_kind":"arxiv","source_id":"1605.02156","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOGzFXtl+DlznlVef24Qm37mMfqBjbmT8gbr4Vc7JpkDByALVXr/HJaPJHJwX6d8DQCcbgYGzk9FbNd5vbv3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:44:40.682489Z"},"content_sha256":"6f074afae43444079ab30d0f87c86341cd7141962cfe0125219e8624166c45ea","schema_version":"1.0","event_id":"sha256:6f074afae43444079ab30d0f87c86341cd7141962cfe0125219e8624166c45ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AYNBPUDTKBFSWC3CRCOS53IQPY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIKN2FWc9oNFKydz87rWZxAAK/fniuGEoOwLAd6L5FV8EELhkgRyxuJCR+5PJWRrOyho9ZwoLK+Etg4w2T5YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:44:40.683186Z"},"content_sha256":"e2b3593d188a7eab1edd0e70dbb24a08ccf4d2b9f99b92351e7ede7115ab9ed0","schema_version":"1.0","event_id":"sha256:e2b3593d188a7eab1edd0e70dbb24a08ccf4d2b9f99b92351e7ede7115ab9ed0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/bundle.json","state_url":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T18:44:40Z","links":{"resolver":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY","bundle":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/bundle.json","state":"https://pith.science/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYNBPUDTKBFSWC3CRCOS53IQPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AYNBPUDTKBFSWC3CRCOS53IQPY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c974fc8c55a1ecc807afe8be3feafc321256742c75004a4cc23384799f1f5286","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-07T08:18:31Z","title_canon_sha256":"9c73ae6d9688a0db94a6fc608f1203a810b087c96e05429cc1a8bdcd9dfe6b48"},"schema_version":"1.0","source":{"id":"1605.02156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02156","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02156v2","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02156","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"AYNBPUDTKBFS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AYNBPUDTKBFSWC3C","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AYNBPUDT","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:e2b3593d188a7eab1edd0e70dbb24a08ccf4d2b9f99b92351e7ede7115ab9ed0","target":"graph","created_at":"2026-05-18T01:07:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Massimo Cairo, Romeo Rizzi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-07T08:18:31Z","title":"The Complexity of Simulation and Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02156","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6f074afae43444079ab30d0f87c86341cd7141962cfe0125219e8624166c45ea","target":"record","created_at":"2026-05-18T01:07:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c974fc8c55a1ecc807afe8be3feafc321256742c75004a4cc23384799f1f5286","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-07T08:18:31Z","title_canon_sha256":"9c73ae6d9688a0db94a6fc608f1203a810b087c96e05429cc1a8bdcd9dfe6b48"},"schema_version":"1.0","source":{"id":"1605.02156","kind":"arxiv","version":2}},"canonical_sha256":"061a17d073504b2b0b62889d2eed107e1ce5e480618831a60cc4bafa059181c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"061a17d073504b2b0b62889d2eed107e1ce5e480618831a60cc4bafa059181c8","first_computed_at":"2026-05-18T01:07:20.560759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:20.560759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EbQGXy3n2nqyH4frxkZNFZ5GSExx3LkYIy+QNKdS0nQapIqegcGeSPOkmed4JLNRTlL+DAvx/qiU21MEE7YEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:20.561191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f074afae43444079ab30d0f87c86341cd7141962cfe0125219e8624166c45ea","sha256:e2b3593d188a7eab1edd0e70dbb24a08ccf4d2b9f99b92351e7ede7115ab9ed0"],"state_sha256":"a9d943b0a3d9ec145584bb81ae451e675583ad0a7923e2f4ae80735abedfe2db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ooTMDMTYQSgCNewgrss79ZYgrorsk0RI3+rHz7oCxWB4xzFXilal4wYFeV729Alkbjkokfr6a4ZwWL+SZ+HBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:44:40.686842Z","bundle_sha256":"0494831978c9b7d84ea78ec35728904c33708d56c052b9a98d10dbbf78355553"}}