{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7VWRRJDEGRX3DIMA3ZOVMTFLLE","short_pith_number":"pith:7VWRRJDE","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"},"canonical_sha256":"fd6d18a464346fb1a180de5d564cab592e001cb94cf577a5272b329069f3004b","source":{"kind":"arxiv","id":"1603.04569","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04569","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04569v2","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04569","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"7VWRRJDEGRX3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7VWRRJDEGRX3DIMA","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7VWRRJDE","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7VWRRJDEGRX3DIMA3ZOVMTFLLE","target":"record","payload":{"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"},"canonical_sha256":"fd6d18a464346fb1a180de5d564cab592e001cb94cf577a5272b329069f3004b","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"},"source_kind":"arxiv","source_id":"1603.04569","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-18T00:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0Lz8jkURN9lVvMSZFdeej53CGxFBd03U3tZO0q0m/Zu/UtxFYE73X4XJNOzE7E45Su6ULI5SiO9Mx3dMwSMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:33:47.837730Z"},"content_sha256":"0d22f8a51100de9d6db84a40a921eed760df8325db75e870f7e8c3515aad23ed","schema_version":"1.0","event_id":"sha256:0d22f8a51100de9d6db84a40a921eed760df8325db75e870f7e8c3515aad23ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7VWRRJDEGRX3DIMA3ZOVMTFLLE","target":"graph","payload":{"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"},"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-18T00:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cqKSSUDvf8nutV8nCOwlffefSs9tnrllcqPxmgav0qO73CCyWmKFA+ZmEyjevAS6NKkbjV9ZnfYGXRIa/4mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:33:47.838099Z"},"content_sha256":"f3b78cdd2d1c48135a2866efdcf9ef263f28303e12842ee6877208f1dfc57510","schema_version":"1.0","event_id":"sha256:f3b78cdd2d1c48135a2866efdcf9ef263f28303e12842ee6877208f1dfc57510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/bundle.json","state_url":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/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-06-02T17:33:47Z","links":{"resolver":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE","bundle":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/bundle.json","state":"https://pith.science/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VWRRJDEGRX3DIMA3ZOVMTFLLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7VWRRJDEGRX3DIMA3ZOVMTFLLE","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":"0d57ee68d1fb3d315c4955450a0651d7d677c89f781fb57db859411afdc8d2b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-15T06:48:50Z","title_canon_sha256":"15588b7600d4f046c4c523a5fcf682327d4a8dd79e72b49bf5c3fc8596627000"},"schema_version":"1.0","source":{"id":"1603.04569","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04569","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04569v2","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04569","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"7VWRRJDEGRX3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7VWRRJDEGRX3DIMA","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7VWRRJDE","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:f3b78cdd2d1c48135a2866efdcf9ef263f28303e12842ee6877208f1dfc57510","target":"graph","created_at":"2026-05-18T00:44:58Z","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":"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 ","authors_text":"Madhav Desai, Virendra Sule","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-15T06:48:50Z","title":"Projective cofactor decompositions of Boolean functions and the satisfiability problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04569","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:0d22f8a51100de9d6db84a40a921eed760df8325db75e870f7e8c3515aad23ed","target":"record","created_at":"2026-05-18T00:44:58Z","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":"0d57ee68d1fb3d315c4955450a0651d7d677c89f781fb57db859411afdc8d2b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-03-15T06:48:50Z","title_canon_sha256":"15588b7600d4f046c4c523a5fcf682327d4a8dd79e72b49bf5c3fc8596627000"},"schema_version":"1.0","source":{"id":"1603.04569","kind":"arxiv","version":2}},"canonical_sha256":"fd6d18a464346fb1a180de5d564cab592e001cb94cf577a5272b329069f3004b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd6d18a464346fb1a180de5d564cab592e001cb94cf577a5272b329069f3004b","first_computed_at":"2026-05-18T00:44:58.121804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:58.121804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fU4yiF0LR+NOaSubwEPv0D0tFXJEHxXPFk2ESKt09nhzBN2RB9yfML1WqPUA1I65/kQXX1CiCi620UP537QkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:58.122193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04569","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d22f8a51100de9d6db84a40a921eed760df8325db75e870f7e8c3515aad23ed","sha256:f3b78cdd2d1c48135a2866efdcf9ef263f28303e12842ee6877208f1dfc57510"],"state_sha256":"b3963e1e70387c444e84fcd01d6534bb661778be333b023d6a8a93246252f3b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hRYbh1BETuiokwEPxAI+IxN90jZEuGPjZgzB29dZ0ym5HVWbGeKKFNX4jSw7HLdSLAyb2X5KDQsX6XyqG45Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:33:47.840632Z","bundle_sha256":"91a1275a285b06f64639040254e5d703ef974fe28469ff6f808f8031a53284ae"}}