{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IENQZKKRJP3JUNG3E36J4DILYZ","short_pith_number":"pith:IENQZKKR","canonical_record":{"source":{"id":"1611.09590","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T12:27:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"844037426c21da1839962afada23fe45425e884ca7c1d09b4eb5b4b949d3c223","abstract_canon_sha256":"61d90eefc2f5d9906f366f68f1d76052bd93ead48fd1a393689d104735328bda"},"schema_version":"1.0"},"canonical_sha256":"411b0ca9514bf69a34db26fc9e0d0bc64f9e917dd77aadc3cbcdb4e927b75fad","source":{"kind":"arxiv","id":"1611.09590","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09590","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09590v3","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09590","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"IENQZKKRJP3J","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IENQZKKRJP3JUNG3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IENQZKKR","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IENQZKKRJP3JUNG3E36J4DILYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09590","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T12:27:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"844037426c21da1839962afada23fe45425e884ca7c1d09b4eb5b4b949d3c223","abstract_canon_sha256":"61d90eefc2f5d9906f366f68f1d76052bd93ead48fd1a393689d104735328bda"},"schema_version":"1.0"},"canonical_sha256":"411b0ca9514bf69a34db26fc9e0d0bc64f9e917dd77aadc3cbcdb4e927b75fad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:24.898907Z","signature_b64":"cX/UNaViBTIQMSWNHt27KOj+KyhRwUC8pc/sLOB/XjgX5NqlWziXXlj4lcP4svofHoAMi1wfwmFz6MNcXU2fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"411b0ca9514bf69a34db26fc9e0d0bc64f9e917dd77aadc3cbcdb4e927b75fad","last_reissued_at":"2026-05-18T00:51:24.898247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:24.898247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09590","source_version":3,"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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMKE2vu1axO+AtLQmwWZfRTpMInMZM29cnyFYlDKq220ldNXK2IGImRGzxquFRBVUVC0MD2ES88WVV5j3wNEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:22:55.903543Z"},"content_sha256":"48e3d0062a999fda6abc55b4bef8ecc2bed99ca6e8e35f8dc6f25f62922912f2","schema_version":"1.0","event_id":"sha256:48e3d0062a999fda6abc55b4bef8ecc2bed99ca6e8e35f8dc6f25f62922912f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IENQZKKRJP3JUNG3E36J4DILYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implicant based parallel all solution solver for Boolean satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Virendra Sule","submitted_at":"2016-11-29T12:27:10Z","abstract_excerpt":"This paper develops a parallel computational solver for computing all satifying assignments of a Boolean system of equations defined by Boolean functions of several variables. While there are we known solvers for satisfiability of Boolean formulas in CNF form, these are designed primarily for deciding satisfiability of the formula and do not address the problem of finding all satisfying solutions. Moreover development of parallel solvers for satisfiability problems is still an unfinished problem of Computer Science. The solver proposed in this paper is aimed at representing all solutions of Bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09590","kind":"arxiv","version":3},"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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19inFEgQIhTZcJeoej+GFc7z3MVYvhQanACog0fTciOn5iLh1FqYBA3kQIGsvr0anlehTffiA+46nriTDDC7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:22:55.904234Z"},"content_sha256":"631540bc8a85c98c8a1900d89939afb346111dec548bef838bb26fcbff904d89","schema_version":"1.0","event_id":"sha256:631540bc8a85c98c8a1900d89939afb346111dec548bef838bb26fcbff904d89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IENQZKKRJP3JUNG3E36J4DILYZ/bundle.json","state_url":"https://pith.science/pith/IENQZKKRJP3JUNG3E36J4DILYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IENQZKKRJP3JUNG3E36J4DILYZ/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-06T12:22:55Z","links":{"resolver":"https://pith.science/pith/IENQZKKRJP3JUNG3E36J4DILYZ","bundle":"https://pith.science/pith/IENQZKKRJP3JUNG3E36J4DILYZ/bundle.json","state":"https://pith.science/pith/IENQZKKRJP3JUNG3E36J4DILYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IENQZKKRJP3JUNG3E36J4DILYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IENQZKKRJP3JUNG3E36J4DILYZ","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":"61d90eefc2f5d9906f366f68f1d76052bd93ead48fd1a393689d104735328bda","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T12:27:10Z","title_canon_sha256":"844037426c21da1839962afada23fe45425e884ca7c1d09b4eb5b4b949d3c223"},"schema_version":"1.0","source":{"id":"1611.09590","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09590","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09590v3","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09590","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"IENQZKKRJP3J","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IENQZKKRJP3JUNG3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IENQZKKR","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:631540bc8a85c98c8a1900d89939afb346111dec548bef838bb26fcbff904d89","target":"graph","created_at":"2026-05-18T00:51:24Z","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":"This paper develops a parallel computational solver for computing all satifying assignments of a Boolean system of equations defined by Boolean functions of several variables. While there are we known solvers for satisfiability of Boolean formulas in CNF form, these are designed primarily for deciding satisfiability of the formula and do not address the problem of finding all satisfying solutions. Moreover development of parallel solvers for satisfiability problems is still an unfinished problem of Computer Science. The solver proposed in this paper is aimed at representing all solutions of Bo","authors_text":"Virendra Sule","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T12:27:10Z","title":"Implicant based parallel all solution solver for Boolean satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09590","kind":"arxiv","version":3},"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:48e3d0062a999fda6abc55b4bef8ecc2bed99ca6e8e35f8dc6f25f62922912f2","target":"record","created_at":"2026-05-18T00:51:24Z","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":"61d90eefc2f5d9906f366f68f1d76052bd93ead48fd1a393689d104735328bda","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T12:27:10Z","title_canon_sha256":"844037426c21da1839962afada23fe45425e884ca7c1d09b4eb5b4b949d3c223"},"schema_version":"1.0","source":{"id":"1611.09590","kind":"arxiv","version":3}},"canonical_sha256":"411b0ca9514bf69a34db26fc9e0d0bc64f9e917dd77aadc3cbcdb4e927b75fad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"411b0ca9514bf69a34db26fc9e0d0bc64f9e917dd77aadc3cbcdb4e927b75fad","first_computed_at":"2026-05-18T00:51:24.898247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:24.898247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cX/UNaViBTIQMSWNHt27KOj+KyhRwUC8pc/sLOB/XjgX5NqlWziXXlj4lcP4svofHoAMi1wfwmFz6MNcXU2fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:24.898907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09590","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48e3d0062a999fda6abc55b4bef8ecc2bed99ca6e8e35f8dc6f25f62922912f2","sha256:631540bc8a85c98c8a1900d89939afb346111dec548bef838bb26fcbff904d89"],"state_sha256":"cb78ac3c1dc454f0c05f4862870a2cadddf2707d874df2db432fb993e24785f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMLeLf6ZIMLlQOG30DSmXb4d/BU+qBS1qrG+BXAeKB9tF57mIV4FbLHPP1co0H3hHJ+X23gMe95baxh+IMpNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:22:55.908437Z","bundle_sha256":"e57666fcc65efd47e1cc7b390cba28bcd21844b6eca09d156f42e226b3c21b95"}}