{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CU7DEZNC2E5EKCUNZCVQQKJNAY","short_pith_number":"pith:CU7DEZNC","schema_version":"1.0","canonical_sha256":"153e3265a2d13a450a8dc8ab08292d062f09577e2db86d9a79752b735045bd61","source":{"kind":"arxiv","id":"1101.6009","version":1},"attestation_state":"computed","paper":{"title":"Solving the Satisfiability Problem Through Boolean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","nlin.CG"],"primary_cat":"cs.AI","authors_text":"Andrea Roli, Michela Milano","submitted_at":"2011-01-31T16:32:06Z","abstract_excerpt":"In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework for local search algorithms."},"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":"1101.6009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-01-31T16:32:06Z","cross_cats_sorted":["cs.NE","nlin.CG"],"title_canon_sha256":"9f14c7a4c65bc6445e593a2f2caba995e3415d1cc836791245b7ce9ad4546a8f","abstract_canon_sha256":"b8e2e2a7b113ac5c13428454e809cb81f01d78e5d8b7ed6b17d877344151e8e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:24.469707Z","signature_b64":"K98YAQnT0zTq/jKS9unzZeadqnzQ35SD2re6fph3ZsarZwy64kwaAMfiFa7kJnWYeSSnFbpzp9X+3rPAmVtJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153e3265a2d13a450a8dc8ab08292d062f09577e2db86d9a79752b735045bd61","last_reissued_at":"2026-05-18T04:30:24.469108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:24.469108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Satisfiability Problem Through Boolean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","nlin.CG"],"primary_cat":"cs.AI","authors_text":"Andrea Roli, Michela Milano","submitted_at":"2011-01-31T16:32:06Z","abstract_excerpt":"In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework for local search algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.6009","kind":"arxiv","version":1},"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":"1101.6009","created_at":"2026-05-18T04:30:24.469194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.6009v1","created_at":"2026-05-18T04:30:24.469194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.6009","created_at":"2026-05-18T04:30:24.469194+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU7DEZNC2E5E","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU7DEZNC2E5EKCUN","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU7DEZNC","created_at":"2026-05-18T12:26:26.731475+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/CU7DEZNC2E5EKCUNZCVQQKJNAY","json":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY.json","graph_json":"https://pith.science/api/pith-number/CU7DEZNC2E5EKCUNZCVQQKJNAY/graph.json","events_json":"https://pith.science/api/pith-number/CU7DEZNC2E5EKCUNZCVQQKJNAY/events.json","paper":"https://pith.science/paper/CU7DEZNC"},"agent_actions":{"view_html":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY","download_json":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY.json","view_paper":"https://pith.science/paper/CU7DEZNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.6009&json=true","fetch_graph":"https://pith.science/api/pith-number/CU7DEZNC2E5EKCUNZCVQQKJNAY/graph.json","fetch_events":"https://pith.science/api/pith-number/CU7DEZNC2E5EKCUNZCVQQKJNAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY/action/storage_attestation","attest_author":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY/action/author_attestation","sign_citation":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY/action/citation_signature","submit_replication":"https://pith.science/pith/CU7DEZNC2E5EKCUNZCVQQKJNAY/action/replication_record"}},"created_at":"2026-05-18T04:30:24.469194+00:00","updated_at":"2026-05-18T04:30:24.469194+00:00"}