{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MN5DMJFWXEGEDUHKHUZ4W5GJ6N","short_pith_number":"pith:MN5DMJFW","schema_version":"1.0","canonical_sha256":"637a3624b6b90c41d0ea3d33cb74c9f341865a094fa9c94f75b17c2f94b40bba","source":{"kind":"arxiv","id":"1908.04198","version":2},"attestation_state":"computed","paper":{"title":"On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas Darmann, Janosch D\\\"ocker","submitted_at":"2019-08-12T15:31:05Z","abstract_excerpt":"We consider simplified, monotone versions of Not-All-Equal 3-Sat and 3-Sat, variants of the famous Satisfiability Problem where each clause is made up of exactly three distinct literals. We show that Not-All-Equal 3-Sat remains NP-complete even if (1) each variable appears exactly four times, (2) there are no negations in the formula, and (3) the formula is linear, i.e., each pair of distinct clauses shares at most one variable.\n  Concerning 3-Sat we prove several hardness results for monotone formulas with respect to a variety of restrictions imposed on the variable appearances. Monotone 3-Sa"},"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.04198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-12T15:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"c8290f6680c93b6e858783ff6df017d16069c119ce4ce8428983a50aeeb90264","abstract_canon_sha256":"62656b4c890891656b980ef33dc4be7381070051c23945ab293e1e60e853b8c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:34.596507Z","signature_b64":"qXNZBl847pGvyKgnupmT7AXcAvNbiHq13g0cDvHCKxV0ZeorMLaXbsSQIBfLXh9u3yZoxi8OhRET6xJvAqnJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"637a3624b6b90c41d0ea3d33cb74c9f341865a094fa9c94f75b17c2f94b40bba","last_reissued_at":"2026-07-04T23:59:34.596039Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:34.596039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas Darmann, Janosch D\\\"ocker","submitted_at":"2019-08-12T15:31:05Z","abstract_excerpt":"We consider simplified, monotone versions of Not-All-Equal 3-Sat and 3-Sat, variants of the famous Satisfiability Problem where each clause is made up of exactly three distinct literals. We show that Not-All-Equal 3-Sat remains NP-complete even if (1) each variable appears exactly four times, (2) there are no negations in the formula, and (3) the formula is linear, i.e., each pair of distinct clauses shares at most one variable.\n  Concerning 3-Sat we prove several hardness results for monotone formulas with respect to a variety of restrictions imposed on the variable appearances. Monotone 3-Sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04198","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.04198/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.04198","created_at":"2026-07-04T23:59:34.596096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04198v2","created_at":"2026-07-04T23:59:34.596096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04198","created_at":"2026-07-04T23:59:34.596096+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN5DMJFWXEGE","created_at":"2026-07-04T23:59:34.596096+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN5DMJFWXEGEDUHK","created_at":"2026-07-04T23:59:34.596096+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN5DMJFW","created_at":"2026-07-04T23:59:34.596096+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/MN5DMJFWXEGEDUHKHUZ4W5GJ6N","json":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N.json","graph_json":"https://pith.science/api/pith-number/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/graph.json","events_json":"https://pith.science/api/pith-number/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/events.json","paper":"https://pith.science/paper/MN5DMJFW"},"agent_actions":{"view_html":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N","download_json":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N.json","view_paper":"https://pith.science/paper/MN5DMJFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04198&json=true","fetch_graph":"https://pith.science/api/pith-number/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/graph.json","fetch_events":"https://pith.science/api/pith-number/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/action/storage_attestation","attest_author":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/action/author_attestation","sign_citation":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/action/citation_signature","submit_replication":"https://pith.science/pith/MN5DMJFWXEGEDUHKHUZ4W5GJ6N/action/replication_record"}},"created_at":"2026-07-04T23:59:34.596096+00:00","updated_at":"2026-07-04T23:59:34.596096+00:00"}