{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2ZMLW7KQ63CCNBRHORDN3IXPL5","short_pith_number":"pith:2ZMLW7KQ","schema_version":"1.0","canonical_sha256":"d658bb7d50f6c42686277446dda2ef5f527e3c50f8d034407651abefab16777a","source":{"kind":"arxiv","id":"1504.06135","version":2},"attestation_state":"computed","paper":{"title":"Complexity of Propositional Logics in Team Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Heribert Vollmer, Jonni Virtema, Juha Kontinen, Miika Hannula","submitted_at":"2015-04-23T12:01:22Z","abstract_excerpt":"We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations."},"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":"1504.06135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T12:01:22Z","cross_cats_sorted":["cs.CC","math.LO"],"title_canon_sha256":"223abc95541b97b97f5dee68069cc99403c0d3a02ec677b59b33cb2e9c812b09","abstract_canon_sha256":"c5730003cbec1e5af23d0b1462e38317ac5eccca9414606150fccc8cb3f30072"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.169498Z","signature_b64":"cmon2QozJ5lylHy6tjCJZ5lnsCHhyZFeva6KzcZYOoV0lAObOKdtbTZBa02XgxfU1t6taxU6tv+ALDOTLI+uCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d658bb7d50f6c42686277446dda2ef5f527e3c50f8d034407651abefab16777a","last_reissued_at":"2026-05-18T00:53:21.169007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.169007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Propositional Logics in Team Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Heribert Vollmer, Jonni Virtema, Juha Kontinen, Miika Hannula","submitted_at":"2015-04-23T12:01:22Z","abstract_excerpt":"We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06135","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":"1504.06135","created_at":"2026-05-18T00:53:21.169074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06135v2","created_at":"2026-05-18T00:53:21.169074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06135","created_at":"2026-05-18T00:53:21.169074+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZMLW7KQ63CC","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZMLW7KQ63CCNBRH","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZMLW7KQ","created_at":"2026-05-18T12:29:02.477457+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/2ZMLW7KQ63CCNBRHORDN3IXPL5","json":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5.json","graph_json":"https://pith.science/api/pith-number/2ZMLW7KQ63CCNBRHORDN3IXPL5/graph.json","events_json":"https://pith.science/api/pith-number/2ZMLW7KQ63CCNBRHORDN3IXPL5/events.json","paper":"https://pith.science/paper/2ZMLW7KQ"},"agent_actions":{"view_html":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5","download_json":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5.json","view_paper":"https://pith.science/paper/2ZMLW7KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06135&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZMLW7KQ63CCNBRHORDN3IXPL5/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZMLW7KQ63CCNBRHORDN3IXPL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5/action/storage_attestation","attest_author":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5/action/author_attestation","sign_citation":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5/action/citation_signature","submit_replication":"https://pith.science/pith/2ZMLW7KQ63CCNBRHORDN3IXPL5/action/replication_record"}},"created_at":"2026-05-18T00:53:21.169074+00:00","updated_at":"2026-05-18T00:53:21.169074+00:00"}