{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PQIUWE5OP4CBVKZPKGKWPDRPR6","short_pith_number":"pith:PQIUWE5O","schema_version":"1.0","canonical_sha256":"7c114b13ae7f041aab2f5195678e2f8fa47e89a9cc2e2ad7a6c632709763653e","source":{"kind":"arxiv","id":"1203.3706","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Computing Minimal Unsatisfiable LTL formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Francois Hantry, Lakhdar Sa\\\"is, Mohand-Sa\\\"id Hacid","submitted_at":"2012-03-16T13:53:33Z","abstract_excerpt":"We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU-search) are FPSPACE complete because of the very expressive power of QBF/LTL, (2) we extend the PSPACE-hardness of the MF decision problem to the MU decision problem. As a consequence, we deduce a positive answer to the open question of PSPACE hardness of the inherent Vacuity Checking problem. We even show that the Inherent Non Vacuous formula search problem is also FPSPACE-complete."},"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":"1203.3706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-16T13:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"2d6639a92f84cc1328c7392533d2f7bb7f10722c44598657e17f8bfc3af22103","abstract_canon_sha256":"a356f7bd1f65e0e58b0e6ac37ca250ca128de5d6e78c044c0fc896e422ef6693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:26.937766Z","signature_b64":"QppO0OShhRaz3YNnURi2jkzF7vCxkhO99xboiuY1BSExp+NVV6bEz+CXq17etfIhaEUhaIn/SZBjQkUOP07YBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c114b13ae7f041aab2f5195678e2f8fa47e89a9cc2e2ad7a6c632709763653e","last_reissued_at":"2026-05-18T03:59:26.936995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:26.936995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Computing Minimal Unsatisfiable LTL formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Francois Hantry, Lakhdar Sa\\\"is, Mohand-Sa\\\"id Hacid","submitted_at":"2012-03-16T13:53:33Z","abstract_excerpt":"We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU-search) are FPSPACE complete because of the very expressive power of QBF/LTL, (2) we extend the PSPACE-hardness of the MF decision problem to the MU decision problem. As a consequence, we deduce a positive answer to the open question of PSPACE hardness of the inherent Vacuity Checking problem. We even show that the Inherent Non Vacuous formula search problem is also FPSPACE-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3706","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":"1203.3706","created_at":"2026-05-18T03:59:26.937120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3706v2","created_at":"2026-05-18T03:59:26.937120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3706","created_at":"2026-05-18T03:59:26.937120+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQIUWE5OP4CB","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQIUWE5OP4CBVKZP","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQIUWE5O","created_at":"2026-05-18T12:27:18.751474+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/PQIUWE5OP4CBVKZPKGKWPDRPR6","json":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6.json","graph_json":"https://pith.science/api/pith-number/PQIUWE5OP4CBVKZPKGKWPDRPR6/graph.json","events_json":"https://pith.science/api/pith-number/PQIUWE5OP4CBVKZPKGKWPDRPR6/events.json","paper":"https://pith.science/paper/PQIUWE5O"},"agent_actions":{"view_html":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6","download_json":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6.json","view_paper":"https://pith.science/paper/PQIUWE5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3706&json=true","fetch_graph":"https://pith.science/api/pith-number/PQIUWE5OP4CBVKZPKGKWPDRPR6/graph.json","fetch_events":"https://pith.science/api/pith-number/PQIUWE5OP4CBVKZPKGKWPDRPR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6/action/storage_attestation","attest_author":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6/action/author_attestation","sign_citation":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6/action/citation_signature","submit_replication":"https://pith.science/pith/PQIUWE5OP4CBVKZPKGKWPDRPR6/action/replication_record"}},"created_at":"2026-05-18T03:59:26.937120+00:00","updated_at":"2026-05-18T03:59:26.937120+00:00"}