{"meta":{"query_hash":"1eb0e76dabac","filters":{"venue":"Networks"},"cohort_total":145,"direct_labels_cover":0,"predictions_cover":145,"exported":145,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1eb0e76dabac","api":"https://metacan.xera.ac/api/v1/cohort?venue=Networks"},"results":[{"id":"W1595340722","doi":"10.1002/net.21626","title":"Multilayer variable neighborhood search for two‐level uncapacitated facility location problems with single assignment","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Ministère de l'Enseignement Supérieur et de la Recherche","keywords":"Variable neighborhood search; Mathematical optimization; Solver; Heuristic; Metaheuristic; Modular design; Integer programming; Variable (mathematics); Set (abstract data type); Class (philosophy); Facility location problem; Computer science; Integer (computer science); Mathematics; Local search (optimization); Artificial intelligence","score_opus":0.10973809488479432,"score_gpt":0.2532086931541283,"score_spread":0.143470598269334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595340722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008308251,0.00007628313,0.97324747,0.0008571184,0.00063080963,0.0016892995,0.000013648014,0.00024610324,0.014931023],"genre_scores_gemma":[0.9950183,0.0000017569749,0.0017607507,0.0007978883,0.00042623046,0.0002640089,0.00040753486,0.000024559318,0.0012989904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821347,0.000025646055,0.00036007544,0.0004640341,0.00044057667,0.00049617846],"domain_scores_gemma":[0.99857074,0.000027525572,0.000086187516,0.0003876067,0.00087715517,0.000050772822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071792,0.0002388304,0.00020906905,0.000118105745,0.00019618157,0.00024375552,0.0002307341,0.00008354153,0.00019939913],"category_scores_gemma":[0.00006835932,0.00020535082,0.000042218264,0.0007759502,0.000056239824,0.0007514182,0.00009972747,0.00014469055,0.0001754166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017893185,0.00040129008,0.0033531692,0.0002178373,0.00007004752,5.8272826e-7,0.00012867912,0.966741,0.000060583825,0.008462676,0.009835471,0.010549711],"study_design_scores_gemma":[0.0023089384,0.00008357669,0.0009564895,0.000055784007,0.00006960474,3.7880892e-7,0.0004524546,0.94617325,0.00004351595,0.00080372655,0.048682034,0.00037024845],"about_ca_topic_score_codex":0.0012942915,"about_ca_topic_score_gemma":0.0005658012,"teacher_disagreement_score":0.98671,"about_ca_system_score_codex":0.00016191967,"about_ca_system_score_gemma":0.000056456036,"threshold_uncertainty_score":0.8373964},"labels":[],"label_agreement":null},{"id":"W1965979685","doi":"10.1002/net.21519","title":"The split delivery capacitated team orienteering problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Orienteering; Computer science; Operations research; Profit (economics); Mathematical optimization; Set (abstract data type); Benchmark (surveying); Mathematics; Economics; Microeconomics","score_opus":0.006827192193179859,"score_gpt":0.197415121976764,"score_spread":0.19058792978358413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965979685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389006,0.0013795935,0.82063824,0.0001470975,0.0014300597,0.0007371715,0.0000013564253,0.0017059325,0.035059933],"genre_scores_gemma":[0.9245048,0.00023177746,0.073979,0.00006689265,0.000293876,0.00010209844,0.0000067312476,0.00007308194,0.00074170256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.000048637598,0.00020971007,0.00011920116,0.00010567656,0.00035343936],"domain_scores_gemma":[0.99942714,0.00016485184,0.000027478478,0.00023480518,0.00007605836,0.00006967076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028111847,0.00012335423,0.0000978355,0.000024262286,0.00016766888,0.0001260699,0.00016918567,0.00008733561,0.000058734466],"category_scores_gemma":[0.00002723935,0.00009697633,0.00003542706,0.0002493503,0.000033489112,0.0001318767,0.000033783286,0.00026124818,0.00008009373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010005143,0.0000025557192,0.00040677117,0.000006498534,0.000019601956,3.680266e-7,0.00009935925,0.9555528,0.00011976691,0.00024796516,0.009038494,0.03450478],"study_design_scores_gemma":[0.00010158613,0.0000072806856,0.00076129194,0.000020878488,0.000005635731,0.0000030902386,0.000051650717,0.9891948,0.000078517005,0.000121388926,0.009532026,0.000121815756],"about_ca_topic_score_codex":0.000024364837,"about_ca_topic_score_gemma":0.000005468794,"teacher_disagreement_score":0.78560424,"about_ca_system_score_codex":0.00005686497,"about_ca_system_score_gemma":0.000006091879,"threshold_uncertainty_score":0.395458},"labels":[],"label_agreement":null},{"id":"W1971036791","doi":"10.1002/net.21580","title":"Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spanning tree; Branch and cut; Maximum cut; Mathematics; Minimum spanning tree; Linear programming relaxation; Integer programming; Linear programming; Linearization; Branch and bound; Cutting-plane method; Quadratic equation; Combinatorics; Relaxation (psychology); Branch and price; Mathematical optimization; Algorithm; Graph; Nonlinear system","score_opus":0.02871880323920883,"score_gpt":0.266627552590149,"score_spread":0.23790874935094014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971036791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045297526,0.012449489,0.9391783,0.00068606774,0.0004944864,0.0008325143,0.0000058494925,0.0002869427,0.0007688603],"genre_scores_gemma":[0.86768246,0.0013814564,0.12922683,0.00031626123,0.0007571138,0.00011304697,0.000013245131,0.00013081994,0.00037875443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859416,0.00009825999,0.00034662386,0.0003391014,0.0001685052,0.0004533688],"domain_scores_gemma":[0.99864984,0.00072054256,0.00008300285,0.00024107851,0.00007699999,0.0002285408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009944804,0.00027937203,0.0003345717,0.0000578592,0.00020228808,0.00017685292,0.00012468253,0.00018995856,0.000004100369],"category_scores_gemma":[0.00011845767,0.00023129866,0.00003851625,0.0002033672,0.00009651738,0.00016765171,0.00009919971,0.00031491503,0.0000011611396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060339247,0.000022566128,0.0054752775,0.00024700307,0.00016562101,0.0000030064534,0.0034135394,0.5613912,0.00007273372,0.0004503326,0.0024679275,0.4262305],"study_design_scores_gemma":[0.0012958859,0.0000808118,0.0030962871,0.000117863136,0.000091351496,0.000048081798,0.00016342763,0.9905593,0.000031094358,0.00037317458,0.003850709,0.00029201928],"about_ca_topic_score_codex":0.000020333311,"about_ca_topic_score_gemma":0.00004828378,"teacher_disagreement_score":0.82238495,"about_ca_system_score_codex":0.000039854887,"about_ca_system_score_gemma":0.000030083746,"threshold_uncertainty_score":0.9432086},"labels":[],"label_agreement":null},{"id":"W1972661641","doi":"10.1002/net.20099","title":"The multiroute maximum flow problem revisited","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Maximum flow problem; Flow network; Vertex (graph theory); Flow (mathematics); Combinatorics; Disjoint sets; Mathematics; Path (computing); Arc (geometry); Multi-commodity flow problem; Minimum-cost flow problem; Integer programming; Mathematical optimization; Computer science; Graph","score_opus":0.01131194124672325,"score_gpt":0.22609503827198374,"score_spread":0.2147830970252605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972661641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013733839,0.0016129141,0.9873024,0.0037706292,0.00046156623,0.00020495577,9.4934137e-7,0.00028640905,0.0062228423],"genre_scores_gemma":[0.14312534,0.0008117087,0.8473529,0.003106607,0.0024639075,0.00006368518,0.000009689358,0.000029249773,0.003036905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884975,0.0000684341,0.00020700757,0.0002857153,0.00019964908,0.0003894505],"domain_scores_gemma":[0.99895525,0.00016687067,0.0000630568,0.00068281754,0.000053731306,0.00007827573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038862694,0.00012375014,0.000109284585,0.000028848062,0.00047720727,0.0003152132,0.0011318921,0.00006324621,0.0000152120365],"category_scores_gemma":[0.0000117604395,0.000086586835,0.000086690554,0.00043441972,0.00006886423,0.00024382588,0.0003120967,0.00027457994,0.00006773911],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029814196,0.000020681586,0.000046338988,0.0000018824793,0.00001132011,0.000003373424,0.0001142577,0.015152058,0.0000018113963,0.035487466,0.012458344,0.9366995],"study_design_scores_gemma":[0.00013604992,0.000015597541,0.00025855284,0.000015732003,0.0000022108109,0.000008358017,0.0000023897783,0.74949783,0.00000770266,0.009872324,0.24008429,0.00009892798],"about_ca_topic_score_codex":0.0000043165314,"about_ca_topic_score_gemma":0.000020496469,"teacher_disagreement_score":0.93660057,"about_ca_system_score_codex":0.000023997147,"about_ca_system_score_gemma":0.000014701536,"threshold_uncertainty_score":0.36703408},"labels":[],"label_agreement":null},{"id":"W1982676876","doi":"10.1002/net.1034","title":"<i>k</i>‐Broadcasting in trees","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Broadcasting (networking); Vertex (graph theory); Computer science; Focus (optics); Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Computer network; Graph; Physics","score_opus":0.015188709972557767,"score_gpt":0.2276185526352694,"score_spread":0.21242984266271162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982676876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016607061,0.0005861125,0.9455669,0.00026564897,0.0014660697,0.00009079989,7.1370145e-8,0.000164696,0.035252642],"genre_scores_gemma":[0.9970448,0.00006498198,0.001119808,0.00040451204,0.00056046405,0.000011458197,5.701139e-7,0.000006651728,0.00078675675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990347,0.00006755792,0.00023122858,0.00024424505,0.00010803137,0.0003142402],"domain_scores_gemma":[0.9994668,0.00011202446,0.000052881915,0.00028048514,0.00003662394,0.000051213632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003163528,0.000092038885,0.00012882697,0.0000731139,0.00006660203,0.00012042335,0.00038352137,0.00007495757,0.000021956683],"category_scores_gemma":[0.000019829731,0.000084463776,0.000037269503,0.000681875,0.000011216278,0.00025575492,0.00008520542,0.00016982514,0.00003030525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002155108,0.00010831846,0.073194794,0.000010028293,0.000018338673,0.00032100425,0.00093447475,0.6202612,0.00003167215,0.029581448,0.020049777,0.2554674],"study_design_scores_gemma":[0.0002132307,0.000029377274,0.0034212433,0.000060501712,6.6044873e-7,0.00008073795,0.000022652986,0.9628114,0.000003444055,0.00032335223,0.032909892,0.00012348412],"about_ca_topic_score_codex":0.00005830083,"about_ca_topic_score_gemma":0.0005784458,"teacher_disagreement_score":0.98043776,"about_ca_system_score_codex":0.00003296925,"about_ca_system_score_gemma":0.000014756868,"threshold_uncertainty_score":0.34443328},"labels":[],"label_agreement":null},{"id":"W1985050732","doi":"10.1002/net.10042","title":"Fast permutation routing in a class of interconnection networks","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Permutation (music); Routing (electronic design automation); Class (philosophy); Upper and lower bounds; Computer science; Interconnection; Time complexity; Permutation graph; Combinatorics; Mathematics; Theoretical computer science; Mathematical optimization; Discrete mathematics; Computer network; Graph; Artificial intelligence","score_opus":0.016087987533575578,"score_gpt":0.21796019163249497,"score_spread":0.2018722040989194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985050732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025914747,0.00030568123,0.9645409,0.00017686644,0.0020649952,0.00019293216,2.4378545e-7,0.00011771753,0.006685917],"genre_scores_gemma":[0.9983908,0.00005453669,0.000570522,0.0001737659,0.0004987392,0.000022851546,0.0000023101709,0.000014272248,0.00027218403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826825,0.00019644412,0.00060121034,0.00037534928,0.0001791948,0.00037958202],"domain_scores_gemma":[0.999059,0.00016514763,0.00024710537,0.00036392975,0.00010401987,0.000060798637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423078,0.0001640757,0.00027634058,0.00017501369,0.000086278626,0.00010887172,0.0004003095,0.00019494716,0.00005365675],"category_scores_gemma":[0.000030652966,0.0001627343,0.00010757418,0.0007971967,0.00003087065,0.00047141843,0.00010476596,0.0003555616,0.0000129370155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010589892,0.000078170226,0.003938099,0.000010508291,0.000019236952,0.000011260937,0.001428355,0.8899768,0.000029582863,0.021693934,0.0020466268,0.08075683],"study_design_scores_gemma":[0.00034977598,0.00008905622,0.0014733104,0.00014838544,0.0000032664557,0.000032764463,0.00015554923,0.9970757,0.000016212562,0.00012923781,0.00037000695,0.00015677571],"about_ca_topic_score_codex":0.000083496314,"about_ca_topic_score_gemma":0.00024835102,"teacher_disagreement_score":0.97247607,"about_ca_system_score_codex":0.000102062426,"about_ca_system_score_gemma":0.000006708976,"threshold_uncertainty_score":0.66361123},"labels":[],"label_agreement":null},{"id":"W1988551609","doi":"10.1002/net.21453","title":"Deterministic rendezvous in networks: A comprehensive survey","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Task (project management); Graph; Terrain; Undirected graph; Theoretical computer science; Mathematical optimization; Operations research; Mathematics; Geography; Engineering","score_opus":0.04834175643551917,"score_gpt":0.2885700570184015,"score_spread":0.24022830058288233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988551609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029268397,0.0009986884,0.9930311,0.00008212479,0.00089632533,0.00021305746,9.0124416e-7,0.00012442509,0.0017265425],"genre_scores_gemma":[0.99236286,0.00014853461,0.006394476,0.0006691801,0.00019782023,0.000020594196,0.00001658208,0.000012947137,0.0001770115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982418,0.0003975539,0.0002612179,0.00025109088,0.00018202873,0.0006663038],"domain_scores_gemma":[0.99881315,0.0004050534,0.00007004106,0.00042617094,0.00008394171,0.00020163115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065917446,0.0001377941,0.00019004966,0.0000915767,0.000082269624,0.00011947563,0.00052601076,0.00011237094,0.000027497055],"category_scores_gemma":[0.00004888247,0.00013293287,0.00003629206,0.00071575795,0.000043739106,0.00037407575,0.0002443788,0.0002933242,0.00003722774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017046656,0.00014509066,0.084901474,0.000007029295,0.000012625187,0.000019431165,0.0004646814,0.86513656,0.0000013885993,0.0041621733,0.005886314,0.03924618],"study_design_scores_gemma":[0.00025536132,0.00003116453,0.13145648,0.00001615664,0.0000011297061,0.000009636437,0.0000056509475,0.86600554,4.958807e-7,0.00006561015,0.0020092821,0.00014350799],"about_ca_topic_score_codex":0.00006763393,"about_ca_topic_score_gemma":0.0001311606,"teacher_disagreement_score":0.98943603,"about_ca_system_score_codex":0.000043355998,"about_ca_system_score_gemma":0.000029767589,"threshold_uncertainty_score":0.5420845},"labels":[],"label_agreement":null},{"id":"W1989850675","doi":"10.1002/net.3","title":"The capacitated arc routing problem with intermediate facilities","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Arc routing; Benchmark (surveying); Arc (geometry); Mathematical optimization; Routing (electronic design automation); Computer science; Relaxation (psychology); Set (abstract data type); Integer programming; Integer (computer science); Upper and lower bounds; Mathematics; Computer network; Geography","score_opus":0.011514392974517382,"score_gpt":0.2159405566209453,"score_spread":0.2044261636464279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989850675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141757,0.0003711052,0.8774716,0.0001228698,0.00037886057,0.00024558062,0.0000022339218,0.0009640518,0.019026121],"genre_scores_gemma":[0.9842566,0.00020235003,0.014054942,0.00004143091,0.00017376115,0.000029611921,0.0000068267746,0.00004400046,0.0011904723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.00006961032,0.00019728372,0.000119290926,0.000115835035,0.000376678],"domain_scores_gemma":[0.99944454,0.0002188825,0.000035067205,0.00019564202,0.00005087586,0.000054967462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840531,0.00013573638,0.00011311554,0.00002554972,0.00018019743,0.00009906384,0.00014901954,0.00006622713,0.000022208107],"category_scores_gemma":[0.000032903863,0.00009327234,0.000025448544,0.00025478943,0.00007618181,0.00008623182,0.000022191243,0.0002872861,0.000009596825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010559767,0.0000021419664,0.0023019603,0.0000068393765,0.000027444257,0.000004189709,0.00055713777,0.9732297,0.000010961584,0.0001438853,0.0005394293,0.023165742],"study_design_scores_gemma":[0.00019788131,0.000021524927,0.0007849363,0.000047082725,0.0000073307187,0.000016151173,0.00033868648,0.9915153,0.000027845148,0.00007576241,0.0068247803,0.00014274815],"about_ca_topic_score_codex":0.000011341772,"about_ca_topic_score_gemma":0.000050963845,"teacher_disagreement_score":0.882839,"about_ca_system_score_codex":0.00004704496,"about_ca_system_score_gemma":0.000008662758,"threshold_uncertainty_score":0.38035357},"labels":[],"label_agreement":null},{"id":"W1992144665","doi":"10.1002/net.21557","title":"Substitutes, complements, and ripples in multicommodity flows on suspension graphs","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-commodity flow problem; Mathematics; Graph; Enumeration; Flow network; Combinatorics; Suspension (topology); Flow (mathematics); Discrete mathematics; Mathematical optimization; Pure mathematics; Geometry","score_opus":0.012807817476858125,"score_gpt":0.20968118597408356,"score_spread":0.19687336849722542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992144665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749444,0.00020354752,0.0053244727,0.001356632,0.0009100236,0.0010397217,0.0000011629917,0.00023052366,0.01598951],"genre_scores_gemma":[0.9966212,0.000030002167,0.00029367238,0.002277271,0.00057826575,0.000030916763,0.00007794052,0.000026115715,0.00006463614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986557,0.000033477365,0.0002598709,0.00037662478,0.00022220696,0.0004521645],"domain_scores_gemma":[0.99937993,0.00011867832,0.000105239335,0.00032327743,0.000054461198,0.00001842644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007021384,0.00021543617,0.0002310186,0.00031904125,0.00018716966,0.00021979655,0.0002102059,0.00007106561,0.00012326206],"category_scores_gemma":[0.00008341148,0.00020680887,0.0000404429,0.0004010587,0.00005227843,0.00037175737,0.00030541627,0.00020581955,0.000042748357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020897864,0.00039720724,0.29544982,0.00032370875,0.000057315196,0.00007572107,0.00007309439,0.1293853,0.000021796444,0.45595923,0.04154715,0.07650068],"study_design_scores_gemma":[0.0015542674,0.000016974036,0.112708375,0.00008476386,0.000025209833,4.0365194e-7,0.00019944253,0.68504995,0.00000225342,0.009769368,0.19027326,0.0003157098],"about_ca_topic_score_codex":0.0011610358,"about_ca_topic_score_gemma":0.0028583016,"teacher_disagreement_score":0.55566466,"about_ca_system_score_codex":0.000048355538,"about_ca_system_score_gemma":0.0000033304575,"threshold_uncertainty_score":0.84334207},"labels":[],"label_agreement":null},{"id":"W1992432313","doi":"10.1002/net.1022","title":"Efficient communication in unknown networks","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Broadcasting (networking); Computer science; Dissemination; Node (physics); Synchronization (alternating current); Overhead (engineering); Computer network; Constant (computer programming); Simple (philosophy); Network topology; State (computer science); Limit (mathematics); Binary logarithm; Distributed computing; Broadcast communication network; Telecommunications network; Theoretical computer science; Algorithm; Topology (electrical circuits); Mathematics; Discrete mathematics; Telecommunications; Combinatorics; Channel (broadcasting)","score_opus":0.007117616545489455,"score_gpt":0.2589590344058749,"score_spread":0.25184141786038544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992432313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477321,0.004235318,0.14153954,0.00036304005,0.00011304084,0.0002354038,0.0000010037979,0.00009208461,0.0056884186],"genre_scores_gemma":[0.9957921,0.0014960322,0.0017884639,0.00030990082,0.00018394756,0.0000087361295,0.000102750746,0.0000139978665,0.0003040811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.000077260454,0.00018817082,0.00023557311,0.00006591268,0.00023688054],"domain_scores_gemma":[0.99938416,0.000011152751,0.00006519143,0.00045150088,0.000045618734,0.00004234303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023209373,0.00011608338,0.00011933856,0.00003995907,0.00006721951,0.00001635921,0.00016376928,0.0001952109,0.0000024742324],"category_scores_gemma":[0.000019135621,0.00010609959,0.00006368107,0.00024779828,0.00006946144,0.0000010443007,0.00009491516,0.00015864887,0.000001219791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002219065,0.00028942197,0.016365936,0.000003862486,0.000054604883,0.000017513623,0.000025876865,0.88304484,0.01432653,0.00037170036,0.0046482226,0.08062957],"study_design_scores_gemma":[0.0007954992,0.00019530569,0.0071819252,0.00010116502,0.00003481361,0.00004631292,0.000058934103,0.9036847,0.0063042915,0.00013320596,0.0808563,0.00060756435],"about_ca_topic_score_codex":0.000013426269,"about_ca_topic_score_gemma":0.0001996768,"teacher_disagreement_score":0.14805995,"about_ca_system_score_codex":0.000018567858,"about_ca_system_score_gemma":0.000008733244,"threshold_uncertainty_score":0.43266156},"labels":[],"label_agreement":null},{"id":"W1993924585","doi":"10.1002/net.20448","title":"Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Pickup; Travelling salesman problem; Benchmark (surveying); Stack (abstract data type); Constraint (computer-aided design); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Artificial intelligence; Computer network","score_opus":0.014590875047121185,"score_gpt":0.21152627650574535,"score_spread":0.19693540145862415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993924585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018421052,0.0028988975,0.97609574,0.000059384533,0.00021681366,0.00057214533,0.000011164373,0.00018721966,0.0015375649],"genre_scores_gemma":[0.9947367,0.00033362606,0.004370584,0.00007774628,0.0002856326,0.000045346944,0.000023351651,0.0000432766,0.00008376279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930805,0.000015263045,0.00010841834,0.000094877,0.000078924175,0.00039444858],"domain_scores_gemma":[0.9995618,0.00018385061,0.000015349902,0.00012328826,0.000036954043,0.00007879168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025908757,0.000112461115,0.00009474437,0.000019141231,0.00015955529,0.000054692704,0.000070901864,0.00007580817,0.000019209081],"category_scores_gemma":[0.0000029948455,0.00007802997,0.00002207838,0.000101198435,0.000020568756,0.00011549956,0.000018813567,0.00018120224,0.000002640102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020542591,0.000017786602,0.039187748,0.000052618565,0.00005410043,2.120729e-7,0.0013433393,0.95128536,0.000009979227,0.0008193396,0.0006715589,0.0065374286],"study_design_scores_gemma":[0.00069159805,0.000030216212,0.0027711084,0.000037243062,0.000023816956,0.000003847524,0.000179404,0.9890074,0.000036795034,0.000009904175,0.007073642,0.00013498754],"about_ca_topic_score_codex":0.000004738752,"about_ca_topic_score_gemma":0.00004388416,"teacher_disagreement_score":0.9763156,"about_ca_system_score_codex":0.000014394971,"about_ca_system_score_gemma":0.0000072909947,"threshold_uncertainty_score":0.31819698},"labels":[],"label_agreement":null},{"id":"W1994505045","doi":"10.1002/net.20015","title":"Probabilistic location problems with discrete demand weights","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Mathematical optimization; Computer science; Mathematics; Artificial intelligence","score_opus":0.011725078169225347,"score_gpt":0.19628348771171292,"score_spread":0.18455840954248756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994505045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18521273,0.00060267106,0.73711497,0.007147354,0.0013324247,0.0027515646,0.000001124514,0.00087774236,0.06495943],"genre_scores_gemma":[0.99775404,0.000015975085,0.0002676115,0.0007958265,0.00056635484,0.00008957042,0.000064397995,0.000018386912,0.00042783457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901086,0.000005461001,0.0002165057,0.00028930433,0.00021500324,0.00026287168],"domain_scores_gemma":[0.9995025,0.00000494275,0.000062054176,0.00026560505,0.0001495051,0.000015418802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020019288,0.00015735159,0.00011950108,0.00008474933,0.00018343319,0.00015633214,0.00015859301,0.00004918079,0.000130255],"category_scores_gemma":[0.000017856199,0.00012024764,0.000030065437,0.0005684299,0.00005658943,0.0005882244,0.000058132544,0.00009875305,0.000277411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022980936,0.00006656704,0.0015244383,0.00018890326,0.000020294763,0.000001674761,0.000032102813,0.9100859,0.0000011280403,0.08581198,0.00083123357,0.0014127712],"study_design_scores_gemma":[0.0032340349,0.00009697457,0.055392344,0.0006346711,0.0002735447,0.0000031813984,0.00018828966,0.73360884,0.000008687757,0.052109137,0.1532315,0.0012188187],"about_ca_topic_score_codex":0.0006233386,"about_ca_topic_score_gemma":0.0020467357,"teacher_disagreement_score":0.8125413,"about_ca_system_score_codex":0.000046471054,"about_ca_system_score_gemma":0.00001598174,"threshold_uncertainty_score":0.49035564},"labels":[],"label_agreement":null},{"id":"W1995554557","doi":"10.1002/net.10016","title":"Deterministic radio broadcasting at low cost","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Université du Québec à Montréal","funders":"","keywords":"Broadcasting (networking); Computer science; Node (physics); Computer network; Focus (optics); Wireless ad hoc network; Network topology; Radio networks; Upper and lower bounds; Distributed computing; Topology (electrical circuits); Wireless network; Telecommunications; Wireless; Mathematics; Combinatorics","score_opus":0.04961796621044182,"score_gpt":0.2585936795697521,"score_spread":0.20897571335931028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995554557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047518555,0.0026677558,0.9719701,0.0006164755,0.00077267207,0.00024718078,4.872414e-7,0.00035845433,0.018615011],"genre_scores_gemma":[0.9921687,0.0010316448,0.0036353855,0.0007788099,0.000245228,0.000022500073,0.0000025612374,0.000011876266,0.0021032407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890417,0.000121030855,0.00021414882,0.00028586216,0.00013786131,0.00033694215],"domain_scores_gemma":[0.9987213,0.0002509202,0.00008059159,0.00076781487,0.000058019385,0.00012132523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018087203,0.00013449808,0.00014286372,0.0000434084,0.0004361391,0.00016501977,0.00090592867,0.000062162275,0.0002773052],"category_scores_gemma":[0.000047843914,0.0001335525,0.000053994318,0.0003999151,0.0000495492,0.00018814256,0.00057121186,0.00022100606,0.00023359295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002509434,0.000044114215,0.0007710766,0.0000039376628,0.00001023818,0.000025425858,0.0005393076,0.009658021,0.00005918477,0.0054850206,0.02258658,0.9608146],"study_design_scores_gemma":[0.00021312489,0.000018178825,0.00072902767,0.000039378785,0.0000026962903,0.00003679717,0.0000022804275,0.968635,0.000022809341,0.000018910849,0.03012069,0.00016109797],"about_ca_topic_score_codex":6.2745795e-7,"about_ca_topic_score_gemma":0.000013154084,"teacher_disagreement_score":0.9874169,"about_ca_system_score_codex":0.000087886954,"about_ca_system_score_gemma":0.000007175176,"threshold_uncertainty_score":0.54461133},"labels":[],"label_agreement":null},{"id":"W2004151710","doi":"10.1002/net.20090","title":"Distributed delay constrained multicast routing algorithm with efficient fault recovery","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Inter-domain; IP multicast; Algorithm; Reliable multicast; Tree (set theory); Mathematics","score_opus":0.005435958961519562,"score_gpt":0.2012463873339291,"score_spread":0.19581042837240956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004151710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043729064,0.0002429479,0.99259657,0.000977979,0.00038574505,0.0002517393,0.000009299242,0.00044099713,0.0007218041],"genre_scores_gemma":[0.9155668,0.000012311382,0.08301674,0.000585953,0.00063349603,0.000025663921,0.000024170598,0.000015300475,0.00011953375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815434,0.0000850736,0.00032665057,0.00051282835,0.00029633116,0.00062477094],"domain_scores_gemma":[0.99880576,0.00026094267,0.00014032154,0.00045870658,0.00012761861,0.00020662438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031679406,0.00024284291,0.00025109894,0.00004600264,0.0002377231,0.00021959888,0.00051777327,0.00012958956,0.000025355768],"category_scores_gemma":[0.000020328487,0.00020037487,0.000082037164,0.00046402702,0.00009828324,0.0001922305,0.000104041705,0.00034086406,0.000045109995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011978596,0.000041913376,0.00003511202,5.6675117e-7,0.000022020005,0.000021617952,0.000040517483,0.47493923,0.0000010138358,0.001499857,0.0004255704,0.5229606],"study_design_scores_gemma":[0.0011549152,0.00009817115,0.0002515612,0.000047216363,0.00001911173,0.00008706629,0.000017439936,0.993639,0.000006453784,0.000011646307,0.0043936884,0.00027374484],"about_ca_topic_score_codex":0.000008864007,"about_ca_topic_score_gemma":0.000022587255,"teacher_disagreement_score":0.9111939,"about_ca_system_score_codex":0.00008439165,"about_ca_system_score_gemma":0.0000689291,"threshold_uncertainty_score":0.817105},"labels":[],"label_agreement":null},{"id":"W2006429817","doi":"10.1002/net.21490","title":"Shortest paths avoiding forbidden subpaths","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Distance; K shortest path routing; Combinatorics; Yen's algorithm; Longest path problem; Euclidean shortest path; Constrained Shortest Path First; Shortest Path Faster Algorithm; Widest path problem; Path (computing); Mathematics; Discrete mathematics; Computer science; Graph; Dijkstra's algorithm; Computer network","score_opus":0.01678287490000113,"score_gpt":0.25743815220359384,"score_spread":0.2406552773035927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006429817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021877944,0.00045441752,0.96829575,0.00034029063,0.0004162272,0.0003220344,4.0671156e-7,0.00029533711,0.007997589],"genre_scores_gemma":[0.98730195,0.00004902228,0.011325211,0.00031498313,0.00024179711,0.00008080267,0.0000022666618,0.0000190765,0.00066489144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998348,0.00013886376,0.00018687539,0.00040596048,0.00027704728,0.0006432808],"domain_scores_gemma":[0.99853045,0.0003603973,0.000049537288,0.0007583859,0.00011163125,0.00018962474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049311615,0.00014479685,0.0001499784,0.00009240596,0.00025233807,0.00024189513,0.0011851587,0.00009538067,0.0001192053],"category_scores_gemma":[0.00007421996,0.00013119155,0.00007104585,0.0005578495,0.00007155532,0.0008339493,0.00044849652,0.0004701162,0.00038852883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008755026,0.00010111686,0.012449036,0.000011363985,0.000039642346,0.00007621104,0.0006438776,0.013303406,0.0011778978,0.38078842,0.01889661,0.5725037],"study_design_scores_gemma":[0.00026874195,0.00010668471,0.005939898,0.000032995824,0.0000030751196,0.000029634544,0.00006401827,0.85908365,0.0003122677,0.13005823,0.0037310931,0.00036969545],"about_ca_topic_score_codex":0.00002118389,"about_ca_topic_score_gemma":0.000008428412,"teacher_disagreement_score":0.965424,"about_ca_system_score_codex":0.000036799727,"about_ca_system_score_gemma":0.000025344938,"threshold_uncertainty_score":0.53498363},"labels":[],"label_agreement":null},{"id":"W2016083649","doi":"10.1002/net.20456","title":"Progressive hedging‐based metaheuristics for stochastic network design","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; École de Technologie Supérieure; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematical optimization; Stochastic programming; Computer science; Metaheuristic; Network planning and design; Decomposition; Mathematics","score_opus":0.07614022353364325,"score_gpt":0.3012108241517992,"score_spread":0.22507060061815592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016083649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010361351,0.00032992635,0.9969143,0.00005624566,0.0005612957,0.00054353476,0.0000032411347,0.00016266895,0.0013251662],"genre_scores_gemma":[0.79600567,0.000006328581,0.20270461,0.00017960985,0.0006697875,0.00012788356,0.000050136598,0.00001969167,0.00023631078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990758,0.00010859859,0.00016345608,0.00016582459,0.00014532343,0.00034101488],"domain_scores_gemma":[0.99920297,0.0003329987,0.000120574216,0.000093415765,0.00015277216,0.000097271506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695075,0.00009060854,0.00011948587,0.00002826585,0.0004850014,0.000037747475,0.00012914292,0.00011694245,0.00009479132],"category_scores_gemma":[0.00011079677,0.00009066812,0.00005274866,0.0002293013,0.00010673997,0.000071114155,0.0000025540346,0.000085324275,0.000004154187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007975488,0.000025883752,0.00041409073,0.000003394452,0.000016096128,0.000003118927,0.0018825354,0.9834802,6.283925e-8,0.008389538,0.0037345777,0.0019707426],"study_design_scores_gemma":[0.0006170698,0.00014337542,0.0014965287,0.00008142537,0.00016532147,3.7621143e-7,0.0003355333,0.9887206,0.0000047014673,0.00408266,0.004055074,0.00029732613],"about_ca_topic_score_codex":0.00003832684,"about_ca_topic_score_gemma":0.000043776996,"teacher_disagreement_score":0.795902,"about_ca_system_score_codex":0.0000207615,"about_ca_system_score_gemma":0.00011256436,"threshold_uncertainty_score":0.37302876},"labels":[],"label_agreement":null},{"id":"W2016722709","doi":"10.1002/net.1033","title":"Minimum linear gossip graphs and maximal linear (Δ, <i>k</i>)‐gossip graphs","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gossip; Combinatorics; Graph; Mathematics; Discrete mathematics; Computer science; Node (physics)","score_opus":0.0185127435136274,"score_gpt":0.23728207396649753,"score_spread":0.21876933045287014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016722709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04030539,0.0034200451,0.9352983,0.0008565271,0.0020719804,0.000396662,0.000007416961,0.000677031,0.016966633],"genre_scores_gemma":[0.9722959,0.0019643782,0.020506183,0.0025684568,0.00090193475,0.0000289058,0.000032853088,0.000056000925,0.0016454358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663997,0.00013314481,0.00063557515,0.0009940236,0.0004929566,0.001104305],"domain_scores_gemma":[0.99772453,0.00026445813,0.00022399325,0.0010370095,0.00014287558,0.0006071534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000570017,0.00049480953,0.0005371842,0.00018533338,0.00046289287,0.0003038789,0.0010201946,0.0004321714,0.00007055434],"category_scores_gemma":[0.000009362077,0.00045644803,0.00021645773,0.0010925119,0.00031147472,0.00051114464,0.0004611136,0.0007266313,0.000059811588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003465671,0.0005351576,0.024061175,0.00005627138,0.0002385001,0.0020797057,0.0008221618,0.005982977,0.000049391034,0.06059063,0.0747964,0.83044106],"study_design_scores_gemma":[0.0009452986,0.00022240619,0.001386863,0.00006899839,0.00003841683,0.00031481407,0.00002496682,0.95461094,0.0000063652146,0.00975587,0.032026708,0.0005983773],"about_ca_topic_score_codex":0.000037463895,"about_ca_topic_score_gemma":0.000019438377,"teacher_disagreement_score":0.94862795,"about_ca_system_score_codex":0.000023481889,"about_ca_system_score_gemma":0.00008920419,"threshold_uncertainty_score":0.9997887},"labels":[],"label_agreement":null},{"id":"W2017571998","doi":"10.1002/net.10062","title":"An improved algorithm for the minmax regret median problem on a tree","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Minimax; Tree (set theory); Node (physics); Mathematical optimization; Mathematics; Algorithm; Function (biology); Interval (graph theory); Computer science; Combinatorics; Statistics","score_opus":0.019361797807546342,"score_gpt":0.2328850661918709,"score_spread":0.21352326838432456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017571998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023871097,0.0004996809,0.8811578,0.012024081,0.0055452045,0.0049681324,0.000010210045,0.0005875255,0.09282024],"genre_scores_gemma":[0.9531609,0.00012048361,0.012027367,0.019927895,0.0052928743,0.0013053304,0.00029216547,0.000111559515,0.0077614225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989976,0.000014660869,0.00022064458,0.0002881047,0.00015376063,0.00032517457],"domain_scores_gemma":[0.9993726,0.000037302103,0.000060831422,0.0004137539,0.00009734237,0.000018197843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062154775,0.00016036927,0.00011900747,0.00006845911,0.00028257366,0.00017247554,0.00027494374,0.00006955156,0.00026219123],"category_scores_gemma":[0.000041618645,0.00011374961,0.000079576865,0.00029460917,0.0000349521,0.0002983637,0.000025856334,0.0001141907,0.00007068933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031645908,0.0001584682,0.00015588006,0.000047383666,0.000051900846,8.257062e-7,0.00005887133,0.01284412,0.0000060011107,0.026566215,0.07050837,0.8895703],"study_design_scores_gemma":[0.00034557085,0.000024162053,0.00027924005,0.00000797445,0.000031176936,9.900384e-8,0.00014319074,0.6400069,0.0000026641867,0.0009526639,0.35808682,0.000119513876],"about_ca_topic_score_codex":0.00025796142,"about_ca_topic_score_gemma":0.0012597378,"teacher_disagreement_score":0.9507738,"about_ca_system_score_codex":0.000021388067,"about_ca_system_score_gemma":0.000010023452,"threshold_uncertainty_score":0.46385744},"labels":[],"label_agreement":null},{"id":"W2026533796","doi":"10.1002/net.21529","title":"Incomplete service and split deliveries in a routing problem with profits","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Orienteering; Heuristics; Computer science; Vehicle routing problem; Mathematical optimization; Operations research; Profit (economics); Constraint (computer-aided design); Service (business); Routing (electronic design automation); Mathematics; Business; Computer network; Economics; Microeconomics; Marketing","score_opus":0.008552179507714286,"score_gpt":0.19779935634048604,"score_spread":0.18924717683277176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026533796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7698603,0.00026351397,0.22447094,0.00018975527,0.00005755233,0.0006070136,7.689151e-7,0.000421736,0.004128364],"genre_scores_gemma":[0.8154967,0.000018097966,0.18422008,0.000105158775,0.00004832942,0.00005328382,0.0000034834673,0.00003226602,0.000022607663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993257,0.00004072884,0.00016752668,0.00014240839,0.00007021147,0.00025344186],"domain_scores_gemma":[0.9996916,0.000060956067,0.000027709491,0.00011362689,0.000055094504,0.000051028324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017581414,0.00012006572,0.00013736548,0.000041921743,0.000043124175,0.00006924028,0.000070252936,0.00007162486,0.000023645582],"category_scores_gemma":[0.0000074037284,0.00011009814,0.000006926384,0.00033908055,0.000016541644,0.00018766648,0.000043459255,0.00018918213,0.0000070801875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034891307,0.0000029951889,0.025761148,0.000050954393,0.000008737367,0.0000014552737,0.00046726392,0.95964843,0.00004412086,0.00015822133,0.000048684007,0.013804511],"study_design_scores_gemma":[0.00026314656,0.000013976181,0.02581567,0.00011775147,0.000004300911,0.0000076167685,0.000072430375,0.97339064,0.00001730636,0.000052448144,0.000104245795,0.00014049074],"about_ca_topic_score_codex":0.00013132395,"about_ca_topic_score_gemma":0.00011437823,"teacher_disagreement_score":0.04563634,"about_ca_system_score_codex":0.00002844616,"about_ca_system_score_gemma":0.0000060874586,"threshold_uncertainty_score":0.4489672},"labels":[],"label_agreement":null},{"id":"W2029341065","doi":"10.1002/net.20033","title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":665,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Shortest path problem; Path (computing); Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Computation; K shortest path routing; Longest path problem; Constrained Shortest Path First; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.008733564536156346,"score_gpt":0.2388332489582275,"score_spread":0.23009968442207115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029341065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031012108,0.000113897906,0.99411255,0.00023028681,0.00005529507,0.0016994231,0.000014515074,0.0005013429,0.00017149192],"genre_scores_gemma":[0.5673158,0.000011822864,0.4312564,0.00036029602,0.0004087675,0.0004814431,0.00007564282,0.000082658116,0.000007154552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986975,0.000044279586,0.0003120204,0.00031594848,0.00017594716,0.00045431405],"domain_scores_gemma":[0.9992006,0.00014848394,0.00007014357,0.00038781212,0.00006421468,0.00012877995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007728843,0.00020618246,0.00016828207,0.00004077988,0.00024311073,0.00009913483,0.00026515246,0.000094842384,0.000006740194],"category_scores_gemma":[0.00000908758,0.00016512132,0.000036328238,0.00032877582,0.000053748394,0.00018572954,0.000026368656,0.00024341856,0.000002891615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044991325,0.000020916417,0.00021764223,0.0000072206144,0.00002596023,4.9482964e-7,0.00023629954,0.7256218,0.00018961001,0.00023949209,0.0000664521,0.27336958],"study_design_scores_gemma":[0.0006201129,0.00014818029,0.00037730075,0.0000797341,0.000035418307,0.000007515926,0.00023156636,0.9965013,0.0002178151,0.00014558963,0.0013892818,0.00024617795],"about_ca_topic_score_codex":0.000027513592,"about_ca_topic_score_gemma":0.000019948118,"teacher_disagreement_score":0.5642146,"about_ca_system_score_codex":0.00014279502,"about_ca_system_score_gemma":0.000026037917,"threshold_uncertainty_score":0.6733452},"labels":[],"label_agreement":null},{"id":"W2031669620","doi":"10.1002/net.21605","title":"A railroad maintenance problem solved with a cut and column generation matheuristic","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Integer programming; Arc routing; Computer science; Scheduling (production processes); Mathematical optimization; Routing (electronic design automation); Schedule; Vehicle routing problem; Heuristic; Graph; Operations research; Artificial intelligence; Algorithm; Mathematics; Theoretical computer science","score_opus":0.021355889310019804,"score_gpt":0.2254491847852068,"score_spread":0.204093295475187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031669620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024341771,0.0003069906,0.9720702,0.000045727826,0.00013126554,0.00020686814,0.0000010043757,0.00028988402,0.0026062545],"genre_scores_gemma":[0.7016188,0.000052169416,0.29755908,0.00006568233,0.00023621494,0.000040371815,0.000011329347,0.000047026417,0.00036935642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993942,0.000042232085,0.00013242855,0.00013866033,0.00009303092,0.00019946629],"domain_scores_gemma":[0.9996439,0.000027912522,0.00003076196,0.00013073871,0.00006952323,0.00009712054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029347275,0.00010574085,0.0001216068,0.000024832092,0.000040604336,0.000063793,0.000051152263,0.0000705099,0.0000056611825],"category_scores_gemma":[0.000026368662,0.000096485295,0.00000993572,0.00014821778,0.00002849252,0.00007609993,0.000016492324,0.00012652756,0.0000040777613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008885131,0.0000048745674,0.0005746852,0.000011347892,0.000012544528,0.000003914269,0.00017191166,0.988535,0.00004916084,0.0001869216,0.0045943214,0.005846419],"study_design_scores_gemma":[0.00048286238,0.00003843098,0.000175518,0.00003393426,0.000013277602,0.000022510843,0.000019727024,0.9976063,0.00002824454,0.00008439265,0.0013653287,0.00012949147],"about_ca_topic_score_codex":0.000006753781,"about_ca_topic_score_gemma":0.000035568155,"teacher_disagreement_score":0.677277,"about_ca_system_score_codex":0.00004358446,"about_ca_system_score_gemma":0.000017131182,"threshold_uncertainty_score":0.39345562},"labels":[],"label_agreement":null},{"id":"W2031698396","doi":"10.1002/net.20095","title":"Black hole search in common interconnection networks","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Hypercube; Star (game theory); Interconnection; Polygon mesh; Black hole (networking); Topology (electrical circuits); TRACE (psycholinguistics); Chordal graph; Network topology; Torus; Host (biology); Routing (electronic design automation); Theoretical computer science; Combinatorics; Computer network; Mathematics; Parallel computing; Routing protocol; Graph","score_opus":0.0211345147778055,"score_gpt":0.2741044860498077,"score_spread":0.2529699712720022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031698396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01100349,0.00016769137,0.98017746,0.0018659671,0.00026412273,0.00020812386,1.4327094e-7,0.00016007721,0.0061529367],"genre_scores_gemma":[0.99028945,0.00018437079,0.00764384,0.000986904,0.00032148155,0.000012190445,0.0000069039,0.000011484822,0.00054339913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864143,0.00017553594,0.00025485066,0.0003067177,0.00018537452,0.00043609398],"domain_scores_gemma":[0.9993265,0.00009214099,0.000037325066,0.00037812928,0.00005452598,0.00011137951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061622955,0.0001110375,0.00014508418,0.00013354767,0.00008019337,0.00019777195,0.0005546259,0.0001265669,0.000069606045],"category_scores_gemma":[0.0000074290615,0.00011084736,0.000042538457,0.0006935485,0.00005071003,0.00051985634,0.00024044243,0.00048620984,0.00008378975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051588413,0.000044942026,0.0012162788,0.0000017289402,0.0000029317387,0.000002391199,0.00031850554,0.89457697,0.0000020095363,0.0049827984,0.002370837,0.09647543],"study_design_scores_gemma":[0.00034435568,0.000049529666,0.001234119,0.000028025255,7.231311e-7,0.0000021572066,0.000022100015,0.9940071,0.0000143829575,0.00014895272,0.0040278262,0.0001207435],"about_ca_topic_score_codex":0.000042553984,"about_ca_topic_score_gemma":0.0004000237,"teacher_disagreement_score":0.97928596,"about_ca_system_score_codex":0.00009145994,"about_ca_system_score_gemma":0.00002230632,"threshold_uncertainty_score":0.4520224},"labels":[],"label_agreement":null},{"id":"W2038039225","doi":"10.1002/net.20383","title":"Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Heuristics; Computer science; Flow network; Mathematical optimization; Integer programming; Digraph; Cutting-plane method; Mathematics; Algorithm","score_opus":0.00464616798209775,"score_gpt":0.20868945803766262,"score_spread":0.20404329005556487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038039225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.582849,0.000112407375,0.41650164,0.000012786758,0.000034909728,0.00010627383,0.0000010762561,0.0002548183,0.00012705543],"genre_scores_gemma":[0.6650079,0.000024576544,0.33483785,0.000013859198,0.000058997368,0.00000774284,0.000011845206,0.000028751952,0.000008455158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.000014359018,0.00014669573,0.00016679685,0.00007486007,0.0001851256],"domain_scores_gemma":[0.9997367,0.000033745095,0.000021662026,0.000095518386,0.000039773782,0.00007259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019786607,0.00012737821,0.0001295051,0.00004301636,0.000082302744,0.000070475944,0.00004625709,0.0001220696,0.000011544407],"category_scores_gemma":[0.000002421294,0.00012030536,0.000010429605,0.00011487287,0.000020301428,0.0002010221,0.0000061826195,0.00027415823,7.581636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010116384,0.0000034553493,0.0025253966,0.000056586483,0.000015223476,8.245321e-7,0.00042158784,0.9883713,0.0018832147,0.000046510366,7.4184726e-7,0.006665011],"study_design_scores_gemma":[0.00039815504,0.000012498796,0.0014564261,0.00006756106,0.000022720133,0.0000052483642,0.000027695236,0.9977143,0.00010253749,0.00003558272,0.000008161482,0.00014911589],"about_ca_topic_score_codex":0.000028928984,"about_ca_topic_score_gemma":0.00011472727,"teacher_disagreement_score":0.08215888,"about_ca_system_score_codex":0.0000052890305,"about_ca_system_score_gemma":0.0000056744766,"threshold_uncertainty_score":0.49059102},"labels":[],"label_agreement":null},{"id":"W2039700046","doi":"10.1002/net.21530","title":"Nonexistence of optimal graphs for all terminal reliability","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Undirected graph; Discrete mathematics; Multigraph","score_opus":0.007172499954143852,"score_gpt":0.2076871176198089,"score_spread":0.20051461766566506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039700046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27047256,0.00017320453,0.7246509,0.000089861016,0.00052133505,0.00083873846,0.0000064054425,0.00017953417,0.0030674434],"genre_scores_gemma":[0.96394217,0.00009802569,0.035673074,0.00003200211,0.000051628667,0.00011613654,0.0000144989435,0.000014976684,0.00005746785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993753,0.000009487645,0.00021678723,0.00012944709,0.000061028113,0.0002079461],"domain_scores_gemma":[0.99953705,0.000072446775,0.00003144393,0.00021933566,0.00009405476,0.00004566213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014327929,0.00008956087,0.00014044653,0.000021100928,0.000020744064,0.000013774905,0.00010797747,0.000097927244,0.0000457376],"category_scores_gemma":[0.00003593383,0.00008265305,0.00007366036,0.00008357233,0.000060504513,0.00012482452,0.000013866178,0.00008909134,0.0000045119805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102727845,0.00001669197,0.00026480644,0.000070026676,0.00000820681,1.4554257e-7,0.000058140035,0.9911445,0.00012398709,0.0006005821,0.0031783844,0.0045242663],"study_design_scores_gemma":[0.00016488548,0.000057143774,0.0014349275,0.000024517882,0.000010612409,0.0000014978359,0.00001993292,0.99556667,0.00017610902,0.0012926459,0.0011549621,0.00009609581],"about_ca_topic_score_codex":0.00001933425,"about_ca_topic_score_gemma":0.0000024130698,"teacher_disagreement_score":0.69346964,"about_ca_system_score_codex":0.00002144178,"about_ca_system_score_gemma":0.0000053040826,"threshold_uncertainty_score":0.33704937},"labels":[],"label_agreement":null},{"id":"W2047226187","doi":"10.1002/net.21525","title":"Solving the close‐enough arc routing problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Arc routing; Computer science; Routing (electronic design automation); Arc (geometry); Mathematical optimization; Mathematics; Computer network","score_opus":0.010267781984480634,"score_gpt":0.22271240807114842,"score_spread":0.21244462608666778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047226187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022603981,0.0006174801,0.9312925,0.0005671347,0.00069796725,0.00054309785,5.211692e-7,0.0011295477,0.042547815],"genre_scores_gemma":[0.9007443,0.000050464016,0.09804305,0.00018983307,0.0005572788,0.000053813783,0.0000035397213,0.000061662504,0.00029605645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896586,0.00008463229,0.00025087726,0.00015256256,0.0001256358,0.00042045474],"domain_scores_gemma":[0.99932104,0.00022632512,0.00004450372,0.00029805268,0.000051390012,0.000058678914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048784402,0.00014569299,0.00013140666,0.000024882635,0.00018259289,0.00014865688,0.00023432785,0.00010876558,0.0001751158],"category_scores_gemma":[0.000046356552,0.00011335603,0.00005001235,0.00026049127,0.000028615,0.00015575174,0.000062024534,0.0003887114,0.0000824768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.769687e-7,0.0000032841901,0.00065981335,0.000008184337,0.000016313465,5.054964e-7,0.0002793224,0.9410161,0.00009425016,0.00073885545,0.0039458135,0.053237185],"study_design_scores_gemma":[0.000099170225,0.000005855019,0.0012617311,0.00003652665,0.000008718599,0.000004873366,0.00005766189,0.995132,0.00006456494,0.0003745863,0.002809799,0.00014447724],"about_ca_topic_score_codex":0.000033322984,"about_ca_topic_score_gemma":0.0000048129095,"teacher_disagreement_score":0.87814033,"about_ca_system_score_codex":0.000044395016,"about_ca_system_score_gemma":0.000007629469,"threshold_uncertainty_score":0.46225247},"labels":[],"label_agreement":null},{"id":"W2052058646","doi":"10.1002/net.21503","title":"Analysis of an exact algorithm for the vessel speed optimization problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Maritime Transport Emissions and Efficiency","field":"Environmental Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Port (circuit theory); Quadratic equation; Mathematical optimization; Computer science; Sequence (biology); Function (biology); Regular polygon; Window (computing); Algorithm; Convex function; Optimization problem; Mathematics; Engineering; Electrical engineering","score_opus":0.006801423789339931,"score_gpt":0.21482276912069254,"score_spread":0.2080213453313526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052058646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014461178,0.00003639949,0.9813462,0.00009640583,0.000038281352,0.00044854067,0.000005492278,0.000020179494,0.003547356],"genre_scores_gemma":[0.90586597,0.000059625934,0.09269649,0.00012083517,0.00006263403,0.000053617063,0.00011609968,0.000014781269,0.0010099416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993815,0.000015234489,0.00016158145,0.00015828431,0.00012200833,0.00016141495],"domain_scores_gemma":[0.9996003,0.000057452395,0.00006123702,0.00020994527,0.000012915336,0.000058175177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001923458,0.00006754129,0.000111386886,0.000024096082,0.0001179029,0.000020428264,0.00018064445,0.00004971871,0.0084169],"category_scores_gemma":[0.0000026907078,0.000043491582,0.00007232298,0.0005330379,0.000066342414,0.00012589394,0.000019571775,0.0000491256,0.000005186644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015114963,0.00004622849,0.0020138863,8.604363e-7,0.000027378088,8.236224e-8,0.00003828203,0.85495466,0.000020484043,0.0000047757912,0.0005557846,0.14233604],"study_design_scores_gemma":[0.000085986605,0.00003277587,0.02573419,0.0000023124874,0.00016403031,1.7832004e-7,0.000025684576,0.97300917,0.000010685938,0.000021242726,0.00085497665,0.000058752823],"about_ca_topic_score_codex":0.00069252,"about_ca_topic_score_gemma":0.000026708125,"teacher_disagreement_score":0.8914048,"about_ca_system_score_codex":0.000014134218,"about_ca_system_score_gemma":0.0000030722576,"threshold_uncertainty_score":0.9924895},"labels":[],"label_agreement":null},{"id":"W2053173245","doi":"10.1002/net.21531","title":"Minisum multipurpose trip location problem on trees","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Facility location problem; Type (biology); Computer science; Node (physics); Type of service; Service (business); Tree (set theory); Mathematical optimization; Flow network; Transportation theory; 1-center problem; Fixed cost; Operations research; Mathematics; Combinatorics; Engineering; Business","score_opus":0.017969521395963566,"score_gpt":0.20929971246062465,"score_spread":0.1913301910646611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053173245","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34795466,0.00095681124,0.07526094,0.032017663,0.006838154,0.00820828,0.0000031795346,0.0023777012,0.5263826],"genre_scores_gemma":[0.9909881,0.000026663867,0.00021925727,0.0036694661,0.0009312682,0.00020280742,0.00007084265,0.000018997445,0.0038725976],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989566,0.000010919212,0.00027108644,0.00027714059,0.00020712476,0.00027713124],"domain_scores_gemma":[0.99938667,0.000019316387,0.00006624086,0.00029303913,0.00021841426,0.000016312199],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020299606,0.00016045198,0.00012263529,0.00013429062,0.0001458158,0.00021733202,0.00019946382,0.00008012654,0.0013103358],"category_scores_gemma":[0.000056163193,0.00014385997,0.00004545989,0.00057181926,0.000028084076,0.00062228285,0.00006940902,0.00012080567,0.0042265295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005805683,0.00049845636,0.0062742936,0.00030328476,0.000056935078,0.0000018850499,0.00009797146,0.2800055,0.000034561985,0.02054416,0.4700326,0.22209229],"study_design_scores_gemma":[0.00074019656,0.000026323134,0.050458353,0.000076858996,0.000034104545,1.5493312e-7,0.000195937,0.6309195,0.0000073793453,0.0010561718,0.3161045,0.00038052452],"about_ca_topic_score_codex":0.0011669609,"about_ca_topic_score_gemma":0.0007353209,"teacher_disagreement_score":0.64303344,"about_ca_system_score_codex":0.000026470687,"about_ca_system_score_gemma":0.000007741017,"threshold_uncertainty_score":0.9996026},"labels":[],"label_agreement":null},{"id":"W2055572845","doi":"10.1002/net.20450","title":"Proximity and remoteness in graphs: Results and conjectures","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Independence number; Vertex (graph theory); Upper and lower bounds; Matching (statistics); Graph; Order (exchange); Connectivity; Discrete mathematics; Statistics","score_opus":0.02974784007176186,"score_gpt":0.25870406774043736,"score_spread":0.2289562276686755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055572845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48515818,0.003957849,0.4998972,0.00044054454,0.00033926583,0.0007468903,0.00000278166,0.00024073037,0.009216543],"genre_scores_gemma":[0.9856488,0.00021962986,0.0139249815,0.0001400017,0.00001810624,0.0000064418123,5.5497867e-7,0.0000056235936,0.000035865203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990091,0.00011743993,0.00013662466,0.00035965702,0.000104311795,0.00027288572],"domain_scores_gemma":[0.9993749,0.00013235472,0.000036785703,0.00033744806,0.000033079163,0.00008539108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476533,0.00009178846,0.00011782983,0.00010521847,0.00006732104,0.00004415947,0.00030397635,0.000075591066,0.0000012404156],"category_scores_gemma":[0.000059317757,0.000077708,0.00001308514,0.00036745783,0.00016895686,0.00029924678,0.0002631035,0.00022831808,5.876374e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006653921,0.000115398834,0.029105855,0.00004212705,0.00002635872,0.00021407717,0.005155494,0.00069379946,0.00009313249,0.4755127,0.00049784424,0.48787782],"study_design_scores_gemma":[0.0016895345,0.00023105554,0.21237786,0.00007458949,0.0000032233033,0.000067489724,0.000049815375,0.11448323,0.0003788852,0.6696896,0.00059290876,0.00036184164],"about_ca_topic_score_codex":0.000045260673,"about_ca_topic_score_gemma":0.000099693956,"teacher_disagreement_score":0.5004906,"about_ca_system_score_codex":0.000006716029,"about_ca_system_score_gemma":0.000011096795,"threshold_uncertainty_score":0.316884},"labels":[],"label_agreement":null},{"id":"W2055943982","doi":"10.1002/net.10094","title":"Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Node (physics); Clique; Computer network; Advice (programming); Bounded function; Theoretical computer science; Pointer (user interface); Mathematics; Artificial intelligence","score_opus":0.007708517376898164,"score_gpt":0.21699970336270394,"score_spread":0.20929118598580576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055943982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084641185,0.000065644614,0.98912966,0.00023650817,0.000112743146,0.00029978695,9.685823e-7,0.000051875322,0.0016387139],"genre_scores_gemma":[0.9941987,0.000011327679,0.0053400956,0.00037364484,0.000016965794,0.000022609407,0.00001858698,0.0000043034847,0.000013766833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989232,0.00022398922,0.00033892866,0.00013344771,0.00011396703,0.00026650942],"domain_scores_gemma":[0.99901605,0.00019558077,0.00016416395,0.00035270653,0.00020341377,0.00006808224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074938557,0.00010202023,0.00012633057,0.00007434452,0.00010589963,0.00011078803,0.00032815995,0.000067848945,0.000017768454],"category_scores_gemma":[0.0001494861,0.00006876114,0.00002395384,0.0011453081,0.000062738705,0.0005615113,0.00007048803,0.00026786645,0.00000208672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009103344,0.000015839305,0.00017795373,0.0000069895677,0.000006578965,0.000023057435,0.0006745984,0.97335774,4.3567195e-7,0.009801008,0.0003176603,0.0156090455],"study_design_scores_gemma":[0.00047962458,0.00006337271,0.00009136444,0.000041918283,0.000002558326,0.00013413004,0.00047297665,0.99824995,0.000008942216,0.0001051468,0.00026192833,0.00008810705],"about_ca_topic_score_codex":0.00015810678,"about_ca_topic_score_gemma":0.00047128426,"teacher_disagreement_score":0.9857346,"about_ca_system_score_codex":0.000046936275,"about_ca_system_score_gemma":0.00009832165,"threshold_uncertainty_score":0.2803998},"labels":[],"label_agreement":null},{"id":"W2060798327","doi":"10.1002/net.20408","title":"Big segment small segment global optimization algorithm on networks","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; 1-center problem; Computer science; Cover (algebra); Mathematical optimization; Algorithm; Function (biology); Optimization problem; Mathematics","score_opus":0.01670503028694023,"score_gpt":0.21339814296546267,"score_spread":0.19669311267852244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060798327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050618853,0.00008169501,0.9510924,0.0015241235,0.008667227,0.0007069599,0.0000036152087,0.00041625256,0.03244582],"genre_scores_gemma":[0.94337493,0.00024349582,0.017615877,0.019911496,0.015207372,0.00026376502,0.0008993128,0.000103562495,0.002380191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821204,0.000015877009,0.00040854776,0.0005038641,0.000335139,0.0005245112],"domain_scores_gemma":[0.99915946,0.000013640108,0.00011561131,0.00051461504,0.00015281198,0.00004388428],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046511643,0.00030624156,0.00020754276,0.0001045829,0.00028800467,0.00031069448,0.00035171755,0.00018411706,0.00095085433],"category_scores_gemma":[0.00002613688,0.0002968634,0.00011501047,0.0006581175,0.000048468315,0.000250488,0.00022190598,0.00033674264,0.00030676898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019758156,0.0001376165,0.00088352535,0.000015712305,0.000028310686,0.000002992911,0.000004184659,0.770019,9.74797e-7,0.0043750214,0.0106328055,0.21388012],"study_design_scores_gemma":[0.000467737,0.000016731832,0.0027244466,0.000021408028,0.000044195887,5.442522e-7,0.000030851,0.92492855,0.0000011528375,0.0001263978,0.07133523,0.00030276302],"about_ca_topic_score_codex":0.00051363674,"about_ca_topic_score_gemma":0.0010924306,"teacher_disagreement_score":0.93831307,"about_ca_system_score_codex":0.000080432765,"about_ca_system_score_gemma":0.000013498786,"threshold_uncertainty_score":0.9999624},"labels":[],"label_agreement":null},{"id":"W2066008390","doi":"10.1002/net.10027","title":"Parallel NC‐algorithms for multifacility location problems with mutual communication and their applications","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Minimax; Computer science; Tree (set theory); Algorithm; Scheme (mathematics); Mathematical optimization; Parametric statistics; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.04057189479512446,"score_gpt":0.22103669907289286,"score_spread":0.1804648042777684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066008390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028426156,0.0010483476,0.98686516,0.0026281236,0.00007918429,0.0021314744,0.0000050256876,0.00022142907,0.0041786176],"genre_scores_gemma":[0.9934255,0.00018569423,0.003093019,0.0006837062,0.00026707453,0.0012534849,0.00025744265,0.000018051971,0.0008160522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991481,0.000011791679,0.00024256819,0.00029021804,0.0000993494,0.0002079813],"domain_scores_gemma":[0.999199,0.000033781656,0.000082477585,0.0004319704,0.00023635359,0.00001646669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029958694,0.00015623694,0.00013113608,0.00006780523,0.00036248247,0.00013190988,0.00019199273,0.0000625687,0.000104942555],"category_scores_gemma":[0.000016705135,0.0001285837,0.000030438705,0.00035429743,0.00008920834,0.0004814336,0.00007842803,0.000098684446,0.00006488273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009877719,0.0005687791,0.0059078718,0.0008736792,0.00014402215,1.612627e-7,0.0007491304,0.33346882,0.000010449862,0.03826085,0.026164653,0.5937528],"study_design_scores_gemma":[0.00047547606,0.000010618424,0.0021461248,0.000018981647,0.000021596667,2.6284573e-7,0.00018523101,0.81416905,6.265022e-7,0.0006481617,0.18216944,0.0001544159],"about_ca_topic_score_codex":0.00029956238,"about_ca_topic_score_gemma":0.00076883816,"teacher_disagreement_score":0.9905829,"about_ca_system_score_codex":0.00002323939,"about_ca_system_score_gemma":0.000003225368,"threshold_uncertainty_score":0.52434915},"labels":[],"label_agreement":null},{"id":"W2066613498","doi":"10.1002/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6","title":"Improved upper and lower bounds fork-broadcasting","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Brandon University","funders":"","keywords":"Upper and lower bounds; Vertex (graph theory); Broadcasting (networking); Graph; Combinatorics; Computer science; Mathematics; Computer network","score_opus":0.022723227146079272,"score_gpt":0.25938346006956736,"score_spread":0.2366602329234881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066613498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016535709,0.0029959115,0.9647681,0.0012310218,0.00053432037,0.00013505512,1.2534662e-7,0.00021114846,0.013588596],"genre_scores_gemma":[0.9865625,0.0018778491,0.009187267,0.0011524854,0.0002404689,0.000012780988,0.0000016952299,0.000010192685,0.00095475226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991191,0.00006305234,0.00016801369,0.0002685098,0.000084220155,0.00029711603],"domain_scores_gemma":[0.9991216,0.00011842331,0.00005405483,0.00053690845,0.00007233773,0.00009665941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026849995,0.00012054322,0.00011973154,0.000041887168,0.0003328621,0.00028589048,0.0005060719,0.000066757464,0.000040369025],"category_scores_gemma":[0.000027722517,0.00011176793,0.00003718732,0.00036276813,0.00004704927,0.000329833,0.0006974339,0.00022772368,0.000007623331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009331713,0.000030762632,0.0028331345,0.0000017887943,0.000012959137,0.0000071836075,0.00027345357,0.0004943299,0.00015474328,0.01779786,0.0023522833,0.9760322],"study_design_scores_gemma":[0.00025709314,0.00004761769,0.0020914534,0.000027903976,0.0000028833886,0.000029954319,0.000008290016,0.94189215,0.000009258606,0.0003245335,0.05514552,0.00016331913],"about_ca_topic_score_codex":0.0000033102783,"about_ca_topic_score_gemma":0.00002355208,"teacher_disagreement_score":0.9758689,"about_ca_system_score_codex":0.000023165669,"about_ca_system_score_gemma":0.000017756074,"threshold_uncertainty_score":0.4557764},"labels":[],"label_agreement":null},{"id":"W2066877252","doi":"10.1002/net.20076","title":"Reliable broadcasting in double loop networks","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Broadcasting (networking); Atomic broadcast; Construct (python library); Broadcast communication network; Broadcast domain; Computer network; Tree (set theory); Interconnection; Distributed computing; Tree network; Loop (graph theory); Port (circuit theory); Broadcast radiation; Mathematics; Algorithm; Time complexity","score_opus":0.016738661673204744,"score_gpt":0.23666142579852317,"score_spread":0.21992276412531842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066877252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007749066,0.0015442322,0.9594801,0.0005356762,0.0026224405,0.00026587423,1.1690519e-7,0.00031905374,0.02748343],"genre_scores_gemma":[0.98812634,0.00008262211,0.00475061,0.00088454294,0.0023066248,0.00003922377,0.0000025983375,0.000023477938,0.003783942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978701,0.00007196117,0.0005495002,0.00053478836,0.00021483278,0.000758843],"domain_scores_gemma":[0.99892324,0.000107135005,0.00014674259,0.0006131494,0.000079501784,0.000130201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289472,0.00021736781,0.0002917367,0.00012666029,0.00017177867,0.00030698034,0.0007569394,0.00023381454,0.000059018097],"category_scores_gemma":[0.000008591933,0.00021063157,0.000095977426,0.00086337415,0.000025658752,0.0006696463,0.00023007955,0.0005460853,0.0000828341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001545094,0.000035033285,0.0020683515,0.0000030881658,0.000007284184,0.000014339747,0.00008432033,0.93885636,0.000002247862,0.0115591455,0.013697865,0.033656526],"study_design_scores_gemma":[0.0006875704,0.000036543763,0.0003795026,0.00010252124,0.0000021743497,0.000040854575,0.000012406057,0.9541469,0.000011295181,0.000079613375,0.044265363,0.00023520374],"about_ca_topic_score_codex":0.00014204501,"about_ca_topic_score_gemma":0.0003847032,"teacher_disagreement_score":0.9803773,"about_ca_system_score_codex":0.00013375601,"about_ca_system_score_gemma":0.000029723013,"threshold_uncertainty_score":0.8589306},"labels":[],"label_agreement":null},{"id":"W2067136846","doi":"10.1002/net.20471","title":"Cutting planes for branch‐and‐price algorithms","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Algorithm; Computer science; Cutting-plane method; Mathematical optimization; Mathematics; Integer programming","score_opus":0.028313248287365478,"score_gpt":0.24163975919374486,"score_spread":0.21332651090637939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067136846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005077,0.0005308903,0.98820305,0.000007745218,0.00043319236,0.00012701115,0.000001953772,0.00037207996,0.005247101],"genre_scores_gemma":[0.47417343,0.00009919937,0.5249508,0.000077390185,0.00048247658,0.000030409583,0.000009097786,0.00005734147,0.00011983904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994718,0.00001771488,0.00013497326,0.00011423164,0.000042106098,0.0002191877],"domain_scores_gemma":[0.99966115,0.00013769722,0.00002274174,0.00010372683,0.000022488111,0.000052182117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002503724,0.00009287934,0.000108997345,0.000027738111,0.00006019205,0.00001795972,0.000070002134,0.000091994305,0.000026894171],"category_scores_gemma":[0.000029612811,0.00009778143,0.000023754792,0.00008910058,0.000013631084,0.000061300445,0.000016670952,0.00010366221,0.0000026974308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009695559,0.000008279873,0.003209676,0.000059874055,0.000041440322,0.0000016135668,0.00075619644,0.7653989,0.000048593633,0.00055004033,0.0010654823,0.2288502],"study_design_scores_gemma":[0.00019561268,0.000012783694,0.0015821625,0.000017917528,0.000010520115,0.00000656966,0.00001433517,0.9955596,0.0001931171,0.00017187999,0.0021143155,0.00012121177],"about_ca_topic_score_codex":0.0000043724503,"about_ca_topic_score_gemma":8.4245374e-7,"teacher_disagreement_score":0.46909642,"about_ca_system_score_codex":0.000010309472,"about_ca_system_score_gemma":0.0000026526454,"threshold_uncertainty_score":0.3987411},"labels":[],"label_agreement":null},{"id":"W2071941627","doi":"10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n","title":"Impact of topographic information on graph exploration efficiency","year":2000,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Graph; A priori and a posteriori; Computer science; Biconnected graph; Theoretical computer science; Strength of a graph; Knowledge graph; Combinatorics; Algorithm; Line graph; Artificial intelligence; Mathematics; Voltage graph; Geography","score_opus":0.013144953852214782,"score_gpt":0.2557916865583918,"score_spread":0.242646732706177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071941627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025882242,0.00002594144,0.96084034,0.00011404139,0.000087615095,0.00016862057,7.389932e-7,0.000093268085,0.012787165],"genre_scores_gemma":[0.99751693,0.00019338075,0.0020645796,0.00012579032,0.000022574419,0.000008453488,0.0000131834795,0.0000024169044,0.0000526675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993313,0.000043589665,0.00018755981,0.00009202863,0.00019230189,0.00015321057],"domain_scores_gemma":[0.99954337,0.000026939448,0.000057854046,0.0002460407,0.00007330083,0.00005247805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017547708,0.0000669471,0.000072567505,0.00015319188,0.00006643061,0.000080560436,0.0002538073,0.0000483667,0.00015310191],"category_scores_gemma":[0.0000070749156,0.00005423251,0.00007301579,0.0008391016,0.000023778106,0.0011323432,0.000016308113,0.00008975801,0.000035890367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008133295,0.00003685107,0.00033179676,0.0000015852579,0.0000041068165,1.4010779e-7,0.0002990592,0.86309606,0.0000016364203,0.005501406,0.00079817657,0.12992108],"study_design_scores_gemma":[0.00022943468,0.00034214254,0.0051717428,0.000013831546,0.000001013527,7.5561815e-7,0.0000041686926,0.9926738,0.0000099658655,0.0009961664,0.0004854059,0.00007157239],"about_ca_topic_score_codex":0.000016242358,"about_ca_topic_score_gemma":0.0000013036108,"teacher_disagreement_score":0.9716347,"about_ca_system_score_codex":0.00001302924,"about_ca_system_score_gemma":0.000024050945,"threshold_uncertainty_score":0.22115377},"labels":[],"label_agreement":null},{"id":"W2072442357","doi":"10.1002/net.21550","title":"A comparison of several models for the hamiltonian <i>p</i>‐median problem","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Median; Disjoint sets; Mathematics; Combinatorics; Hamiltonian (control theory); Linear programming; Benchmark (surveying); Hamiltonian path problem; Mathematical optimization; Graph; Computer science; Hamiltonian path; Discrete mathematics; Algorithm","score_opus":0.03947672229659012,"score_gpt":0.26368034098324594,"score_spread":0.22420361868665584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072442357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028940996,0.0001490706,0.9658123,0.004400599,0.0008703607,0.00085145957,0.0000014510463,0.00009541757,0.024925223],"genre_scores_gemma":[0.99606925,0.000009728746,0.0008112816,0.0017540156,0.00073900836,0.00008796131,0.000029166576,0.0000130737235,0.00048649174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915475,0.000008209425,0.0002900997,0.00016486217,0.00015737706,0.00022472935],"domain_scores_gemma":[0.99947876,0.00004716076,0.00008812272,0.00026307852,0.00011373756,0.000009146688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047498036,0.000108060485,0.00016425701,0.0000499028,0.0001670547,0.00006486601,0.00026881,0.000047352423,0.00006555666],"category_scores_gemma":[0.000022948172,0.00007989292,0.000082388,0.00021113375,0.000044652686,0.0002657987,0.00008262984,0.0000818826,0.000024861203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021966962,0.000050548293,0.0012001571,0.00010349641,0.00002239075,2.0507196e-8,0.000077557976,0.8726998,0.0000015572816,0.057787683,0.043442223,0.024592618],"study_design_scores_gemma":[0.00023380364,0.000007871613,0.0009852725,0.000013652971,0.000033807704,2.2278035e-8,0.00007989713,0.83255625,0.0000011158668,0.003936766,0.16206889,0.00008267094],"about_ca_topic_score_codex":0.00043742868,"about_ca_topic_score_gemma":0.0011622835,"teacher_disagreement_score":0.99317515,"about_ca_system_score_codex":0.000009061522,"about_ca_system_score_gemma":0.000005203736,"threshold_uncertainty_score":0.32579386},"labels":[],"label_agreement":null},{"id":"W2074413296","doi":"10.1002/net.21587","title":"Timing problems and algorithms: Time decisions for sequences of activities","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Concatenation (mathematics); Vehicle routing problem; Inference; Combinatorial optimization; Algorithm; Mathematical optimization; Routing (electronic design automation); Artificial intelligence; Mathematics","score_opus":0.06351391128462434,"score_gpt":0.2892708729540661,"score_spread":0.22575696166944176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074413296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022692302,0.00090562226,0.97518736,0.000018533721,0.00015396431,0.00015091545,0.000004923695,0.00012977365,0.000756631],"genre_scores_gemma":[0.36861485,0.000110341905,0.6308483,0.000014029021,0.00016296488,0.000031493,0.000008750154,0.000034979053,0.0001742776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953896,0.000026287084,0.00014292088,0.00008492677,0.00007389356,0.00013302642],"domain_scores_gemma":[0.99938256,0.00039769674,0.000032319567,0.00008610338,0.00004496848,0.00005633849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042337703,0.00007209419,0.00013927241,0.00003694257,0.000030426432,0.00001947136,0.000058139332,0.00006936606,0.000005729735],"category_scores_gemma":[0.000093445095,0.000070036425,0.000020199384,0.00009172564,0.000032849435,0.00009573996,0.000019477677,0.00006302635,7.892072e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023122914,0.0000028214188,0.00007939279,0.000010550718,0.000009947929,1.4543679e-7,0.0002799333,0.9589606,0.00023015359,0.000021354976,0.0006466542,0.039756153],"study_design_scores_gemma":[0.0001763871,0.00002831869,0.000024395606,0.000056132467,0.000010312781,0.0000029979885,0.0000623053,0.99797314,0.0004968798,0.00028812967,0.00080464274,0.000076382385],"about_ca_topic_score_codex":0.0000025507447,"about_ca_topic_score_gemma":0.000001031591,"teacher_disagreement_score":0.34592256,"about_ca_system_score_codex":0.00001815962,"about_ca_system_score_gemma":0.000011103411,"threshold_uncertainty_score":0.28560027},"labels":[],"label_agreement":null},{"id":"W2075240586","doi":"10.1002/net.21505","title":"Optimal edge‐coloring with edge rate constraints","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Time complexity; Mathematics; Discrete mathematics; Indifference graph; Pooling; Sequence (biology); Matching (statistics); Chordal graph; Pathwidth; Computer science; Graph; Line graph","score_opus":0.01747177441735967,"score_gpt":0.25795359369669935,"score_spread":0.24048181927933968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075240586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049639832,0.00012431921,0.9410361,0.0002475885,0.00026672913,0.00033486544,3.416346e-7,0.00019551512,0.008154732],"genre_scores_gemma":[0.9458643,0.00001642217,0.052993357,0.00021317774,0.00018832108,0.00008699101,0.0000012521156,0.000016932476,0.000619202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985254,0.000110321766,0.00014492971,0.00039940263,0.00019596964,0.00062399014],"domain_scores_gemma":[0.9988388,0.00022270627,0.000054719178,0.0005506049,0.00013764275,0.0001955525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035685868,0.00015157305,0.00015421606,0.00007484403,0.00016806173,0.00022335252,0.0008571767,0.00007027969,0.0001425847],"category_scores_gemma":[0.000022879685,0.00012167996,0.000037470014,0.000497209,0.00031516465,0.0006919837,0.00029954768,0.00036986236,0.00022423759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008035345,0.00012652647,0.003858483,0.000022039321,0.00011403012,0.00018592986,0.00056140573,0.2914138,0.0008369469,0.22476988,0.006316654,0.47171396],"study_design_scores_gemma":[0.0012782932,0.00042545176,0.007874878,0.00009819348,0.000007477408,0.000093316645,0.00009980063,0.9736472,0.0010614911,0.011320993,0.0034383093,0.0006545903],"about_ca_topic_score_codex":0.0000052525365,"about_ca_topic_score_gemma":0.0000024861363,"teacher_disagreement_score":0.8962245,"about_ca_system_score_codex":0.00003137388,"about_ca_system_score_gemma":0.000052639807,"threshold_uncertainty_score":0.49619648},"labels":[],"label_agreement":null},{"id":"W2078190972","doi":"10.1002/net.20451","title":"The preemptive swapping problem on a tree","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Canada Research Chairs","keywords":"Vertex (graph theory); Object (grammar); Computer science; Tree (set theory); Heuristic; Mathematical optimization; Combinatorics; Mathematics; Routing (electronic design automation); Type (biology); Graph; Computer network; Artificial intelligence","score_opus":0.025470249201273908,"score_gpt":0.22639831072444183,"score_spread":0.20092806152316792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078190972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028016372,0.00030188,0.69540185,0.0000330539,0.00046242165,0.000261906,4.6978855e-7,0.00061608,0.3001207],"genre_scores_gemma":[0.90938044,0.00014053311,0.08903843,0.00009251189,0.00031611387,0.00006763954,0.0000020913003,0.0000683027,0.00089391525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993812,0.000059334463,0.00013666946,0.000105445564,0.00007874237,0.00023863143],"domain_scores_gemma":[0.999551,0.00014829182,0.000026233693,0.00021081736,0.000023015997,0.000040653184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032436257,0.00009832941,0.00007769363,0.000021131076,0.00011808848,0.00002726972,0.00015216248,0.000073239295,0.00003328761],"category_scores_gemma":[0.000022326709,0.000073784686,0.00003331789,0.00015698356,0.000024949852,0.00004258022,0.000022035721,0.00022079797,0.00003095854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012734342,0.00000830071,0.00034505542,0.00000486122,0.000034405533,0.0000016319194,0.00075317675,0.8996783,0.0000121294925,0.0017734044,0.0024775048,0.09489853],"study_design_scores_gemma":[0.0001432056,0.000036131736,0.0023286003,0.000041204825,0.000008289625,0.0000017504384,0.00004160964,0.9932489,0.00018063924,0.00042078868,0.0034236857,0.00012521283],"about_ca_topic_score_codex":0.0000031994564,"about_ca_topic_score_gemma":0.00000927773,"teacher_disagreement_score":0.90657884,"about_ca_system_score_codex":0.000031536863,"about_ca_system_score_gemma":0.0000045986476,"threshold_uncertainty_score":0.3008852},"labels":[],"label_agreement":null},{"id":"W2082259377","doi":"10.1002/net.21590","title":"Formulations and exact solution approaches for the degree preserving spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Spanning tree; Degree (music); Minimum spanning tree; Mathematical optimization; Tree (set theory); Mathematics; Computer science; Minimum degree spanning tree; Distributed minimum spanning tree; Combinatorics","score_opus":0.22542077035339705,"score_gpt":0.3143817814222265,"score_spread":0.08896101106882945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082259377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008415818,0.0012433776,0.9941432,0.0008115461,0.00007794804,0.0005433283,4.964782e-7,0.000081655366,0.0022568733],"genre_scores_gemma":[0.86360824,0.000014427148,0.13571773,0.00003625269,0.0001677409,0.00016260272,0.0000030765088,0.000011400876,0.00027851746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.000063495914,0.00012029811,0.00023998531,0.0001729143,0.00033461166],"domain_scores_gemma":[0.9988685,0.0005061012,0.00005418465,0.00039869457,0.00008056139,0.00009192064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009528588,0.00008787967,0.00008330131,0.000047253514,0.00034718463,0.00015908858,0.00055603974,0.000053581563,6.7068277e-7],"category_scores_gemma":[0.000088678105,0.0000620687,0.000033695593,0.00027946054,0.00006450329,0.000592183,0.0003684598,0.00015603872,9.2596156e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034557026,0.00002127836,0.0021300465,0.000013945132,0.000026805266,6.7541777e-7,0.0009529788,0.21658109,0.0000107942,0.20420566,0.001983505,0.5740387],"study_design_scores_gemma":[0.00025072353,0.00005020091,0.0019984406,0.000012502902,0.000004848038,0.0000044049957,0.000049378235,0.91699517,0.00000728915,0.078909725,0.001643979,0.00007331583],"about_ca_topic_score_codex":0.000008191551,"about_ca_topic_score_gemma":0.000055045923,"teacher_disagreement_score":0.8627667,"about_ca_system_score_codex":0.000028734616,"about_ca_system_score_gemma":0.000031958814,"threshold_uncertainty_score":0.26702985},"labels":[],"label_agreement":null},{"id":"W2082613046","doi":"10.1002/net.10098","title":"On the power of BFS to determine a graph's diameter","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lexicographical order; Upper and lower bounds; Graph; Mathematics; Constant (computer programming); Induced subgraph; Discrete mathematics; Algorithm; Computer science","score_opus":0.020818701944480714,"score_gpt":0.27063153885149,"score_spread":0.24981283690700928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082613046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051503483,0.000119256765,0.9392393,0.00038877584,0.00024879462,0.0002524213,5.965861e-7,0.00003899047,0.008208379],"genre_scores_gemma":[0.98919123,0.000005307319,0.0093497215,0.0011910046,0.00001594573,0.000026377696,1.2070208e-7,0.00000932459,0.00021096268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886715,0.00018715109,0.00013487702,0.00024417846,0.0002462261,0.0003204402],"domain_scores_gemma":[0.99826455,0.00070177484,0.00003958109,0.00084656704,0.000058703656,0.00008884704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005474329,0.00009696354,0.000114867,0.000096696676,0.000070377,0.000035237637,0.0007775383,0.000040872623,0.0000669377],"category_scores_gemma":[0.0001915337,0.000062531035,0.00007231245,0.0007830695,0.000071979826,0.00008550735,0.00012474523,0.00018764753,0.000029196342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029781088,0.000069236215,0.00036474763,0.0000022683025,0.000022625896,0.000013070273,0.0003614773,0.010180415,0.00026354645,0.9632272,0.004087073,0.021378558],"study_design_scores_gemma":[0.0010096508,0.0019934226,0.003723986,0.00016063577,0.0000123448135,0.000035556783,0.000072256335,0.046339065,0.011495884,0.91081595,0.023514148,0.0008270672],"about_ca_topic_score_codex":0.0000011294788,"about_ca_topic_score_gemma":0.000003083429,"teacher_disagreement_score":0.93768775,"about_ca_system_score_codex":0.0000105888175,"about_ca_system_score_gemma":0.000012936587,"threshold_uncertainty_score":0.25499418},"labels":[],"label_agreement":null},{"id":"W2090707215","doi":"10.1002/net.21594","title":"Reaching the elementary lower bound in the vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Vehicle routing problem; Upper and lower bounds; Relaxation (psychology); Routing (electronic design automation); Mathematical optimization; Set (abstract data type); Shortest path problem; State space; Computer science; Mathematics; Tree (set theory); Branch and bound; State (computer science); Space (punctuation); Algorithm; Combinatorics","score_opus":0.015640875985707885,"score_gpt":0.23722605952330764,"score_spread":0.22158518353759976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090707215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58210456,0.00094008376,0.36419132,0.0017818651,0.0005840217,0.001636715,0.0000029027462,0.0008173566,0.047941193],"genre_scores_gemma":[0.9802124,0.0000064371275,0.018792665,0.0004771494,0.00033212447,0.000033760232,0.000009710856,0.000049379192,0.000086355685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874884,0.0002756688,0.00023307205,0.00015146648,0.00023351163,0.00035747053],"domain_scores_gemma":[0.99933136,0.00022445024,0.000047103797,0.00032137256,0.000028609598,0.0000471015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284907,0.0001470896,0.00012827,0.000029130751,0.00012938333,0.0001288551,0.00030363843,0.00006690939,0.000016655116],"category_scores_gemma":[0.000027183722,0.00008713879,0.000025664902,0.00038052085,0.000036449743,0.00014747467,0.00004429199,0.0005232775,0.0000139344465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012932326,0.00001170204,0.0042338623,0.0000031375516,0.000016586182,0.000007035925,0.001560742,0.9861912,0.00001937266,0.00007480071,0.00197118,0.005897464],"study_design_scores_gemma":[0.0004423623,0.000038664282,0.0010914436,0.000049287322,0.000015755391,0.000013639891,0.00035435805,0.9953823,0.000012208443,0.00008979673,0.0023723822,0.00013780106],"about_ca_topic_score_codex":0.00005258194,"about_ca_topic_score_gemma":0.000055028955,"teacher_disagreement_score":0.3981079,"about_ca_system_score_codex":0.000098071636,"about_ca_system_score_gemma":0.000020725825,"threshold_uncertainty_score":0.35534167},"labels":[],"label_agreement":null},{"id":"W2094078700","doi":"10.1002/net.10081","title":"Solving the <i>p</i>‐Center problem with Tabu Search and Variable Neighborhood Search","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Tabu search; Heuristics; Variable neighborhood search; Mathematical optimization; Vertex (graph theory); Guided Local Search; Metaheuristic; Variable (mathematics); Mathematics; Center (category theory); Local search (optimization); Computer science; Algorithm; Combinatorics; Graph","score_opus":0.01495553087688913,"score_gpt":0.20241243218071964,"score_spread":0.1874569013038305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094078700","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07175462,0.0012533305,0.19040608,0.0068031256,0.001022676,0.0025610598,0.0000027472418,0.0004120452,0.7257843],"genre_scores_gemma":[0.99481255,0.00006676656,0.00055189896,0.0024162014,0.0003216448,0.000038007965,0.000015534977,0.000023014809,0.0017543682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987747,0.00003291565,0.00017705871,0.00029534523,0.00028172552,0.0004382191],"domain_scores_gemma":[0.99951136,0.00002239473,0.00002212715,0.00029357424,0.00013091025,0.000019618437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008273342,0.00015205747,0.00011803318,0.000066698245,0.00039935994,0.0003670022,0.00018977308,0.00004729004,0.0006004461],"category_scores_gemma":[0.000015491187,0.000100710495,0.000024352013,0.00055854605,0.000071639435,0.00045542276,0.00014340488,0.00023837855,0.0000855037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009553591,0.0003092677,0.10681385,0.00045827517,0.00017351621,0.000007921336,0.00032829642,0.2915759,0.00002614494,0.552553,0.0285316,0.019126687],"study_design_scores_gemma":[0.0014276946,0.000033795186,0.0077717016,0.00011715151,0.000076355835,0.000005335094,0.0010572248,0.59317327,0.0000074684326,0.0013318443,0.39450544,0.00049273984],"about_ca_topic_score_codex":0.0004936567,"about_ca_topic_score_gemma":0.0002817059,"teacher_disagreement_score":0.923058,"about_ca_system_score_codex":0.000017168837,"about_ca_system_score_gemma":0.000019113591,"threshold_uncertainty_score":0.6574463},"labels":[],"label_agreement":null},{"id":"W2094626628","doi":"10.1002/net.20485","title":"Branch‐and‐cut and hybrid local search for the multi‐level capacitated minimum spanning tree problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum spanning tree; Spanning tree; GRASP; Benchmark (surveying); Mathematical optimization; Branch and cut; Branch and bound; Polyhedron; Mathematics; Tree (set theory); Computer science; Cutting-plane method; Combinatorics; Linear programming; Integer programming","score_opus":0.06862574685694278,"score_gpt":0.26602709596399476,"score_spread":0.19740134910705198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094626628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029600073,0.00072521606,0.9684788,0.000039469498,0.00015630688,0.00036825103,0.0000063877947,0.00017662026,0.00044888782],"genre_scores_gemma":[0.82974815,0.00008478735,0.16981567,0.000043142907,0.00009946162,0.000039832757,0.000005469742,0.000048753256,0.00011470915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916047,0.000056456574,0.00018700132,0.00018216592,0.00007778017,0.00033611554],"domain_scores_gemma":[0.9993471,0.00033723481,0.000023936582,0.00015676166,0.000053693217,0.0000812766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005623307,0.00014367801,0.00015093345,0.000039755047,0.00014468945,0.000039754515,0.000106853775,0.00008561925,0.00001050621],"category_scores_gemma":[0.00002479196,0.000117631,0.000029980269,0.00011837269,0.00010481997,0.0000748354,0.00004095413,0.00024490154,0.000001412752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028607918,0.000010419539,0.0023021365,0.00005856248,0.00006810241,0.0000021149713,0.0016839443,0.78671604,0.000094926276,0.00010785311,0.000493415,0.20843385],"study_design_scores_gemma":[0.0005929145,0.00002727783,0.005061332,0.000038075457,0.000025759038,0.000014293411,0.000112799135,0.9931647,0.00053181825,0.00004287986,0.00024232897,0.00014582904],"about_ca_topic_score_codex":0.00002626531,"about_ca_topic_score_gemma":0.000023355868,"teacher_disagreement_score":0.80014807,"about_ca_system_score_codex":0.000019186285,"about_ca_system_score_gemma":0.000008546754,"threshold_uncertainty_score":0.4796853},"labels":[],"label_agreement":null},{"id":"W2094814392","doi":"10.1002/net.10001","title":"Maximizing residual flow under an arc destruction","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Residual; Arc (geometry); Flow (mathematics); Flow network; Maximum flow problem; Mathematics; Multi-commodity flow problem; Mathematical optimization; Computer science; Algorithm; Geometry","score_opus":0.01790803809284282,"score_gpt":0.21797649310930473,"score_spread":0.2000684550164619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094814392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03801974,0.00026950796,0.9436379,0.000099246914,0.001180899,0.000091849484,8.2634983e-7,0.0008212961,0.015878707],"genre_scores_gemma":[0.9783296,0.0002926261,0.02028476,0.00012249514,0.00062932697,0.000005193364,0.00004320628,0.000041693704,0.00025108323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.000017528515,0.00010734508,0.00010040422,0.0000687922,0.00018548443],"domain_scores_gemma":[0.99976397,0.000011892536,0.000012475971,0.00013711739,0.000013955545,0.000060566443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007336334,0.000084026586,0.000068209774,0.000040257382,0.00006303392,0.000054257314,0.00005884213,0.00009375912,0.00018133252],"category_scores_gemma":[0.000002029192,0.00009076899,0.00001730749,0.00015520692,0.000011755792,0.00014096535,0.0000076930755,0.00014541554,0.000017898152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039603797,0.0000039473503,0.00054277777,0.0000030324586,0.0000070826873,0.0000020327977,0.00005459126,0.97868216,0.000015987665,0.00034801377,0.00094468665,0.01939172],"study_design_scores_gemma":[0.000161085,0.000012844837,0.0013425775,0.000014702091,0.0000058537303,0.000022432288,0.000020897038,0.99360496,0.00001788648,0.00054761145,0.0041310946,0.0001180473],"about_ca_topic_score_codex":0.000005526635,"about_ca_topic_score_gemma":0.00003629484,"teacher_disagreement_score":0.9403099,"about_ca_system_score_codex":0.00002695552,"about_ca_system_score_gemma":0.0000039354636,"threshold_uncertainty_score":0.3701452},"labels":[],"label_agreement":null},{"id":"W2100641445","doi":"10.1002/net.20437","title":"Lagrangean decomposition/relaxation for the routing and wavelength assignment problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Subgradient method; Mathematical optimization; Relaxation (psychology); Path (computing); Node (physics); Computation; Shortest path problem; Arc routing; Decomposition; Column generation; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Routing (electronic design automation); Algorithm; Combinatorics; Graph; Physics","score_opus":0.016444781169880577,"score_gpt":0.22049030369445163,"score_spread":0.20404552252457106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100641445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055513503,0.00087854656,0.9900638,0.00007456374,0.00016248705,0.0004308462,0.0000012220432,0.000541997,0.0022952205],"genre_scores_gemma":[0.90807325,0.00030339984,0.09132676,0.00003101491,0.00011322691,0.00011169228,0.0000041728463,0.000022469525,0.000014030904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994703,0.000006537178,0.00013278103,0.0001120563,0.00004960307,0.00022873288],"domain_scores_gemma":[0.99961,0.00018782051,0.000028290533,0.00013068593,0.000017262571,0.000025923679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011661131,0.00009992334,0.00008463649,0.000015274809,0.00012367546,0.000018810906,0.000093955154,0.00009335461,0.000006534472],"category_scores_gemma":[0.000012020933,0.000073280724,0.000024173887,0.00007870373,0.000044829005,0.00007380623,0.0000326409,0.00015825104,0.0000016426053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020227038,0.00001710443,0.0005838705,0.000025182924,0.00007099937,0.0000011815582,0.00032018055,0.312975,0.00006213449,0.031069009,0.0010279657,0.6538272],"study_design_scores_gemma":[0.00018846669,0.000044217046,0.0018381652,0.000029774274,0.000026036601,0.0000028058496,0.000091643335,0.98968905,0.00010502713,0.0068373787,0.0010247087,0.00012274539],"about_ca_topic_score_codex":0.0000016412172,"about_ca_topic_score_gemma":0.000009029701,"teacher_disagreement_score":0.9025219,"about_ca_system_score_codex":0.00003108804,"about_ca_system_score_gemma":0.0000013948548,"threshold_uncertainty_score":0.29883012},"labels":[],"label_agreement":null},{"id":"W2102346823","doi":"10.1002/net.21562","title":"Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Routing (electronic design automation); Truck; Traverse; Computer science; Mathematical optimization; Arc routing; Vehicle routing problem; Operations research; Mathematics; Engineering; Automotive engineering; Computer network; Geography","score_opus":0.01909616450260213,"score_gpt":0.23929610966925796,"score_spread":0.22019994516665584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102346823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003058404,0.0001869237,0.99086666,0.00007332864,0.00016449475,0.00057552435,0.0000074520517,0.00032771617,0.0047394866],"genre_scores_gemma":[0.9556692,0.0000146818875,0.043705262,0.00010990812,0.0002808975,0.00008478276,0.000014493535,0.00006976582,0.00005099063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986938,0.0001630224,0.00021952638,0.00020903803,0.00016910011,0.00054549286],"domain_scores_gemma":[0.9989917,0.0005015493,0.0000499754,0.00024131317,0.00012431962,0.0000910974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012827261,0.00018333994,0.0001897201,0.000043144428,0.00028221952,0.00007694108,0.00018944382,0.00011635819,0.00004094675],"category_scores_gemma":[0.000044405057,0.00013701551,0.00005207394,0.00026758047,0.0001380067,0.00007920458,0.000029869092,0.00040881505,0.0000048899005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020159836,0.000010151416,0.0024788645,0.0000221706,0.00007809401,6.518815e-7,0.0009771158,0.9673578,0.000018762985,0.0043434487,0.00023882752,0.024453968],"study_design_scores_gemma":[0.00078235037,0.000080204365,0.0004327581,0.0000771308,0.00003159409,0.0000063535563,0.00045112407,0.997311,0.00004766557,0.000063197615,0.00053427514,0.00018236124],"about_ca_topic_score_codex":0.0000054344446,"about_ca_topic_score_gemma":0.000015018277,"teacher_disagreement_score":0.9526108,"about_ca_system_score_codex":0.00006554981,"about_ca_system_score_gemma":0.000034817665,"threshold_uncertainty_score":0.55873305},"labels":[],"label_agreement":null},{"id":"W2107686563","doi":"10.1002/net.21549","title":"Cooperative covering problems on networks","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Heuristics; Mathematical optimization; Integer programming; Linear programming; SIGNAL (programming language); Facility location problem; Signal strength; Computer science; Piecewise; Set (abstract data type); Piecewise linear function; Point (geometry); Polynomial; Function (biology); Algorithm; Mathematics; Wireless sensor network","score_opus":0.01631197117293037,"score_gpt":0.20259445050924724,"score_spread":0.18628247933631686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107686563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024372866,0.00018145383,0.6380955,0.0024149932,0.0042727045,0.0010191202,7.589006e-7,0.0007404817,0.32890213],"genre_scores_gemma":[0.9892092,0.00003172072,0.00004175205,0.007165552,0.00203681,0.00004803406,0.00004761742,0.000023845218,0.0013954799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988878,0.000017175109,0.0002466104,0.00031695425,0.00018916611,0.00034230118],"domain_scores_gemma":[0.9995034,0.000024914769,0.000057921854,0.00030045214,0.00009634953,0.000016995205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042593977,0.0001873288,0.00016588287,0.000087480825,0.00023436669,0.00021418235,0.00021243801,0.00007623158,0.0005354562],"category_scores_gemma":[0.000051536055,0.0001713886,0.000059707323,0.000395793,0.00003445919,0.000374997,0.000120162695,0.00019409078,0.0006420908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015848684,0.000042924537,0.0007799425,0.000027031789,0.000015726231,4.653079e-7,0.000010799369,0.9070673,0.0000012926258,0.048118412,0.024831286,0.019088997],"study_design_scores_gemma":[0.00021260488,0.00001321237,0.0019783364,0.000031863165,0.00001098621,7.25417e-8,0.000015351676,0.66719633,5.307178e-7,0.00013238119,0.33025575,0.00015260358],"about_ca_topic_score_codex":0.000228051,"about_ca_topic_score_gemma":0.00033457702,"teacher_disagreement_score":0.9648363,"about_ca_system_score_codex":0.000026780082,"about_ca_system_score_gemma":0.0000032622384,"threshold_uncertainty_score":0.8252992},"labels":[],"label_agreement":null},{"id":"W2108063243","doi":"10.1002/net.20396","title":"Nonadaptive broadcasting in trees","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Upper and lower bounds; Tree (set theory); Combinatorics; Time complexity; Graph; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Computer network","score_opus":0.008583573358192428,"score_gpt":0.2169697974588081,"score_spread":0.20838622410061566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108063243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05046611,0.00012552836,0.9174168,0.00023944238,0.004604024,0.0001368636,2.6516437e-7,0.00015432254,0.026856618],"genre_scores_gemma":[0.99523675,0.0000045843126,0.0034041358,0.00019800969,0.0007302002,0.000012518433,5.4628987e-7,0.0000066343614,0.00040661817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911255,0.00004626748,0.00020254141,0.00025104414,0.000109697336,0.0002779029],"domain_scores_gemma":[0.9993728,0.00016635787,0.0000592638,0.00029020308,0.000055136952,0.000056284756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003515998,0.0000932166,0.00012375323,0.00006655193,0.00007351203,0.00011583056,0.00041120645,0.000107397784,0.00002449848],"category_scores_gemma":[0.000034882243,0.00008435307,0.00003537707,0.0004123131,0.000020169573,0.00023502366,0.00009710989,0.00041699893,0.0000213121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035897585,0.00020623165,0.038731888,0.000018888155,0.000044653058,0.00021723946,0.0034400946,0.2754927,0.0009835107,0.24349695,0.02064723,0.41668472],"study_design_scores_gemma":[0.00017732097,0.000027412663,0.004996333,0.000030972078,6.6038695e-7,0.000032119926,0.000026050455,0.984586,0.00001885076,0.00040508035,0.009574105,0.00012510501],"about_ca_topic_score_codex":0.00012095397,"about_ca_topic_score_gemma":0.004158698,"teacher_disagreement_score":0.94477063,"about_ca_system_score_codex":0.000016866532,"about_ca_system_score_gemma":0.000027261038,"threshold_uncertainty_score":0.34398183},"labels":[],"label_agreement":null},{"id":"W2110105948","doi":"10.1002/net.10009","title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Polytope; Spanning tree; Heuristics; Combinatorics; Mathematics; Tree (set theory); Mathematical optimization; Computer science","score_opus":0.03965971433503258,"score_gpt":0.31007744587188296,"score_spread":0.2704177315368504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110105948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027346566,0.00024762523,0.97010255,0.00005177044,0.00008391028,0.0002964166,0.0000056414233,0.00010175886,0.0017637784],"genre_scores_gemma":[0.79475075,0.00003051234,0.20481881,0.00002808499,0.000093884264,0.000054090062,0.00003876562,0.0000133611375,0.00017174735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929893,0.000045451317,0.00027496542,0.000102438535,0.00008415726,0.00019403221],"domain_scores_gemma":[0.99919707,0.00043923067,0.00007050927,0.00017987475,0.00008286843,0.000030438008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002818847,0.000102007136,0.00027633022,0.000107897074,0.00010339139,0.000022686389,0.000113397335,0.00006391295,0.00003273491],"category_scores_gemma":[0.000014202132,0.00008203496,0.00014791879,0.0010011916,0.000021727987,0.000064172644,0.000014656442,0.00008699585,4.162356e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014678897,0.0000069790417,0.0017144894,0.0000040347086,0.0006213756,1.2488468e-7,0.00060459727,0.99361145,0.000041330415,0.00042095434,0.00064367783,0.002316318],"study_design_scores_gemma":[0.000337079,0.00001142415,0.005938533,0.000007675941,0.00050032313,5.870894e-7,0.000043271226,0.99181217,0.0000263764,0.00006237414,0.0011696339,0.00009054278],"about_ca_topic_score_codex":0.000010288926,"about_ca_topic_score_gemma":0.000069938804,"teacher_disagreement_score":0.7674042,"about_ca_system_score_codex":0.000027729533,"about_ca_system_score_gemma":0.00000712227,"threshold_uncertainty_score":0.33452886},"labels":[],"label_agreement":null},{"id":"W2118555996","doi":"10.1002/net.21496","title":"The orienteering problem with variable profits","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Orienteering; Vertex (graph theory); Profit (economics); Operations research; Mathematical optimization; Mathematics; Graph; Combinatorics; Computer science; Travel time; Time limit; Mathematical economics; Economics; Microeconomics; Transport engineering; Engineering","score_opus":0.005110104516139893,"score_gpt":0.19108211177042117,"score_spread":0.18597200725428129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118555996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004130469,0.00024719382,0.9718151,0.000067695655,0.00025522755,0.00037185862,2.001071e-7,0.000515633,0.022596618],"genre_scores_gemma":[0.47419348,0.000082007144,0.52292633,0.00007554974,0.00037309265,0.00032516793,0.0000050313483,0.0001094773,0.0019098215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935114,0.000028273498,0.00012822496,0.000100410674,0.00009528456,0.00029664152],"domain_scores_gemma":[0.9995697,0.000095417694,0.00002185147,0.00020018019,0.00006196879,0.000050856514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023042393,0.00009854385,0.00007584468,0.000013478529,0.00014061,0.000120887154,0.00012912804,0.00005595121,0.000045583412],"category_scores_gemma":[0.00001250738,0.00006419315,0.000011450186,0.00027132692,0.000020796471,0.000119225835,0.000024049958,0.00018905214,0.000024074105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013383418,0.0000019895929,0.00072366477,0.000007985388,0.000015942258,2.64363e-7,0.00004084035,0.9841194,0.000032114433,0.0011038256,0.00208056,0.011872036],"study_design_scores_gemma":[0.00011610257,0.000013197079,0.00042114485,0.000030033883,0.000005195552,0.0000041136036,0.00001734002,0.98958224,0.000057182468,0.000121393234,0.009531799,0.00010027731],"about_ca_topic_score_codex":0.0000090429385,"about_ca_topic_score_gemma":0.0000025026416,"teacher_disagreement_score":0.47006303,"about_ca_system_score_codex":0.000028508533,"about_ca_system_score_gemma":0.000008613941,"threshold_uncertainty_score":0.26177207},"labels":[],"label_agreement":null},{"id":"W2121031403","doi":"10.1002/net.10088","title":"Broadcasting in generalized chordal rings","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Broadcasting (networking); Undirected graph; Mathematics; Node (physics); Combinatorics; Ring (chemistry); Link (geometry); Graph; Treewidth; Discrete mathematics; Computer science; Pathwidth; Computer network; Line graph","score_opus":0.012615665083055854,"score_gpt":0.22121145617798488,"score_spread":0.208595791094929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121031403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045639448,0.0005195581,0.9226629,0.00008368576,0.0023472272,0.00013066511,7.5439985e-8,0.00013324482,0.028483208],"genre_scores_gemma":[0.9924629,0.000016515643,0.0060319332,0.00038410517,0.00030876088,0.000017432072,4.4569188e-7,0.000009415694,0.00076853146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987658,0.0001570712,0.00028042943,0.00029982527,0.0001244727,0.00037240013],"domain_scores_gemma":[0.9994695,0.000065829925,0.00007023193,0.00029387945,0.0000356343,0.00006493471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711178,0.00011419356,0.00016487078,0.00007432668,0.00008520553,0.00014479278,0.00031465237,0.00009394444,0.000034796096],"category_scores_gemma":[0.000030925232,0.0001083427,0.000056099987,0.00044949117,0.000012438366,0.00021661603,0.00005519056,0.00021939738,0.000020714224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012646735,0.000083562285,0.020992363,0.000012731589,0.000025551228,0.00009429917,0.0007656077,0.49602306,0.00010645658,0.4263688,0.012222806,0.043292116],"study_design_scores_gemma":[0.0004717076,0.000025844136,0.0010384425,0.000044356628,0.0000010552893,0.000055557688,0.00001589809,0.96294206,0.000038474638,0.000851901,0.034337237,0.00017748044],"about_ca_topic_score_codex":0.000057055553,"about_ca_topic_score_gemma":0.00006886986,"teacher_disagreement_score":0.9468234,"about_ca_system_score_codex":0.000048030244,"about_ca_system_score_gemma":0.000018420804,"threshold_uncertainty_score":0.4418087},"labels":[],"label_agreement":null},{"id":"W2133241632","doi":"10.1002/net.10114","title":"The Ring Star Problem: Polyhedral analysis and exact algorithm","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":164,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Ring (chemistry); Algorithm; Star (game theory); Integer programming; Network planning and design; Mathematics; Integer (computer science); Computer science; Mathematical optimization; Graph; Branch and cut; Combinatorics","score_opus":0.00989145699610171,"score_gpt":0.2084014050369466,"score_spread":0.19850994804084487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133241632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25787753,0.0021771432,0.6774007,0.013918922,0.0017620702,0.0013325022,0.0000035253445,0.00070709345,0.04482051],"genre_scores_gemma":[0.99660176,0.00013922296,0.0012577283,0.00088985666,0.00056362356,0.00002277561,0.000022476981,0.000011189382,0.00049138645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991138,0.000006762991,0.00020661898,0.00022290634,0.00017121041,0.00027872538],"domain_scores_gemma":[0.9996447,0.000010125745,0.000049831484,0.00022802767,0.00005321846,0.000014129109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036695873,0.00012063211,0.0001194637,0.00012432745,0.00042698655,0.0003167714,0.00016189543,0.00003779107,0.00008559795],"category_scores_gemma":[0.000011296133,0.00008969828,0.00007378306,0.0008612315,0.000050475544,0.0003520371,0.00013898482,0.00010627376,0.000052636915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042176544,0.00010152805,0.029098427,0.00009724662,0.0011041231,0.000010489434,0.00018030193,0.40304115,0.000006276813,0.057361882,0.0033595038,0.5055969],"study_design_scores_gemma":[0.00065952126,0.00000998134,0.1181981,0.000019963907,0.0005225437,3.99819e-7,0.00039997048,0.8034996,0.0000017355718,0.0032948714,0.07304343,0.00034990712],"about_ca_topic_score_codex":0.001790214,"about_ca_topic_score_gemma":0.002072693,"teacher_disagreement_score":0.73872423,"about_ca_system_score_codex":0.000025595271,"about_ca_system_score_gemma":0.0000054090438,"threshold_uncertainty_score":0.36577898},"labels":[],"label_agreement":null},{"id":"W2134465458","doi":"10.1002/net.20447","title":"A branch‐and‐cut algorithm for the preemptive swapping problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Vertex (graph theory); Algorithm; Computer science; Graph; Integer programming; Branch and cut; Object (grammar); Combinatorics; Integer (computer science); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.02521659239295936,"score_gpt":0.23731270554829037,"score_spread":0.212096113155331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134465458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002402125,0.00083447987,0.99412817,0.000021090149,0.00025399422,0.0004185401,0.0000022258366,0.00025584173,0.0038454733],"genre_scores_gemma":[0.14659393,0.00023005062,0.852031,0.00010924997,0.00043788692,0.00021752097,0.0000042239562,0.0000695964,0.0003065371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942446,0.00002895199,0.00013947881,0.00012527715,0.000053053343,0.00022875276],"domain_scores_gemma":[0.9995269,0.00022183785,0.000027861077,0.00014643084,0.000036715905,0.00004022043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035404536,0.00010600184,0.00010659557,0.000021659354,0.00010652581,0.000026065949,0.00010970858,0.00008554084,0.000027399745],"category_scores_gemma":[0.000015540858,0.00008400987,0.000036684836,0.00011889358,0.000030758707,0.000067594156,0.00002967991,0.0001532548,0.0000027648996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005056726,0.0000062511685,0.00018626728,0.000020523512,0.00007800533,4.2495026e-7,0.001405984,0.38858452,0.000010140092,0.0002999984,0.0008937119,0.6085091],"study_design_scores_gemma":[0.00021360177,0.000018387715,0.0006697236,0.000027709524,0.000025080826,0.0000040028613,0.00003653916,0.99678653,0.00009213484,0.00037178732,0.0016454327,0.000109052286],"about_ca_topic_score_codex":0.0000071191394,"about_ca_topic_score_gemma":0.0000042888355,"teacher_disagreement_score":0.60840005,"about_ca_system_score_codex":0.000016275777,"about_ca_system_score_gemma":0.0000051348343,"threshold_uncertainty_score":0.34258232},"labels":[],"label_agreement":null},{"id":"W2148386181","doi":"10.1002/net.21653","title":"SRLG failure localization using nested m‐trails and their application to adaptive probing","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Traverse; Computer science; Integer programming; Heuristic; Node (physics); Topology (electrical circuits); Latency (audio); Computer network; Distributed computing; Algorithm; Mathematics; Physics; Artificial intelligence; Combinatorics; Telecommunications","score_opus":0.017512057860011636,"score_gpt":0.22102773838222334,"score_spread":0.2035156805222117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148386181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019065915,0.000533232,0.9788896,0.000043448825,0.000081731705,0.00037953432,9.581345e-7,0.0008055578,0.0002000492],"genre_scores_gemma":[0.9447185,0.0000172036,0.054982577,0.00005318018,0.00013810642,0.000043319684,0.000007680778,0.000035925288,0.0000035327098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993424,0.000011702686,0.00014432363,0.0001857037,0.00006491481,0.00025096166],"domain_scores_gemma":[0.9995994,0.000036744917,0.00002359526,0.00017977612,0.00005948212,0.000100992795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000822106,0.00014933228,0.00014359708,0.000051066912,0.000048465063,0.000029994839,0.00009358954,0.00016599079,8.161685e-7],"category_scores_gemma":[0.000023635452,0.00013696087,0.000013576235,0.00042060923,0.00004111043,0.00014927477,0.000057321035,0.00017142219,0.0000040497957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006027913,0.0000031414975,0.0001178088,0.000005117785,0.000007799803,5.1413093e-7,0.00015848225,0.96090204,0.00027828626,0.0010001354,0.00028226044,0.037238378],"study_design_scores_gemma":[0.00011675237,0.000028934195,0.00003947899,0.00004270384,0.0000061308538,0.000005152373,0.00037043725,0.9953537,0.00017709217,0.0017969413,0.0019014714,0.00016121307],"about_ca_topic_score_codex":0.0000030649849,"about_ca_topic_score_gemma":0.000023023187,"teacher_disagreement_score":0.92565256,"about_ca_system_score_codex":0.00009194248,"about_ca_system_score_gemma":0.0000063321836,"threshold_uncertainty_score":0.5585102},"labels":[],"label_agreement":null},{"id":"W2156398306","doi":"10.1002/net.21459","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Stack (abstract data type); Computer science; Constraint (computer-aided design); Algorithm; 2-opt; Branch and cut; Mathematical optimization; Mathematics; Integer programming; Artificial intelligence","score_opus":0.01037015660828235,"score_gpt":0.1923077332894443,"score_spread":0.18193757668116195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156398306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008639148,0.004132618,0.986077,0.00003900324,0.00019385928,0.00042468993,0.0000063540747,0.00014239314,0.00034492486],"genre_scores_gemma":[0.96128756,0.00076164916,0.037343156,0.000092118724,0.00030514377,0.00005974834,0.00001456899,0.00004138806,0.000094653806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994696,0.00001008784,0.00010666907,0.000095286836,0.000054956898,0.00026340704],"domain_scores_gemma":[0.9996274,0.0001633427,0.000020875303,0.00009210443,0.000024978608,0.000071292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524062,0.000116276526,0.00010197956,0.000016672531,0.00012724375,0.00005300264,0.00004560814,0.000072572395,0.0000064659903],"category_scores_gemma":[0.0000027456947,0.00008166702,0.000017465769,0.000068776426,0.00003284804,0.000109772,0.000013796466,0.00013316439,9.1141055e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013822374,0.000011535551,0.007621985,0.00005732895,0.000077551296,2.5680637e-7,0.0012207935,0.7233991,0.00000970682,0.00010460591,0.0006722231,0.2668111],"study_design_scores_gemma":[0.0005849453,0.000026233167,0.0015278982,0.00004601428,0.000031631916,0.000009899257,0.000052262243,0.9897737,0.000019310208,0.000016209568,0.007776457,0.00013546029],"about_ca_topic_score_codex":0.000009905557,"about_ca_topic_score_gemma":0.000051119485,"teacher_disagreement_score":0.9526484,"about_ca_system_score_codex":0.000009568793,"about_ca_system_score_gemma":0.0000043772116,"threshold_uncertainty_score":0.33302844},"labels":[],"label_agreement":null},{"id":"W2162838679","doi":"10.1002/net.21463","title":"Distributed tree comparison with nodes of limited memory","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Tree (set theory); Task (project management); Class (philosophy); Automaton; Binary logarithm; Enhanced Data Rates for GSM Evolution; Theoretical computer science; State (computer science); Discrete mathematics; Shared memory; Parallel computing; Combinatorics; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.015946542808643993,"score_gpt":0.23702053338625434,"score_spread":0.22107399057761035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162838679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03375377,0.0013515953,0.96124977,0.0000917459,0.00040243485,0.00013068103,0.000015394153,0.00012596704,0.0028786596],"genre_scores_gemma":[0.99572283,0.0000066375032,0.0039112032,0.000054836604,0.00017721772,0.00001191595,0.00004538858,0.000008411528,0.00006155461],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987708,0.00006339496,0.0003126902,0.00019730428,0.0002433597,0.00041250174],"domain_scores_gemma":[0.9989502,0.00007906761,0.00020424854,0.000527564,0.00009915785,0.00013976307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024985743,0.00014558951,0.00030485654,0.000033504475,0.00006712192,0.000049299546,0.00051365985,0.00009232192,0.0000067912483],"category_scores_gemma":[0.000010267644,0.00011159734,0.000054589047,0.0005375801,0.000058250105,0.00035322245,0.0000891613,0.00015544273,0.000009885122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022708497,0.0018782918,0.45186615,0.00016766624,0.00036694587,0.000026285832,0.0026024817,0.14926855,0.00045665642,0.052350994,0.0811118,0.25967708],"study_design_scores_gemma":[0.001106475,0.00016092855,0.16342707,0.00017830919,0.000028621538,0.000026649106,0.00013042288,0.81624466,0.00073178957,0.00003390234,0.01749825,0.0004329126],"about_ca_topic_score_codex":0.000030287,"about_ca_topic_score_gemma":0.000015355554,"teacher_disagreement_score":0.9619691,"about_ca_system_score_codex":0.000023880551,"about_ca_system_score_gemma":0.000018686202,"threshold_uncertainty_score":0.45508075},"labels":[],"label_agreement":null},{"id":"W2163513576","doi":"10.1002/net.21520","title":"A branch‐price‐and‐cut algorithm for the min‐max <i>k</i>‐vehicle windy rural postman problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Set (abstract data type); Branch and cut; Computer science; Mathematical optimization; Algorithm; Graph; Vehicle routing problem; Mathematics; Combinatorics; Integer programming; Routing (electronic design automation)","score_opus":0.007274112739817685,"score_gpt":0.21954171832004143,"score_spread":0.21226760558022376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163513576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073342496,0.0011920789,0.9880103,0.00059781974,0.00043455546,0.001023272,0.00000576651,0.0004367895,0.0009651773],"genre_scores_gemma":[0.40173018,0.00039164897,0.59300846,0.0010607434,0.0015375653,0.0006675186,0.000034526154,0.00021582688,0.0013535257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892426,0.000049403243,0.00026017553,0.00017803011,0.00012560058,0.00046255827],"domain_scores_gemma":[0.99909073,0.0003970152,0.00004839319,0.00027477706,0.00008453721,0.00010457101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036108308,0.00019789964,0.0001898968,0.00003557747,0.0001901908,0.00014810015,0.00021184704,0.00015341,0.00007152959],"category_scores_gemma":[0.000020107509,0.00014058962,0.00007005948,0.0002259051,0.00004916308,0.00018571551,0.000055024062,0.00026474515,0.000021761774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025697614,0.00000852186,0.00019660094,0.000018866884,0.000048055368,3.0631878e-7,0.00018660576,0.39734948,0.000158875,0.000061226114,0.006914717,0.59505415],"study_design_scores_gemma":[0.0004743395,0.000031254353,0.0016522941,0.000027325896,0.000027829532,0.000009706383,0.00004101026,0.9907218,0.000111599846,0.00033858613,0.0063590226,0.00020520616],"about_ca_topic_score_codex":0.000036637546,"about_ca_topic_score_gemma":0.0000055301093,"teacher_disagreement_score":0.594849,"about_ca_system_score_codex":0.0000323355,"about_ca_system_score_gemma":0.000009176756,"threshold_uncertainty_score":0.5733079},"labels":[],"label_agreement":null},{"id":"W2164043220","doi":"10.1002/net.10023","title":"Efficient algorithms for centers and medians in interval and circular‐arc graphs","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan; Simon Fraser University","funders":"","keywords":"Interval graph; Combinatorics; Median; Mathematics; Interval (graph theory); Graph; Vertex (graph theory); Algorithm; Arc (geometry); Time complexity; Discrete mathematics; Line graph; Pathwidth; Geometry","score_opus":0.027632691525661546,"score_gpt":0.22102037075949504,"score_spread":0.1933876792338335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164043220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9456465,0.002429691,0.03598712,0.0063001076,0.0021054433,0.0014665104,0.0000058065084,0.00017105983,0.0058877273],"genre_scores_gemma":[0.99813825,0.00013065881,0.00012235108,0.0012575015,0.00017931282,0.000039660517,0.000015093883,0.000010511452,0.00010666461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999242,0.0000061814612,0.00018615097,0.00023814224,0.0000963975,0.00023113705],"domain_scores_gemma":[0.99980474,0.000013961451,0.000027915055,0.000106734835,0.00003005137,0.000016603422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024442008,0.00010795539,0.000118404314,0.00015038573,0.00007882824,0.00008556134,0.00007768272,0.000044887063,0.00010018299],"category_scores_gemma":[0.000022738124,0.00010654099,0.000035883535,0.00021868745,0.00004857429,0.00010422056,0.000079982965,0.000073373165,0.000010903282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012865195,0.00088170037,0.12829812,0.0015863818,0.00018865078,0.000028852512,0.0014584376,0.17553706,0.00002961219,0.026225671,0.05987738,0.6057595],"study_design_scores_gemma":[0.00060038,0.000007457159,0.016923647,0.000031524552,0.000016738024,3.886985e-7,0.00019030995,0.96260166,2.1931194e-7,0.00025564813,0.019246476,0.00012555893],"about_ca_topic_score_codex":0.00032095812,"about_ca_topic_score_gemma":0.00045072607,"teacher_disagreement_score":0.7870646,"about_ca_system_score_codex":0.000012889941,"about_ca_system_score_gemma":7.99192e-7,"threshold_uncertainty_score":0.43446156},"labels":[],"label_agreement":null},{"id":"W2167459401","doi":"10.1002/net.10105","title":"The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Steiner tree problem; Spanning tree; Branch and cut; k-minimum spanning tree; Tabu search; Vertex (graph theory); Mathematics; Integer programming; Combinatorics; Kruskal's algorithm; Euclidean geometry; Heuristic; Algorithm; Graph; Mathematical optimization; Tree structure; K-ary tree; Binary tree","score_opus":0.007846760493643152,"score_gpt":0.2338371477629094,"score_spread":0.22599038726926624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167459401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05134978,0.0023075538,0.94502693,0.00020793981,0.00015149378,0.00012384036,0.0000014910248,0.0002317071,0.0005992386],"genre_scores_gemma":[0.6561824,0.0006537415,0.34252328,0.000089592766,0.00030770412,0.000019785492,0.000010433487,0.00004644696,0.00016660105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907464,0.00006508667,0.00023429075,0.00019305399,0.000110577304,0.000322348],"domain_scores_gemma":[0.99954003,0.00010417192,0.00004267708,0.00019466378,0.00002621631,0.00009226634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038162054,0.00015739235,0.00022032789,0.00008323912,0.00021486843,0.0001328886,0.000097846125,0.000111574234,0.0000058321966],"category_scores_gemma":[0.000016133128,0.00012872905,0.00006378049,0.0005893055,0.000060187373,0.000076214375,0.00004358081,0.00019752933,9.791976e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003507027,0.000002482661,0.0017226671,0.000004442463,0.00019246723,0.0000017730218,0.00022021096,0.8721574,0.000048306953,0.000101203885,0.00004730618,0.12549827],"study_design_scores_gemma":[0.00056666473,0.000012090138,0.0057290997,0.000013855371,0.00017961777,0.0000075377184,0.0000229908,0.9927196,0.000090758986,0.00022926964,0.0002668152,0.00016173247],"about_ca_topic_score_codex":0.000032592474,"about_ca_topic_score_gemma":0.000062609055,"teacher_disagreement_score":0.60483265,"about_ca_system_score_codex":0.0000325426,"about_ca_system_score_gemma":0.000008415862,"threshold_uncertainty_score":0.52494186},"labels":[],"label_agreement":null},{"id":"W2169825170","doi":"10.1002/net.1012","title":"A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regent College","funders":"","keywords":"Maximum flow problem; Minimum cut; Algorithm; Closure (psychology); Mathematics; Context (archaeology); Minimum-cost flow problem; Flow (mathematics); Maximum cut; Time complexity; Flow network; Graph; Computer science; Combinatorics","score_opus":0.009186957762735095,"score_gpt":0.20309567310143778,"score_spread":0.1939087153387027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169825170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12785617,0.0015709535,0.86543405,0.00008824219,0.0005754642,0.0004343598,0.000011991338,0.00048170207,0.0035470987],"genre_scores_gemma":[0.42959428,0.0048435777,0.56250304,0.0003278657,0.0012351363,0.00016104765,0.000060854647,0.0001709905,0.0011032243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993838,0.000003789727,0.00016681911,0.00014846284,0.000024908411,0.00027223755],"domain_scores_gemma":[0.9997246,0.000036765425,0.000016678374,0.00014158465,0.0000063473703,0.00007398692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010691847,0.00012055584,0.0001614481,0.000062587525,0.000022327007,0.000029919314,0.00008211939,0.00016465176,0.000030510242],"category_scores_gemma":[0.0000025996628,0.0001349237,0.000042543215,0.00009539707,0.000009611253,0.000059943304,0.000019835994,0.00013841646,0.0000018593449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001571692,0.000009635578,0.004434386,0.000015919339,0.000024398098,0.000011924756,0.00014014363,0.056294195,0.000004616892,0.00038540113,0.053526785,0.8851369],"study_design_scores_gemma":[0.000426216,0.000041891908,0.00064173393,0.000027204484,0.000006626743,0.000014514933,0.00001510303,0.9619123,0.000010965208,0.0034589316,0.03328235,0.00016220377],"about_ca_topic_score_codex":0.000024058165,"about_ca_topic_score_gemma":0.00011102367,"teacher_disagreement_score":0.9056181,"about_ca_system_score_codex":0.000023451137,"about_ca_system_score_gemma":0.0000045340876,"threshold_uncertainty_score":0.55020285},"labels":[],"label_agreement":null},{"id":"W2324935025","doi":"10.1142/9789812776730_0028","title":"STOCHASTIC UPPER BOUNDS FOR AGGREGATE NETWORK TRAFFIC WITH MODELING BASED ON FRACTIONAL STABLE NOISE","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Aggregate (composite); Noise (video); Upper and lower bounds; Computer science; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.016966547770931005,"score_gpt":0.2123403502374469,"score_spread":0.1953738024665159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324935025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048741624,0.00045287685,0.9923917,0.000034272893,0.00026937234,0.00037059168,0.000010641721,0.0010477572,0.0005486101],"genre_scores_gemma":[0.9375734,0.000024154393,0.061108846,0.0001329027,0.00065600214,0.00022843957,0.000027737255,0.00011877787,0.00012974058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998851,0.000011382751,0.00018481209,0.00026356697,0.0001678435,0.00052142254],"domain_scores_gemma":[0.9994093,0.0001469114,0.000039149287,0.00026121747,0.00005482082,0.00008859967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009097115,0.00025526472,0.00021066162,0.000064401735,0.00015709872,0.00004728907,0.00012602567,0.00012143132,0.000078609846],"category_scores_gemma":[0.00001067787,0.00024542655,0.000065845365,0.00018245688,0.000027827444,0.00015528321,0.000011381832,0.00032927332,0.000007588365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077659606,0.000023256462,0.000005816533,0.0000136327735,0.000022184831,0.0000024088454,0.000011197479,0.9931836,0.000010480118,0.00024052936,0.002321872,0.004087325],"study_design_scores_gemma":[0.00042707074,0.0001558133,0.000007661001,0.00022557506,0.00001876925,0.0000033840115,0.0000028583486,0.9960016,0.000011691634,0.00027597035,0.002571073,0.0002985538],"about_ca_topic_score_codex":0.0000010862645,"about_ca_topic_score_gemma":0.000005387622,"teacher_disagreement_score":0.93269926,"about_ca_system_score_codex":0.00013614248,"about_ca_system_score_gemma":0.000007528186,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W2503583255","doi":"10.1002/net.21697","title":"On the roots of the node reliability polynomial","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Robustness (evolution); Reliability (semiconductor); Mathematics; Graph; Polynomial; Discrete mathematics; Time complexity; Computer science; Combinatorics; Mathematical analysis","score_opus":0.02047053038089776,"score_gpt":0.2588936726890206,"score_spread":0.23842314230812284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503583255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784232,0.000011325654,0.005233396,0.00507373,0.00017284014,0.00028732608,0.0000076170445,0.000030098663,0.0107605],"genre_scores_gemma":[0.9990272,0.0000026593298,0.0000773771,0.00020407814,0.000092423244,0.000026146214,1.330098e-7,0.000006952686,0.00056304235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949574,0.00010203233,0.00012954549,0.00009093245,0.00007993879,0.000101801656],"domain_scores_gemma":[0.9977008,0.001527467,0.00007799051,0.00065495825,0.00002257511,0.000016202299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001069,0.00005607272,0.00007124217,0.0000054111238,0.00010911679,0.0000041346498,0.00026258783,0.00005136408,0.00011737425],"category_scores_gemma":[0.00024541863,0.000020597161,0.00008140253,0.00009173997,0.00013525618,0.000012927074,0.00004566007,0.000095015435,0.0000126602845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018031078,0.00005179729,0.0005559642,0.0000025154752,0.000006774497,2.5983407e-8,0.000029612596,0.000087263405,0.00033396337,0.9719217,0.025826791,0.0011655875],"study_design_scores_gemma":[0.00014377656,0.0000124055705,0.005782986,0.000049407754,0.000015615566,4.7145176e-7,0.000010805807,0.00026765664,0.0012448101,0.9887306,0.0036914633,0.00005000899],"about_ca_topic_score_codex":0.0000025362374,"about_ca_topic_score_gemma":0.000008360234,"teacher_disagreement_score":0.022135327,"about_ca_system_score_codex":0.000009848398,"about_ca_system_score_gemma":0.000008317102,"threshold_uncertainty_score":0.12851657},"labels":[],"label_agreement":null},{"id":"W2514737704","doi":"10.1002/net.21700","title":"The Rainbow Cycle Cover Problem","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rainbow; Mathematics; Disjoint sets; Cover (algebra); Integer programming; Combinatorics; Graph; Computer science; Algorithm","score_opus":0.009872359546378906,"score_gpt":0.2553044581065949,"score_spread":0.245432098560216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514737704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005280521,0.0003610277,0.9855279,0.0032068081,0.00025096055,0.00016600384,4.121139e-7,0.00013563583,0.009823242],"genre_scores_gemma":[0.9801818,0.00025864528,0.008746988,0.0004296705,0.00026957612,0.000058397163,2.5238288e-7,0.00001704649,0.010037589],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885595,0.000114663926,0.00011076854,0.00024161271,0.00022744933,0.00044958183],"domain_scores_gemma":[0.9984734,0.0006740296,0.000039442024,0.00067409046,0.00005696027,0.00008206986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929814,0.00007954785,0.0000664685,0.000022471751,0.00028266513,0.000113868984,0.0011381321,0.000044152403,0.000023185905],"category_scores_gemma":[0.000043806143,0.000037861242,0.000044696804,0.00029450966,0.00014860526,0.00030028445,0.00034270808,0.00012816415,0.00020153697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015831149,0.000011594405,0.00031198384,9.881422e-7,0.000010842873,0.0000064543874,0.000044125718,0.0024505085,0.00012168815,0.4457418,0.011026394,0.54025775],"study_design_scores_gemma":[0.00062897423,0.00009315366,0.0009467613,0.000042023483,0.0000017503196,0.000014058584,0.000005288191,0.095238656,0.00028137775,0.5992912,0.30321905,0.00023770706],"about_ca_topic_score_codex":0.0000010831488,"about_ca_topic_score_gemma":0.0000030238975,"teacher_disagreement_score":0.9796538,"about_ca_system_score_codex":0.000029280365,"about_ca_system_score_gemma":0.000025801915,"threshold_uncertainty_score":0.25904173},"labels":[],"label_agreement":null},{"id":"W2519829944","doi":"10.1002/net.20233","title":"Approximation bounds for Black Hole Search problems","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Computer science; Black hole (networking); Black box; Set (abstract data type); Time complexity; Process (computing); Task (project management); Approximation algorithm; Theoretical computer science; Algorithm; Computer network; Artificial intelligence; Physics","score_opus":0.04569803779833919,"score_gpt":0.2672764333897557,"score_spread":0.2215783955914165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519829944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011239807,0.00007986391,0.99258286,0.0007538281,0.00015400306,0.00057607354,8.106447e-7,0.00018093402,0.0045476635],"genre_scores_gemma":[0.78662646,0.0002594457,0.20634697,0.00073162286,0.0003625832,0.00017939621,0.000052226686,0.000027882137,0.0054134238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988818,0.000052564832,0.00017739808,0.0002816035,0.00024179605,0.00036480316],"domain_scores_gemma":[0.99928886,0.000068643996,0.000041484825,0.000327701,0.00017116884,0.000102170474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001357,0.000091781076,0.00010608064,0.00006862138,0.0002807684,0.00014742186,0.0004563572,0.00008270552,0.000016334036],"category_scores_gemma":[0.000015940024,0.0000860114,0.000052455245,0.000402575,0.00008417564,0.0004065779,0.00010659459,0.00014437207,0.000038367358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004298219,0.00005183093,0.000139866,0.000021302565,0.0000072407756,0.0000012442433,0.0009354009,0.95442,0.000019485022,0.02264177,0.012139921,0.009617659],"study_design_scores_gemma":[0.00037819985,0.00008263224,0.00013567146,0.000011459676,0.0000010071795,0.0000034509967,0.0000072385174,0.9875761,0.000043380838,0.00090696197,0.0107475165,0.000106343454],"about_ca_topic_score_codex":0.0000058047935,"about_ca_topic_score_gemma":0.0000028433478,"teacher_disagreement_score":0.78623587,"about_ca_system_score_codex":0.00003175992,"about_ca_system_score_gemma":0.000069480484,"threshold_uncertainty_score":0.3507443},"labels":[],"label_agreement":null},{"id":"W2603251541","doi":"10.1002/net.20332","title":"A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windows","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Mathematical optimization; Heuristic; Set (abstract data type); Computer science; Diversification (marketing strategy); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.009967092434046134,"score_gpt":0.24213027695610406,"score_spread":0.23216318452205792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603251541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001132509,0.00045086961,0.9958138,0.00033398034,0.00005611898,0.0007058597,0.000006989146,0.0004144485,0.001085424],"genre_scores_gemma":[0.7735234,0.000022246648,0.22535755,0.00043757068,0.00039527213,0.0000546305,0.00001720531,0.00007265035,0.00011949764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987096,0.00007505561,0.00021737842,0.00023702538,0.00017989194,0.0005810531],"domain_scores_gemma":[0.9990655,0.0004586159,0.000041740735,0.00026076328,0.000079299185,0.00009406143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008992765,0.00019677688,0.00020681808,0.00004332509,0.00027055733,0.00011438922,0.00017620069,0.00012566657,0.000025908788],"category_scores_gemma":[0.000018964174,0.00014767225,0.00005074737,0.00039399366,0.000025479747,0.00010659279,0.000022362176,0.00034228477,0.000004607556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013009329,0.000017353375,0.00037288215,0.000009414593,0.000027730306,0.0000010460003,0.00011466529,0.7934887,0.000057344103,0.00012137135,0.00015037633,0.20562613],"study_design_scores_gemma":[0.0013039451,0.00010457592,0.0017397869,0.000054789354,0.000032375177,0.0000051259553,0.000015200275,0.99585885,0.00012566637,0.000048847658,0.0005101016,0.00020073257],"about_ca_topic_score_codex":0.000002313891,"about_ca_topic_score_gemma":0.0000013545962,"teacher_disagreement_score":0.77239084,"about_ca_system_score_codex":0.000043579686,"about_ca_system_score_gemma":0.000026540954,"threshold_uncertainty_score":0.60218996},"labels":[],"label_agreement":null},{"id":"W2611167225","doi":"10.1002/net.21810","title":"Deterministic gathering with crash faults","year":2018,"lang":"en","type":"preprint","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Traverse; Computer science; Node (physics); Crash; Asynchrony (computer programming); Fault (geology); Enhanced Data Rates for GSM Evolution; Real-time computing; Distributed computing; Computer network; Computer security; Artificial intelligence; Engineering; Asynchronous communication","score_opus":0.018497622520054307,"score_gpt":0.2539627596083782,"score_spread":0.23546513708832392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611167225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008809648,0.00006912261,0.9885983,0.00015183627,0.0007342653,0.00028426189,0.0000012324563,0.00030097298,0.008979027],"genre_scores_gemma":[0.8019503,0.00012864626,0.19500919,0.00056745857,0.0008176226,0.00009133843,0.00002235838,0.00004828938,0.0013648064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847955,0.00007284086,0.00020756878,0.00058266753,0.0002780979,0.00037925786],"domain_scores_gemma":[0.99860156,0.000059417624,0.00013645056,0.00091134926,0.00014841135,0.00014283713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024051993,0.00022008226,0.00021686827,0.00006766653,0.00012132286,0.0003352224,0.0011903635,0.00022132773,0.000047295915],"category_scores_gemma":[0.000014976492,0.00018308919,0.000052273113,0.00018274668,0.000082014165,0.000110137305,0.0012547568,0.00053719245,0.000051427498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010557888,0.00004509947,0.0007243201,0.0000664748,0.00004753637,0.000057099427,0.0005178056,0.95712924,0.0000013863893,0.0017222838,0.002706287,0.0369719],"study_design_scores_gemma":[0.00016464817,0.00008865934,0.0004435612,0.00021644085,0.0000057727375,0.000010854364,0.0000023008333,0.9953066,0.0000041734997,0.0010713466,0.0024355156,0.00025011023],"about_ca_topic_score_codex":0.000008041759,"about_ca_topic_score_gemma":0.000019283254,"teacher_disagreement_score":0.8010693,"about_ca_system_score_codex":0.00003925158,"about_ca_system_score_gemma":0.00012457222,"threshold_uncertainty_score":0.74661607},"labels":[],"label_agreement":null},{"id":"W2626724472","doi":"10.1002/net.21750","title":"Minimizing the makespan in multiserver network restoration problems","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Computer science; Node (physics); Enhanced Data Rates for GSM Evolution; Computer network; Time complexity; Point (geometry); Mathematical optimization; Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.01925238439715593,"score_gpt":0.23652738013302543,"score_spread":0.2172749957358695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626724472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.395023,0.018212525,0.5220126,0.0042152703,0.008174565,0.0034160188,0.0000046737105,0.0054364866,0.04350485],"genre_scores_gemma":[0.9872921,0.00047811237,0.011426488,0.00005026343,0.00053955463,0.00008111867,0.000003766845,0.00004106997,0.000087530156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989725,0.000021885646,0.00023495402,0.00018311663,0.000104716295,0.00048284393],"domain_scores_gemma":[0.99897474,0.000114911025,0.00006667563,0.00079096045,0.000018463425,0.00003427729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023962873,0.00016366252,0.00016800585,0.0000245397,0.000310172,0.000137622,0.00055270555,0.0002052514,0.0000082037],"category_scores_gemma":[0.00008174833,0.0001288114,0.000038643226,0.00013643887,0.00013611541,0.00025877004,0.00013544435,0.00053634256,0.000015002243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048337483,0.000004314967,0.006657173,0.0000069035627,0.0000074884038,0.0000061338274,0.000029086466,0.95719945,0.000009596576,0.0012429298,0.0025278453,0.032304257],"study_design_scores_gemma":[0.0002459023,0.000013847584,0.035556383,0.000115512215,0.000005917137,0.0000019089885,0.00002290676,0.9509899,0.000006923307,0.0027122041,0.010140886,0.00018771098],"about_ca_topic_score_codex":0.000012335494,"about_ca_topic_score_gemma":0.0007592277,"teacher_disagreement_score":0.5922691,"about_ca_system_score_codex":0.00006579919,"about_ca_system_score_gemma":0.000004016321,"threshold_uncertainty_score":0.5252777},"labels":[],"label_agreement":null},{"id":"W2679747200","doi":"10.1002/net.21747","title":"Adaptive large neighborhood search algorithm for the rural postman problem with time windows","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"New Jersey Department of Transportation","keywords":"Computer science; Set (abstract data type); Mathematical optimization; Algorithm; Running time; Vehicle routing problem; Mathematics; Routing (electronic design automation)","score_opus":0.013644993020114597,"score_gpt":0.2563775742917052,"score_spread":0.24273258127159061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2679747200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028692555,0.00021207398,0.99431646,0.00018657379,0.0001639968,0.00074125873,0.00002080616,0.00022710199,0.0038448272],"genre_scores_gemma":[0.59310997,0.00005068916,0.40409628,0.000114486786,0.0011077039,0.00017651705,0.000035476845,0.00015766562,0.0011512394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989998,0.000049137503,0.00014680608,0.00015930668,0.00015955052,0.00048544482],"domain_scores_gemma":[0.9990174,0.0002247478,0.00005782733,0.00051972806,0.00010592038,0.0000743652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942362,0.00017143799,0.00017441784,0.000024966988,0.00061880174,0.00019433262,0.00041825484,0.00011472777,0.00004450369],"category_scores_gemma":[0.000016709524,0.00012019621,0.00005575322,0.00008105126,0.000057395922,0.00017540513,0.0000770724,0.00031706074,0.000016798851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021317415,0.000011575243,0.00041316057,0.000006024202,0.00009704471,0.0000018314279,0.00016319503,0.8478169,0.000006886715,0.00028435988,0.0009135685,0.15026413],"study_design_scores_gemma":[0.0008059237,0.00008964767,0.001685658,0.000040215175,0.000034716115,0.000006662248,0.00005714274,0.9962649,0.000034100456,0.000054269814,0.00075321854,0.00017355298],"about_ca_topic_score_codex":0.000009860549,"about_ca_topic_score_gemma":0.000008368744,"teacher_disagreement_score":0.592823,"about_ca_system_score_codex":0.000039630166,"about_ca_system_score_gemma":0.000021315625,"threshold_uncertainty_score":0.49014592},"labels":[],"label_agreement":null},{"id":"W2748787255","doi":"10.1002/net.21759","title":"Solving the large‐scale min–max K‐rural postman problem for snow plowing","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc routing; Computer science; Solver; Mathematical optimization; Arc (geometry); Vehicle routing problem; Travelling salesman problem; Variable (mathematics); Deck; Graph; Transformation (genetics); Heuristics; Enhanced Data Rates for GSM Evolution; Routing (electronic design automation); Mathematics; Algorithm; Theoretical computer science; Computer network; Artificial intelligence; Engineering","score_opus":0.01386496700881961,"score_gpt":0.2647827661948654,"score_spread":0.2509177991860458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748787255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029199708,0.0003514602,0.9636204,0.0006358192,0.0010971457,0.00052336033,0.000006413349,0.00043315414,0.0041325195],"genre_scores_gemma":[0.8627613,0.00003324848,0.13499284,0.00018699323,0.0010278706,0.00008391084,0.000017952516,0.00010229994,0.00079354335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989836,0.000041661762,0.00021484173,0.00015463923,0.00011095417,0.0004942871],"domain_scores_gemma":[0.99901664,0.00023040637,0.00007547925,0.00056089775,0.00005325671,0.00006329852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007636617,0.00015911329,0.00017214139,0.000024220544,0.0008463736,0.00027714483,0.00046101902,0.00013622614,0.000022292113],"category_scores_gemma":[0.00011045399,0.00013244149,0.00010148566,0.000057124347,0.000035605484,0.00020987127,0.00009778616,0.00026211486,0.000006654216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069314665,0.000008503662,0.002514638,0.000028203029,0.000038974715,0.000001091963,0.0006580886,0.96664405,0.00013611559,0.00024677452,0.0054035303,0.024313098],"study_design_scores_gemma":[0.0003727659,0.000013151113,0.0016853999,0.00008841281,0.000025731862,0.0000034971897,0.00012315497,0.9911046,0.00012491379,0.00014701096,0.0061365655,0.00017481818],"about_ca_topic_score_codex":0.000006152665,"about_ca_topic_score_gemma":0.000033044682,"teacher_disagreement_score":0.8335616,"about_ca_system_score_codex":0.00003741514,"about_ca_system_score_gemma":0.0000090466765,"threshold_uncertainty_score":0.6509707},"labels":[],"label_agreement":null},{"id":"W2749062520","doi":"10.1002/net.20192","title":"A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":203,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Consiglio Nazionale delle Ricerche; Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Tabu search; Heuristics; Mathematical optimization; Computer science; Minification; Heuristic; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.014262556199855739,"score_gpt":0.2389436817591051,"score_spread":0.22468112555924935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749062520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010314933,0.00027879642,0.98336756,0.00008496494,0.00026022427,0.0005007061,0.000003384642,0.00024960557,0.004939819],"genre_scores_gemma":[0.98907274,0.0000066757593,0.010393956,0.000115830255,0.0002309796,0.000015582445,0.000011542526,0.0000376352,0.00011503874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991623,0.000012278692,0.00016855235,0.00012954122,0.00013273694,0.00039458586],"domain_scores_gemma":[0.9992848,0.00043867392,0.000025397758,0.000117126496,0.000066201195,0.000067793284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135296,0.00011241049,0.00009838953,0.000031386717,0.0001972439,0.00005955363,0.000092649665,0.000055691133,0.000052623254],"category_scores_gemma":[0.000010823539,0.000081226935,0.000029677722,0.00019680835,0.00007091053,0.000046304067,0.000016940738,0.0002332224,0.0000068682334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001921824,0.0000059827585,0.00093090965,0.000016699281,0.000032005166,0.000002886848,0.00018896771,0.9858066,0.00005213347,0.0010591015,0.00047074942,0.011414787],"study_design_scores_gemma":[0.00057650055,0.000026602676,0.0003542832,0.00008408965,0.000015166603,0.000015582058,0.00004877845,0.99808276,0.00008885846,0.00003656487,0.0005489868,0.00012182388],"about_ca_topic_score_codex":0.0000076268675,"about_ca_topic_score_gemma":0.00002494307,"teacher_disagreement_score":0.9787578,"about_ca_system_score_codex":0.00003452299,"about_ca_system_score_gemma":0.000017989154,"threshold_uncertainty_score":0.33123383},"labels":[],"label_agreement":null},{"id":"W2770845104","doi":"10.1002/net.21792","title":"Open shortest path first routing under random early detection","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Open Shortest Path First; Path vector protocol; Shortest path problem; Equal-cost multi-path routing; Static routing; Private Network-to-Network Interface; Routing (electronic design automation); Constrained Shortest Path First; Link-state routing protocol; Computer network; Routing Information Protocol; Routing protocol; Mathematical optimization; Distributed computing; K shortest path routing; Mathematics; Theoretical computer science; Graph","score_opus":0.01773501321753399,"score_gpt":0.24342181495283888,"score_spread":0.2256868017353049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770845104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007899494,0.0001374723,0.98186314,0.0012894646,0.0015079037,0.00034553895,3.5028344e-7,0.00018725122,0.006769357],"genre_scores_gemma":[0.9971926,0.000032420885,0.00096273713,0.00044638253,0.00076645886,0.000048477923,0.0000010733525,0.0000137585985,0.0005360736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987112,0.0000641513,0.00022155793,0.00044098182,0.0001764286,0.00038568044],"domain_scores_gemma":[0.99839497,0.00016665025,0.00021191756,0.0010392986,0.0000621135,0.00012506395],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005527363,0.00015879853,0.00021849584,0.000023612802,0.0014126188,0.0023078506,0.0024496666,0.00012370863,0.000017595929],"category_scores_gemma":[0.000041614432,0.00014596917,0.00007611388,0.00009324776,0.000054387365,0.0009785054,0.0007154838,0.00026827664,0.000044474793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199195,0.000035660003,0.00444249,0.0000011331707,0.000039701987,0.000018792187,0.00010840172,0.06702939,0.000005255578,0.012543119,0.0013558882,0.9143582],"study_design_scores_gemma":[0.0017251208,0.000058169804,0.03200101,0.00004566734,0.000013555487,0.000008997582,0.000006007004,0.96213096,0.0000060482917,0.00066714274,0.003132229,0.00020508858],"about_ca_topic_score_codex":0.00018435808,"about_ca_topic_score_gemma":0.0005464315,"teacher_disagreement_score":0.9892931,"about_ca_system_score_codex":0.00003606352,"about_ca_system_score_gemma":0.000030148272,"threshold_uncertainty_score":0.9998874},"labels":[],"label_agreement":null},{"id":"W2808356940","doi":"10.1002/net.21928","title":"Minimum shared‐power edge cut","year":2020,"lang":"en","type":"preprint","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo; Collège Boréal","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Rectangle; Combinatorics; Time complexity; Mathematics; Unit disk graph; Undirected graph; Polynomial-time approximation scheme; Enhanced Data Rates for GSM Evolution; Bounded function; Dominating set; Matching (statistics); Approximation algorithm; Graph; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Wireless network; Wireless; Geometry; Vertex (graph theory)","score_opus":0.022143382076043324,"score_gpt":0.2493531432810017,"score_spread":0.22720976120495837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808356940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002483278,0.0031099338,0.9562506,0.0025538725,0.009921443,0.0008753747,0.000014234003,0.0011600122,0.025866184],"genre_scores_gemma":[0.94403195,0.0005203731,0.039375443,0.0068558147,0.0068381014,0.0004920876,0.00020793965,0.00019233134,0.0014859523],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954822,0.00019999343,0.00071319344,0.0019848028,0.0006215278,0.0009982924],"domain_scores_gemma":[0.9956954,0.00022798256,0.0004300718,0.0029717258,0.00016304327,0.00051175646],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00037146118,0.0007162781,0.0008062139,0.000097707416,0.00015223022,0.000877678,0.005070788,0.0010775062,0.00031442635],"category_scores_gemma":[0.00004722181,0.0007520881,0.0004324438,0.00056704716,0.000092892835,0.0003043324,0.00840181,0.0028078947,0.000492263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023911174,0.00010234526,0.00021817519,0.000083165905,0.0001861237,0.00033853823,0.0008150023,0.15527701,0.0000066121675,0.018467933,0.7818902,0.042590946],"study_design_scores_gemma":[0.00027106467,0.00007632861,0.00047913654,0.00024402117,0.000029147519,0.000015542335,0.00000492629,0.89589894,0.000010240231,0.0071532167,0.09499224,0.0008251973],"about_ca_topic_score_codex":0.000017463086,"about_ca_topic_score_gemma":0.000019031522,"teacher_disagreement_score":0.94378364,"about_ca_system_score_codex":0.00014746597,"about_ca_system_score_gemma":0.00026957114,"threshold_uncertainty_score":0.99961805},"labels":[],"label_agreement":null},{"id":"W2808768722","doi":"10.1002/net.21826","title":"Integer programming formulations for minimum deficiency interval coloring","year":2018,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; Edge coloring; Interval graph; Fractional coloring; Integer programming; Greedy coloring; Vertex (graph theory); Graph; Line graph; Pathwidth; Graph power; Algorithm","score_opus":0.025214227599909756,"score_gpt":0.2909210732592273,"score_spread":0.2657068456593175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808768722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024462225,0.000087173576,0.97144806,0.0000198289,0.00094267115,0.00030190212,0.0000012865966,0.00047775282,0.0022591122],"genre_scores_gemma":[0.7474984,0.000003264417,0.25176013,0.000026996173,0.0005209414,0.00006579557,0.0000077769655,0.0000357818,0.00008093702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920434,0.000017570977,0.00023108287,0.00014684281,0.000064351094,0.00033583134],"domain_scores_gemma":[0.9995027,0.0001461709,0.000032706914,0.00015699888,0.000106628635,0.000054759035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000333952,0.00011231879,0.00011921675,0.000058314945,0.00014191064,0.000059014932,0.00012547542,0.000098775876,0.000026589792],"category_scores_gemma":[0.00009260086,0.000117978845,0.000059233294,0.00026250363,0.000040233233,0.00011983548,0.000031818923,0.00012022606,0.000008701224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000972532,0.000013156656,0.000860994,0.000025575056,0.000015752194,2.6871473e-7,0.00040579826,0.89263535,0.00007659318,0.0013666993,0.0009893796,0.10360072],"study_design_scores_gemma":[0.00019190316,0.000065669854,0.00022849496,0.000033896737,0.000014010986,0.000002223129,0.00003933954,0.99202514,0.00017748469,0.00013812809,0.006950328,0.00013339816],"about_ca_topic_score_codex":0.0000014357067,"about_ca_topic_score_gemma":0.000009779154,"teacher_disagreement_score":0.72303617,"about_ca_system_score_codex":0.000058660786,"about_ca_system_score_gemma":0.000008686264,"threshold_uncertainty_score":0.48110378},"labels":[],"label_agreement":null},{"id":"W2809160987","doi":"10.1002/net.21827","title":"A two‐phase Pareto local search heuristic for the bi‐objective pollution‐routing problem","year":2018,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Pareto principle; Heuristic; Mathematical optimization; Routing (electronic design automation); Pollution; Phase (matter); Pareto optimal; Computer science; Multi-objective optimization; Mathematics; Chemistry; Ecology; Biology","score_opus":0.022229289596827535,"score_gpt":0.31266925528611006,"score_spread":0.29043996568928254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809160987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023619218,0.00028421244,0.99402946,0.00012025194,0.00052430754,0.0006237248,0.000010153498,0.0004054279,0.001640538],"genre_scores_gemma":[0.9386949,0.000017666018,0.05961876,0.00012894133,0.0012924235,0.00009173841,0.0000094610705,0.0000662261,0.000079919104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986828,0.00012231269,0.00027034426,0.00023379155,0.00016023831,0.00053048733],"domain_scores_gemma":[0.9988475,0.00055338966,0.000041503143,0.00028855068,0.00018220286,0.00008684617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010432269,0.00017278445,0.00017116181,0.000054091295,0.00040017007,0.00007788992,0.00021551232,0.000109313,0.000035943332],"category_scores_gemma":[0.00011715459,0.00014217547,0.00007126835,0.0004771687,0.00016476554,0.00007260724,0.00005826471,0.00030799006,0.000017226042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033257023,0.00001390425,0.00007914421,0.00001387997,0.00004951382,8.744956e-7,0.00048651246,0.93878925,0.000031949476,0.0009123056,0.00121601,0.058373384],"study_design_scores_gemma":[0.00093313557,0.00010037379,0.00017192852,0.000044494314,0.000037373913,0.000007737585,0.00023483367,0.9969859,0.00024341825,0.00018445206,0.00088748493,0.00016883615],"about_ca_topic_score_codex":0.000031791704,"about_ca_topic_score_gemma":0.000032222695,"teacher_disagreement_score":0.93633294,"about_ca_system_score_codex":0.00013544236,"about_ca_system_score_gemma":0.000037417914,"threshold_uncertainty_score":0.57977474},"labels":[],"label_agreement":null},{"id":"W2911859454","doi":"10.1002/net.21975","title":"The firebreak problem","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Memorial University of Newfoundland","funders":"Biotechnology and Biological Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Vertex (graph theory); Time complexity; Focus (optics); Class (philosophy); Graph; Metric dimension","score_opus":0.018747197674953257,"score_gpt":0.256820096351612,"score_spread":0.23807289867665876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911859454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018352477,0.0007632422,0.9781638,0.011976849,0.000118433265,0.00015896019,1.8365472e-7,0.00019522232,0.0084397765],"genre_scores_gemma":[0.97488475,0.0001811216,0.020680062,0.003090836,0.0004700075,0.000045732497,9.2151106e-7,0.000016977017,0.000629621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911004,0.0000777832,0.00009661053,0.00021677373,0.00018390699,0.00031489457],"domain_scores_gemma":[0.9992091,0.00023764266,0.00002826236,0.00036587258,0.000037993927,0.00012115105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024098251,0.00006597311,0.000060603044,0.000008393445,0.00026128147,0.00014924446,0.0012147351,0.00003122617,0.000006982306],"category_scores_gemma":[0.0000345428,0.000042839056,0.00003725741,0.00047808103,0.00007042225,0.00016729989,0.0003690921,0.0002429329,0.000073809104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001700326,0.000008315811,0.0002410599,0.0000033618433,0.0000122956935,0.0000133446465,0.00030136105,0.01513858,0.0000281846,0.5630807,0.020614173,0.4005416],"study_design_scores_gemma":[0.00013977209,0.00007454614,0.0002259386,0.000005336915,9.75499e-7,0.0000043046325,0.000012446891,0.7770358,0.000049978793,0.059570994,0.16277702,0.00010289115],"about_ca_topic_score_codex":0.0000010734357,"about_ca_topic_score_gemma":0.0000023699206,"teacher_disagreement_score":0.9747012,"about_ca_system_score_codex":0.0000088132665,"about_ca_system_score_gemma":0.000019637895,"threshold_uncertainty_score":0.22573002},"labels":[],"label_agreement":null},{"id":"W2913349045","doi":"10.1002/net.21873","title":"The Firefighter problem: Saving sets of vertices on cubic graphs","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"","keywords":"Combinatorics; Vertex (graph theory); Degree (music); Graph; Mathematics; Context (archaeology); Computer science; Independent set; Set (abstract data type); Discrete mathematics; Physics; Geography","score_opus":0.012337062270861938,"score_gpt":0.2658854493953632,"score_spread":0.25354838712450123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913349045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85109764,0.0039000125,0.0935903,0.0020157057,0.0021189216,0.0016895885,0.0000024498586,0.00037759313,0.04520778],"genre_scores_gemma":[0.99741256,0.000086128224,0.0019097677,0.00013857461,0.000025146708,0.000016052938,6.42248e-7,0.000009956705,0.00040117346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00012719154,0.00017480015,0.00027345878,0.00032733096,0.00038346986],"domain_scores_gemma":[0.99840295,0.0006218353,0.000084038584,0.00077204884,0.00006378719,0.000055352994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051330216,0.00010263306,0.00012155898,0.000058345482,0.0001500987,0.00008268799,0.0011115907,0.000054574375,0.000016219272],"category_scores_gemma":[0.000017235767,0.00006499812,0.00006804811,0.0004690013,0.00008511321,0.00024692353,0.0002482249,0.00026233695,0.000061165505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011893287,0.000087795415,0.009959433,0.000040836032,0.000065161395,0.000007978793,0.00054986187,0.03465993,0.0007992477,0.69945306,0.00238839,0.2518694],"study_design_scores_gemma":[0.0010987447,0.0009402641,0.019737922,0.00040113446,0.000011648702,0.000011266527,0.00005644174,0.5325823,0.0023442572,0.42228943,0.019949805,0.0005768357],"about_ca_topic_score_codex":0.000004396834,"about_ca_topic_score_gemma":0.000009663016,"teacher_disagreement_score":0.49792233,"about_ca_system_score_codex":0.0000156224,"about_ca_system_score_gemma":0.000018858063,"threshold_uncertainty_score":0.26505467},"labels":[],"label_agreement":null},{"id":"W2916653839","doi":"10.1002/net.21925","title":"Primal column generation framework for vehicle and crew scheduling problems","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew scheduling; Column generation; Scheduling (production processes); Crew; Column (typography); Computer science; Operations research; Aeronautics; Engineering; Operations management; Mathematics; Mathematical optimization","score_opus":0.03948768764023189,"score_gpt":0.26363793227351073,"score_spread":0.22415024463327884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916653839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025171231,0.00082801573,0.97263885,0.00034589812,0.0002136384,0.00031822472,0.0000020153948,0.00034898924,0.0001331411],"genre_scores_gemma":[0.5116333,0.000057884605,0.48714352,0.00029699237,0.00078424014,0.00003195985,0.000011339752,0.00003545551,0.000005330783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993419,0.000028759405,0.00017897188,0.00017598104,0.00006951084,0.00020488072],"domain_scores_gemma":[0.99962777,0.000114789334,0.000030558273,0.00008845434,0.000038880917,0.000099555764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019160415,0.00010349611,0.0001332767,0.0000148135005,0.0000953153,0.000087414446,0.000063133186,0.00015683366,0.000017841983],"category_scores_gemma":[0.00012169702,0.00012137921,0.000027237715,0.00016437093,0.000015369202,0.000089856934,0.000022730863,0.00020099449,0.0000022144088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000446749,0.0000028461413,0.0005021633,0.00004044931,0.000013564741,2.4630188e-7,0.00020203576,0.98041886,0.00082134665,0.0009769812,0.00034302459,0.01667402],"study_design_scores_gemma":[0.00023093262,0.000035859808,0.00015335876,0.00002764447,0.0000138384985,7.509974e-7,0.000011430365,0.9977864,0.00049509335,0.00019055848,0.00092073187,0.0001333877],"about_ca_topic_score_codex":8.1081845e-7,"about_ca_topic_score_gemma":0.0000010682686,"teacher_disagreement_score":0.48646206,"about_ca_system_score_codex":0.000020139409,"about_ca_system_score_gemma":0.000008349349,"threshold_uncertainty_score":0.49497008},"labels":[],"label_agreement":null},{"id":"W2951116686","doi":"10.1002/net.21892","title":"Monotonicity and conformality in multicommodity network‐flow problems","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"General Motors Foundation","keywords":"Monotonic function; Convexity; Multi-commodity flow problem; Mathematics; Flow network; Mathematical optimization; Graph; Regular polygon; Flow (mathematics); Directed graph; Computation; Convex function; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.007329042674740536,"score_gpt":0.18980885818341406,"score_spread":0.1824798155086735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951116686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93147117,0.00053015305,0.0067817764,0.0010309573,0.0012039156,0.002964239,0.000001184365,0.00031520575,0.055701375],"genre_scores_gemma":[0.996364,0.00003154508,0.00028515194,0.002119145,0.0007326536,0.00006155542,0.00003144924,0.000026739062,0.00034774127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983773,0.000023859144,0.00033939118,0.00038007656,0.00019653098,0.0006828177],"domain_scores_gemma":[0.99929655,0.0000730599,0.00016020905,0.00037797136,0.00007295604,0.000019231988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010985757,0.00022484665,0.0003001239,0.00012772993,0.00010811141,0.00027836536,0.0002490605,0.0001278626,0.00023412216],"category_scores_gemma":[0.000031102783,0.00022205614,0.00004957619,0.0004784496,0.000054519165,0.00094079017,0.0005545081,0.00032805096,0.00009142847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039632247,0.00004697111,0.40936697,0.00022605214,0.000015291205,0.0000081735,0.00003250039,0.57056785,5.0826264e-7,0.0078090318,0.0029534034,0.008933601],"study_design_scores_gemma":[0.0009368398,0.000006845343,0.12392951,0.000049066686,0.0000134434285,4.3791397e-7,0.00013694614,0.81296766,1.8434274e-7,0.0023149247,0.05940976,0.00023436353],"about_ca_topic_score_codex":0.0012586499,"about_ca_topic_score_gemma":0.0006529164,"teacher_disagreement_score":0.28543746,"about_ca_system_score_codex":0.00007984802,"about_ca_system_score_gemma":0.000010921721,"threshold_uncertainty_score":0.90551865},"labels":[],"label_agreement":null},{"id":"W2951951756","doi":"10.1002/net.20074","title":"An approximation algorithm for Stackelberg network pricing","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Toll; Relaxation (psychology); Linear programming relaxation; Set (abstract data type); Approximation algorithm; Computer science; Constraint (computer-aided design); Flow network; Algorithm; Combinatorics; Mathematics; Mathematical optimization; Linear programming; Mathematical economics","score_opus":0.01407393180372267,"score_gpt":0.29096143431612065,"score_spread":0.27688750251239796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951951756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015723694,0.00012257838,0.99413645,0.00028684412,0.00031005158,0.00028768205,0.0000031410507,0.00018257729,0.0030983312],"genre_scores_gemma":[0.5610772,0.00009597276,0.43205303,0.00047983095,0.004973244,0.000059074508,0.00038823127,0.000022396087,0.0008510597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992139,0.000060728085,0.00015750967,0.0001509281,0.00014467591,0.0002722832],"domain_scores_gemma":[0.9995839,0.000084628875,0.00007859165,0.000083321946,0.00008960664,0.00007996707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055867934,0.000065118074,0.00007946973,0.000024223302,0.0005302889,0.00007559093,0.00009313862,0.00011043428,0.000040504565],"category_scores_gemma":[0.000012546972,0.000070199596,0.000031181287,0.00021213456,0.000032913395,0.0003424009,0.0000016330354,0.00007008598,0.000003898533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047554545,0.000015799613,0.0006423025,0.000001111387,0.000003718482,9.779611e-8,0.0019688602,0.7272051,3.570216e-7,0.0045675626,0.0021975823,0.26339278],"study_design_scores_gemma":[0.00019819448,0.000024396524,0.0011560294,0.000012326378,0.000012348443,9.397627e-8,0.00035441323,0.93320245,0.000002306436,0.0002997573,0.064637914,0.00009976031],"about_ca_topic_score_codex":0.000070547154,"about_ca_topic_score_gemma":0.0006087623,"teacher_disagreement_score":0.5620834,"about_ca_system_score_codex":0.000042711243,"about_ca_system_score_gemma":0.0000391773,"threshold_uncertainty_score":0.40786073},"labels":[],"label_agreement":null},{"id":"W2965180164","doi":"10.1002/net.22068","title":"Constraint programming approaches for the discretizable molecular distance geometry problem","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Discretization; Integer programming; Vertex (graph theory); Constraint satisfaction problem; Computational geometry; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type)","score_opus":0.06243605348160239,"score_gpt":0.3252412656153425,"score_spread":0.2628052121337401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965180164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005300719,0.0016881691,0.9947049,0.0009164838,0.00006966889,0.0010205668,0.0000092037235,0.000086985056,0.0014509857],"genre_scores_gemma":[0.045859635,0.000080640624,0.9501426,0.00008826855,0.00017134003,0.0007314827,0.00005147034,0.000068727095,0.0028058176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863636,0.00006390535,0.0002493852,0.00031211105,0.0002717137,0.000466543],"domain_scores_gemma":[0.99840003,0.00081095326,0.00009289098,0.00042261073,0.00019521937,0.00007826688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043143067,0.00014587233,0.00018861066,0.000024599072,0.00024356865,0.00013743497,0.00022452851,0.000092452145,0.0000597896],"category_scores_gemma":[0.00042208366,0.000107853666,0.00010132446,0.00050233834,0.00017008347,0.00007723369,0.000113763606,0.0002763643,0.0000017182027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025443018,0.00016466525,0.00008428095,0.00018854582,0.00013903408,0.000024373203,0.00017033973,0.39672384,0.000012000887,0.37393013,0.0014832505,0.22705412],"study_design_scores_gemma":[0.00048713505,0.000028008199,0.000005833623,0.00006685148,0.00004097856,0.000018474644,0.00076071796,0.92511034,0.00028373246,0.046501834,0.02648101,0.00021507872],"about_ca_topic_score_codex":8.155458e-7,"about_ca_topic_score_gemma":0.000008293135,"teacher_disagreement_score":0.52838653,"about_ca_system_score_codex":0.00005318796,"about_ca_system_score_gemma":0.00007221935,"threshold_uncertainty_score":0.4398145},"labels":[],"label_agreement":null},{"id":"W2981501323","doi":"10.1002/net.21916","title":"A strong formulation for the graph partition problem","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Mathematics; Graph; Partition (number theory); Graph partition; Polynomial; Arc (geometry); Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.021722439373429485,"score_gpt":0.28571800753224563,"score_spread":0.26399556815881614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981501323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022079078,0.0001570492,0.99538445,0.00035942846,0.00020066199,0.0007810206,6.1926346e-7,0.00007337547,0.00083545933],"genre_scores_gemma":[0.98620844,0.000014493894,0.013165066,0.00009291939,0.000096555894,0.00014294931,0.000004768278,0.000007399912,0.0002673964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992463,0.00003517756,0.00010314834,0.00019207782,0.00014865298,0.00027464668],"domain_scores_gemma":[0.99914265,0.00032208127,0.000047507037,0.00038981732,0.000066530614,0.000031430147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042661908,0.00006316731,0.00006183014,0.000036499372,0.00014789333,0.00008400534,0.00042472323,0.000040158044,0.000010752114],"category_scores_gemma":[0.000008834444,0.00004357126,0.00005760224,0.00029335072,0.000014686348,0.00040286608,0.00008199357,0.00011570903,0.000017361428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019076533,0.000009539561,0.0007827341,0.0000060477396,0.00000943756,1.3334488e-7,0.0000650118,0.1463214,0.00004254255,0.80133533,0.00044589443,0.050962847],"study_design_scores_gemma":[0.0002348571,0.000074109674,0.0010632285,0.000009884436,0.0000022142506,9.888672e-7,0.0000095075475,0.84579295,0.000048176822,0.14958112,0.0031226578,0.00006028796],"about_ca_topic_score_codex":0.0000018323349,"about_ca_topic_score_gemma":0.000007009901,"teacher_disagreement_score":0.98400056,"about_ca_system_score_codex":0.000016866514,"about_ca_system_score_gemma":0.000012295508,"threshold_uncertainty_score":0.17767845},"labels":[],"label_agreement":null},{"id":"W3008084469","doi":"10.1002/net.21934","title":"Dual‐failure restorability analysis of span‐restorable meta‐mesh networks","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Spare part; Span (engineering); Traverse; Maximization; Dual (grammatical number); Mesh networking; Mathematical optimization; Mathematics; Structural engineering; Operations management; Engineering","score_opus":0.0225329069802534,"score_gpt":0.2277012994942235,"score_spread":0.2051683925139701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008084469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034976874,0.008408646,0.9506274,0.00081147143,0.00040854677,0.00045428023,0.000023011658,0.0027817523,0.0015080508],"genre_scores_gemma":[0.9785459,0.0005415243,0.020272903,0.00016617753,0.00029573977,0.00004538573,0.00004219743,0.00006683437,0.000023326164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789464,0.0000631291,0.00061928463,0.0004950198,0.00027528682,0.00065265625],"domain_scores_gemma":[0.99840504,0.00035376797,0.000114396564,0.000807076,0.000096175325,0.00022353686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024318605,0.0003838463,0.0011847465,0.00014229534,0.00006955818,0.000031401538,0.0004361431,0.0004549336,0.00026002224],"category_scores_gemma":[0.00016047023,0.0003595678,0.0005178713,0.0033242756,0.00021482041,0.00018979915,0.00017797912,0.00083894905,0.000009079841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002200741,0.000019172385,0.001964713,0.000027712542,0.0035519744,0.000012704805,0.000029879295,0.98385346,0.000029334915,0.0013947012,0.0066645104,0.0024298197],"study_design_scores_gemma":[0.00015520684,0.000061951236,0.0013826935,0.000010260502,0.00365678,8.247469e-7,0.000039176335,0.9884387,0.000043538184,0.00025533154,0.0056227082,0.0003328039],"about_ca_topic_score_codex":0.000009558461,"about_ca_topic_score_gemma":0.00009979317,"teacher_disagreement_score":0.94356906,"about_ca_system_score_codex":0.00007529232,"about_ca_system_score_gemma":0.000010947792,"threshold_uncertainty_score":0.9998856},"labels":[],"label_agreement":null},{"id":"W3015867196","doi":"10.1002/net.21938","title":"Rational roots of all‐terminal reliability","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Terminal (telecommunication); Spanning tree; Rational number; Moduli; Class (philosophy); Reliability (semiconductor); Discrete mathematics; Graph; Order (exchange); Computer science","score_opus":0.009746665294790957,"score_gpt":0.20200839948166663,"score_spread":0.19226173418687567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015867196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12647027,0.00024041858,0.8650424,0.0010541521,0.00045441563,0.0002578386,0.0000073783594,0.00026835,0.00620479],"genre_scores_gemma":[0.99643135,0.00006256034,0.0031294322,0.00016405745,0.00016304865,0.000006193201,0.000022091364,0.000009370086,0.00001192284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952847,0.000013531673,0.00017270472,0.000098010394,0.000080426464,0.00010686658],"domain_scores_gemma":[0.9997479,0.000032802247,0.000020578364,0.00010273115,0.000042851803,0.000053138767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008343174,0.00006300133,0.000101656195,0.000007925074,0.000012786002,0.0000072019498,0.000068722526,0.000066201355,0.000092095106],"category_scores_gemma":[0.0000489636,0.00006173149,0.000038827475,0.00009514962,0.000028604369,0.000083544095,0.000013565939,0.000106586805,0.000006272366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001404274,0.0000072004937,0.00039204952,0.000032045948,0.0000058728374,5.6116886e-7,0.000054989097,0.99369544,0.00015021974,0.0003391817,0.0033377197,0.0019706793],"study_design_scores_gemma":[0.00011907734,0.000027588003,0.0037008617,0.000009452053,0.0000065138115,6.722301e-7,0.00000664638,0.99157935,0.00011472854,0.00017790605,0.004195082,0.00006213921],"about_ca_topic_score_codex":0.0000018083929,"about_ca_topic_score_gemma":0.0000016491337,"teacher_disagreement_score":0.8699611,"about_ca_system_score_codex":0.000017546634,"about_ca_system_score_gemma":0.000008212271,"threshold_uncertainty_score":0.2517337},"labels":[],"label_agreement":null},{"id":"W3037764692","doi":"10.1002/net.21964","title":"Routing electric vehicles with a single recharge per route","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Deutsche Forschungsgemeinschaft","keywords":"Groundwater recharge; Computer science; Driving range; Routing (electronic design automation); Heuristic; Range (aeronautics); Parking lot; Suite; Operations research; Mathematical optimization; Power (physics); Electric vehicle; Engineering; Mathematics; Computer network","score_opus":0.01957702120302509,"score_gpt":0.2200015023775971,"score_spread":0.200424481174572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037764692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060599618,0.0004579686,0.93245006,0.00028104873,0.00011360885,0.00015733534,0.0000012484588,0.0012221931,0.0047169053],"genre_scores_gemma":[0.93521434,0.000031335418,0.06370541,0.00044075915,0.00046161606,0.000009420314,0.0000079204565,0.00008558874,0.0000436157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896455,0.0000667968,0.00020521291,0.00022544386,0.00014420038,0.0003937842],"domain_scores_gemma":[0.99953276,0.000093969866,0.000043128326,0.00015849622,0.000036384616,0.00013527455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019076382,0.00017607166,0.00019561432,0.000036537243,0.000089596644,0.000070857255,0.00014425669,0.00011875598,0.0000496776],"category_scores_gemma":[0.00004980411,0.0001687872,0.000040839597,0.0005981827,0.000012667914,0.000115743285,0.000026559495,0.0003695752,0.000026142616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014010904,0.000008067157,0.0021826532,0.000013830818,0.000029610766,0.0000056939693,0.00030133454,0.9740515,0.0031561635,0.00009977019,0.0007515047,0.019385882],"study_design_scores_gemma":[0.000276321,0.000069131216,0.00051490247,0.000027256187,0.000020641835,0.000007060029,0.000024543559,0.9954847,0.0015712025,0.000007898982,0.0017721022,0.00022422937],"about_ca_topic_score_codex":0.0000029590708,"about_ca_topic_score_gemma":0.0000016085633,"teacher_disagreement_score":0.8746147,"about_ca_system_score_codex":0.00006765709,"about_ca_system_score_gemma":0.000013595182,"threshold_uncertainty_score":0.68829423},"labels":[],"label_agreement":null},{"id":"W3049700057","doi":"10.1002/net.21977","title":"Network reliability: Heading out on the highway","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variety (cybernetics); Reliability (semiconductor); Computer science; Graph theory; Probabilistic logic; Network analysis; Commutative property; Theoretical computer science; Enumeration; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence; Engineering","score_opus":0.04651461942591406,"score_gpt":0.28036012648991504,"score_spread":0.23384550706400098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049700057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015433193,0.00027379388,0.9516501,0.036579117,0.000658873,0.00033037603,5.337482e-7,0.00039249848,0.008571384],"genre_scores_gemma":[0.9791683,0.000025459232,0.0052733603,0.014064493,0.0011592906,0.000034035496,0.0000011457703,0.000020443425,0.0002534619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980366,0.00031578165,0.00019149412,0.00050708966,0.0003544822,0.00059450854],"domain_scores_gemma":[0.99770874,0.0010978684,0.00005699258,0.0008914799,0.000054999826,0.00018994593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587265,0.0001516002,0.0001658075,0.000019481038,0.0003305811,0.00015633747,0.0015327391,0.00007580815,0.000036972106],"category_scores_gemma":[0.00020999303,0.000102341095,0.00008229099,0.0007402795,0.00011101439,0.00019429474,0.00048480785,0.00066978,0.00022029913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004871841,0.000019170295,0.00059901294,0.000004837018,0.000013181601,0.00001785955,0.00047561768,0.3150227,0.000018237723,0.5996983,0.061784424,0.022297943],"study_design_scores_gemma":[0.0001825163,0.00019396571,0.00028315044,0.000035711204,0.0000029555565,0.0000018418076,0.000018189075,0.8260808,0.000074084404,0.104917176,0.06798605,0.0002235431],"about_ca_topic_score_codex":0.0000012273777,"about_ca_topic_score_gemma":0.0000019106976,"teacher_disagreement_score":0.977625,"about_ca_system_score_codex":0.000035480916,"about_ca_system_score_gemma":0.000026393362,"threshold_uncertainty_score":0.41733485},"labels":[],"label_agreement":null},{"id":"W3081818585","doi":"10.1002/net.21987","title":"Plowing with precedence in polynomial time","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología; Bundesministerium für Bildung und Forschung; Deutscher Akademischer Austauschdienst","keywords":"Heuristics; Traverse; Tree traversal; Time complexity; Computer science; State (computer science); Mathematical optimization; Polynomial; Mathematics; Algorithm; Geography; Cartography","score_opus":0.008302955797465502,"score_gpt":0.17694568193358984,"score_spread":0.16864272613612433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081818585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053189695,0.00008985386,0.9791639,0.0030610028,0.00018255772,0.00017720042,7.876204e-7,0.0002299363,0.011775783],"genre_scores_gemma":[0.9566025,0.000016721908,0.039342742,0.0027495315,0.0006377111,0.000012603775,0.000010458809,0.000014199603,0.0006134872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993311,0.000019378893,0.000085950574,0.0002502773,0.0001158693,0.00019738532],"domain_scores_gemma":[0.999693,0.000022788663,0.0000235137,0.00019419266,0.0000063158404,0.00006022123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008737108,0.00007125919,0.000084395084,0.000023277753,0.00003042693,0.00014716115,0.00064180675,0.000023055925,0.00001691097],"category_scores_gemma":[0.000005859496,0.000060935174,0.000013491148,0.00038931667,0.000013172116,0.0005934691,0.000273667,0.000115877876,0.00008116773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109377455,0.00012598523,0.011385286,0.000031825373,0.000064447704,0.00047236218,0.0020928276,0.12740183,0.00014167107,0.0057338146,0.12239541,0.73004514],"study_design_scores_gemma":[0.0002525813,0.00006310155,0.0013681806,0.000020605872,0.000001856239,9.394624e-7,0.0000049103182,0.989701,0.000016676286,0.00001538952,0.008449996,0.000104763945],"about_ca_topic_score_codex":0.0000084902695,"about_ca_topic_score_gemma":0.0000052985188,"teacher_disagreement_score":0.9512836,"about_ca_system_score_codex":0.000009456215,"about_ca_system_score_gemma":0.000011039736,"threshold_uncertainty_score":0.24848643},"labels":[],"label_agreement":null},{"id":"W3084549995","doi":"10.1002/net.21984","title":"The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Metaheuristic; Computer science; Integer programming; Routing (electronic design automation); Set (abstract data type); Graph; Mathematics; Theoretical computer science; Computer network","score_opus":0.01018283057323346,"score_gpt":0.2019510239074673,"score_spread":0.19176819333423384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084549995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06485119,0.00045019115,0.9234628,0.00021938486,0.00026799706,0.0003529958,0.0000032089029,0.0011927471,0.009199463],"genre_scores_gemma":[0.85247254,0.000084549625,0.14515881,0.0003224069,0.0008996736,0.000048025617,0.000034151864,0.00017427963,0.0008055344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854416,0.00013449638,0.00030938364,0.0002487089,0.0002280075,0.00053522276],"domain_scores_gemma":[0.9990758,0.0003800605,0.00007920526,0.00022293707,0.00007497678,0.00016703403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052250276,0.00022998532,0.0002146947,0.00002326126,0.00027106117,0.00016812127,0.00026851625,0.00014182448,0.000010827519],"category_scores_gemma":[0.000120784316,0.0001729938,0.000049066344,0.00049023924,0.000047372265,0.00010831871,0.000052418738,0.00046890287,0.000029288241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043396226,0.0000035311664,0.00079261686,0.000011136953,0.00007346238,0.0000067480514,0.0004314651,0.9889555,0.0004062246,0.00011817389,0.0046306904,0.004566097],"study_design_scores_gemma":[0.00041705102,0.0000412843,0.00028853165,0.000025634714,0.0000311775,0.000009706968,0.00009307398,0.996472,0.000586375,0.000018241042,0.0019188937,0.000098044686],"about_ca_topic_score_codex":0.0000045374168,"about_ca_topic_score_gemma":0.00000741334,"teacher_disagreement_score":0.7876214,"about_ca_system_score_codex":0.00004541797,"about_ca_system_score_gemma":0.000018760458,"threshold_uncertainty_score":0.7054482},"labels":[],"label_agreement":null},{"id":"W3098853299","doi":"10.1002/net.22004","title":"Roots of two‐terminal reliability polynomials","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terminal (telecommunication); Mathematics; Reliability (semiconductor); Combinatorics; Spanning tree; Graph; Path (computing); Discrete mathematics; Computer science; Computer network","score_opus":0.04322838962037749,"score_gpt":0.31648656952860466,"score_spread":0.27325817990822715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098853299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615889,0.000058906087,0.031643394,0.0007845963,0.00006721427,0.00026183174,0.000009837593,0.00008775936,0.005497549],"genre_scores_gemma":[0.99639726,0.0000036397676,0.003106355,0.00020260774,0.00021118409,0.000015677488,0.000002847645,0.000009862711,0.000050542323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.000058356705,0.0002343365,0.0001404529,0.00007003348,0.000119254815],"domain_scores_gemma":[0.9992618,0.00027576377,0.00010084245,0.00025562383,0.000031784515,0.0000742068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023166071,0.00007247664,0.00017064282,0.000009625653,0.000043204946,0.0000063004823,0.0001487838,0.00005263498,0.00013910142],"category_scores_gemma":[0.00011094934,0.0000654611,0.000077722696,0.00014639641,0.00006321812,0.000030526844,0.00004051092,0.00011513774,0.000012057468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007307965,0.00015114222,0.0027194843,0.000075852506,0.000025310641,0.0000024691888,0.00033060898,0.0017476266,0.0013432979,0.97758114,0.011529737,0.004420222],"study_design_scores_gemma":[0.00069470576,0.00011330986,0.0028817244,0.000042561594,0.00009677556,0.0000053913163,0.00006525307,0.017185245,0.0023682825,0.97133017,0.0049844766,0.00023210797],"about_ca_topic_score_codex":0.0000034274872,"about_ca_topic_score_gemma":0.0000029778007,"teacher_disagreement_score":0.03480837,"about_ca_system_score_codex":0.000005189977,"about_ca_system_score_gemma":0.000010784491,"threshold_uncertainty_score":0.26694262},"labels":[],"label_agreement":null},{"id":"W3122956505","doi":"10.1002/net.20177","title":"Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":310,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Pickup; Computer science; Branch and cut; Vehicle routing problem; Set (abstract data type); Mathematical optimization; Limit (mathematics); Algorithm; Time limit; Running time; Integer programming; Mathematics; Routing (electronic design automation); Computer network; Engineering; Artificial intelligence","score_opus":0.01662834278793372,"score_gpt":0.23147513826401478,"score_spread":0.21484679547608107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122956505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05054317,0.0015672012,0.9468042,0.000018826291,0.000052704036,0.00033473354,0.0000025615243,0.0001634142,0.00051316636],"genre_scores_gemma":[0.65920776,0.00039486698,0.33976024,0.00009284737,0.0002406924,0.000025134626,0.0000111829595,0.00007446707,0.00019281101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993294,0.0000143115285,0.00014888382,0.00017974486,0.00006632401,0.0002613632],"domain_scores_gemma":[0.9995797,0.00016789921,0.000025732274,0.00009508422,0.000037339443,0.00009423259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042005494,0.00013390945,0.00016214084,0.00004323646,0.00007361988,0.000045947472,0.00003721015,0.00011579757,0.0000030182155],"category_scores_gemma":[0.0000059070912,0.00012438305,0.000012307964,0.00009506296,0.0000418133,0.0001413663,0.000022964741,0.000125194,3.6611854e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017719152,0.0000034418024,0.0004586689,0.000036961348,0.000025718959,9.607946e-7,0.00017874442,0.9220534,0.000051228308,0.00004854455,0.00009655994,0.07702807],"study_design_scores_gemma":[0.00067929743,0.000052637533,0.0005760846,0.000050766677,0.000023842023,0.000021963835,0.00000919026,0.997842,0.000047860645,0.00022559018,0.00030796824,0.00016277675],"about_ca_topic_score_codex":0.0000056891413,"about_ca_topic_score_gemma":0.000011269618,"teacher_disagreement_score":0.6086646,"about_ca_system_score_codex":0.000014493816,"about_ca_system_score_gemma":0.00000501518,"threshold_uncertainty_score":0.5072193},"labels":[],"label_agreement":null},{"id":"W3125310543","doi":"10.1002/net.10067","title":"The single‐vehicle routing problem with unrestricted backhauls","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Computer science; Backhaul (telecommunications); Vehicle routing problem; Mathematical optimization; Set (abstract data type); Revenue; Routing (electronic design automation); Mathematics; Computer network; Economics","score_opus":0.010873064014029878,"score_gpt":0.21076196657672738,"score_spread":0.1998889025626975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125310543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02237178,0.00090080785,0.9314812,0.000088904104,0.00037306634,0.00035221063,7.218104e-7,0.0009610309,0.043470304],"genre_scores_gemma":[0.92209524,0.00005873578,0.07723858,0.0000511171,0.00012206166,0.00002057929,0.000003223624,0.00007451958,0.00033593937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988095,0.00016226569,0.00024125974,0.00016673472,0.00016148775,0.00045875114],"domain_scores_gemma":[0.9991625,0.00034916308,0.000054719105,0.00028802035,0.00006596966,0.000079627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052236824,0.00016428175,0.00013011204,0.000026420546,0.0002579918,0.00013842183,0.00015591837,0.00010523622,0.000019331881],"category_scores_gemma":[0.000080983526,0.00011853875,0.000030706047,0.0006099806,0.00004317854,0.000088613604,0.000016560027,0.00031332643,0.000009336502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004468487,0.000008515449,0.0018923221,0.0000044623575,0.000024491434,0.0000026751352,0.00005078105,0.97968286,0.00013173067,0.0010789637,0.00065184763,0.016466876],"study_design_scores_gemma":[0.00038712597,0.000041310945,0.0009812639,0.00004582665,0.000018319864,0.000014785498,0.000050738985,0.984314,0.0006045274,0.000104043975,0.013201814,0.0002361893],"about_ca_topic_score_codex":0.0000027864216,"about_ca_topic_score_gemma":0.00001422007,"teacher_disagreement_score":0.8997235,"about_ca_system_score_codex":0.00007427236,"about_ca_system_score_gemma":0.000017700537,"threshold_uncertainty_score":0.48338702},"labels":[],"label_agreement":null},{"id":"W3164058326","doi":"10.1002/net.22055","title":"The node cop‐win reliability of unicyclic and bicyclic graphs","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Graph; Random graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.003734307403357608,"score_gpt":0.18515590220383016,"score_spread":0.18142159480047254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164058326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9038971,0.011682345,0.06346691,0.0012266013,0.0014940844,0.00042929107,0.00000855292,0.00033201132,0.017463094],"genre_scores_gemma":[0.9926182,0.006187261,0.00095448643,0.00004627495,0.000036317204,0.000009529104,0.000007764778,0.000013474645,0.0001267029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993838,0.00004512738,0.00019976843,0.00012943217,0.00007098655,0.00017085907],"domain_scores_gemma":[0.99933314,0.000199874,0.00002545005,0.0003358851,0.00006704356,0.00003858923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023303491,0.000080048136,0.00012401993,0.000012763453,0.00007261659,0.000022924487,0.000076037846,0.000089661575,0.000014299519],"category_scores_gemma":[0.000111698086,0.0000613629,0.00004398497,0.0002438294,0.00010842911,0.000057456018,0.000033665812,0.00015525395,0.0000015027694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001045972,0.000016439702,0.0048214938,0.000048967857,0.000018180359,0.0000014128492,0.000077965036,0.9790853,0.00019798518,0.0021080784,0.0027358423,0.010877861],"study_design_scores_gemma":[0.00028934097,0.000017205224,0.015642628,0.0000554798,0.000021657728,0.000005113087,0.00006643088,0.9649657,0.00063018344,0.0040374845,0.014123711,0.0001450874],"about_ca_topic_score_codex":0.000011492726,"about_ca_topic_score_gemma":0.00003670073,"teacher_disagreement_score":0.088721074,"about_ca_system_score_codex":0.000018598677,"about_ca_system_score_gemma":0.000010519949,"threshold_uncertainty_score":0.25023064},"labels":[],"label_agreement":null},{"id":"W3170330333","doi":"10.1002/net.22059","title":"The multifacility center problems with random demand weights","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Probabilistic logic; Center (category theory); Computer science; Upper and lower bounds; Value (mathematics); Expected value; Mathematics; Algorithm; Statistics; Artificial intelligence; Machine learning","score_opus":0.01226411070774614,"score_gpt":0.19377947953755922,"score_spread":0.1815153688298131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170330333","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3668332,0.0068251663,0.25219947,0.029357871,0.012357085,0.0048296866,0.000011871565,0.0014178733,0.32616776],"genre_scores_gemma":[0.9922223,0.00020912358,0.00008835068,0.0017489541,0.00090644177,0.000073834606,0.000083819534,0.000015455333,0.0046516834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891895,0.000024686955,0.00023597451,0.00028568393,0.00022870333,0.0003060198],"domain_scores_gemma":[0.99918807,0.00003151511,0.00004934356,0.00038552747,0.00033129973,0.000014243415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041613786,0.00014442782,0.00013221364,0.000025952759,0.00047143272,0.0003088821,0.00017774115,0.000044025834,0.0003593915],"category_scores_gemma":[0.000058551486,0.00008791573,0.00006627114,0.00033471812,0.00006512,0.00032312554,0.00012823365,0.00013401377,0.00021597213],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011537633,0.0010953695,0.19415669,0.0008042541,0.00071324926,0.000058402675,0.00027771367,0.35855964,0.00002033692,0.049410716,0.26256904,0.13118081],"study_design_scores_gemma":[0.0014507421,0.0000035519577,0.011491645,0.00003167435,0.000031725645,5.855857e-7,0.000089876004,0.15838315,0.0000042041156,0.0004347458,0.82791805,0.00016006424],"about_ca_topic_score_codex":0.0001866245,"about_ca_topic_score_gemma":0.004021173,"teacher_disagreement_score":0.62538916,"about_ca_system_score_codex":0.000016606771,"about_ca_system_score_gemma":0.000011170009,"threshold_uncertainty_score":0.3935085},"labels":[],"label_agreement":null},{"id":"W3193751648","doi":"10.1002/net.22074","title":"A combinatorial auction‐based approach for ridesharing in a student transportation system","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Qatar National Library; Sultan Qaboos University","keywords":"Combinatorial auction; Mathematical optimization; Computer science; Heuristics; Vehicle routing problem; Heuristic; Metaheuristic; Routing (electronic design automation); Particle swarm optimization; Integer programming; Common value auction; Artificial intelligence; Mathematics","score_opus":0.01175298652035959,"score_gpt":0.2293458067570131,"score_spread":0.21759282023665352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193751648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111324504,0.000081730956,0.88612294,0.000016043803,0.0010776245,0.00039805128,0.000021929542,0.0002866746,0.0006704836],"genre_scores_gemma":[0.99626714,0.0000027878725,0.002574389,0.000021243324,0.00013133314,0.00032111842,0.000654246,0.000018602757,0.000009158696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993351,0.0000092915025,0.00027899363,0.00014123484,0.00009280379,0.00014254331],"domain_scores_gemma":[0.99973005,0.00002850168,0.000020365826,0.000113723785,0.0000785524,0.0000288134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116818774,0.00008311136,0.00012516156,0.00005984563,0.00004071323,0.000023165892,0.000047361173,0.00008293964,0.000007316471],"category_scores_gemma":[0.0000030318095,0.00010109345,0.000050890932,0.00038180617,0.0000072153184,0.00006061072,7.500153e-7,0.000118296666,5.568492e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099622075,0.00006328698,0.003311957,0.00013263516,0.000017819722,0.0000024682286,0.00019590736,0.98054135,0.00007142535,0.0152590955,0.000083599516,0.00031048618],"study_design_scores_gemma":[0.0017487999,0.000012054762,0.046080936,0.000054752796,0.000029280865,7.4022586e-7,0.00052606256,0.95026076,0.00026971067,0.000048311187,0.0008231213,0.0001454695],"about_ca_topic_score_codex":0.000008242778,"about_ca_topic_score_gemma":0.00014153213,"teacher_disagreement_score":0.8849426,"about_ca_system_score_codex":0.00009484471,"about_ca_system_score_gemma":0.00002455983,"threshold_uncertainty_score":0.41224712},"labels":[],"label_agreement":null},{"id":"W3195783669","doi":"10.1002/net.22075","title":"Impact of knowledge on the cost of treasure hunt in trees","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Node (physics); Tree (set theory); Mathematics; Type (biology); Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Artificial intelligence; Algorithm; Geography","score_opus":0.03562918770948417,"score_gpt":0.30564253735452745,"score_spread":0.2700133496450433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195783669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12579684,0.0032952887,0.7613518,0.0025449193,0.0005701954,0.0009367496,0.000012789271,0.0000937993,0.10539761],"genre_scores_gemma":[0.9991243,0.00010526503,0.0004961497,0.00003775072,0.00002113873,0.000005001697,0.000001938772,0.0000029696748,0.00020546837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993834,0.00014857866,0.00013661478,0.00010755304,0.00010231532,0.00012156241],"domain_scores_gemma":[0.9992604,0.00024411312,0.000044272067,0.00029257234,0.00012827554,0.000030345655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025513032,0.000050405702,0.00010610948,0.000036890015,0.000020161338,0.000018905243,0.00026901616,0.00003783796,0.0000573184],"category_scores_gemma":[0.00006363901,0.000031761767,0.00005333927,0.0006569783,0.000028050448,0.000051613602,0.00007045707,0.000110452034,0.0000031516922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014819316,0.00040416478,0.018999644,0.000011076402,0.000028047585,0.0000050949016,0.0014080723,0.8824698,0.00009149802,0.018152863,0.00484136,0.07357356],"study_design_scores_gemma":[0.00034122355,0.00013775913,0.07448368,0.00009242755,0.0000015396255,0.0000014017709,0.000019815823,0.9239643,0.00023414475,0.00022298493,0.00044168913,0.000058999387],"about_ca_topic_score_codex":0.000024820649,"about_ca_topic_score_gemma":0.00024469272,"teacher_disagreement_score":0.8733275,"about_ca_system_score_codex":0.000022744778,"about_ca_system_score_gemma":0.00014069267,"threshold_uncertainty_score":0.12952073},"labels":[],"label_agreement":null},{"id":"W3205122045","doi":"10.1002/net.22112","title":"The consistent production routing problem","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Consistency (knowledge bases); Computer science; Routing (electronic design automation); Local consistency; Production (economics); Heuristic; Consistency model; Linear programming; Mathematics; Data consistency; Distributed computing; Constraint satisfaction; Probabilistic logic","score_opus":0.011754787796061596,"score_gpt":0.22163534045340202,"score_spread":0.20988055265734043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205122045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033428505,0.003836206,0.90747535,0.0026585213,0.01042742,0.0014772459,0.0000034399736,0.0032062377,0.037487093],"genre_scores_gemma":[0.98508805,0.00005156992,0.013615886,0.000054404878,0.00032629474,0.00010756132,0.0000056489703,0.000035186236,0.00071542495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992574,0.00012753272,0.0001632422,0.00011210691,0.00013196563,0.00020778103],"domain_scores_gemma":[0.99964434,0.00009004565,0.000034335797,0.00018385402,0.000023589513,0.000023832301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087266235,0.00006858355,0.0000621839,0.000016371172,0.00062535866,0.00004071305,0.000114170696,0.000021523927,0.000029249142],"category_scores_gemma":[0.000037056074,0.00006020413,0.00002930039,0.0002527366,0.000018769631,0.00003186847,0.000067161636,0.00029912512,0.000002627894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021903722,0.0000031795917,0.0003039475,0.0000025990087,0.000011645654,5.1233997e-7,0.000096830365,0.9655225,0.000032695618,0.00051158335,0.0042729285,0.029239355],"study_design_scores_gemma":[0.000061357285,0.000009082506,0.00018022636,0.0000041081194,0.000006739934,0.000014344952,0.00013142414,0.972374,0.000038915303,0.00007885481,0.02702343,0.00007750632],"about_ca_topic_score_codex":0.0000018680126,"about_ca_topic_score_gemma":0.0000021711448,"teacher_disagreement_score":0.9516595,"about_ca_system_score_codex":0.00009690973,"about_ca_system_score_gemma":0.000008859164,"threshold_uncertainty_score":0.48098162},"labels":[],"label_agreement":null},{"id":"W4230024666","doi":"10.1002/net.20270","title":"A linear algorithm for finding the <i>k</i>‐broadcast center of a tree","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Computer science; Graph; Algorithm; Dissemination; Prim's algorithm; Unit disk graph; Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Shortest-path tree; Telecommunications","score_opus":0.030353133551422228,"score_gpt":0.2480676424642185,"score_spread":0.21771450891279628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230024666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009888901,0.00026389962,0.9948317,0.0001966205,0.0015028415,0.00025774553,0.000002911788,0.000052950632,0.0019024882],"genre_scores_gemma":[0.95919853,0.00008113328,0.036217295,0.0006551089,0.0018869818,0.00007941379,0.000004967741,0.00001939944,0.0018571633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.00005875928,0.00028410513,0.00021734834,0.00014540534,0.00027700572],"domain_scores_gemma":[0.9991488,0.00019386788,0.00013122121,0.0003808158,0.00010209914,0.00004319024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031063732,0.000108037304,0.00017816327,0.00003836391,0.00023351602,0.00003210573,0.00054289633,0.00007887377,0.000008159379],"category_scores_gemma":[0.0000096469985,0.00007263462,0.00015731974,0.0002506865,0.000049090122,0.00012850776,0.0000955093,0.00013646318,0.000005195552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036887654,0.00020837612,0.0014759307,0.000024773504,0.00015295776,0.000026143276,0.002998462,0.03631859,0.000041134397,0.010525139,0.17504665,0.77314496],"study_design_scores_gemma":[0.00037219474,0.00008569351,0.00012942454,0.000033454475,0.0000030652861,0.00008962665,0.00002004841,0.94605607,0.00004828408,0.000055825618,0.0530234,0.000082919985],"about_ca_topic_score_codex":0.000013411162,"about_ca_topic_score_gemma":0.000010568072,"teacher_disagreement_score":0.95861435,"about_ca_system_score_codex":0.000017880497,"about_ca_system_score_gemma":0.000020386515,"threshold_uncertainty_score":0.2961954},"labels":[],"label_agreement":null},{"id":"W4230415688","doi":"10.1002/net.20208","title":"Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Maxima and minima; Guided Local Search; Local optimum; Local search (optimization); Multi-commodity flow problem; Convergence (economics); Flow network; Heuristic; Mathematics; Minimum-cost flow problem; Computer science; Algorithm","score_opus":0.01783978272861802,"score_gpt":0.2649947361305507,"score_spread":0.24715495340193266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230415688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021783183,0.00040872488,0.99343824,0.000041494102,0.0007170809,0.0009141879,0.000010942245,0.000865855,0.0014251528],"genre_scores_gemma":[0.27569634,0.000022101694,0.7227364,0.0002738641,0.0008516232,0.000108302615,0.00009887153,0.00014094042,0.00007154372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800795,0.00006444369,0.00039904137,0.00032327216,0.00020971958,0.0009955408],"domain_scores_gemma":[0.99847585,0.0006710718,0.00008733827,0.00039604647,0.00014938615,0.00022032343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539875,0.00030696456,0.00036585671,0.0000626915,0.00021882947,0.00007261543,0.00020971209,0.0002630925,0.00003321854],"category_scores_gemma":[0.00003961959,0.00029836362,0.000081395054,0.0004917108,0.00006076896,0.00012216526,0.000026463716,0.00037632062,0.00000695141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000583923,0.00003216715,0.0013134808,0.0000460709,0.00004851758,0.0000043329082,0.000036704885,0.95392376,0.0000113435935,0.00003577447,0.00320687,0.0412826],"study_design_scores_gemma":[0.0015934944,0.00007424855,0.0006317828,0.00010337294,0.00004280705,0.000004708829,0.00000684291,0.99029803,0.0001515581,0.0000429584,0.0066662105,0.00038400307],"about_ca_topic_score_codex":0.000013057101,"about_ca_topic_score_gemma":0.00007084248,"teacher_disagreement_score":0.27351803,"about_ca_system_score_codex":0.00016746207,"about_ca_system_score_gemma":0.000026980213,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W4230596415","doi":"10.1002/net.20169","title":"On the minimum path problem in Knödel graphs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Logarithm; Bipartite graph; Longest path problem; Degree (music); Discrete mathematics; Shortest path problem; Graph","score_opus":0.016665121090767704,"score_gpt":0.27220704893071435,"score_spread":0.25554192783994667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230596415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044198394,0.00029009354,0.9327719,0.0009718525,0.0002567141,0.00046238978,3.8877658e-7,0.0001231279,0.020925088],"genre_scores_gemma":[0.9922215,0.00002567077,0.0065880585,0.00083179126,0.00005402859,0.000023333412,6.233662e-7,0.000010915457,0.00024408168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985085,0.00011985705,0.00018695727,0.0003135384,0.00029841292,0.0005727392],"domain_scores_gemma":[0.9983331,0.00087069167,0.000045434994,0.00063313835,0.000038087263,0.00007952744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017764932,0.00011241238,0.000099733974,0.00013780652,0.000113779904,0.000060799826,0.00105601,0.00007347368,0.000013019089],"category_scores_gemma":[0.000041997955,0.00007555896,0.00005074495,0.0011391705,0.00009015776,0.00014521558,0.00020065933,0.0004845948,0.00003050538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030224908,0.000054715125,0.00083449343,0.0000019926485,0.000004173587,0.000043339136,0.00022279908,0.0070310743,0.0000337906,0.9442044,0.0018458113,0.045693185],"study_design_scores_gemma":[0.0003857215,0.0001710951,0.004433442,0.00006301205,9.817944e-7,0.0000074972345,0.0000485092,0.15946566,0.0001175133,0.833174,0.0019193342,0.00021323915],"about_ca_topic_score_codex":0.0000057113825,"about_ca_topic_score_gemma":0.00003388763,"teacher_disagreement_score":0.9480231,"about_ca_system_score_codex":0.00003109948,"about_ca_system_score_gemma":0.0000195859,"threshold_uncertainty_score":0.3081205},"labels":[],"label_agreement":null},{"id":"W4232471133","doi":"10.1002/net.20237","title":"Reformulation and sampling to solve a stochastic network interdiction problem","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Interdiction; Flow network; Mathematical optimization; Computer science; Bernoulli's principle; Stochastic programming; Mathematics","score_opus":0.010303289843002305,"score_gpt":0.21620625663742943,"score_spread":0.20590296679442713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232471133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13030356,0.00016103241,0.868702,0.000020390538,0.00014794242,0.00012252775,4.4081156e-7,0.00013300551,0.00040910594],"genre_scores_gemma":[0.9908734,0.00003501872,0.008484119,0.0000567349,0.00050155475,0.00001587276,0.000008818404,0.00001419247,0.000010312874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993428,0.00000790033,0.00017506335,0.00014653828,0.00008584434,0.0002418688],"domain_scores_gemma":[0.9997203,0.000035028654,0.00001795481,0.00012302981,0.000027337606,0.00007637782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011302743,0.00010579269,0.00013706146,0.000054814845,0.0001705154,0.000020943591,0.00004966753,0.00008683738,0.000016648488],"category_scores_gemma":[0.000008654463,0.00009837577,0.00003559264,0.00028469262,0.000022549086,0.00011611207,0.000024578785,0.00017752418,0.000005334905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008024822,0.0000017858329,0.0006255954,0.0000070816436,0.000018003466,5.4659614e-7,0.00022728524,0.98302674,0.0000364113,0.00010487412,0.0003668228,0.015576853],"study_design_scores_gemma":[0.00007852429,0.00002855111,0.008376846,0.000038827042,0.000017702325,0.000016683889,0.000019272438,0.9902992,0.0000074041664,0.00065121596,0.00033937301,0.00012639188],"about_ca_topic_score_codex":0.000012149684,"about_ca_topic_score_gemma":0.0000449202,"teacher_disagreement_score":0.86056983,"about_ca_system_score_codex":0.000062358195,"about_ca_system_score_gemma":0.0000048027987,"threshold_uncertainty_score":0.40116477},"labels":[],"label_agreement":null},{"id":"W4235392953","doi":"10.1002/net.20258","title":"Collection depots facility location problems in trees","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Queen's University","funders":"","keywords":"Facility location problem; Center (category theory); Generalization; Computer science; Set (abstract data type); Mathematical optimization; Tree (set theory); Time complexity; Mathematics; Operations research; Combinatorics; Algorithm","score_opus":0.030867701738405053,"score_gpt":0.20855668392897173,"score_spread":0.17768898219056667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235392953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832929,0.0005694242,0.07668455,0.0014564412,0.0016514364,0.0013307083,0.0000013031056,0.0004891579,0.034524076],"genre_scores_gemma":[0.9980488,0.000089036104,0.000026228228,0.00047755655,0.00023902049,0.000070794755,0.000068682486,0.000006350513,0.000973559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99906737,0.00001307005,0.0002812478,0.00024763955,0.00017092176,0.00021977293],"domain_scores_gemma":[0.9996129,0.000009560953,0.000047244244,0.00018877901,0.00013255201,0.000008962682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026176317,0.0001152582,0.00011567308,0.00017264455,0.00018435884,0.00004312217,0.000110992114,0.00006663917,0.0002197695],"category_scores_gemma":[0.000069612885,0.000118941854,0.000029830104,0.0013470281,0.000035940495,0.00052455714,0.00005091471,0.00010623707,0.00028233448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025568672,0.00019126027,0.2001094,0.00015152742,0.000011075908,0.0000028236038,0.00014109214,0.7687284,0.0000053743593,0.00044297634,0.021196997,0.008993541],"study_design_scores_gemma":[0.0005364727,0.0000083725245,0.50054324,0.00003166605,0.000010465952,0.0000010173748,0.00009094166,0.44810426,0.0000031038362,0.00025971569,0.050176516,0.00023420584],"about_ca_topic_score_codex":0.0035090595,"about_ca_topic_score_gemma":0.019860364,"teacher_disagreement_score":0.32062408,"about_ca_system_score_codex":0.00006179897,"about_ca_system_score_gemma":0.00001770376,"threshold_uncertainty_score":0.99802464},"labels":[],"label_agreement":null},{"id":"W4235912610","doi":"10.1002/net.20264","title":"Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Synchronous optical networking; Traffic grooming; Multiplexer; Wavelength-division multiplexing; Computer science; Routing and wavelength assignment; Multiplexing; Computer network; Optical add-drop multiplexer; Offset (computer science); Wavelength; Algorithm; Optical performance monitoring; Telecommunications; Optics; Physics","score_opus":0.01896183288430563,"score_gpt":0.24585547797757212,"score_spread":0.22689364509326648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235912610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6011485,0.001981088,0.3921813,0.000063163454,0.0008350838,0.0004945166,0.0000032629337,0.00070510304,0.0025880057],"genre_scores_gemma":[0.92602134,0.00096175325,0.072475396,0.000051765735,0.00033952013,0.000026910247,0.0000069504745,0.000091143884,0.000025194151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977078,0.00004900025,0.0006732087,0.00034861075,0.00025534304,0.0009660659],"domain_scores_gemma":[0.99846715,0.00070578157,0.00008820316,0.0005839537,0.000051978423,0.00010291045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021962255,0.0003738607,0.0005377403,0.00008213524,0.00014056885,0.000018328967,0.0004921382,0.0005151994,0.00004583749],"category_scores_gemma":[0.00011773014,0.00031576582,0.00013797099,0.00081424497,0.0005225597,0.00016727208,0.00019409011,0.0011065799,0.000007651933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033592318,0.000031830015,0.0038924946,0.00001410816,0.00003880527,0.000051333278,0.00012310925,0.9856699,0.00010166317,0.0004588457,0.0008691966,0.0087151],"study_design_scores_gemma":[0.000533973,0.000020168625,0.0015372483,0.000120595214,0.000021918311,0.00007317875,0.0002454705,0.99637485,0.00009453081,0.00016170174,0.0004702097,0.00034617053],"about_ca_topic_score_codex":0.000012249326,"about_ca_topic_score_gemma":0.000023930792,"teacher_disagreement_score":0.3248729,"about_ca_system_score_codex":0.00013154828,"about_ca_system_score_gemma":0.000018589511,"threshold_uncertainty_score":0.9999294},"labels":[],"label_agreement":null},{"id":"W4236347696","doi":"10.1002/net.20372","title":"Exact and performance‐guaranteed multicast algorithms for lifetime optimization in WANETs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Mathematical optimization; Heuristic; Upper and lower bounds; Approximation algorithm; Connection (principal bundle); Graph; Wireless network; Optimization problem; Constant (computer programming); Algorithm; Wireless; Mathematics; Theoretical computer science; Distributed computing; Telecommunications","score_opus":0.011406620044224783,"score_gpt":0.23997228167146117,"score_spread":0.2285656616272364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236347696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005729093,0.00047928398,0.9919487,0.00027765144,0.0002816639,0.0005523323,7.5727326e-7,0.00012153196,0.000608972],"genre_scores_gemma":[0.820553,0.00022145896,0.17804714,0.0007652073,0.00029502317,0.000042177322,0.000010762318,0.000012768225,0.000052469128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986473,0.00004087725,0.00028723167,0.0004283116,0.00014141551,0.00045488524],"domain_scores_gemma":[0.99930394,0.0001301372,0.000081037266,0.00035633962,0.00004703954,0.00008150593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034561637,0.00017536666,0.00021849772,0.000085235435,0.00010118092,0.00013210141,0.00037215225,0.00015049336,0.0000075564926],"category_scores_gemma":[0.000015701964,0.0001706353,0.000036730322,0.000353446,0.000031464515,0.00039359412,0.00007121891,0.00019676914,0.0000030194653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002735575,0.000042461455,0.00044853135,0.0000049917976,0.0000038238754,0.0000046289706,0.00010586503,0.67176276,0.0000023365535,0.0005037007,0.00048332682,0.32661024],"study_design_scores_gemma":[0.0008855882,0.00028211472,0.004481792,0.000055683056,0.000004522344,0.000017126342,0.0000045507622,0.9933229,0.000012686755,0.000075636286,0.000662093,0.00019529006],"about_ca_topic_score_codex":0.00000646458,"about_ca_topic_score_gemma":0.0000051962043,"teacher_disagreement_score":0.8148239,"about_ca_system_score_codex":0.000050685812,"about_ca_system_score_gemma":0.000020531254,"threshold_uncertainty_score":0.6958306},"labels":[],"label_agreement":null},{"id":"W4238082519","doi":"10.1002/net.20345","title":"Wavelength assignment in multifiber star networks","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Clemson University","keywords":"Maximization; Star network; Star (game theory); Path (computing); Computer science; Minification; Time complexity; Approximation algorithm; Wavelength-division multiplexing; Optimization problem; Mathematics; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Wavelength; Network topology; Physics; Optics; Computer network","score_opus":0.01544820293658534,"score_gpt":0.2726451021917512,"score_spread":0.25719689925516587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238082519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006164712,0.0005365685,0.9895889,0.00054431957,0.0003388808,0.00032384408,3.6785474e-7,0.00017312806,0.0023292552],"genre_scores_gemma":[0.9790618,0.0001490013,0.019451074,0.0007577289,0.00020036974,0.000019798887,0.0000034457291,0.000013290332,0.00034350625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977289,0.00020315031,0.0002975721,0.0005508735,0.00036773513,0.00085181376],"domain_scores_gemma":[0.9986817,0.00021455469,0.000066293964,0.0008053356,0.00005108755,0.0001810334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074761576,0.00019928177,0.00022183309,0.00014661028,0.00010813854,0.000114446935,0.0010249288,0.00014724952,0.00002766802],"category_scores_gemma":[0.0000256527,0.00018620036,0.00006940144,0.0008896953,0.000056122946,0.0004115902,0.00020384215,0.00063380616,0.000024044211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030948733,0.00012030578,0.00049421453,0.0000013768193,0.000007313531,0.000079241676,0.00014602642,0.33450335,0.000020440211,0.03760528,0.0012241174,0.6257674],"study_design_scores_gemma":[0.000471795,0.0001194043,0.006904444,0.00002837361,0.0000012436974,0.000005155017,0.000010012032,0.9746758,0.000025340669,0.015538004,0.0019999887,0.00022046814],"about_ca_topic_score_codex":0.0000060482307,"about_ca_topic_score_gemma":0.000016656373,"teacher_disagreement_score":0.97289705,"about_ca_system_score_codex":0.00012297361,"about_ca_system_score_gemma":0.00002820785,"threshold_uncertainty_score":0.75930303},"labels":[],"label_agreement":null},{"id":"W4238730366","doi":"10.1002/net.20301","title":"On the roots of strongly connected reliability polynomials","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Strongly connected component; Mathematics; Reliability (semiconductor); Vertex connectivity; Combinatorics; Simply connected space; Unit disk; Plane (geometry); Arc (geometry); Closure (psychology); Complex plane; Connected component; Discrete mathematics; Vertex (graph theory); Graph; Mathematical analysis; Geometry; Physics","score_opus":0.02494561104413878,"score_gpt":0.28564447756926165,"score_spread":0.26069886652512286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238730366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98399615,0.000024469466,0.004070704,0.0009750907,0.000046605328,0.0003114698,0.000005263018,0.00005656437,0.010513671],"genre_scores_gemma":[0.99932194,0.0000027573765,0.0002948303,0.0001763246,0.00006501706,0.000013439515,0.0000024992842,0.0000056548497,0.00011753538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937236,0.00010487917,0.0002007202,0.00011454386,0.00007950397,0.00012798335],"domain_scores_gemma":[0.9980452,0.0012977553,0.00010450704,0.0004833305,0.00004135394,0.000027870434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599117,0.000075371434,0.00013413401,0.000014069332,0.00008391551,0.000007924297,0.00017005172,0.000067065535,0.00012915212],"category_scores_gemma":[0.00027184992,0.000049003498,0.0000672684,0.00014776253,0.000058309342,0.000017036846,0.00001097034,0.00014382522,0.000006722839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028161201,0.00011122041,0.000050069477,0.0000021724259,0.00000695749,1.0495036e-7,0.000034746514,0.0010647636,0.00021161513,0.9907893,0.0069352738,0.00076559884],"study_design_scores_gemma":[0.0001447066,0.00008070534,0.005954002,0.000022012877,0.000018805607,4.7510963e-7,0.000029999497,0.0018151893,0.0006556867,0.9908389,0.0003766761,0.000062837426],"about_ca_topic_score_codex":0.0000020318585,"about_ca_topic_score_gemma":0.0000037487778,"teacher_disagreement_score":0.015325778,"about_ca_system_score_codex":0.000008582793,"about_ca_system_score_gemma":0.0000081366525,"threshold_uncertainty_score":0.19983046},"labels":[],"label_agreement":null},{"id":"W4239155994","doi":"10.1002/net.20240","title":"Decontamination of hypercubes by mobile agents","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Locality; Hypercube; Visibility; Human decontamination; Binary logarithm; Node (physics); Synchronicity; Copying; Path (computing); Mobile agent; Distributed computing; Theoretical computer science; Computer network; Mathematics; Combinatorics; Parallel computing","score_opus":0.016013971612176426,"score_gpt":0.24127157903904298,"score_spread":0.22525760742686654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239155994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03241016,0.000260956,0.96296,0.00005759358,0.00014088026,0.00012784293,6.844365e-7,0.000053789357,0.0039881063],"genre_scores_gemma":[0.9908817,0.00034092535,0.007693144,0.00016842686,0.000021437543,0.000013736401,0.000007681905,0.0000036702772,0.00086929975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.000034042765,0.00011618047,0.000116614996,0.00013087032,0.00011643712],"domain_scores_gemma":[0.9996618,0.000031486332,0.00003703884,0.00016479744,0.00006244253,0.000042429943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097459146,0.000043729477,0.00006786747,0.000029881574,0.00006126433,0.0000142501885,0.00025210035,0.000039439703,0.00004733482],"category_scores_gemma":[0.000006642639,0.000041430558,0.000022314394,0.0001822994,0.000027493465,0.00019875349,0.000054835564,0.000053521748,0.00001152558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007431161,0.0003832804,0.011494744,0.000017432654,0.000032358053,0.000017124577,0.0023784274,0.47922358,0.00042164995,0.006122257,0.19497786,0.30492383],"study_design_scores_gemma":[0.00018042976,0.000061116036,0.0017766956,0.0000056567465,7.7476494e-7,0.00000612686,0.000006577761,0.9908055,0.00035017665,0.00005011781,0.0066986317,0.000058215424],"about_ca_topic_score_codex":0.000008463949,"about_ca_topic_score_gemma":0.0000013977716,"teacher_disagreement_score":0.95847154,"about_ca_system_score_codex":0.00001121847,"about_ca_system_score_gemma":0.000014784007,"threshold_uncertainty_score":0.16894892},"labels":[],"label_agreement":null},{"id":"W4239505110","doi":"10.1002/net.20155","title":"Vertex disjoint routings of cycles over tori","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Partition (number theory); Disjoint sets; Computer science; Vertex (graph theory); Hypergraph; Shortest path problem; Mathematics; Torus; Combinatorics; Graph; Computer network; Topology (electrical circuits); Discrete mathematics","score_opus":0.0057483894044682805,"score_gpt":0.21924822883743073,"score_spread":0.21349983943296244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239505110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35885563,0.0021232732,0.61954665,0.000029059413,0.0009990318,0.00015029336,0.0000017025554,0.0014591175,0.016835226],"genre_scores_gemma":[0.9859721,0.00015741556,0.01361137,0.000026851081,0.00016564163,0.0000026739604,0.0000025266322,0.000031547832,0.000029844714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991254,0.0000032426058,0.00024983066,0.00012447585,0.000112242386,0.00038479315],"domain_scores_gemma":[0.99950355,0.00014854914,0.000031126932,0.00024766524,0.000018872364,0.000050251434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012923754,0.00013022119,0.0001839381,0.000040556155,0.000024087549,0.000007152268,0.00015971983,0.00017715064,0.0000307556],"category_scores_gemma":[0.000040878087,0.00012428332,0.000054129254,0.00023050419,0.000077732264,0.000074470045,0.00006426559,0.00026348355,0.0000069780285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026068432,0.000027357677,0.005647365,0.000035491455,0.000051191022,0.000017601731,0.000062748084,0.7822414,0.0009083678,0.021480065,0.0059314286,0.18357094],"study_design_scores_gemma":[0.0007192963,0.00011948133,0.071952455,0.00023745587,0.000041167397,0.000008711826,0.00017742664,0.89563316,0.004275466,0.012899681,0.013149225,0.0007864986],"about_ca_topic_score_codex":0.0000035098744,"about_ca_topic_score_gemma":0.00001394958,"teacher_disagreement_score":0.6271165,"about_ca_system_score_codex":0.00005460988,"about_ca_system_score_gemma":0.0000018799666,"threshold_uncertainty_score":0.5068127},"labels":[],"label_agreement":null},{"id":"W4239618018","doi":"10.1002/net.20182","title":"A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Regret; Heuristic; Mathematical optimization; Computer science; Vehicle routing problem; Routing (electronic design automation); Class (philosophy); Process (computing); Operations research; Mathematics; Artificial intelligence; Machine learning","score_opus":0.00953183509274726,"score_gpt":0.24791674975548805,"score_spread":0.23838491466274078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239618018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07699477,0.0010727231,0.92091805,0.000024852798,0.00021851536,0.00031767602,0.000002540019,0.000288917,0.00016197682],"genre_scores_gemma":[0.9657492,0.000027177723,0.03391341,0.000040889765,0.00013538163,0.000018171386,0.000007756953,0.00005762762,0.000050354283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990772,0.000021057274,0.00024388294,0.00019664686,0.00007371215,0.00038747228],"domain_scores_gemma":[0.9992256,0.00047642534,0.00004071332,0.00012276792,0.00003368848,0.00010076658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007458464,0.00014829551,0.00017610421,0.00005445692,0.000113147915,0.000050331808,0.000060172682,0.00012328388,0.0000036527663],"category_scores_gemma":[0.00010962543,0.00015998624,0.000025254278,0.00015650182,0.000038503345,0.00006417789,0.000029699162,0.0001889414,8.815511e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009095479,0.0000040746227,0.00056511647,0.00006171155,0.000016026557,7.716836e-7,0.00022077115,0.94355005,0.00012656278,0.00017596608,0.000027853363,0.05524202],"study_design_scores_gemma":[0.00047539244,0.000029456101,0.003400398,0.00008177896,0.00002360208,0.0000127231315,0.00002484127,0.99541366,0.0000095775595,0.00029850603,0.00005687045,0.00017316731],"about_ca_topic_score_codex":0.0000033235376,"about_ca_topic_score_gemma":0.000016985385,"teacher_disagreement_score":0.8887545,"about_ca_system_score_codex":0.000038285714,"about_ca_system_score_gemma":0.000005083383,"threshold_uncertainty_score":0.65240496},"labels":[],"label_agreement":null},{"id":"W4243384718","doi":"10.1002/net.20188","title":"The maximum residual flow problem:<i>NP</i>‐hardness with two‐arc destruction","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Arc (geometry); Residual; Mathematics; Flow (mathematics); Combinatorics; Maximum flow problem; Polynomial; Arc routing; Flow network; Computer science; Geometry; Algorithm; Mathematical analysis; Routing (electronic design automation); Computer network","score_opus":0.010911708731744182,"score_gpt":0.22936413531378097,"score_spread":0.21845242658203678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243384718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037554896,0.000295453,0.9891498,0.0006531931,0.0013282871,0.00022662959,7.4378556e-7,0.00024788207,0.004342508],"genre_scores_gemma":[0.46374875,0.0001260372,0.53202426,0.0009065083,0.002444582,0.000049739436,0.00001136064,0.000047405894,0.00064135995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983075,0.00007261047,0.0002439274,0.0003878906,0.00039378903,0.00059427554],"domain_scores_gemma":[0.99882585,0.00019291318,0.000101080484,0.00065506744,0.00011073435,0.00011436948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075031,0.00017441623,0.0001315276,0.000059061036,0.00074153097,0.00034111907,0.00094803836,0.00007436697,0.0000063048597],"category_scores_gemma":[0.000006820946,0.0001172717,0.000051697796,0.0007321671,0.00019649007,0.00031691513,0.00022762128,0.00039425862,0.000010145046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091741604,0.00004874911,0.0012289709,0.0000072845587,0.00004202499,0.00005710301,0.00030967762,0.024039567,0.000012454261,0.08368535,0.004546423,0.88593066],"study_design_scores_gemma":[0.0019065053,0.0005080273,0.009952582,0.00011653268,0.000033755856,0.00067991257,0.00013821892,0.6984896,0.0003044225,0.1963016,0.09065511,0.0009137458],"about_ca_topic_score_codex":0.000045720364,"about_ca_topic_score_gemma":0.0004909063,"teacher_disagreement_score":0.8850169,"about_ca_system_score_codex":0.000037286896,"about_ca_system_score_gemma":0.000045751854,"threshold_uncertainty_score":0.5703332},"labels":[],"label_agreement":null},{"id":"W4245026044","doi":"10.1002/net.20178","title":"Path inequalities for the vehicle routing problem with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"HEC Montréal; Deakin University","keywords":"Vehicle routing problem; Context (archaeology); Polytope; Path (computing); Travelling salesman problem; Mathematical optimization; Node (physics); Mathematics; Computer science; Dimension (graph theory); Routing (electronic design automation); Combinatorics","score_opus":0.014139643962934432,"score_gpt":0.2414425082797293,"score_spread":0.22730286431679486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245026044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080912905,0.00028035714,0.9871503,0.00006670962,0.00013339853,0.00043234762,0.0000024529952,0.00045032206,0.003392787],"genre_scores_gemma":[0.8652211,0.0000143299685,0.13336541,0.0001533693,0.00060082093,0.000046915353,0.000011034504,0.000083515864,0.00050351594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904764,0.00003569844,0.0002432423,0.00013330967,0.00012535864,0.00041474478],"domain_scores_gemma":[0.9988293,0.0007980864,0.000051084804,0.0002091379,0.00006164307,0.000050727762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014643433,0.00014007794,0.00014200434,0.000027649467,0.00016884679,0.00005949319,0.00014776891,0.000091751164,0.000020674872],"category_scores_gemma":[0.000035459812,0.00009918712,0.00003972361,0.00023265475,0.00003220301,0.00008250477,0.000022337828,0.00020103612,0.0000058295736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020617015,0.0000046444566,0.00095129514,0.000019852398,0.000032750097,0.0000010182928,0.00038465968,0.97643906,0.00006432827,0.0005603373,0.0006383513,0.020883096],"study_design_scores_gemma":[0.0003688293,0.000036252775,0.0007810053,0.000048906884,0.000021800886,0.000003831012,0.00012975688,0.9960519,0.00018624171,0.00005633071,0.0021597838,0.00015532378],"about_ca_topic_score_codex":0.0000067162696,"about_ca_topic_score_gemma":0.000008664168,"teacher_disagreement_score":0.8571298,"about_ca_system_score_codex":0.000043642143,"about_ca_system_score_gemma":0.0000108757795,"threshold_uncertainty_score":0.40447333},"labels":[],"label_agreement":null},{"id":"W4245416987","doi":"10.1002/net.20119","title":"Fault‐tolerant routings with minimum optical index","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fault tolerance; Graph; Construct (python library); Context (archaeology); Directed graph; Property (philosophy); Mathematics; Combinatorics; Algorithm; Theoretical computer science; Distributed computing; Computer network","score_opus":0.0022790414841768387,"score_gpt":0.15247128549506406,"score_spread":0.1501922440108872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245416987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8345331,0.0005449635,0.103671476,0.000021067133,0.00049144827,0.00014853525,0.0000012379427,0.0004773923,0.06011077],"genre_scores_gemma":[0.99899536,0.0000024920164,0.00012972266,0.00003060705,0.00048338433,0.000014600728,0.000006977655,0.000032589745,0.00030423325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992631,0.000015267855,0.0001673825,0.00013127732,0.00011120854,0.0003117652],"domain_scores_gemma":[0.9997077,0.000037479214,0.000017553559,0.00016631937,0.000016047703,0.00005487391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001058065,0.00014031953,0.00015592805,0.000030649288,0.000049629372,0.000038544593,0.000098098535,0.000121807134,0.000029098861],"category_scores_gemma":[0.0000012926902,0.00011447517,0.00004158622,0.00015998821,0.000038535414,0.00005418867,0.0000099946255,0.00020629456,0.000023235973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003172724,0.00002019093,0.005452085,0.000021883474,0.000030596904,0.000034680346,0.00006405059,0.979857,0.00013888536,0.006997321,0.0056902478,0.0016612897],"study_design_scores_gemma":[0.00073252455,0.00005925608,0.012015702,0.00011792653,0.000025097339,0.00006305514,0.0000841774,0.97602904,0.00024291455,0.00059125485,0.009631994,0.00040702848],"about_ca_topic_score_codex":0.000017843338,"about_ca_topic_score_gemma":0.000030517782,"teacher_disagreement_score":0.16446228,"about_ca_system_score_codex":0.000016060492,"about_ca_system_score_gemma":0.0000034732423,"threshold_uncertainty_score":0.46681622},"labels":[],"label_agreement":null},{"id":"W4245527820","doi":"10.1002/net.20063","title":"Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Probabilistic logic; Computation; Computer science; Mathematical optimization; Traveling purchaser problem; Mathematics; Bottleneck traveling salesman problem; Algorithm; Artificial intelligence","score_opus":0.01835366463530712,"score_gpt":0.24281943364682573,"score_spread":0.2244657690115186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245527820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03151119,0.001323255,0.96534145,0.00015425522,0.00012512048,0.0006295686,0.0000021708431,0.00020183656,0.0007111469],"genre_scores_gemma":[0.91016465,0.000103234095,0.08912108,0.000051088387,0.00040658694,0.000057804016,0.0000040658188,0.00004304571,0.000048447968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916667,0.000043501703,0.00019729628,0.00017134499,0.00010368905,0.0003175207],"domain_scores_gemma":[0.9991509,0.00054413767,0.000020077303,0.00017052644,0.000053104504,0.00006128941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006074476,0.00012502221,0.0001185952,0.00003172392,0.00016621614,0.00006178251,0.00011927042,0.000087249275,0.000010914682],"category_scores_gemma":[0.000017521515,0.00010014483,0.00003729768,0.00015472605,0.000042387637,0.00002439815,0.00002638001,0.00021442563,0.000002771001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007649162,0.000009567872,0.00015010248,0.000036196678,0.000018267325,1.9548959e-7,0.0002887082,0.927133,0.000022686718,0.00076551485,0.00009111339,0.07147696],"study_design_scores_gemma":[0.00027843757,0.000022762657,0.00036604758,0.000030559753,0.000027263042,0.0000041324774,0.00003146975,0.99846536,0.00004769225,0.000041480773,0.0005654216,0.00011936489],"about_ca_topic_score_codex":0.0000020346367,"about_ca_topic_score_gemma":0.000006257997,"teacher_disagreement_score":0.87865347,"about_ca_system_score_codex":0.000052047013,"about_ca_system_score_gemma":0.00001359362,"threshold_uncertainty_score":0.40837875},"labels":[],"label_agreement":null},{"id":"W4246352112","doi":"10.1002/net.20148","title":"Uniformly optimal digraphs for strongly connected reliability","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Counterexample; Conjecture; Combinatorics; Vertex (graph theory); Strongly connected component; Reliability (semiconductor); Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Simple (philosophy); Connectivity; Terminal (telecommunication); Vertex connectivity; Directed graph; Discrete mathematics; Computer science","score_opus":0.0031287280909298274,"score_gpt":0.17559408778692287,"score_spread":0.17246535969599305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246352112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12556335,0.00018863172,0.8676278,0.00005625596,0.00049660314,0.0004906455,0.000016500715,0.00052956556,0.005030652],"genre_scores_gemma":[0.98507625,0.000045163055,0.01417514,0.000015828204,0.0002491282,0.00007651273,0.00015545812,0.000029956736,0.00017654925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917734,0.000012002703,0.00023626281,0.00017794575,0.00007017716,0.00032629876],"domain_scores_gemma":[0.9995065,0.00009769805,0.000026994552,0.00023231428,0.000094060924,0.000042469637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016467187,0.0001339163,0.00015168746,0.000030804666,0.000068078516,0.000035155,0.00009675458,0.00014625928,0.000024359833],"category_scores_gemma":[0.000032655105,0.00012971993,0.00008626415,0.00017619989,0.000046575777,0.00013967676,0.000010790079,0.00013037008,0.0000030554406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002527263,0.000019317458,0.00055220304,0.000024731242,0.0000072807934,2.848662e-7,0.000010256393,0.98755956,0.00002394318,0.0025060293,0.008206065,0.0010650376],"study_design_scores_gemma":[0.0004103337,0.000045547204,0.003124777,0.000013839217,0.000013578931,8.8045186e-7,0.000014310691,0.98471,0.00009040214,0.0009287214,0.010489479,0.00015815833],"about_ca_topic_score_codex":0.000026249223,"about_ca_topic_score_gemma":0.00004191879,"teacher_disagreement_score":0.8595129,"about_ca_system_score_codex":0.000057384506,"about_ca_system_score_gemma":0.000010302853,"threshold_uncertainty_score":0.5289826},"labels":[],"label_agreement":null},{"id":"W4247344008","doi":"10.1002/net.20312","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Travelling salesman problem; Pickup; Computer science; Traveling purchaser problem; Mathematical optimization; Branch and cut; Algorithm; Mathematics; Set (abstract data type); Bottleneck traveling salesman problem; Integer programming; FIFO (computing and electronics); Artificial intelligence","score_opus":0.010209518403106783,"score_gpt":0.22035149513800273,"score_spread":0.21014197673489596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247344008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010404816,0.0020138882,0.9866517,0.00012003596,0.00007440209,0.00031664944,0.0000015072183,0.0001924255,0.00022456706],"genre_scores_gemma":[0.586503,0.0005004982,0.41235328,0.00017616595,0.00036136102,0.000021954378,0.0000040337427,0.000037454036,0.000042253414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935365,0.000022917604,0.00014707046,0.00015892305,0.00006843976,0.0002490218],"domain_scores_gemma":[0.9995255,0.00024157333,0.000028987231,0.00011388405,0.00003260714,0.00005744818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031592746,0.00013552446,0.00014109546,0.00002532651,0.00016394453,0.00007949559,0.00006946672,0.000085186126,0.0000021688825],"category_scores_gemma":[0.000007549956,0.0001027864,0.000021872938,0.00012377853,0.000028151051,0.00008091085,0.000011305597,0.0001839063,3.1505851e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006425662,0.0000024478927,0.00012235438,0.000010583974,0.000021411339,6.701829e-7,0.00020079673,0.5603572,0.000029065886,0.000054232885,0.000074235046,0.4391206],"study_design_scores_gemma":[0.00045014365,0.000062446044,0.000962589,0.00007873185,0.000040616844,0.000021713871,0.00003241767,0.99757487,0.000052248015,0.00010774423,0.00047263264,0.0001438396],"about_ca_topic_score_codex":0.0000032707142,"about_ca_topic_score_gemma":0.0000069975786,"teacher_disagreement_score":0.5760982,"about_ca_system_score_codex":0.00001778573,"about_ca_system_score_gemma":0.00000711371,"threshold_uncertainty_score":0.41915077},"labels":[],"label_agreement":null},{"id":"W4248853006","doi":"10.1002/net.20060","title":"The strongly connected reliability of complete digraphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Vertex connectivity; Vertex (graph theory); Strongly connected component; Combinatorics; Fist; Mathematics; Reliability (semiconductor); Connected component; Connectivity; Discrete mathematics; Computer science; Graph","score_opus":0.011253662670866976,"score_gpt":0.2199192064679363,"score_spread":0.20866554379706934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248853006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041573778,0.0007945169,0.94487244,0.0015506063,0.0020185157,0.0003249974,0.000002425259,0.00020603254,0.00865672],"genre_scores_gemma":[0.9977681,0.00003478393,0.0013740332,0.00012426099,0.00042597865,0.000013599561,0.0000014283784,0.000006415524,0.0002513848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863505,0.00017834442,0.0004165962,0.0002574731,0.00020001976,0.0003125344],"domain_scores_gemma":[0.9983276,0.0004918324,0.00017257812,0.00075815764,0.00018705857,0.00006276263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006769016,0.000114364455,0.0001845581,0.000027590999,0.000247905,0.000109384586,0.0007842478,0.00007935491,0.000014642969],"category_scores_gemma":[0.000037778274,0.00007596073,0.00012065228,0.00033926332,0.00010014127,0.00019009707,0.00012340136,0.0002048366,0.000012218513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065961205,0.00013538617,0.005421749,0.000014929273,0.00008672295,0.0000027669482,0.00059511745,0.5230493,0.0001018251,0.32647854,0.053148303,0.09089939],"study_design_scores_gemma":[0.00019845618,0.00006550858,0.0040632756,0.000018571507,0.0000031452678,0.000006326809,0.000025265235,0.90515685,0.000023616349,0.0005007294,0.08984154,0.000096708754],"about_ca_topic_score_codex":0.00003407713,"about_ca_topic_score_gemma":0.000178765,"teacher_disagreement_score":0.95619434,"about_ca_system_score_codex":0.000030538467,"about_ca_system_score_gemma":0.000020107924,"threshold_uncertainty_score":0.30975884},"labels":[],"label_agreement":null},{"id":"W4249052652","doi":"10.1002/net.20114","title":"Route discovery with constant memory in oriented planar geometric networks","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Planar graph; Planar; Routing (electronic design automation); Computer science; Face (sociological concept); Combinatorics; Constant (computer programming); Eulerian path; Spatial network; Topology (electrical circuits); Graph; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Pure mathematics","score_opus":0.005255363127485251,"score_gpt":0.19104026970096916,"score_spread":0.1857849065734839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249052652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014520796,0.0025521426,0.97156554,0.00014213164,0.000980277,0.0005635384,0.000003568908,0.00031570997,0.009356306],"genre_scores_gemma":[0.99077034,0.00013711132,0.0068289815,0.00050203234,0.0008083415,0.00009072202,0.000057416277,0.000047787493,0.0007572899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964519,0.00017265457,0.0006420867,0.00097270275,0.0005472703,0.0012133954],"domain_scores_gemma":[0.997871,0.0004119011,0.00026980546,0.0011905507,0.00008636413,0.00017039652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057835714,0.00043855605,0.0005282738,0.00039665413,0.00016323933,0.00037429915,0.0011129988,0.00028736924,0.00001729617],"category_scores_gemma":[0.000013801675,0.00037327487,0.00009986877,0.00429887,0.00016438031,0.0010458739,0.00026682916,0.0008067452,0.000014457053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007359953,0.00014794097,0.027034078,0.0000066915977,0.000027882736,0.00044855618,0.000027685479,0.9170507,0.0000019477525,0.032954875,0.008396235,0.013829812],"study_design_scores_gemma":[0.0016077282,0.00018882898,0.022543743,0.00015931285,0.000018465678,0.000089803034,0.00002071832,0.97038734,0.000011970158,0.0004991574,0.0038312566,0.00064167014],"about_ca_topic_score_codex":0.0005195273,"about_ca_topic_score_gemma":0.0013623127,"teacher_disagreement_score":0.9762495,"about_ca_system_score_codex":0.00023950606,"about_ca_system_score_gemma":0.00012131916,"threshold_uncertainty_score":0.9998719},"labels":[],"label_agreement":null},{"id":"W4250150436","doi":"10.1002/net.20170","title":"Locating a cycle in a transportation or a telecommunications network","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Hamiltonian path; Computer science; Graph; Mathematical optimization; Hamiltonian path problem; Hamiltonian (control theory); Mathematics; Theoretical computer science","score_opus":0.014452696560842734,"score_gpt":0.27393892333761466,"score_spread":0.2594862267767719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250150436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047588643,0.00039512152,0.9483387,0.00003086102,0.00016164817,0.00016382041,6.4007907e-7,0.0003668974,0.0029536635],"genre_scores_gemma":[0.79234636,0.00006573301,0.20728283,0.00006380229,0.00014704828,0.000016362826,0.00001969322,0.000032692697,0.000025506624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904907,0.00004643117,0.0003646638,0.00011155028,0.00007555743,0.00035275728],"domain_scores_gemma":[0.9993279,0.0003057018,0.000039421324,0.0002447352,0.00002687859,0.000055379467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008771574,0.00010332834,0.00012913994,0.00006947615,0.00007095701,0.000019505826,0.00014729069,0.0001166473,0.00004014106],"category_scores_gemma":[0.000035556124,0.000109362736,0.000027102014,0.0009219258,0.000016819731,0.00008634363,0.0000067925375,0.00030112543,0.000004599799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009828001,0.000010346105,0.00556482,0.000008911509,0.0000056606905,0.0000036248139,0.00032287688,0.95601255,0.000011915603,0.00016281033,0.00010939532,0.03777725],"study_design_scores_gemma":[0.00023993841,0.000008686559,0.028145848,0.00005036037,0.0000064398723,0.000002202414,0.000072913295,0.9706702,0.000019002986,0.00007168547,0.0005852696,0.0001274027],"about_ca_topic_score_codex":0.000027120113,"about_ca_topic_score_gemma":0.0017723494,"teacher_disagreement_score":0.7447577,"about_ca_system_score_codex":0.00006926566,"about_ca_system_score_gemma":0.0000126195955,"threshold_uncertainty_score":0.4459683},"labels":[],"label_agreement":null},{"id":"W4250280589","doi":"10.1002/net.20307","title":"A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Undirected graph; Orienteering; Vertex (graph theory); Bottleneck traveling salesman problem; Computer science; Branch and cut; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; 2-opt; Mathematics; Algorithm; Traveling purchaser problem; Mathematical optimization; Linear programming; Artificial intelligence","score_opus":0.015512761032151857,"score_gpt":0.2532832045046128,"score_spread":0.23777044347246093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250280589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014407927,0.000904537,0.99510795,0.0001500093,0.00024287455,0.00052830315,0.0000018211632,0.00053686043,0.0010868785],"genre_scores_gemma":[0.34164566,0.00022862044,0.6568667,0.00020075701,0.0006353867,0.00006179798,0.000009994282,0.000065796405,0.00028528264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991422,0.000048187412,0.0002316835,0.00016930532,0.000083777566,0.00032478885],"domain_scores_gemma":[0.9991829,0.00052691024,0.000043178177,0.00014273511,0.000051113915,0.000053195967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054584857,0.00014644967,0.00016792704,0.000032694345,0.000274199,0.00008498696,0.000110556284,0.00012020312,0.0000058731525],"category_scores_gemma":[0.000053019805,0.00012543665,0.000048226186,0.00036884853,0.00001839918,0.000053493277,0.000011591624,0.00023974372,6.864885e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029454814,0.0000037947405,0.000028793622,0.000007253493,0.000022582251,2.9701383e-7,0.00019129836,0.59197736,0.00007009343,0.000051099345,0.00027653945,0.40736791],"study_design_scores_gemma":[0.00042887995,0.000027716847,0.00075387524,0.000047093905,0.00003295986,0.000009615672,0.000020842414,0.99703056,0.00012977317,0.00026427658,0.0011026196,0.00015177445],"about_ca_topic_score_codex":0.0000028753834,"about_ca_topic_score_gemma":0.0000067468004,"teacher_disagreement_score":0.40721616,"about_ca_system_score_codex":0.00004120714,"about_ca_system_score_gemma":0.000012668787,"threshold_uncertainty_score":0.5115158},"labels":[],"label_agreement":null},{"id":"W4251030912","doi":"10.1002/net.20174","title":"The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Minimax; Probability distribution; Mathematical optimization; Mathematics; Random variable; Computer science; Statistics","score_opus":0.013816080537281538,"score_gpt":0.2063077277241026,"score_spread":0.19249164718682107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251030912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88232493,0.00061878114,0.09837822,0.0017686224,0.00037095734,0.00097027305,0.00000310729,0.00009801505,0.015467114],"genre_scores_gemma":[0.9988558,0.000051933064,0.00032761492,0.000119930424,0.0002687248,0.000023727647,0.000030260617,0.0000070423594,0.0003149662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990951,0.00000867399,0.0002800169,0.00019424452,0.00016420608,0.00025777402],"domain_scores_gemma":[0.9995046,0.000030298153,0.00007936961,0.00023446737,0.00013603535,0.000015185546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008207992,0.00011185771,0.00011012338,0.00003728598,0.0003167674,0.000072860916,0.0001307823,0.000042096075,0.00003327139],"category_scores_gemma":[0.00002640331,0.00006982826,0.000030735584,0.00032137253,0.00017244217,0.00021330238,0.00009016998,0.00008790183,0.0000065147606],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004385622,0.00056962966,0.22588564,0.0007390021,0.00023408455,0.000005031952,0.00020889952,0.03522204,0.000053297434,0.6014776,0.016327392,0.11883883],"study_design_scores_gemma":[0.001061936,0.00006124417,0.4950556,0.00008725439,0.00015155613,0.0000019936024,0.00020176494,0.19579677,0.000044956072,0.015781732,0.29129115,0.00046403933],"about_ca_topic_score_codex":0.00036629004,"about_ca_topic_score_gemma":0.0030905623,"teacher_disagreement_score":0.58569586,"about_ca_system_score_codex":0.00001623714,"about_ca_system_score_gemma":0.000007277615,"threshold_uncertainty_score":0.28475136},"labels":[],"label_agreement":null},{"id":"W4251692629","doi":"10.1002/net.20159","title":"The bridges of Königsberg—A historical perspective","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Perspective (graphical); Computer science; Graph theory; Graph; Operations research; Combinatorics; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01678236245234923,"score_gpt":0.2940905582696183,"score_spread":0.27730819581726907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251692629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015312626,0.003015156,0.986481,0.0008524045,0.00045110806,0.000088995585,1.4817266e-7,0.000057986137,0.0075219194],"genre_scores_gemma":[0.99399954,0.000110011046,0.004377724,0.00006152614,0.00020265653,0.0000037123057,1.4114158e-7,0.00000745754,0.0012372066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989263,0.00006981651,0.00015707784,0.0002051426,0.0002828039,0.00035886126],"domain_scores_gemma":[0.998331,0.00084134005,0.00006270268,0.0004994964,0.00018878418,0.00007665961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010367327,0.000070323484,0.000097468896,0.000049169143,0.00017986818,0.000027734564,0.0008943595,0.000049076763,0.000002768441],"category_scores_gemma":[0.00012548214,0.000049386905,0.000064403626,0.0004817628,0.00012305746,0.00011746495,0.00020591165,0.0002479911,0.0000052988703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003680879,0.000027875532,0.0005622922,0.0000010429704,0.000012312507,0.000011973133,0.00031119076,0.0011487586,0.00005404112,0.9378015,0.0029621075,0.0570701],"study_design_scores_gemma":[0.0012170556,0.0008172033,0.051613912,0.000056722263,0.000015664089,0.00008133336,0.0012718813,0.23766911,0.0026182511,0.52439094,0.1794233,0.0008246561],"about_ca_topic_score_codex":0.000039228176,"about_ca_topic_score_gemma":0.000047622656,"teacher_disagreement_score":0.9924683,"about_ca_system_score_codex":0.00029309123,"about_ca_system_score_gemma":0.00002667839,"threshold_uncertainty_score":0.20139395},"labels":[],"label_agreement":null},{"id":"W4251854703","doi":"10.1002/net.20368","title":"A polyhedral study of the network pricing problem with connected toll arcs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Toll; Revenue; Flow network; Network planning and design; Mathematical optimization; Computer science; Mathematical economics; Mathematics; Operations research; Business; Computer network; Finance","score_opus":0.009393117172837029,"score_gpt":0.24659428467428937,"score_spread":0.23720116750145234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251854703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97718,0.000095177726,0.010491407,0.00060979783,0.00018579369,0.00076757144,6.08362e-7,0.000119250304,0.010550411],"genre_scores_gemma":[0.9985972,0.000006817,0.0008280046,0.00015217264,0.00017877237,0.0000048474267,0.000003552495,0.000004735337,0.00022390511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99917877,0.00012587992,0.00015404115,0.00011355388,0.00022762855,0.00020013074],"domain_scores_gemma":[0.99960476,0.000059616035,0.00012267566,0.00010642598,0.000070310685,0.00003620364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023974432,0.00006330568,0.00010328788,0.000011966029,0.00036511838,0.000026785703,0.00013312357,0.000052630057,0.000012059579],"category_scores_gemma":[0.00001012902,0.00004240908,0.000020458447,0.00057160156,0.000047835812,0.000066107976,0.0000033439635,0.000114349525,2.932841e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042201165,0.000084508996,0.15700175,9.976362e-7,0.00001152338,0.0000012239796,0.013157715,0.8255485,8.302731e-7,0.002261846,0.00042234917,0.0014665469],"study_design_scores_gemma":[0.0012242039,0.00058026315,0.9689381,0.00016123845,0.00008445607,8.2818207e-7,0.007470043,0.019865409,0.0000026595433,0.00043429533,0.001030992,0.00020749377],"about_ca_topic_score_codex":0.00042889663,"about_ca_topic_score_gemma":0.0034305952,"teacher_disagreement_score":0.8119364,"about_ca_system_score_codex":0.000014877217,"about_ca_system_score_gemma":0.00005382973,"threshold_uncertainty_score":0.28082323},"labels":[],"label_agreement":null},{"id":"W4253133138","doi":"10.1002/net.20106","title":"Variations of the prize‐collecting Steiner tree problem","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Steiner tree problem; Bottleneck; Combinatorics; Spanning tree; Mathematics; k-minimum spanning tree; Graph; Tree (set theory); Path (computing); Discrete mathematics; Time complexity; K-ary tree; Computer science; Tree structure; Binary tree","score_opus":0.04312057372365112,"score_gpt":0.3182009348621068,"score_spread":0.2750803611384557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253133138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028188493,0.00009976604,0.7339741,0.0026208102,0.0004827925,0.00054529775,0.0000071598047,0.00006914043,0.23401247],"genre_scores_gemma":[0.97570825,7.9656576e-7,0.0017535059,0.00007276628,0.0002717142,0.000030771385,0.0000012579021,0.000005113142,0.02215584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988281,0.00013919093,0.0004012804,0.00017520778,0.00033785336,0.00011833181],"domain_scores_gemma":[0.99845874,0.0006659308,0.00028054343,0.00042575563,0.00014916988,0.000019844854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010033202,0.000058024045,0.0001007471,0.000045115718,0.00036233582,0.000055999702,0.00040211272,0.000055352903,0.00024371788],"category_scores_gemma":[0.00017314989,0.000034219098,0.00008565598,0.001304758,0.000075819094,0.000081829254,0.00006941413,0.00011232901,0.000028923916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012484093,0.00012903761,0.011644749,0.0000014126468,0.000013823226,1.4744057e-7,0.00020908561,0.20027491,0.0006619352,0.6772272,0.06868687,0.041138336],"study_design_scores_gemma":[0.00038456,0.00002377278,0.058976937,0.000018043314,0.00003061229,0.000006510356,0.00022738615,0.07564039,0.00071724685,0.76356614,0.10024709,0.00016133976],"about_ca_topic_score_codex":0.000025614814,"about_ca_topic_score_gemma":0.00009952538,"teacher_disagreement_score":0.9475197,"about_ca_system_score_codex":0.000012778639,"about_ca_system_score_gemma":0.00003177421,"threshold_uncertainty_score":0.2786831},"labels":[],"label_agreement":null},{"id":"W4255492803","doi":"10.1002/net.20061","title":"Exact solution of the centralized network design problem on directed graphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Column generation; Cutting-plane method; Lagrangian relaxation; Spanning tree; Steiner tree problem; Mathematical optimization; Branch and bound; Directed graph; Linear programming relaxation; Interior point method; Branch and cut; Mathematics; Relaxation (psychology); Constraint (computer-aided design); Upper and lower bounds; Tree (set theory); Point (geometry); Computer science; Linear programming; Integer programming; Combinatorics","score_opus":0.01629736232607209,"score_gpt":0.23421502231816474,"score_spread":0.21791765999209264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255492803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037354329,0.000502415,0.9913509,0.00011296329,0.00054164213,0.00044046188,0.0000010926849,0.00064580666,0.0026692697],"genre_scores_gemma":[0.744341,0.0001542704,0.25495362,0.000082413164,0.0003122051,0.000018486773,0.000004575482,0.000046644083,0.00008677759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988103,0.00027754993,0.00027422805,0.00013262463,0.00015285799,0.00035245545],"domain_scores_gemma":[0.9993789,0.00018427064,0.000077441146,0.00027293692,0.000038551774,0.000047895635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049909606,0.0001421458,0.00016879952,0.000030803338,0.00009230384,0.000016945696,0.00017260802,0.00013358751,0.000045641715],"category_scores_gemma":[0.000029305455,0.000113766575,0.000082117884,0.0005524272,0.000030936386,0.00005566368,0.000021520775,0.00024037322,0.000003872243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017354316,0.000013673914,0.0005026048,0.000006955669,0.000025857566,1.3680273e-7,0.000051423518,0.9736042,0.00012946042,0.00034170234,0.008123526,0.01718309],"study_design_scores_gemma":[0.00030517078,0.000016217982,0.0024892425,0.000084764695,0.00002020799,0.0000011264896,0.0000013441019,0.99459845,0.0006622553,0.000176293,0.0015266878,0.00011824374],"about_ca_topic_score_codex":0.0000035763333,"about_ca_topic_score_gemma":0.000005052309,"teacher_disagreement_score":0.74060553,"about_ca_system_score_codex":0.00006388223,"about_ca_system_score_gemma":0.000010519101,"threshold_uncertainty_score":0.4639266},"labels":[],"label_agreement":null},{"id":"W4256141174","doi":"10.1002/net.20362","title":"Lagrangean‐based decomposition algorithms for multicommodity network design problems with penalized constraints","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Mathematical optimization; Decomposition; Flow network; Convergence (economics); Relaxation (psychology); Network planning and design; Context (archaeology); Computer science; Decomposition method (queueing theory); Nonlinear system; Integer (computer science); Algorithm; Mathematics","score_opus":0.04144083009145854,"score_gpt":0.3149675041647392,"score_spread":0.27352667407328063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256141174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005713601,0.0000838991,0.9964524,0.0006217675,0.00015323116,0.00090058876,0.0000073927704,0.0001978669,0.0010115317],"genre_scores_gemma":[0.76365596,0.000019848552,0.23504707,0.00055245106,0.00036016182,0.000053559274,0.00024311879,0.000010719772,0.000057087836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988428,0.00017232391,0.0001855409,0.00020432277,0.00020260215,0.0003924094],"domain_scores_gemma":[0.99922824,0.00029561503,0.00012237112,0.00008948007,0.00015430582,0.00010996393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074331,0.000116860756,0.00015498228,0.000030731044,0.0006812588,0.00008872948,0.00010950626,0.000134442,0.000049386163],"category_scores_gemma":[0.000016504782,0.0001068595,0.000050564147,0.00024506965,0.00013897117,0.0001334525,0.0000011782804,0.00010751206,0.0000017332516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001681888,0.000056346547,0.0007007356,0.000003557307,0.0000108031245,0.0000018526754,0.0006769569,0.9808728,0.0000024991555,0.0013133768,0.0016749143,0.014517935],"study_design_scores_gemma":[0.0027180838,0.0003128064,0.0058187265,0.00016106652,0.00008193643,9.119431e-7,0.00015385642,0.9852669,0.0000123552545,0.0010583883,0.004103161,0.00031180645],"about_ca_topic_score_codex":0.000057787016,"about_ca_topic_score_gemma":0.00027990865,"teacher_disagreement_score":0.7630846,"about_ca_system_score_codex":0.00003880223,"about_ca_system_score_gemma":0.00009475911,"threshold_uncertainty_score":0.5239761},"labels":[],"label_agreement":null},{"id":"W4256347034","doi":"10.1002/net.20318","title":"Improper coloring of unit disk graphs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Complete coloring; Mathematics; Indifference graph; Edge coloring; Chromatic scale; Graph coloring; Discrete mathematics; Chordal graph; Graph; Interval graph; Computer science; Interval (graph theory); Unit disk; 1-planar graph; Line graph; Graph power","score_opus":0.021960333528217062,"score_gpt":0.2843527786470723,"score_spread":0.26239244511885523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256347034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09576763,0.0006222222,0.8941368,0.00024131755,0.00024867314,0.0001977425,5.759873e-7,0.00015283718,0.008632224],"genre_scores_gemma":[0.9919477,0.000059418708,0.0076179425,0.000118124735,0.000043643544,0.0000043142536,6.568573e-7,0.000005166157,0.0002030511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999056,0.00006076845,0.00014676654,0.00021704347,0.00020042104,0.00031900004],"domain_scores_gemma":[0.999207,0.00008061402,0.000049178034,0.00050164515,0.00007985834,0.00008165839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028990005,0.00008395412,0.0001245863,0.000090438385,0.0000755812,0.000032524127,0.0007834257,0.00005159083,0.00001036604],"category_scores_gemma":[0.000019063553,0.00007115846,0.00005457827,0.0007809225,0.000067184475,0.00026795358,0.00013471842,0.00021071733,0.000006844862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033812754,0.000068223104,0.0026006524,0.0000048468287,0.000013680974,0.0000152089815,0.00015370682,0.018551521,0.001316013,0.6932797,0.00027318194,0.28368947],"study_design_scores_gemma":[0.0010711226,0.0010453404,0.05185123,0.000101123216,0.000010473571,0.000019827285,0.000044135635,0.46279487,0.004612857,0.47279826,0.005072464,0.0005783052],"about_ca_topic_score_codex":0.0000032773214,"about_ca_topic_score_gemma":0.0000020913371,"teacher_disagreement_score":0.89618003,"about_ca_system_score_codex":0.000009364385,"about_ca_system_score_gemma":0.000016998525,"threshold_uncertainty_score":0.29017577},"labels":[],"label_agreement":null},{"id":"W4288759802","doi":"10.1002/net.22118","title":"Capacity provisioning for evacuation on path networks","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Computer science; Flow network; Mathematical optimization; Exploit; Sink (geography); Path (computing); Provisioning; Parametric statistics; Linear programming; Computer network; Mathematics; Algorithm","score_opus":0.012817695259568067,"score_gpt":0.21010604387331971,"score_spread":0.19728834861375164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288759802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05613427,0.00020591596,0.9382375,0.000093323375,0.0014804803,0.00054620707,0.000015208842,0.00046084845,0.0028262546],"genre_scores_gemma":[0.99778074,0.000020194751,0.00090901356,0.00031813106,0.0003407608,0.00027032557,0.00014378868,0.000041731637,0.00017534131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992245,0.000034799534,0.00017502627,0.00015456758,0.00016618139,0.0002449491],"domain_scores_gemma":[0.9996048,0.00010893728,0.000036334764,0.00017066009,0.00002917771,0.000050086168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031488977,0.00011646301,0.000108321365,0.00004411822,0.00029379525,0.000035239995,0.00011474255,0.000065795815,0.00009609155],"category_scores_gemma":[0.000016467475,0.0001280977,0.00006250396,0.00017768692,0.000009492589,0.000055922857,0.000028382156,0.00032608846,0.0000038979465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017001303,0.0000143508505,0.00017820849,0.0000063124835,0.00001119612,4.6995615e-7,0.000076130484,0.96936774,0.000012336823,0.0026548204,0.006764716,0.020896714],"study_design_scores_gemma":[0.00030324407,0.00008642341,0.00075908087,0.000009539793,0.000009653288,0.0000015693389,0.00003650748,0.9893529,0.000005102233,0.00031927176,0.008973152,0.00014358663],"about_ca_topic_score_codex":0.0000017511176,"about_ca_topic_score_gemma":0.0000054500374,"teacher_disagreement_score":0.94164646,"about_ca_system_score_codex":0.0001542677,"about_ca_system_score_gemma":0.000009204968,"threshold_uncertainty_score":0.5223673},"labels":[],"label_agreement":null},{"id":"W4311519325","doi":"10.1002/net.22133","title":"Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Train; Integer programming; Arc routing; Computer science; Routing (electronic design automation); Path (computing); Mathematical optimization; Sorting; Yard; Integer (computer science); Linear programming; Operations research; Mathematics; Algorithm; Computer network","score_opus":0.012625914508705316,"score_gpt":0.194890541610702,"score_spread":0.18226462710199667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311519325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010107415,0.0015404867,0.99586517,0.000083717525,0.00036082056,0.0005837087,0.000003234319,0.00015449546,0.00039762713],"genre_scores_gemma":[0.98179656,0.00008728535,0.017037794,0.000034412038,0.00015999196,0.00056342303,0.00008348917,0.000033039818,0.0002040012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933535,0.00002589549,0.00020386121,0.00011158865,0.000108753244,0.00021453208],"domain_scores_gemma":[0.9997564,0.000043003693,0.000038326565,0.0000982694,0.00002167756,0.00004232456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032761958,0.000108253764,0.000096098855,0.000033079603,0.00023172285,0.0000758676,0.000093558985,0.00003358308,0.000011094538],"category_scores_gemma":[0.0000030138776,0.000080881466,0.0000352117,0.00014914329,0.000008893368,0.00014517292,0.000023799637,0.00014129789,1.6069058e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006120767,0.0000066450884,0.0000016722197,0.000013712473,0.000011789083,2.4019093e-7,0.0007866447,0.8884019,0.00000570716,0.0010705371,0.0013955618,0.10829946],"study_design_scores_gemma":[0.00029880874,0.000044175787,0.000002376714,0.000020599902,0.0000120330005,0.0000056330837,0.0007321344,0.98185426,0.0000049104933,0.00013208769,0.016793635,0.0000993274],"about_ca_topic_score_codex":0.0000777969,"about_ca_topic_score_gemma":0.000056938814,"teacher_disagreement_score":0.98078585,"about_ca_system_score_codex":0.00007888899,"about_ca_system_score_gemma":0.000013962572,"threshold_uncertainty_score":0.32982507},"labels":[],"label_agreement":null},{"id":"W4362665816","doi":"10.1002/net.22147","title":"The probabilistic uncapacitated open vehicle routing location problem","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Heuristics; Computer science; Service (business); Probabilistic logic; Simple (philosophy); Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Tree (set theory); Computer network; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.02512845140514344,"score_gpt":0.27067178824854166,"score_spread":0.2455433368433982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362665816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03363268,0.00043932436,0.9263089,0.0011077553,0.0016814836,0.002429142,0.0000037071932,0.005047913,0.029349146],"genre_scores_gemma":[0.9887626,0.00006652991,0.009953896,0.000044996283,0.00017447537,0.00013778868,0.00002881507,0.00006840906,0.00076244987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989081,0.00013519579,0.00027552457,0.00017152575,0.00012869843,0.00038095785],"domain_scores_gemma":[0.9990841,0.00041566486,0.00004811738,0.0002949154,0.000102180406,0.00005499809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014397119,0.00012014146,0.00011477223,0.00003299955,0.00034472707,0.000284176,0.00040808553,0.00008763368,0.000009418676],"category_scores_gemma":[0.00021253864,0.0000988595,0.000022615528,0.00132075,0.00003953085,0.00014205978,0.000119701355,0.00023421054,0.00007061017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033756046,0.00000308443,0.0003051187,0.000013446509,0.000014745688,8.432646e-7,0.00015869392,0.969932,0.000037058384,0.0017733423,0.0038660823,0.023892166],"study_design_scores_gemma":[0.00017299366,0.000010056884,0.0015101088,0.000046701534,0.000008242191,0.0000012724372,0.000071642826,0.99525034,0.000027638362,0.00095474184,0.0018211515,0.00012509945],"about_ca_topic_score_codex":0.000013051685,"about_ca_topic_score_gemma":0.000021292306,"teacher_disagreement_score":0.95513,"about_ca_system_score_codex":0.00008081628,"about_ca_system_score_gemma":0.000022401502,"threshold_uncertainty_score":0.40313733},"labels":[],"label_agreement":null},{"id":"W4372352878","doi":"10.1002/net.22150","title":"Existence of optimally‐greatest digraphs for strongly connected node reliability","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Strongly connected component; Node (physics); Reliability (semiconductor); Mathematics; Combinatorics; Directed graph; Graph; Discrete mathematics; Computer science","score_opus":0.011205896267939299,"score_gpt":0.21777872761502384,"score_spread":0.20657283134708454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372352878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47140864,0.00023549046,0.51990086,0.00015410794,0.00096227624,0.001059575,0.0000688701,0.0013783423,0.004831819],"genre_scores_gemma":[0.9873628,0.0002413503,0.011967036,0.000010517666,0.00006735171,0.00009253997,0.00011016994,0.000029641216,0.00011858345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991546,0.000015160909,0.0002657682,0.00018928612,0.000083795516,0.00029138444],"domain_scores_gemma":[0.9992432,0.00022875052,0.00003995249,0.00030069865,0.00013765783,0.000049715796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025203064,0.000119025186,0.00019690073,0.00004896775,0.00004252828,0.000014748428,0.00013364383,0.00012127432,0.000015572767],"category_scores_gemma":[0.00015639584,0.00011641096,0.00008825241,0.00043781238,0.000070229566,0.0000983506,0.000020640118,0.00010568816,0.0000048129364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002699295,0.000012245577,0.0016800968,0.00009296003,0.00001349328,4.7105618e-7,0.000054928783,0.9945777,0.0000810198,0.0006757898,0.0015102627,0.0012740482],"study_design_scores_gemma":[0.0002966639,0.000054934844,0.006713048,0.00005072283,0.000014371855,4.735131e-7,0.0000402117,0.9911915,0.00016867406,0.0005372345,0.0008111784,0.00012099724],"about_ca_topic_score_codex":0.000011372664,"about_ca_topic_score_gemma":0.0000106468915,"teacher_disagreement_score":0.51595414,"about_ca_system_score_codex":0.00003172477,"about_ca_system_score_gemma":0.000011020298,"threshold_uncertainty_score":0.47471014},"labels":[],"label_agreement":null},{"id":"W4381434719","doi":"10.1002/net.22166","title":"On the split reliability of graphs","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Reliability (semiconductor); Graph; Random graph; Discrete mathematics; Computer science","score_opus":0.006908805412771038,"score_gpt":0.1889312714313677,"score_spread":0.18202246601859667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381434719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93188214,0.000100359466,0.03618625,0.0007860009,0.0011775056,0.000450815,0.0000058075307,0.00078121957,0.028629877],"genre_scores_gemma":[0.99943906,0.00023923682,0.00011384802,0.000045731,0.000028402765,0.000016179398,0.0000064966025,0.00001044385,0.00010059556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995809,0.000019144172,0.0001184385,0.00007832666,0.000073232186,0.0001299202],"domain_scores_gemma":[0.99946696,0.0002084934,0.000013703934,0.00026782512,0.00002613332,0.000016869939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029929148,0.000055323402,0.00007325165,0.000022036074,0.000028866334,0.000006257513,0.00008913632,0.000056686757,0.000048310045],"category_scores_gemma":[0.00008444659,0.000037267557,0.000045505818,0.00036961224,0.00004161378,0.000026865586,0.000013046561,0.00011875329,0.000025592051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043517375,0.000004401403,0.00019920227,0.0000125429015,0.0000035479784,2.0098798e-7,0.000035518733,0.9666157,0.000009332624,0.015153578,0.016657723,0.001303942],"study_design_scores_gemma":[0.000051731902,0.000016712904,0.00458746,0.000023702449,0.0000033553215,1.2124842e-7,0.000018461762,0.9772006,0.00006823152,0.016657483,0.00132364,0.0000484766],"about_ca_topic_score_codex":0.000004287401,"about_ca_topic_score_gemma":0.0000023396537,"teacher_disagreement_score":0.0675569,"about_ca_system_score_codex":0.000013235483,"about_ca_system_score_gemma":0.0000026413122,"threshold_uncertainty_score":0.1519727},"labels":[],"label_agreement":null},{"id":"W4384406331","doi":"10.1002/net.22170","title":"Two‐stage stochastic one‐to‐many driver matching for ridesharing","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matching (statistics); Benchmark (surveying); Profitability index; Computer science; Set (abstract data type); Mathematical optimization; Stochastic modelling; Operations research; Mathematics; Economics; Finance","score_opus":0.023998235086841346,"score_gpt":0.26334454789435763,"score_spread":0.23934631280751628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384406331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15748262,0.000010314301,0.839944,0.0000795423,0.000515853,0.00032885707,0.000025846872,0.00086950575,0.000743439],"genre_scores_gemma":[0.9964857,0.0000034339762,0.0024115632,0.00016079455,0.000200047,0.00014769718,0.000116550385,0.000037952737,0.00043624584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993435,0.0000027999938,0.00018327765,0.0001341915,0.00007934046,0.00025688196],"domain_scores_gemma":[0.99966127,0.00008038431,0.000013515564,0.00014811808,0.000035282752,0.000061413804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012304669,0.00009145848,0.00010167771,0.000107030944,0.000085303036,0.000031129206,0.000088174245,0.000046305544,0.00005272303],"category_scores_gemma":[0.000009965358,0.00011054473,0.000042441123,0.00043315307,0.000007978468,0.000071849594,0.000009868879,0.0001270544,0.0000760763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033092845,0.000004739348,0.0000927244,0.000021566182,0.000021120028,7.7286415e-7,0.0003289732,0.9843517,0.00045345668,0.011197092,0.0014011305,0.0021234378],"study_design_scores_gemma":[0.00042695794,0.000012652256,0.013743879,0.00005927476,0.000019893932,3.1211582e-7,0.00011387919,0.9804811,0.00006215832,0.0010336164,0.0038352609,0.00021101502],"about_ca_topic_score_codex":0.000011191713,"about_ca_topic_score_gemma":0.00013163357,"teacher_disagreement_score":0.8390031,"about_ca_system_score_codex":0.00003085107,"about_ca_system_score_gemma":0.00000641697,"threshold_uncertainty_score":0.45078832},"labels":[],"label_agreement":null},{"id":"W4389738699","doi":"10.1002/net.22200","title":"Learning to repeatedly solve routing problems","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Focus (optics); Routing (electronic design automation); Optimization problem; Resolution (logic); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01633280587669093,"score_gpt":0.2509699629027951,"score_spread":0.2346371570261042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389738699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064107895,0.00007429473,0.91853696,0.00011227334,0.0007880369,0.0002570542,5.818101e-7,0.0053420705,0.010780807],"genre_scores_gemma":[0.963487,0.00005497934,0.034629066,0.00008203613,0.00042629658,0.00003496307,0.000021514028,0.00010692328,0.0011572089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896777,0.00005016053,0.00022498769,0.00019390804,0.00012332076,0.00043983824],"domain_scores_gemma":[0.9995381,0.00012131076,0.000024198558,0.00017791841,0.000037705482,0.00010075335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197172,0.00012654261,0.00014043745,0.000103687016,0.00012250664,0.00006401489,0.00012284174,0.00010907206,0.00003168608],"category_scores_gemma":[0.00014875845,0.00014244094,0.000039877985,0.0010542837,0.000007499088,0.000063709755,0.00006719781,0.0003524102,0.00020341213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010541636,0.0000013010601,0.0017537709,0.00001005435,0.000012085009,0.0000039907827,0.0006215654,0.96787703,0.00022127587,0.000037368605,0.0023206023,0.027139928],"study_design_scores_gemma":[0.00009494781,0.000019113484,0.0011761923,0.000061742016,0.000005370688,0.0000023721486,0.000092354894,0.9943155,0.00008365681,0.000018128314,0.00396698,0.00016361118],"about_ca_topic_score_codex":0.0000052696582,"about_ca_topic_score_gemma":0.0000027040344,"teacher_disagreement_score":0.89937913,"about_ca_system_score_codex":0.000048640282,"about_ca_system_score_gemma":0.0000057399357,"threshold_uncertainty_score":0.58085734},"labels":[],"label_agreement":null},{"id":"W4392370783","doi":"10.1002/net.22215","title":"New approximations for network reliability","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reliability (semiconductor); Computer science; Mathematical optimization; Mathematics; Physics","score_opus":0.005889379222958262,"score_gpt":0.2123280333768972,"score_spread":0.20643865415393894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392370783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012711176,0.0060978234,0.98338217,0.00018754661,0.0038822568,0.00025166254,0.0000039623696,0.0007953999,0.004128083],"genre_scores_gemma":[0.95865536,0.0004589255,0.03029396,0.00011590879,0.008516809,0.00011582587,0.000040036204,0.00006226436,0.0017409282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941486,0.0000073690744,0.00012813348,0.00014336474,0.00005949516,0.00024674908],"domain_scores_gemma":[0.99957883,0.0001709878,0.0000047319663,0.00016106333,0.000012112816,0.000072284354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014758905,0.000085273896,0.000086793276,0.00001844132,0.00006759441,0.000064387874,0.000097413424,0.00010027945,0.000059608396],"category_scores_gemma":[0.000013668723,0.000077935714,0.00007020871,0.00024938319,0.000016562351,0.00009136463,0.000013424237,0.00017437796,0.000026266525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017444735,0.0000017963425,0.00003464167,0.000059169735,0.000008970407,6.1675684e-7,0.00006176284,0.7539032,0.00000259588,0.005365426,0.2272778,0.013282234],"study_design_scores_gemma":[0.00003827178,0.000007826468,0.00013807967,0.000038826834,0.000007664892,0.0000016254768,0.0000037827613,0.7229065,0.000008970353,0.0043026255,0.27247253,0.00007332236],"about_ca_topic_score_codex":0.0000037856835,"about_ca_topic_score_gemma":0.000014303114,"teacher_disagreement_score":0.9573842,"about_ca_system_score_codex":0.000027684859,"about_ca_system_score_gemma":0.000019476402,"threshold_uncertainty_score":0.31781262},"labels":[],"label_agreement":null},{"id":"W4394711223","doi":"10.1002/net.22219","title":"Maximum flow‐based formulation for the optimal location of electric vehicle charging stations","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Hydro-Québec; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Institut de Valorisation des Données; Hydro-Québec","keywords":"Electric vehicle; Flow (mathematics); Environmental science; Power flow; Computer science; Automotive engineering; Electrical engineering; Mechanics; Engineering; Physics; Power (physics); Electric power system; Thermodynamics","score_opus":0.006574409685676398,"score_gpt":0.21445929984263717,"score_spread":0.20788489015696077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394711223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017935632,0.004294652,0.9768954,0.00011984047,0.0002536863,0.0002508425,0.0000042131624,0.00015099306,0.00009474287],"genre_scores_gemma":[0.9972059,0.000058498485,0.0023270913,0.000032339925,0.00025620713,0.00004230752,0.000036173384,0.000024840814,0.000016626926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995188,0.000006015906,0.00014652309,0.00008227044,0.000075344564,0.00017102971],"domain_scores_gemma":[0.9996324,0.00016978753,0.00001712479,0.00009736325,0.000065411725,0.000017921888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101578225,0.000074858275,0.0000678567,0.00006096574,0.00007264364,0.00003800001,0.000067020235,0.000063622065,0.000015815383],"category_scores_gemma":[0.000009175054,0.000058539114,0.00004032266,0.00061814405,0.000004410819,0.000098690856,0.0000035843982,0.00013590824,0.0000015791645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054249995,0.0000021548271,0.000023770695,0.00006151124,0.000021746271,1.1840246e-7,0.00005344774,0.8993207,0.0011657123,0.001150497,0.0015124655,0.09668246],"study_design_scores_gemma":[0.00011916806,0.000032268243,0.0009408976,0.000032738822,0.00002979233,7.6105675e-7,0.000007797712,0.99496526,0.0017510474,0.00038352617,0.0016724806,0.00006427134],"about_ca_topic_score_codex":0.000003611464,"about_ca_topic_score_gemma":0.0000025663749,"teacher_disagreement_score":0.9792703,"about_ca_system_score_codex":0.000047913094,"about_ca_system_score_gemma":0.000026186446,"threshold_uncertainty_score":0.23871557},"labels":[],"label_agreement":null},{"id":"W4394846135","doi":"10.1002/net.22218","title":"A flow‐based ascending auction to compute buyer‐optimal Walrasian prices","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Walrasian auction; Valuation (finance); Mathematical economics; Economics; Market clearing; Matching (statistics); Generalization; Combinatorial auction; Microeconomics; Mathematical optimization; Vickrey auction; Common value auction; Mathematics; Auction theory; Finance","score_opus":0.06759753866968733,"score_gpt":0.3991526356420333,"score_spread":0.331555096972346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394846135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006672412,0.00015036577,0.98345286,0.0038836424,0.0016527821,0.00020901607,0.000006548495,0.0002991043,0.0036732706],"genre_scores_gemma":[0.9810783,0.000003840236,0.015238017,0.0005127192,0.0012077977,0.00004731775,0.000009997582,0.000016657228,0.0018853297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982854,0.000091912756,0.00036221428,0.0005242862,0.0004785506,0.00025760767],"domain_scores_gemma":[0.99865395,0.00063088053,0.00006538799,0.00039603168,0.00008638036,0.00016734976],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013395057,0.00012838842,0.00015580122,0.00025316566,0.00032364266,0.000577197,0.00039792687,0.00009345734,0.00081929605],"category_scores_gemma":[0.00010502307,0.00010231332,0.00011706612,0.001688535,0.00004960985,0.00025669346,0.00007196583,0.00022450491,0.0016048745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017492901,0.000020551672,0.00004240675,0.000002413934,0.000010497306,0.000004353923,0.00022935192,0.74863106,0.00003931964,0.012814834,0.052482553,0.18570517],"study_design_scores_gemma":[0.000052564646,0.000028263174,0.00042161686,0.000027043005,0.000008908439,0.000007806889,0.00011990062,0.73665076,0.00006416631,0.0038251046,0.25869098,0.000102887],"about_ca_topic_score_codex":0.000005092871,"about_ca_topic_score_gemma":0.00000826122,"teacher_disagreement_score":0.9744059,"about_ca_system_score_codex":0.00005738105,"about_ca_system_score_gemma":0.00004365922,"threshold_uncertainty_score":0.9991725},"labels":[],"label_agreement":null},{"id":"W4395690405","doi":"10.1002/net.22222","title":"Network design with vulnerability constraints and probabilistic edge reliability","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backup; Enhanced Data Rates for GSM Evolution; Probabilistic logic; Reliability (semiconductor); Computer science; Path (computing); Mathematical optimization; Network planning and design; Mathematics; Computer network; Artificial intelligence","score_opus":0.010452731007824328,"score_gpt":0.20145504541877496,"score_spread":0.19100231441095064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395690405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008669863,0.0017468767,0.98479533,0.00013887486,0.00065949565,0.00071969425,0.0000038064493,0.0008482265,0.0024178268],"genre_scores_gemma":[0.98213506,0.00021446866,0.017130423,0.00004756088,0.00027577978,0.00009257986,0.000011402776,0.000040608735,0.000052107287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876505,0.00009512156,0.00025091364,0.0003925248,0.000110187335,0.00038621062],"domain_scores_gemma":[0.9990919,0.00040920568,0.0000149961825,0.00031369028,0.000061877356,0.000108325155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080703746,0.00020880636,0.00021821237,0.000023958406,0.0000876265,0.00012402011,0.00008206316,0.00015915967,0.00006468419],"category_scores_gemma":[0.000083635015,0.00016503903,0.000032999662,0.00032529552,0.00037515644,0.00018303627,0.000023832137,0.00038821445,0.0000073839833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027934517,0.000011851198,0.00029386283,0.00019711506,0.000019413546,0.00000678779,0.00007161396,0.9776774,0.000003041277,0.0017364359,0.0034857397,0.01646881],"study_design_scores_gemma":[0.00014029906,0.00007911706,0.0008185332,0.00018869176,0.00003420431,0.000020553909,0.000011256189,0.9895636,0.000004967455,0.0074527236,0.0014718672,0.00021420723],"about_ca_topic_score_codex":0.0000041586086,"about_ca_topic_score_gemma":0.000008765183,"teacher_disagreement_score":0.9734652,"about_ca_system_score_codex":0.00010400539,"about_ca_system_score_gemma":0.000040858664,"threshold_uncertainty_score":0.67300963},"labels":[],"label_agreement":null},{"id":"W4400739389","doi":"10.1002/net.22242","title":"Three network design problems for community energy storage","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.027192181879567113,"score_gpt":0.20845300647603787,"score_spread":0.18126082459647075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400739389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018754414,0.0060665747,0.9857216,0.00003937235,0.0034317258,0.00025059222,0.0000021024064,0.0013346666,0.0029658498],"genre_scores_gemma":[0.976626,0.00049240177,0.016809616,0.00023734281,0.0042258743,0.0007420091,0.0000900849,0.00022727608,0.00054943765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900806,0.00005624236,0.00019908747,0.00015840189,0.0001046421,0.00047355628],"domain_scores_gemma":[0.999143,0.00034298375,0.0000131003735,0.00041181047,0.000018450317,0.00007067071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005602477,0.0002049306,0.00017333137,0.00005431187,0.00016236442,0.00012071794,0.00027788355,0.00012619418,0.00003390464],"category_scores_gemma":[0.0000055099913,0.00020666065,0.000086330576,0.00032139456,0.000024132942,0.00010105788,0.00007889451,0.0003388833,0.000010966643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040802806,0.0000066583366,0.000007804793,0.00006267639,0.00010029592,0.0000036089707,0.000029879755,0.738586,0.000004439925,0.0065760645,0.23574777,0.018870726],"study_design_scores_gemma":[0.00009572196,0.000039950493,0.000061694554,0.00008827663,0.00002933385,0.0000014594407,0.000005625391,0.7784033,0.000008773668,0.0042875297,0.2168038,0.00017452269],"about_ca_topic_score_codex":0.00005990143,"about_ca_topic_score_gemma":0.00048784068,"teacher_disagreement_score":0.9764384,"about_ca_system_score_codex":0.00010653587,"about_ca_system_score_gemma":0.0000091276615,"threshold_uncertainty_score":0.8427377},"labels":[],"label_agreement":null},{"id":"W4403556658","doi":"10.1002/net.22251","title":"Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Nonlinear system; Electric vehicle; Computer science; Graph; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network; Theoretical computer science; Physics; Power (physics)","score_opus":0.015748927321926454,"score_gpt":0.23598880879591413,"score_spread":0.22023988147398768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403556658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015579894,0.0022943444,0.9929009,0.0001783415,0.00035319218,0.00045833754,0.0000048434185,0.0010871307,0.0011649047],"genre_scores_gemma":[0.9171853,0.00014135671,0.08129497,0.0000634559,0.0006946359,0.00019205379,0.00001793573,0.00012555059,0.00028475965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903154,0.000033244334,0.0002011291,0.00021772245,0.000118941396,0.0003974359],"domain_scores_gemma":[0.99923915,0.00042742217,0.000023706147,0.00020397751,0.000057404955,0.00004834421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034655,0.00016099242,0.00013167893,0.000087138666,0.0002561093,0.00017083164,0.00013295608,0.00009074459,0.000009972554],"category_scores_gemma":[0.0000121432195,0.00011741784,0.000073256495,0.0009352376,0.000015005379,0.00017011717,0.000017329898,0.00036073272,0.000004711252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007901795,0.000004603713,0.000039624527,0.000035337573,0.00008458628,0.0000010427898,0.00014209488,0.9730016,0.00012385794,0.0009239098,0.0006630578,0.024972389],"study_design_scores_gemma":[0.00018423627,0.00002771521,0.000021157366,0.000084535655,0.00006040674,0.000007630428,0.000038924223,0.9976991,0.00007278398,0.0002178611,0.0014276231,0.00015806036],"about_ca_topic_score_codex":0.0000065035083,"about_ca_topic_score_gemma":0.0000071003915,"teacher_disagreement_score":0.9156273,"about_ca_system_score_codex":0.000053043583,"about_ca_system_score_gemma":0.000024901881,"threshold_uncertainty_score":0.47881606},"labels":[],"label_agreement":null},{"id":"W4405402617","doi":"10.1002/net.22250","title":"The workforce scheduling and routing problem with park‐and‐loop","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Institut de Valorisation des Données","keywords":"Vehicle routing problem; Loop (graph theory); Workforce; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Job shop scheduling; Routing (electronic design automation); Mathematics; Economics; Computer network; Combinatorics; Economic growth","score_opus":0.010000771375888149,"score_gpt":0.23543693567133323,"score_spread":0.22543616429544508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405402617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03389039,0.013070082,0.9481543,0.00020893726,0.00023795756,0.00016557385,2.9426772e-7,0.00071279856,0.0035596993],"genre_scores_gemma":[0.8957331,0.00090837735,0.10277267,0.000028779285,0.00023591743,0.000016701697,0.000001367128,0.000054074368,0.00024900047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993657,0.00003525752,0.00013195735,0.00015037466,0.00007356733,0.00024315453],"domain_scores_gemma":[0.9994892,0.0003220424,0.000013708668,0.00010822632,0.000015300495,0.000051554798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005123989,0.00011090895,0.00008792355,0.00002030887,0.00017798817,0.0002977615,0.000056073844,0.00006744548,0.0000021578178],"category_scores_gemma":[0.00001821641,0.000075837714,0.000012543277,0.00023220753,0.000042859905,0.000084496336,0.000033533022,0.00029945702,0.0000012911532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025148408,5.090601e-7,0.00089672743,0.000023195293,0.000021887889,0.000002551768,0.00014575472,0.8566838,0.000008185025,0.0019830205,0.000051714735,0.14018017],"study_design_scores_gemma":[0.000076730204,0.000009510293,0.00016465805,0.00024763038,0.000017284885,0.000018889628,0.00006272513,0.9972842,0.000013086266,0.00009863703,0.0019005483,0.00010611217],"about_ca_topic_score_codex":0.0000016751951,"about_ca_topic_score_gemma":0.000003952757,"teacher_disagreement_score":0.86184275,"about_ca_system_score_codex":0.000017023009,"about_ca_system_score_gemma":0.000007824912,"threshold_uncertainty_score":0.3092572},"labels":[],"label_agreement":null},{"id":"W4407410747","doi":"10.1002/net.22266","title":"A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"Instituto Tecnológico y de Estudios Superiores de Monterrey; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Consejo Estatal de Ciencia y Tecnología de Jalisco; Ministère des relations internationales et de la Francophonie","keywords":"Computer science; Facility location problem; Operations research; Business; Mathematics","score_opus":0.013452178515508784,"score_gpt":0.2412586130743741,"score_spread":0.22780643455886532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407410747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11930591,0.0007291781,0.848508,0.007935816,0.0010882857,0.0016036032,0.000014325626,0.000115919756,0.020698966],"genre_scores_gemma":[0.997649,0.00003738477,0.00027981334,0.0008264049,0.00007846687,0.00006526357,0.000028328544,0.000006270853,0.0010290364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991338,0.00001348675,0.0004022887,0.00018735052,0.00012788812,0.00013515534],"domain_scores_gemma":[0.9991541,0.00006652517,0.0001067097,0.00031480085,0.00034922763,0.000008619473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045585787,0.00011327134,0.00015613303,0.00017871306,0.00012789863,0.000050426588,0.00016549363,0.000048925394,0.00019905991],"category_scores_gemma":[0.00019717273,0.000093744966,0.000042214342,0.0007445593,0.000037411275,0.00021796787,0.00010658829,0.00006725755,0.000016468202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092886214,0.00015249802,0.0013505038,0.0012199202,0.00010776611,0.0000025482818,0.00081351324,0.6211349,0.000016237916,0.29980722,0.036857657,0.038444363],"study_design_scores_gemma":[0.00057135365,0.000019211373,0.010136164,0.00015689978,0.00016417801,0.0000014964153,0.0032330547,0.9497243,0.00004194099,0.00423394,0.03150432,0.00021312624],"about_ca_topic_score_codex":0.0023234487,"about_ca_topic_score_gemma":0.0012159473,"teacher_disagreement_score":0.8783431,"about_ca_system_score_codex":0.000024167051,"about_ca_system_score_gemma":0.000016133756,"threshold_uncertainty_score":0.38228086},"labels":[],"label_agreement":null},{"id":"W4410039291","doi":"10.1002/net.22281","title":"Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Bayerische Forschungsallianz; Ministère des relations internationales et de la Francophonie","keywords":"Computer science; Operations research; Routing (electronic design automation); Order (exchange); Probabilistic logic; Order picking; Relevance (law); Warehouse; Online algorithm; Range (aeronautics); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Computer network; Engineering; Economics","score_opus":0.0033262532122975154,"score_gpt":0.19277352769621867,"score_spread":0.18944727448392115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410039291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030224263,0.00013098355,0.9942312,0.00025348266,0.00015558516,0.0001366786,0.0000016597122,0.0003192567,0.0017486869],"genre_scores_gemma":[0.9327568,0.00014796843,0.0665611,0.00014343027,0.000040841947,0.000025257621,0.000026542339,0.000027133548,0.00027093804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942636,0.000013036451,0.00013037144,0.00016492237,0.0000638749,0.00020142259],"domain_scores_gemma":[0.99969417,0.000055746994,0.000014240656,0.00016975177,0.000040100225,0.000025992249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043545806,0.00012742326,0.00012414031,0.00010665001,0.00008813598,0.000091905036,0.0000881674,0.000087341155,0.000011786549],"category_scores_gemma":[0.00003045675,0.00012386187,0.00001536573,0.00032486737,0.000022630767,0.00015548532,0.000020343079,0.00020162092,8.1070004e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002495088,0.000009221715,0.0017632891,0.000015841992,0.00001563525,0.0000020559019,0.00008482853,0.9957092,0.0000019653562,0.001001023,0.0001391943,0.0012552433],"study_design_scores_gemma":[0.00024571855,0.000012107142,0.0011005127,0.0001206164,0.000011509377,8.42923e-7,0.000052583953,0.9978507,0.000037165955,0.00009321912,0.00033463445,0.00014038762],"about_ca_topic_score_codex":0.00001407532,"about_ca_topic_score_gemma":0.000434519,"teacher_disagreement_score":0.92973435,"about_ca_system_score_codex":0.00008485995,"about_ca_system_score_gemma":0.000018018241,"threshold_uncertainty_score":0.50509405},"labels":[],"label_agreement":null},{"id":"W4411283635","doi":"10.1002/net.22289","title":"Stability of Interdiction Strategies in Quickest Flow Networks","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"","keywords":"Interdiction; Stability (learning theory); Computer science; Flow (mathematics); Flow network; Mathematical optimization; Mathematics; Machine learning; Aerospace engineering; Engineering","score_opus":0.004136378578551629,"score_gpt":0.218740877443357,"score_spread":0.21460449886480537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411283635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22376043,0.0007670787,0.76885337,0.000022020222,0.00050508825,0.00011299863,0.0000019009142,0.00008025498,0.0058968565],"genre_scores_gemma":[0.9994393,0.00013907124,0.00028673923,0.00001766517,0.00007990055,0.000010859271,0.00001278691,0.0000067772385,0.0000069068715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913585,0.00005361523,0.0003516331,0.00015748889,0.000076305245,0.00022511878],"domain_scores_gemma":[0.9995609,0.000087681125,0.000025968404,0.0002613117,0.000039106246,0.000025062227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002727823,0.00012039382,0.00024986052,0.0001112574,0.000031605945,0.00002655225,0.00013224421,0.00016456458,0.000079309284],"category_scores_gemma":[0.000016084841,0.00011714703,0.00008093165,0.0006755812,0.000078178266,0.00016096015,0.000027000038,0.00034636768,7.0032246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013906893,0.00001326779,0.0161649,0.000047733032,0.000027053464,5.971929e-7,0.00008490048,0.96192735,0.00005205867,0.00039002657,0.000216853,0.021061363],"study_design_scores_gemma":[0.00012054051,0.000012557136,0.02411429,0.00006036331,0.000017433462,2.687957e-7,0.00034306452,0.9742401,0.0001806651,0.0007109387,0.00011920456,0.00008053816],"about_ca_topic_score_codex":0.00008043395,"about_ca_topic_score_gemma":0.00122642,"teacher_disagreement_score":0.7756789,"about_ca_system_score_codex":0.00009253184,"about_ca_system_score_gemma":0.000024619381,"threshold_uncertainty_score":0.4777117},"labels":[],"label_agreement":null},{"id":"W628055479","doi":"10.1002/net.21464","title":"Proximity graphs inside large weighted graphs","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Chordal graph; Computer science; Maximal independent set; Indifference graph; Pathwidth; Modular decomposition; Combinatorics; 1-planar graph; Mathematics; Graph; Line graph","score_opus":0.019144565450619933,"score_gpt":0.2774915085623688,"score_spread":0.2583469431117489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W628055479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04537657,0.0023907302,0.94255584,0.00022067453,0.0010946242,0.0004460571,0.0000028762286,0.0005658178,0.007346828],"genre_scores_gemma":[0.9817189,0.00010735229,0.01720728,0.00050582195,0.00018240944,0.000053221396,0.0000064255346,0.000023288474,0.00019529065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997355,0.00026474486,0.0002415064,0.00041943352,0.00043523576,0.0012841019],"domain_scores_gemma":[0.99819446,0.00020453692,0.00008801129,0.0010247782,0.00010888888,0.000379336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876624,0.00021423104,0.00021738192,0.00022334882,0.0003064014,0.00009471143,0.0011326876,0.000154141,0.00004827596],"category_scores_gemma":[0.00004225626,0.00018895911,0.00013759958,0.0016047725,0.000115473485,0.0014797607,0.0005550047,0.0005698411,0.00008634006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016719361,0.00017913523,0.027685188,0.0000068837116,0.000027987779,0.000010366348,0.00024176964,0.00009412541,0.000044987428,0.94796556,0.0021636009,0.021563686],"study_design_scores_gemma":[0.0013858805,0.00016607657,0.041095447,0.0000528126,0.000017346123,0.00006111315,0.00004385347,0.12956013,0.00087172556,0.7822976,0.043498423,0.00094957335],"about_ca_topic_score_codex":0.000004784861,"about_ca_topic_score_gemma":0.000011226938,"teacher_disagreement_score":0.93634236,"about_ca_system_score_codex":0.000033331355,"about_ca_system_score_gemma":0.000027976488,"threshold_uncertainty_score":0.7705529},"labels":[],"label_agreement":null},{"id":"W7117764697","doi":"10.1002/net.70024","title":"Partial‐Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"China Scholarship Council","keywords":"Vehicle routing problem; Routing (electronic design automation); Markov decision process; Heuristic; Stochastic programming; Markov chain; Markov process; Static routing","score_opus":0.014630117411430988,"score_gpt":0.25702623743899644,"score_spread":0.24239612002756544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117764697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022664503,0.00047757666,0.994691,0.00013309167,0.0002005323,0.00047532926,0.0000011141492,0.0003800367,0.0013748775],"genre_scores_gemma":[0.9688191,0.000008143331,0.030520217,0.000086324435,0.00021480012,0.00013344629,0.000004325912,0.000043085343,0.00017060514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990912,0.000035026813,0.00023389944,0.00017545094,0.00008913928,0.00037526974],"domain_scores_gemma":[0.999022,0.0006089136,0.000043848602,0.00022746222,0.00005799571,0.000039743478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005535571,0.00015257731,0.00016172895,0.000036436028,0.00026862384,0.00010719871,0.00016646796,0.00009517082,0.000007929515],"category_scores_gemma":[0.000039326846,0.000112402835,0.0000439487,0.00037424883,0.000032472402,0.00006661554,0.00002819234,0.00024409035,0.0000011481699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015474368,0.000004507939,0.0003363053,0.00002612253,0.000062683386,3.540137e-7,0.000107280626,0.9716906,0.000024384597,0.001334821,0.00027845998,0.026118986],"study_design_scores_gemma":[0.00044397844,0.000026026903,0.00030672408,0.000114579176,0.00007199355,0.0000014101078,0.0001177398,0.9983473,0.00007811731,0.000100502344,0.000261369,0.00013028384],"about_ca_topic_score_codex":0.0000067057717,"about_ca_topic_score_gemma":0.0000136587,"teacher_disagreement_score":0.9665526,"about_ca_system_score_codex":0.000046352445,"about_ca_system_score_gemma":0.00002731194,"threshold_uncertainty_score":0.45836544},"labels":[],"label_agreement":null},{"id":"W94179444","doi":"10.1002/net.10092","title":"A linear algorithm for compact box‐drawings of trees","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Node (physics); Algorithm; Combinatorics; Computer science; Mathematics; Discrete mathematics; Engineering","score_opus":0.01584166116086022,"score_gpt":0.25901036155948726,"score_spread":0.24316870039862704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94179444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020395545,0.0005726718,0.99769807,0.000052033884,0.00041432862,0.00015078945,0.00001079464,0.00006368524,0.0008336848],"genre_scores_gemma":[0.089893706,0.000061464525,0.90905756,0.00023225845,0.00031394124,0.000011272565,0.000023920244,0.000017369182,0.00038853867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909854,0.000038219474,0.00020531115,0.0002504386,0.00015031792,0.00025716043],"domain_scores_gemma":[0.99910754,0.00018041069,0.000102045226,0.00043563513,0.00009387348,0.00008049512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023590281,0.000113241294,0.0001952138,0.000041826555,0.00009464452,0.000044981913,0.0004660615,0.00007416118,0.0000142962745],"category_scores_gemma":[0.00003306256,0.00009397068,0.00007455022,0.00026014587,0.000031353953,0.00025751957,0.00006886236,0.00009455376,0.0000033992624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018060031,0.00032878763,0.0008344718,0.000037104077,0.00007046055,0.000011319438,0.0004135356,0.02339812,0.00013630872,0.02229117,0.0785772,0.8738835],"study_design_scores_gemma":[0.0004132901,0.00010716136,0.00022390495,0.00003644912,0.0000053987915,0.0000063398634,0.000006456755,0.92076015,0.0006033173,0.00085814577,0.07685971,0.000119683034],"about_ca_topic_score_codex":0.000019285742,"about_ca_topic_score_gemma":0.000004196806,"teacher_disagreement_score":0.897362,"about_ca_system_score_codex":0.000011645775,"about_ca_system_score_gemma":0.000045961267,"threshold_uncertainty_score":0.3832013},"labels":[],"label_agreement":null}]}