{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":26,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":26,"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":"6f8f446585a3","filters":{"venue":"4OR"}},"results":[{"id":"W1975320652","doi":"10.1007/s10288-005-0071-0","title":"Bilevel programming: A survey","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":453,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Bilevel optimization; Class (philosophy); Simple (philosophy); Mathematical optimization; Computer science; Nonlinear programming; Quadratic programming; Quadratic equation; Linear programming; Nonlinear system; Mathematics; Optimization problem; Artificial intelligence; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03416886300847194,"gpt":0.2682684370357858,"spread":0.2340995740273139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002008061,0.00003765842,0.00004735796,0.00004855373,0.0000463688,0.00009022484,0.0002312242,0.00001610111,0.0000948573],"category_scores_gemma":[0.00004866873,0.00003157074,0.00002671754,0.0003743519,0.000005762322,0.0001863792,0.00004444166,0.00002336593,0.0002585718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001235366,"about_ca_system_score_gemma":0.00002924835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003326929,"about_ca_topic_score_gemma":0.00005197022,"domain_scores_codex":[0.9995583,0.00003006549,0.00008450107,0.000125501,0.0001174437,0.00008413508],"domain_scores_gemma":[0.999671,0.0000316549,0.00002799409,0.0001518964,0.00007717928,0.00004020739],"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.000005034245,0.0003750113,0.02572365,0.000005229417,0.0000694852,0.000002291747,0.000654463,0.01180535,0.00004936471,0.1887825,0.01063727,0.7618904],"study_design_scores_gemma":[0.0001874253,0.00001616099,0.09902725,0.000001775427,0.00000387037,0.000001879245,0.000002049929,0.7515683,0.00009215343,0.0003242645,0.1486513,0.0001235503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007086381,0.00002182892,0.9946747,0.003095909,0.00004864489,0.00004104811,0.000001830375,0.00009048147,0.001316958],"genre_scores_gemma":[0.52683,0.000004006725,0.4685086,0.0008332432,0.00007459611,0.000008535329,0.00001412303,0.000003262898,0.003723646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7617668,"threshold_uncertainty_score":0.3323503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017383000","doi":"10.1007/s10288-002-0009-8","title":"The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms","year":2003,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":334,"is_retracted":false,"has_abstract":false,"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":"Set (abstract data type); Computer science; Plan (archaeology); Destinations; Operations research; Algorithm; Mathematical optimization; Engineering; Mathematics; Geography; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01277443178779052,"gpt":0.2283156917083634,"spread":0.2155412599205729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001371411,0.00005866845,0.00005357043,0.00001899583,0.0001032004,0.00003602591,0.00003629037,0.00002646798,0.00001992563],"category_scores_gemma":[0.00001638678,0.00004592397,0.00001275672,0.00009605316,0.00001561078,0.00006461376,0.000001697398,0.00006583569,0.000009342646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007746425,"about_ca_system_score_gemma":0.000009576843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002185535,"about_ca_topic_score_gemma":0.00004362015,"domain_scores_codex":[0.999619,0.000007566172,0.0001339907,0.00007207289,0.00005812266,0.0001092317],"domain_scores_gemma":[0.9998161,0.00002023002,0.000007543263,0.0001013409,0.00002971213,0.00002508373],"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.00001192759,0.0001015591,0.002040456,0.0002341623,0.000237463,0.00001248117,0.005556066,0.4195966,0.007969773,0.4657399,0.004866477,0.09363309],"study_design_scores_gemma":[0.0009164175,0.00003268898,0.005241127,0.0000490079,0.00004945522,0.00001555959,0.000830124,0.6679586,0.003010333,0.01668689,0.3047029,0.0005068228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4340312,0.004927665,0.5269641,0.002472498,0.001235,0.001058458,0.00006886179,0.001192388,0.0280498],"genre_scores_gemma":[0.9896299,0.0003273995,0.009438293,0.00004575157,0.00003588316,0.00003617498,0.000007968618,0.00001552519,0.0004631133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5555987,"threshold_uncertainty_score":0.1872725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088243692","doi":"10.1007/s10288-008-0089-1","title":"Variable neighbourhood search: methods and applications","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":false,"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":"Metaheuristic; Heuristics; Neighbourhood (mathematics); Mathematical optimization; Computer science; Variable neighborhood search; Tabu search; Variable (mathematics); Heuristic; Simulated annealing; Local search (optimization); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03730997085608331,"gpt":0.3194639916222266,"spread":0.2821540207661433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003262591,0.00006992342,0.00009397366,0.00005017252,0.0001024553,0.00001497579,0.00007115699,0.00004964714,0.0001377251],"category_scores_gemma":[0.00004102667,0.00007452644,0.00001386598,0.0002458149,0.00003038365,0.00006337685,0.00002617231,0.0001057887,0.00002402973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001932738,"about_ca_system_score_gemma":0.00001561407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005976393,"about_ca_topic_score_gemma":1.395586e-7,"domain_scores_codex":[0.999501,0.00006481849,0.0001089034,0.0001126769,0.00006218191,0.0001503955],"domain_scores_gemma":[0.9995874,0.0001250665,0.000009226621,0.0001762366,0.00002874028,0.00007329177],"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.000005550363,0.00006360917,0.003768069,0.0002006616,0.0001105543,0.000005999771,0.001338086,0.5954016,0.03152893,0.04647585,0.001628396,0.3194727],"study_design_scores_gemma":[0.0004661327,0.00002049312,0.006489823,0.00001234258,0.00002370638,0.0001012692,0.00006076237,0.9047142,0.01369496,0.00180463,0.07226645,0.0003452086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001639507,0.0003176656,0.9750223,0.00003539567,0.00004621734,0.0001254172,0.000003729021,0.0003252714,0.02248446],"genre_scores_gemma":[0.02848443,0.00009282793,0.9707927,0.00004443954,0.00008747129,0.00004008429,0.000003600685,0.00002694506,0.0004274812],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3191275,"threshold_uncertainty_score":0.30391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065109168","doi":"10.1007/s10288-006-0009-1","title":"An exact algorithm for team orienteering problems","year":2006,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":219,"is_retracted":false,"has_abstract":false,"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":"Orienteering; Vehicle routing problem; Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Operations research; Work (physics); Artificial intelligence; Mathematics; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01094155590089829,"gpt":0.2544370093960222,"spread":0.2434954534951239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002042968,0.00009807383,0.0001003264,0.00004966185,0.00005116448,0.00004037285,0.00009135233,0.00005285738,0.00002021638],"category_scores_gemma":[0.00001363895,0.0001044239,0.00003257602,0.0001192282,0.000008448051,0.0001274761,0.000007440984,0.00006019012,0.000008888351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004436699,"about_ca_system_score_gemma":0.000006473935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469023,"about_ca_topic_score_gemma":0.000002668353,"domain_scores_codex":[0.9994071,0.00001339107,0.000157053,0.0001319364,0.00007611054,0.0002143873],"domain_scores_gemma":[0.9997081,0.00003167138,0.0000186626,0.0001641595,0.00003540079,0.00004196636],"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":[8.511787e-7,0.00002525609,0.0003116299,0.00004367477,0.000008379337,5.153364e-7,0.00008591337,0.8910508,0.005748023,0.0001867564,0.0009102264,0.1016279],"study_design_scores_gemma":[0.0002536018,0.00002809402,0.0003663907,0.00001200677,0.000006449111,0.000002649645,0.00001393211,0.9738943,0.006445786,0.0001512637,0.01868675,0.000138765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009668559,0.00007010685,0.9866262,0.000009031806,0.0002743053,0.0002361665,0.00001371015,0.0006759365,0.002425963],"genre_scores_gemma":[0.1010935,0.000003805939,0.8979365,0.00001332487,0.0003507183,0.00007303688,0.00003845947,0.0000684939,0.0004222315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1014892,"threshold_uncertainty_score":0.4258283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2179770505","doi":"10.1007/s10288-015-0301-z","title":"Shared mobility systems","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Popularity; Incentive; Dimensioning; Computer science; Operations research; Open research; Transport engineering; Engineering; World Wide Web; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.04176909962028166,"gpt":0.2400736198954986,"spread":0.1983045202752169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007473136,0.00003839236,0.0000492361,0.00002155932,0.00001001379,0.00001368079,0.0000389049,0.000025054,0.00003339326],"category_scores_gemma":[0.00001012344,0.00003837822,0.00001230146,0.0001060263,0.00000802071,0.00006293113,0.00000137293,0.00003782585,0.0001174568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000280458,"about_ca_system_score_gemma":0.00001259365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002239825,"about_ca_topic_score_gemma":0.00001607108,"domain_scores_codex":[0.9997134,0.000003276788,0.0001073182,0.00005195632,0.00006237395,0.00006162478],"domain_scores_gemma":[0.999764,0.000005397076,0.000005569621,0.0001229546,0.00005439416,0.00004772675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004099349,0.0004827437,0.06213892,0.0009854969,0.0002489625,0.00002238965,0.007856123,0.5571852,0.01178592,0.1298404,0.2214845,0.007928295],"study_design_scores_gemma":[0.001777913,0.00006698097,0.2527021,0.00005051246,0.00003762776,0.000008533872,0.001967186,0.1081453,0.001988644,0.001001072,0.6316156,0.0006385593],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9577312,0.0002764081,0.01178221,0.0001045465,0.001271995,0.0003049939,0.00009762845,0.001034097,0.02739695],"genre_scores_gemma":[0.9994012,7.91359e-7,0.0002102709,0.00001875004,0.00003217287,0.00003460786,0.00003783796,0.000006439943,0.0002580059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.44904,"threshold_uncertainty_score":0.1565018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069736946","doi":"10.1007/s10288-013-0238-z","title":"A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration","year":2013,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TRIPS architecture; Vehicle routing problem; Duration (music); Column generation; Computer science; Set (abstract data type); Routing (electronic design automation); Mathematical optimization; Time complexity; Variable (mathematics); Algorithm; Mathematics; Parallel computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01179034511206651,"gpt":0.2266155954218323,"spread":0.2148252503097658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002570733,0.0001478957,0.0001342458,0.00005543892,0.0001117338,0.000154648,0.0001039804,0.00006159545,0.00008062124],"category_scores_gemma":[0.00006653072,0.0001065387,0.00001926038,0.0003023044,0.00001501549,0.0002247137,0.00003628394,0.0001414786,0.0001403653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004123386,"about_ca_system_score_gemma":0.00002050845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001015336,"about_ca_topic_score_gemma":0.000007636083,"domain_scores_codex":[0.9991913,0.00004045445,0.000206957,0.0001814807,0.0001309407,0.0002489034],"domain_scores_gemma":[0.9994695,0.0001019756,0.00004390033,0.000195532,0.00006552569,0.0001235804],"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.00001482577,0.00003187798,0.001661676,0.00004174207,0.0001049079,0.000004608669,0.004588134,0.4235827,0.03307216,0.00005501843,0.002610543,0.5342318],"study_design_scores_gemma":[0.000564494,0.00004740663,0.006275844,0.0000400327,0.00001592698,0.00001089877,0.00007816911,0.9891842,0.003080282,0.00001495258,0.0005166891,0.0001710987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05121062,0.00005507725,0.9462666,0.0006955229,0.00004587692,0.0008715627,0.000002590159,0.0004076361,0.0004445083],"genre_scores_gemma":[0.07440457,0.000004355293,0.9244876,0.0001549358,0.0001130751,0.00006101099,0.000006103662,0.00005505052,0.0007133252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5656015,"threshold_uncertainty_score":0.4344524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159913713","doi":"10.1007/s10288-010-0145-5","title":"A large neighbourhood search heuristic for the aircraft and passenger recovery problem","year":2010,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"HEC Montréal","keywords":"Iterated local search; Operations research; Schedule; Computer science; Heuristic; Context (archaeology); Neighbourhood (mathematics); Set (abstract data type); Vehicle routing problem; Randomness; Mathematical optimization; Local search (optimization); Routing (electronic design automation); Engineering; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01226322866122709,"gpt":0.2616284954726309,"spread":0.2493652668114038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002336,0.0000877775,0.00009276084,0.0000335691,0.0001141648,0.00006310352,0.00009739697,0.00007102785,0.00009528753],"category_scores_gemma":[0.0001810141,0.00006740261,0.00003232305,0.00009563691,0.00001940654,0.00006252275,0.0000308866,0.0002367868,0.00001180861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009657122,"about_ca_system_score_gemma":0.00001578004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003676108,"about_ca_topic_score_gemma":0.00001524251,"domain_scores_codex":[0.9994107,0.00002606147,0.0001192787,0.0001227073,0.00008073212,0.0002404659],"domain_scores_gemma":[0.9992325,0.0004648012,0.00001341815,0.0001935469,0.00004407421,0.00005170808],"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.00016461,0.0003187858,0.01589145,0.002184588,0.0007102853,0.00001973692,0.008122005,0.3974861,0.07717497,0.0265659,0.02648244,0.4448792],"study_design_scores_gemma":[0.0006677374,0.00004311695,0.007467259,0.00001818251,0.00003492021,0.00001462591,0.00009983268,0.9674323,0.001595184,0.0007387477,0.02167537,0.0002127008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09258533,0.0002649873,0.9026478,0.001024948,0.0006056665,0.000679389,0.00004576858,0.0003531085,0.001792981],"genre_scores_gemma":[0.8051031,0.00004850313,0.1938426,0.00009489802,0.0002509959,0.00008607373,0.000005554095,0.00005672692,0.0005115237],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7125177,"threshold_uncertainty_score":0.2748599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2915617487","doi":"10.1007/s10288-019-00399-w","title":"A selective survey of game-theoretic models of closed-loop supply chains","year":2019,"lang":"en","type":"article","venue":"4OR","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Closed loop; Key (lock); Loop (graph theory); Function (biology); Mechanism (biology); Computer science; Business; Feedback loop; Process management; Industrial organization; Marketing; Engineering; Mathematics; Control engineering; Physics; Biology; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01395160591642028,"gpt":0.2155881406602788,"spread":0.2016365347438585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998814,0.0002089731,0.0004261387,0.0004404631,0.00003186681,0.00004779729,0.0004069231,0.00007333062,0.0005702255],"category_scores_gemma":[0.0002173295,0.0002011307,0.0001023634,0.001011371,0.00009735947,0.0005529662,0.0002892181,0.0001127726,0.0001328081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005864796,"about_ca_system_score_gemma":0.00005113205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004284841,"about_ca_topic_score_gemma":0.0001507065,"domain_scores_codex":[0.9984292,0.00004514045,0.0004039693,0.0003414154,0.0003890434,0.0003912018],"domain_scores_gemma":[0.9983855,0.0001307309,0.000363155,0.0004795033,0.0006285115,0.00001259342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0007109436,0.0007183642,0.4139739,0.004803746,0.0004094895,0.00001695178,0.0008740725,0.01160857,0.001281197,0.5519824,0.008900641,0.004719709],"study_design_scores_gemma":[0.005377568,0.0002585046,0.5655277,0.0004116969,0.0002921353,0.000001322624,0.004565688,0.3433087,0.002599314,0.07166965,0.004618739,0.001368893],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9650863,0.0000975166,0.001402921,0.0002002376,0.0002210735,0.001017427,0.00002051977,0.00007175558,0.0318822],"genre_scores_gemma":[0.9961182,0.00001070452,0.000083674,0.0003164047,0.000097736,0.00002914744,0.00006355988,0.00004700578,0.003233608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4803127,"threshold_uncertainty_score":0.8201871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1704392916","doi":"10.1007/s10288-003-0024-4","title":"Ten notes on equal-processing-time scheduling","year":2004,"lang":"en","type":"article","venue":"4OR","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Flow shop scheduling; Computer science; Scheduling (production processes); Time complexity; Parallel computing; Open shop; Job shop scheduling; Mathematical optimization; Distributed computing; Mathematics; Algorithm; Operating system; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01453392840013306,"gpt":0.2361701264133302,"spread":0.2216361980131972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006544985,0.0001144527,0.0001046024,0.00006835733,0.0000536505,0.0000542651,0.00008999245,0.00006798136,0.00008151209],"category_scores_gemma":[0.00006961979,0.0001055134,0.00003391759,0.0001575293,0.00001472602,0.000076084,0.00000929484,0.0001209852,0.0008684036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004538067,"about_ca_system_score_gemma":0.00001884619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003174283,"about_ca_topic_score_gemma":4.079481e-7,"domain_scores_codex":[0.9994501,0.000003968009,0.0001218615,0.0001252369,0.0001194175,0.0001794381],"domain_scores_gemma":[0.9997391,0.00002762614,0.00001587146,0.0001246173,0.00002890982,0.00006387362],"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.000002499835,0.00001516428,0.00001654822,0.00001659877,0.000007993742,0.000003478355,0.000180798,0.9850173,0.0009123525,0.0001798539,0.00000952778,0.01363791],"study_design_scores_gemma":[0.0007655117,0.00004782364,0.0001130013,0.0001464818,0.00001430111,0.000005623243,0.00004544265,0.9696729,0.02783498,0.0006024198,0.000418731,0.0003327816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2194115,0.001099951,0.7626376,0.0008595152,0.0007503344,0.0001804795,0.00001181968,0.00271788,0.01233096],"genre_scores_gemma":[0.7862278,0.00001479229,0.2130536,0.000208877,0.000238808,0.000007533219,0.00001132253,0.00004562697,0.0001917182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5668162,"threshold_uncertainty_score":0.9999095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142847239","doi":"10.1007/s10288-005-0065-y","title":"Sensitivity of trust-region algorithms to their parameters","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Sensitivity (control systems); Trust region; Context (archaeology); Algorithm; Computer science; Basis (linear algebra); Mathematics; Engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.07648040350217998,"gpt":0.3576830103733677,"spread":0.2812026068711877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003623712,0.000117805,0.0002182312,0.0001180302,0.00004459876,0.00001253288,0.0001069595,0.00005830286,0.00005417483],"category_scores_gemma":[0.0007195105,0.0001012011,0.00006670739,0.0002787277,0.00005546161,0.0001187254,0.00007407666,0.0001123171,0.00005817181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007119999,"about_ca_system_score_gemma":0.00002859157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001222964,"about_ca_topic_score_gemma":0.00001556561,"domain_scores_codex":[0.99897,0.0001032649,0.0002276684,0.0002000315,0.0002540614,0.0002449219],"domain_scores_gemma":[0.9988359,0.0004605864,0.00007677323,0.0003498006,0.0001592377,0.0001177311],"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.0001465404,0.0006976979,0.0003763608,0.0001460064,0.0001199051,0.0000442213,0.004543606,0.04252972,0.004586124,0.006447425,0.007219581,0.9331428],"study_design_scores_gemma":[0.001974046,0.0003560292,0.000790151,0.0001535875,0.00004088809,0.000104279,0.001457188,0.7511777,0.2005791,0.01904519,0.02346187,0.0008599488],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.100813,0.00001910608,0.8961936,0.001336181,0.00006168592,0.0004510718,0.00002036324,0.00009944393,0.001005588],"genre_scores_gemma":[0.2118249,0.00001645758,0.7857874,0.0002096055,0.0000959988,0.00002364089,0.000004013697,0.00003772266,0.002000285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9322829,"threshold_uncertainty_score":0.4126862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976996892","doi":"10.1007/s10288-014-0269-0","title":"A reliable affine relaxation method for global optimization","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Interval (graph theory); Affine transformation; Interval arithmetic; Relaxation (psychology); Constraint (computer-aided design); Computation; Operator (biology); Mathematics; Mathematical optimization; Branch and bound; Affine arithmetic; Upper and lower bounds; Global optimization; Algorithm; Local consistency; Linear inequality; Linear programming relaxation; Linear programming; Inequality; Constraint satisfaction; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01547858183578562,"gpt":0.3128095133241821,"spread":0.2973309314883965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005449524,0.00006239022,0.00009983478,0.00001683551,0.0000706423,0.00006716914,0.00023399,0.0000378804,0.000009167503],"category_scores_gemma":[0.0003043933,0.0000524323,0.00004024309,0.0002720658,0.000006514671,0.0001842732,0.00005280937,0.0000293587,0.000009667716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000278129,"about_ca_system_score_gemma":0.00001462752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001488837,"about_ca_topic_score_gemma":4.266398e-7,"domain_scores_codex":[0.9993455,0.00006543026,0.0001211443,0.0002230156,0.00009980435,0.0001451368],"domain_scores_gemma":[0.9994628,0.0001234255,0.00006995922,0.0002227618,0.00007056968,0.00005050647],"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.000004912661,0.00002590628,0.00002454407,0.000008353161,0.000003749898,1.688527e-7,0.0000203223,0.02531614,0.0001174742,0.1627803,0.0008837705,0.8108144],"study_design_scores_gemma":[0.0002254883,0.00009910204,0.0001059402,0.000005199128,0.000003603935,0.000002031079,0.000001243223,0.9220957,0.0003932782,0.03640828,0.04058841,0.00007173343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001080867,0.00002015329,0.9952934,0.001533773,0.0003745997,0.0001317648,0.000001387502,0.0001097394,0.002524379],"genre_scores_gemma":[0.0003169902,0.00000278851,0.9986064,0.0004263399,0.0001376416,0.00002736978,0.000003003805,0.000004369067,0.0004750373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8967795,"threshold_uncertainty_score":0.2138127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979173729","doi":"10.1007/s10288-009-0108-x","title":"Attraction probabilities in variable neighborhood search","year":2009,"lang":"en","type":"article","venue":"4OR","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Royal Military College of Canada","funders":"","keywords":"Attraction; Variable (mathematics); Context (archaeology); Mathematical optimization; Operator (biology); Variable neighborhood search; Mathematics; Local search (optimization); Convergence (economics); Current (fluid); Global optimization; Computer science; Metaheuristic; Geography; Mathematical analysis; Physics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0234880472998658,"gpt":0.2850018022420008,"spread":0.261513754942135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007109917,0.00007398715,0.0001076044,0.0001787066,0.00005771174,0.0001721684,0.0004643929,0.00004601611,0.0001787633],"category_scores_gemma":[0.00019321,0.00006994485,0.00001899287,0.000789932,0.00002045437,0.0005562751,0.00006916651,0.0001832371,0.0001180462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007816572,"about_ca_system_score_gemma":0.0001546787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002935579,"about_ca_topic_score_gemma":0.000001371353,"domain_scores_codex":[0.9987147,0.000128146,0.0001876902,0.0002828739,0.0003898646,0.000296723],"domain_scores_gemma":[0.9992785,0.0001021002,0.00002344079,0.0003938797,0.000124374,0.00007765726],"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.0000245606,0.000735686,0.001730691,0.00005760464,0.00001192077,0.00004338007,0.001464397,0.02532832,0.0009277734,0.6933953,0.002042175,0.2742382],"study_design_scores_gemma":[0.0004230425,0.0001540544,0.009637134,0.00001755929,0.000001132604,0.00001265293,0.00003989274,0.9634698,0.0006316169,0.02279631,0.002664646,0.0001521326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001419201,0.0000533938,0.9709004,0.002476152,0.0001505595,0.0002816235,0.000001450343,0.0001131321,0.02460409],"genre_scores_gemma":[0.4319035,0.00003667467,0.5622643,0.0004000226,0.0001169374,0.00003108195,0.000006276366,0.000009898932,0.005231339],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9381415,"threshold_uncertainty_score":0.2852268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022150528","doi":"10.1007/s10288-004-0057-3","title":"Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Bounding overwatch; Mathematical optimization; CONTEST; Polarization (electrochemistry); Frequency assignment; Computer science; Assignment problem; Mathematics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01363488760412227,"gpt":0.2470552419651835,"spread":0.2334203543610613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001869252,0.00007183722,0.000053681,0.00004213186,0.0002548699,0.0002223914,0.0001201724,0.00002775172,0.00004124876],"category_scores_gemma":[0.00002391882,0.00004725605,0.00001322167,0.0001281838,0.00009820744,0.0003462755,0.00002575276,0.00005772662,0.000003582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003968567,"about_ca_system_score_gemma":0.0001363034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006096963,"about_ca_topic_score_gemma":0.00004936074,"domain_scores_codex":[0.9993896,0.00001680121,0.0001033862,0.0001867351,0.000154344,0.0001491053],"domain_scores_gemma":[0.999652,0.00006883425,0.00004212296,0.0001196996,0.00007372753,0.00004363278],"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.00003214371,0.0001073306,0.02138111,0.0000892559,0.0000709816,0.000002563286,0.00309596,0.004937509,0.005470413,0.3223723,0.0004277435,0.6420127],"study_design_scores_gemma":[0.005160218,0.00106732,0.08774534,0.0003764957,0.00009784988,0.0003710086,0.001105778,0.877745,0.00743582,0.006758037,0.01088126,0.001255893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003899344,0.00004931876,0.9898759,0.004599002,0.00006099281,0.0005740146,0.00000295364,0.00006038907,0.0008780576],"genre_scores_gemma":[0.8553477,0.00001236139,0.1440745,0.0002697993,0.00004348686,0.00004304045,0.000002502656,0.000005247887,0.0002013411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8728074,"threshold_uncertainty_score":0.2144526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043306426","doi":"10.1007/s10288-002-0008-9","title":"Chemical trees enumeration algorithms","year":2003,"lang":"en","type":"article","venue":"4OR","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Enumeration; Computer science; Algorithm; Data structure; Computational complexity theory; Theoretical computer science; Scheme (mathematics); Point (geometry); Mathematics; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02231578831565209,"gpt":0.2953709018991213,"spread":0.2730551135834692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002218655,0.0000619015,0.00006463579,0.00003507017,0.00003896912,0.0000834537,0.0002246019,0.00002513137,0.00002742527],"category_scores_gemma":[0.000122939,0.00005914935,0.00003507027,0.0001925053,0.00001467508,0.0002765991,0.0000423733,0.00005307134,0.00008213641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002645951,"about_ca_system_score_gemma":0.00005760895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002908006,"about_ca_topic_score_gemma":5.18248e-7,"domain_scores_codex":[0.9993179,0.00008738505,0.0001031022,0.0001991591,0.0001765525,0.0001158688],"domain_scores_gemma":[0.9995795,0.0001202018,0.00002572275,0.0001952025,0.00003515715,0.00004420355],"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.000002780274,0.000117037,0.0001916507,0.000005997011,0.00001589459,0.0000118223,0.0005336159,0.005432786,0.01288931,0.7287232,0.00177354,0.2503024],"study_design_scores_gemma":[0.0006540683,0.0000472942,0.003689505,0.00001298348,0.000007113097,0.00006988313,0.00002045881,0.6592433,0.1732888,0.109269,0.05326294,0.0004346985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02662667,0.00006623225,0.9674854,0.0003860684,0.0003016247,0.00005431493,8.023591e-7,0.00007777382,0.005001106],"genre_scores_gemma":[0.4368138,0.000001783138,0.5625364,0.0002773555,0.00007114258,0.00001059479,0.0000029389,0.000005042255,0.0002809874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6538105,"threshold_uncertainty_score":0.241204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966106967","doi":"10.1007/s10288-004-0056-4","title":"Solving the frequency assignment problem with polarization by local search and tabu","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Computer science; Algorithm; Polarization (electrochemistry); Guided Local Search; Frequency assignment; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01318882992554685,"gpt":0.2480817877844851,"spread":0.2348929578589383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617253,0.00007075922,0.00006029506,0.00003339768,0.0002726435,0.0002430997,0.0008180754,0.00003277259,0.00001499592],"category_scores_gemma":[0.000007002729,0.00004517525,0.000009039345,0.000291984,0.0001229046,0.0003773679,0.0003529887,0.0002252676,0.00001927588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007104551,"about_ca_system_score_gemma":0.0000772876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008358358,"about_ca_topic_score_gemma":0.00005784211,"domain_scores_codex":[0.9989071,0.0001543707,0.000110754,0.0001974349,0.0003886661,0.0002416189],"domain_scores_gemma":[0.9991691,0.0001019458,0.00002653362,0.0005584569,0.00007429477,0.0000696397],"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.00001166687,0.0001939945,0.007861004,0.00002830413,0.0000413445,0.000003481259,0.002979316,0.01186148,0.01016972,0.09904737,0.004310733,0.8634916],"study_design_scores_gemma":[0.0003633615,0.0001212398,0.003329266,0.00004412601,0.000002757362,0.00001591557,0.00009468925,0.9861473,0.002306102,0.0005113509,0.006896916,0.0001669784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007355324,0.0007102651,0.9769704,0.01306473,0.000009881384,0.0002737803,8.397973e-7,0.00006071635,0.001554112],"genre_scores_gemma":[0.9569238,0.0000734944,0.04226921,0.0002154007,0.00003068431,0.00003288339,0.000003483603,0.000007716551,0.0004433386],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9742858,"threshold_uncertainty_score":0.2344216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029358090","doi":"10.1007/s10288-008-0088-2","title":"Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Markov chain; Discrete time and continuous time; Queue; Computer science; Epoch (astronomy); Queueing theory; Renewal theory; Applied mathematics; Markov process; Bulk queue; Mathematics; Mathematical optimization; Statistics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.00906742964980874,"gpt":0.2118071467518994,"spread":0.2027397171020907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001631018,0.0001456734,0.0003352836,0.000627196,0.0001477097,0.0000306987,0.0001145919,0.00003475326,0.000405974],"category_scores_gemma":[0.0001269466,0.0001199994,0.00008976056,0.001600136,0.0001769056,0.0006951517,0.00006951026,0.00006952158,0.00005052906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001123281,"about_ca_system_score_gemma":0.0000121929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000171409,"about_ca_topic_score_gemma":0.00006208266,"domain_scores_codex":[0.9991444,0.00001597823,0.0002323751,0.0002418336,0.0002052329,0.0001601994],"domain_scores_gemma":[0.9991939,0.0001737953,0.0002475286,0.0002413941,0.0001289912,0.00001436113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001066527,0.0002715604,0.6598608,0.0003244735,0.006266734,0.0001758953,0.001120324,0.2967065,0.001575292,0.02507231,0.0008503327,0.006709205],"study_design_scores_gemma":[0.002213778,0.0001110694,0.3466099,0.0001466341,0.008773718,0.000007810425,0.0009735983,0.6120622,0.0002121381,0.00803138,0.01947117,0.001386666],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9856413,0.00008367349,0.008134868,0.0002548009,0.00001772452,0.0001114596,0.00002279986,0.00008560127,0.005647798],"genre_scores_gemma":[0.9973676,0.00001978074,0.0009323611,0.0004331149,0.00007457245,0.000008035579,0.000154246,0.00001941745,0.0009909366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3153557,"threshold_uncertainty_score":0.4893434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978730351","doi":"10.1007/s10288-011-0169-5","title":"Locating a general minisum ‘circle’ on the plane","year":2011,"lang":"en","type":"article","venue":"4OR","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit circle; Norm (philosophy); Mathematics; Combinatorics; Regular polygon; Euclidean geometry; Convex body; Euclidean distance; Scaling; Boundary (topology); Unit sphere; Plane (geometry); Great circle; Geometry; Mathematical analysis; Convex hull","retraction":null,"screen_n_in":null,"score":{"opus":0.05103679673092494,"gpt":0.2323024574442691,"spread":0.1812656607133441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001754777,0.00005040277,0.00004071323,0.00003659265,0.0001137643,0.00004499501,0.0003060638,0.00002030896,0.00004564593],"category_scores_gemma":[0.00002931779,0.00003744951,0.00002177555,0.0001749958,0.00001269767,0.0000847831,0.00005403081,0.0000606962,0.0001955252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008365511,"about_ca_system_score_gemma":0.00002774922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001511658,"about_ca_topic_score_gemma":0.000003247933,"domain_scores_codex":[0.9994858,0.00003540725,0.00008610668,0.0001500761,0.0001354398,0.0001072035],"domain_scores_gemma":[0.9996254,0.00006414694,0.00003424657,0.0002157346,0.00003026393,0.00003022337],"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.00001745302,0.0001779756,0.0003903789,0.00001192207,0.00002510034,0.0000222352,0.003762329,0.001460018,0.003901595,0.688497,0.009321704,0.2924123],"study_design_scores_gemma":[0.001118722,0.001015648,0.1470822,0.00007010289,0.00002251593,0.0001400715,0.0001931115,0.5468841,0.1923847,0.06206391,0.04800187,0.001022992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4854761,0.00007437826,0.4893202,0.00231649,0.0008018996,0.000174087,0.000002088808,0.0001273658,0.02170742],"genre_scores_gemma":[0.9725483,9.934614e-7,0.0252429,0.001375596,0.0001731915,0.00001104055,0.000002974383,0.000002964254,0.0006420059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6264331,"threshold_uncertainty_score":0.2513147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083976288","doi":"10.1007/s10288-007-0060-6","title":"A linear programming approach to highly precise clock synchronization over a packet network","year":2007,"lang":"en","type":"article","venue":"4OR","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Clock synchronization; Computer science; Network packet; Synchronization (alternating current); Clock drift; Real-time computing; Computer network; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01082181854792762,"gpt":0.2429955719175654,"spread":0.2321737533696378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006302711,0.0002141766,0.0002043701,0.0001751625,0.0001895921,0.0001889849,0.001003265,0.0001692199,0.00001283311],"category_scores_gemma":[0.000131571,0.0002050171,0.00005569926,0.002355473,0.00005229412,0.0003827059,0.0005173656,0.0001798427,0.000153549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001606329,"about_ca_system_score_gemma":0.00007105079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008419065,"about_ca_topic_score_gemma":0.000008137581,"domain_scores_codex":[0.9979233,0.00003886583,0.0003599065,0.0005932794,0.0003830574,0.0007016081],"domain_scores_gemma":[0.9986686,0.00007534234,0.0001338124,0.0008314626,0.0001442731,0.0001465233],"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.00002204507,0.0002353955,0.002998871,0.00004369329,0.00003965336,0.00001652375,0.000632303,0.0323401,0.00005520474,0.06444511,0.02412683,0.8750443],"study_design_scores_gemma":[0.000983078,0.0004354473,0.00398498,0.0001561077,0.00002649177,0.00004159757,0.00007233691,0.6854237,0.002266509,0.003777062,0.3017077,0.001125007],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002969407,0.0003375468,0.9916419,0.000297195,0.0003536256,0.0007308245,9.331991e-7,0.001533244,0.002135346],"genre_scores_gemma":[0.3785469,0.00001039261,0.6200386,0.000265853,0.0004802746,0.00005833455,0.00001287282,0.00002930215,0.0005575278],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8739192,"threshold_uncertainty_score":0.8360354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292074987","doi":"10.1007/s10288-022-00520-6","title":"A bilevel optimization model for the newsvendor problem with the focus theory of choice","year":2022,"lang":"en","type":"article","venue":"4OR","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Newsvendor model; Bilevel optimization; Focus (optics); Mathematical optimization; Economic order quantity; Minimax; Order (exchange); Perspective (graphical); Computer science; Upper and lower bounds; Optimization problem; Mathematical economics; Mathematics; Economics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03215700315270644,"gpt":0.2129238591767938,"spread":0.1807668560240874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581802,0.00009428101,0.00008746135,0.0000653904,0.0004476158,0.00007097327,0.0003699134,0.00001049378,0.0003305562],"category_scores_gemma":[0.00002771665,0.00004947314,0.00005875433,0.0002665527,0.00004903769,0.0002076436,0.0002163758,0.00006859181,0.000003503363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002070317,"about_ca_system_score_gemma":0.00001779619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073729,"about_ca_topic_score_gemma":0.00003870826,"domain_scores_codex":[0.9993336,0.00001540372,0.0001318331,0.0001471042,0.0002191641,0.0001529512],"domain_scores_gemma":[0.9993993,0.0001165917,0.0001670816,0.0002479215,0.00006533391,0.000003795829],"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.0001254831,0.00006834172,0.0001337146,0.00007497201,0.00005800818,2.672921e-7,0.0002229038,0.8668567,0.00001224669,0.100885,0.02444383,0.007118561],"study_design_scores_gemma":[0.000582124,0.00002152981,0.0000637026,0.000006433297,0.00009341836,2.465612e-7,0.0009924724,0.8681599,0.000006198569,0.005104514,0.1248864,0.00008298114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001968891,0.0002981142,0.9598556,0.01673678,0.000252301,0.003029735,0.00002156234,0.0001047081,0.01773235],"genre_scores_gemma":[0.9781897,0.00000684036,0.002905432,0.005836979,0.0005176194,0.001896138,0.0000343569,0.00005470892,0.01055822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9762208,"threshold_uncertainty_score":0.3619358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074959750","doi":"10.1007/s10288-004-0043-9","title":"Variations on the Roy-Gallai theorem","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Generalization; Mathematics; Chromatic scale; Simple (philosophy); Combinatorics; Graph; Extension (predicate logic); Elementary proof; Discrete mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03277067882961263,"gpt":0.2873123825077866,"spread":0.254541703678174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002959198,0.00007989063,0.00007573645,0.00002557289,0.0002716579,0.00002426874,0.0002080143,0.00004448199,0.001286096],"category_scores_gemma":[0.0003011094,0.00004212222,0.00006314107,0.00006685759,0.0000488999,0.00002928705,0.00004164544,0.0001200673,0.0001033076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001494256,"about_ca_system_score_gemma":0.000008930089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001103574,"about_ca_topic_score_gemma":0.000004946714,"domain_scores_codex":[0.9994668,0.00006233554,0.0001153729,0.0000973967,0.0001305251,0.0001275263],"domain_scores_gemma":[0.9989072,0.000614903,0.00004421728,0.0003841234,0.00002394319,0.00002560508],"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.000005931725,0.00002583122,0.00001747263,0.000002718216,0.00001933214,3.981486e-7,0.0009267856,0.000007369177,0.00003109764,0.9856867,0.01036774,0.002908583],"study_design_scores_gemma":[0.00009908937,0.00001726829,0.0003855906,0.000007743612,0.00001550925,0.000002514204,0.00005633255,0.0002316185,0.0004828176,0.9502214,0.04841205,0.00006810608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3035161,0.00009682719,0.003947312,0.0132511,0.0006363608,0.0005051017,0.00002700189,0.0002471749,0.677773],"genre_scores_gemma":[0.9917047,0.000004960687,0.003143756,0.001449009,0.0003615046,0.0000129529,8.657077e-7,0.00001452903,0.003307697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6881886,"threshold_uncertainty_score":0.9996269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075014621","doi":"10.1007/s10288-012-0208-x","title":"Bicriteria optimization in the newsvendor problem with uniformly distributed demand","year":2012,"lang":"en","type":"article","venue":"4OR","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Newsvendor model; Mathematical optimization; Computer science; Key (lock); Simple (philosophy); Variable (mathematics); Profit (economics); Optimization problem; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01635557901820086,"gpt":0.2077502825516955,"spread":0.1913947035334947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003834401,0.0001107981,0.00008845739,0.0001071641,0.00009420476,0.0001937513,0.0001794363,0.00002529656,0.0003034771],"category_scores_gemma":[0.00001450282,0.00006796003,0.00002219192,0.0004402923,0.00002567444,0.0009939093,0.0000594903,0.0000599228,0.00008363831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002276875,"about_ca_system_score_gemma":0.000004598862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001269693,"about_ca_topic_score_gemma":0.00004355,"domain_scores_codex":[0.999295,0.00001353621,0.0001450346,0.0001128793,0.0001606384,0.000272935],"domain_scores_gemma":[0.999705,0.00001181243,0.00007772214,0.0001664119,0.0000302694,0.000008743101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004821315,0.001837701,0.5626903,0.001278039,0.00016284,0.00005548863,0.002213977,0.05066868,0.0001597491,0.1948293,0.1764256,0.009196317],"study_design_scores_gemma":[0.002009897,0.00003777317,0.05624573,0.0001132874,0.0001014003,0.000005192941,0.002295157,0.03353894,0.00003114491,0.0006759529,0.9044844,0.0004611523],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.609353,0.0007429257,0.1232131,0.02272504,0.001809613,0.005702866,0.00003292062,0.0006831462,0.2357373],"genre_scores_gemma":[0.9959062,0.000005633774,0.0008645244,0.002173823,0.0005628318,0.00007573918,0.0001812708,0.0000156644,0.000214357],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7280588,"threshold_uncertainty_score":0.3322862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389131017","doi":"10.1007/s10288-023-00556-2","title":"A survey of attended home delivery and service problems with a focus on applications","year":2023,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Work (physics); Coronavirus disease 2019 (COVID-19); Service (business); Service delivery framework; Focus (optics); Pandemic; Engineering; Business; Marketing; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.0240314354903449,"gpt":0.220609661804598,"spread":0.1965782263142531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005970821,0.00004311098,0.00005821315,0.0000638513,0.00001839646,0.00000439468,0.00003060339,0.00001921261,0.000007734689],"category_scores_gemma":[0.000001691582,0.00003933402,0.000005321045,0.0006330826,0.00001107431,0.00002649786,0.000002169031,0.00003606457,0.0000203302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005042816,"about_ca_system_score_gemma":0.00001011555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001357862,"about_ca_topic_score_gemma":0.002542318,"domain_scores_codex":[0.9997252,0.000004089405,0.00009103186,0.00006642628,0.00005286089,0.00006034029],"domain_scores_gemma":[0.9997612,0.00003302463,0.00001153161,0.00009918725,0.00007647004,0.00001863341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002612367,0.0008427789,0.4265126,0.005301979,0.001039688,0.00001303741,0.01235559,0.3186181,0.0611589,0.04937823,0.007116844,0.117401],"study_design_scores_gemma":[0.0002643908,0.00002389614,0.995703,0.00001807036,0.000007438587,4.047263e-7,0.00004329121,0.002573557,0.0003706098,0.0001420155,0.0007854401,0.00006783774],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9961994,0.00002350891,0.002233336,0.0002848574,0.00001408722,0.0002955729,0.0001604698,0.000248178,0.0005405734],"genre_scores_gemma":[0.9995344,0.00001555702,0.0001341248,0.00003717385,0.000003550741,0.000125618,0.0001055514,0.000009387574,0.00003462224],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5691904,"threshold_uncertainty_score":0.1603995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3175105319","doi":"10.1007/s10288-021-00486-x","title":"Measures of balance in combinatorial optimization","year":2021,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Balance (ability); Computer science; Measure (data warehouse); Balance problems; Risk analysis (engineering); Psychology; Data mining; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.0166743040082642,"gpt":0.2297974208121571,"spread":0.2131231168038929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008030963,0.00003255458,0.00006478215,0.00004164625,0.00001451685,0.00002129824,0.00008701879,0.00002556795,0.00005309749],"category_scores_gemma":[0.00007733677,0.00003545557,0.00001606913,0.000301408,0.00001144667,0.0001533253,0.00002883915,0.00003358534,0.00000283318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001615966,"about_ca_system_score_gemma":0.00007387919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000661675,"about_ca_topic_score_gemma":0.000007789545,"domain_scores_codex":[0.9995738,0.00003594955,0.0001161591,0.0001065192,0.0001105544,0.00005698784],"domain_scores_gemma":[0.9996992,0.00002135354,0.00003766029,0.0001318228,0.00009321336,0.00001679825],"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.0000152503,0.0002053126,0.04046364,0.00003199776,0.00001466492,0.00002732088,0.0008827046,0.5508402,0.002926702,0.3195192,0.0004617331,0.08461126],"study_design_scores_gemma":[0.001208454,0.00002468409,0.0220654,0.00003585856,0.00000255858,0.00001045107,0.00003701192,0.9614416,0.0115482,0.002412668,0.001075749,0.0001373506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002495423,0.00005146188,0.9932036,0.0004244943,0.0005970316,0.00004162803,8.04322e-7,0.00002990815,0.003155603],"genre_scores_gemma":[0.9063013,0.00003256258,0.09351806,0.00006710003,0.00001898814,0.000002599476,0.000003468466,0.000002176595,0.00005380087],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9038059,"threshold_uncertainty_score":0.1445836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1469087774","doi":"10.1007/s10288-015-0295-6","title":"A simple method to obtain the stochastic decomposition structure of the busy period in Geo/Geo/1/N vacation queue","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Correctness; Simple (philosophy); Computer science; Queue; Reliability (semiconductor); Period (music); Mathematics; Mathematical optimization; Applied mathematics; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01383423744884959,"gpt":0.29374607956287,"spread":0.2799118421140204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917315,0.000109712,0.0001531558,0.0001287006,0.0001138574,0.00006235989,0.0003103527,0.00004186526,0.00005066348],"category_scores_gemma":[0.0004266575,0.00006877026,0.00005579747,0.0007982848,0.00002839493,0.0002940016,0.0001528408,0.0001171178,0.00001843086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006155248,"about_ca_system_score_gemma":0.00002265993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005520174,"about_ca_topic_score_gemma":0.0007332395,"domain_scores_codex":[0.9991873,0.0000792887,0.0002108049,0.0001761945,0.0001917184,0.0001546817],"domain_scores_gemma":[0.9992477,0.00008147507,0.0001827159,0.0003235003,0.0001540464,0.00001059319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000252269,0.00008874792,0.004419666,0.00009705276,0.00007181817,0.000002300967,0.002385296,0.8825068,0.02659048,0.06698136,0.0009195489,0.01568467],"study_design_scores_gemma":[0.001868498,0.00004925862,0.05448481,0.0002154332,0.0005228656,0.00001002475,0.01142756,0.3285359,0.003707778,0.5863355,0.01203896,0.0008034136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8349398,0.00003160191,0.1621315,0.002137429,0.0001146988,0.0003832969,0.000005867662,0.00003350231,0.0002222974],"genre_scores_gemma":[0.9970939,1.056178e-7,0.001616492,0.000958373,0.0002271806,0.00001621476,0.00001613154,0.00001449416,0.00005706605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5539709,"threshold_uncertainty_score":0.280437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2768981582","doi":"10.1007/s10288-017-0362-2","title":"The inventory replenishment planning and staggering problem: a bi-objective approach","year":2017,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Université Laval","keywords":"Mathematical optimization; Pareto principle; Multi-objective optimization; Computer science; Decision maker; Population; Pareto optimal; Order (exchange); Space (punctuation); Operations research; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.02579070386469375,"gpt":0.287191586310707,"spread":0.2614008824460133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003321166,0.0001262347,0.0001162826,0.00004321482,0.001309307,0.0005636212,0.0006963252,0.00003457947,8.423709e-7],"category_scores_gemma":[0.0001436221,0.00009467088,0.00002731186,0.00006937128,0.0001489646,0.0006979502,0.0006041562,0.0001425624,0.000003920954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007439603,"about_ca_system_score_gemma":0.00004716057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002030797,"about_ca_topic_score_gemma":0.000002670222,"domain_scores_codex":[0.998935,0.00004362777,0.0001493339,0.0004211134,0.0001949865,0.0002559129],"domain_scores_gemma":[0.9987906,0.00005768759,0.0002147041,0.0007736078,0.00008456537,0.00007884179],"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.0001680276,0.0006093354,0.03629222,0.0002450676,0.0005069565,0.0001637836,0.05435897,0.08723266,0.00199097,0.1499801,0.002223397,0.6662285],"study_design_scores_gemma":[0.001207994,0.0001286748,0.01723999,0.00008226297,0.00001048781,0.00004901034,0.0007834241,0.962984,0.001560578,0.005260721,0.01021314,0.0004796828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001445114,0.0004015414,0.9873787,0.000360452,0.0002434632,0.0004167336,0.000001175721,0.0001313063,0.009621551],"genre_scores_gemma":[0.2622966,0.0000825531,0.7348196,0.0001559135,0.0001324209,0.0002231513,0.000001913736,0.00002986607,0.002257934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8757514,"threshold_uncertainty_score":0.9999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010203453","doi":"10.1007/s10288-014-0260-9","title":"Approximating the length of Chinese postman tours","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Unit square; Combinatorics; Square (algebra); Simple (philosophy); Mathematics; Function (biology); Planar; Unit (ring theory); Arc length; Computer science; Discrete mathematics; Geometry; Arc (geometry)","retraction":null,"screen_n_in":null,"score":{"opus":0.007203520721262863,"gpt":0.2381229902906437,"spread":0.2309194695693808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004695922,0.00006579348,0.0000967266,0.00002454506,0.00003606898,0.00001123998,0.0001269864,0.00002862562,0.00002395356],"category_scores_gemma":[0.0002881975,0.00004482125,0.00002951231,0.0001316686,0.00001756397,0.00003715984,0.00002045103,0.0000820317,0.000008606738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007803878,"about_ca_system_score_gemma":0.000002835619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003848609,"about_ca_topic_score_gemma":0.000001026542,"domain_scores_codex":[0.9995533,0.00005123781,0.0001508584,0.00005892025,0.00008220493,0.0001035391],"domain_scores_gemma":[0.9995804,0.0001454479,0.00003453812,0.0001973766,0.00002198362,0.0000202207],"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.000003828455,0.00001891511,0.01514033,0.000157383,0.00004349107,3.315196e-7,0.002648263,0.8874475,0.009441249,0.002727472,0.0003458291,0.08202536],"study_design_scores_gemma":[0.0001219283,0.00001088417,0.007318649,0.00001147659,0.000005311137,0.000002041834,0.00004166627,0.9897613,0.001798111,0.0003335431,0.0005232056,0.00007189107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6787324,0.00006473,0.302231,0.0001635439,0.0002050959,0.0001046925,0.000001817232,0.0002445627,0.01825217],"genre_scores_gemma":[0.8991308,0.000002271287,0.1006562,0.00003585037,0.00008252767,0.000003944386,0.000001431023,0.00002007597,0.00006695748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2203984,"threshold_uncertainty_score":0.1827758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}