{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":145,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":145,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"1eb0e76dabac","filters":{"venue":"Networks"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dominique Feillet","is_ca":false},{"name":"Pierre Dejax","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Cyrille Gueguen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008733564536156346,"gpt":0.2388332489582275,"spread":0.2300996844220712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011822,0.0006259591,0.0007390344,0.0005149218,0.0005305457,0.0005611134,0.001001948,0.0008630053,0.004313316],"category_scores_gemma":[0.003222576,0.0003526467,0.0004565828,0.0008551087,0.000597324,0.0010228,0.000792757,0.001098242,0.0004106498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006947512,"about_ca_system_score_gemma":0.001624104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004946777,"about_ca_topic_score_gemma":0.006324674,"domain_scores_codex":[0.99949,0.0001853801,0.00002285411,0.00009539873,0.0001331752,0.0000730422],"domain_scores_gemma":[0.9983544,0.001078356,0.00009562864,0.0002320971,0.0001949033,0.00004446101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001215599,0.0001117728,0.0004590939,0.0001332479,0.00002460926,0.00008006347,0.0001089518,0.7970908,0.003157179,0.02831965,0.002853314,0.1675397],"study_design_scores_gemma":[0.00005670058,0.00004036829,0.00008031318,0.000005979515,0.000005976055,0.00003885492,0.00002005282,0.9841042,0.001208794,0.01320619,0.001226064,0.000006549544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541918,0.00008671012,0.9714353,0.00015681,0.00002667244,0.00009335057,0.00006803677,0.0006087402,0.002105125],"genre_scores_gemma":[0.1461319,0.0000717707,0.8519684,0.00006075146,0.00001917615,0.0001290945,0.0001682304,0.0001009748,0.001349725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004946777,"threshold_uncertainty_score":0.01442951,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stefan Røpke","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01662834278793372,"gpt":0.2314751382640148,"spread":0.2148467954760811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003635863,0.00215142,0.002133409,0.001415931,0.001031131,0.003710793,0.002458785,0.002351137,0.008164994],"category_scores_gemma":[0.007110833,0.001793191,0.001631629,0.00254125,0.001441832,0.004132433,0.001740441,0.00377647,0.0007569885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0032,"about_ca_system_score_gemma":0.002538991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01087178,"about_ca_topic_score_gemma":0.007358776,"domain_scores_codex":[0.9983317,0.0008809216,0.00006390107,0.000204776,0.0002689625,0.0002496723],"domain_scores_gemma":[0.9953241,0.003777651,0.0003614108,0.0001344522,0.0002280554,0.0001744128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008504208,0.00006971102,0.0001711459,0.00005642012,0.00003061809,0.00003820166,0.00005113639,0.9426184,0.0001947682,0.04624123,0.001181663,0.009261613],"study_design_scores_gemma":[0.00002380794,0.00001565619,0.00002354054,0.000009629061,0.000007919782,0.000005808871,0.00001158898,0.9787162,0.0001114183,0.02048378,0.0005871232,0.000003547429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02977185,0.00145947,0.9590946,0.0006918155,0.0001037036,0.0001926568,0.0002937416,0.0002890999,0.008103068],"genre_scores_gemma":[0.4242588,0.00292712,0.5583687,0.0002412439,0.0002145001,0.001005683,0.0009442765,0.0002912959,0.01174831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01087178,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Manuel Iori","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Silvaro Martello","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01426255619985574,"gpt":0.2389436817591051,"spread":0.2246811255592494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315739,0.0009078415,0.001237695,0.001602567,0.0009766765,0.001484495,0.001503407,0.001483173,0.007728189],"category_scores_gemma":[0.003434071,0.0007042241,0.0005880769,0.002224958,0.0009781725,0.001080537,0.0007515802,0.0007635786,0.001094236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554442,"about_ca_system_score_gemma":0.002117247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009768316,"about_ca_topic_score_gemma":0.007756586,"domain_scores_codex":[0.9993089,0.0004345971,0.00001707834,0.00005407384,0.00007883214,0.0001064674],"domain_scores_gemma":[0.9983439,0.001225687,0.0001254393,0.00008275653,0.0001495567,0.00007252771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008880216,0.00009309866,0.0003082867,0.00006181855,0.00002616831,0.00005382529,0.0000526425,0.9511088,0.0004219328,0.006619405,0.00259854,0.03856679],"study_design_scores_gemma":[0.0000422628,0.00003544006,0.0000692939,0.00001295742,0.000008015867,0.0000142432,0.00002493058,0.9961826,0.0001863646,0.002649646,0.0007682669,0.000005925023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.135209,0.001688801,0.8395484,0.0006334932,0.0001627497,0.0005401283,0.0005744358,0.002151948,0.01949097],"genre_scores_gemma":[0.4262362,0.000564151,0.5664696,0.0002598091,0.00005044043,0.0007702634,0.0007234371,0.000294361,0.004631804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009768316,"threshold_uncertainty_score":0.0258534,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Martine Labbé","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Inmaculada Rodríguez‐Martín","is_ca":false},{"name":"Juan‐José Salazar‐González","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00989145699610171,"gpt":0.2084014050369466,"spread":0.1985099480408449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536023,0.0009941648,0.001613077,0.001114224,0.000796938,0.002282614,0.001881761,0.001503004,0.01035507],"category_scores_gemma":[0.004093395,0.0007042869,0.001068895,0.002135335,0.001122301,0.002265844,0.001496882,0.001802137,0.001153444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001979162,"about_ca_system_score_gemma":0.002187057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009572993,"about_ca_topic_score_gemma":0.00891344,"domain_scores_codex":[0.9990502,0.0003678047,0.00003438259,0.0001470943,0.000233776,0.0001667434],"domain_scores_gemma":[0.9977747,0.001609754,0.0001330691,0.0001883962,0.000193256,0.0001007477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008990894,0.0001118769,0.0002954759,0.00008051511,0.00001667584,0.00003168347,0.00003780807,0.9140908,0.0002546775,0.04371225,0.003579246,0.03769908],"study_design_scores_gemma":[0.00001929014,0.00001125188,0.00002883827,0.000007119067,0.000003128963,0.000006587207,0.00001273556,0.9812829,0.0000887454,0.01794278,0.0005941921,0.000002527776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01723283,0.0004616314,0.9668822,0.0005400562,0.00007321119,0.0001786151,0.0002331311,0.0004042476,0.0139941],"genre_scores_gemma":[0.2996493,0.0006642372,0.6900631,0.000224911,0.0001153005,0.0005015312,0.000738419,0.0002002198,0.007842964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01035507,"threshold_uncertainty_score":0.03464121,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nenad Mladenović","is_ca":true},{"name":"Martine Labbé","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01495553087688913,"gpt":0.2024124321807196,"spread":0.1874569013038305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001504097,0.0007158376,0.0009512546,0.001020147,0.0007992226,0.001030637,0.001622102,0.001287192,0.003180156],"category_scores_gemma":[0.004201557,0.0004748927,0.0005952791,0.001532563,0.0007830894,0.001389717,0.0007404177,0.0007135948,0.0003927845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009728622,"about_ca_system_score_gemma":0.001632625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008466912,"about_ca_topic_score_gemma":0.006079034,"domain_scores_codex":[0.9991962,0.0004962598,0.00002455857,0.00007642034,0.0000972633,0.0001092173],"domain_scores_gemma":[0.9982848,0.001243553,0.0001577857,0.0001191852,0.0001286061,0.00006597918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002263154,0.0001718752,0.001345492,0.0001140987,0.0000488615,0.00005607643,0.00009510227,0.9052449,0.0009409435,0.01543752,0.002123106,0.07419562],"study_design_scores_gemma":[0.00005174541,0.00007474398,0.0001654636,0.00000898801,0.00001252115,0.00002464095,0.0000414743,0.9922655,0.0009125407,0.005741236,0.0006947506,0.000006236497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1625292,0.0006949155,0.825659,0.0003095912,0.00005024728,0.0002433263,0.0001396121,0.0008312907,0.009542773],"genre_scores_gemma":[0.4336419,0.0002536998,0.5634277,0.00008110511,0.00002722823,0.0002632279,0.0002660278,0.0001505667,0.0018885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008466912,"threshold_uncertainty_score":0.01683521,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Xiaorui Fu","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Walter Rei","is_ca":true},{"name":"Stein W. Wallace","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07614022353364325,"gpt":0.3012108241517992,"spread":0.2250706006181559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609418,0.0008713316,0.001044869,0.0007697403,0.0003297966,0.0006311625,0.001125184,0.0008760008,0.001655569],"category_scores_gemma":[0.002174018,0.0005135906,0.0008651572,0.0008102773,0.0007460311,0.0006269063,0.0007761987,0.0009604183,0.0001307911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00101881,"about_ca_system_score_gemma":0.001044121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003566314,"about_ca_topic_score_gemma":0.003792275,"domain_scores_codex":[0.9995782,0.0002300552,0.00001540285,0.00004567698,0.00008052489,0.00005019847],"domain_scores_gemma":[0.9988647,0.0008127711,0.000106081,0.0000697488,0.00009357173,0.00005312006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001511566,0.0000143881,0.00009120963,0.00001225075,0.00001651238,0.00001058736,0.000008671424,0.9906296,0.0001744009,0.002816071,0.000113473,0.006097686],"study_design_scores_gemma":[0.000009855293,0.000015288,0.00001755956,0.000002437626,0.00000348543,0.000002411576,0.000002367243,0.9973659,0.0000852261,0.002363833,0.0001301867,0.000001311457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04202054,0.000447158,0.9538894,0.0002323545,0.00003924192,0.0001003561,0.00005762404,0.0001670324,0.003046283],"genre_scores_gemma":[0.6797006,0.0003185713,0.3174026,0.0001779892,0.00004029965,0.0002876155,0.0001226785,0.00005711993,0.001892632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003566314,"threshold_uncertainty_score":0.008511484,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04834175643551917,"gpt":0.2885700570184015,"spread":0.2402283005828823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491955,0.001065727,0.001593857,0.002132398,0.0006016751,0.002204392,0.001604648,0.001211183,0.002520705],"category_scores_gemma":[0.003499244,0.0008004729,0.0008850873,0.004365859,0.001174616,0.003506631,0.001403114,0.001180293,0.0008368288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442977,"about_ca_system_score_gemma":0.001146521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002516592,"about_ca_topic_score_gemma":0.001770581,"domain_scores_codex":[0.9990289,0.0002614468,0.00007193084,0.0002359093,0.0003027747,0.00009900468],"domain_scores_gemma":[0.9975168,0.001924155,0.0001440949,0.0001307923,0.0002268754,0.00005726191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001161839,0.0001849028,0.003211659,0.006451476,0.0002564872,0.0002198517,0.0002025674,0.2324293,0.0009554238,0.2961106,0.01660085,0.4432608],"study_design_scores_gemma":[0.0000438581,0.0002368688,0.003004459,0.002073311,0.0001997154,0.001014132,0.0003426732,0.2675808,0.001514755,0.462041,0.26185,0.00009841871],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.01522226,0.6943859,0.2425266,0.002121541,0.0004577254,0.00007253445,0.0003710211,0.0001902252,0.04465221],"genre_scores_gemma":[0.2310679,0.7000549,0.05944522,0.0004801947,0.001541572,0.0001617239,0.0006338963,0.0001211156,0.006493522],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002520705,"threshold_uncertainty_score":0.01046962,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Lars Magnus Hvattum","is_ca":false},{"name":"Inge Norstad","is_ca":false},{"name":"Kjetil Fagerholt","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006801423789339931,"gpt":0.2148227691206925,"spread":0.2080213453313526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967736,0.001257815,0.001229841,0.0007774342,0.0007962756,0.001748763,0.001703063,0.001879066,0.01170092],"category_scores_gemma":[0.009316836,0.0006313174,0.0008137596,0.001094421,0.0010782,0.001713197,0.001974141,0.001738311,0.001689902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001657086,"about_ca_system_score_gemma":0.003524493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007803356,"about_ca_topic_score_gemma":0.006684216,"domain_scores_codex":[0.9987432,0.0003481567,0.00006029009,0.0002384906,0.0003569957,0.0002529596],"domain_scores_gemma":[0.995619,0.003328722,0.0001888693,0.0002929805,0.0004538727,0.000116631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002560058,0.0001583575,0.0006631704,0.0001621888,0.00003996512,0.00009447396,0.00009303128,0.8696365,0.001922501,0.03505373,0.005462654,0.08645742],"study_design_scores_gemma":[0.00005193831,0.00002927091,0.00008182295,0.000009107093,0.000005994153,0.00002227701,0.00001248898,0.9861953,0.0002468844,0.0126962,0.0006446289,0.000004115244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01830308,0.0003327412,0.9683776,0.000428992,0.0001043573,0.0001426443,0.0001188596,0.0007562337,0.01143545],"genre_scores_gemma":[0.3339667,0.0002974079,0.6569098,0.0003064884,0.0001402962,0.000440177,0.0004150077,0.0003770342,0.007147037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01170092,"threshold_uncertainty_score":0.0391435,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eric Prescott‐Gagnon","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Louis‐Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009967092434046134,"gpt":0.2421302769561041,"spread":0.2321631845220579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009955823,0.0005275292,0.001286448,0.000811434,0.000503631,0.000665213,0.001217187,0.0008694283,0.002653736],"category_scores_gemma":[0.001807681,0.000441239,0.0004399895,0.0009612215,0.0004609309,0.001083001,0.0007461175,0.0006636183,0.0003251704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008477786,"about_ca_system_score_gemma":0.001243219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005556566,"about_ca_topic_score_gemma":0.005035072,"domain_scores_codex":[0.9996319,0.0001798846,0.00001366613,0.00005883732,0.00007589481,0.00003978665],"domain_scores_gemma":[0.9994596,0.0003795603,0.0000477751,0.00002182921,0.00005426768,0.00003702767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002117068,0.0001477415,0.000451026,0.00007103723,0.00004438872,0.0000526489,0.00007326571,0.8778724,0.0009377545,0.01550389,0.002676941,0.1019571],"study_design_scores_gemma":[0.00003844256,0.0000332078,0.00004205184,0.000003720046,0.000004808252,0.000009687506,0.000006338328,0.997308,0.0001499767,0.001981919,0.0004191949,0.000002726172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0559274,0.0007552603,0.9371992,0.0003253679,0.00005589838,0.0001744911,0.00008617018,0.0003702595,0.005105963],"genre_scores_gemma":[0.3635431,0.0003402247,0.6305243,0.00009100266,0.00004813519,0.0005303119,0.0002742233,0.00008938885,0.004559322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005556566,"threshold_uncertainty_score":0.01104844,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dorit S. Hochbaum","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009186957762735095,"gpt":0.2030956731014378,"spread":0.1939087153387027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164497,0.0009817933,0.0009278542,0.001444781,0.0008736099,0.001499302,0.00189296,0.001508376,0.005880364],"category_scores_gemma":[0.005419032,0.0005444994,0.00115018,0.001141452,0.001108117,0.003836806,0.001646106,0.00180203,0.001238957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364645,"about_ca_system_score_gemma":0.002205145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00226692,"about_ca_topic_score_gemma":0.002321752,"domain_scores_codex":[0.9987856,0.0002593992,0.00009306206,0.0003317235,0.0003895665,0.0001406714],"domain_scores_gemma":[0.9984086,0.0007747045,0.0001365462,0.0002779137,0.0003194587,0.00008283113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000351276,0.000342082,0.001187533,0.0003504597,0.00007328628,0.0001664844,0.000324814,0.1256306,0.01066634,0.1329231,0.01585114,0.7121329],"study_design_scores_gemma":[0.0002239645,0.0001582824,0.0004046414,0.00007425738,0.00003775122,0.0003334729,0.00008270542,0.7892478,0.01153111,0.1735697,0.02429329,0.00004311283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005900069,0.0001207878,0.9907698,0.0002281554,0.00005675919,0.0001218322,0.00008491093,0.0008039091,0.001913799],"genre_scores_gemma":[0.047095,0.00009540952,0.9501872,0.0000915527,0.00005642959,0.000157229,0.0002773009,0.0001786589,0.001861241],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005880364,"threshold_uncertainty_score":0.01967174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luigi Moccia","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Stefan Røpke","is_ca":true},{"name":"Maria Pia Valentini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00464616798209775,"gpt":0.2086894580376626,"spread":0.2040432900555649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019432,0.001020798,0.0009154131,0.000604948,0.0006130812,0.001490925,0.0009107778,0.001513592,0.003482615],"category_scores_gemma":[0.001824624,0.0005919128,0.001020215,0.0009492411,0.0007656866,0.001249774,0.0008318677,0.0009443765,0.0002427498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001505851,"about_ca_system_score_gemma":0.001432289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02217321,"about_ca_topic_score_gemma":0.01445114,"domain_scores_codex":[0.9996146,0.0001728159,0.00001131254,0.00007143772,0.00004099175,0.00008882966],"domain_scores_gemma":[0.9993153,0.0004538347,0.0000842109,0.0000284351,0.00005673794,0.00006149519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001917004,0.00001491217,0.0001455143,0.00001197779,0.00000827058,0.00003459721,0.00001146454,0.995536,0.0001633093,0.001896208,0.0001225337,0.002036044],"study_design_scores_gemma":[0.000004599601,0.00001160763,0.00003808535,0.000001675506,0.000003466281,0.000004310122,0.00001238908,0.9985414,0.00007592995,0.001180823,0.0001238324,0.000001866398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3098295,0.0005952337,0.679442,0.000568567,0.00007065286,0.0001356956,0.0003472248,0.0002544739,0.008756661],"genre_scores_gemma":[0.8898326,0.000264997,0.1046504,0.00004270863,0.00003714549,0.000200453,0.0002380078,0.00005658379,0.004677156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02217321,"threshold_uncertainty_score":0.0440883,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McMaster University","keywords":"Interdiction; Flow network; Mathematical optimization; Computer science; Bernoulli's principle; Stochastic programming; Mathematics","authors":[{"name":"Udom Janjarassuk","is_ca":false},{"name":"Jeff Linderoth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01030328984300231,"gpt":0.2162062566374294,"spread":0.2059029667944271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340602,0.0007222363,0.001071675,0.0005738821,0.0003895476,0.0008313955,0.0010238,0.0009442789,0.004860932],"category_scores_gemma":[0.006697951,0.0004296119,0.0007512931,0.000671083,0.001127674,0.001208654,0.001140168,0.001457725,0.000279266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255187,"about_ca_system_score_gemma":0.001632961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006826767,"about_ca_topic_score_gemma":0.005329447,"domain_scores_codex":[0.9991012,0.0004997404,0.00002857497,0.0001021682,0.0001604987,0.0001077998],"domain_scores_gemma":[0.996524,0.002713003,0.0002041531,0.0001295561,0.0003137911,0.0001154417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003429459,0.00004162885,0.0002712109,0.00004711309,0.00001616757,0.0000522627,0.00003620601,0.9350108,0.0002351327,0.05672049,0.0009743467,0.006560308],"study_design_scores_gemma":[0.000009511614,0.00001089338,0.00002335796,0.000003500248,0.00000231332,0.000005240703,0.000007457055,0.9889539,0.00007789105,0.010673,0.0002314243,0.000001466258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03256228,0.0002601904,0.9600974,0.0006246379,0.00005433076,0.00008969605,0.000114055,0.0001071164,0.006090147],"genre_scores_gemma":[0.7098432,0.0004391717,0.2818742,0.0002376773,0.0001511488,0.000427045,0.0004015687,0.0001190054,0.006506939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006826767,"threshold_uncertainty_score":0.01626146,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Sébastien Roch","is_ca":false},{"name":"Gilles Savard","is_ca":true},{"name":"Patrice Marcotte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01407393180372267,"gpt":0.2909614343161206,"spread":0.276887502512398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730634,0.0011713,0.001725883,0.00107371,0.0008407055,0.002417409,0.002662948,0.001941888,0.00844108],"category_scores_gemma":[0.004726711,0.000591989,0.001137417,0.00217599,0.0008290357,0.003588707,0.001474202,0.001921451,0.001314514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002964834,"about_ca_system_score_gemma":0.003664723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008245841,"about_ca_topic_score_gemma":0.007583594,"domain_scores_codex":[0.998743,0.0003548294,0.00005373917,0.0002250081,0.0003011404,0.0003223782],"domain_scores_gemma":[0.9989422,0.0005963882,0.00007148286,0.0001675138,0.0001298041,0.00009265068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005144628,0.0004649358,0.001010159,0.0001630505,0.0001168876,0.0001121279,0.0002029237,0.7199244,0.001846296,0.09408333,0.0119284,0.169633],"study_design_scores_gemma":[0.00006806335,0.00003315024,0.00005202845,0.000006576621,0.0000136911,0.00002689929,0.00002319585,0.9567018,0.0003570372,0.04166642,0.001045261,0.000005920034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0706142,0.0005770905,0.9076295,0.001222764,0.0001577286,0.0002655649,0.000464263,0.002163043,0.01690576],"genre_scores_gemma":[0.4819883,0.0004303507,0.5081521,0.0002987579,0.00009909797,0.0003192115,0.001094725,0.0002219437,0.007395553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00844108,"threshold_uncertainty_score":0.02823824,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gianpaolo Ghiani","is_ca":true},{"name":"Gennaro Improta","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01151439297451738,"gpt":0.2159405566209453,"spread":0.2044261636464279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009860566,0.001036447,0.0007245116,0.0007913173,0.0006512158,0.002122414,0.002628685,0.001577718,0.009962562],"category_scores_gemma":[0.002524207,0.0004420657,0.0006746845,0.001560572,0.000887643,0.002074394,0.001240257,0.00138057,0.0007806211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269428,"about_ca_system_score_gemma":0.001330758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003299978,"about_ca_topic_score_gemma":0.002914014,"domain_scores_codex":[0.9986672,0.0004854883,0.00005282215,0.0002588283,0.0002463373,0.0002892846],"domain_scores_gemma":[0.998701,0.0007412077,0.0001450762,0.0001095253,0.0001513031,0.0001518055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001777747,0.000121041,0.0004379846,0.0003617229,0.00005584527,0.0003775803,0.00006239896,0.8195497,0.001798255,0.1276626,0.008857795,0.04053739],"study_design_scores_gemma":[0.00004675151,0.0001021535,0.0002306716,0.00006004656,0.0000392131,0.000301516,0.0001072491,0.8938522,0.001805015,0.08597326,0.01745706,0.00002491365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08103275,0.001875111,0.8567891,0.001306569,0.0002733292,0.0002804046,0.001195702,0.0007505998,0.05649645],"genre_scores_gemma":[0.8166336,0.001098944,0.1614932,0.0001870243,0.0002092672,0.0002421999,0.001402585,0.0001693633,0.01856387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009962562,"threshold_uncertainty_score":0.03332806,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Manuel Iori","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Juan‐José Salazar‐González","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01020951840310678,"gpt":0.2203514951380027,"spread":0.210141976734896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138046,0.001097352,0.001220941,0.001046017,0.0008360187,0.001525868,0.001558304,0.001489082,0.006059391],"category_scores_gemma":[0.002920298,0.000639069,0.0006445373,0.001437896,0.0006529863,0.001619309,0.001052654,0.001565682,0.0008019453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001623972,"about_ca_system_score_gemma":0.001988472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006840292,"about_ca_topic_score_gemma":0.004825159,"domain_scores_codex":[0.9993411,0.0002436881,0.0000295523,0.0001041236,0.0001352846,0.0001462824],"domain_scores_gemma":[0.998952,0.000723233,0.00009948893,0.00004914132,0.0001077487,0.00006830696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003684656,0.000355168,0.0007446134,0.0001446833,0.00004885612,0.0001355289,0.0001652581,0.7773969,0.001461354,0.03303038,0.007186927,0.1789618],"study_design_scores_gemma":[0.00006049767,0.00005063753,0.00007033947,0.000009622498,0.000008021456,0.00001782369,0.00002332702,0.9898554,0.0004220642,0.0083903,0.001086148,0.000005784259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0280522,0.0002515479,0.9641325,0.0004150272,0.00004564988,0.0002188874,0.0001945832,0.0006695523,0.006019931],"genre_scores_gemma":[0.208831,0.0002390077,0.7855435,0.0001455659,0.00005234504,0.0005218146,0.0006678876,0.0002010943,0.003797714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006840292,"threshold_uncertainty_score":0.02027065,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Güneş Erdoğan","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005110104516139893,"gpt":0.1910821117704212,"spread":0.1859720072542813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120948,0.0009835426,0.001097906,0.0005096508,0.000565842,0.001831209,0.00124107,0.00127735,0.003430166],"category_scores_gemma":[0.002973938,0.0004019848,0.0007351118,0.00111595,0.001370062,0.002531209,0.001516305,0.00111153,0.0002520293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001572621,"about_ca_system_score_gemma":0.0007967656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005361249,"about_ca_topic_score_gemma":0.002936936,"domain_scores_codex":[0.9988176,0.0004948789,0.00003853179,0.0002318713,0.0001723756,0.000244559],"domain_scores_gemma":[0.9990175,0.0005598157,0.0001261759,0.00009085111,0.00008893819,0.0001167462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001596036,0.0001016729,0.001222761,0.0001312121,0.00006715993,0.0005570112,0.0001545239,0.7217768,0.001402595,0.2300063,0.004315038,0.04010535],"study_design_scores_gemma":[0.00004217751,0.00009018324,0.0004179768,0.00002209443,0.0000288679,0.0002190359,0.0001644932,0.8126063,0.0008483931,0.1799296,0.00560575,0.0000250479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2623712,0.00118531,0.7002815,0.00123226,0.0001210015,0.0001475787,0.0004228621,0.0002095243,0.0340287],"genre_scores_gemma":[0.9314941,0.0007113431,0.0583212,0.0001373218,0.00007438311,0.00009293199,0.0003105059,0.00007971517,0.008778573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005361249,"threshold_uncertainty_score":0.01147503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lars Magnus Hvattum","is_ca":false},{"name":"Arne Løkketangen","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00953183509274726,"gpt":0.2479167497554881,"spread":0.2383849146627408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002508388,0.0007987539,0.001554275,0.0008147808,0.0006064184,0.001183414,0.001422995,0.001311978,0.002890544],"category_scores_gemma":[0.003688862,0.0006420004,0.0008127263,0.0009558061,0.0009465425,0.001226961,0.001025908,0.001460256,0.000401292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0014762,"about_ca_system_score_gemma":0.00219779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004649879,"about_ca_topic_score_gemma":0.004002756,"domain_scores_codex":[0.998447,0.0008248719,0.00004786289,0.000152822,0.0003078614,0.0002196111],"domain_scores_gemma":[0.99793,0.00149274,0.00015225,0.0001069427,0.000185032,0.0001329753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008738473,0.00005538415,0.0002027714,0.00004161736,0.00003848569,0.00005378434,0.00003173764,0.9557068,0.000359598,0.01478951,0.001783797,0.02684919],"study_design_scores_gemma":[0.00001957131,0.00001846187,0.00003627063,0.000005495036,0.000005096386,0.00001109021,0.000004561357,0.9943308,0.0001177722,0.00493154,0.000515543,0.00000378302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01823142,0.0005118325,0.9753712,0.000280035,0.00007745531,0.0001022098,0.00007589289,0.0002836288,0.005066223],"genre_scores_gemma":[0.4923445,0.0005271597,0.5008711,0.0002610156,0.0001551738,0.0003564025,0.0003396603,0.0001743011,0.004970715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004649879,"threshold_uncertainty_score":0.01326579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02974784007176186,"gpt":0.2587040677404374,"spread":0.2289562276686755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005115508,0.0008453965,0.001665615,0.00455146,0.001964454,0.004061942,0.002776196,0.002039162,0.005649029],"category_scores_gemma":[0.04342518,0.0008752967,0.001020054,0.004341661,0.00679007,0.01690841,0.005193323,0.00364546,0.000744013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528998,"about_ca_system_score_gemma":0.0003664343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006370892,"about_ca_topic_score_gemma":0.0004127064,"domain_scores_codex":[0.9954346,0.001266394,0.0002626119,0.001408807,0.00123947,0.0003880938],"domain_scores_gemma":[0.9084281,0.07462793,0.007042942,0.005068421,0.002055936,0.002776633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001302505,0.0004348161,0.01937623,0.001207233,0.0001547792,0.0007272352,0.002994637,0.06756464,0.006426421,0.8378381,0.004646568,0.05732691],"study_design_scores_gemma":[0.0000553613,0.0002993711,0.006052748,0.0001340052,0.00007950532,0.0009313673,0.0008495835,0.05673743,0.003182608,0.9277935,0.00382783,0.00005667756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6751546,0.01631746,0.2510732,0.008525638,0.0002705402,0.00007971699,0.0005820337,0.0006513596,0.04734549],"genre_scores_gemma":[0.9855387,0.002073791,0.009934866,0.0002185289,0.0006260508,0.00004089525,0.0001568644,0.00006564275,0.00134466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005649029,"threshold_uncertainty_score":0.02705371,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Corinne Feremans","is_ca":false},{"name":"Martine Labbé","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03965971433503258,"gpt":0.310077445871883,"spread":0.2704177315368504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004240834,0.0008150468,0.00068587,0.001432257,0.0006346385,0.001931007,0.0009380816,0.0009315583,0.003814778],"category_scores_gemma":[0.01052722,0.0003616483,0.00100302,0.002077304,0.0005589965,0.001989838,0.0007534116,0.001109642,0.0003551255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002049193,"about_ca_system_score_gemma":0.00168571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002484623,"about_ca_topic_score_gemma":0.003873446,"domain_scores_codex":[0.997692,0.001245341,0.00007328005,0.0001190256,0.0006581975,0.0002122711],"domain_scores_gemma":[0.9939752,0.004716842,0.0004096508,0.0002406834,0.0005605159,0.0000971433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004227708,0.0002813773,0.001047748,0.0007285362,0.0001252093,0.0001084006,0.0001810274,0.774178,0.001855909,0.07043598,0.005200462,0.1454346],"study_design_scores_gemma":[0.00008720154,0.0004679315,0.0009078441,0.0001541174,0.00008838128,0.000148832,0.0002718174,0.9688715,0.001597411,0.02036747,0.007012289,0.00002513467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3056823,0.01329857,0.6046217,0.001568566,0.0002564238,0.0005429434,0.0005449312,0.0008132865,0.07267134],"genre_scores_gemma":[0.6780815,0.006928303,0.3090059,0.0002742652,0.0001351234,0.0003915486,0.0008742115,0.0003615642,0.003947587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004240834,"threshold_uncertainty_score":0.02242798,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stefan Dobrev","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Rastislav Kráľovič","is_ca":false},{"name":"Peter Růžička","is_ca":false},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0211345147778055,"gpt":0.2741044860498077,"spread":0.2529699712720022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124288,0.0004841785,0.0008999187,0.0009971928,0.0007965101,0.0008835547,0.0009802273,0.001082177,0.001913743],"category_scores_gemma":[0.005031762,0.0003083892,0.0003577964,0.001043616,0.001507779,0.001603122,0.001478386,0.0004591061,0.0001363563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009118,"about_ca_system_score_gemma":0.000531062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003546559,"about_ca_topic_score_gemma":0.002679158,"domain_scores_codex":[0.99928,0.0003151767,0.0000241769,0.0001306456,0.00009978152,0.0001502046],"domain_scores_gemma":[0.9970539,0.002101907,0.0003427433,0.0001632319,0.0001805622,0.0001576725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002227738,0.00005738073,0.001108192,0.00008328886,0.0000579858,0.0002149574,0.0001644469,0.8561431,0.0008142608,0.1143667,0.0017454,0.02502162],"study_design_scores_gemma":[0.00004991774,0.00004782009,0.0002092322,0.00001193708,0.00001257442,0.00005952147,0.00006832987,0.8699843,0.000504603,0.1277795,0.001264564,0.00000771015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5301265,0.001117731,0.4536566,0.000964358,0.00005268287,0.0001182145,0.0001255206,0.0001808281,0.01365758],"genre_scores_gemma":[0.9523112,0.0002398808,0.04442328,0.00005829744,0.00001599124,0.00007156477,0.0000734166,0.00002010052,0.002786343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003546559,"threshold_uncertainty_score":0.007321715,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Thibaut Vidal","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Christian Prins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06351391128462434,"gpt":0.2892708729540661,"spread":0.2257569616694418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004636889,0.002125031,0.001370757,0.001256421,0.0009887499,0.004051202,0.002427633,0.002489881,0.008111279],"category_scores_gemma":[0.01894692,0.0009033766,0.001729826,0.002909261,0.002779084,0.006363522,0.002266225,0.003303826,0.001411378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002311788,"about_ca_system_score_gemma":0.002662452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002098409,"about_ca_topic_score_gemma":0.001534,"domain_scores_codex":[0.9958002,0.001816899,0.0003187003,0.001025176,0.0008081596,0.0002308082],"domain_scores_gemma":[0.992235,0.005984904,0.0006981214,0.0005554477,0.0003562474,0.0001702823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009089349,0.00006077316,0.0005781011,0.0003073505,0.00006760889,0.00007156745,0.0001840559,0.345994,0.0006110591,0.5639596,0.004467846,0.08360721],"study_design_scores_gemma":[0.00003448756,0.00005990842,0.0001382438,0.00008223546,0.0000269438,0.00006946079,0.00006125247,0.4872042,0.0005639063,0.4994669,0.01227001,0.00002243575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002970166,0.001381021,0.989193,0.000595267,0.0001291601,0.00009746187,0.0001311903,0.00009787636,0.005404821],"genre_scores_gemma":[0.1558831,0.004797922,0.8252205,0.0004135239,0.0008290212,0.0008145852,0.0007602735,0.0003408977,0.0109402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008111279,"threshold_uncertainty_score":0.0271349,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Haldun Süral","is_ca":true},{"name":"James H. Bookbinder","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01087306401402988,"gpt":0.2107619665767274,"spread":0.1998889025626975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006827075,0.001232548,0.001306479,0.0006012883,0.0007992728,0.001793517,0.001510148,0.001741382,0.006121368],"category_scores_gemma":[0.001534978,0.0007974196,0.0009993598,0.001186169,0.0007172207,0.001811512,0.0009791469,0.0009897612,0.00060639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022146,"about_ca_system_score_gemma":0.001327874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007178061,"about_ca_topic_score_gemma":0.005440116,"domain_scores_codex":[0.9995269,0.0001521045,0.00002268796,0.0001141484,0.00006347939,0.0001207031],"domain_scores_gemma":[0.9991882,0.0005074983,0.0001105494,0.0000399259,0.00005236627,0.0001014101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001634133,0.00008301363,0.0002721629,0.0001544192,0.0000536235,0.0002607146,0.00005515269,0.9574296,0.00121945,0.02074067,0.001893228,0.01767451],"study_design_scores_gemma":[0.00006024494,0.0000783631,0.0001792463,0.00001769994,0.00002484995,0.0000962592,0.00007703857,0.9730829,0.0009052732,0.02325668,0.002205532,0.00001595276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3916575,0.001708462,0.574124,0.001991231,0.0002719729,0.0004490794,0.001446551,0.000420002,0.0279312],"genre_scores_gemma":[0.8746674,0.0008012995,0.1042363,0.0001436269,0.0001215697,0.0003795148,0.0007469545,0.0001180147,0.01878537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007178061,"threshold_uncertainty_score":0.02047801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gossip; Combinatorics; Graph; Mathematics; Discrete mathematics; Computer science; Node (physics)","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Joseph G. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0185127435136274,"gpt":0.2372820739664975,"spread":0.2187693304528701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461424,0.0002818685,0.000274418,0.0006137722,0.000761085,0.0007952516,0.0007336938,0.0004073688,0.002790596],"category_scores_gemma":[0.002570655,0.0002758971,0.0004073206,0.0005072013,0.0008406417,0.001191969,0.0006508479,0.0006495084,0.0002711456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003554,"about_ca_system_score_gemma":0.0004476517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582478,"about_ca_topic_score_gemma":0.001338388,"domain_scores_codex":[0.999594,0.0001148831,0.00002593593,0.00007694559,0.00008811639,0.0001000614],"domain_scores_gemma":[0.9965502,0.001755588,0.0006224696,0.0002646419,0.0004918813,0.000315206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000888438,0.0002084467,0.006680901,0.00070527,0.00009979469,0.0007941177,0.001475084,0.18518,0.05028477,0.6739157,0.01080203,0.06896548],"study_design_scores_gemma":[0.0001290681,0.0002870907,0.00396426,0.000084868,0.00007303127,0.0009264885,0.0008055577,0.4575421,0.02611166,0.4973979,0.01260822,0.00006976492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6578131,0.0003489258,0.3173657,0.0007544945,0.00002297807,0.0001292263,0.0008301831,0.0006742647,0.02206127],"genre_scores_gemma":[0.9607081,0.0001084145,0.03571322,0.0001109737,0.00001625007,0.00009791199,0.000595851,0.000053148,0.00259607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002790596,"threshold_uncertainty_score":0.009335458,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Igor Averbakh","is_ca":true},{"name":"Oded Berman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01936179780754634,"gpt":0.2328850661918709,"spread":0.2135232683843246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329803,0.0009127642,0.001848844,0.001073057,0.00082956,0.001627598,0.002052719,0.001902359,0.008636365],"category_scores_gemma":[0.003618411,0.0004867407,0.000952214,0.001699587,0.0004987911,0.002744405,0.002257032,0.001590172,0.001845644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390102,"about_ca_system_score_gemma":0.001718651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003490743,"about_ca_topic_score_gemma":0.003933539,"domain_scores_codex":[0.9989893,0.0002526472,0.0000570983,0.0002512469,0.0002422535,0.0002075557],"domain_scores_gemma":[0.9990137,0.0004830183,0.0001055339,0.0001551623,0.000161455,0.00008109646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005322833,0.0002203522,0.0009966798,0.0002031953,0.00008315536,0.000168982,0.0002340102,0.5805004,0.003901056,0.03596112,0.01389741,0.3633014],"study_design_scores_gemma":[0.00008796723,0.00005666293,0.0001506748,0.0000157409,0.00001287807,0.00006294515,0.00003978254,0.9628171,0.0007973432,0.03267144,0.003275792,0.00001171387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01482609,0.0002671391,0.9798854,0.0003004772,0.00006586183,0.00009395278,0.0002078629,0.001345758,0.003007484],"genre_scores_gemma":[0.1244076,0.0001846813,0.8706115,0.0001302498,0.00009992371,0.0002682411,0.0006618842,0.0002386648,0.003397127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008636365,"threshold_uncertainty_score":0.0288915,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Guy Desaulniers","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Simon Spoorendonk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02831324828736548,"gpt":0.2416397591937449,"spread":0.2133265109063794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003515918,0.001948548,0.001608036,0.0022592,0.0007932418,0.003481562,0.001760616,0.001730044,0.01256381],"category_scores_gemma":[0.008336409,0.0009744625,0.001676983,0.003460198,0.00163773,0.002887444,0.001680785,0.003705672,0.002262752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002432158,"about_ca_system_score_gemma":0.002126405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004210683,"about_ca_topic_score_gemma":0.002922924,"domain_scores_codex":[0.997413,0.001152266,0.0001565751,0.0002624862,0.0007788915,0.0002367908],"domain_scores_gemma":[0.9975841,0.001709828,0.0001679867,0.0002310799,0.0002582507,0.00004862216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007818985,0.00007907878,0.0001862147,0.0002108218,0.00006849353,0.00007163084,0.00008745064,0.4205441,0.0008347961,0.4256196,0.007782759,0.1444369],"study_design_scores_gemma":[0.00004240583,0.00003360828,0.0000519158,0.00007485649,0.00002059818,0.00002674765,0.00002130094,0.7031755,0.0006685191,0.2856241,0.01024952,0.00001087608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001941262,0.0006561755,0.9906883,0.0002254292,0.00006542743,0.00009492003,0.0001195009,0.0003242058,0.005884688],"genre_scores_gemma":[0.09857567,0.002106111,0.8913774,0.0002402669,0.000192478,0.0007592478,0.0009166521,0.0003819216,0.005450309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01256381,"threshold_uncertainty_score":0.0420301,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Undirected graph; Discrete mathematics; Multigraph","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Danielle Cox","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007172499954143852,"gpt":0.2076871176198089,"spread":0.2005146176656651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002154941,0.0006519567,0.001135944,0.001289728,0.001003271,0.001282639,0.001090079,0.001076029,0.002277007],"category_scores_gemma":[0.01760478,0.0009088356,0.0007591068,0.0006437273,0.002058435,0.002349215,0.001428134,0.00161951,0.000273045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047428,"about_ca_system_score_gemma":0.0008810469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004096972,"about_ca_topic_score_gemma":0.0005461552,"domain_scores_codex":[0.9982361,0.0005534731,0.00008522443,0.0005025339,0.0003776825,0.0002450542],"domain_scores_gemma":[0.9815677,0.01161259,0.002376341,0.001829523,0.00141117,0.001202607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007468721,0.0002676416,0.009105949,0.0007623812,0.0002503621,0.0009198129,0.0006932473,0.2191524,0.02186917,0.6965122,0.01106256,0.03865746],"study_design_scores_gemma":[0.0000915441,0.0001740927,0.003139263,0.00007576963,0.00009995136,0.0009303853,0.0002337832,0.1935428,0.007565433,0.7903074,0.00378912,0.00005040405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6764783,0.0005865921,0.3016655,0.002105715,0.00008250348,0.0001193806,0.0007484032,0.0004658076,0.01774786],"genre_scores_gemma":[0.9551897,0.0001829706,0.04283635,0.0002427746,0.00005377478,0.00009055765,0.0002390766,0.00007292482,0.001091841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002277007,"threshold_uncertainty_score":0.01139659,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Charles J. Colbourn","is_ca":false},{"name":"Danielle Cox","is_ca":true},{"name":"Christina Graves","is_ca":false},{"name":"Lucas Mol","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04651461942591406,"gpt":0.280360126489915,"spread":0.233845507064001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002043606,0.0002338605,0.000359631,0.001221186,0.001090651,0.003022478,0.000662832,0.001146614,0.005367442],"category_scores_gemma":[0.01095145,0.0002184986,0.0002596891,0.001389488,0.002568674,0.00651332,0.001395211,0.001290745,0.0006180082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365518,"about_ca_system_score_gemma":0.0008887033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003720079,"about_ca_topic_score_gemma":0.003189868,"domain_scores_codex":[0.9989298,0.0004617198,0.00002611999,0.0001697656,0.0002542642,0.0001583666],"domain_scores_gemma":[0.9923372,0.003439136,0.001055049,0.0006579765,0.001902385,0.000608235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009818808,0.0000138645,0.006265193,0.0001496112,0.0000238519,0.0001915871,0.001103203,0.02637191,0.0006041723,0.9036105,0.01293472,0.0486332],"study_design_scores_gemma":[0.000008372861,0.00006388124,0.004425032,0.0001932188,0.00002142651,0.0002705696,0.002434708,0.02924134,0.0005463227,0.9157525,0.04701219,0.00003035625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.482476,0.02171385,0.2534823,0.06181828,0.001065108,0.0000807955,0.001168212,0.0006423455,0.1775532],"genre_scores_gemma":[0.9823893,0.004654159,0.006137848,0.0005478506,0.0003829867,0.00002613006,0.0001105341,0.00007390272,0.005677361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005367442,"threshold_uncertainty_score":0.01795584,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Derek G. Corneil","is_ca":true},{"name":"Feodor F. Dragan","is_ca":false},{"name":"Ekkehard Köhler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02081870194448071,"gpt":0.27063153885149,"spread":0.2498128369070093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892863,0.0008191945,0.001431402,0.003834787,0.0009235633,0.001602688,0.001712923,0.001167909,0.003374675],"category_scores_gemma":[0.02669483,0.0008725089,0.0007264121,0.001982136,0.001805165,0.005074873,0.001614797,0.001803189,0.001070551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001484062,"about_ca_system_score_gemma":0.000832553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00413882,"about_ca_topic_score_gemma":0.003462662,"domain_scores_codex":[0.9980009,0.0007114465,0.00009954,0.0004095265,0.0005421264,0.0002364126],"domain_scores_gemma":[0.9721281,0.02250846,0.001124943,0.002405148,0.001142489,0.0006909188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002036217,0.000262025,0.04204889,0.0008261831,0.000269332,0.0003575229,0.000815466,0.4733166,0.03826911,0.1464445,0.01676011,0.278594],"study_design_scores_gemma":[0.000039825,0.00007395805,0.002262059,0.00006731511,0.0000227026,0.0002213854,0.00009926778,0.8836356,0.005456199,0.1043391,0.00375811,0.00002449271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3439096,0.004592921,0.6313341,0.002283119,0.0001233638,0.0001014095,0.001056622,0.002192166,0.01440672],"genre_scores_gemma":[0.7766128,0.001292121,0.2183488,0.0003026878,0.0001809323,0.0001318877,0.0009900235,0.0003541259,0.001786553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00413882,"threshold_uncertainty_score":0.01529914,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Miao Jun Huang","is_ca":true},{"name":"Flaminia L. Luccio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01601397161217643,"gpt":0.241271579039043,"spread":0.2252576074268665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034854,0.0006708481,0.0008659394,0.0005811985,0.0008617808,0.001237482,0.001186724,0.0008862067,0.002021276],"category_scores_gemma":[0.002699272,0.0003660034,0.000562693,0.0006681854,0.001112306,0.001609776,0.002201586,0.0006525182,0.0004141357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006720246,"about_ca_system_score_gemma":0.0004501457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002170192,"about_ca_topic_score_gemma":0.001229949,"domain_scores_codex":[0.998937,0.0004716342,0.00005267265,0.0001504001,0.0002217007,0.0001666929],"domain_scores_gemma":[0.9982216,0.0006855165,0.0003090955,0.0003788951,0.0002436464,0.0001612953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003265632,0.00009811464,0.001396526,0.0001309504,0.00005271343,0.0003901107,0.0002257882,0.9335677,0.01282135,0.01938389,0.001162281,0.03044398],"study_design_scores_gemma":[0.00003625122,0.0001392387,0.0002403311,0.00001710051,0.00001132173,0.00009195674,0.0001671481,0.9739106,0.008232096,0.01320636,0.003936498,0.00001094516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4075515,0.001073761,0.57901,0.0005861126,0.0001369386,0.0002239327,0.0001118095,0.0008493279,0.01045663],"genre_scores_gemma":[0.8928194,0.0004297534,0.100936,0.0001272696,0.00004394436,0.0001423364,0.0002271939,0.0001011309,0.005173074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002170192,"threshold_uncertainty_score":0.006761849,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Brian Kallehauge","is_ca":false},{"name":"Natashia Boland","is_ca":false},{"name":"Oli B.G. Madsen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01413964396293443,"gpt":0.2414425082797293,"spread":0.2273028643167949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009992522,0.001324908,0.000786669,0.0006504569,0.0004045563,0.001284495,0.000960962,0.0008906599,0.006891374],"category_scores_gemma":[0.003193288,0.000432059,0.0008975352,0.001180958,0.0007965037,0.00238674,0.001180367,0.002769144,0.0004800988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262474,"about_ca_system_score_gemma":0.001155192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003624662,"about_ca_topic_score_gemma":0.002389083,"domain_scores_codex":[0.998955,0.0003746054,0.00004684754,0.0001718149,0.0003120634,0.0001396587],"domain_scores_gemma":[0.9985381,0.00103588,0.0001737326,0.00004701974,0.0001510093,0.00005410917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008910927,0.00007512768,0.000390515,0.0002043554,0.00004059817,0.0001825219,0.0001148418,0.737681,0.002621474,0.2153461,0.003256536,0.03999772],"study_design_scores_gemma":[0.00002764478,0.00005325022,0.0001912345,0.00002899138,0.00001312128,0.00005762227,0.00003651028,0.907607,0.0007254258,0.08585183,0.005396609,0.00001085676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02228858,0.000714522,0.96676,0.0004651395,0.00009285922,0.0001272438,0.0002956539,0.00007884897,0.009177327],"genre_scores_gemma":[0.5388077,0.00284515,0.4412655,0.0003040046,0.0003459468,0.0009219249,0.001181212,0.0001772802,0.01415128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006891374,"threshold_uncertainty_score":0.02305394,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Minh Hoàng Hà","is_ca":true},{"name":"Nathalie Bostel","is_ca":false},{"name":"André Langevin","is_ca":true},{"name":"Louis‐Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01026778198448063,"gpt":0.2227124080711484,"spread":0.2124446260866678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001636149,0.0009376871,0.001511932,0.0009069403,0.0007518629,0.00184322,0.001732437,0.002397003,0.01216284],"category_scores_gemma":[0.007113638,0.0007358908,0.001077979,0.001283002,0.0009595827,0.003414325,0.001596721,0.002131719,0.0006178431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009032987,"about_ca_system_score_gemma":0.0009449742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002471893,"about_ca_topic_score_gemma":0.001961422,"domain_scores_codex":[0.9985078,0.0007101162,0.00005413633,0.0003182792,0.0002441565,0.00016553],"domain_scores_gemma":[0.9965029,0.002675287,0.0002490982,0.0001899887,0.0002081855,0.0001744973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001488387,0.0001642874,0.0006006781,0.0002188278,0.00006879552,0.0002173092,0.0001147843,0.8846968,0.0009219858,0.07607539,0.00606008,0.03071219],"study_design_scores_gemma":[0.00003502382,0.00004543866,0.0001333927,0.00002344234,0.00001431786,0.00009377643,0.00009261534,0.9130706,0.00041712,0.08349746,0.00256497,0.00001180508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09178353,0.0008533518,0.8844736,0.001783783,0.0002226188,0.0001451144,0.0004560867,0.0003840975,0.01989777],"genre_scores_gemma":[0.69704,0.0006165495,0.2897422,0.0003443949,0.0001694693,0.0002060567,0.0007470828,0.0002588741,0.01087545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01216284,"threshold_uncertainty_score":0.04068875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Claudia Archetti","is_ca":false},{"name":"M. Grazia Speranza","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01037015660828235,"gpt":0.1923077332894443,"spread":0.1819375766811619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128426,0.001274565,0.001665179,0.001271811,0.001131122,0.001385901,0.001608947,0.0020471,0.007487654],"category_scores_gemma":[0.002653646,0.0008374311,0.000853244,0.002031551,0.0005477559,0.001842706,0.001083736,0.001758203,0.0009489363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410665,"about_ca_system_score_gemma":0.00197871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00690271,"about_ca_topic_score_gemma":0.005449513,"domain_scores_codex":[0.9994443,0.000185971,0.00002741539,0.0001146858,0.0001143317,0.0001132132],"domain_scores_gemma":[0.9988891,0.0007888373,0.00007630781,0.00004724775,0.0001132746,0.00008521913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003363929,0.0004002101,0.0006706331,0.0002090098,0.00009425807,0.0001869274,0.0001228432,0.7546445,0.001453262,0.02004072,0.009705349,0.2121358],"study_design_scores_gemma":[0.00008119854,0.00007475126,0.0001029427,0.00001276611,0.0000162707,0.00003612453,0.00002671354,0.9882754,0.000409718,0.009584581,0.001372215,0.000007364784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0681204,0.001092456,0.9185435,0.0006683603,0.0001371296,0.0003979673,0.0004156766,0.0009194236,0.009705156],"genre_scores_gemma":[0.1572109,0.0005199659,0.8367715,0.0001239076,0.00007441462,0.0004048744,0.0009405427,0.0001922031,0.003761708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007487654,"threshold_uncertainty_score":0.02504867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Nicola Bianchessi","is_ca":false},{"name":"M. Grazia Speranza","is_ca":false},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006827192193179859,"gpt":0.197415121976764,"spread":0.1905879297835841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160825,0.001576658,0.001392363,0.0007858824,0.0007205489,0.001704768,0.001980247,0.00180668,0.007498506],"category_scores_gemma":[0.002585371,0.0005215521,0.000844341,0.001736654,0.0007640804,0.001878129,0.001450379,0.001110193,0.0005561294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001305503,"about_ca_system_score_gemma":0.0009208566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003491009,"about_ca_topic_score_gemma":0.001825782,"domain_scores_codex":[0.998843,0.0004423953,0.00004797415,0.0002232258,0.0001904963,0.0002529224],"domain_scores_gemma":[0.9988,0.000662986,0.0001345017,0.00008213882,0.000112873,0.000207431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003645839,0.0002730501,0.001201255,0.000364792,0.0001542089,0.0008814152,0.0002147655,0.9091665,0.00206389,0.03114137,0.006440158,0.04773414],"study_design_scores_gemma":[0.00008962351,0.0002146083,0.0004264317,0.00003745146,0.00004625645,0.0003272637,0.0002739769,0.9586525,0.001299554,0.03446642,0.004141295,0.0000245881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3808838,0.001450856,0.5872883,0.001322809,0.0001909196,0.0004785843,0.001300349,0.0003757037,0.02670869],"genre_scores_gemma":[0.8949825,0.0006446737,0.09283089,0.0001520331,0.00008295693,0.0003029771,0.0009477634,0.0001233236,0.009932817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007498506,"threshold_uncertainty_score":0.02508497,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"Inmaculada Rodríguez‐Martín","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01445269656084273,"gpt":0.2739389233376147,"spread":0.2594862267767719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002493972,0.0004199022,0.0005074353,0.0006894998,0.0006080496,0.001382724,0.000670647,0.001072669,0.008638737],"category_scores_gemma":[0.001021042,0.0001750956,0.0004045931,0.001367936,0.0007174853,0.001706311,0.0008245293,0.0004646761,0.0005714205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018416,"about_ca_system_score_gemma":0.0005892206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002705467,"about_ca_topic_score_gemma":0.002556299,"domain_scores_codex":[0.9997299,0.0000688565,0.00001286028,0.00009225519,0.00004782117,0.00004829944],"domain_scores_gemma":[0.9997694,0.0001060017,0.00004713181,0.00002650307,0.00002178799,0.00002926078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001912195,0.00007259839,0.001790931,0.0003227051,0.00006943287,0.0005791486,0.0002244793,0.3852375,0.005301274,0.4770287,0.009971303,0.1192108],"study_design_scores_gemma":[0.00003765467,0.00009801365,0.0007152443,0.00008876228,0.00004323071,0.0004450758,0.000377814,0.567344,0.003628061,0.387824,0.03936851,0.00002970934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1875073,0.002394018,0.7697917,0.001544173,0.0001773308,0.0001729318,0.0005799166,0.0003548138,0.03747792],"genre_scores_gemma":[0.778904,0.001721229,0.2030212,0.0001481665,0.00009273586,0.000125762,0.0004339396,0.00006346324,0.01548952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008638737,"threshold_uncertainty_score":0.02889949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Y.P. Aneja","is_ca":true},{"name":"R. Chandrasekaran","is_ca":false},{"name":"K. P. K. Nair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01790803809284282,"gpt":0.2179764931093047,"spread":0.2000684550164619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796766,0.0007111449,0.001114485,0.0008148895,0.0005177463,0.001099736,0.0012821,0.0009390724,0.003903483],"category_scores_gemma":[0.003513272,0.0004354672,0.0005374946,0.0009868828,0.001761202,0.002753148,0.001526202,0.0009999727,0.0003838048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009501132,"about_ca_system_score_gemma":0.0006918886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001163259,"about_ca_topic_score_gemma":0.0007462366,"domain_scores_codex":[0.9991075,0.0003423936,0.00003832807,0.0001871428,0.0001358996,0.0001886335],"domain_scores_gemma":[0.9981762,0.0008828847,0.0002805243,0.0002884959,0.0001519623,0.0002198914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004717134,0.0001430127,0.0008237459,0.0001963289,0.00005149246,0.0001719064,0.0001463261,0.8705351,0.009561175,0.07330229,0.002680855,0.04191598],"study_design_scores_gemma":[0.00006149302,0.0002026934,0.0003920914,0.00002071179,0.00002974113,0.0001479906,0.00008031851,0.9249985,0.007792317,0.06377143,0.002486244,0.00001647525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3125345,0.0005674284,0.6697515,0.0007073556,0.00005514986,0.0001129142,0.0001917795,0.0005613688,0.01551799],"genre_scores_gemma":[0.8971141,0.0003138715,0.09639832,0.00008458218,0.00004182987,0.00007370216,0.0001885018,0.0001359713,0.005649228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003903483,"threshold_uncertainty_score":0.01305842,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Corinne Feremans","is_ca":false},{"name":"Martine Labbé","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007846760493643152,"gpt":0.2338371477629094,"spread":0.2259903872692662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009007,0.0008960795,0.001239285,0.0008098817,0.0005877455,0.0014113,0.001090056,0.001225531,0.004519155],"category_scores_gemma":[0.003020824,0.0004701259,0.0007760337,0.0017684,0.0008189178,0.001392379,0.0009424989,0.001272266,0.0005789682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106662,"about_ca_system_score_gemma":0.001240908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004785267,"about_ca_topic_score_gemma":0.003815241,"domain_scores_codex":[0.999276,0.0003113823,0.00002283685,0.00009419881,0.0002049288,0.00009063884],"domain_scores_gemma":[0.9992605,0.000476835,0.00006881964,0.00005423845,0.0001009915,0.00003853035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005241888,0.00005136869,0.0002218403,0.0001129206,0.0000284407,0.00005302711,0.00005252641,0.8524824,0.0007760806,0.06494136,0.004267103,0.07696047],"study_design_scores_gemma":[0.0000147849,0.00001418844,0.00004619372,0.00001424292,0.000005742565,0.00002479685,0.00001284994,0.9639839,0.000220473,0.03399212,0.00166745,0.000003379681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01184139,0.0005074108,0.9808301,0.0002849494,0.00004931179,0.0000935694,0.0001011216,0.0001667086,0.006125459],"genre_scores_gemma":[0.2225312,0.0009454387,0.7710676,0.0001425062,0.0001096353,0.0003437739,0.0005739114,0.0001670808,0.00411874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004785267,"threshold_uncertainty_score":0.01511812,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean‐François Bérubé","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01551276103215186,"gpt":0.2532832045046128,"spread":0.2377704434724609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119324,0.0009416555,0.001049737,0.0009679649,0.0008110815,0.001065903,0.001385776,0.001091395,0.005438739],"category_scores_gemma":[0.002526001,0.0005060973,0.0007057495,0.001690015,0.0005670173,0.001252602,0.001131658,0.00155877,0.0005296016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049331,"about_ca_system_score_gemma":0.001707962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004759562,"about_ca_topic_score_gemma":0.003523512,"domain_scores_codex":[0.9994369,0.0001811352,0.00003136693,0.0001125533,0.0001263303,0.0001117471],"domain_scores_gemma":[0.9990527,0.0005875482,0.00008029121,0.00005534261,0.0001427436,0.00008133246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002970195,0.000316471,0.0007018002,0.0002208013,0.00007595202,0.000150463,0.0001693632,0.6436868,0.00218684,0.04562884,0.009459858,0.2971058],"study_design_scores_gemma":[0.00009060756,0.00007557243,0.000136599,0.00001565643,0.00002034658,0.00004504553,0.00003424162,0.9669284,0.0009973655,0.02897107,0.002673961,0.00001102872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02427378,0.0001756316,0.9692197,0.0002623575,0.00005162953,0.0002092959,0.0001723049,0.0003971223,0.005238245],"genre_scores_gemma":[0.1558416,0.0001925061,0.8395499,0.0001032755,0.00003929749,0.0004068004,0.0005861981,0.0001532289,0.003127224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005438739,"threshold_uncertainty_score":0.01819444,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Géraldine Heilporn","is_ca":false},{"name":"Martine Labbé","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009393117172837029,"gpt":0.2465942846742894,"spread":0.2372011675014523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259034,0.0007675377,0.0009812776,0.0007965504,0.000815702,0.00277342,0.001148359,0.001142784,0.007783512],"category_scores_gemma":[0.004323641,0.0008070655,0.000999275,0.001628985,0.001929381,0.002153828,0.001065841,0.001648246,0.0003581827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002051019,"about_ca_system_score_gemma":0.001205574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01009123,"about_ca_topic_score_gemma":0.005508986,"domain_scores_codex":[0.9988583,0.0006027925,0.00003829696,0.0001369066,0.000214346,0.0001492496],"domain_scores_gemma":[0.9983709,0.001125689,0.0001336539,0.00009560979,0.000154341,0.0001197775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005008637,0.00007283792,0.0003580613,0.0001028758,0.00002161401,0.0001032001,0.00008687714,0.7628272,0.0004422023,0.22669,0.001885651,0.007359564],"study_design_scores_gemma":[0.00003095308,0.0000408597,0.0001858524,0.00004592661,0.00001356621,0.00003922902,0.000147132,0.8577532,0.0002596365,0.1360963,0.005374738,0.00001251964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09174751,0.0016617,0.8438854,0.001713321,0.0003205583,0.0003234616,0.0004996887,0.00006321679,0.05978515],"genre_scores_gemma":[0.8175491,0.002789721,0.1644,0.000302944,0.0002972455,0.0004046321,0.0004124865,0.0001132711,0.01373067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01009123,"threshold_uncertainty_score":0.02603841,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01459087504712119,"gpt":0.2115262765057453,"spread":0.1969354014586241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197147,0.0006498137,0.001560052,0.0007917639,0.0006128735,0.0007414413,0.00102861,0.001003353,0.002384834],"category_scores_gemma":[0.003022522,0.0005580473,0.0006177265,0.0008468554,0.0004590928,0.001236473,0.0006758554,0.0006658076,0.0002367652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009148699,"about_ca_system_score_gemma":0.0007251591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005856001,"about_ca_topic_score_gemma":0.004771795,"domain_scores_codex":[0.9995,0.0002880497,0.00001694498,0.00007375854,0.00007370095,0.00004749474],"domain_scores_gemma":[0.9984981,0.001244712,0.0001037347,0.00002701801,0.00006304171,0.00006340305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008419151,0.00007951753,0.0003522677,0.00005428906,0.00003773981,0.00006328141,0.00002586349,0.9792987,0.0002559487,0.006528934,0.0009214941,0.01229784],"study_design_scores_gemma":[0.00001500072,0.00003022153,0.00005800456,0.000003512333,0.000005287354,0.00000912629,0.00001026636,0.9972845,0.00006514908,0.002310686,0.0002058139,0.000002483819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2945811,0.003084448,0.6913794,0.0009199819,0.0001273917,0.000186113,0.0002626685,0.0003082326,0.009150792],"genre_scores_gemma":[0.7703307,0.0007751132,0.2220067,0.0001037851,0.00008999353,0.0002570684,0.0003510995,0.00007736663,0.006008155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005856001,"threshold_uncertainty_score":0.01164383,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Petrişor Panaite","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01314495385221478,"gpt":0.2557916865583918,"spread":0.242646732706177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002347358,0.0005815208,0.001050298,0.0009272057,0.0007390679,0.001692199,0.000863737,0.00127678,0.00216766],"category_scores_gemma":[0.04269503,0.0004390242,0.0004125558,0.001480054,0.001170626,0.005285787,0.001635074,0.0007842675,0.0004648418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007390555,"about_ca_system_score_gemma":0.001057786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002289211,"about_ca_topic_score_gemma":0.002637015,"domain_scores_codex":[0.9979402,0.0008388593,0.0001109057,0.0003105618,0.0004305324,0.0003689181],"domain_scores_gemma":[0.9661954,0.02869359,0.001137566,0.002599365,0.0009148821,0.0004592682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006905005,0.0001726269,0.008295046,0.0001431695,0.00008984424,0.0002215572,0.0001496149,0.9140038,0.004194063,0.003430753,0.0008255969,0.06778334],"study_design_scores_gemma":[0.00006873405,0.0004969916,0.007181835,0.0000422821,0.0001176976,0.0004805419,0.0002642019,0.9677936,0.01093982,0.01165705,0.0009151392,0.00004206107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9375336,0.001329889,0.05128863,0.0008137019,0.00002933496,0.00003723564,0.0003004891,0.0005589351,0.008108283],"genre_scores_gemma":[0.9924827,0.0002983577,0.006421098,0.00003280278,0.00001102165,0.00001751104,0.0001620784,0.00007129798,0.0005031223],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002347358,"threshold_uncertainty_score":0.01241422,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Arthur L. Liestman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02272322714607927,"gpt":0.2593834600695674,"spread":0.2366602329234881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004146937,0.002205177,0.002073837,0.00279192,0.002945422,0.003379033,0.005874699,0.00195718,0.02286545],"category_scores_gemma":[0.02351966,0.001046349,0.001549606,0.00342723,0.002617974,0.01214874,0.004905818,0.005103502,0.005330056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00561835,"about_ca_system_score_gemma":0.003172588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007742407,"about_ca_topic_score_gemma":0.01029949,"domain_scores_codex":[0.9949479,0.0006726399,0.0001802774,0.0009329014,0.001763826,0.001502384],"domain_scores_gemma":[0.9811558,0.01117704,0.0009072484,0.003099158,0.002697626,0.0009630793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008355877,0.0003596287,0.002398158,0.000994842,0.00008453145,0.0002826839,0.001038544,0.1057722,0.01237135,0.6739661,0.05000468,0.1518918],"study_design_scores_gemma":[0.00007866179,0.0002193826,0.001290045,0.0003129492,0.0001581192,0.0006299612,0.0004031355,0.2960461,0.01022646,0.6405958,0.04991318,0.0001261615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05965567,0.01316564,0.7615104,0.00481402,0.0009728659,0.0002890685,0.002439778,0.003545709,0.153607],"genre_scores_gemma":[0.5655164,0.01156108,0.3656707,0.001693481,0.001742681,0.000629793,0.002986281,0.002132728,0.04806688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02286545,"threshold_uncertainty_score":0.07649255,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Irina Gribkovskaia","is_ca":false},{"name":"Øyvind Halskau","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01678236245234923,"gpt":0.2940905582696183,"spread":0.2773081958172691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128952,0.000384224,0.0003703942,0.003367931,0.003373768,0.004699538,0.0009079056,0.002292499,0.006841604],"category_scores_gemma":[0.004077249,0.0002699675,0.0002020121,0.003287956,0.007946174,0.009215877,0.002181906,0.003632834,0.0008968876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005271248,"about_ca_system_score_gemma":0.001404337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004464739,"about_ca_topic_score_gemma":0.002743479,"domain_scores_codex":[0.9989317,0.0003606204,0.00005949088,0.0002642475,0.0002588196,0.0001250737],"domain_scores_gemma":[0.9985133,0.0008133698,0.0001473735,0.000125396,0.0002606577,0.0001398453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004397221,0.000004249485,0.00004808247,0.00002764722,0.000002003291,0.00002383194,0.0003393085,0.0001319612,0.00001626524,0.9896992,0.00386712,0.005835962],"study_design_scores_gemma":[0.000003667104,0.00001141486,0.0002531584,0.0001744171,0.000004360937,0.0001395387,0.0003899397,0.0004172206,0.0001161463,0.7352272,0.263254,0.00000898561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02469996,0.2233932,0.01601176,0.04702499,0.003264923,0.00002837857,0.000235518,0.00008155014,0.6852597],"genre_scores_gemma":[0.8065622,0.125144,0.005656734,0.006700743,0.004652712,0.00007191624,0.0001778739,0.0001001498,0.05093358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006841604,"threshold_uncertainty_score":0.03824574,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Claudio Contardo","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"François Lessard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01564087598570789,"gpt":0.2372260595233076,"spread":0.2215851835375998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003547184,0.001771559,0.001437101,0.0008178821,0.0008258684,0.002098395,0.001530333,0.001265761,0.005196655],"category_scores_gemma":[0.01179253,0.0004966488,0.001144365,0.001010834,0.00121726,0.003957984,0.001730497,0.002744775,0.0005570586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291607,"about_ca_system_score_gemma":0.002205374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002475676,"about_ca_topic_score_gemma":0.003169332,"domain_scores_codex":[0.9983786,0.0006778589,0.00005775108,0.0002291159,0.0002996834,0.0003570228],"domain_scores_gemma":[0.9885595,0.00984872,0.0004952559,0.0005425562,0.0002951974,0.0002586315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000306792,0.0002295,0.0006274851,0.0003253353,0.00008346413,0.00008795314,0.0001903716,0.8540173,0.003944855,0.09512674,0.001629255,0.0434309],"study_design_scores_gemma":[0.00005808939,0.0002311729,0.0003279046,0.00004580705,0.00005230092,0.00005908976,0.000090318,0.9367768,0.003837041,0.05638147,0.002123231,0.00001689226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1361165,0.00129279,0.840011,0.0005584491,0.00007048268,0.0002497194,0.0001946397,0.0003072809,0.02119909],"genre_scores_gemma":[0.6506121,0.001653184,0.3417238,0.0002200345,0.00008298668,0.0003682371,0.0004221576,0.0003029225,0.004614623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005196655,"threshold_uncertainty_score":0.01875949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Frédéric Havet","is_ca":false},{"name":"Ross J. Kang","is_ca":true},{"name":"Jean‐Sébastien Sereni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02196033352821706,"gpt":0.2843527786470723,"spread":0.2623924451188552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250922,0.0005057978,0.000739531,0.0006191906,0.0007907817,0.001760337,0.00145378,0.0006308228,0.003100164],"category_scores_gemma":[0.004828739,0.0003372183,0.000399538,0.001606933,0.001118687,0.002370752,0.00111182,0.001158341,0.000263615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134857,"about_ca_system_score_gemma":0.0006376484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003215743,"about_ca_topic_score_gemma":0.002893217,"domain_scores_codex":[0.9988946,0.0003634568,0.0000561802,0.0002711496,0.0002182639,0.0001963041],"domain_scores_gemma":[0.9936047,0.003021207,0.0008469383,0.001593346,0.0004806231,0.0004532245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001217152,0.0002505779,0.009332425,0.0005078182,0.0001140783,0.0006928923,0.0006758875,0.6562257,0.01475136,0.2222919,0.01191486,0.08202534],"study_design_scores_gemma":[0.0000420059,0.00005038598,0.001256065,0.00001859344,0.00002391533,0.0002586321,0.0002610486,0.7878114,0.004657493,0.2015822,0.004017351,0.00002082847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6959259,0.0005216885,0.2936537,0.0008776799,0.00009632089,0.0001044423,0.0006745604,0.0005892285,0.007556516],"genre_scores_gemma":[0.9168691,0.0003022378,0.07925352,0.0001432908,0.00006098444,0.00006414575,0.0007858421,0.00009323152,0.002427601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003215743,"threshold_uncertainty_score":0.01037103,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergei Bespamyatnikh","is_ca":false},{"name":"Binay Bhattacharya","is_ca":true},{"name":"Mark Keil","is_ca":true},{"name":"David Kirkpatrick","is_ca":true},{"name":"Michael Segal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02763269152566155,"gpt":0.221020370759495,"spread":0.1933876792338335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082675,0.001676453,0.002085043,0.002524948,0.001626136,0.003666604,0.003021162,0.00198927,0.009322437],"category_scores_gemma":[0.007700725,0.001087438,0.001324201,0.003566684,0.001153682,0.006134562,0.003459912,0.001706592,0.001886659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002779093,"about_ca_system_score_gemma":0.002370012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005206712,"about_ca_topic_score_gemma":0.005649281,"domain_scores_codex":[0.9980808,0.0005215991,0.000138774,0.0005495483,0.0003904723,0.0003188222],"domain_scores_gemma":[0.9964574,0.00183978,0.0005706992,0.0004896758,0.0004279642,0.0002145241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006545245,0.0002686009,0.001596252,0.0003458635,0.0001049027,0.0001138159,0.0004862486,0.5823148,0.001747401,0.1378043,0.01739333,0.2571699],"study_design_scores_gemma":[0.0001427159,0.00006870005,0.000231563,0.0000318014,0.00002442356,0.00008646939,0.0002126531,0.8166921,0.001698988,0.1755593,0.005226746,0.00002454475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03037395,0.0004501368,0.9612895,0.0004217689,0.00006774231,0.000222376,0.0006166163,0.00208853,0.004469366],"genre_scores_gemma":[0.1985487,0.0004219165,0.7943477,0.00009580234,0.00008699077,0.0003731291,0.001581203,0.0004698555,0.004074634],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009322437,"threshold_uncertainty_score":0.03118664,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Zvi Drezner","is_ca":false},{"name":"Dmitry Krass","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01670503028694023,"gpt":0.2133981429654627,"spread":0.1966931126785224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032952,0.001027858,0.001214716,0.0009257853,0.0005407608,0.00081126,0.001298641,0.001049122,0.005583303],"category_scores_gemma":[0.001876785,0.0004870549,0.0005440486,0.001340857,0.0007873261,0.001471517,0.001377921,0.0008869172,0.0006681848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121341,"about_ca_system_score_gemma":0.0008942841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006144471,"about_ca_topic_score_gemma":0.005523421,"domain_scores_codex":[0.9996013,0.0001644485,0.00001269433,0.00008518893,0.0000809301,0.00005538102],"domain_scores_gemma":[0.999353,0.0003721903,0.00005639853,0.00006159217,0.0001144842,0.00004241861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001137064,0.00003269726,0.0002857197,0.00003701387,0.00002215537,0.00002651784,0.00003541592,0.9520563,0.0007187172,0.006966734,0.001487789,0.03821727],"study_design_scores_gemma":[0.000009407516,0.00002302573,0.00004576036,0.000002208937,0.000002595576,0.000004239992,0.000005813495,0.9961848,0.0001635612,0.003264633,0.0002921509,0.000001783751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0208273,0.0001887729,0.9749945,0.000154201,0.00002263127,0.00004716356,0.00007594552,0.0004644541,0.003224988],"genre_scores_gemma":[0.4774168,0.000210227,0.5125094,0.0001428729,0.00007206052,0.0003382471,0.0005208018,0.000338782,0.008450746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006144471,"threshold_uncertainty_score":0.01867807,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sébastien Lannez","is_ca":false},{"name":"Christian Artigues","is_ca":false},{"name":"Jean Damay","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0213558893100198,"gpt":0.2254491847852068,"spread":0.204093295475187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055216,0.0008462399,0.0006031662,0.0007858123,0.0004239187,0.0008162117,0.0007509452,0.001071601,0.006092293],"category_scores_gemma":[0.001527878,0.0004158439,0.0007700792,0.0009748492,0.0004179932,0.0008062607,0.0005125492,0.000826164,0.0004447432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008485873,"about_ca_system_score_gemma":0.001256486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005933668,"about_ca_topic_score_gemma":0.006913578,"domain_scores_codex":[0.9997389,0.00007493469,0.00001100069,0.00009199771,0.00004455444,0.00003870167],"domain_scores_gemma":[0.9992419,0.0005325807,0.0000689654,0.00005344298,0.00007217614,0.00003085303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001446372,0.0002233995,0.0010687,0.0002689124,0.00006567307,0.0001528383,0.00007146723,0.8597556,0.002285753,0.01430767,0.009052786,0.1126026],"study_design_scores_gemma":[0.00002290934,0.00004619335,0.000225596,0.00000987742,0.00001234396,0.00005366526,0.00002381311,0.9909034,0.0006599916,0.006522052,0.001514562,0.000005454939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07291273,0.0004931909,0.9147197,0.0006103299,0.0001184927,0.0002374539,0.001250954,0.0006438016,0.009013389],"genre_scores_gemma":[0.3055093,0.00031203,0.6849216,0.0001964395,0.00008778076,0.0003250059,0.001808733,0.0001673086,0.00667175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006092293,"threshold_uncertainty_score":0.02038074,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Arthur L. Liestman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01518870997255777,"gpt":0.2276185526352694,"spread":0.2124298426627116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004731247,0.0001856524,0.0003517139,0.000446681,0.000755257,0.001607721,0.0007262692,0.0004700108,0.003318945],"category_scores_gemma":[0.003602023,0.000245828,0.0002027778,0.0008187524,0.000769606,0.001960761,0.0006161025,0.0006783108,0.0008676383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135907,"about_ca_system_score_gemma":0.0005830453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001904468,"about_ca_topic_score_gemma":0.001967659,"domain_scores_codex":[0.9995767,0.0001037892,0.00002032867,0.00007561134,0.00009782724,0.0001256377],"domain_scores_gemma":[0.9975771,0.001242571,0.0003923169,0.0003448311,0.0003145522,0.0001286521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005379766,0.0001137904,0.004053774,0.0005918051,0.00005046368,0.0002647136,0.0008383745,0.1830225,0.05513471,0.5873361,0.02233186,0.145724],"study_design_scores_gemma":[0.00005616884,0.000144771,0.002615505,0.0001086394,0.00004017568,0.0008237229,0.000344412,0.4366259,0.02452515,0.5088943,0.02577592,0.00004542051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4026895,0.003338282,0.5150899,0.001817211,0.0001098832,0.0001244602,0.0006788686,0.001177154,0.07497458],"genre_scores_gemma":[0.9103961,0.001503444,0.08143815,0.0002383003,0.00007764374,0.00007724131,0.0003643925,0.0001650465,0.00573986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003318945,"threshold_uncertainty_score":0.01110297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Juan‐Pablo Riquelme‐Rodríguez","is_ca":true},{"name":"André Langevin","is_ca":true},{"name":"Michel Gamache","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01909616450260213,"gpt":0.239296109669258,"spread":0.2201999451666558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370289,0.0007904819,0.001072964,0.0008602324,0.0005400927,0.0006617747,0.001306299,0.001047783,0.001951154],"category_scores_gemma":[0.003195934,0.000607649,0.0005752948,0.0009080094,0.0007072651,0.001147931,0.0008420796,0.0008402643,0.0001911621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001158814,"about_ca_system_score_gemma":0.0009738902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005781937,"about_ca_topic_score_gemma":0.00666494,"domain_scores_codex":[0.9995475,0.0002431826,0.00001770978,0.00007940675,0.00006952245,0.000042626],"domain_scores_gemma":[0.9983494,0.00132916,0.0001442853,0.00003720589,0.00008313105,0.00005680811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002955219,0.00003162202,0.0002027119,0.00003409413,0.00002020712,0.00003239405,0.00002599735,0.9820877,0.0001876562,0.008323383,0.0004733273,0.008551375],"study_design_scores_gemma":[0.000007256474,0.00001412566,0.00002271381,0.000002409253,0.000002792161,0.000005879202,0.00000531875,0.9967303,0.0000381643,0.00297297,0.0001961567,0.000001881335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03790702,0.000773797,0.9562663,0.0003375771,0.00004675475,0.00009334748,0.00007240765,0.0001523284,0.004350566],"genre_scores_gemma":[0.5641348,0.0005416382,0.4273509,0.0001368732,0.0000753284,0.0005424343,0.0002099941,0.0001031523,0.006904919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005781937,"threshold_uncertainty_score":0.0114966,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Mathematical optimization; Computer science; Mathematics; Artificial intelligence","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Jiamin Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01172507816922535,"gpt":0.1962834877117129,"spread":0.1845584095424876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004551331,0.001223763,0.002399219,0.001516717,0.001055234,0.002986277,0.003275996,0.00445528,0.005915758],"category_scores_gemma":[0.01611421,0.001701301,0.001712261,0.002681632,0.00313249,0.005458899,0.002584368,0.003234339,0.0004463839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003750687,"about_ca_system_score_gemma":0.001033949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004141899,"about_ca_topic_score_gemma":0.003152753,"domain_scores_codex":[0.9961463,0.001857364,0.0001600814,0.0007251514,0.0006336932,0.0004773847],"domain_scores_gemma":[0.9875669,0.009272523,0.001573853,0.0004762801,0.0006632395,0.0004470548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001021363,0.00004671604,0.000540565,0.00009902233,0.00005203848,0.0001160015,0.00007404614,0.7627528,0.000313412,0.2291996,0.00152778,0.005175835],"study_design_scores_gemma":[0.00006653748,0.00002927419,0.0002304504,0.00001796696,0.00001852083,0.00006036011,0.00005925409,0.7608465,0.0001989026,0.2375272,0.0009157268,0.0000292537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1027343,0.0006460009,0.8841187,0.003350386,0.0001102204,0.000101309,0.0005474505,0.0001749155,0.008216732],"genre_scores_gemma":[0.9219385,0.0008094865,0.06576004,0.0002772553,0.0002537802,0.000299579,0.0004913205,0.00007240477,0.01009767],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005915758,"threshold_uncertainty_score":0.02721322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}