{"id":"W3176904788","doi":"10.1609/aaai.v35i5.16507","title":"Satisfiability and Algorithms for Non-uniform Random k-SAT","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Boolean satisfiability problem; Algorithm; Range (aeronautics); Benchmark (surveying); Maximum satisfiability problem; Mathematics; Class (philosophy); Computer science; Probability distribution; Theoretical computer science; Discrete mathematics; Boolean function; Artificial intelligence; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008074746,0.0002159506,0.0003549109,0.00005812631,0.0002746634,0.0003271718,0.001068992,0.0001025144,0.00003142341],"category_scores_gemma":[0.001193415,0.0001556947,0.0001516136,0.0004299884,0.0002818025,0.0003689756,0.0004712773,0.0001978052,0.00002344278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003682199,"about_ca_system_score_gemma":0.0001778472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001988308,"about_ca_topic_score_gemma":0.00002496602,"domain_scores_codex":[0.9982654,0.00001779504,0.0004578873,0.0006045485,0.0003018969,0.0003525034],"domain_scores_gemma":[0.9979211,0.0003098748,0.0002520922,0.0003248939,0.001078968,0.0001130859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007581258,0.0001521719,0.0005680752,0.0001105552,0.00002085111,6.365488e-7,0.002119996,0.00000708979,0.01499445,0.8174117,0.0001885747,0.1643501],"study_design_scores_gemma":[0.0001427198,0.0001883151,0.0005413156,0.000133182,0.00001793494,0.00001122549,0.0004853929,0.1581725,0.4696881,0.3700325,0.0003419964,0.0002448498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2385532,0.0001905096,0.7117201,0.007510933,0.001749485,0.001820288,0.00002628699,0.0002069008,0.03822231],"genre_scores_gemma":[0.9788002,0.00006819311,0.02036016,0.0001578664,0.00009206119,0.00005309696,9.1518e-7,0.000009379489,0.0004581111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.740247,"threshold_uncertainty_score":0.6349044,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06496425787849228,"score_gpt":0.2973526690628409,"score_spread":0.2323884111843486,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}