{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XPO2HS7UVBI3WXR423Q6EA7WI4","short_pith_number":"pith:XPO2HS7U","canonical_record":{"source":{"id":"1103.4990","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T15:10:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a83212f1659739995789490227c8ee088119c0cc38bb0f59edfab6813eb587bc","abstract_canon_sha256":"c585ed416e7f9b37fc2ef15a0b1fda4dcdb901f9bd0d479a6522bf3365f9171d"},"schema_version":"1.0"},"canonical_sha256":"bbdda3cbf4a851bb5e3cd6e1e203f647151f5d93470df3237e56a69adfa12e3c","source":{"kind":"arxiv","id":"1103.4990","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4990","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4990v3","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4990","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"XPO2HS7UVBI3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XPO2HS7UVBI3WXR4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XPO2HS7U","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XPO2HS7UVBI3WXR423Q6EA7WI4","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4990","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T15:10:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a83212f1659739995789490227c8ee088119c0cc38bb0f59edfab6813eb587bc","abstract_canon_sha256":"c585ed416e7f9b37fc2ef15a0b1fda4dcdb901f9bd0d479a6522bf3365f9171d"},"schema_version":"1.0"},"canonical_sha256":"bbdda3cbf4a851bb5e3cd6e1e203f647151f5d93470df3237e56a69adfa12e3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.602267Z","signature_b64":"8/ZDpzePKu9vhua5kkmC4CCV8dt6x64js+73I9PELIGKNGPKkKqHQZ1euYRoHHzgoWfPR60FPrAcxW+Ek/cBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbdda3cbf4a851bb5e3cd6e1e203f647151f5d93470df3237e56a69adfa12e3c","last_reissued_at":"2026-05-18T01:37:39.601651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.601651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4990","source_version":3,"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:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnSvyY50Z6c/nhL+oTPKHH3Vle5Vp5TVmTU1J+rlASJGsAFmObpO0CJLsSsrj48K2qMjebkRUdUrpN3qXir8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:38:19.279477Z"},"content_sha256":"fa88da78d90895d70dc05ce65588a02b7c2c215593d9277b762351bdfd77dff2","schema_version":"1.0","event_id":"sha256:fa88da78d90895d70dc05ce65588a02b7c2c215593d9277b762351bdfd77dff2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XPO2HS7UVBI3WXR423Q6EA7WI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Checking CTL is Almost Always Inherently Sequential","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Arne Meier (Leibniz Universit\\\"at Hannover), Germany), Heribert Vollmer (Leibniz Universit\\\"at Hannover), Martin Mundhenk (Friedrich-Schiller-Universit\\\"at Jena), Michael Thomas (Leibniz Universit\\\"at Hannover), Olaf Beyersdorff (Leibniz Universit\\\"at Hannover, Thomas Schneider (University of Manchester)","submitted_at":"2011-03-25T15:10:21Z","abstract_excerpt":"The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is alr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4990","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"},"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:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SC8y83RnOsqfePkF9TaTpMm4gEiFvMXEtAno3eMUdi9u7QzZBte3CoXfFzZYV6Z7eDhD5IqnGWnr3aDUxeBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:38:19.279858Z"},"content_sha256":"37c4d155de1a83a9af5b1a05d142bd22654dabfe78e6d6f9c0beff67cbc3786d","schema_version":"1.0","event_id":"sha256:37c4d155de1a83a9af5b1a05d142bd22654dabfe78e6d6f9c0beff67cbc3786d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPO2HS7UVBI3WXR423Q6EA7WI4/bundle.json","state_url":"https://pith.science/pith/XPO2HS7UVBI3WXR423Q6EA7WI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPO2HS7UVBI3WXR423Q6EA7WI4/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-09T06:38:19Z","links":{"resolver":"https://pith.science/pith/XPO2HS7UVBI3WXR423Q6EA7WI4","bundle":"https://pith.science/pith/XPO2HS7UVBI3WXR423Q6EA7WI4/bundle.json","state":"https://pith.science/pith/XPO2HS7UVBI3WXR423Q6EA7WI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPO2HS7UVBI3WXR423Q6EA7WI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XPO2HS7UVBI3WXR423Q6EA7WI4","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":"c585ed416e7f9b37fc2ef15a0b1fda4dcdb901f9bd0d479a6522bf3365f9171d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T15:10:21Z","title_canon_sha256":"a83212f1659739995789490227c8ee088119c0cc38bb0f59edfab6813eb587bc"},"schema_version":"1.0","source":{"id":"1103.4990","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4990","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4990v3","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4990","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"XPO2HS7UVBI3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XPO2HS7UVBI3WXR4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XPO2HS7U","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:37c4d155de1a83a9af5b1a05d142bd22654dabfe78e6d6f9c0beff67cbc3786d","target":"graph","created_at":"2026-05-18T01:37:39Z","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":"The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is alr","authors_text":"Arne Meier (Leibniz Universit\\\"at Hannover), Germany), Heribert Vollmer (Leibniz Universit\\\"at Hannover), Martin Mundhenk (Friedrich-Schiller-Universit\\\"at Jena), Michael Thomas (Leibniz Universit\\\"at Hannover), Olaf Beyersdorff (Leibniz Universit\\\"at Hannover, Thomas Schneider (University of Manchester)","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T15:10:21Z","title":"Model Checking CTL is Almost Always Inherently Sequential"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4990","kind":"arxiv","version":3},"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:fa88da78d90895d70dc05ce65588a02b7c2c215593d9277b762351bdfd77dff2","target":"record","created_at":"2026-05-18T01:37:39Z","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":"c585ed416e7f9b37fc2ef15a0b1fda4dcdb901f9bd0d479a6522bf3365f9171d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T15:10:21Z","title_canon_sha256":"a83212f1659739995789490227c8ee088119c0cc38bb0f59edfab6813eb587bc"},"schema_version":"1.0","source":{"id":"1103.4990","kind":"arxiv","version":3}},"canonical_sha256":"bbdda3cbf4a851bb5e3cd6e1e203f647151f5d93470df3237e56a69adfa12e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbdda3cbf4a851bb5e3cd6e1e203f647151f5d93470df3237e56a69adfa12e3c","first_computed_at":"2026-05-18T01:37:39.601651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.601651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8/ZDpzePKu9vhua5kkmC4CCV8dt6x64js+73I9PELIGKNGPKkKqHQZ1euYRoHHzgoWfPR60FPrAcxW+Ek/cBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.602267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4990","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa88da78d90895d70dc05ce65588a02b7c2c215593d9277b762351bdfd77dff2","sha256:37c4d155de1a83a9af5b1a05d142bd22654dabfe78e6d6f9c0beff67cbc3786d"],"state_sha256":"c1f1f4643b7ffa90dafcfbb6889151a2c76cdb35bc8d4a181457d9be10fc6dc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNsE4KZ58eg2mUvuGI7fGmLjwq/oCzCX7HzcJkXrf0tkjDgby4uqisSpzJSM/xiAvRbt22k00d0y3YSieyBBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:38:19.281952Z","bundle_sha256":"5cd76c3c898e1ea0d38bf1611f7b610de3006433f145db4abb8f6014587a90dd"}}