{"meta":{"query_hash":"381b769beff3","filters":{"venue":"Top"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/381b769beff3","api":"https://metacan.xera.ac/api/v1/cohort?venue=Top"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028607151975653985,"score_gpt":0.27747706825262436,"score_spread":0.24886991627697036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983527657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4248011,0.00015413438,0.5562516,0.0005629409,0.00070820947,0.00011032546,0.0000012061574,0.00017955436,0.017230907],"genre_scores_gemma":[0.9435997,6.886597e-7,0.054303348,0.0005178859,0.00038134048,0.000007045331,0.000013825378,0.000003897392,0.0011722756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.000041832023,0.00009347855,0.00015057648,0.00015628367,0.00017950378],"domain_scores_gemma":[0.9995798,0.000046851274,0.000034344266,0.00022257761,0.000025183324,0.00009127186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021722593,0.0000652377,0.000056963785,0.00006382598,0.000094247975,0.00005610308,0.00020861946,0.000026931473,0.00005372491],"category_scores_gemma":[0.000019547335,0.0000618415,0.00001670184,0.00020176826,0.0000065726977,0.0004124712,0.000040859213,0.000058374568,0.00032246832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031640007,0.000533723,0.0022947802,0.000022291864,0.000018430208,0.000009090974,0.0041980986,0.014355523,0.005500897,0.40989769,0.0064468035,0.55669105],"study_design_scores_gemma":[0.0024744947,0.0030092876,0.16493881,0.000108923705,0.000030534513,0.00036704764,0.00041148133,0.45157698,0.050524503,0.018139018,0.30625275,0.00216619],"about_ca_topic_score_codex":0.00000831556,"about_ca_topic_score_gemma":0.0000035348835,"teacher_disagreement_score":0.55452484,"about_ca_system_score_codex":0.000024013023,"about_ca_system_score_gemma":0.000018533923,"threshold_uncertainty_score":0.41447854},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030525591141152893,"score_gpt":0.24772343623865162,"score_spread":0.21719784509749873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997272816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52698714,0.0000096835065,0.47068194,0.00003934693,0.00007685397,0.0003895897,0.000010411448,0.00003385748,0.0017711743],"genre_scores_gemma":[0.984281,5.875638e-7,0.01513163,0.000021391535,0.000018411374,0.000022717899,0.000024268587,0.000008202868,0.0004917772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.000028286477,0.00009907523,0.00010406649,0.00012684439,0.00008129253],"domain_scores_gemma":[0.99969196,0.000015164393,0.000059543472,0.00015035024,0.000025352687,0.000057607187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022368415,0.000045173896,0.00006274862,0.000013845679,0.000018511279,0.000007822351,0.00009360331,0.000034121393,0.000036396876],"category_scores_gemma":[0.00008102802,0.000042470645,0.0000094680545,0.00010371986,0.000018895844,0.00024590312,0.000017414019,0.000016429763,0.000017169315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001753365,0.000023982682,0.0011871298,0.0000076411425,0.0000013519978,8.7941615e-8,0.00069431524,0.9924426,0.0016960677,0.000055336193,0.00079571124,0.0030782504],"study_design_scores_gemma":[0.00027248313,0.000098788136,0.00015889097,0.0000065724835,0.0000046652717,5.035307e-7,0.000026852893,0.99585986,0.003181673,0.00018640091,0.00015311743,0.00005019232],"about_ca_topic_score_codex":0.00023984733,"about_ca_topic_score_gemma":0.000047877926,"teacher_disagreement_score":0.45729387,"about_ca_system_score_codex":0.00005667886,"about_ca_system_score_gemma":0.000010664158,"threshold_uncertainty_score":0.17319027},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031515506881294245,"score_gpt":0.3562669717050758,"score_spread":0.3247514648237816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005484777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05343114,0.000051273764,0.89305604,0.001801127,0.00018371797,0.0005831607,0.0000060538687,0.00080107606,0.05008644],"genre_scores_gemma":[0.045221712,0.000022209562,0.94876283,0.0003065903,0.00012342956,0.000029849813,0.0000048267825,0.00005126559,0.0054772617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993184,0.000016442043,0.0001031788,0.00013178198,0.00025526946,0.00017493343],"domain_scores_gemma":[0.9994869,0.000096364936,0.000026438798,0.00027117974,0.000056556742,0.00006256394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010031637,0.000071414244,0.00008726627,0.00005545167,0.000055996625,0.00001402896,0.0001168661,0.000042257216,0.000292174],"category_scores_gemma":[0.00025107284,0.00006343943,0.000028687624,0.00015178353,0.000020195415,0.00005814523,0.000031984404,0.00010723305,0.00035306023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017766228,0.00039281682,0.00001148141,0.00004314266,0.00003401857,0.000041474712,0.0007319354,0.016174274,0.00020869006,0.9743366,0.002284801,0.0057229754],"study_design_scores_gemma":[0.0012031615,0.00011861939,0.000027366266,0.000029962133,0.0000082007855,0.000009891682,0.00006304912,0.0027482267,0.013116091,0.97754216,0.004949333,0.00018391403],"about_ca_topic_score_codex":0.0000030241542,"about_ca_topic_score_gemma":0.0000014270073,"teacher_disagreement_score":0.05570684,"about_ca_system_score_codex":0.00009864614,"about_ca_system_score_gemma":0.000035953206,"threshold_uncertainty_score":0.45379928},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Computer science; Mathematical economics; Management science; Economics","score_opus":0.08747867990037758,"score_gpt":0.37442683384914804,"score_spread":0.2869481539487705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006474481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71090233,0.00030208373,0.27163,0.0014581092,0.0051933024,0.0030193415,0.00004938333,0.000097842196,0.007347588],"genre_scores_gemma":[0.985129,0.00008874698,0.007330671,0.0006516538,0.000297289,0.00027283956,0.000018771403,0.000015322372,0.0061957096],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984905,0.00005359352,0.00046365772,0.00027814833,0.000518857,0.00019525764],"domain_scores_gemma":[0.99844563,0.00062869047,0.00014388195,0.0003803872,0.0003176429,0.00008376144],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077547185,0.00009889442,0.00018526599,0.00012631525,0.00014670582,0.00036222665,0.00033263065,0.00007737762,0.00028344867],"category_scores_gemma":[0.0011268758,0.000067033325,0.00006254713,0.00022703319,0.000020650194,0.00026363524,0.000041247084,0.00004623948,0.0012851299],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006812455,0.00012302844,0.005146535,0.0000060709817,0.0000051194515,0.0000011985336,0.00049554225,0.010603196,0.0001530656,0.0025366384,0.6456157,0.33524576],"study_design_scores_gemma":[0.001282848,0.00030144613,0.014592786,0.00006107125,0.000007034565,0.0000037011657,0.00011522616,0.18389165,0.00020211264,0.021693474,0.777609,0.00023966107],"about_ca_topic_score_codex":0.000099347766,"about_ca_topic_score_gemma":0.000003795295,"teacher_disagreement_score":0.33500612,"about_ca_system_score_codex":0.000020283635,"about_ca_system_score_gemma":0.000025158011,"threshold_uncertainty_score":0.99949247},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03343292112571488,"score_gpt":0.24563083175669856,"score_spread":0.21219791063098367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029570945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024346137,0.000088944165,0.97076166,0.00010192575,0.00009451591,0.0006974816,0.000014960807,0.0004993855,0.003394979],"genre_scores_gemma":[0.71080655,0.0000020014159,0.2884996,0.00010754935,0.00007069117,0.00012596091,0.0000096432495,0.00007811574,0.00029989338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989291,0.0000777426,0.00022386486,0.00020079172,0.00015419688,0.00041432644],"domain_scores_gemma":[0.9990478,0.00033385688,0.00004079589,0.0003051755,0.00019692065,0.00007543998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056874426,0.00017543742,0.00018453455,0.00004949019,0.0001926785,0.000054908218,0.00023653982,0.000067343346,0.00018023448],"category_scores_gemma":[0.00007429517,0.00012874676,0.00002838452,0.0004984835,0.00002804006,0.00010222916,0.00003397669,0.00018057716,0.00002333553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005637811,0.000021825163,0.00013130557,0.00010535748,0.00011125372,0.0000013056051,0.0038957626,0.98772204,0.0010034442,0.005588122,0.000104355495,0.0012588571],"study_design_scores_gemma":[0.00081242097,0.000055669967,0.00016982919,0.00004615004,0.00007426618,0.000009070388,0.00025948725,0.996435,0.001307561,0.00058903836,0.000047495665,0.000194031],"about_ca_topic_score_codex":0.00020651789,"about_ca_topic_score_gemma":0.000010835438,"teacher_disagreement_score":0.6864604,"about_ca_system_score_codex":0.00004709245,"about_ca_system_score_gemma":0.000052729,"threshold_uncertainty_score":0.52501404},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018838951536420782,"score_gpt":0.22815453669800587,"score_spread":0.20931558516158508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053246538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1947556,0.0002650437,0.7993523,0.00003246583,0.00006266794,0.000039629034,0.0000021497783,0.00011775062,0.00537239],"genre_scores_gemma":[0.99749255,0.00015236954,0.0019497573,0.000005383901,0.000016935443,0.0000012099083,0.0000025853406,0.0000034484156,0.00037576456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998661,0.0000014694251,0.00004378301,0.000030187368,0.000022365673,0.00003604087],"domain_scores_gemma":[0.9999178,0.000016517351,0.0000060329544,0.000041551903,0.00000962935,0.0000084750955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000013496878,0.000027351232,0.000033862532,0.000019335466,0.00000899388,0.0000025118075,0.0000106097605,0.000013698773,0.0000067754654],"category_scores_gemma":[0.000018075987,0.000026868782,0.000003276423,0.00002320063,0.000008666179,0.000021174832,0.0000026177001,0.000021465505,0.0000019866986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027255671,0.00000229787,0.000028926783,0.000037733662,0.0000016107431,2.6479194e-7,0.000157489,0.9892955,0.0001043914,0.00088021066,0.000008270457,0.009480605],"study_design_scores_gemma":[0.0005839252,0.00019791062,0.0025630698,0.00013858028,0.000013810415,0.0000072236417,0.0005273333,0.9046056,0.072859064,0.008614841,0.009584268,0.0003043626],"about_ca_topic_score_codex":0.000005608881,"about_ca_topic_score_gemma":0.0000015959419,"teacher_disagreement_score":0.80273694,"about_ca_system_score_codex":0.000006398169,"about_ca_system_score_gemma":9.4499393e-7,"threshold_uncertainty_score":0.10956771},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03547897311900935,"score_gpt":0.24262768928204104,"score_spread":0.20714871616303168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053637459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54611677,0.00023366223,0.45131287,0.00003488721,0.00007605909,0.00013248113,0.000006222278,0.00016360263,0.0019234602],"genre_scores_gemma":[0.98894304,0.00015396565,0.010700406,0.000032990516,0.000017441022,0.0000029486614,0.000018609671,0.000011452656,0.000119152915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9996605,0.000007838921,0.000089497815,0.000095123105,0.000047677204,0.000099390614],"domain_scores_gemma":[0.9997645,0.000085877226,0.000015141877,0.000079187026,0.000018913242,0.000036365753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016492548,0.00006237349,0.000057057132,0.000039740415,0.00003132431,0.000015586995,0.00001820189,0.000036645888,0.000005131578],"category_scores_gemma":[0.000041066884,0.00006138877,0.000003884169,0.00004021969,0.000021609023,0.000049734852,0.0000070170145,0.000066741144,0.000003953845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015520614,0.000114036775,0.030661399,0.0008076456,0.00010902304,0.000018179207,0.0024399932,0.821153,0.004426534,0.009561374,0.0024293184,0.12812433],"study_design_scores_gemma":[0.0009820765,0.00013872272,0.6753213,0.00008325104,0.000018437975,0.000009996242,0.00020267526,0.31280968,0.0036186941,0.0027094642,0.0035865752,0.00051912724],"about_ca_topic_score_codex":0.00001471367,"about_ca_topic_score_gemma":0.000032678956,"teacher_disagreement_score":0.6446599,"about_ca_system_score_codex":0.00002142625,"about_ca_system_score_gemma":0.000003119661,"threshold_uncertainty_score":0.25033614},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"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","score_opus":0.024233844463323818,"score_gpt":0.2493872648064071,"score_spread":0.22515342034308328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064073889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031986177,0.00033132397,0.9502391,0.0008089262,0.00011873733,0.0009719498,0.000016616581,0.0008050103,0.014722111],"genre_scores_gemma":[0.7343801,0.000023395763,0.26047015,0.00010367796,0.00027138312,0.00006623803,0.0000053841936,0.000101517115,0.0045781685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992626,0.000034985256,0.00014727235,0.00012524807,0.00014222806,0.00028771773],"domain_scores_gemma":[0.99930596,0.00033667812,0.000021763877,0.00022651337,0.00006300286,0.00004610383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039526648,0.00010604446,0.00011055618,0.000027828999,0.00015106855,0.0000582756,0.00015696208,0.000046402474,0.00018138885],"category_scores_gemma":[0.00006134572,0.000077357414,0.000028124858,0.00020649836,0.000029619501,0.000057914134,0.000023813684,0.00015319258,0.00009006178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062077474,0.000013088542,0.00077082147,0.000041835076,0.000035812187,0.0000017648192,0.0008035445,0.9721953,0.00084284774,0.00032288724,0.0018600016,0.023105891],"study_design_scores_gemma":[0.00033224368,0.00003361114,0.00023960535,0.000017985662,0.000018340024,0.0000055884398,0.000039363378,0.99363494,0.0014964769,0.000021250611,0.004042822,0.00011778705],"about_ca_topic_score_codex":0.0000052126834,"about_ca_topic_score_gemma":0.0000010000678,"teacher_disagreement_score":0.70239395,"about_ca_system_score_codex":0.000036716552,"about_ca_system_score_gemma":0.000007290779,"threshold_uncertainty_score":0.31545436},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022625265294669513,"score_gpt":0.29601620654602384,"score_spread":0.2733909412513543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070102492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6880058,0.00015227117,0.30549607,0.0003969474,0.000008036196,0.00033678635,0.000045363337,0.00008575501,0.0054729446],"genre_scores_gemma":[0.97066593,0.000019438212,0.02680787,0.00003208118,0.000048790032,0.000046027548,0.000009252051,0.000012009075,0.0023585968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994276,0.0000044478297,0.0001442474,0.00014436997,0.00011126698,0.00016805156],"domain_scores_gemma":[0.9991963,0.00036865458,0.000048187885,0.00017263879,0.00010538878,0.00010880968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014556329,0.00007855031,0.00010223713,0.00013714483,0.00018818826,0.00003345107,0.000069461836,0.000031545467,0.00004896014],"category_scores_gemma":[0.00023285816,0.00005989772,0.000014129056,0.0011692486,0.000015293846,0.000045379016,0.00002355774,0.000053809177,0.000041808762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033831643,0.001610995,0.17653568,0.0008517848,0.00025672108,0.00007302256,0.003464959,0.0003204902,0.0005920257,0.7587547,0.017027294,0.04017405],"study_design_scores_gemma":[0.006225206,0.0011399498,0.22106642,0.00025249884,0.00080063724,0.00074010255,0.0016653466,0.00030925046,0.012123041,0.20016432,0.55333704,0.002176206],"about_ca_topic_score_codex":0.000026646927,"about_ca_topic_score_gemma":0.0001085538,"teacher_disagreement_score":0.55859035,"about_ca_system_score_codex":0.000023265547,"about_ca_system_score_gemma":0.000036318957,"threshold_uncertainty_score":0.24425581},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical physics; Computer science; Applied mathematics; Mathematics; Mathematical economics; Physics; Computer network","score_opus":0.04618520478188533,"score_gpt":0.2826010092351892,"score_spread":0.2364158044533039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079045924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641297,0.0003757621,0.06198469,0.0029873007,0.0012852137,0.0013865307,0.0000032265104,0.0007232061,0.06712433],"genre_scores_gemma":[0.9933998,0.0000035269566,0.0034122898,0.002236177,0.0005191109,0.00003513947,0.000013457685,0.000033013795,0.00034749202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.0000112560065,0.00024770902,0.00025763543,0.00010110593,0.00029284038],"domain_scores_gemma":[0.9993478,0.00015342057,0.00018174686,0.00017175493,0.00013505174,0.00001023505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038204962,0.00015101465,0.0001875539,0.0001834623,0.00018560975,0.000041166895,0.0001539312,0.000060177157,0.00006592598],"category_scores_gemma":[0.00043202812,0.00014188931,0.000050563314,0.0004909303,0.000019354487,0.0004782431,0.00009358796,0.00013268355,0.000034653065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002965838,0.0025351082,0.227137,0.0019774397,0.00055289106,0.00013784548,0.0029405986,0.17205583,0.0017419743,0.5189821,0.008733636,0.060239762],"study_design_scores_gemma":[0.009206987,0.0002886279,0.011824092,0.0029920312,0.0007355825,0.0000085505835,0.0028868369,0.541596,0.009094742,0.21073931,0.20675984,0.0038674143],"about_ca_topic_score_codex":0.000055801807,"about_ca_topic_score_gemma":0.0001440815,"teacher_disagreement_score":0.36954015,"about_ca_system_score_codex":0.00003764807,"about_ca_system_score_gemma":0.000010827412,"threshold_uncertainty_score":0.5786078},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043283522705910266,"score_gpt":0.2781970216619149,"score_spread":0.23491349895600463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082772228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7882364,0.00020622229,0.21060239,0.000029990153,0.000038561488,0.000088783505,0.0000027442634,0.00012837256,0.00066655444],"genre_scores_gemma":[0.8928355,0.00008988332,0.10691175,0.000031157804,0.000016292775,0.0000029665377,0.000008487296,0.000015646745,0.00008832739],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99956626,0.00003670699,0.00012869308,0.00009534163,0.000056764446,0.00011625674],"domain_scores_gemma":[0.9996618,0.00015169119,0.000018204555,0.000086590626,0.00003348055,0.00004822787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000821259,0.000060363156,0.000069978196,0.00004923469,0.00002987634,0.000024780753,0.000027365464,0.00004146662,0.0000107705455],"category_scores_gemma":[0.00009217707,0.00006434755,0.000004928948,0.00011513008,0.000021870255,0.000072231414,0.000012607693,0.0000645386,0.0000042974502],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041051466,0.000056122113,0.6493103,0.000719587,0.00010190253,0.0000074892782,0.004311624,0.030944014,0.044129636,0.0018017439,0.0013499755,0.26722655],"study_design_scores_gemma":[0.00025303318,0.000015028792,0.57468826,0.000019763795,0.0000058441615,0.0000047899402,0.0000772764,0.42333278,0.00072670705,0.00007691541,0.0006716143,0.00012799392],"about_ca_topic_score_codex":0.00003039256,"about_ca_topic_score_gemma":0.000033511966,"teacher_disagreement_score":0.39238876,"about_ca_system_score_codex":0.000020999785,"about_ca_system_score_gemma":0.000006006006,"threshold_uncertainty_score":0.2624017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Center (category theory); Interactive voice response; Speech recognition; Telecommunications","score_opus":0.010601963183506742,"score_gpt":0.23429033216820486,"score_spread":0.22368836898469813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092214701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99448085,0.0000061779474,0.0017157713,0.00027230004,0.000024970426,0.000059303835,0.0000033369129,0.00004693781,0.0033903334],"genre_scores_gemma":[0.9987613,0.0000016683248,0.00023036037,0.0004474461,0.00005787868,0.0000051851594,0.000020340978,0.000012416347,0.0004634074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993253,0.00001761302,0.00016977591,0.00018252696,0.00015170075,0.00015313207],"domain_scores_gemma":[0.99919546,0.000067409586,0.00020461739,0.00026362907,0.00026036106,0.000008533328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027221654,0.00011338847,0.00023280698,0.00057315174,0.00006583198,0.000030162388,0.00016248951,0.000024958339,0.000102410115],"category_scores_gemma":[0.00014576981,0.00009109206,0.00006585587,0.0026087174,0.000058343503,0.00074107305,0.00006907823,0.000089925335,0.00007475266],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.022004588,0.00081342633,0.24460694,0.00030220317,0.0070927823,0.00013166465,0.0037169482,0.69498354,0.0055648535,0.012144123,0.00021689534,0.008422037],"study_design_scores_gemma":[0.010854289,0.0004923922,0.7193371,0.0012066354,0.018201385,0.000017725606,0.005055677,0.16747463,0.012264522,0.0042122095,0.058072172,0.0028112235],"about_ca_topic_score_codex":0.00018906376,"about_ca_topic_score_gemma":0.00019211492,"teacher_disagreement_score":0.5275089,"about_ca_system_score_codex":0.000048232083,"about_ca_system_score_gemma":0.000017819024,"threshold_uncertainty_score":0.37146264},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016824630452904037,"score_gpt":0.2971222359018433,"score_spread":0.2802976054489392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626188202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8591509,0.00007560853,0.105470516,0.0017250848,0.00045297857,0.000051010637,5.9525104e-7,0.00020361839,0.03286968],"genre_scores_gemma":[0.99406254,0.0000044317276,0.0021381981,0.00008508097,0.000046442707,7.296581e-7,4.93617e-7,0.0000033233987,0.003658749],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99952066,0.000075036514,0.000044038607,0.00016991491,0.00008307377,0.00010728169],"domain_scores_gemma":[0.99950325,0.00010594161,0.000048703572,0.0002879138,0.000011540505,0.00004265852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041522086,0.00005139152,0.00006455649,0.000021924878,0.00044307578,0.00034642985,0.00034197964,0.00001873197,0.000010691613],"category_scores_gemma":[0.00042152018,0.00004335913,0.000012059913,0.000020677988,0.000020616322,0.00011989504,0.00015588185,0.00017745295,0.000047933874],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064534092,0.000023474022,0.18782139,0.000007773461,0.000008176416,0.000020457499,0.0007220657,0.00015621225,0.000065472,0.029469108,0.00051781366,0.78118163],"study_design_scores_gemma":[0.00034038548,0.00013737538,0.85280097,0.000022549844,0.0000010430692,0.000009612394,0.000003063278,0.13126987,0.00009889476,0.00274663,0.012409019,0.00016059111],"about_ca_topic_score_codex":0.00029319452,"about_ca_topic_score_gemma":0.000011633781,"teacher_disagreement_score":0.781021,"about_ca_system_score_codex":0.0000029656112,"about_ca_system_score_gemma":0.000007670036,"threshold_uncertainty_score":0.34078255},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branching (polymer chemistry); Computer science; Mathematical economics; Mathematics; Chemistry","score_opus":0.062619957460186,"score_gpt":0.3566546196720717,"score_spread":0.2940346622118857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626465488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060562346,0.00007180245,0.8148466,0.005681566,0.000775029,0.00032391227,0.0000033967358,0.00022456267,0.11751083],"genre_scores_gemma":[0.9659223,0.000030295258,0.020584868,0.00026816287,0.000076078344,0.000004739658,0.0000017628286,0.000010589724,0.013101235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990241,0.0001778887,0.00008367503,0.00026775367,0.00028396858,0.00016261285],"domain_scores_gemma":[0.9989799,0.0002523822,0.000061031904,0.0005604035,0.00005980515,0.000086475215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009093171,0.00006728055,0.000093381976,0.00006474716,0.00043233376,0.00053733593,0.00052001764,0.00003069065,0.00006216135],"category_scores_gemma":[0.0016524555,0.000058134345,0.000013472166,0.000059796497,0.000044145694,0.00015245803,0.00023368734,0.00020920449,0.00014851465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085145744,0.00022108764,0.07950943,0.00003850107,0.00005723605,0.00014560926,0.0013967489,0.003672882,0.00009939378,0.08836782,0.007598888,0.81880724],"study_design_scores_gemma":[0.00083842047,0.00030868864,0.434366,0.00003591177,0.0000016840731,0.000010165357,0.0000064430706,0.54546344,0.00042593386,0.0010133659,0.017269127,0.00026080452],"about_ca_topic_score_codex":0.000051330517,"about_ca_topic_score_gemma":0.0000052983482,"teacher_disagreement_score":0.9053599,"about_ca_system_score_codex":0.000011020577,"about_ca_system_score_gemma":0.00003022079,"threshold_uncertainty_score":0.51815426},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Distribution (mathematics); Operations research; Mathematical optimization; Mathematics","score_opus":0.029326255314128854,"score_gpt":0.20870147299232875,"score_spread":0.1793752176781999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750960109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09542461,0.00014106739,0.46415827,0.00015564331,0.00059083005,0.00039878333,0.000067618705,0.00028978952,0.4387734],"genre_scores_gemma":[0.99877423,0.00004357195,0.0005177792,0.000015991938,0.000044435736,0.000015350195,0.00007932945,0.0000102027125,0.0004991264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956197,0.0000034895209,0.00011773474,0.00009743203,0.00008500208,0.0001343597],"domain_scores_gemma":[0.9996472,0.000004362695,0.000019325285,0.00029503353,0.000008597238,0.000025507175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059057653,0.00007854214,0.00009048143,0.000026223333,0.000054248638,0.00003664791,0.000116389616,0.000050526854,0.000025387584],"category_scores_gemma":[0.000002787945,0.000076485376,0.000021144842,0.000022950338,0.000021712844,0.00010357894,0.000008373913,0.00008346413,0.00003764568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003960122,0.00015109828,0.0042061205,0.00025176472,0.000070706694,0.00021051869,0.00035578362,0.11997377,0.000089748835,0.83598864,0.009807173,0.02885507],"study_design_scores_gemma":[0.0019998215,0.0000551246,0.124557786,0.0001563342,0.000048775775,0.0000033106726,0.00005808564,0.8013615,0.0018952981,0.045693427,0.023561686,0.00060885836],"about_ca_topic_score_codex":0.000010746795,"about_ca_topic_score_gemma":0.0000122028,"teacher_disagreement_score":0.9033496,"about_ca_system_score_codex":0.000053672182,"about_ca_system_score_gemma":0.0000015699873,"threshold_uncertainty_score":0.3118983},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0571982485782732,"score_gpt":0.3558061633112891,"score_spread":0.2986079147330159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790139429","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020158706,0.97730887,0.019628985,0.000031951316,0.00019534647,0.0015656922,0.000017663853,0.00013993162,0.0010914213],"genre_scores_gemma":[0.000021142492,0.95732,0.041934688,0.00009915822,0.00011223859,0.00025985,0.000088429086,0.00008065424,0.000083848216],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985242,0.0001005941,0.0006503456,0.00032305619,0.00012501016,0.0002767867],"domain_scores_gemma":[0.99942344,0.00008731948,0.00012186026,0.0002906862,0.000019549327,0.000057139652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009153085,0.00030599633,0.0008791791,0.00013962164,0.000057139074,0.00002249705,0.00015713561,0.00015018789,0.000023065031],"category_scores_gemma":[0.000034325156,0.00029284952,0.00015007782,0.00029057352,0.000015113782,0.00006382218,0.000027683838,0.00022450792,0.000017197388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013284517,0.000012445678,0.000007288517,0.05418668,0.000062295345,0.0000037225236,0.000038892744,0.0006274876,5.150026e-8,0.0001423215,0.00007166468,0.9448458],"study_design_scores_gemma":[0.00048751276,0.000033429907,0.000031730713,0.11917492,0.0005830718,0.0000053651183,0.00000877541,0.034670524,0.0000012004394,0.00002802314,0.8444609,0.0005145367],"about_ca_topic_score_codex":0.0000024340568,"about_ca_topic_score_gemma":0.0000015212205,"teacher_disagreement_score":0.9443313,"about_ca_system_score_codex":0.0001403716,"about_ca_system_score_gemma":0.000009525098,"threshold_uncertainty_score":0.9999524},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polling system; Computer science; Queue; Polling; Bernoulli's principle; Function (biology); Mathematical optimization; Mathematics; Computer network; Engineering","score_opus":0.006847424993105401,"score_gpt":0.21478272409440638,"score_spread":0.20793529910130099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942743594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783758,0.000010775885,0.0051142173,0.00036781575,0.000060353635,0.00017448122,0.0000012301826,0.00014365544,0.0157517],"genre_scores_gemma":[0.9784627,9.914883e-7,0.00069321296,0.0010679163,0.00005746523,0.000022781427,0.000011245778,0.000028665347,0.01965505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.000003572975,0.00011111632,0.00024478883,0.00014626682,0.00022373824],"domain_scores_gemma":[0.9994402,0.000009927636,0.00010158919,0.00035985277,0.00008098928,0.00000746763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012174651,0.00012626412,0.00015430852,0.0000917781,0.00005535211,0.00006613944,0.00019371978,0.000033620978,0.0003949209],"category_scores_gemma":[0.000012785825,0.00009983712,0.00005356793,0.00027881862,0.000029671233,0.0007311034,0.000084243875,0.00009576505,0.001144554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000563212,0.00040619206,0.07750417,0.00042466234,0.0001906128,0.00013749351,0.00015551424,0.4451398,0.006085907,0.4551444,0.0016704898,0.012577568],"study_design_scores_gemma":[0.0008725062,0.0000135368955,0.0035346444,0.000080794365,0.00022065947,0.000003962985,0.00016377759,0.9707934,0.000051238938,0.015625518,0.008167663,0.00047229417],"about_ca_topic_score_codex":0.00004237218,"about_ca_topic_score_gemma":0.00008571399,"teacher_disagreement_score":0.5256536,"about_ca_system_score_codex":0.000035985504,"about_ca_system_score_gemma":0.000009149964,"threshold_uncertainty_score":0.9996332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.053221146046040065,"score_gpt":0.2280521492269449,"score_spread":0.17483100318090483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004178692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86508423,0.0008546271,0.0018761687,0.013187012,0.00052725757,0.00011624083,0.00004263047,0.00013825066,0.11817357],"genre_scores_gemma":[0.9951651,0.000005268789,0.00004402223,0.0011198183,0.00025973126,0.000004497119,0.0000060518496,0.000015571872,0.003379914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992784,0.000008225689,0.0002542068,0.0002631119,0.000019000816,0.0001770356],"domain_scores_gemma":[0.99965626,0.000006412473,0.00009657274,0.0001591405,0.000008586781,0.00007302421],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002226114,0.000082442755,0.00017879406,0.00004777883,0.00011920553,0.00006390161,0.00015488965,0.000062171755,0.0010816979],"category_scores_gemma":[0.00004950092,0.00009573878,0.00006772595,0.00012816468,0.000019104622,0.000121620484,0.00004861236,0.00009580515,0.0017184434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007682328,0.00001076676,0.024861662,0.00002608344,0.000015989453,0.0000013996782,0.0008538251,0.00013767528,0.000042200027,0.9733977,0.0003619364,0.00028311665],"study_design_scores_gemma":[0.0013859731,0.00019569283,0.17761925,0.000054971722,0.000015896008,0.000019896574,0.0015363418,0.01028472,0.00039065024,0.10055227,0.7069982,0.0009460823],"about_ca_topic_score_codex":0.000056885474,"about_ca_topic_score_gemma":0.0000020688565,"teacher_disagreement_score":0.8728454,"about_ca_system_score_codex":0.00004186206,"about_ca_system_score_gemma":0.0000040729005,"threshold_uncertainty_score":0.99983144},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011780555120201514,"score_gpt":0.220412502604642,"score_spread":0.2086319474844405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019304728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13915455,0.00019732113,0.85891545,0.00008305157,0.000048564558,0.000069245536,0.0000037083396,0.0003033014,0.0012248214],"genre_scores_gemma":[0.9433659,0.000031820466,0.056367468,0.000051463307,0.00005150629,0.00000416758,0.000010182992,0.00001844595,0.00009905208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996296,0.000003955581,0.000084516934,0.000114935654,0.000055429493,0.000111545654],"domain_scores_gemma":[0.99983066,0.000019633237,0.0000145292715,0.000056861492,0.000016235457,0.00006204835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022485268,0.00009136032,0.000091397604,0.000015928481,0.000046599434,0.000054477685,0.00003597933,0.000031660016,0.00003820663],"category_scores_gemma":[0.000027008311,0.000074769414,0.000008410014,0.00005284485,0.000022952743,0.00007190407,0.000012440132,0.000101712954,0.000008338613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014538179,0.0000021601002,0.00031932208,0.000031161377,0.000012954643,0.0000038608136,0.00021742049,0.99605495,0.0003107279,0.00014055327,0.000022152728,0.002870216],"study_design_scores_gemma":[0.0005859359,0.0000779327,0.00036527705,0.000044564364,0.000018148688,0.000004223498,0.00013289817,0.9579315,0.03828591,0.00022953778,0.0020938942,0.0002301517],"about_ca_topic_score_codex":0.0000032743023,"about_ca_topic_score_gemma":7.234163e-7,"teacher_disagreement_score":0.8042113,"about_ca_system_score_codex":0.000018396318,"about_ca_system_score_gemma":0.0000059406116,"threshold_uncertainty_score":0.30490083},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06143634744202692,"score_gpt":0.2376720738271291,"score_spread":0.17623572638510218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029444715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99081177,0.00006574895,0.0029897783,0.00058883463,0.000030059171,0.00011557117,0.000001860879,0.000022354976,0.005374025],"genre_scores_gemma":[0.9997873,0.0000035640637,0.000033956258,0.00011919372,0.00002753984,0.0000064122673,0.000010000329,0.0000027414615,0.000009333295],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99959147,0.0000063313555,0.0001535773,0.00011839288,0.00007022474,0.000060018858],"domain_scores_gemma":[0.99981207,0.000013631009,0.000050193354,0.000079011006,0.000038593276,0.0000064945452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019492011,0.000044283675,0.00007738934,0.000031695214,0.000027079515,0.00001862656,0.00003198873,0.000017196786,0.00024958822],"category_scores_gemma":[0.000035843907,0.00004432206,0.000013583892,0.00015785679,0.00002341386,0.0003076861,0.000052564123,0.00004106014,0.000008263231],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004459078,0.000065587104,0.93638545,0.00022937349,0.0000034058494,4.783841e-7,0.00023432073,0.00006208479,0.00041652404,0.0011923099,0.000094089846,0.06127181],"study_design_scores_gemma":[0.0002448903,0.0000040165464,0.9493672,0.000013861302,0.0000309665,1.0346263e-7,0.00056586345,0.04642979,0.00008975764,0.0017597707,0.0014107825,0.00008297403],"about_ca_topic_score_codex":0.00050793396,"about_ca_topic_score_gemma":0.000074108815,"teacher_disagreement_score":0.061188832,"about_ca_system_score_codex":0.000006036334,"about_ca_system_score_gemma":0.000008510232,"threshold_uncertainty_score":0.2732816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04703577719182994,"score_gpt":0.2531011366591965,"score_spread":0.20606535946736654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143150125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48018742,0.00036282756,0.0025011632,0.35142106,0.0007914813,0.00080253836,0.000018631024,0.00020843832,0.16370647],"genre_scores_gemma":[0.9830731,0.000020841833,0.00020250605,0.013851268,0.00032597277,0.00005495874,0.00009008321,0.0000095943,0.0023716555],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991112,0.000014690173,0.00021460114,0.0001939379,0.00021156552,0.00025402725],"domain_scores_gemma":[0.9996303,0.000011252912,0.000032513806,0.00026289385,0.00005596526,0.0000071173604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039582368,0.00008832081,0.00008449253,0.00007570725,0.00019097509,0.00014360476,0.00019207533,0.000024925008,0.00055481435],"category_scores_gemma":[0.00005068641,0.00007040631,0.00004372663,0.00053157966,0.000028963108,0.0003510461,0.00009156684,0.00010024879,0.00029645697],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003610537,0.0006065666,0.06376442,0.0012763789,0.00011348967,0.00015048684,0.0119172465,0.0043592067,0.00049107865,0.33777595,0.49882883,0.080680236],"study_design_scores_gemma":[0.00078646274,0.0000067928872,0.057971153,0.000101492915,0.00007097957,0.0000013717745,0.04188434,0.039753515,0.00007086528,0.016927768,0.841896,0.0005292651],"about_ca_topic_score_codex":0.0019344835,"about_ca_topic_score_gemma":0.0048227264,"teacher_disagreement_score":0.5028857,"about_ca_system_score_codex":0.000018762528,"about_ca_system_score_gemma":0.000016927079,"threshold_uncertainty_score":0.60748285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022118782462847,"score_gpt":0.21242867411420843,"score_spread":0.19030989165136142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210677236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013844547,0.00093017874,0.9958411,0.00022884704,0.00020588984,0.00043997128,0.000015204869,0.00041438275,0.0017859894],"genre_scores_gemma":[0.023867235,0.000043905307,0.9745748,0.00008175212,0.00007833092,0.00043853826,0.00021372463,0.00004764875,0.0006540785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936086,0.00002333179,0.00016564518,0.0001417383,0.00013109382,0.00017732636],"domain_scores_gemma":[0.99967754,0.000061140614,0.000030328009,0.00016441286,0.000033116205,0.00003343411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606779,0.00010530793,0.0000953437,0.000053026855,0.0003490075,0.000041621915,0.00017380367,0.000038306953,0.00018979481],"category_scores_gemma":[0.000020822072,0.0000883657,0.000049535538,0.00030268801,0.0000122548,0.00005287171,0.000039436727,0.00021109746,0.0000020913592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010916312,0.000020111813,0.000017740313,0.000016897848,0.000037319056,2.9583504e-7,0.00023231258,0.99806774,0.0000049029272,0.00040460762,0.00014961128,0.0010375426],"study_design_scores_gemma":[0.0005040264,0.00001928334,0.0000034273062,0.0000023509165,0.000025676734,0.000006911357,0.00024136859,0.9984831,0.000015485983,0.00003221025,0.00054471055,0.000121456236],"about_ca_topic_score_codex":0.0000073768147,"about_ca_topic_score_gemma":3.37023e-7,"teacher_disagreement_score":0.023728788,"about_ca_system_score_codex":0.000052211108,"about_ca_system_score_gemma":0.000014821029,"threshold_uncertainty_score":0.36034486},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007919825672221409,"score_gpt":0.22200185495626706,"score_spread":0.21408202928404566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224271542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89731556,0.00006587718,0.08918643,0.00010644916,0.00007394803,0.000527629,0.000029459483,0.0003209729,0.012373676],"genre_scores_gemma":[0.9851324,8.317742e-7,0.014065259,0.00001433925,0.000009366173,0.00003461416,0.0000051990305,0.000021550512,0.0007164261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932164,0.000107265,0.0001379425,0.000109034045,0.0002087392,0.00011536936],"domain_scores_gemma":[0.9996821,0.00003915638,0.00004829808,0.00017257736,0.000040015428,0.000017852948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032747685,0.00006993924,0.00014284742,0.000086236905,0.000095041396,0.0000074606623,0.00014567192,0.000017129281,0.00014412735],"category_scores_gemma":[0.000011252711,0.00005427244,0.000048951588,0.0012502344,0.000012533323,0.000025111964,0.000045506134,0.00015237904,0.0000018641814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005048592,0.000009905646,0.007901453,0.0000094657435,0.00030609188,4.8131875e-7,0.0010306878,0.9876764,0.0020221088,0.000040654064,0.000021313397,0.00097640546],"study_design_scores_gemma":[0.0001893306,0.000034893004,0.009940992,0.0000066171747,0.00038446588,0.000003831177,0.00014738571,0.9767359,0.012344283,0.000022930015,0.00007284648,0.00011653756],"about_ca_topic_score_codex":0.000011822698,"about_ca_topic_score_gemma":0.0000074024656,"teacher_disagreement_score":0.08781686,"about_ca_system_score_codex":0.00007889682,"about_ca_system_score_gemma":0.000024490162,"threshold_uncertainty_score":0.22131659},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Sizing; Mathematical optimization; Robust optimization; Computer science; Duality (order theory); Integer programming; Production (economics); Mathematics","score_opus":0.03978123903138762,"score_gpt":0.20592293030426959,"score_spread":0.16614169127288198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289890653","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36332586,0.002458562,0.003412956,0.035423968,0.010477164,0.0050056917,0.0000631602,0.0025576386,0.577275],"genre_scores_gemma":[0.9739255,0.000019704297,0.00043185416,0.0061657545,0.0008586216,0.00032755572,0.00012221,0.00005538333,0.018093416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998931,0.000022343633,0.00020340872,0.00021999417,0.00028955285,0.00033373493],"domain_scores_gemma":[0.9995473,0.000029966743,0.00011909057,0.0002562309,0.00003749645,0.000009905618],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005963695,0.00012944562,0.000100753015,0.000108946326,0.0011163302,0.00027198094,0.0003972049,0.000015877153,0.0010284055],"category_scores_gemma":[0.000027054686,0.000099819765,0.00006000239,0.00035626124,0.000042443407,0.000279279,0.00044041232,0.00017481693,0.00028763022],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017689576,0.00059565116,0.014263184,0.0003593101,0.00026079162,0.00017485848,0.0015457717,0.019156758,0.0008043276,0.266345,0.66242903,0.03388844],"study_design_scores_gemma":[0.00045904456,0.000009464832,0.0007671454,0.000008088641,0.000022152917,0.0000020026541,0.0029278852,0.028420718,0.000016947024,0.00064475083,0.9665452,0.00017660217],"about_ca_topic_score_codex":0.00054184074,"about_ca_topic_score_gemma":0.00013327299,"teacher_disagreement_score":0.61059964,"about_ca_system_score_codex":0.000068622474,"about_ca_system_score_gemma":0.000010146904,"threshold_uncertainty_score":0.9998848},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.20289949668711652,"score_gpt":0.4339951749443921,"score_spread":0.2310956782572756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400005792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32644862,0.007973621,0.5675785,0.006273282,0.005930064,0.0002580408,0.000019324523,0.0007877175,0.084730804],"genre_scores_gemma":[0.9846448,0.000013527535,0.012527882,0.00042008993,0.00030756093,0.000017526676,0.0000049272826,0.000016313365,0.0020474019],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976119,0.00012940899,0.0004643723,0.00053611584,0.0009471541,0.00031103965],"domain_scores_gemma":[0.99861,0.0006981019,0.00007246354,0.00043777004,0.00009272099,0.00008891735],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015046616,0.0001497568,0.00021670251,0.00021489225,0.0003115879,0.0008775956,0.00041957686,0.000075838594,0.00076242996],"category_scores_gemma":[0.0006883026,0.00011241633,0.00013903019,0.00096444495,0.00010280784,0.0004898134,0.00010925176,0.000207107,0.0009499796],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021255658,0.00042422905,0.009015137,0.00020261515,0.00044214597,0.000687589,0.05595665,0.10222842,0.040190708,0.14079802,0.018926913,0.63091505],"study_design_scores_gemma":[0.00056572765,0.0001504842,0.00084904715,0.0003992057,0.00006815762,0.000016147464,0.001250623,0.10847017,0.020269372,0.056966413,0.8104392,0.000555403],"about_ca_topic_score_codex":0.00011111757,"about_ca_topic_score_gemma":0.00003509798,"teacher_disagreement_score":0.7915123,"about_ca_system_score_codex":0.000095102834,"about_ca_system_score_gemma":0.00023361253,"threshold_uncertainty_score":0.9998279},"labels":[],"label_agreement":null}]}