{"id":"W2013181989","doi":"10.1016/s0304-3975(02)00317-1","title":"A probabilistic analysis of randomly generated binary constraint satisfaction problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Probabilistic logic; Binary number; Constraint (computer-aided design); Constraint satisfaction; Complexity of constraint satisfaction; Mathematics; Probabilistic analysis of algorithms; Computer science; Constraint satisfaction dual problem; Algorithm; Combinatorics; Theoretical computer science; Local consistency; Statistics; Arithmetic","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.001662074,0.000167778,0.000341664,0.0006618063,0.0002483315,0.000205962,0.0005480415,0.00005625483,0.000209122],"category_scores_gemma":[0.0002427707,0.0001422755,0.0001269407,0.004780278,0.002220574,0.000472811,0.0001336134,0.0001292388,0.000009990493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007583969,"about_ca_system_score_gemma":0.0002682843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000814954,"about_ca_topic_score_gemma":0.000006539991,"domain_scores_codex":[0.9977024,0.0002555833,0.0004668644,0.0006531795,0.0005722928,0.0003497084],"domain_scores_gemma":[0.9983747,0.0002371575,0.0001619506,0.0006362261,0.0004007013,0.0001892402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005972367,0.0000430989,0.0009061726,0.000007105527,0.00004944409,0.000002226712,0.0002494746,0.06580717,0.001791274,0.9170991,0.000005175325,0.01403382],"study_design_scores_gemma":[0.0004751927,0.000113733,0.01381123,0.00001405019,0.00008204856,0.00002228289,0.000007269447,0.9648373,0.00157859,0.01885805,0.00001442206,0.0001858191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09640519,0.00001266211,0.9010689,0.0001901557,0.0002985479,0.0002748001,0.000002761787,0.0001262469,0.001620722],"genre_scores_gemma":[0.897389,0.000005258531,0.1024755,0.0001009461,0.000009462151,0.000009581648,0.000001942658,0.00000401436,0.000004304647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8990301,"threshold_uncertainty_score":0.8181798,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01102975299303832,"score_gpt":0.2353388317580776,"score_spread":0.2243090787650393,"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."}}