{"id":"W2552451242","doi":"10.1017/cbo9780511977152","title":"Iterative Methods in Combinatorial Optimization","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Variety (cybernetics); Combinatorial optimization; Computer science; Mathematical optimization; Optimization problem; Theoretical computer science; Simple (philosophy); Mathematics; Algorithm; Artificial intelligence; Discrete mathematics","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.0005070502,0.0003341135,0.0004386693,0.0006027622,0.0001473162,0.00008934637,0.002028415,0.0003773596,0.0000028002],"category_scores_gemma":[0.00004709908,0.0004067055,0.0001421342,0.00008775441,0.0002564871,0.0004750871,0.00129863,0.0007935988,0.000006212045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005164369,"about_ca_system_score_gemma":0.0004207928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003556303,"about_ca_topic_score_gemma":5.303127e-7,"domain_scores_codex":[0.9975497,0.0007446492,0.0002232904,0.0007660202,0.0003041286,0.0004122561],"domain_scores_gemma":[0.998126,0.000295403,0.0002153788,0.0009293541,0.0002673623,0.0001665185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007308705,0.00002361153,7.299356e-7,0.00003209193,0.00003824515,0.0002193324,0.0002519555,0.0002712368,0.00001519837,0.9926362,0.004394011,0.002044312],"study_design_scores_gemma":[0.002959011,0.0002939361,0.000009463404,0.0003213467,0.00005923438,0.00002182715,0.00003726207,0.03435997,0.002376036,0.005458912,0.9527174,0.001385612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[9.484727e-7,0.00004211238,0.4673418,0.000002613114,0.0003591251,0.0003004073,0.00001555434,0.00009030104,0.5318471],"genre_scores_gemma":[0.00001438294,0.00003170111,0.1359569,0.00002087262,0.0000608605,0.000002686716,0.00002350976,0.00002759181,0.8638616],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9871773,"threshold_uncertainty_score":0.9998385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03728163721373292,"score_gpt":0.2879195756049232,"score_spread":0.2506379383911903,"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."}}