{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7VWRRJDEGRX3DIMA3ZOVMTFLLE","short_pith_number":"pith:7VWRRJDE","schema_version":"1.0","canonical_sha256":"fd6d18a464346fb1a180de5d564cab592e001cb94cf577a5272b329069f3004b","source":{"kind":"arxiv","id":"1603.04569","version":2},"attestation_state":"computed","paper":{"title":"Projective cofactor decompositions of Boolean functions and the satisfiability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Madhav Desai, Virendra Sule","submitted_at":"2016-03-15T06:48:50Z","abstract_excerpt":"Given a CNF formula $F$, we present a new algorithm for deciding the satisfiability (SAT) of $F$ and computing all solutions of assignments. The algorithm is based on the concept of \\emph{cofactors} known in the literature. This paper is a fallout of the previous work by authors on Boolean satisfiability \\cite{sul1, sul2,sude}, however the algorithm is essentially independent of the orthogonal expansion concept over which previous papers were based. The algorithm selects a single concrete cofactor recursively by projecting the search space to the set which satisfies a CNF in the formula. This "},"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":"1603.04569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-15T06:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"15588b7600d4f046c4c523a5fcf682327d4a8dd79e72b49bf5c3fc8596627000","abstract_canon_sha256":"0d57ee68d1fb3d315c4955450a0651d7d677c89f781fb57db859411afdc8d2b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:58.122193Z","signature_b64":"fU4yiF0LR+NOaSubwEPv0D0tFXJEHxXPFk2ESKt09nhzBN2RB9yfML1WqPUA1I65/kQXX1CiCi620UP537QkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd6d18a464346fb1a180de5d564cab592e001cb94cf577a5272b329069f3004b","last_reissued_at":"2026-05-18T00:44:58.121804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:58.121804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projective cofactor decompositions of Boolean functions and the satisfiability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Madhav Desai, Virendra Sule","submitted_at":"2016-03-15T06:48:50Z","abstract_excerpt":"Given a CNF formula $F$, we present a new algorithm for deciding the satisfiability (SAT) of $F$ and computing all solutions of assignments. The algorithm is based on the concept of \\emph{cofactors} known in the literature. This paper is a fallout of the previous work by authors on Boolean satisfiability \\cite{sul1, sul2,sude}, however the algorithm is essentially independent of the orthogonal expansion concept over which previous papers were based. The algorithm selects a single concrete cofactor recursively by projecting the search space to the set which satisfies a CNF in the formula. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04569","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":"1603.04569","created_at":"2026-05-18T00:44:58.121865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04569v2","created_at":"2026-05-18T00:44:58.121865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04569","created_at":"2026-05-18T00:44:58.121865+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VWRRJDEGRX3","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VWRRJDEGRX3DIMA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VWRRJDE","created_at":"2026-05-18T12:30:04.600751+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/7VWRRJDEGRX3DIMA3ZOVMTFLLE","json":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE.json","graph_json":"https://pith.science/api/pith-number/7VWRRJDEGRX3DIMA3ZOVMTFLLE/graph.json","events_json":"https://pith.science/api/pith-number/7VWRRJDEGRX3DIMA3ZOVMTFLLE/events.json","paper":"https://pith.science/paper/7VWRRJDE"},"agent_actions":{"view_html":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE","download_json":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE.json","view_paper":"https://pith.science/paper/7VWRRJDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04569&json=true","fetch_graph":"https://pith.science/api/pith-number/7VWRRJDEGRX3DIMA3ZOVMTFLLE/graph.json","fetch_events":"https://pith.science/api/pith-number/7VWRRJDEGRX3DIMA3ZOVMTFLLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/action/storage_attestation","attest_author":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/action/author_attestation","sign_citation":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/action/citation_signature","submit_replication":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/action/replication_record"}},"created_at":"2026-05-18T00:44:58.121865+00:00","updated_at":"2026-05-18T00:44:58.121865+00:00"}