{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007878719,0.0001306616,0.00021896,0.0004856575,0.0006953015,0.0005404452,0.002524714,0.00009008148,0.00003243525],"category_scores_gemma":[0.0001409181,0.00008793006,0.0002500847,0.001338662,0.0006735318,0.00042846,0.000359891,0.001048112,0.00004464494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001617535,"about_ca_system_score_gemma":0.0004880032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002441328,"about_ca_topic_score_gemma":0.0002348562,"domain_scores_codex":[0.9965515,0.0003304983,0.0007889267,0.0002756492,0.001325693,0.000727761],"domain_scores_gemma":[0.9954527,0.002152234,0.0001518298,0.0004697648,0.001644518,0.0001289705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007634742,0.0001923622,0.00001572672,0.00002262247,0.00002184925,0.00003178425,0.0002881316,0.0103134,0.001038029,0.4180681,0.0006457413,0.5692859],"study_design_scores_gemma":[0.00003458874,0.0004752713,0.00006508361,0.00004140222,0.000003771293,0.00008445493,0.0006368437,0.3995648,0.01434222,0.581023,0.003634352,0.00009412937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003079841,0.0005467168,0.9878349,0.007297743,0.0003977502,0.0004122189,0.000003149366,0.00001987925,0.0004078431],"genre_scores_gemma":[0.9197697,0.000174871,0.07928893,0.00005652166,0.0004811092,0.00002405114,7.530057e-7,0.0000161402,0.0001879011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9166899,"threshold_uncertainty_score":0.5347767,"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."}}