{"id":"W4301417336","doi":"10.1002/rsa.20118","title":"The satisfiability threshold for randomly generated binary constraint satisfaction problems","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Satisfiability; Homomorphism; Constraint (computer-aided design); Constraint satisfaction; Discrete mathematics; Binary number; Mathematics; Random graph; Computer science; Combinatorics; Statistics; Arithmetic; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607133,0.0004028165,0.001020818,0.001211223,0.000624756,0.002337738,0.001944108,0.001639665,0.002806433],"category_scores_gemma":[0.05508346,0.0006951343,0.0009231177,0.0006755875,0.002441001,0.004143061,0.001463645,0.002631971,0.0002456822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002604848,"about_ca_system_score_gemma":0.001013015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001297873,"about_ca_topic_score_gemma":0.0009460223,"domain_scores_codex":[0.9961652,0.001809517,0.0002062577,0.0005964997,0.0008432315,0.0003793469],"domain_scores_gemma":[0.9201263,0.06683888,0.005310447,0.004367932,0.001722764,0.001633793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007110955,0.000478997,0.007843064,0.0002930215,0.0002020456,0.0005662129,0.0006708438,0.6052099,0.02355453,0.3434837,0.002712077,0.01427455],"study_design_scores_gemma":[0.00005404661,0.00009843938,0.0006824308,0.00001424693,0.00002257067,0.0001582944,0.0000704253,0.9041598,0.004138221,0.09019337,0.0003871582,0.00002104438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7801865,0.0003718637,0.2104298,0.002097093,0.00003320782,0.0001412078,0.0003597367,0.0008807425,0.005499842],"genre_scores_gemma":[0.9745841,0.0001139537,0.02376264,0.0001637442,0.00002155712,0.00009987141,0.0003143317,0.00008746534,0.0008523043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00607133,"threshold_uncertainty_score":0.03210866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01327690187490386,"score_gpt":0.2629478193031268,"score_spread":0.2496709174282229,"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."}}