{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SWTIKMNFQFT5OSZXNYGJZ3VR6J","short_pith_number":"pith:SWTIKMNF","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"},"canonical_sha256":"95a68531a58167d74b376e0c9ceeb1f2717c03eb0183988ac4839ac46255de8f","source":{"kind":"arxiv","id":"1311.3728","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3728","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3728v2","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3728","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"SWTIKMNFQFT5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SWTIKMNFQFT5OSZX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SWTIKMNF","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SWTIKMNFQFT5OSZXNYGJZ3VR6J","target":"record","payload":{"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"},"canonical_sha256":"95a68531a58167d74b376e0c9ceeb1f2717c03eb0183988ac4839ac46255de8f","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"},"source_kind":"arxiv","source_id":"1311.3728","source_version":2,"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-18T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysBG9fND7ITYyam6FV15JyJrqd7CY6X2tLR8+2ATjDj8DbNUmcm/dWUXrn9rZCOtFpwwxA4Ra3VDrWr14v1cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:22:01.357542Z"},"content_sha256":"6917c118a31bc5aeeb542f9b56e954ef148afb384c663875ac9de6bd7c296588","schema_version":"1.0","event_id":"sha256:6917c118a31bc5aeeb542f9b56e954ef148afb384c663875ac9de6bd7c296588"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SWTIKMNFQFT5OSZXNYGJZ3VR6J","target":"graph","payload":{"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"},"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-18T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6Bejfo83UAeN6ExfD21qDbJC2wJ0Nauo8ZLvd9YYqTYBgCFbmUZmxiDrb+uOlxUuf/9k2KXDkOGchV1eW6BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:22:01.357963Z"},"content_sha256":"ce0e7ea8b86066779315727ec1d73ed58cbdb4f9a1a8af76fa19c73874591cd1","schema_version":"1.0","event_id":"sha256:ce0e7ea8b86066779315727ec1d73ed58cbdb4f9a1a8af76fa19c73874591cd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/bundle.json","state_url":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/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-05-28T16:22:01Z","links":{"resolver":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J","bundle":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/bundle.json","state":"https://pith.science/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWTIKMNFQFT5OSZXNYGJZ3VR6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SWTIKMNFQFT5OSZXNYGJZ3VR6J","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":"1a230e45c64b985407b06867cc8a128deb2638484404ea41dcab34e78b242cdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-15T05:06:27Z","title_canon_sha256":"e4b49fb8c0bdaa70462ab24cea08c2abf05c48ef6c8a39330a30c45801f0ca22"},"schema_version":"1.0","source":{"id":"1311.3728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3728","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3728v2","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3728","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"SWTIKMNFQFT5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SWTIKMNFQFT5OSZX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SWTIKMNF","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:ce0e7ea8b86066779315727ec1d73ed58cbdb4f9a1a8af76fa19c73874591cd1","target":"graph","created_at":"2026-05-18T02:55:03Z","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":"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","authors_text":"Jingcheng Liu, Pinyan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-15T05:06:27Z","title":"FPTAS for Counting Monotone CNF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3728","kind":"arxiv","version":2},"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:6917c118a31bc5aeeb542f9b56e954ef148afb384c663875ac9de6bd7c296588","target":"record","created_at":"2026-05-18T02:55:03Z","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":"1a230e45c64b985407b06867cc8a128deb2638484404ea41dcab34e78b242cdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-15T05:06:27Z","title_canon_sha256":"e4b49fb8c0bdaa70462ab24cea08c2abf05c48ef6c8a39330a30c45801f0ca22"},"schema_version":"1.0","source":{"id":"1311.3728","kind":"arxiv","version":2}},"canonical_sha256":"95a68531a58167d74b376e0c9ceeb1f2717c03eb0183988ac4839ac46255de8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95a68531a58167d74b376e0c9ceeb1f2717c03eb0183988ac4839ac46255de8f","first_computed_at":"2026-05-18T02:55:03.812559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:03.812559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oEHok1i9ZNKvICxIVFiCWe/3Qef4C9s620+z0aTG1V43+keSgqVxlyOGiArhRQXsAlqygMCaFhd+FkNbBLJ9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:03.813095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6917c118a31bc5aeeb542f9b56e954ef148afb384c663875ac9de6bd7c296588","sha256:ce0e7ea8b86066779315727ec1d73ed58cbdb4f9a1a8af76fa19c73874591cd1"],"state_sha256":"2ecfe3d79c91acc7adf8b71e8c228971e1ade58c4e209b66026d30387f4ee7d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S47KvaMDkT16StixFhwOpJAVQDpER8Qy/tM2IUc0Np9jJZ5RynsPMMIb33C2YTVGNHOTtjQKR7/d8lPeY0PuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:22:01.360341Z","bundle_sha256":"42c30cc20efe6274f804668d699d7a9e2fbfc430e12b05c7c1343a3a6c919f83"}}