{"id":"W2626158319","doi":"","title":"A Learning Optimization Algorithm in Graph Theory. Versatile Search for Extremal Graphs Using a Learning Algorithm","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algorithm; Variable neighborhood search; Heuristic; Computer science; Feature (linguistics); Optimization problem; Extremal optimization; Graph; Mathematics; Invariant (physics); Mathematical optimization; Theoretical computer science; Metaheuristic; Meta-optimization","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002038632,0.000311108,0.0003513969,0.0010491,0.000884592,0.0002713053,0.0008199711,0.000218173,0.00002234669],"category_scores_gemma":[0.000248087,0.0003328536,0.0001991512,0.001993963,0.0002762533,0.0009437132,0.0001257798,0.001089563,0.000004099244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000239928,"about_ca_system_score_gemma":0.000105566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002701073,"about_ca_topic_score_gemma":0.000001346236,"domain_scores_codex":[0.996482,0.0008031991,0.0003857857,0.0007992613,0.0005678698,0.0009619208],"domain_scores_gemma":[0.998387,0.0006575673,0.0001371802,0.0004044594,0.000223545,0.0001902342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007591763,0.00009443366,0.0004074439,0.00001610693,0.00003018224,0.0000953353,0.005279162,0.2978023,0.0006396922,0.1316295,0.000006592754,0.5639234],"study_design_scores_gemma":[0.001139936,0.0004187838,0.0001583236,0.00003929135,0.000008227477,0.00006135787,0.0009530103,0.8997062,0.0006841626,0.09633505,0.0001355159,0.0003601389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02424931,0.0002761285,0.9740525,0.0001642886,0.0001217068,0.0005753388,0.00000438799,0.0002600276,0.0002963399],"genre_scores_gemma":[0.1328664,0.00008517678,0.8664487,0.00009482808,0.00008299532,0.00004145821,0.00002471198,0.00004241,0.0003133277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6019039,"threshold_uncertainty_score":0.9999123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.016419768284362,"score_gpt":0.2747208318595703,"score_spread":0.2583010635752083,"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."}}