{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BKS7TSTQP3FRX2DT3PDAXBFEXV","short_pith_number":"pith:BKS7TSTQ","canonical_record":{"source":{"id":"1609.04097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-14T00:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"9fa06d68983a5f72cc53eb1b789e90bd1df1eebacc1f06accdd656ed444a9018","abstract_canon_sha256":"683c245355cbaad66a006978911e99cc1210c35af4cd769cf9809f144dad06be"},"schema_version":"1.0"},"canonical_sha256":"0aa5f9ca707ecb1be873dbc60b84a4bd6bb7e5e9f4ed22208e90f7096f54cc04","source":{"kind":"arxiv","id":"1609.04097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04097","created_at":"2026-05-18T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04097v1","created_at":"2026-05-18T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04097","created_at":"2026-05-18T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"BKS7TSTQP3FR","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BKS7TSTQP3FRX2DT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BKS7TSTQ","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BKS7TSTQP3FRX2DT3PDAXBFEXV","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-14T00:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"9fa06d68983a5f72cc53eb1b789e90bd1df1eebacc1f06accdd656ed444a9018","abstract_canon_sha256":"683c245355cbaad66a006978911e99cc1210c35af4cd769cf9809f144dad06be"},"schema_version":"1.0"},"canonical_sha256":"0aa5f9ca707ecb1be873dbc60b84a4bd6bb7e5e9f4ed22208e90f7096f54cc04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:39.031333Z","signature_b64":"l4HYFyGnzinOLtj4A8uxmasDkkab9lBE57ME+wFprywqLGqNMwXAc8rBFANg6zgNdimmmdvNVBLeqnTxNczzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aa5f9ca707ecb1be873dbc60b84a4bd6bb7e5e9f4ed22208e90f7096f54cc04","last_reissued_at":"2026-05-18T01:04:39.030650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:39.030650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04097","source_version":1,"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:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhnyOByyQGRY7lMFaB3go0f7HMGushqtET/NniE+zDqFk4nzJD6398FdPqI8wKVN0nKQNAjWWj2/ZH2Z3wMPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:51:22.116525Z"},"content_sha256":"ebbf81093dc703de9352ac885e39cf489370c0080610e36851a8bbecc8235704","schema_version":"1.0","event_id":"sha256:ebbf81093dc703de9352ac885e39cf489370c0080610e36851a8bbecc8235704"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BKS7TSTQP3FRX2DT3PDAXBFEXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Quantified Propositional Logics and the Exponential Time Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jonni Virtema (Department of Mathematics, Juha Kontinen (Department of Mathematics, Leibniz Universit\\\"at Hannover), Martin L\\\"uck (Institut f\\\"ur Theoretische Informatik, Miika Hannula (Department of Computer Science, Statistics, The University of Auckland), University of Helsinki)","submitted_at":"2016-09-14T00:59:36Z","abstract_excerpt":"We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the exponential hierarchy. Second we study propositional team-based logics. We show that DQBF formulae correspond naturally to quantified propositional dependence logic and present a general NEXPTIME upper bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04097","kind":"arxiv","version":1},"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:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9Nlw41z+QhX6gJPk2SnbYXCEh6Of8r+Wy7BigLLBThHCRojeli3dLt83AodwDToLpJSsVcR5YbSoVv6jvP1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:51:22.116900Z"},"content_sha256":"0eb0a9a0d9a368e25ead88414d59fbc817bc3d9293ee8c7348d720f911677da5","schema_version":"1.0","event_id":"sha256:0eb0a9a0d9a368e25ead88414d59fbc817bc3d9293ee8c7348d720f911677da5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV/bundle.json","state_url":"https://pith.science/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV/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-02T21:51:22Z","links":{"resolver":"https://pith.science/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV","bundle":"https://pith.science/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV/bundle.json","state":"https://pith.science/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKS7TSTQP3FRX2DT3PDAXBFEXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BKS7TSTQP3FRX2DT3PDAXBFEXV","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":"683c245355cbaad66a006978911e99cc1210c35af4cd769cf9809f144dad06be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-14T00:59:36Z","title_canon_sha256":"9fa06d68983a5f72cc53eb1b789e90bd1df1eebacc1f06accdd656ed444a9018"},"schema_version":"1.0","source":{"id":"1609.04097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04097","created_at":"2026-05-18T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04097v1","created_at":"2026-05-18T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04097","created_at":"2026-05-18T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"BKS7TSTQP3FR","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BKS7TSTQP3FRX2DT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BKS7TSTQ","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:0eb0a9a0d9a368e25ead88414d59fbc817bc3d9293ee8c7348d720f911677da5","target":"graph","created_at":"2026-05-18T01:04: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":"We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the exponential hierarchy. Second we study propositional team-based logics. We show that DQBF formulae correspond naturally to quantified propositional dependence logic and present a general NEXPTIME upper bo","authors_text":"Jonni Virtema (Department of Mathematics, Juha Kontinen (Department of Mathematics, Leibniz Universit\\\"at Hannover), Martin L\\\"uck (Institut f\\\"ur Theoretische Informatik, Miika Hannula (Department of Computer Science, Statistics, The University of Auckland), University of Helsinki)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-14T00:59:36Z","title":"On Quantified Propositional Logics and the Exponential Time Hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04097","kind":"arxiv","version":1},"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:ebbf81093dc703de9352ac885e39cf489370c0080610e36851a8bbecc8235704","target":"record","created_at":"2026-05-18T01:04: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":"683c245355cbaad66a006978911e99cc1210c35af4cd769cf9809f144dad06be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-14T00:59:36Z","title_canon_sha256":"9fa06d68983a5f72cc53eb1b789e90bd1df1eebacc1f06accdd656ed444a9018"},"schema_version":"1.0","source":{"id":"1609.04097","kind":"arxiv","version":1}},"canonical_sha256":"0aa5f9ca707ecb1be873dbc60b84a4bd6bb7e5e9f4ed22208e90f7096f54cc04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0aa5f9ca707ecb1be873dbc60b84a4bd6bb7e5e9f4ed22208e90f7096f54cc04","first_computed_at":"2026-05-18T01:04:39.030650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:39.030650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4HYFyGnzinOLtj4A8uxmasDkkab9lBE57ME+wFprywqLGqNMwXAc8rBFANg6zgNdimmmdvNVBLeqnTxNczzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:39.031333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebbf81093dc703de9352ac885e39cf489370c0080610e36851a8bbecc8235704","sha256:0eb0a9a0d9a368e25ead88414d59fbc817bc3d9293ee8c7348d720f911677da5"],"state_sha256":"a0c5711c65e0a250895db8d39fcc17db4d415a6a26bdeae617e8d360be2bd08b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrYbyqN2G1sl2ZyYv0Lqy7LEiG2BbBzvwuWJthma71Wzlb1E+k0nPIICRLuMtJ417VY/XrkHZauzl4xdwT58BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:51:22.118885Z","bundle_sha256":"9d588139866af72fb1d7ab3cf43404e4aed1f0ea31e23d5bee66deccea821209"}}