{"id":40499851,"url":"https://github.com/hadar301/sat_algorithms-","last_synced_at":"2026-01-20T19:04:21.059Z","repository":{"id":49380531,"uuid":"441875193","full_name":"Hadar301/SAT_algorithms-","owner":"Hadar301","description":null,"archived":false,"fork":false,"pushed_at":"2022-07-25T08:53:54.000Z","size":29,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-05T01:39:53.636Z","etag":null,"topics":["algorithm","belief-propagation","sat","sat-solver","survey-propagation","warning-propagation"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Hadar301.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":"CITATION.cff","codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2021-12-26T11:34:05.000Z","updated_at":"2025-07-13T10:56:24.000Z","dependencies_parsed_at":"2022-08-25T06:50:13.797Z","dependency_job_id":null,"html_url":"https://github.com/Hadar301/SAT_algorithms-","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Hadar301/SAT_algorithms-","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hadar301%2FSAT_algorithms-","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hadar301%2FSAT_algorithms-/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hadar301%2FSAT_algorithms-/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hadar301%2FSAT_algorithms-/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Hadar301","download_url":"https://codeload.github.com/Hadar301/SAT_algorithms-/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hadar301%2FSAT_algorithms-/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28609600,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-20T18:56:40.769Z","status":"ssl_error","status_checked_at":"2026-01-20T18:54:26.653Z","response_time":117,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","belief-propagation","sat","sat-solver","survey-propagation","warning-propagation"],"created_at":"2026-01-20T19:04:09.326Z","updated_at":"2026-01-20T19:04:19.680Z","avatar_url":"https://github.com/Hadar301.png","language":"Python","readme":"# SAT_algorithms- \n\nImplementation of https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20057 [1]  \n\n\n\n\nRun the test with:\n\n./rand_planted_test_threads.py $1 $2\n\n$1 is the number of litrals N.\n\n$2 is the algorithm:\n\n  'WP' - Warning Propagation.\n  \n  'BP' - Belief Propagation.\n  \n  'SP' - Survey Propagation.\n\nFor each kind of SAT problem there is also a comparison with the performance of Majority Vote algorithm.\n\nThe test is running for random planted SAT and random SAT problems, but can easily change for CNF files.\n\n\n\n[1] Braunstein, Alfredo, Marc Mézard, and Riccardo Zecchina. \"Survey propagation: An algorithm for satisfiability.\" Random Structures \u0026 Algorithms 27.2 (2005): 201-226.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhadar301%2Fsat_algorithms-","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhadar301%2Fsat_algorithms-","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhadar301%2Fsat_algorithms-/lists"}