{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G3FZMO7FYLT6UBODEMM6HCR422","short_pith_number":"pith:G3FZMO7F","schema_version":"1.0","canonical_sha256":"36cb963be5c2e7ea05c32319e38a3cd6b3f4ec687bc2701d7961e22bb3554d88","source":{"kind":"arxiv","id":"1908.05361","version":2},"attestation_state":"computed","paper":{"title":"Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Britta Dorn, Charles Semple, Janosch D\\\"ocker, Simone Linz","submitted_at":"2019-08-14T22:09:49Z","abstract_excerpt":"The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well studied. However, in contrast, very little is known about the complexity of the problems' quantified counterparts. In the first part of this paper, we show that $\\forall \\exists$ 3-SAT is $\\Pi_2^P$-complete even if (1) each variable appears exactly twice unnegated and exactly twice negated, (2) each clause is a disjunction of exactly three distinct variables, and (3) the number of universal variables is equal to the number of existential variables. Furthermore, we show that the problem remains $\\Pi_2^P$-complete if (1a) each u"},"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":"1908.05361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-14T22:09:49Z","cross_cats_sorted":[],"title_canon_sha256":"0257138012ed8e62068e889527851f8bd0fad179b464193be8f329b7bef10d2c","abstract_canon_sha256":"b80699e4426c0ba5241fb8c1f09aa6aa2a4df5d66f4d6460daeae4e7ae5585e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:40.669242Z","signature_b64":"wwk1r8quL6PFwn6u+i979esYVK7fpi8tx9h7S6GVm+8qd4osfnmt7IfG1DxUuIpqO71Gx7EjEL5zV3Fm6rYoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36cb963be5c2e7ea05c32319e38a3cd6b3f4ec687bc2701d7961e22bb3554d88","last_reissued_at":"2026-07-05T02:30:40.668717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:40.668717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Britta Dorn, Charles Semple, Janosch D\\\"ocker, Simone Linz","submitted_at":"2019-08-14T22:09:49Z","abstract_excerpt":"The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well studied. However, in contrast, very little is known about the complexity of the problems' quantified counterparts. In the first part of this paper, we show that $\\forall \\exists$ 3-SAT is $\\Pi_2^P$-complete even if (1) each variable appears exactly twice unnegated and exactly twice negated, (2) each clause is a disjunction of exactly three distinct variables, and (3) the number of universal variables is equal to the number of existential variables. Furthermore, we show that the problem remains $\\Pi_2^P$-complete if (1a) each u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05361","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05361/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.05361","created_at":"2026-07-05T02:30:40.668791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05361v2","created_at":"2026-07-05T02:30:40.668791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05361","created_at":"2026-07-05T02:30:40.668791+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3FZMO7FYLT6","created_at":"2026-07-05T02:30:40.668791+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3FZMO7FYLT6UBOD","created_at":"2026-07-05T02:30:40.668791+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3FZMO7F","created_at":"2026-07-05T02:30:40.668791+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/G3FZMO7FYLT6UBODEMM6HCR422","json":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422.json","graph_json":"https://pith.science/api/pith-number/G3FZMO7FYLT6UBODEMM6HCR422/graph.json","events_json":"https://pith.science/api/pith-number/G3FZMO7FYLT6UBODEMM6HCR422/events.json","paper":"https://pith.science/paper/G3FZMO7F"},"agent_actions":{"view_html":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422","download_json":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422.json","view_paper":"https://pith.science/paper/G3FZMO7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05361&json=true","fetch_graph":"https://pith.science/api/pith-number/G3FZMO7FYLT6UBODEMM6HCR422/graph.json","fetch_events":"https://pith.science/api/pith-number/G3FZMO7FYLT6UBODEMM6HCR422/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422/action/storage_attestation","attest_author":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422/action/author_attestation","sign_citation":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422/action/citation_signature","submit_replication":"https://pith.science/pith/G3FZMO7FYLT6UBODEMM6HCR422/action/replication_record"}},"created_at":"2026-07-05T02:30:40.668791+00:00","updated_at":"2026-07-05T02:30:40.668791+00:00"}