{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal 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.001725784,0.0008071417,0.001552049,0.001179547,0.000945161,0.0009807298,0.002134195,0.001405734,0.0053288],"category_scores_gemma":[0.005650738,0.0004787785,0.0007046427,0.001517952,0.001116656,0.001916395,0.002189314,0.001649444,0.0009444337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339119,"about_ca_system_score_gemma":0.001562399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002707126,"about_ca_topic_score_gemma":0.004472312,"domain_scores_codex":[0.9987953,0.0005842615,0.00003039565,0.0002215252,0.0002551379,0.0001134349],"domain_scores_gemma":[0.9982374,0.001218848,0.0001230885,0.0001347589,0.0001594359,0.0001265433],"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.0001472696,0.0001421207,0.000454266,0.0002536058,0.0000692423,0.0001111747,0.00008971641,0.8623996,0.001414632,0.06645794,0.008497393,0.05996299],"study_design_scores_gemma":[0.0000389607,0.00003372491,0.00004698136,0.000009594865,0.000007160091,0.00002959401,0.00001547536,0.9752516,0.0003503914,0.02238614,0.001823165,0.00000713015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01947948,0.0007971837,0.9714541,0.0004552201,0.00005580708,0.0001351323,0.0001414528,0.0007788165,0.006702901],"genre_scores_gemma":[0.4292706,0.0005799503,0.5614495,0.000482869,0.0001412933,0.0006730146,0.0008916016,0.0004761872,0.006035013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0053288,"threshold_uncertainty_score":0.01782662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1249041833922344,"score_gpt":0.4055584359057617,"score_spread":0.2806542525135273,"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."}}