{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004310263,0.0005448826,0.0008590982,0.001714507,0.001200134,0.002457466,0.001444533,0.001590331,0.004065123],"category_scores_gemma":[0.04500169,0.0008154429,0.001063188,0.001616134,0.002615179,0.004864305,0.001519423,0.002774193,0.0003132866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001740416,"about_ca_system_score_gemma":0.001235371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002007084,"about_ca_topic_score_gemma":0.001835918,"domain_scores_codex":[0.9981276,0.0009455458,0.00005956795,0.000291249,0.0003226881,0.0002532554],"domain_scores_gemma":[0.9614007,0.0339998,0.00199193,0.001250532,0.0007166909,0.0006404183],"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.0003820412,0.0002646956,0.006034265,0.0002323082,0.00008938875,0.0002904721,0.000572378,0.3381151,0.003032946,0.6103789,0.004867972,0.03573962],"study_design_scores_gemma":[0.00007539867,0.00006448999,0.0008084265,0.00003055658,0.00001861101,0.00009937932,0.00009562678,0.5840801,0.001134197,0.412316,0.001256015,0.00002117172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2414897,0.001359011,0.7398196,0.002895364,0.0000993203,0.0003031958,0.0003505366,0.000678,0.01300517],"genre_scores_gemma":[0.8751991,0.0007387729,0.1202711,0.0004634304,0.0001432622,0.0003510046,0.0003402329,0.0002049296,0.002288258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004310263,"threshold_uncertainty_score":0.02279514,"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."}}