{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J2BL53ZHSRR3KX57V72BGIUASA","short_pith_number":"pith:J2BL53ZH","schema_version":"1.0","canonical_sha256":"4e82beef279463b55fbfaff4132280900b31ba77eb627a07beafca032c3b6d94","source":{"kind":"arxiv","id":"1505.01964","version":2},"attestation_state":"computed","paper":{"title":"A Team Based Variant of CTL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Andreas Krebs, Arne Meier, Jonni Virtema","submitted_at":"2015-05-08T09:25:41Z","abstract_excerpt":"We introduce two variants of computation tree logic CTL based on team semantics: an asynchronous one and a synchronous one. For both variants we investigate the computational complexity of the satisfiability as well as the model checking problem. The satisfiability problem is shown to be EXPTIME-complete. Here it does not matter which of the two semantics are considered. For model checking we prove a PSPACE-completeness for the synchronous case, and show P-completeness for the asynchronous case. Furthermore we prove several interesting fundamental properties of both semantics."},"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":"1505.01964","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-08T09:25:41Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9f8c09260056fd2d573a60e9500a94ef96ee1250680b5853ba27edcb3ee592ea","abstract_canon_sha256":"42d57b42b53ca6ae5ac0e65b6ee52776d08a2df2a8b40b81a2dffec1722d6209"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:53.604235Z","signature_b64":"9o1alYPfFQd8LG9l3sWdtL8k0WpC9n3C22/BkOnSwVYmR9TmIJnM5KFwld75sHl1tlCfy60rxmRR1ZUu94VaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e82beef279463b55fbfaff4132280900b31ba77eb627a07beafca032c3b6d94","last_reissued_at":"2026-05-18T01:36:53.603698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:53.603698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Team Based Variant of CTL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Andreas Krebs, Arne Meier, Jonni Virtema","submitted_at":"2015-05-08T09:25:41Z","abstract_excerpt":"We introduce two variants of computation tree logic CTL based on team semantics: an asynchronous one and a synchronous one. For both variants we investigate the computational complexity of the satisfiability as well as the model checking problem. The satisfiability problem is shown to be EXPTIME-complete. Here it does not matter which of the two semantics are considered. For model checking we prove a PSPACE-completeness for the synchronous case, and show P-completeness for the asynchronous case. Furthermore we prove several interesting fundamental properties of both semantics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01964","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":"1505.01964","created_at":"2026-05-18T01:36:53.603786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01964v2","created_at":"2026-05-18T01:36:53.603786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01964","created_at":"2026-05-18T01:36:53.603786+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2BL53ZHSRR3","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2BL53ZHSRR3KX57","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2BL53ZH","created_at":"2026-05-18T12:29:27.538025+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/J2BL53ZHSRR3KX57V72BGIUASA","json":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA.json","graph_json":"https://pith.science/api/pith-number/J2BL53ZHSRR3KX57V72BGIUASA/graph.json","events_json":"https://pith.science/api/pith-number/J2BL53ZHSRR3KX57V72BGIUASA/events.json","paper":"https://pith.science/paper/J2BL53ZH"},"agent_actions":{"view_html":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA","download_json":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA.json","view_paper":"https://pith.science/paper/J2BL53ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01964&json=true","fetch_graph":"https://pith.science/api/pith-number/J2BL53ZHSRR3KX57V72BGIUASA/graph.json","fetch_events":"https://pith.science/api/pith-number/J2BL53ZHSRR3KX57V72BGIUASA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA/action/storage_attestation","attest_author":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA/action/author_attestation","sign_citation":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA/action/citation_signature","submit_replication":"https://pith.science/pith/J2BL53ZHSRR3KX57V72BGIUASA/action/replication_record"}},"created_at":"2026-05-18T01:36:53.603786+00:00","updated_at":"2026-05-18T01:36:53.603786+00:00"}