{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007728843,0.0002061825,0.0001682821,0.00004077988,0.0002431107,0.00009913483,0.0002651525,0.00009484238,0.000006740194],"category_scores_gemma":[0.00000908758,0.0001651213,0.00003632824,0.0003287758,0.00005374839,0.0001857295,0.00002636866,0.0002434186,0.000002891615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000142795,"about_ca_system_score_gemma":0.00002603792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002751359,"about_ca_topic_score_gemma":0.00001994812,"domain_scores_codex":[0.9986975,0.00004427959,0.0003120204,0.0003159485,0.0001759472,0.0004543141],"domain_scores_gemma":[0.9992006,0.0001484839,0.00007014357,0.0003878121,0.00006421468,0.00012878],"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.000004499133,0.00002091642,0.0002176422,0.000007220614,0.00002596023,4.948296e-7,0.0002362995,0.7256218,0.00018961,0.0002394921,0.0000664521,0.2733696],"study_design_scores_gemma":[0.0006201129,0.0001481803,0.0003773007,0.0000797341,0.00003541831,0.000007515926,0.0002315664,0.9965013,0.0002178151,0.0001455896,0.001389282,0.000246178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003101211,0.0001138979,0.9941126,0.0002302868,0.00005529507,0.001699423,0.00001451507,0.0005013429,0.0001714919],"genre_scores_gemma":[0.5673158,0.00001182286,0.4312564,0.000360296,0.0004087675,0.0004814431,0.00007564282,0.00008265812,0.000007154552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5642146,"threshold_uncertainty_score":0.6733452,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004200549,0.0001339094,0.0001621408,0.00004323646,0.00007361988,0.00004594747,0.00003721015,0.0001157976,0.000003018215],"category_scores_gemma":[0.000005907091,0.000124383,0.00001230796,0.00009506296,0.0000418133,0.0001413663,0.00002296474,0.000125194,3.661185e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001449382,"about_ca_system_score_gemma":0.00000501518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005689141,"about_ca_topic_score_gemma":0.00001126962,"domain_scores_codex":[0.9993294,0.00001431153,0.0001488838,0.0001797449,0.00006632401,0.0002613632],"domain_scores_gemma":[0.9995797,0.0001678992,0.00002573227,0.00009508422,0.00003733944,0.00009423259],"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.00001771915,0.000003441802,0.0004586689,0.00003696135,0.00002571896,9.607946e-7,0.0001787444,0.9220534,0.00005122831,0.00004854455,0.00009655994,0.07702807],"study_design_scores_gemma":[0.0006792974,0.00005263753,0.0005760846,0.00005076668,0.00002384202,0.00002196384,0.00000919026,0.997842,0.00004786065,0.0002255902,0.0003079682,0.0001627767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05054317,0.001567201,0.9468042,0.00001882629,0.00005270404,0.0003347335,0.000002561524,0.0001634142,0.0005131664],"genre_scores_gemma":[0.6592078,0.000394867,0.3397602,0.00009284737,0.0002406924,0.00002513463,0.00001118296,0.00007446707,0.000192811],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6086646,"threshold_uncertainty_score":0.5072193,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135296,0.0001124105,0.00009838953,0.00003138672,0.0001972439,0.00005955363,0.00009264967,0.00005569113,0.00005262325],"category_scores_gemma":[0.00001082354,0.00008122694,0.00002967772,0.0001968084,0.00007091053,0.00004630407,0.00001694074,0.0002332224,0.000006868233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003452299,"about_ca_system_score_gemma":0.00001798915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007626868,"about_ca_topic_score_gemma":0.00002494307,"domain_scores_codex":[0.9991623,0.00001227869,0.0001685523,0.0001295412,0.0001327369,0.0003945859],"domain_scores_gemma":[0.9992848,0.0004386739,0.00002539776,0.0001171265,0.0000662012,0.00006779328],"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.00001921824,0.000005982758,0.0009309096,0.00001669928,0.00003200517,0.000002886848,0.0001889677,0.9858066,0.00005213347,0.001059102,0.0004707494,0.01141479],"study_design_scores_gemma":[0.0005765005,0.00002660268,0.0003542832,0.00008408965,0.0000151666,0.00001558206,0.00004877845,0.9980828,0.00008885846,0.00003656487,0.0005489868,0.0001218239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031493,0.0002787964,0.9833676,0.00008496494,0.0002602243,0.0005007061,0.000003384642,0.0002496056,0.004939819],"genre_scores_gemma":[0.9890727,0.000006675759,0.01039396,0.0001158303,0.0002309796,0.00001558245,0.00001154253,0.0000376352,0.0001150387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787578,"threshold_uncertainty_score":0.3312338,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003669587,0.0001206321,0.0001194637,0.0001243274,0.0004269865,0.0003167714,0.0001618954,0.00003779107,0.00008559795],"category_scores_gemma":[0.00001129613,0.00008969828,0.00007378306,0.0008612315,0.00005047554,0.0003520371,0.0001389848,0.0001062738,0.00005263691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002559527,"about_ca_system_score_gemma":0.000005409044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790214,"about_ca_topic_score_gemma":0.002072693,"domain_scores_codex":[0.9991138,0.000006762991,0.000206619,0.0002229063,0.0001712104,0.0002787254],"domain_scores_gemma":[0.9996447,0.00001012574,0.00004983148,0.0002280277,0.00005321846,0.00001412911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004217654,0.0001015281,0.02909843,0.00009724662,0.001104123,0.00001048943,0.0001803019,0.4030412,0.000006276813,0.05736188,0.003359504,0.5055969],"study_design_scores_gemma":[0.0006595213,0.00000998134,0.1181981,0.00001996391,0.0005225437,3.99819e-7,0.0003999705,0.8034996,0.000001735572,0.003294871,0.07304343,0.0003499071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2578775,0.002177143,0.6774007,0.01391892,0.00176207,0.001332502,0.000003525344,0.0007070935,0.04482051],"genre_scores_gemma":[0.9966018,0.000139223,0.001257728,0.0008898567,0.0005636236,0.00002277561,0.00002247698,0.00001118938,0.0004913865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7387242,"threshold_uncertainty_score":0.365779,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008273342,0.0001520575,0.0001180332,0.00006669825,0.0003993599,0.0003670022,0.0001897731,0.00004729004,0.0006004461],"category_scores_gemma":[0.00001549119,0.0001007105,0.00002435201,0.000558546,0.00007163944,0.0004554228,0.0001434049,0.0002383785,0.0000855037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001716884,"about_ca_system_score_gemma":0.00001911359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004936567,"about_ca_topic_score_gemma":0.0002817059,"domain_scores_codex":[0.9987747,0.00003291565,0.0001770587,0.0002953452,0.0002817255,0.0004382191],"domain_scores_gemma":[0.9995114,0.00002239473,0.00002212715,0.0002935742,0.0001309103,0.00001961844],"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.00009553591,0.0003092677,0.1068138,0.0004582752,0.0001735162,0.000007921336,0.0003282964,0.2915759,0.00002614494,0.552553,0.0285316,0.01912669],"study_design_scores_gemma":[0.001427695,0.00003379519,0.007771702,0.0001171515,0.00007635583,0.000005335094,0.001057225,0.5931733,0.000007468433,0.001331844,0.3945054,0.0004927398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07175462,0.00125333,0.1904061,0.006803126,0.001022676,0.00256106,0.000002747242,0.0004120452,0.7257843],"genre_scores_gemma":[0.9948125,0.00006676656,0.000551899,0.002416201,0.0003216448,0.00003800797,0.00001553498,0.00002301481,0.001754368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.923058,"threshold_uncertainty_score":0.6574463,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695075,0.00009060854,0.0001194859,0.00002826585,0.0004850014,0.00003774748,0.0001291429,0.0001169425,0.00009479132],"category_scores_gemma":[0.0001107968,0.00009066812,0.00005274866,0.0002293013,0.00010674,0.00007111415,0.000002554035,0.00008532427,0.000004154187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000207615,"about_ca_system_score_gemma":0.0001125644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003832684,"about_ca_topic_score_gemma":0.000043777,"domain_scores_codex":[0.9990758,0.0001085986,0.0001634561,0.0001658246,0.0001453234,0.0003410149],"domain_scores_gemma":[0.999203,0.0003329987,0.0001205742,0.00009341577,0.0001527722,0.00009727151],"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.00007975488,0.00002588375,0.0004140907,0.000003394452,0.00001609613,0.000003118927,0.001882535,0.9834802,6.283925e-8,0.008389538,0.003734578,0.001970743],"study_design_scores_gemma":[0.0006170698,0.0001433754,0.001496529,0.00008142537,0.0001653215,3.762114e-7,0.0003355333,0.9887206,0.000004701467,0.00408266,0.004055074,0.0002973261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001036135,0.0003299263,0.9969143,0.00005624566,0.0005612957,0.0005435348,0.000003241135,0.0001626689,0.001325166],"genre_scores_gemma":[0.7960057,0.000006328581,0.2027046,0.0001796099,0.0006697875,0.0001278836,0.0000501366,0.00001969167,0.0002363108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.795902,"threshold_uncertainty_score":0.3730288,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591745,0.0001377941,0.0001900497,0.0000915767,0.00008226962,0.0001194756,0.0005260108,0.0001123709,0.00002749706],"category_scores_gemma":[0.00004888247,0.0001329329,0.00003629206,0.000715758,0.00004373911,0.0003740758,0.0002443788,0.0002933242,0.00003722774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000043356,"about_ca_system_score_gemma":0.00002976759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006763393,"about_ca_topic_score_gemma":0.0001311606,"domain_scores_codex":[0.9982418,0.0003975539,0.0002612179,0.0002510909,0.0001820287,0.0006663038],"domain_scores_gemma":[0.9988132,0.0004050534,0.00007004106,0.0004261709,0.00008394171,0.0002016311],"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.00001704666,0.0001450907,0.08490147,0.000007029295,0.00001262519,0.00001943117,0.0004646814,0.8651366,0.000001388599,0.004162173,0.005886314,0.03924618],"study_design_scores_gemma":[0.0002553613,0.00003116453,0.1314565,0.00001615664,0.000001129706,0.000009636437,0.000005650948,0.8660055,4.958807e-7,0.00006561015,0.002009282,0.000143508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00292684,0.0009986884,0.9930311,0.00008212479,0.0008963253,0.0002130575,9.012442e-7,0.0001244251,0.001726542],"genre_scores_gemma":[0.9923629,0.0001485346,0.006394476,0.0006691801,0.0001978202,0.0000205942,0.00001658208,0.00001294714,0.0001770115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.989436,"threshold_uncertainty_score":0.5420845,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001923458,0.00006754129,0.0001113869,0.00002409608,0.0001179029,0.00002042826,0.0001806444,0.00004971871,0.0084169],"category_scores_gemma":[0.000002690708,0.00004349158,0.00007232298,0.0005330379,0.00006634241,0.0001258939,0.00001957177,0.0000491256,0.000005186644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001413422,"about_ca_system_score_gemma":0.000003072258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00069252,"about_ca_topic_score_gemma":0.00002670813,"domain_scores_codex":[0.9993815,0.00001523449,0.0001615815,0.0001582843,0.0001220083,0.000161415],"domain_scores_gemma":[0.9996003,0.00005745239,0.00006123702,0.0002099453,0.00001291534,0.00005817518],"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.000001511496,0.00004622849,0.002013886,8.604363e-7,0.00002737809,8.236224e-8,0.00003828203,0.8549547,0.00002048404,0.000004775791,0.0005557846,0.142336],"study_design_scores_gemma":[0.0000859866,0.00003277587,0.02573419,0.000002312487,0.0001640303,1.7832e-7,0.00002568458,0.9730092,0.00001068594,0.00002124273,0.0008549766,0.00005875282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01446118,0.00003639949,0.9813462,0.00009640583,0.00003828135,0.0004485407,0.000005492278,0.00002017949,0.003547356],"genre_scores_gemma":[0.905866,0.00005962593,0.09269649,0.0001208352,0.00006263403,0.00005361706,0.0001160997,0.00001478127,0.001009942],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8914048,"threshold_uncertainty_score":0.9924895,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008992765,0.0001967769,0.0002068181,0.00004332509,0.0002705573,0.0001143892,0.0001762007,0.0001256666,0.00002590879],"category_scores_gemma":[0.00001896417,0.0001476723,0.00005074737,0.0003939937,0.00002547975,0.0001065928,0.00002236218,0.0003422848,0.000004607556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004357969,"about_ca_system_score_gemma":0.00002654095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002313891,"about_ca_topic_score_gemma":0.000001354596,"domain_scores_codex":[0.9987096,0.00007505561,0.0002173784,0.0002370254,0.0001798919,0.0005810531],"domain_scores_gemma":[0.9990655,0.0004586159,0.00004174074,0.0002607633,0.00007929919,0.00009406143],"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.00001300933,0.00001735338,0.0003728821,0.000009414593,0.00002773031,0.000001046,0.0001146653,0.7934887,0.0000573441,0.0001213713,0.0001503763,0.2056261],"study_design_scores_gemma":[0.001303945,0.0001045759,0.001739787,0.00005478935,0.00003237518,0.000005125955,0.00001520027,0.9958588,0.0001256664,0.00004884766,0.0005101016,0.0002007326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001132509,0.0004508696,0.9958138,0.0003339803,0.00005611898,0.0007058597,0.000006989146,0.0004144485,0.001085424],"genre_scores_gemma":[0.7735234,0.00002224665,0.2253575,0.0004375707,0.0003952721,0.0000546305,0.00001720531,0.00007265035,0.0001194976],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7723908,"threshold_uncertainty_score":0.60219,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001069185,0.0001205558,0.0001614481,0.00006258753,0.00002232701,0.00002991931,0.00008211939,0.0001646518,0.00003051024],"category_scores_gemma":[0.000002599663,0.0001349237,0.00004254322,0.00009539707,0.000009611253,0.0000599433,0.00001983599,0.0001384165,0.000001859345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002345114,"about_ca_system_score_gemma":0.000004534088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002405816,"about_ca_topic_score_gemma":0.0001110237,"domain_scores_codex":[0.9993838,0.000003789727,0.0001668191,0.0001484628,0.00002490841,0.0002722376],"domain_scores_gemma":[0.9997246,0.00003676542,0.00001667837,0.0001415846,0.00000634737,0.00007398692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001571692,0.000009635578,0.004434386,0.00001591934,0.0000243981,0.00001192476,0.0001401436,0.0562942,0.000004616892,0.0003854011,0.05352679,0.8851369],"study_design_scores_gemma":[0.000426216,0.00004189191,0.0006417339,0.00002720448,0.000006626743,0.00001451493,0.00001510303,0.9619123,0.00001096521,0.003458932,0.03328235,0.0001622038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1278562,0.001570954,0.8654341,0.00008824219,0.0005754642,0.0004343598,0.00001199134,0.0004817021,0.003547099],"genre_scores_gemma":[0.4295943,0.004843578,0.562503,0.0003278657,0.001235136,0.0001610476,0.00006085465,0.0001709905,0.001103224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9056181,"threshold_uncertainty_score":0.5502028,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001978661,0.0001273782,0.0001295051,0.00004301636,0.00008230274,0.00007047594,0.00004625709,0.0001220696,0.00001154441],"category_scores_gemma":[0.000002421294,0.0001203054,0.00001042961,0.0001148729,0.00002030143,0.0002010221,0.000006182619,0.0002741582,7.581636e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000528903,"about_ca_system_score_gemma":0.000005674477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002892898,"about_ca_topic_score_gemma":0.0001147273,"domain_scores_codex":[0.9994122,0.00001435902,0.0001466957,0.0001667968,0.00007486007,0.0001851256],"domain_scores_gemma":[0.9997367,0.00003374509,0.00002166203,0.00009551839,0.00003977378,0.00007259],"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.00001011638,0.000003455349,0.002525397,0.00005658648,0.00001522348,8.245321e-7,0.0004215878,0.9883713,0.001883215,0.00004651037,7.418473e-7,0.006665011],"study_design_scores_gemma":[0.000398155,0.0000124988,0.001456426,0.00006756106,0.00002272013,0.000005248364,0.00002769524,0.9977143,0.0001025375,0.00003558272,0.000008161482,0.0001491159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.582849,0.0001124074,0.4165016,0.00001278676,0.00003490973,0.0001062738,0.000001076256,0.0002548183,0.0001270554],"genre_scores_gemma":[0.6650079,0.00002457654,0.3348379,0.0000138592,0.00005899737,0.00000774284,0.00001184521,0.00002875195,0.000008455158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08215888,"threshold_uncertainty_score":0.490591,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001130274,0.0001057927,0.0001370615,0.00005481485,0.0001705154,0.00002094359,0.00004966753,0.00008683738,0.00001664849],"category_scores_gemma":[0.000008654463,0.00009837577,0.00003559264,0.0002846926,0.00002254909,0.0001161121,0.00002457879,0.0001775242,0.000005334905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006235819,"about_ca_system_score_gemma":0.000004802799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001214968,"about_ca_topic_score_gemma":0.0000449202,"domain_scores_codex":[0.9993428,0.00000790033,0.0001750634,0.0001465383,0.00008584434,0.0002418688],"domain_scores_gemma":[0.9997203,0.00003502865,0.00001795481,0.0001230298,0.00002733761,0.00007637782],"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.000008024822,0.000001785833,0.0006255954,0.000007081644,0.00001800347,5.465961e-7,0.0002272852,0.9830267,0.0000364113,0.0001048741,0.0003668228,0.01557685],"study_design_scores_gemma":[0.00007852429,0.00002855111,0.008376846,0.00003882704,0.00001770232,0.00001668389,0.00001927244,0.9902992,0.000007404166,0.000651216,0.000339373,0.0001263919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1303036,0.0001610324,0.868702,0.00002039054,0.0001479424,0.0001225278,4.408116e-7,0.0001330055,0.0004091059],"genre_scores_gemma":[0.9908734,0.00003501872,0.008484119,0.0000567349,0.0005015548,0.00001587276,0.000008818404,0.00001419247,0.00001031287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8605698,"threshold_uncertainty_score":0.4011648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005586793,0.00006511807,0.00007946973,0.0000242233,0.0005302889,0.00007559093,0.00009313862,0.0001104343,0.00004050456],"category_scores_gemma":[0.00001254697,0.0000701996,0.00003118129,0.0002121346,0.00003291339,0.0003424009,0.000001633035,0.00007008598,0.000003898533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004271124,"about_ca_system_score_gemma":0.0000391773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007054715,"about_ca_topic_score_gemma":0.0006087623,"domain_scores_codex":[0.9992139,0.00006072809,0.0001575097,0.0001509281,0.0001446759,0.0002722832],"domain_scores_gemma":[0.9995839,0.00008462887,0.00007859165,0.00008332195,0.00008960664,0.00007996707],"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.000004755454,0.00001579961,0.0006423025,0.000001111387,0.000003718482,9.779611e-8,0.00196886,0.7272051,3.570216e-7,0.004567563,0.002197582,0.2633928],"study_design_scores_gemma":[0.0001981945,0.00002439652,0.001156029,0.00001232638,0.00001234844,9.397627e-8,0.0003544132,0.9332024,0.000002306436,0.0002997573,0.06463791,0.00009976031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001572369,0.0001225784,0.9941365,0.0002868441,0.0003100516,0.0002876821,0.000003141051,0.0001825773,0.003098331],"genre_scores_gemma":[0.5610772,0.00009597276,0.432053,0.000479831,0.004973244,0.00005907451,0.0003882313,0.00002239609,0.0008510597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5620834,"threshold_uncertainty_score":0.4078607,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840531,0.0001357364,0.0001131155,0.00002554972,0.0001801974,0.00009906384,0.0001490195,0.00006622713,0.00002220811],"category_scores_gemma":[0.00003290386,0.00009327234,0.00002544854,0.0002547894,0.00007618181,0.00008623182,0.00002219124,0.0002872861,0.000009596825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004704496,"about_ca_system_score_gemma":0.000008662758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001134177,"about_ca_topic_score_gemma":0.00005096384,"domain_scores_codex":[0.9991213,0.00006961032,0.0001972837,0.0001192909,0.000115835,0.000376678],"domain_scores_gemma":[0.9994445,0.0002188825,0.00003506721,0.000195642,0.00005087586,0.00005496746],"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.00001055977,0.000002141966,0.00230196,0.000006839377,0.00002744426,0.000004189709,0.0005571378,0.9732297,0.00001096158,0.0001438853,0.0005394293,0.02316574],"study_design_scores_gemma":[0.0001978813,0.00002152493,0.0007849363,0.00004708273,0.000007330719,0.00001615117,0.0003386865,0.9915153,0.00002784515,0.00007576241,0.00682478,0.0001427481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1014176,0.0003711052,0.8774716,0.0001228698,0.0003788606,0.0002455806,0.000002233922,0.0009640518,0.01902612],"genre_scores_gemma":[0.9842566,0.00020235,0.01405494,0.00004143091,0.0001737611,0.00002961192,0.000006826775,0.00004400046,0.001190472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.882839,"threshold_uncertainty_score":0.3803536,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003159275,0.0001355245,0.0001410955,0.00002532651,0.0001639445,0.00007949559,0.00006946672,0.00008518613,0.000002168882],"category_scores_gemma":[0.000007549956,0.0001027864,0.00002187294,0.0001237785,0.00002815105,0.00008091085,0.0000113056,0.0001839063,3.150585e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001778573,"about_ca_system_score_gemma":0.00000711371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003270714,"about_ca_topic_score_gemma":0.000006997579,"domain_scores_codex":[0.9993536,0.0000229176,0.0001470705,0.0001589231,0.00006843976,0.0002490218],"domain_scores_gemma":[0.9995255,0.0002415733,0.00002898723,0.0001138841,0.00003260714,0.00005744818],"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.000006425662,0.000002447893,0.0001223544,0.00001058397,0.00002141134,6.701829e-7,0.0002007967,0.5603572,0.00002906589,0.00005423289,0.00007423505,0.4391206],"study_design_scores_gemma":[0.0004501436,0.00006244604,0.000962589,0.00007873185,0.00004061684,0.00002171387,0.00003241767,0.9975749,0.00005224801,0.0001077442,0.0004726326,0.0001438396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01040482,0.002013888,0.9866517,0.000120036,0.00007440209,0.0003166494,0.000001507218,0.0001924255,0.0002245671],"genre_scores_gemma":[0.586503,0.0005004982,0.4123533,0.000176166,0.000361361,0.00002195438,0.000004033743,0.00003745404,0.00004225341],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5760982,"threshold_uncertainty_score":0.4191508,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002304239,0.00009854385,0.00007584468,0.00001347853,0.00014061,0.0001208872,0.000129128,0.00005595121,0.00004558341],"category_scores_gemma":[0.00001250738,0.00006419315,0.00001145019,0.0002713269,0.00002079647,0.0001192258,0.00002404996,0.0001890521,0.0000240741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002850853,"about_ca_system_score_gemma":0.000008613941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009042938,"about_ca_topic_score_gemma":0.000002502642,"domain_scores_codex":[0.9993511,0.0000282735,0.000128225,0.0001004107,0.00009528456,0.0002966415],"domain_scores_gemma":[0.9995697,0.00009541769,0.00002185147,0.0002001802,0.00006196879,0.00005085651],"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.000001338342,0.000001989593,0.0007236648,0.000007985388,0.00001594226,2.64363e-7,0.00004084035,0.9841194,0.00003211443,0.001103826,0.00208056,0.01187204],"study_design_scores_gemma":[0.0001161026,0.00001319708,0.0004211449,0.00003003388,0.000005195552,0.000004113604,0.00001734002,0.9895822,0.00005718247,0.0001213932,0.009531799,0.0001002773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004130469,0.0002471938,0.9718151,0.00006769566,0.0002552276,0.0003718586,2.001071e-7,0.000515633,0.02259662],"genre_scores_gemma":[0.4741935,0.00008200714,0.5229263,0.00007554974,0.0003730927,0.0003251679,0.000005031348,0.0001094773,0.001909822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.470063,"threshold_uncertainty_score":0.2617721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007458464,0.0001482955,0.0001761042,0.00005445692,0.0001131479,0.00005033181,0.00006017268,0.0001232839,0.000003652766],"category_scores_gemma":[0.0001096254,0.0001599862,0.00002525428,0.0001565018,0.00003850335,0.00006417789,0.00002969916,0.0001889414,8.815511e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003828571,"about_ca_system_score_gemma":0.000005083383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003323538,"about_ca_topic_score_gemma":0.00001698538,"domain_scores_codex":[0.9990772,0.00002105727,0.0002438829,0.0001966469,0.00007371215,0.0003874723],"domain_scores_gemma":[0.9992256,0.0004764253,0.00004071332,0.0001227679,0.00003368848,0.0001007666],"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.000009095479,0.000004074623,0.0005651165,0.00006171155,0.00001602656,7.716836e-7,0.0002207712,0.9435501,0.0001265628,0.0001759661,0.00002785336,0.05524202],"study_design_scores_gemma":[0.0004753924,0.0000294561,0.003400398,0.00008177896,0.00002360208,0.00001272313,0.00002484127,0.9954137,0.000009577559,0.000298506,0.00005687045,0.0001731673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07699477,0.001072723,0.920918,0.0000248528,0.0002185154,0.000317676,0.000002540019,0.000288917,0.0001619768],"genre_scores_gemma":[0.9657492,0.00002717772,0.03391341,0.00004088976,0.0001353816,0.00001817139,0.000007756953,0.00005762762,0.00005035428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8887545,"threshold_uncertainty_score":0.652405,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476533,0.00009178846,0.0001178298,0.0001052185,0.00006732104,0.00004415947,0.0003039764,0.00007559107,0.000001240416],"category_scores_gemma":[0.00005931776,0.000077708,0.00001308514,0.0003674578,0.0001689569,0.0002992468,0.0002631035,0.0002283181,5.876374e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006716029,"about_ca_system_score_gemma":0.00001109679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004526067,"about_ca_topic_score_gemma":0.00009969396,"domain_scores_codex":[0.9990091,0.0001174399,0.0001366247,0.000359657,0.0001043118,0.0002728857],"domain_scores_gemma":[0.9993749,0.0001323547,0.0000367857,0.0003374481,0.00003307916,0.00008539108],"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.0006653921,0.0001153988,0.02910586,0.00004212705,0.00002635872,0.0002140772,0.005155494,0.0006937995,0.00009313249,0.4755127,0.0004978442,0.4878778],"study_design_scores_gemma":[0.001689535,0.0002310555,0.2123779,0.00007458949,0.000003223303,0.00006748972,0.00004981537,0.1144832,0.0003788852,0.6696896,0.0005929088,0.0003618416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4851582,0.003957849,0.4998972,0.0004405445,0.0003392658,0.0007468903,0.00000278166,0.0002407304,0.009216543],"genre_scores_gemma":[0.9856488,0.0002196299,0.01392498,0.0001400017,0.00001810624,0.000006441812,5.549787e-7,0.000005623594,0.0000358652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5004906,"threshold_uncertainty_score":0.316884,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002818847,0.0001020071,0.0002763302,0.0001078971,0.0001033914,0.00002268639,0.0001133973,0.00006391295,0.00003273491],"category_scores_gemma":[0.00001420213,0.00008203496,0.0001479188,0.001001192,0.00002172799,0.00006417264,0.00001465644,0.00008699585,4.162356e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002772953,"about_ca_system_score_gemma":0.00000712227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001028893,"about_ca_topic_score_gemma":0.0000699388,"domain_scores_codex":[0.9992989,0.00004545132,0.0002749654,0.0001024385,0.00008415726,0.0001940322],"domain_scores_gemma":[0.9991971,0.0004392307,0.00007050927,0.0001798748,0.00008286843,0.00003043801],"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.0000146789,0.000006979042,0.001714489,0.000004034709,0.0006213756,1.248847e-7,0.0006045973,0.9936115,0.00004133042,0.0004209543,0.0006436778,0.002316318],"study_design_scores_gemma":[0.000337079,0.00001142415,0.005938533,0.000007675941,0.0005003231,5.870894e-7,0.00004327123,0.9918122,0.0000263764,0.00006237414,0.001169634,0.00009054278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02734657,0.0002476252,0.9701025,0.00005177044,0.00008391028,0.0002964166,0.000005641423,0.0001017589,0.001763778],"genre_scores_gemma":[0.7947508,0.00003051234,0.2048188,0.00002808499,0.00009388426,0.00005409006,0.00003876562,0.00001336114,0.0001717473],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7674042,"threshold_uncertainty_score":0.3345289,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162295,0.0001110375,0.0001450842,0.0001335477,0.00008019337,0.000197772,0.0005546259,0.0001265669,0.00006960605],"category_scores_gemma":[0.000007429061,0.0001108474,0.00004253846,0.0006935485,0.00005071003,0.0005198563,0.0002404424,0.0004862098,0.00008378975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009145994,"about_ca_system_score_gemma":0.00002230632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004255398,"about_ca_topic_score_gemma":0.0004000237,"domain_scores_codex":[0.9986414,0.0001755359,0.0002548507,0.0003067177,0.0001853745,0.000436094],"domain_scores_gemma":[0.9993265,0.00009214099,0.00003732507,0.0003781293,0.00005452598,0.0001113795],"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.000005158841,0.00004494203,0.001216279,0.00000172894,0.000002931739,0.000002391199,0.0003185055,0.894577,0.000002009536,0.004982798,0.002370837,0.09647543],"study_design_scores_gemma":[0.0003443557,0.00004952967,0.001234119,0.00002802526,7.231311e-7,0.000002157207,0.00002210002,0.9940071,0.00001438296,0.0001489527,0.004027826,0.0001207435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01100349,0.0001676914,0.9801775,0.001865967,0.0002641227,0.0002081239,1.432709e-7,0.0001600772,0.006152937],"genre_scores_gemma":[0.9902894,0.0001843708,0.00764384,0.000986904,0.0003214816,0.00001219044,0.0000069039,0.00001148482,0.0005433991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.979286,"threshold_uncertainty_score":0.4520224,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000423377,0.00007209419,0.0001392724,0.00003694257,0.00003042643,0.00001947136,0.00005813933,0.00006936606,0.000005729735],"category_scores_gemma":[0.00009344509,0.00007003643,0.00002019938,0.00009172564,0.00003284944,0.00009573996,0.00001947768,0.00006302635,7.892072e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001815962,"about_ca_system_score_gemma":0.00001110341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002550745,"about_ca_topic_score_gemma":0.000001031591,"domain_scores_codex":[0.999539,0.00002628708,0.0001429209,0.00008492677,0.00007389356,0.0001330264],"domain_scores_gemma":[0.9993826,0.0003976967,0.00003231957,0.00008610338,0.00004496848,0.00005633849],"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.000002312291,0.000002821419,0.00007939279,0.00001055072,0.000009947929,1.454368e-7,0.0002799333,0.9589606,0.0002301536,0.00002135498,0.0006466542,0.03975615],"study_design_scores_gemma":[0.0001763871,0.00002831869,0.00002439561,0.00005613247,0.00001031278,0.000002997989,0.0000623053,0.9979731,0.0004968798,0.0002881297,0.0008046427,0.00007638238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0226923,0.0009056223,0.9751874,0.00001853372,0.0001539643,0.0001509155,0.000004923695,0.0001297736,0.000756631],"genre_scores_gemma":[0.3686149,0.0001103419,0.6308483,0.00001402902,0.0001629649,0.000031493,0.000008750154,0.00003497905,0.0001742776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3459226,"threshold_uncertainty_score":0.2856003,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223682,0.0001642818,0.000130112,0.00002642055,0.0002579918,0.0001384218,0.0001559184,0.0001052362,0.00001933188],"category_scores_gemma":[0.00008098353,0.0001185388,0.00003070605,0.0006099806,0.00004317854,0.0000886136,0.00001656003,0.0003133264,0.000009336502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007427236,"about_ca_system_score_gemma":0.00001770054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002786422,"about_ca_topic_score_gemma":0.00001422007,"domain_scores_codex":[0.9988095,0.0001622657,0.0002412597,0.0001667347,0.0001614878,0.0004587511],"domain_scores_gemma":[0.9991625,0.0003491631,0.0000547191,0.0002880204,0.00006596966,0.000079627],"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.000004468487,0.000008515449,0.001892322,0.000004462358,0.00002449143,0.000002675135,0.00005078105,0.9796829,0.0001317307,0.001078964,0.0006518476,0.01646688],"study_design_scores_gemma":[0.000387126,0.00004131094,0.0009812639,0.00004582665,0.00001831986,0.0000147855,0.00005073899,0.984314,0.0006045274,0.000104044,0.01320181,0.0002361893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02237178,0.0009008078,0.9314812,0.0000889041,0.0003730663,0.0003522106,7.218104e-7,0.0009610309,0.0434703],"genre_scores_gemma":[0.9220952,0.00005873578,0.07723858,0.0000511171,0.0001220617,0.00002057929,0.000003223624,0.00007451958,0.0003359394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8997235,"threshold_uncertainty_score":0.483387,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000570017,0.0004948095,0.0005371842,0.0001853334,0.0004628929,0.0003038789,0.001020195,0.0004321714,0.00007055434],"category_scores_gemma":[0.000009362077,0.000456448,0.0002164577,0.001092512,0.0003114747,0.0005111446,0.0004611136,0.0007266313,0.00005981159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002348189,"about_ca_system_score_gemma":0.00008920419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003746389,"about_ca_topic_score_gemma":0.00001943838,"domain_scores_codex":[0.99664,0.0001331448,0.0006355752,0.0009940236,0.0004929566,0.001104305],"domain_scores_gemma":[0.9977245,0.0002644581,0.0002239933,0.00103701,0.0001428756,0.0006071534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003465671,0.0005351576,0.02406118,0.00005627138,0.0002385001,0.002079706,0.0008221618,0.005982977,0.00004939103,0.06059063,0.0747964,0.8304411],"study_design_scores_gemma":[0.0009452986,0.0002224062,0.001386863,0.00006899839,0.00003841683,0.0003148141,0.00002496682,0.9546109,0.000006365215,0.00975587,0.03202671,0.0005983773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04030539,0.003420045,0.9352983,0.0008565271,0.00207198,0.000396662,0.000007416961,0.000677031,0.01696663],"genre_scores_gemma":[0.9722959,0.001964378,0.02050618,0.002568457,0.0009019347,0.0000289058,0.00003285309,0.00005600092,0.001645436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486279,"threshold_uncertainty_score":0.9997887,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006215477,0.0001603693,0.0001190075,0.00006845911,0.0002825737,0.0001724755,0.0002749437,0.00006955156,0.0002621912],"category_scores_gemma":[0.00004161864,0.0001137496,0.00007957686,0.0002946092,0.0000349521,0.0002983637,0.00002585633,0.0001141907,0.00007068933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002138807,"about_ca_system_score_gemma":0.00001002345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002579614,"about_ca_topic_score_gemma":0.001259738,"domain_scores_codex":[0.9989976,0.00001466087,0.0002206446,0.0002881047,0.0001537606,0.0003251746],"domain_scores_gemma":[0.9993726,0.0000373021,0.00006083142,0.0004137539,0.00009734237,0.00001819784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003164591,0.0001584682,0.0001558801,0.00004738367,0.00005190085,8.257062e-7,0.00005887133,0.01284412,0.000006001111,0.02656621,0.07050837,0.8895703],"study_design_scores_gemma":[0.0003455709,0.00002416205,0.00027924,0.00000797445,0.00003117694,9.900384e-8,0.0001431907,0.6400069,0.000002664187,0.0009526639,0.3580868,0.0001195139],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00238711,0.0004996809,0.8811578,0.01202408,0.005545205,0.004968132,0.00001021004,0.0005875255,0.09282024],"genre_scores_gemma":[0.9531609,0.0001204836,0.01202737,0.01992789,0.005292874,0.00130533,0.0002921655,0.0001115595,0.007761423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9507738,"threshold_uncertainty_score":0.4638574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002503724,0.00009287934,0.0001089973,0.00002773811,0.00006019205,0.00001795972,0.00007000213,0.0000919943,0.00002689417],"category_scores_gemma":[0.00002961281,0.00009778143,0.00002375479,0.00008910058,0.00001363108,0.00006130044,0.00001667095,0.0001036622,0.000002697431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001030947,"about_ca_system_score_gemma":0.000002652645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000437245,"about_ca_topic_score_gemma":8.424537e-7,"domain_scores_codex":[0.9994718,0.00001771488,0.0001349733,0.0001142316,0.0000421061,0.0002191877],"domain_scores_gemma":[0.9996611,0.0001376972,0.00002274174,0.0001037268,0.00002248811,0.00005218212],"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.000009695559,0.000008279873,0.003209676,0.00005987406,0.00004144032,0.000001613567,0.0007561964,0.7653989,0.00004859363,0.0005500403,0.001065482,0.2288502],"study_design_scores_gemma":[0.0001956127,0.00001278369,0.001582162,0.00001791753,0.00001052012,0.00000656966,0.00001433517,0.9955596,0.0001931171,0.00017188,0.002114316,0.0001212118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005077,0.0005308903,0.988203,0.000007745218,0.0004331924,0.0001270112,0.000001953772,0.00037208,0.005247101],"genre_scores_gemma":[0.4741734,0.00009919937,0.5249508,0.00007739018,0.0004824766,0.00003040958,0.000009097786,0.00005734147,0.000119839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4690964,"threshold_uncertainty_score":0.3987411,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001432793,0.00008956087,0.0001404465,0.00002110093,0.00002074406,0.0000137749,0.0001079775,0.00009792724,0.0000457376],"category_scores_gemma":[0.00003593383,0.00008265305,0.00007366036,0.00008357233,0.00006050451,0.0001248245,0.00001386618,0.00008909134,0.00000451198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002144178,"about_ca_system_score_gemma":0.000005304083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001933425,"about_ca_topic_score_gemma":0.00000241307,"domain_scores_codex":[0.9993753,0.000009487645,0.0002167872,0.0001294471,0.00006102811,0.0002079461],"domain_scores_gemma":[0.9995371,0.00007244678,0.00003144393,0.0002193357,0.00009405476,0.00004566213],"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.00001027278,0.00001669197,0.0002648064,0.00007002668,0.00000820681,1.455426e-7,0.00005814003,0.9911445,0.0001239871,0.0006005821,0.003178384,0.004524266],"study_design_scores_gemma":[0.0001648855,0.00005714377,0.001434927,0.00002451788,0.00001061241,0.000001497836,0.00001993292,0.9955667,0.000176109,0.001292646,0.001154962,0.00009609581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2704726,0.0001732045,0.7246509,0.00008986102,0.0005213351,0.0008387385,0.000006405442,0.0001795342,0.003067443],"genre_scores_gemma":[0.9639422,0.00009802569,0.03567307,0.00003200211,0.00005162867,0.0001161365,0.00001449894,0.00001497668,0.00005746785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6934696,"threshold_uncertainty_score":0.3370494,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587265,0.0001516002,0.0001658075,0.00001948104,0.0003305811,0.0001563375,0.001532739,0.00007580815,0.00003697211],"category_scores_gemma":[0.000209993,0.0001023411,0.00008229099,0.0007402795,0.0001110144,0.0001942947,0.0004848079,0.00066978,0.0002202991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003548092,"about_ca_system_score_gemma":0.00002639336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001227378,"about_ca_topic_score_gemma":0.000001910698,"domain_scores_codex":[0.9980366,0.0003157817,0.0001914941,0.0005070897,0.0003544822,0.0005945085],"domain_scores_gemma":[0.9977087,0.001097868,0.00005699258,0.0008914799,0.00005499983,0.0001899459],"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.00004871841,0.00001917029,0.0005990129,0.000004837018,0.0000131816,0.00001785955,0.0004756177,0.3150227,0.00001823772,0.5996983,0.06178442,0.02229794],"study_design_scores_gemma":[0.0001825163,0.0001939657,0.0002831504,0.0000357112,0.000002955557,0.000001841808,0.00001818908,0.8260808,0.0000740844,0.1049172,0.06798605,0.0002235431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001543319,0.0002737939,0.9516501,0.03657912,0.000658873,0.000330376,5.337482e-7,0.0003924985,0.008571384],"genre_scores_gemma":[0.9791683,0.00002545923,0.00527336,0.01406449,0.001159291,0.0000340355,0.00000114577,0.00002044343,0.0002534619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.977625,"threshold_uncertainty_score":0.4173349,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005474329,0.00009696354,0.000114867,0.00009669668,0.000070377,0.00003523764,0.0007775383,0.00004087262,0.0000669377],"category_scores_gemma":[0.0001915337,0.00006253103,0.00007231245,0.0007830695,0.00007197983,0.00008550735,0.0001247452,0.0001876475,0.00002919634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001058882,"about_ca_system_score_gemma":0.00001293659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001129479,"about_ca_topic_score_gemma":0.000003083429,"domain_scores_codex":[0.9988672,0.0001871511,0.000134877,0.0002441785,0.0002462261,0.0003204402],"domain_scores_gemma":[0.9982646,0.0007017748,0.00003958109,0.000846567,0.00005870366,0.00008884704],"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.00002978109,0.00006923622,0.0003647476,0.000002268303,0.0000226259,0.00001307027,0.0003614773,0.01018041,0.0002635464,0.9632272,0.004087073,0.02137856],"study_design_scores_gemma":[0.001009651,0.001993423,0.003723986,0.0001606358,0.00001234481,0.00003555678,0.00007225633,0.04633906,0.01149588,0.910816,0.02351415,0.0008270672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05150348,0.0001192568,0.9392393,0.0003887758,0.0002487946,0.0002524213,5.965861e-7,0.00003899047,0.008208379],"genre_scores_gemma":[0.9891912,0.000005307319,0.009349721,0.001191005,0.00001594573,0.0000263777,1.207021e-7,0.00000932459,0.0002109627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9376878,"threshold_uncertainty_score":0.2549942,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009745915,0.00004372948,0.00006786747,0.00002988157,0.00006126433,0.00001425019,0.0002521003,0.0000394397,0.00004733482],"category_scores_gemma":[0.000006642639,0.00004143056,0.00002231439,0.0001822994,0.00002749346,0.0001987535,0.00005483556,0.00005352175,0.00001152558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001121847,"about_ca_system_score_gemma":0.00001478401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008463949,"about_ca_topic_score_gemma":0.000001397772,"domain_scores_codex":[0.9994859,0.00003404277,0.0001161805,0.000116615,0.0001308703,0.0001164371],"domain_scores_gemma":[0.9996618,0.00003148633,0.00003703884,0.0001647974,0.00006244253,0.00004242994],"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.000007431161,0.0003832804,0.01149474,0.00001743265,0.00003235805,0.00001712458,0.002378427,0.4792236,0.00042165,0.006122257,0.1949779,0.3049238],"study_design_scores_gemma":[0.0001804298,0.00006111604,0.001776696,0.000005656746,7.747649e-7,0.00000612686,0.000006577761,0.9908055,0.0003501766,0.00005011781,0.006698632,0.00005821542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03241016,0.000260956,0.96296,0.00005759358,0.0001408803,0.0001278429,6.844365e-7,0.00005378936,0.003988106],"genre_scores_gemma":[0.9908817,0.0003409254,0.007693144,0.0001684269,0.00002143754,0.0000137364,0.000007681905,0.000003670277,0.0008692998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9584715,"threshold_uncertainty_score":0.1689489,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464343,0.0001400779,0.0001420043,0.00002764947,0.0001688468,0.00005949319,0.0001477689,0.00009175116,0.00002067487],"category_scores_gemma":[0.00003545981,0.00009918712,0.00003972361,0.0002326548,0.00003220301,0.00008250477,0.00002233783,0.0002010361,0.000005829574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004364214,"about_ca_system_score_gemma":0.00001087578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000671627,"about_ca_topic_score_gemma":0.000008664168,"domain_scores_codex":[0.9990476,0.00003569844,0.0002432423,0.0001333097,0.0001253586,0.0004147448],"domain_scores_gemma":[0.9988293,0.0007980864,0.0000510848,0.0002091379,0.00006164307,0.00005072776],"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.00002061702,0.000004644457,0.0009512951,0.0000198524,0.0000327501,0.000001018293,0.0003846597,0.9764391,0.00006432827,0.0005603373,0.0006383513,0.0208831],"study_design_scores_gemma":[0.0003688293,0.00003625278,0.0007810053,0.00004890688,0.00002180089,0.000003831012,0.0001297569,0.9960519,0.0001862417,0.00005633071,0.002159784,0.0001553238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00809129,0.0002803571,0.9871503,0.00006670962,0.0001333985,0.0004323476,0.000002452995,0.0004503221,0.003392787],"genre_scores_gemma":[0.8652211,0.00001432997,0.1333654,0.0001533693,0.0006008209,0.00004691535,0.0000110345,0.00008351586,0.0005035159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8571298,"threshold_uncertainty_score":0.4044733,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487844,0.000145693,0.0001314067,0.00002488263,0.0001825929,0.0001486569,0.0002343278,0.0001087656,0.0001751158],"category_scores_gemma":[0.00004635655,0.000113356,0.00005001235,0.0002604913,0.000028615,0.0001557517,0.00006202453,0.0003887114,0.0000824768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004439502,"about_ca_system_score_gemma":0.000007629469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003332298,"about_ca_topic_score_gemma":0.00000481291,"domain_scores_codex":[0.9989659,0.00008463229,0.0002508773,0.0001525626,0.0001256358,0.0004204547],"domain_scores_gemma":[0.999321,0.0002263251,0.00004450372,0.0002980527,0.00005139001,0.00005867891],"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":[3.769687e-7,0.00000328419,0.0006598133,0.000008184337,0.00001631346,5.054964e-7,0.0002793224,0.9410161,0.00009425016,0.0007388555,0.003945814,0.05323718],"study_design_scores_gemma":[0.00009917023,0.000005855019,0.001261731,0.00003652665,0.000008718599,0.000004873366,0.00005766189,0.995132,0.00006456494,0.0003745863,0.002809799,0.0001444772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02260398,0.0006174801,0.9312925,0.0005671347,0.0006979672,0.0005430978,5.211692e-7,0.001129548,0.04254781],"genre_scores_gemma":[0.9007443,0.00005046402,0.09804305,0.0001898331,0.0005572788,0.00005381378,0.000003539721,0.0000616625,0.0002960564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8781403,"threshold_uncertainty_score":0.4622525,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524062,0.0001162765,0.0001019796,0.00001667253,0.0001272438,0.00005300264,0.00004560814,0.00007257239,0.00000646599],"category_scores_gemma":[0.000002745695,0.00008166702,0.00001746577,0.00006877643,0.00003284804,0.000109772,0.00001379647,0.0001331644,9.114106e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009568793,"about_ca_system_score_gemma":0.000004377212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009905557,"about_ca_topic_score_gemma":0.00005111948,"domain_scores_codex":[0.9994696,0.00001008784,0.0001066691,0.00009528684,0.0000549569,0.000263407],"domain_scores_gemma":[0.9996274,0.0001633427,0.0000208753,0.00009210443,0.00002497861,0.000071292],"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.00001382237,0.00001153555,0.007621985,0.00005732895,0.0000775513,2.568064e-7,0.001220793,0.7233991,0.00000970682,0.0001046059,0.0006722231,0.2668111],"study_design_scores_gemma":[0.0005849453,0.00002623317,0.001527898,0.00004601428,0.00003163192,0.000009899257,0.00005226224,0.9897737,0.00001931021,0.00001620957,0.007776457,0.0001354603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008639148,0.004132618,0.986077,0.00003900324,0.0001938593,0.0004246899,0.000006354075,0.0001423931,0.0003449249],"genre_scores_gemma":[0.9612876,0.0007616492,0.03734316,0.00009211872,0.0003051438,0.00005974834,0.00001456899,0.00004138806,0.00009465381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9526484,"threshold_uncertainty_score":0.3330284,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002811185,0.0001233542,0.0000978355,0.00002426229,0.0001676689,0.0001260699,0.0001691857,0.00008733561,0.00005873447],"category_scores_gemma":[0.00002723935,0.00009697633,0.00003542706,0.0002493503,0.00003348911,0.0001318767,0.00003378329,0.0002612482,0.00008009373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005686497,"about_ca_system_score_gemma":0.000006091879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002436484,"about_ca_topic_score_gemma":0.000005468794,"domain_scores_codex":[0.9991633,0.0000486376,0.0002097101,0.0001192012,0.0001056766,0.0003534394],"domain_scores_gemma":[0.9994271,0.0001648518,0.00002747848,0.0002348052,0.00007605836,0.00006967076],"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.000001000514,0.000002555719,0.0004067712,0.000006498534,0.00001960196,3.680266e-7,0.00009935925,0.9555528,0.0001197669,0.0002479652,0.009038494,0.03450478],"study_design_scores_gemma":[0.0001015861,0.000007280686,0.0007612919,0.00002087849,0.000005635731,0.000003090239,0.00005165072,0.9891948,0.00007851701,0.0001213889,0.009532026,0.0001218158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1389006,0.001379594,0.8206382,0.0001470975,0.00143006,0.0007371715,0.000001356425,0.001705933,0.03505993],"genre_scores_gemma":[0.9245048,0.0002317775,0.073979,0.00006689265,0.000293876,0.0001020984,0.000006731248,0.00007308194,0.0007417026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7856042,"threshold_uncertainty_score":0.395458,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008771574,0.0001033283,0.0001291399,0.00006947615,0.00007095701,0.00001950583,0.0001472907,0.0001166473,0.00004014106],"category_scores_gemma":[0.00003555612,0.0001093627,0.00002710201,0.0009219258,0.00001681973,0.00008634363,0.000006792538,0.0003011254,0.000004599799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006926566,"about_ca_system_score_gemma":0.0000126196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002712011,"about_ca_topic_score_gemma":0.001772349,"domain_scores_codex":[0.9990491,0.00004643117,0.0003646638,0.0001115503,0.00007555743,0.0003527573],"domain_scores_gemma":[0.9993279,0.0003057018,0.00003942132,0.0002447352,0.00002687859,0.00005537947],"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.000009828001,0.00001034611,0.00556482,0.000008911509,0.00000566069,0.000003624814,0.0003228769,0.9560125,0.0000119156,0.0001628103,0.0001093953,0.03777725],"study_design_scores_gemma":[0.0002399384,0.000008686559,0.02814585,0.00005036037,0.000006439872,0.000002202414,0.0000729133,0.9706702,0.00001900299,0.00007168547,0.0005852696,0.0001274027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04758864,0.0003951215,0.9483387,0.00003086102,0.0001616482,0.0001638204,6.400791e-7,0.0003668974,0.002953663],"genre_scores_gemma":[0.7923464,0.00006573301,0.2072828,0.00006380229,0.0001470483,0.00001636283,0.00001969322,0.0000326927,0.00002550662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7447577,"threshold_uncertainty_score":0.4459683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007336334,0.00008402659,0.00006820977,0.00004025738,0.00006303392,0.00005425731,0.00005884213,0.00009375912,0.0001813325],"category_scores_gemma":[0.000002029192,0.00009076899,0.00001730749,0.0001552069,0.00001175579,0.0001409653,0.000007693076,0.0001454155,0.00001789815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695552,"about_ca_system_score_gemma":0.000003935464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005526635,"about_ca_topic_score_gemma":0.00003629484,"domain_scores_codex":[0.9995204,0.00001752851,0.0001073451,0.0001004042,0.0000687922,0.0001854844],"domain_scores_gemma":[0.999764,0.00001189254,0.00001247597,0.0001371174,0.00001395555,0.00006056644],"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.00000396038,0.00000394735,0.0005427778,0.000003032459,0.000007082687,0.000002032798,0.00005459126,0.9786822,0.00001598767,0.0003480138,0.0009446866,0.01939172],"study_design_scores_gemma":[0.000161085,0.00001284484,0.001342578,0.00001470209,0.00000585373,0.00002243229,0.00002089704,0.993605,0.00001788648,0.0005476114,0.004131095,0.0001180473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03801974,0.000269508,0.9436379,0.00009924691,0.001180899,0.00009184948,8.263498e-7,0.0008212961,0.01587871],"genre_scores_gemma":[0.9783296,0.0002926261,0.02028476,0.0001224951,0.000629327,0.000005193364,0.00004320628,0.0000416937,0.0002510832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9403099,"threshold_uncertainty_score":0.3701452,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003816205,0.0001573924,0.0002203279,0.00008323912,0.0002148684,0.0001328886,0.00009784612,0.0001115742,0.000005832197],"category_scores_gemma":[0.00001613313,0.0001287291,0.00006378049,0.0005893055,0.00006018737,0.00007621438,0.00004358081,0.0001975293,9.791976e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325426,"about_ca_system_score_gemma":0.000008415862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003259247,"about_ca_topic_score_gemma":0.00006260906,"domain_scores_codex":[0.9990746,0.00006508667,0.0002342908,0.000193054,0.0001105773,0.000322348],"domain_scores_gemma":[0.99954,0.0001041719,0.00004267708,0.0001946638,0.00002621631,0.00009226634],"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.000003507027,0.000002482661,0.001722667,0.000004442463,0.0001924672,0.000001773022,0.000220211,0.8721574,0.00004830695,0.0001012039,0.00004730618,0.1254983],"study_design_scores_gemma":[0.0005666647,0.00001209014,0.0057291,0.00001385537,0.0001796178,0.000007537718,0.0000229908,0.9927196,0.00009075899,0.0002292696,0.0002668152,0.0001617325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05134978,0.002307554,0.9450269,0.0002079398,0.0001514938,0.0001238404,0.000001491025,0.0002317071,0.0005992386],"genre_scores_gemma":[0.6561824,0.0006537415,0.3425233,0.00008959277,0.0003077041,0.00001978549,0.00001043349,0.00004644696,0.0001666011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6048326,"threshold_uncertainty_score":0.5249419,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458486,0.0001464497,0.000167927,0.00003269434,0.000274199,0.00008498696,0.0001105563,0.0001202031,0.000005873153],"category_scores_gemma":[0.0000530198,0.0001254367,0.00004822619,0.0003688485,0.00001839918,0.00005349328,0.00001159162,0.0002397437,6.864885e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004120714,"about_ca_system_score_gemma":0.00001266879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002875383,"about_ca_topic_score_gemma":0.0000067468,"domain_scores_codex":[0.9991422,0.00004818741,0.0002316835,0.0001693053,0.00008377757,0.0003247889],"domain_scores_gemma":[0.9991829,0.0005269102,0.00004317818,0.0001427351,0.00005111392,0.00005319597],"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.000002945481,0.00000379474,0.00002879362,0.000007253493,0.00002258225,2.970138e-7,0.0001912984,0.5919774,0.00007009343,0.00005109935,0.0002765394,0.4073679],"study_design_scores_gemma":[0.00042888,0.00002771685,0.0007538752,0.0000470939,0.00003295986,0.000009615672,0.00002084241,0.9970306,0.0001297732,0.0002642766,0.00110262,0.0001517745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001440793,0.000904537,0.9951079,0.0001500093,0.0002428746,0.0005283031,0.000001821163,0.0005368604,0.001086878],"genre_scores_gemma":[0.3416457,0.0002286204,0.6568667,0.000200757,0.0006353867,0.00006179798,0.000009994282,0.0000657964,0.0002852826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4072162,"threshold_uncertainty_score":0.5115158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002397443,0.00006330568,0.0001032879,0.00001196603,0.0003651184,0.0000267857,0.0001331236,0.00005263006,0.00001205958],"category_scores_gemma":[0.00001012902,0.00004240908,0.00002045845,0.0005716016,0.00004783581,0.00006610798,0.000003343963,0.0001143495,2.932841e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001487722,"about_ca_system_score_gemma":0.00005382973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004288966,"about_ca_topic_score_gemma":0.003430595,"domain_scores_codex":[0.9991788,0.0001258799,0.0001540411,0.0001135539,0.0002276286,0.0002001307],"domain_scores_gemma":[0.9996048,0.00005961604,0.0001226757,0.000106426,0.00007031069,0.00003620364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00004220117,0.000084509,0.1570017,9.976362e-7,0.00001152338,0.00000122398,0.01315772,0.8255485,8.302731e-7,0.002261846,0.0004223492,0.001466547],"study_design_scores_gemma":[0.001224204,0.0005802631,0.9689381,0.0001612385,0.00008445607,8.281821e-7,0.007470043,0.01986541,0.000002659543,0.0004342953,0.001030992,0.0002074938],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.97718,0.00009517773,0.01049141,0.0006097978,0.0001857937,0.0007675714,6.08362e-7,0.0001192503,0.01055041],"genre_scores_gemma":[0.9985972,0.000006817,0.0008280046,0.0001521726,0.0001787724,0.000004847427,0.000003552495,0.000004735337,0.0002239051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8119364,"threshold_uncertainty_score":0.2808232,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590876,0.0001124611,0.00009474437,0.00001914123,0.0001595553,0.0000546927,0.00007090186,0.00007580817,0.00001920908],"category_scores_gemma":[0.000002994846,0.00007802997,0.00002207838,0.0001011984,0.00002056876,0.0001154996,0.00001881357,0.0001812022,0.000002640102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001439497,"about_ca_system_score_gemma":0.000007290995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004738752,"about_ca_topic_score_gemma":0.00004388416,"domain_scores_codex":[0.999308,0.00001526305,0.0001084183,0.000094877,0.00007892417,0.0003944486],"domain_scores_gemma":[0.9995618,0.0001838506,0.0000153499,0.0001232883,0.00003695404,0.00007879168],"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.00002054259,0.0000177866,0.03918775,0.00005261856,0.00005410043,2.120729e-7,0.001343339,0.9512854,0.000009979227,0.0008193396,0.0006715589,0.006537429],"study_design_scores_gemma":[0.000691598,0.00003021621,0.002771108,0.00003724306,0.00002381696,0.000003847524,0.000179404,0.9890074,0.00003679503,0.000009904175,0.007073642,0.0001349875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01842105,0.002898898,0.9760957,0.00005938453,0.0002168137,0.0005721453,0.00001116437,0.0001872197,0.001537565],"genre_scores_gemma":[0.9947367,0.0003336261,0.004370584,0.00007774628,0.0002856326,0.00004534694,0.00002335165,0.0000432766,0.00008376279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9763156,"threshold_uncertainty_score":0.318197,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001754771,0.0000669471,0.00007256751,0.0001531919,0.00006643061,0.00008056044,0.0002538073,0.0000483667,0.0001531019],"category_scores_gemma":[0.000007074916,0.00005423251,0.00007301579,0.0008391016,0.00002377811,0.001132343,0.00001630811,0.00008975801,0.00003589037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001302924,"about_ca_system_score_gemma":0.00002405095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001624236,"about_ca_topic_score_gemma":0.000001303611,"domain_scores_codex":[0.9993313,0.00004358967,0.0001875598,0.00009202863,0.0001923019,0.0001532106],"domain_scores_gemma":[0.9995434,0.00002693945,0.00005785405,0.0002460407,0.00007330083,0.00005247805],"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.000008133295,0.00003685107,0.0003317968,0.000001585258,0.000004106817,1.401078e-7,0.0002990592,0.8630961,0.00000163642,0.005501406,0.0007981766,0.1299211],"study_design_scores_gemma":[0.0002294347,0.0003421425,0.005171743,0.00001383155,0.000001013527,7.556181e-7,0.000004168693,0.9926738,0.000009965866,0.0009961664,0.0004854059,0.00007157239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02588224,0.00002594144,0.9608403,0.0001140414,0.0000876151,0.0001686206,7.389932e-7,0.00009326809,0.01278717],"genre_scores_gemma":[0.9975169,0.0001933808,0.00206458,0.0001257903,0.00002257442,0.000008453488,0.00001318348,0.000002416904,0.0000526675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9716347,"threshold_uncertainty_score":0.2211538,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684999,0.0001205432,0.0001197315,0.00004188717,0.0003328621,0.0002858905,0.0005060719,0.00006675746,0.00004036902],"category_scores_gemma":[0.00002772252,0.0001117679,0.00003718732,0.0003627681,0.00004704927,0.000329833,0.0006974339,0.0002277237,0.000007623331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002316567,"about_ca_system_score_gemma":0.00001775607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003310278,"about_ca_topic_score_gemma":0.00002355208,"domain_scores_codex":[0.9991191,0.00006305234,0.0001680137,0.0002685098,0.00008422016,0.000297116],"domain_scores_gemma":[0.9991216,0.0001184233,0.00005405483,0.0005369085,0.00007233773,0.00009665941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009331713,0.00003076263,0.002833134,0.000001788794,0.00001295914,0.000007183608,0.0002734536,0.0004943299,0.0001547433,0.01779786,0.002352283,0.9760322],"study_design_scores_gemma":[0.0002570931,0.00004761769,0.002091453,0.00002790398,0.000002883389,0.00002995432,0.000008290016,0.9418921,0.000009258606,0.0003245335,0.05514552,0.0001633191],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01653571,0.002995912,0.9647681,0.001231022,0.0005343204,0.0001350551,1.253466e-7,0.0002111485,0.0135886],"genre_scores_gemma":[0.9865625,0.001877849,0.009187267,0.001152485,0.0002404689,0.00001278099,0.00000169523,0.00001019269,0.0009547523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9758689,"threshold_uncertainty_score":0.4557764,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036733,0.00007032348,0.0000974689,0.00004916914,0.0001798682,0.00002773456,0.0008943595,0.00004907676,0.000002768441],"category_scores_gemma":[0.0001254821,0.0000493869,0.00006440363,0.0004817628,0.0001230575,0.000117465,0.0002059117,0.0002479911,0.00000529887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002930912,"about_ca_system_score_gemma":0.00002667839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003922818,"about_ca_topic_score_gemma":0.00004762266,"domain_scores_codex":[0.9989263,0.00006981651,0.0001570778,0.0002051426,0.0002828039,0.0003588613],"domain_scores_gemma":[0.998331,0.0008413401,0.00006270268,0.0004994964,0.0001887842,0.00007665961],"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.00003680879,0.00002787553,0.0005622922,0.00000104297,0.00001231251,0.00001197313,0.0003111908,0.001148759,0.00005404112,0.9378015,0.002962108,0.0570701],"study_design_scores_gemma":[0.001217056,0.0008172033,0.05161391,0.00005672226,0.00001566409,0.00008133336,0.001271881,0.2376691,0.002618251,0.5243909,0.1794233,0.0008246561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001531263,0.003015156,0.986481,0.0008524045,0.0004511081,0.00008899558,1.481727e-7,0.00005798614,0.007521919],"genre_scores_gemma":[0.9939995,0.000110011,0.004377724,0.00006152614,0.0002026565,0.000003712306,1.411416e-7,0.00000745754,0.001237207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9924683,"threshold_uncertainty_score":0.2013939,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284907,0.0001470896,0.00012827,0.00002913075,0.0001293833,0.0001288551,0.0003036384,0.00006690939,0.00001665512],"category_scores_gemma":[0.00002718372,0.00008713879,0.0000256649,0.0003805209,0.00003644974,0.0001474747,0.00004429199,0.0005232775,0.00001393445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009807164,"about_ca_system_score_gemma":0.00002072583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005258194,"about_ca_topic_score_gemma":0.00005502896,"domain_scores_codex":[0.9987488,0.0002756688,0.000233072,0.0001514665,0.0002335116,0.0003574705],"domain_scores_gemma":[0.9993314,0.0002244502,0.0000471038,0.0003213726,0.0000286096,0.0000471015],"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.00001293233,0.00001170204,0.004233862,0.000003137552,0.00001658618,0.000007035925,0.001560742,0.9861912,0.00001937266,0.00007480071,0.00197118,0.005897464],"study_design_scores_gemma":[0.0004423623,0.00003866428,0.001091444,0.00004928732,0.00001575539,0.00001363989,0.0003543581,0.9953823,0.00001220844,0.00008979673,0.002372382,0.0001378011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5821046,0.0009400838,0.3641913,0.001781865,0.0005840217,0.001636715,0.000002902746,0.0008173566,0.04794119],"genre_scores_gemma":[0.9802124,0.000006437127,0.01879266,0.0004771494,0.0003321245,0.00003376023,0.000009710856,0.00004937919,0.00008635569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3981079,"threshold_uncertainty_score":0.3553417,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899001,0.00008395412,0.0001245863,0.00009043839,0.0000755812,0.00003252413,0.0007834257,0.00005159083,0.00001036604],"category_scores_gemma":[0.00001906355,0.00007115846,0.00005457827,0.0007809225,0.00006718448,0.0002679536,0.0001347184,0.0002107173,0.000006844862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009364385,"about_ca_system_score_gemma":0.00001699853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003277321,"about_ca_topic_score_gemma":0.000002091337,"domain_scores_codex":[0.999056,0.00006076845,0.0001467665,0.0002170435,0.000200421,0.000319],"domain_scores_gemma":[0.999207,0.00008061402,0.00004917803,0.0005016451,0.00007985834,0.00008165839],"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.00003381275,0.0000682231,0.002600652,0.000004846829,0.00001368097,0.00001520898,0.0001537068,0.01855152,0.001316013,0.6932797,0.0002731819,0.2836895],"study_design_scores_gemma":[0.001071123,0.00104534,0.05185123,0.0001011232,0.00001047357,0.00001982728,0.00004413564,0.4627949,0.004612857,0.4727983,0.005072464,0.0005783052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09576763,0.0006222222,0.8941368,0.0002413176,0.0002486731,0.0001977425,5.759873e-7,0.0001528372,0.008632224],"genre_scores_gemma":[0.9919477,0.00005941871,0.007617943,0.0001181247,0.00004364354,0.000004314254,6.568573e-7,0.000005166157,0.0002030511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.89618,"threshold_uncertainty_score":0.2901758,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002444201,0.0001079554,0.0001184043,0.0001503857,0.00007882824,0.00008556134,0.00007768272,0.00004488706,0.000100183],"category_scores_gemma":[0.00002273812,0.000106541,0.00003588354,0.0002186874,0.00004857429,0.0001042206,0.00007998296,0.00007337316,0.00001090328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001288994,"about_ca_system_score_gemma":7.99192e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003209581,"about_ca_topic_score_gemma":0.0004507261,"domain_scores_codex":[0.999242,0.000006181461,0.000186151,0.0002381422,0.0000963975,0.000231137],"domain_scores_gemma":[0.9998047,0.00001396145,0.00002791506,0.0001067348,0.00003005137,0.00001660342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000128652,0.0008817004,0.1282981,0.001586382,0.0001886508,0.00002885251,0.001458438,0.1755371,0.00002961219,0.02622567,0.05987738,0.6057595],"study_design_scores_gemma":[0.00060038,0.000007457159,0.01692365,0.00003152455,0.00001673802,3.886985e-7,0.0001903099,0.9626017,2.193119e-7,0.0002556481,0.01924648,0.0001255589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9456465,0.002429691,0.03598712,0.006300108,0.002105443,0.00146651,0.000005806508,0.0001710598,0.005887727],"genre_scores_gemma":[0.9981382,0.0001306588,0.0001223511,0.001257502,0.0001793128,0.00003966052,0.00001509388,0.00001051145,0.0001066646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7870646,"threshold_uncertainty_score":0.4344616,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004651164,0.0003062416,0.0002075428,0.0001045829,0.0002880047,0.0003106945,0.0003517176,0.0001841171,0.0009508543],"category_scores_gemma":[0.00002613688,0.0002968634,0.0001150105,0.0006581175,0.00004846832,0.000250488,0.000221906,0.0003367426,0.000306769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008043276,"about_ca_system_score_gemma":0.00001349879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005136367,"about_ca_topic_score_gemma":0.001092431,"domain_scores_codex":[0.998212,0.00001587701,0.0004085478,0.0005038641,0.000335139,0.0005245112],"domain_scores_gemma":[0.9991595,0.00001364011,0.0001156113,0.000514615,0.000152812,0.00004388428],"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.00001975816,0.0001376165,0.0008835254,0.0000157123,0.00002831069,0.000002992911,0.000004184659,0.770019,9.74797e-7,0.004375021,0.01063281,0.2138801],"study_design_scores_gemma":[0.000467737,0.00001673183,0.002724447,0.00002140803,0.00004419589,5.442522e-7,0.000030851,0.9249285,0.000001152838,0.0001263978,0.07133523,0.000302763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005061885,0.00008169501,0.9510924,0.001524123,0.008667227,0.0007069599,0.000003615209,0.0004162526,0.03244582],"genre_scores_gemma":[0.9433749,0.0002434958,0.01761588,0.0199115,0.01520737,0.000263765,0.0008993128,0.0001035625,0.002380191],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9383131,"threshold_uncertainty_score":0.9999624,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002934728,0.0001057409,0.0001216068,0.00002483209,0.00004060434,0.000063793,0.00005115226,0.0000705099,0.000005661183],"category_scores_gemma":[0.00002636866,0.0000964853,0.00000993572,0.0001482178,0.00002849252,0.00007609993,0.00001649232,0.0001265276,0.000004077761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004358446,"about_ca_system_score_gemma":0.00001713118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006753781,"about_ca_topic_score_gemma":0.00003556815,"domain_scores_codex":[0.9993942,0.00004223208,0.0001324286,0.0001386603,0.00009303092,0.0001994663],"domain_scores_gemma":[0.9996439,0.00002791252,0.00003076196,0.0001307387,0.00006952323,0.00009712054],"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.000008885131,0.000004874567,0.0005746852,0.00001134789,0.00001254453,0.000003914269,0.0001719117,0.988535,0.00004916084,0.0001869216,0.004594321,0.005846419],"study_design_scores_gemma":[0.0004828624,0.00003843098,0.000175518,0.00003393426,0.0000132776,0.00002251084,0.00001972702,0.9976063,0.00002824454,0.00008439265,0.001365329,0.0001294915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02434177,0.0003069906,0.9720702,0.00004572783,0.0001312655,0.0002068681,0.000001004376,0.000289884,0.002606255],"genre_scores_gemma":[0.7016188,0.00005216942,0.2975591,0.00006568233,0.0002362149,0.00004037181,0.00001132935,0.00004702642,0.0003693564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.677277,"threshold_uncertainty_score":0.3934556,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003163528,0.00009203888,0.000128827,0.0000731139,0.00006660203,0.0001204233,0.0003835214,0.00007495757,0.00002195668],"category_scores_gemma":[0.00001982973,0.00008446378,0.0000372695,0.000681875,0.00001121628,0.0002557549,0.00008520542,0.0001698251,0.00003030525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003296925,"about_ca_system_score_gemma":0.00001475687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005830083,"about_ca_topic_score_gemma":0.0005784458,"domain_scores_codex":[0.9990347,0.00006755792,0.0002312286,0.000244245,0.0001080314,0.0003142402],"domain_scores_gemma":[0.9994668,0.0001120245,0.00005288191,0.0002804851,0.00003662394,0.00005121363],"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.00002155108,0.0001083185,0.07319479,0.00001002829,0.00001833867,0.0003210042,0.0009344748,0.6202612,0.00003167215,0.02958145,0.02004978,0.2554674],"study_design_scores_gemma":[0.0002132307,0.00002937727,0.003421243,0.00006050171,6.604487e-7,0.00008073795,0.00002265299,0.9628114,0.000003444055,0.0003233522,0.03290989,0.0001234841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01660706,0.0005861125,0.9455669,0.000265649,0.00146607,0.00009079989,7.137015e-8,0.000164696,0.03525264],"genre_scores_gemma":[0.9970448,0.00006498198,0.001119808,0.000404512,0.000560464,0.0000114582,5.701139e-7,0.000006651728,0.0007867567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9804378,"threshold_uncertainty_score":0.3444333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282726,0.0001833399,0.0001897201,0.00004314443,0.0002822195,0.00007694108,0.0001894438,0.0001163582,0.00004094675],"category_scores_gemma":[0.00004440506,0.0001370155,0.00005207394,0.0002675805,0.0001380067,0.00007920458,0.00002986909,0.000408815,0.000004889901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006554981,"about_ca_system_score_gemma":0.00003481767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005434445,"about_ca_topic_score_gemma":0.00001501828,"domain_scores_codex":[0.9986938,0.0001630224,0.0002195264,0.000209038,0.0001691001,0.0005454929],"domain_scores_gemma":[0.9989917,0.0005015493,0.0000499754,0.0002413132,0.0001243196,0.0000910974],"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.00002015984,0.00001015142,0.002478865,0.0000221706,0.00007809401,6.518815e-7,0.0009771158,0.9673578,0.00001876298,0.004343449,0.0002388275,0.02445397],"study_design_scores_gemma":[0.0007823504,0.00008020437,0.0004327581,0.0000771308,0.00003159409,0.000006353556,0.0004511241,0.997311,0.00004766557,0.00006319761,0.0005342751,0.0001823612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003058404,0.0001869237,0.9908667,0.00007332864,0.0001644947,0.0005755243,0.000007452052,0.0003277162,0.004739487],"genre_scores_gemma":[0.9556692,0.00001468189,0.04370526,0.0001099081,0.0002808975,0.00008478276,0.00001449353,0.00006976582,0.00005099063],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9526108,"threshold_uncertainty_score":0.558733,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002001929,0.0001573516,0.0001195011,0.00008474933,0.0001834332,0.0001563321,0.000158593,0.00004918079,0.000130255],"category_scores_gemma":[0.0000178562,0.0001202476,0.00003006544,0.0005684299,0.00005658943,0.0005882244,0.00005813254,0.00009875305,0.000277411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004647105,"about_ca_system_score_gemma":0.00001598174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006233386,"about_ca_topic_score_gemma":0.002046736,"domain_scores_codex":[0.9990109,0.000005461001,0.0002165057,0.0002893043,0.0002150032,0.0002628717],"domain_scores_gemma":[0.9995025,0.00000494275,0.00006205418,0.000265605,0.0001495051,0.0000154188],"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.00002298094,0.00006656704,0.001524438,0.0001889033,0.00002029476,0.000001674761,0.00003210281,0.9100859,0.00000112804,0.08581198,0.0008312336,0.001412771],"study_design_scores_gemma":[0.003234035,0.00009697457,0.05539234,0.0006346711,0.0002735447,0.000003181398,0.0001882897,0.7336088,0.000008687757,0.05210914,0.1532315,0.001218819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1852127,0.0006026711,0.737115,0.007147354,0.001332425,0.002751565,0.000001124514,0.0008777424,0.06495943],"genre_scores_gemma":[0.997754,0.00001597509,0.0002676115,0.0007958265,0.0005663548,0.00008957042,0.00006439799,0.00001838691,0.0004278346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8125413,"threshold_uncertainty_score":0.4903556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}