{"id":"W301099071","doi":"","title":"Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Clique problem; Satisfiability; Monotone polygon; Clique; Computer science; Time complexity; Random graph; Local search (optimization); Mathematics; Boolean satisfiability problem; Graph; Theoretical computer science; Mathematical optimization; Algorithm; Combinatorics; Line graph; Pathwidth","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.0004524473,0.0001335135,0.0001658196,0.0003444695,0.00007589818,0.0001223886,0.0003482124,0.00005305394,0.000110119],"category_scores_gemma":[0.0001800033,0.0001316873,0.00004445102,0.0003543435,0.0001161514,0.0002972113,0.00008740664,0.0001884884,0.00002431033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025665,"about_ca_system_score_gemma":0.0001295617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005104057,"about_ca_topic_score_gemma":0.0004118757,"domain_scores_codex":[0.9985495,0.00008789967,0.000628841,0.0003836068,0.0001764154,0.0001737319],"domain_scores_gemma":[0.9989244,0.0001776467,0.0001045488,0.0002518389,0.0004371607,0.0001044157],"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.00001551215,0.0002597558,0.0001546583,0.000004507134,0.000004814066,4.216086e-7,0.001909207,0.005792379,0.009029129,0.5308443,0.000005023321,0.4519804],"study_design_scores_gemma":[0.0001751306,0.0002577206,0.003891988,0.0001297086,0.000002532878,0.00001412495,0.0005673896,0.8173297,0.06507365,0.1122025,0.0001116389,0.000243895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07368656,0.000003109246,0.9024662,0.01981597,0.00009042734,0.00034337,0.00004861418,0.00004312941,0.003502589],"genre_scores_gemma":[0.9451873,0.00001760295,0.05443461,0.0002599064,0.00003348131,0.00004064585,0.000008315342,0.000005110941,0.00001298467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8715008,"threshold_uncertainty_score":0.5370054,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09141986618334437,"score_gpt":0.3564744036721659,"score_spread":0.2650545374888216,"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."}}