{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XOETU5ZZKGLJ6VCUMNET5WJTI5","short_pith_number":"pith:XOETU5ZZ","canonical_record":{"source":{"id":"1810.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-22T08:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"e9f0fd4efda788d742a8b6f3aa638f5055cdb7645a242e481e32aba0334cca3e","abstract_canon_sha256":"cc5a92a7c321cad06fab224824dcea0f9c8923f590f1ba728f17ff7dfb333782"},"schema_version":"1.0"},"canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","source":{"kind":"arxiv","id":"1810.09142","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09142","created_at":"2026-05-17T23:55:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09142v2","created_at":"2026-05-17T23:55:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09142","created_at":"2026-05-17T23:55:54Z"},{"alias_kind":"pith_short_12","alias_value":"XOETU5ZZKGLJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XOETU5ZZKGLJ6VCU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XOETU5ZZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XOETU5ZZKGLJ6VCUMNET5WJTI5","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-22T08:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"e9f0fd4efda788d742a8b6f3aa638f5055cdb7645a242e481e32aba0334cca3e","abstract_canon_sha256":"cc5a92a7c321cad06fab224824dcea0f9c8923f590f1ba728f17ff7dfb333782"},"schema_version":"1.0"},"canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:54.466335Z","signature_b64":"4F+CckN0IJqcCzIppNPFlufCiY49Mh6EiG61d3c5fGu/pS35jf6AFri9V9LEktLVBzz5c27TnTwQTvVGD/j8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","last_reissued_at":"2026-05-17T23:55:54.465817Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:54.465817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09142","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-17T23:55:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KL+48SjI/Q869u4lIF4CZFxlJq4OhjGa3ZJqj9XyPJ9wFFErf/2GVitm15pmeCX2f1alPlj63UAB2tQmkLhFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:54:29.020572Z"},"content_sha256":"319284fbc478907bce815e2c81791018b7c874880fa984d600867cb5fb77a09b","schema_version":"1.0","event_id":"sha256:319284fbc478907bce815e2c81791018b7c874880fa984d600867cb5fb77a09b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XOETU5ZZKGLJ6VCUMNET5WJTI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dmitry Shkatov, Mikhail Rybakov","submitted_at":"2018-10-22T08:52:23Z","abstract_excerpt":"We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09142","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-17T23:55:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/t2vRUIgTvE1tBTTGodaevlzaq2tGZJ8ijTSRbSx+XUcb86Xpmu5gZHYOraqQJoclgvkA3WdByRRL2LnHYvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:54:29.020923Z"},"content_sha256":"4b3f5d5326a6ca8b75a7dcef13ff14a10bb3790bffc291095a25633b113aeacd","schema_version":"1.0","event_id":"sha256:4b3f5d5326a6ca8b75a7dcef13ff14a10bb3790bffc291095a25633b113aeacd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/bundle.json","state_url":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/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-22T23:54:29Z","links":{"resolver":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5","bundle":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/bundle.json","state":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XOETU5ZZKGLJ6VCUMNET5WJTI5","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":"cc5a92a7c321cad06fab224824dcea0f9c8923f590f1ba728f17ff7dfb333782","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-22T08:52:23Z","title_canon_sha256":"e9f0fd4efda788d742a8b6f3aa638f5055cdb7645a242e481e32aba0334cca3e"},"schema_version":"1.0","source":{"id":"1810.09142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09142","created_at":"2026-05-17T23:55:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09142v2","created_at":"2026-05-17T23:55:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09142","created_at":"2026-05-17T23:55:54Z"},{"alias_kind":"pith_short_12","alias_value":"XOETU5ZZKGLJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XOETU5ZZKGLJ6VCU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XOETU5ZZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:4b3f5d5326a6ca8b75a7dcef13ff14a10bb3790bffc291095a25633b113aeacd","target":"graph","created_at":"2026-05-17T23:55:54Z","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":"We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiabili","authors_text":"Dmitry Shkatov, Mikhail Rybakov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-22T08:52:23Z","title":"Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09142","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:319284fbc478907bce815e2c81791018b7c874880fa984d600867cb5fb77a09b","target":"record","created_at":"2026-05-17T23:55:54Z","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":"cc5a92a7c321cad06fab224824dcea0f9c8923f590f1ba728f17ff7dfb333782","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-22T08:52:23Z","title_canon_sha256":"e9f0fd4efda788d742a8b6f3aa638f5055cdb7645a242e481e32aba0334cca3e"},"schema_version":"1.0","source":{"id":"1810.09142","kind":"arxiv","version":2}},"canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","first_computed_at":"2026-05-17T23:55:54.465817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:54.465817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4F+CckN0IJqcCzIppNPFlufCiY49Mh6EiG61d3c5fGu/pS35jf6AFri9V9LEktLVBzz5c27TnTwQTvVGD/j8BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:54.466335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:319284fbc478907bce815e2c81791018b7c874880fa984d600867cb5fb77a09b","sha256:4b3f5d5326a6ca8b75a7dcef13ff14a10bb3790bffc291095a25633b113aeacd"],"state_sha256":"8f363980370e918f6ffb9271141b8fd8ba80301cfeacc7afb494f723017bf3c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5Q2DyG7B9LoeukwUlEvFUN+MAWAWld8TfLQfX2qGw6GHm3xO+Aa0AjMcuE8+FtUHlinh3gEW2q8Qk9FNpEADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:54:29.022913Z","bundle_sha256":"e9490f2c5e18780e8a22f82076615372bee2677e169cfa13bb15639a2069b3a6"}}