{"id":"W3193621667","doi":"10.1007/978-3-030-64018-7_1","title":"A Book About Network Design","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Network planning and design; Selection (genetic algorithm); Computer science; Graph; Combinatorial optimization; Theoretical computer science; Mathematics; Artificial intelligence; Computer network","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","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001579544,0.0003607882,0.0003952124,0.00007417594,0.0001614726,0.0002286043,0.001660976,0.0002196907,0.001578549],"category_scores_gemma":[0.000006992359,0.0003412222,0.0002488613,0.00007942612,0.00008996762,0.0002036852,0.0007193514,0.0004766666,0.001160514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002880385,"about_ca_system_score_gemma":0.000125709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002899813,"about_ca_topic_score_gemma":0.000001737871,"domain_scores_codex":[0.9982778,0.00002533558,0.0003087476,0.0006916415,0.000372217,0.0003242375],"domain_scores_gemma":[0.9986436,0.0001650335,0.0001327421,0.0008102685,0.00005732233,0.0001909722],"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.000001681511,0.000002390989,4.558023e-8,0.000006175146,0.0000286145,0.00004636885,0.00002167834,0.00009333292,1.577388e-7,0.6293056,0.3557959,0.01469799],"study_design_scores_gemma":[0.00006269798,0.00006256606,7.950882e-7,0.00005781964,0.000008745911,0.00001206063,1.635392e-7,0.01973321,0.000003739479,0.3257757,0.6539937,0.000288772],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[4.713111e-10,0.005233318,0.5399987,0.0009048241,0.000406669,0.0001512906,0.000001707376,0.0003194207,0.4529841],"genre_scores_gemma":[0.000001059151,0.0005142255,0.315738,0.01368402,0.0007343523,0.000007807059,0.000004536835,0.0000297605,0.6692863],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3035299,"threshold_uncertainty_score":0.999904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04296006355214073,"score_gpt":0.2278540213340013,"score_spread":0.1848939577818606,"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."}}