{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002143751,0.001063401,0.0006640918,0.001378882,0.00102772,0.002612772,0.0009440567,0.001075937,0.1610639],"category_scores_gemma":[0.0009525965,0.0006824037,0.0004799741,0.00240049,0.0007055484,0.003269403,0.0009349025,0.002274908,0.07901555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001647814,"about_ca_system_score_gemma":0.0008898973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001602365,"about_ca_topic_score_gemma":0.004699041,"domain_scores_codex":[0.9997465,0.00003077737,0.000006184376,0.00004166816,0.0001545226,0.00002024247],"domain_scores_gemma":[0.9996796,0.0001254369,0.00001199347,0.00004519576,0.00009669931,0.00004118553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001069669,0.00004601738,0.00004748089,0.0001846203,0.000006217331,0.00002884372,0.00006894311,0.00175343,0.0006175558,0.1195799,0.7207903,0.1568659],"study_design_scores_gemma":[0.000002382103,0.000007899919,0.00007380622,0.00008501788,0.000002973494,0.00004169685,0.00002366151,0.0007328694,0.000159041,0.04697443,0.951891,0.000005153952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000444988,0.009032994,0.01713599,0.002563319,0.003089194,0.00005258174,0.0003844643,0.0004781196,0.9668185],"genre_scores_gemma":[0.002870796,0.006008985,0.005230695,0.000882126,0.0007061754,0.00005062921,0.0002710383,0.0003072046,0.9836723],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1610639,"threshold_uncertainty_score":0.5388124,"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."}}