{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SWTIKMNFQFT5OSZXNYGJZ3VR6J","short_pith_number":"pith:SWTIKMNF","schema_version":"1.0","canonical_sha256":"95a68531a58167d74b376e0c9ceeb1f2717c03eb0183988ac4839ac46255de8f","source":{"kind":"arxiv","id":"1311.3728","version":2},"attestation_state":"computed","paper":{"title":"FPTAS for Counting Monotone CNF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jingcheng Liu, Pinyan Lu","submitted_at":"2013-11-15T05:06:27Z","abstract_excerpt":"A monotone CNF formula is a Boolean formula in conjunctive normal form where each variable appears positively. We design a deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of satisfying assignments for a given monotone CNF formula when each variable appears in at most $5$ clauses. Equivalently, this is also an FPTAS for counting set covers where each set contains at most $5$ elements. If we allow variables to appear in a maximum of $6$ clauses (or sets to contain $6$ elements), it is NP-hard to approximate it. Thus, this gives a complete understanding of"},"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":"1311.3728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-15T05:06:27Z","cross_cats_sorted":[],"title_canon_sha256":"e4b49fb8c0bdaa70462ab24cea08c2abf05c48ef6c8a39330a30c45801f0ca22","abstract_canon_sha256":"1a230e45c64b985407b06867cc8a128deb2638484404ea41dcab34e78b242cdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.813095Z","signature_b64":"oEHok1i9ZNKvICxIVFiCWe/3Qef4C9s620+z0aTG1V43+keSgqVxlyOGiArhRQXsAlqygMCaFhd+FkNbBLJ9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95a68531a58167d74b376e0c9ceeb1f2717c03eb0183988ac4839ac46255de8f","last_reissued_at":"2026-05-18T02:55:03.812559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.812559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPTAS for Counting Monotone CNF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jingcheng Liu, Pinyan Lu","submitted_at":"2013-11-15T05:06:27Z","abstract_excerpt":"A monotone CNF formula is a Boolean formula in conjunctive normal form where each variable appears positively. We design a deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of satisfying assignments for a given monotone CNF formula when each variable appears in at most $5$ clauses. Equivalently, this is also an FPTAS for counting set covers where each set contains at most $5$ elements. If we allow variables to appear in a maximum of $6$ clauses (or sets to contain $6$ elements), it is NP-hard to approximate it. Thus, this gives a complete understanding of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3728","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":"1311.3728","created_at":"2026-05-18T02:55:03.812660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3728v2","created_at":"2026-05-18T02:55:03.812660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3728","created_at":"2026-05-18T02:55:03.812660+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWTIKMNFQFT5","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWTIKMNFQFT5OSZX","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWTIKMNF","created_at":"2026-05-18T12:27:59.945178+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/SWTIKMNFQFT5OSZXNYGJZ3VR6J","json":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J.json","graph_json":"https://pith.science/api/pith-number/SWTIKMNFQFT5OSZXNYGJZ3VR6J/graph.json","events_json":"https://pith.science/api/pith-number/SWTIKMNFQFT5OSZXNYGJZ3VR6J/events.json","paper":"https://pith.science/paper/SWTIKMNF"},"agent_actions":{"view_html":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J","download_json":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J.json","view_paper":"https://pith.science/paper/SWTIKMNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3728&json=true","fetch_graph":"https://pith.science/api/pith-number/SWTIKMNFQFT5OSZXNYGJZ3VR6J/graph.json","fetch_events":"https://pith.science/api/pith-number/SWTIKMNFQFT5OSZXNYGJZ3VR6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/action/storage_attestation","attest_author":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/action/author_attestation","sign_citation":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/action/citation_signature","submit_replication":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/action/replication_record"}},"created_at":"2026-05-18T02:55:03.812660+00:00","updated_at":"2026-05-18T02:55:03.812660+00:00"}