{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"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":"381b769beff3","filters":{"venue":"Top"}},"results":[{"id":"W2082772228","doi":"10.1007/s11750-007-0009-0","title":"Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":698,"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":"Pickup; Scheme (mathematics); Computer science; Vehicle routing problem; Class (philosophy); Classification scheme; Routing (electronic design automation); Field (mathematics); Operations research; Mathematical optimization; Artificial intelligence; Data science; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04328352270591027,"gpt":0.2781970216619149,"spread":0.2349134989560046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000821259,0.00006036316,0.0000699782,0.00004923469,0.00002987634,0.00002478075,0.00002736546,0.00004146662,0.00001077055],"category_scores_gemma":[0.00009217707,0.00006434755,0.000004928948,0.0001151301,0.00002187026,0.00007223141,0.00001260769,0.0000645386,0.00000429745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002099979,"about_ca_system_score_gemma":0.000006006006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003039256,"about_ca_topic_score_gemma":0.00003351197,"domain_scores_codex":[0.9995663,0.00003670699,0.0001286931,0.00009534163,0.00005676445,0.0001162567],"domain_scores_gemma":[0.9996618,0.0001516912,0.00001820456,0.00008659063,0.00003348055,0.00004822787],"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.00004105147,0.00005612211,0.6493103,0.000719587,0.0001019025,0.000007489278,0.004311624,0.03094401,0.04412964,0.001801744,0.001349975,0.2672265],"study_design_scores_gemma":[0.0002530332,0.00001502879,0.5746883,0.00001976379,0.000005844161,0.00000478994,0.0000772764,0.4233328,0.000726707,0.00007691541,0.0006716143,0.0001279939],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7882364,0.0002062223,0.2106024,0.00002999015,0.00003856149,0.0000887835,0.000002744263,0.0001283726,0.0006665544],"genre_scores_gemma":[0.8928355,0.00008988332,0.1069117,0.0000311578,0.00001629278,0.000002966538,0.000008487296,0.00001564674,0.00008832739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3923888,"threshold_uncertainty_score":0.2624017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626188202","doi":"10.1007/s11750-017-0451-6","title":"On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":174,"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":"Computer science; Integer programming; Artificial intelligence; Branching (polymer chemistry); Heuristic; Machine learning; Field (mathematics); Branch and bound; Variable (mathematics); Computational learning theory; Mathematical optimization; Theoretical computer science; Active learning (machine learning); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01682463045290404,"gpt":0.2971222359018433,"spread":0.2802976054489392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004152209,0.00005139152,0.00006455649,0.00002192488,0.0004430758,0.0003464298,0.0003419796,0.00001873197,0.00001069161],"category_scores_gemma":[0.0004215202,0.00004335913,0.00001205991,0.00002067799,0.00002061632,0.000119895,0.0001558818,0.000177453,0.00004793387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002965611,"about_ca_system_score_gemma":0.000007670036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002931945,"about_ca_topic_score_gemma":0.00001163378,"domain_scores_codex":[0.9995207,0.00007503651,0.00004403861,0.0001699149,0.00008307377,0.0001072817],"domain_scores_gemma":[0.9995033,0.0001059416,0.00004870357,0.0002879138,0.0000115405,0.00004265852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000006453409,0.00002347402,0.1878214,0.000007773461,0.000008176416,0.0000204575,0.0007220657,0.0001562122,0.000065472,0.02946911,0.0005178137,0.7811816],"study_design_scores_gemma":[0.0003403855,0.0001373754,0.852801,0.00002254984,0.000001043069,0.000009612394,0.000003063278,0.1312699,0.00009889476,0.00274663,0.01240902,0.0001605911],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8591509,0.00007560853,0.1054705,0.001725085,0.0004529786,0.00005101064,5.95251e-7,0.0002036184,0.03286968],"genre_scores_gemma":[0.9940625,0.000004431728,0.002138198,0.00008508097,0.00004644271,7.296581e-7,4.93617e-7,0.000003323399,0.003658749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.781021,"threshold_uncertainty_score":0.3407826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064073889","doi":"10.1007/bf02579017","title":"Tabu Search heuristics for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"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":"Vehicle routing problem; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Set (abstract data type); Point (geometry); Routing (electronic design automation); Interval (graph theory); Metaheuristic; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02423384446332382,"gpt":0.2493872648064071,"spread":0.2251534203430833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952665,0.0001060445,0.0001105562,0.000027829,0.0001510686,0.0000582756,0.0001569621,0.00004640247,0.0001813889],"category_scores_gemma":[0.00006134572,0.00007735741,0.00002812486,0.0002064984,0.0000296195,0.00005791413,0.00002381368,0.0001531926,0.00009006178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003671655,"about_ca_system_score_gemma":0.000007290779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005212683,"about_ca_topic_score_gemma":0.000001000068,"domain_scores_codex":[0.9992626,0.00003498526,0.0001472724,0.0001252481,0.0001422281,0.0002877177],"domain_scores_gemma":[0.999306,0.0003366781,0.00002176388,0.0002265134,0.00006300286,0.00004610383],"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.000006207747,0.00001308854,0.0007708215,0.00004183508,0.00003581219,0.000001764819,0.0008035445,0.9721953,0.0008428477,0.0003228872,0.001860002,0.02310589],"study_design_scores_gemma":[0.0003322437,0.00003361114,0.0002396053,0.00001798566,0.00001834002,0.00000558844,0.00003936338,0.9936349,0.001496477,0.00002125061,0.004042822,0.0001177871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03198618,0.000331324,0.9502391,0.0008089262,0.0001187373,0.0009719498,0.00001661658,0.0008050103,0.01472211],"genre_scores_gemma":[0.7343801,0.00002339576,0.2604702,0.000103678,0.0002713831,0.00006623803,0.000005384194,0.0001015171,0.004578169],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7023939,"threshold_uncertainty_score":0.3154544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029570945","doi":"10.1007/s11750-011-0188-6","title":"A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"National University of Defense Technology","keywords":"Heuristics; Vehicle routing problem; Heuristic; Variable neighborhood search; Mathematical optimization; Variable (mathematics); Computer science; Routing (electronic design automation); Local search (optimization); Service (business); Mathematics; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.03343292112571488,"gpt":0.2456308317566986,"spread":0.2121979106309837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005687443,0.0001754374,0.0001845346,0.00004949019,0.0001926785,0.00005490822,0.0002365398,0.00006734335,0.0001802345],"category_scores_gemma":[0.00007429517,0.0001287468,0.00002838452,0.0004984835,0.00002804006,0.0001022292,0.00003397669,0.0001805772,0.00002333553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004709245,"about_ca_system_score_gemma":0.000052729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002065179,"about_ca_topic_score_gemma":0.00001083544,"domain_scores_codex":[0.9989291,0.0000777426,0.0002238649,0.0002007917,0.0001541969,0.0004143264],"domain_scores_gemma":[0.9990478,0.0003338569,0.00004079589,0.0003051755,0.0001969206,0.00007543998],"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.00005637811,0.00002182516,0.0001313056,0.0001053575,0.0001112537,0.000001305605,0.003895763,0.987722,0.001003444,0.005588122,0.0001043555,0.001258857],"study_design_scores_gemma":[0.000812421,0.00005566997,0.0001698292,0.00004615004,0.00007426618,0.000009070388,0.0002594872,0.996435,0.001307561,0.0005890384,0.00004749567,0.000194031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02434614,0.00008894417,0.9707617,0.0001019257,0.00009451591,0.0006974816,0.00001496081,0.0004993855,0.003394979],"genre_scores_gemma":[0.7108065,0.000002001416,0.2884996,0.0001075493,0.00007069117,0.0001259609,0.00000964325,0.00007811574,0.0002998934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6864604,"threshold_uncertainty_score":0.525014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092214701","doi":"10.1007/bf02578926","title":"Performance analysis of a call center with interactive voice response units","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Center (category theory); Interactive voice response; Speech recognition; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01060196318350674,"gpt":0.2342903321682049,"spread":0.2236883689846981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002722165,0.0001133885,0.000232807,0.0005731517,0.00006583198,0.00003016239,0.0001624895,0.00002495834,0.0001024101],"category_scores_gemma":[0.0001457698,0.00009109206,0.00006585587,0.002608717,0.0000583435,0.000741073,0.00006907823,0.00008992534,0.00007475266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004823208,"about_ca_system_score_gemma":0.00001781902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001890638,"about_ca_topic_score_gemma":0.0001921149,"domain_scores_codex":[0.9993253,0.00001761302,0.0001697759,0.000182527,0.0001517007,0.0001531321],"domain_scores_gemma":[0.9991955,0.00006740959,0.0002046174,0.0002636291,0.0002603611,0.000008533328],"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.02200459,0.0008134263,0.2446069,0.0003022032,0.007092782,0.0001316647,0.003716948,0.6949835,0.005564854,0.01214412,0.0002168953,0.008422037],"study_design_scores_gemma":[0.01085429,0.0004923922,0.7193371,0.001206635,0.01820138,0.00001772561,0.005055677,0.1674746,0.01226452,0.004212209,0.05807217,0.002811224],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9944808,0.000006177947,0.001715771,0.0002723,0.00002497043,0.00005930383,0.000003336913,0.00004693781,0.003390333],"genre_scores_gemma":[0.9987613,0.000001668325,0.0002303604,0.0004474461,0.00005787868,0.000005185159,0.00002034098,0.00001241635,0.0004634074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5275089,"threshold_uncertainty_score":0.3714626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053637459","doi":"10.1007/s11750-007-0015-2","title":"Rejoinder on: Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":25,"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":"Scheme (mathematics); Pickup; Computer science; Classification scheme; Mathematical optimization; Operations research; Artificial intelligence; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03547897311900935,"gpt":0.242627689282041,"spread":0.2071487161630317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649255,0.00006237349,0.00005705713,0.00003974041,0.00003132431,0.00001558699,0.00001820189,0.00003664589,0.000005131578],"category_scores_gemma":[0.00004106688,0.00006138877,0.000003884169,0.00004021969,0.00002160902,0.00004973485,0.000007017014,0.00006674114,0.000003953845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002142625,"about_ca_system_score_gemma":0.000003119661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001471367,"about_ca_topic_score_gemma":0.00003267896,"domain_scores_codex":[0.9996605,0.000007838921,0.00008949781,0.0000951231,0.0000476772,0.00009939061],"domain_scores_gemma":[0.9997645,0.00008587723,0.00001514188,0.00007918703,0.00001891324,0.00003636575],"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.0001552061,0.0001140368,0.0306614,0.0008076456,0.000109023,0.00001817921,0.002439993,0.821153,0.004426534,0.009561374,0.002429318,0.1281243],"study_design_scores_gemma":[0.0009820765,0.0001387227,0.6753213,0.00008325104,0.00001843798,0.000009996242,0.0002026753,0.3128097,0.003618694,0.002709464,0.003586575,0.0005191272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5461168,0.0002336622,0.4513129,0.00003488721,0.00007605909,0.0001324811,0.000006222278,0.0001636026,0.00192346],"genre_scores_gemma":[0.988943,0.0001539657,0.01070041,0.00003299052,0.00001744102,0.000002948661,0.00001860967,0.00001145266,0.0001191529],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6446599,"threshold_uncertainty_score":0.2503361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070102492","doi":"10.1007/s11750-007-0018-z","title":"Nonhomogeneous geometric distributions with relations to birth and death processes","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Birth–death process; Queueing theory; Limiting; Geometric distribution; Applied mathematics; Random variable; Computer science; Mathematics; Probability distribution; Statistics; Demography; Population","retraction":null,"screen_n_in":null,"score":{"opus":0.02262526529466951,"gpt":0.2960162065460238,"spread":0.2733909412513543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001455633,0.00007855031,0.0001022371,0.0001371448,0.0001881883,0.00003345107,0.00006946184,0.00003154547,0.00004896014],"category_scores_gemma":[0.0002328582,0.00005989772,0.00001412906,0.001169249,0.00001529385,0.00004537902,0.00002355774,0.00005380918,0.00004180876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002326555,"about_ca_system_score_gemma":0.00003631896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002664693,"about_ca_topic_score_gemma":0.0001085538,"domain_scores_codex":[0.9994276,0.00000444783,0.0001442474,0.00014437,0.000111267,0.0001680516],"domain_scores_gemma":[0.9991963,0.0003686546,0.00004818789,0.0001726388,0.0001053888,0.0001088097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003383164,0.001610995,0.1765357,0.0008517848,0.0002567211,0.00007302256,0.003464959,0.0003204902,0.0005920257,0.7587547,0.01702729,0.04017405],"study_design_scores_gemma":[0.006225206,0.00113995,0.2210664,0.0002524988,0.0008006372,0.0007401026,0.001665347,0.0003092505,0.01212304,0.2001643,0.553337,0.002176206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6880058,0.0001522712,0.3054961,0.0003969474,0.000008036196,0.0003367864,0.00004536334,0.00008575501,0.005472945],"genre_scores_gemma":[0.9706659,0.00001943821,0.02680787,0.00003208118,0.00004879003,0.00004602755,0.000009252051,0.00001200908,0.002358597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5585904,"threshold_uncertainty_score":0.2442558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019304728","doi":"10.1007/s11750-020-00556-z","title":"Integrated cross-dock door assignment and truck scheduling with handling times","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; DOCK; Doors; Computer science; Scheduling (production processes); Metaheuristic; Job shop scheduling; Material handling; Operations research; Mathematical optimization; Engineering; Automotive engineering; Algorithm; Industrial engineering; Routing (electronic design automation); Computer network; Mathematics; Operating system; Marine engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01178055512020151,"gpt":0.220412502604642,"spread":0.2086319474844405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002248527,0.00009136032,0.0000913976,0.00001592848,0.00004659943,0.00005447768,0.00003597933,0.00003166002,0.00003820663],"category_scores_gemma":[0.00002700831,0.00007476941,0.000008410014,0.00005284485,0.00002295274,0.00007190407,0.00001244013,0.000101713,0.000008338613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001839632,"about_ca_system_score_gemma":0.000005940612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003274302,"about_ca_topic_score_gemma":7.234163e-7,"domain_scores_codex":[0.9996296,0.000003955581,0.00008451693,0.0001149357,0.00005542949,0.0001115457],"domain_scores_gemma":[0.9998307,0.00001963324,0.00001452927,0.00005686149,0.00001623546,0.00006204835],"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.00001453818,0.0000021601,0.0003193221,0.00003116138,0.00001295464,0.000003860814,0.0002174205,0.9960549,0.0003107279,0.0001405533,0.00002215273,0.002870216],"study_design_scores_gemma":[0.0005859359,0.0000779327,0.0003652771,0.00004456436,0.00001814869,0.000004223498,0.0001328982,0.9579315,0.03828591,0.0002295378,0.002093894,0.0002301517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1391546,0.0001973211,0.8589154,0.00008305157,0.00004856456,0.00006924554,0.00000370834,0.0003033014,0.001224821],"genre_scores_gemma":[0.9433659,0.00003182047,0.05636747,0.00005146331,0.00005150629,0.00000416758,0.00001018299,0.00001844595,0.00009905208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8042113,"threshold_uncertainty_score":0.3049008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997272816","doi":"10.1007/s11750-015-0383-y","title":"An optimization model for aggregation of prescribed burn units","year":2015,"lang":"en","type":"article","venue":"Top","topic":"Fire effects on ecosystems","field":"Environmental Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Fogarty International Center; Bushfire Cooperative Research Centre","keywords":"Computer science; Environmental science; Prescribed burn; Integer programming; Reduction (mathematics); Burn units; Firefighting; Operations research; Environmental resource management; Engineering; Mathematics; Ecology; Geography; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03052559114115289,"gpt":0.2477234362386516,"spread":0.2171978450974987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002236842,0.0000451739,0.00006274862,0.00001384568,0.00001851128,0.000007822351,0.00009360331,0.00003412139,0.00003639688],"category_scores_gemma":[0.00008102802,0.00004247064,0.000009468054,0.0001037199,0.00001889584,0.0002459031,0.00001741402,0.00001642976,0.00001716932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005667886,"about_ca_system_score_gemma":0.00001066416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002398473,"about_ca_topic_score_gemma":0.00004787793,"domain_scores_codex":[0.9995604,0.00002828648,0.00009907523,0.0001040665,0.0001268444,0.00008129253],"domain_scores_gemma":[0.999692,0.00001516439,0.00005954347,0.0001503502,0.00002535269,0.00005760719],"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.00001753365,0.00002398268,0.00118713,0.000007641142,0.000001351998,8.794161e-8,0.0006943152,0.9924426,0.001696068,0.00005533619,0.0007957112,0.00307825],"study_design_scores_gemma":[0.0002724831,0.00009878814,0.000158891,0.000006572483,0.000004665272,5.035307e-7,0.00002685289,0.9958599,0.003181673,0.0001864009,0.0001531174,0.00005019232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5269871,0.000009683507,0.4706819,0.00003934693,0.00007685397,0.0003895897,0.00001041145,0.00003385748,0.001771174],"genre_scores_gemma":[0.984281,5.875638e-7,0.01513163,0.00002139154,0.00001841137,0.0000227179,0.00002426859,0.000008202868,0.0004917772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4572939,"threshold_uncertainty_score":0.1731903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3143150125","doi":"10.1007/s11750-021-00599-w","title":"Less is more: discrete starting solutions in the planar p-median problem","year":2021,"lang":"en","type":"article","venue":"Top","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"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; Royal Ottawa Mental Health Centre","funders":"","keywords":"Planar; Fraction (chemistry); Context (archaeology); Mathematical optimization; Heuristic; Space (punctuation); Function (biology); Mathematics; Computer science; Quality (philosophy); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04703577719182994,"gpt":0.2531011366591965,"spread":0.2060653594673665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003958237,0.00008832081,0.00008449253,0.00007570725,0.0001909751,0.0001436048,0.0001920753,0.00002492501,0.0005548144],"category_scores_gemma":[0.00005068641,0.00007040631,0.00004372663,0.0005315797,0.00002896311,0.0003510461,0.00009156684,0.0001002488,0.000296457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001876253,"about_ca_system_score_gemma":0.00001692708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001934484,"about_ca_topic_score_gemma":0.004822726,"domain_scores_codex":[0.9991112,0.00001469017,0.0002146011,0.0001939379,0.0002115655,0.0002540273],"domain_scores_gemma":[0.9996303,0.00001125291,0.00003251381,0.0002628939,0.00005596526,0.00000711736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003610537,0.0006065666,0.06376442,0.001276379,0.0001134897,0.0001504868,0.01191725,0.004359207,0.0004910787,0.3377759,0.4988288,0.08068024],"study_design_scores_gemma":[0.0007864627,0.000006792887,0.05797115,0.0001014929,0.00007097957,0.000001371774,0.04188434,0.03975352,0.00007086528,0.01692777,0.841896,0.0005292651],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4801874,0.0003628276,0.002501163,0.3514211,0.0007914813,0.0008025384,0.00001863102,0.0002084383,0.1637065],"genre_scores_gemma":[0.9830731,0.00002084183,0.0002025061,0.01385127,0.0003259728,0.00005495874,0.00009008321,0.0000095943,0.002371656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5028857,"threshold_uncertainty_score":0.6074829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210677236","doi":"10.1007/s11750-021-00621-1","title":"A robust optimization approach for the unrelated parallel machine scheduling problem","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Job shop scheduling; Mathematical optimization; Robust optimization; Scheduling (production processes); Optimization problem; Algorithm; Schedule; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.022118782462847,"gpt":0.2124286741142084,"spread":0.1903098916513614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606779,0.0001053079,0.0000953437,0.00005302686,0.0003490075,0.00004162192,0.0001738037,0.00003830695,0.0001897948],"category_scores_gemma":[0.00002082207,0.0000883657,0.00004953554,0.000302688,0.0000122548,0.00005287171,0.00003943673,0.0002110975,0.000002091359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005221111,"about_ca_system_score_gemma":0.00001482103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007376815,"about_ca_topic_score_gemma":3.37023e-7,"domain_scores_codex":[0.9993609,0.00002333179,0.0001656452,0.0001417383,0.0001310938,0.0001773264],"domain_scores_gemma":[0.9996775,0.00006114061,0.00003032801,0.0001644129,0.0000331162,0.00003343411],"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.00001091631,0.00002011181,0.00001774031,0.00001689785,0.00003731906,2.95835e-7,0.0002323126,0.9980677,0.000004902927,0.0004046076,0.0001496113,0.001037543],"study_design_scores_gemma":[0.0005040264,0.00001928334,0.000003427306,0.000002350916,0.00002567673,0.000006911357,0.0002413686,0.9984831,0.00001548598,0.00003221025,0.0005447106,0.0001214562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001384455,0.0009301787,0.9958411,0.000228847,0.0002058898,0.0004399713,0.00001520487,0.0004143828,0.001785989],"genre_scores_gemma":[0.02386723,0.00004390531,0.9745748,0.00008175212,0.00007833092,0.0004385383,0.0002137246,0.00004764875,0.0006540785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02372879,"threshold_uncertainty_score":0.3603449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224271542","doi":"10.1007/s11750-022-00632-6","title":"Analysis of the selective traveling salesman problem with time-dependent profits","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Andalucía; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Solver; Profit (economics); Mathematical optimization; Computer science; Time horizon; Graph; Piecewise; Mathematics; Combinatorics; Operations research; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.007919825672221409,"gpt":0.2220018549562671,"spread":0.2140820292840457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003274769,0.00006993924,0.0001428474,0.00008623691,0.0000950414,0.000007460662,0.0001456719,0.00001712928,0.0001441273],"category_scores_gemma":[0.00001125271,0.00005427244,0.00004895159,0.001250234,0.00001253332,0.00002511196,0.00004550613,0.000152379,0.000001864181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007889682,"about_ca_system_score_gemma":0.00002449016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000118227,"about_ca_topic_score_gemma":0.000007402466,"domain_scores_codex":[0.9993216,0.000107265,0.0001379425,0.000109034,0.0002087392,0.0001153694],"domain_scores_gemma":[0.9996821,0.00003915638,0.00004829808,0.0001725774,0.00004001543,0.00001785295],"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.000005048592,0.000009905646,0.007901453,0.000009465743,0.0003060919,4.813188e-7,0.001030688,0.9876764,0.002022109,0.00004065406,0.0000213134,0.0009764055],"study_design_scores_gemma":[0.0001893306,0.000034893,0.009940992,0.000006617175,0.0003844659,0.000003831177,0.0001473857,0.9767359,0.01234428,0.00002293001,0.00007284648,0.0001165376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8973156,0.00006587718,0.08918643,0.0001064492,0.00007394803,0.000527629,0.00002945948,0.0003209729,0.01237368],"genre_scores_gemma":[0.9851324,8.317742e-7,0.01406526,0.00001433925,0.000009366173,0.00003461416,0.000005199031,0.00002155051,0.0007164261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08781686,"threshold_uncertainty_score":0.2213166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983527657","doi":"10.1007/s11750-012-0248-6","title":"Locating an axis-parallel rectangle on a Manhattan plane","year":2012,"lang":"en","type":"article","venue":"Top","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"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; Group for Research in Decision Analysis","funders":"","keywords":"Rectangle; Plane (geometry); Computer science; Geometry; Computer graphics (images); Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02860715197565399,"gpt":0.2774770682526244,"spread":0.2488699162769704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002172259,0.0000652377,0.00005696379,0.00006382598,0.00009424797,0.00005610308,0.0002086195,0.00002693147,0.00005372491],"category_scores_gemma":[0.00001954733,0.0000618415,0.00001670184,0.0002017683,0.000006572698,0.0004124712,0.00004085921,0.00005837457,0.0003224683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002401302,"about_ca_system_score_gemma":0.00001853392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000831556,"about_ca_topic_score_gemma":0.000003534883,"domain_scores_codex":[0.9993783,0.00004183202,0.00009347855,0.0001505765,0.0001562837,0.0001795038],"domain_scores_gemma":[0.9995798,0.00004685127,0.00003434427,0.0002225776,0.00002518332,0.00009127186],"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.00003164001,0.000533723,0.00229478,0.00002229186,0.00001843021,0.000009090974,0.004198099,0.01435552,0.005500897,0.4098977,0.006446803,0.5566911],"study_design_scores_gemma":[0.002474495,0.003009288,0.1649388,0.0001089237,0.00003053451,0.0003670476,0.0004114813,0.451577,0.0505245,0.01813902,0.3062527,0.00216619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4248011,0.0001541344,0.5562516,0.0005629409,0.0007082095,0.0001103255,0.000001206157,0.0001795544,0.01723091],"genre_scores_gemma":[0.9435997,6.886597e-7,0.05430335,0.0005178859,0.0003813405,0.000007045331,0.00001382538,0.000003897392,0.001172276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5545248,"threshold_uncertainty_score":0.4144785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289890653","doi":"10.1007/s11750-022-00638-0","title":"The robust multi-plant capacitated lot-sizing problem","year":2022,"lang":"en","type":"article","venue":"Top","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Sizing; Mathematical optimization; Robust optimization; Computer science; Duality (order theory); Integer programming; Production (economics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03978123903138762,"gpt":0.2059229303042696,"spread":0.166141691272882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005963695,0.0001294456,0.000100753,0.0001089463,0.00111633,0.0002719809,0.0003972049,0.00001587715,0.001028406],"category_scores_gemma":[0.00002705469,0.00009981976,0.00006000239,0.0003562612,0.00004244341,0.000279279,0.0004404123,0.0001748169,0.0002876302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006862247,"about_ca_system_score_gemma":0.0000101469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005418407,"about_ca_topic_score_gemma":0.000133273,"domain_scores_codex":[0.998931,0.00002234363,0.0002034087,0.0002199942,0.0002895528,0.0003337349],"domain_scores_gemma":[0.9995473,0.00002996674,0.0001190906,0.0002562309,0.00003749645,0.000009905618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001768958,0.0005956512,0.01426318,0.0003593101,0.0002607916,0.0001748585,0.001545772,0.01915676,0.0008043276,0.266345,0.662429,0.03388844],"study_design_scores_gemma":[0.0004590446,0.000009464832,0.0007671454,0.000008088641,0.00002215292,0.000002002654,0.002927885,0.02842072,0.00001694702,0.0006447508,0.9665452,0.0001766022],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3633259,0.002458562,0.003412956,0.03542397,0.01047716,0.005005692,0.0000631602,0.002557639,0.577275],"genre_scores_gemma":[0.9739255,0.0000197043,0.0004318542,0.006165755,0.0008586216,0.0003275557,0.00012221,0.00005538333,0.01809342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6105996,"threshold_uncertainty_score":0.9998848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053246538","doi":"10.1007/bf02579086","title":"Location and sizing of facilities on a line","year":2001,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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 Prince Edward Island","funders":"","keywords":"Sizing; Computer science; Facility location problem; Line (geometry); Process (computing); Mathematical optimization; Operations research; Dynamic programming; Decision process; Location-allocation; Algorithm; Management science; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01883895153642078,"gpt":0.2281545366980059,"spread":0.2093155851615851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001349688,0.00002735123,0.00003386253,0.00001933547,0.00000899388,0.000002511807,0.00001060976,0.00001369877,0.000006775465],"category_scores_gemma":[0.00001807599,0.00002686878,0.000003276423,0.00002320063,0.000008666179,0.00002117483,0.0000026177,0.0000214655,0.000001986699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006398169,"about_ca_system_score_gemma":9.449939e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005608881,"about_ca_topic_score_gemma":0.000001595942,"domain_scores_codex":[0.9998661,0.000001469425,0.00004378301,0.00003018737,0.00002236567,0.00003604087],"domain_scores_gemma":[0.9999178,0.00001651735,0.000006032954,0.0000415519,0.00000962935,0.000008475095],"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.000002725567,0.00000229787,0.00002892678,0.00003773366,0.000001610743,2.647919e-7,0.000157489,0.9892955,0.0001043914,0.0008802107,0.000008270457,0.009480605],"study_design_scores_gemma":[0.0005839252,0.0001979106,0.00256307,0.0001385803,0.00001381042,0.000007223642,0.0005273333,0.9046056,0.07285906,0.008614841,0.009584268,0.0003043626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1947556,0.0002650437,0.7993523,0.00003246583,0.00006266794,0.00003962903,0.000002149778,0.0001177506,0.00537239],"genre_scores_gemma":[0.9974926,0.0001523695,0.001949757,0.000005383901,0.00001693544,0.000001209908,0.000002585341,0.000003448416,0.0003757646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8027369,"threshold_uncertainty_score":0.1095677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3004178692","doi":"10.1007/s11750-020-00539-0","title":"Sharing pollution permits under welfare upper bounds","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Upper and lower bounds; Production (economics); Welfare; Mathematical optimization; Mathematical economics; Shapley value; Computer science; Economics; Game theory; Microeconomics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05322114604604006,"gpt":0.2280521492269449,"spread":0.1748310031809048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002226114,0.00008244276,0.0001787941,0.00004777883,0.0001192055,0.00006390161,0.0001548897,0.00006217176,0.001081698],"category_scores_gemma":[0.00004950092,0.00009573878,0.00006772595,0.0001281647,0.00001910462,0.0001216205,0.00004861236,0.00009580515,0.001718443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004186206,"about_ca_system_score_gemma":0.000004072901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005688547,"about_ca_topic_score_gemma":0.000002068856,"domain_scores_codex":[0.9992784,0.000008225689,0.0002542068,0.0002631119,0.00001900082,0.0001770356],"domain_scores_gemma":[0.9996563,0.000006412473,0.00009657274,0.0001591405,0.000008586781,0.00007302421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007682328,0.00001076676,0.02486166,0.00002608344,0.00001598945,0.000001399678,0.0008538251,0.0001376753,0.00004220003,0.9733977,0.0003619364,0.0002831166],"study_design_scores_gemma":[0.001385973,0.0001956928,0.1776192,0.00005497172,0.00001589601,0.00001989657,0.001536342,0.01028472,0.0003906502,0.1005523,0.7069982,0.0009460823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8650842,0.0008546271,0.001876169,0.01318701,0.0005272576,0.0001162408,0.00004263047,0.0001382507,0.1181736],"genre_scores_gemma":[0.9951651,0.000005268789,0.00004402223,0.001119818,0.0002597313,0.000004497119,0.00000605185,0.00001557187,0.003379914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8728454,"threshold_uncertainty_score":0.9998314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942743594","doi":"10.1007/s11750-019-00509-1","title":"A 2-class maintenance model with dynamic server behavior","year":2019,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polling system; Computer science; Queue; Polling; Bernoulli's principle; Function (biology); Mathematical optimization; Mathematics; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.006847424993105401,"gpt":0.2147827240944064,"spread":0.207935299101301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001217465,0.0001262641,0.0001543085,0.0000917781,0.00005535211,0.00006613944,0.0001937198,0.00003362098,0.0003949209],"category_scores_gemma":[0.00001278582,0.00009983712,0.00005356793,0.0002788186,0.00002967123,0.0007311034,0.00008424387,0.00009576505,0.001144554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000359855,"about_ca_system_score_gemma":0.000009149964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004237218,"about_ca_topic_score_gemma":0.00008571399,"domain_scores_codex":[0.9992705,0.000003572975,0.0001111163,0.0002447888,0.0001462668,0.0002237382],"domain_scores_gemma":[0.9994402,0.000009927636,0.0001015892,0.0003598528,0.00008098928,0.00000746763],"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.000563212,0.0004061921,0.07750417,0.0004246623,0.0001906128,0.0001374935,0.0001555142,0.4451398,0.006085907,0.4551444,0.00167049,0.01257757],"study_design_scores_gemma":[0.0008725062,0.0000135369,0.003534644,0.00008079437,0.0002206595,0.000003962985,0.0001637776,0.9707934,0.00005123894,0.01562552,0.008167663,0.0004722942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9783758,0.00001077589,0.005114217,0.0003678158,0.00006035364,0.0001744812,0.000001230183,0.0001436554,0.0157517],"genre_scores_gemma":[0.9784627,9.914883e-7,0.000693213,0.001067916,0.00005746523,0.00002278143,0.00001124578,0.00002866535,0.01965505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5256536,"threshold_uncertainty_score":0.9996332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400005792","doi":"10.1007/s11750-024-00678-8","title":"Gaining insight into crew rostering instances through ML-based sequential assignment","year":2024,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Crew; Operations research; Mathematical optimization; Mathematics; Aeronautics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2028994966871165,"gpt":0.4339951749443921,"spread":0.2310956782572756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001504662,0.0001497568,0.0002167025,0.0002148923,0.0003115879,0.0008775956,0.0004195769,0.00007583859,0.00076243],"category_scores_gemma":[0.0006883026,0.0001124163,0.0001390302,0.0009644449,0.0001028078,0.0004898134,0.0001092518,0.000207107,0.0009499796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009510283,"about_ca_system_score_gemma":0.0002336125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001111176,"about_ca_topic_score_gemma":0.00003509798,"domain_scores_codex":[0.9976119,0.000129409,0.0004643723,0.0005361158,0.0009471541,0.0003110397],"domain_scores_gemma":[0.99861,0.0006981019,0.00007246354,0.00043777,0.00009272099,0.00008891735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002125566,0.000424229,0.009015137,0.0002026151,0.000442146,0.000687589,0.05595665,0.1022284,0.04019071,0.140798,0.01892691,0.630915],"study_design_scores_gemma":[0.0005657276,0.0001504842,0.0008490472,0.0003992057,0.00006815762,0.00001614746,0.001250623,0.1084702,0.02026937,0.05696641,0.8104392,0.000555403],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3264486,0.007973621,0.5675785,0.006273282,0.005930064,0.0002580408,0.00001932452,0.0007877175,0.0847308],"genre_scores_gemma":[0.9846448,0.00001352753,0.01252788,0.0004200899,0.0003075609,0.00001752668,0.000004927283,0.00001631336,0.002047402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7915123,"threshold_uncertainty_score":0.9998279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005484777","doi":"10.1007/bf02578956","title":"On self-regular IPMs","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"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":"Mathematics; Duality gap; Conic section; Duality (order theory); Conic optimization; Dual (grammatical number); Mathematical optimization; Semidefinite programming; Interior point method; Optimization problem; Point (geometry); Discrete mathematics; Convex optimization; Subderivative","retraction":null,"screen_n_in":null,"score":{"opus":0.03151550688129424,"gpt":0.3562669717050758,"spread":0.3247514648237816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001003164,0.00007141424,0.00008726627,0.00005545167,0.00005599662,0.00001402896,0.0001168661,0.00004225722,0.000292174],"category_scores_gemma":[0.0002510728,0.00006343943,0.00002868762,0.0001517835,0.00002019542,0.00005814523,0.0000319844,0.000107233,0.0003530602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009864614,"about_ca_system_score_gemma":0.00003595321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003024154,"about_ca_topic_score_gemma":0.000001427007,"domain_scores_codex":[0.9993184,0.00001644204,0.0001031788,0.000131782,0.0002552695,0.0001749334],"domain_scores_gemma":[0.9994869,0.00009636494,0.0000264388,0.0002711797,0.00005655674,0.00006256394],"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.00001776623,0.0003928168,0.00001148141,0.00004314266,0.00003401857,0.00004147471,0.0007319354,0.01617427,0.0002086901,0.9743366,0.002284801,0.005722975],"study_design_scores_gemma":[0.001203162,0.0001186194,0.00002736627,0.00002996213,0.000008200785,0.000009891682,0.00006304912,0.002748227,0.01311609,0.9775422,0.004949333,0.000183914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05343114,0.00005127376,0.893056,0.001801127,0.000183718,0.0005831607,0.000006053869,0.0008010761,0.05008644],"genre_scores_gemma":[0.04522171,0.00002220956,0.9487628,0.0003065903,0.0001234296,0.00002984981,0.000004826783,0.00005126559,0.005477262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05570684,"threshold_uncertainty_score":0.4537993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750960109","doi":"10.1007/s11750-017-0459-y","title":"Rejoinder on: Continuous approximation models in freight distribution management","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":1,"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":"Computer science; Distribution (mathematics); Operations research; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02932625531412885,"gpt":0.2087014729923287,"spread":0.1793752176781999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005905765,0.00007854214,0.00009048143,0.00002622333,0.00005424864,0.00003664791,0.0001163896,0.00005052685,0.00002538758],"category_scores_gemma":[0.000002787945,0.00007648538,0.00002114484,0.00002295034,0.00002171284,0.0001035789,0.000008373913,0.00008346413,0.00003764568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005367218,"about_ca_system_score_gemma":0.000001569987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001074679,"about_ca_topic_score_gemma":0.0000122028,"domain_scores_codex":[0.999562,0.000003489521,0.0001177347,0.00009743203,0.00008500208,0.0001343597],"domain_scores_gemma":[0.9996472,0.000004362695,0.00001932529,0.0002950335,0.000008597238,0.00002550718],"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.00003960122,0.0001510983,0.004206121,0.0002517647,0.00007070669,0.0002105187,0.0003557836,0.1199738,0.00008974884,0.8359886,0.009807173,0.02885507],"study_design_scores_gemma":[0.001999822,0.0000551246,0.1245578,0.0001563342,0.00004877578,0.000003310673,0.00005808564,0.8013615,0.001895298,0.04569343,0.02356169,0.0006088584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09542461,0.0001410674,0.4641583,0.0001556433,0.0005908301,0.0003987833,0.0000676187,0.0002897895,0.4387734],"genre_scores_gemma":[0.9987742,0.00004357195,0.0005177792,0.00001599194,0.00004443574,0.0000153502,0.00007932945,0.00001020271,0.0004991264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9033496,"threshold_uncertainty_score":0.3118983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006474481","doi":"10.1007/s11750-013-0276-x","title":"Comments on: Multicriteria decision systems for financial problems","year":2013,"lang":"en","type":"article","venue":"Top","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Computer science; Mathematical economics; Management science; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.08747867990037758,"gpt":0.374426833849148,"spread":0.2869481539487705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007754719,0.00009889442,0.000185266,0.0001263153,0.0001467058,0.0003622267,0.0003326306,0.00007737762,0.0002834487],"category_scores_gemma":[0.001126876,0.00006703332,0.00006254713,0.0002270332,0.00002065019,0.0002636352,0.00004124708,0.00004623948,0.00128513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002028363,"about_ca_system_score_gemma":0.00002515801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009934777,"about_ca_topic_score_gemma":0.000003795295,"domain_scores_codex":[0.9984905,0.00005359352,0.0004636577,0.0002781483,0.000518857,0.0001952576],"domain_scores_gemma":[0.9984456,0.0006286905,0.0001438819,0.0003803872,0.0003176429,0.00008376144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006812455,0.0001230284,0.005146535,0.000006070982,0.000005119452,0.000001198534,0.0004955422,0.0106032,0.0001530656,0.002536638,0.6456157,0.3352458],"study_design_scores_gemma":[0.001282848,0.0003014461,0.01459279,0.00006107125,0.000007034565,0.000003701166,0.0001152262,0.1838917,0.0002021126,0.02169347,0.777609,0.0002396611],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7109023,0.0003020837,0.27163,0.001458109,0.005193302,0.003019342,0.00004938333,0.0000978422,0.007347588],"genre_scores_gemma":[0.985129,0.00008874698,0.007330671,0.0006516538,0.000297289,0.0002728396,0.0000187714,0.00001532237,0.00619571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3350061,"threshold_uncertainty_score":0.9994925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029444715","doi":"10.1007/s11750-020-00569-8","title":"Stability of utility functions and apportionment rules in location models","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Apportionment; Expected utility hypothesis; Utility theory; Process (computing); Stability (learning theory); Computer science; Operations research; Mathematical economics; Mathematical optimization; Economics; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.06143634744202692,"gpt":0.2376720738271291,"spread":0.1762357263851022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001949201,0.00004428368,0.00007738934,0.00003169521,0.00002707952,0.00001862656,0.00003198873,0.00001719679,0.0002495882],"category_scores_gemma":[0.00003584391,0.00004432206,0.00001358389,0.0001578568,0.00002341386,0.0003076861,0.00005256412,0.00004106014,0.000008263231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006036334,"about_ca_system_score_gemma":0.000008510232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000507934,"about_ca_topic_score_gemma":0.00007410882,"domain_scores_codex":[0.9995915,0.000006331356,0.0001535773,0.0001183929,0.00007022474,0.00006001886],"domain_scores_gemma":[0.9998121,0.00001363101,0.00005019335,0.00007901101,0.00003859328,0.000006494545],"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.00004459078,0.0000655871,0.9363855,0.0002293735,0.000003405849,4.783841e-7,0.0002343207,0.00006208479,0.000416524,0.00119231,0.00009408985,0.06127181],"study_design_scores_gemma":[0.0002448903,0.000004016546,0.9493672,0.0000138613,0.0000309665,1.034626e-7,0.0005658634,0.04642979,0.00008975764,0.001759771,0.001410782,0.00008297403],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9908118,0.00006574895,0.002989778,0.0005888346,0.00003005917,0.0001155712,0.000001860879,0.00002235498,0.005374025],"genre_scores_gemma":[0.9997873,0.000003564064,0.00003395626,0.0001191937,0.00002753984,0.000006412267,0.00001000033,0.000002741461,0.000009333295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06118883,"threshold_uncertainty_score":0.2732816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079045924","doi":"10.1007/s11750-011-0184-x","title":"Comments on: Light tail asymptotics in multidimensional reflecting processes for queueing networks","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical physics; Computer science; Applied mathematics; Mathematics; Mathematical economics; Physics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.04618520478188533,"gpt":0.2826010092351892,"spread":0.2364158044533039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003820496,0.0001510147,0.0001875539,0.0001834623,0.0001856098,0.0000411669,0.0001539312,0.00006017716,0.00006592598],"category_scores_gemma":[0.0004320281,0.0001418893,0.00005056331,0.0004909303,0.00001935449,0.0004782431,0.00009358796,0.0001326835,0.00003465307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003764807,"about_ca_system_score_gemma":0.00001082741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005580181,"about_ca_topic_score_gemma":0.0001440815,"domain_scores_codex":[0.9990895,0.00001125601,0.000247709,0.0002576354,0.0001011059,0.0002928404],"domain_scores_gemma":[0.9993478,0.0001534206,0.0001817469,0.0001717549,0.0001350517,0.00001023505],"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.002965838,0.002535108,0.227137,0.00197744,0.0005528911,0.0001378455,0.002940599,0.1720558,0.001741974,0.5189821,0.008733636,0.06023976],"study_design_scores_gemma":[0.009206987,0.0002886279,0.01182409,0.002992031,0.0007355825,0.000008550584,0.002886837,0.541596,0.009094742,0.2107393,0.2067598,0.003867414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8641297,0.0003757621,0.06198469,0.002987301,0.001285214,0.001386531,0.00000322651,0.0007232061,0.06712433],"genre_scores_gemma":[0.9933998,0.000003526957,0.00341229,0.002236177,0.0005191109,0.00003513947,0.00001345768,0.0000330138,0.000347492],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3695402,"threshold_uncertainty_score":0.5786078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790139429","doi":"10.1007/s11750-018-0468-5","title":"Comments on: Disruption management in vehicle routing and scheduling for road freight transport: a review","year":2018,"lang":"en","type":"review","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Vehicle routing problem; Computer science; Scheduling (production processes); Transport engineering; Operations research; Routing (electronic design automation); Operations management; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0571982485782732,"gpt":0.3558061633112891,"spread":0.2986079147330159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009153085,0.0003059963,0.0008791791,0.0001396216,0.00005713907,0.00002249705,0.0001571356,0.0001501879,0.00002306503],"category_scores_gemma":[0.00003432516,0.0002928495,0.0001500778,0.0002905735,0.00001511378,0.00006382218,0.00002768384,0.0002245079,0.00001719739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001403716,"about_ca_system_score_gemma":0.000009525098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002434057,"about_ca_topic_score_gemma":0.00000152122,"domain_scores_codex":[0.9985242,0.0001005941,0.0006503456,0.0003230562,0.0001250102,0.0002767867],"domain_scores_gemma":[0.9994234,0.00008731948,0.0001218603,0.0002906862,0.00001954933,0.00005713965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001328452,0.00001244568,0.000007288517,0.05418668,0.00006229534,0.000003722524,0.00003889274,0.0006274876,5.150026e-8,0.0001423215,0.00007166468,0.9448458],"study_design_scores_gemma":[0.0004875128,0.00003342991,0.00003173071,0.1191749,0.0005830718,0.000005365118,0.00000877541,0.03467052,0.000001200439,0.00002802314,0.8444609,0.0005145367],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00002015871,0.9773089,0.01962898,0.00003195132,0.0001953465,0.001565692,0.00001766385,0.0001399316,0.001091421],"genre_scores_gemma":[0.00002114249,0.95732,0.04193469,0.00009915822,0.0001122386,0.00025985,0.00008842909,0.00008065424,0.00008384822],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9443313,"threshold_uncertainty_score":0.9999524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626465488","doi":"10.1007/s11750-017-0452-5","title":"Rejoinder on: On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"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":"Branching (polymer chemistry); Computer science; Mathematical economics; Mathematics; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.062619957460186,"gpt":0.3566546196720717,"spread":0.2940346622118857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009093171,0.00006728055,0.00009338198,0.00006474716,0.0004323338,0.0005373359,0.0005200176,0.00003069065,0.00006216135],"category_scores_gemma":[0.001652456,0.00005813434,0.00001347217,0.0000597965,0.00004414569,0.000152458,0.0002336873,0.0002092045,0.0001485146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001102058,"about_ca_system_score_gemma":0.00003022079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005133052,"about_ca_topic_score_gemma":0.000005298348,"domain_scores_codex":[0.9990241,0.0001778887,0.00008367503,0.0002677537,0.0002839686,0.0001626129],"domain_scores_gemma":[0.9989799,0.0002523822,0.0000610319,0.0005604035,0.00005980515,0.00008647521],"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.00008514574,0.0002210876,0.07950943,0.00003850107,0.00005723605,0.0001456093,0.001396749,0.003672882,0.00009939378,0.08836782,0.007598888,0.8188072],"study_design_scores_gemma":[0.0008384205,0.0003086886,0.434366,0.00003591177,0.000001684073,0.00001016536,0.000006443071,0.5454634,0.0004259339,0.001013366,0.01726913,0.0002608045],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06056235,0.00007180245,0.8148466,0.005681566,0.000775029,0.0003239123,0.000003396736,0.0002245627,0.1175108],"genre_scores_gemma":[0.9659223,0.00003029526,0.02058487,0.0002681629,0.00007607834,0.000004739658,0.000001762829,0.00001058972,0.01310124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9053599,"threshold_uncertainty_score":0.5181543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}