{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":352,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":352,"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":"a5dc42673ba5","filters":{"venue":"Annals of Operations Research"}},"results":[{"id":"W2132083787","doi":"10.1007/s10479-005-5724-z","title":"A Tutorial on the Cross-Entropy Method","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3031,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Cross-entropy method; Theory of computation; Computer science; Cross entropy; Combinatorial optimization; Entropy (arrow of time); Mathematical optimization; Theoretical computer science; Algorithm; Artificial intelligence; Principle of maximum entropy; Mathematics; Quadratic assignment problem","retraction":null,"screen_n_in":null,"score":{"opus":0.7469201458343675,"gpt":0.7038611654305066,"spread":0.04305898040386091,"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.0109282,0.00006538819,0.000120602,0.0003047116,0.0007632008,0.0005526304,0.0009151429,0.00005797087,0.00283126],"category_scores_gemma":[0.006395958,0.00003731597,0.00009733613,0.001328962,0.0002132569,0.0002550446,0.000128367,0.0002602399,0.0008858083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001498613,"about_ca_system_score_gemma":0.0001324426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009192531,"about_ca_topic_score_gemma":0.00003599249,"domain_scores_codex":[0.9964803,0.0006582986,0.0005007505,0.0002876558,0.001840397,0.0002325558],"domain_scores_gemma":[0.9927452,0.003584718,0.00003776972,0.0009158737,0.002642674,0.0000738311],"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.00003329898,0.0001651226,0.0001719366,5.223367e-7,0.000008950096,2.208397e-7,0.0003443305,0.0284142,0.003220234,0.7754803,0.1440886,0.04807227],"study_design_scores_gemma":[0.0001768862,0.0001611509,0.002531968,0.000007048666,0.000001262759,0.000001103462,0.0002320933,0.07853699,0.1335881,0.05263213,0.7320391,0.00009210775],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5715542,0.0001337939,0.08853139,0.2631303,0.0002184905,0.001982301,0.0001286116,0.0001042734,0.07421663],"genre_scores_gemma":[0.9796631,0.00002769645,0.007908563,0.0007017552,0.0004675444,0.0001452796,0.000003793905,0.000007124551,0.01107511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7228481,"threshold_uncertainty_score":0.9998921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039568841","doi":"10.1007/s10479-005-3971-7","title":"Metaheuristics in Combinatorial Optimization","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2341,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metaheuristic; Theory of computation; Combinatorial optimization; Vehicle routing problem; Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Job shop scheduling; Parallel metaheuristic; Optimization problem; Management science; Routing (electronic design automation); Mathematics; Artificial intelligence; Algorithm; Engineering; Meta-optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.1739552011743806,"gpt":0.4498479164768863,"spread":0.2758927153025057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001806021,0.00006721008,0.0001295994,0.0004075045,0.00007860686,0.00005094167,0.0001606528,0.00007223764,0.0001278967],"category_scores_gemma":[0.0007425012,0.00007442567,0.00002467669,0.0008637326,0.00005392783,0.0002294562,0.00003386732,0.0002451775,0.00002360497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003257729,"about_ca_system_score_gemma":0.00005382407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002899226,"about_ca_topic_score_gemma":0.00002564732,"domain_scores_codex":[0.998749,0.0002483758,0.0003235797,0.0001098283,0.0003298387,0.0002393589],"domain_scores_gemma":[0.9990183,0.0001584609,0.000007775972,0.0002081037,0.0005536016,0.00005382813],"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.000003795724,0.00005095291,0.0001131219,0.00001217642,0.000008325391,5.83909e-7,0.0001989639,0.989912,0.0003328483,0.006137669,0.000705043,0.002524525],"study_design_scores_gemma":[0.000208221,0.00002460924,0.0002093537,0.00001289949,0.000001236254,5.801477e-7,0.00003546771,0.9876408,0.01052601,0.0000933867,0.001180302,0.00006712203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050064,0.00116394,0.7450065,0.004615061,0.0006410421,0.001123278,0.00004384453,0.0003361799,0.04206377],"genre_scores_gemma":[0.8192676,0.0003657105,0.1800403,0.000019953,0.0001109574,0.00002476209,0.00001803813,0.0000216911,0.0001310062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6142612,"threshold_uncertainty_score":0.3034991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124659975","doi":"10.1007/s10479-007-0176-2","title":"An overview of bilevel optimization","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1430,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Theory of computation; Mathematical optimization; Simple (philosophy); Computer science; Connection (principal bundle); Focus (optics); Mathematical economics; Optimization problem; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.4883983889418265,"gpt":0.5434584453478315,"spread":0.05506005640600498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002746118,0.0000534294,0.0001208022,0.0005853513,0.0001619282,0.00007823329,0.0005489948,0.00004445078,0.0001833346],"category_scores_gemma":[0.0002446724,0.00004849176,0.00005165728,0.001969727,0.00006233132,0.0007713058,0.00008446159,0.00007972075,0.00001090619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008941021,"about_ca_system_score_gemma":0.000169296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001881041,"about_ca_topic_score_gemma":0.00006541425,"domain_scores_codex":[0.9984534,0.0001805055,0.0003693868,0.000187629,0.00062915,0.0001799374],"domain_scores_gemma":[0.9966739,0.0001289276,0.0000395626,0.0004434092,0.002625829,0.00008834497],"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.000004032194,0.0001965255,0.0001558569,0.000009480978,0.00001657831,4.361599e-7,0.0002636451,0.6956886,0.0007331767,0.2987503,0.0002094435,0.003971916],"study_design_scores_gemma":[0.00008969718,0.0001113249,0.003092787,0.00001230278,0.000001864651,6.926124e-7,0.00004512491,0.9853575,0.01031124,0.0006793385,0.0002414992,0.00005660742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002560046,0.0002252815,0.9928588,0.002475069,0.00002429137,0.0001192536,0.000007702633,0.00001670519,0.00171282],"genre_scores_gemma":[0.7460229,0.0005586738,0.2529365,0.0001591463,0.00002871485,0.000005868654,0.00003342189,0.000004915044,0.000249912],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7434629,"threshold_uncertainty_score":0.2007385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980402561","doi":"10.1007/s10479-007-0170-8","title":"The dial-a-ride problem: models and algorithms","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":866,"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":"Theory of computation; Computer science; Pickup; Set (abstract data type); Algorithm; Plan (archaeology); Operations research; Mathematical optimization; Artificial intelligence; Mathematics; Image (mathematics); Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.2232401521553075,"gpt":0.4375832282891854,"spread":0.2143430761338779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001827753,0.0000485646,0.0000605294,0.000137411,0.0003162255,0.00006231108,0.00009963238,0.00003541509,0.00001411597],"category_scores_gemma":[0.000055795,0.00003780518,0.00001796195,0.0004487543,0.0001472335,0.0001877822,0.00001063617,0.0001724604,0.000006178715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006568681,"about_ca_system_score_gemma":0.0000385552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001172464,"about_ca_topic_score_gemma":0.000938016,"domain_scores_codex":[0.9991661,0.00002433162,0.0002555095,0.00008196009,0.0002480404,0.0002240345],"domain_scores_gemma":[0.9990133,0.0001788823,0.000004699823,0.0001693694,0.0005796226,0.00005413841],"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.00003000342,0.0001552091,0.0004288066,0.0001084754,0.0001402355,0.000005757282,0.00469288,0.4373589,0.01831761,0.3998563,0.01886559,0.1200402],"study_design_scores_gemma":[0.0009681208,0.0003006987,0.04592885,0.0001006355,0.000015626,0.00001363065,0.004031778,0.7143519,0.1109757,0.02457868,0.09814661,0.0005878328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.846376,0.001462038,0.1110085,0.007927733,0.0001291263,0.001068958,0.00006878083,0.0001576015,0.03180124],"genre_scores_gemma":[0.9965191,0.000890446,0.001964832,0.00002995259,0.00002938472,0.00004436231,0.00001535586,0.000009463059,0.0004970605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3752777,"threshold_uncertainty_score":0.2432183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107650959","doi":"10.1007/s10479-006-0026-7","title":"DEA models for supply chain efficiency evaluation","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":462,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Supply chain; Data envelopment analysis; Context (archaeology); Computer science; Supply chain management; Measure (data warehouse); Theory of computation; Service management; Chain (unit); Operations research; Microeconomics; Business; Mathematical optimization; Economics; Marketing; Mathematics; Data mining; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.5687705235917271,"gpt":0.5828705551331151,"spread":0.01410003154138806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03780138,0.0001162555,0.0002772417,0.001497775,0.0008566994,0.0004683611,0.001027932,0.00009144752,0.0003579922],"category_scores_gemma":[0.009814096,0.0000916163,0.0002008885,0.003458016,0.0003335376,0.0006188379,0.0001183869,0.000167754,0.0001336142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004048995,"about_ca_system_score_gemma":0.0006467256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009025089,"about_ca_topic_score_gemma":0.0009429976,"domain_scores_codex":[0.9918458,0.00109654,0.0009910897,0.0006090974,0.00492382,0.0005336027],"domain_scores_gemma":[0.9853854,0.002245076,0.00008188979,0.0009204244,0.01128456,0.00008265681],"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.00001985225,0.0002902831,0.0001885995,0.000003567179,0.000008578011,4.03503e-7,0.0002715115,0.903582,0.003534446,0.0641112,0.01935673,0.008632828],"study_design_scores_gemma":[0.000221439,0.0001388114,0.0008606012,0.00001160273,0.000007732077,7.993711e-7,0.0002757631,0.9099612,0.008777705,0.07810546,0.001545339,0.00009355793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7606298,0.001068329,0.208573,0.0126131,0.0001175038,0.001622984,0.0001040746,0.00002756055,0.01524359],"genre_scores_gemma":[0.9930328,0.00001941835,0.002907983,0.00007991278,0.0001089054,0.0001850783,0.00005060485,0.00001222978,0.003603101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2324029,"threshold_uncertainty_score":0.9985266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2763920787","doi":"10.1007/s10479-015-2019-x","title":"Simulation optimization: a review of algorithms and applications","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":444,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dow Chemical (Canada)","funders":"Dow Chemical Company","keywords":"Theory of computation; Homogeneous; Function (biology); Subject (documents); Algebraic number; Optimization problem","retraction":null,"screen_n_in":null,"score":{"opus":0.7149842999777986,"gpt":0.6440607833342126,"spread":0.07092351664358598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006266309,0.00007174365,0.0002323484,0.000432234,0.0001822892,0.00007842895,0.0004012497,0.00005690329,0.0002517111],"category_scores_gemma":[0.004992579,0.00005880271,0.00005389173,0.002281118,0.0002480832,0.000344256,0.0001402561,0.0001101606,0.00002954193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000102978,"about_ca_system_score_gemma":0.0002217512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000543384,"about_ca_topic_score_gemma":0.000005241405,"domain_scores_codex":[0.9970082,0.0003096731,0.0008141014,0.0002848213,0.001440417,0.0001428071],"domain_scores_gemma":[0.9892685,0.001180985,0.0001031876,0.0006844275,0.008614651,0.0001482386],"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.000007417801,0.0001415264,0.0002055463,0.0001030126,0.000009851748,1.340051e-7,0.0001822315,0.9111582,0.00004955588,0.03126798,0.007636281,0.04923827],"study_design_scores_gemma":[0.0001763271,0.0001324584,0.0002255361,0.0002585337,0.000006241185,0.000001501061,0.0003499668,0.9111502,0.001207842,0.01166861,0.07471868,0.000104116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001509133,0.009506396,0.9673964,0.009756688,0.00001991156,0.001916004,0.00008689084,0.00003927583,0.009769268],"genre_scores_gemma":[0.9258162,0.007818862,0.0630576,0.0005798312,0.000127892,0.0006040619,0.0000851935,0.00001970538,0.001890601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9243071,"threshold_uncertainty_score":0.5976944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069326331","doi":"10.1007/s10479-006-0132-6","title":"Coherent multiperiod risk adjusted values and Bellman’s principle","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":426,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Ambiguity; Theory of computation; Measure (data warehouse); Coherent risk measure; Risk measure; Mathematics; Expected shortfall; Stability (learning theory); Value (mathematics); Spectral risk measure; Dynamic risk measure; Mathematical economics; Risk management; Applied mathematics; Statistics; Computer science; Economics; Algorithm; Data mining; Financial economics","retraction":null,"screen_n_in":null,"score":{"opus":0.3529172039971666,"gpt":0.5307843923733416,"spread":0.177867188376175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004973605,0.00009180224,0.0001965963,0.0005308685,0.0006526342,0.0003443862,0.0003492788,0.00007544585,0.0003429776],"category_scores_gemma":[0.00242294,0.00006802062,0.00005612068,0.001036352,0.0002669838,0.0004003424,0.0001618054,0.0001959704,0.000118355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009043698,"about_ca_system_score_gemma":0.0001285921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00214057,"about_ca_topic_score_gemma":0.001305768,"domain_scores_codex":[0.9965962,0.0006756029,0.0006032508,0.0003569136,0.001483189,0.0002848557],"domain_scores_gemma":[0.9963684,0.0005835591,0.00006895557,0.0005089224,0.002369524,0.0001006562],"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.0001790466,0.000996571,0.2923418,0.00001492179,0.00006957041,0.00001324612,0.004090833,0.416845,0.004377786,0.02108084,0.1211058,0.1388845],"study_design_scores_gemma":[0.0007462428,0.0003943099,0.5495698,0.00002675867,0.00001032348,0.000006334179,0.001670593,0.3512181,0.01586317,0.01121301,0.06901325,0.0002681665],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907372,0.001018236,0.002004858,0.001142293,0.00005420942,0.0004132976,0.00005874637,0.00001665638,0.004554508],"genre_scores_gemma":[0.9831662,0.002812317,0.002537296,0.00002521866,0.00008167382,0.00003604431,0.00002790876,0.000009312245,0.01130408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2572279,"threshold_uncertainty_score":0.5019601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W12382059","doi":"10.1023/a:1026130003508","title":"An Efficient Genetic Algorithm for the p-Median Problem","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":337,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Mathematical optimization; Computer science; Algorithm; Greedy algorithm; Simple (philosophy); Coding (social sciences); Genetic algorithm; Heuristic; Upper and lower bounds; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2023695766391125,"gpt":0.414880243875167,"spread":0.2125106672360545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141796,0.00007598058,0.00008088334,0.0002472341,0.0006295496,0.00023027,0.00031973,0.00002814215,0.0004728548],"category_scores_gemma":[0.0002462883,0.000055875,0.00005156846,0.0006656569,0.0001103639,0.0002456631,0.00004675583,0.00008972239,0.0001694525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007686761,"about_ca_system_score_gemma":0.00005582249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001468606,"about_ca_topic_score_gemma":0.0008800224,"domain_scores_codex":[0.9987591,0.00004926996,0.000250651,0.0002074276,0.0004291285,0.0003044329],"domain_scores_gemma":[0.9982983,0.00004265544,0.00001123056,0.0003909409,0.001238487,0.00001841107],"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.00001231392,0.0007096007,0.0001718807,0.0001578791,0.0000620374,8.191973e-7,0.0003443938,0.6449975,0.0002732555,0.1925909,0.02936873,0.1313107],"study_design_scores_gemma":[0.0001644503,0.00003397513,0.001354481,0.000007412735,0.000007207519,1.833131e-7,0.0008112806,0.8947982,0.0002758481,0.0008640887,0.1015989,0.00008395153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3029082,0.001476214,0.5651268,0.08236072,0.001259542,0.01087132,0.00007451032,0.0002037754,0.03571885],"genre_scores_gemma":[0.9870589,0.0001051559,0.009645154,0.0008447281,0.0002693517,0.0005380302,0.00004220653,0.00001703817,0.001479398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6841507,"threshold_uncertainty_score":0.5177429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064783481","doi":"10.1007/s10479-006-0001-3","title":"An integrated model for logistics network design","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":278,"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":"Benders' decomposition; Theory of computation; Mathematical optimization; Computer science; Decomposition; Facility location problem; Selection (genetic algorithm); Linear programming relaxation; Range (aeronautics); Simplex algorithm; Simplex; Product (mathematics); Network planning and design; Relaxation (psychology); Integer programming; Operations research; Linear programming; Algorithm; Mathematics; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.4520266462281747,"gpt":0.4442087261267259,"spread":0.007817920101448772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002122747,0.00008576616,0.0001112494,0.0002526604,0.0004134923,0.0002314747,0.0002859349,0.00004506711,0.0001544341],"category_scores_gemma":[0.0002675814,0.00007906847,0.00004323807,0.0006871019,0.00009171883,0.0006043634,0.00005545149,0.00009152773,0.00007815023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001046258,"about_ca_system_score_gemma":0.00006688307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003879403,"about_ca_topic_score_gemma":0.003651422,"domain_scores_codex":[0.9988038,0.0000406378,0.0003063394,0.0002062108,0.0003122046,0.0003308323],"domain_scores_gemma":[0.9976596,0.00003370093,0.00001327533,0.0002990946,0.00198179,0.00001250896],"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.00002714678,0.000136201,0.00004016818,0.00003281374,0.0000068433,1.608476e-7,0.00001117269,0.7492351,0.0001092243,0.1562322,0.09326281,0.0009061594],"study_design_scores_gemma":[0.0001164208,0.00002642486,0.0001951051,0.000009240513,0.000005265322,3.268527e-8,0.0000843019,0.9759853,0.00008901799,0.009035615,0.01436837,0.00008483554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007264134,0.00005530575,0.9863842,0.003058046,0.00007555397,0.0007356792,0.00001370017,0.00004873347,0.002364721],"genre_scores_gemma":[0.9784358,0.00002755541,0.01704764,0.0005291724,0.0004186762,0.0001687321,0.0003206306,0.00001490035,0.003036863],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9711717,"threshold_uncertainty_score":0.5864523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045728330","doi":"10.1007/s10479-014-1581-y","title":"Relief distribution networks: a systematic review","year":2014,"lang":"en","type":"review","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":243,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Variety (cybernetics); Emergency management; Systematic review; Distribution (mathematics); Computer science; Data science; Field (mathematics); Management science; Operations research; Political science; Economics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3010963451300899,"gpt":0.4686713539570713,"spread":0.1675750088269813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006973198,0.0003006136,0.001802828,0.0004935837,0.00038604,0.0002991652,0.0008082882,0.0001534827,0.0004476158],"category_scores_gemma":[0.003029128,0.0002329094,0.0004925513,0.002243073,0.0001081026,0.0004981318,0.0003715994,0.0004384103,0.002153915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004291523,"about_ca_system_score_gemma":0.0001085666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007205729,"about_ca_topic_score_gemma":0.0002724658,"domain_scores_codex":[0.9962205,0.0003932894,0.001597264,0.0004422155,0.0008910584,0.0004557059],"domain_scores_gemma":[0.996671,0.0001062087,0.0001350687,0.001086841,0.001972883,0.00002801791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","study_design_scores_codex":[8.307489e-7,0.00007894185,7.895859e-8,0.8721893,0.00009699269,7.586503e-7,0.000002008215,0.0006025759,4.371512e-9,0.01975969,0.09137391,0.01589496],"study_design_scores_gemma":[0.00002461774,0.000009078897,2.389129e-7,0.2817623,0.0003287901,6.671543e-7,0.000008891902,0.008228714,1.969942e-8,0.00002192104,0.7094542,0.0001606157],"study_design_candidate":"systematic_review","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[2.131054e-7,0.990879,0.00150237,0.00128801,0.0001729182,0.003795413,0.00002471252,0.00004996775,0.002287407],"genre_scores_gemma":[0.00003839851,0.9936492,0.00000954086,0.0006763392,0.0003908003,0.001193874,0.002058785,0.00003204148,0.001951059],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.6180803,"threshold_uncertainty_score":0.998623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966942146","doi":"10.1007/s10479-014-1614-6","title":"The practice and theory of automated timetabling","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":208,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Operations research; Computer science; Library science; Annals; History; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.462131275352027,"gpt":0.5843200294400972,"spread":0.1221887540880702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04875991,0.00005474465,0.0001574377,0.0003654216,0.0009351022,0.0003265715,0.000521877,0.00004551227,0.00006027397],"category_scores_gemma":[0.1181855,0.00003204013,0.00004989374,0.001439461,0.0005854965,0.0003569231,0.000154049,0.000210251,0.00008567121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002833174,"about_ca_system_score_gemma":0.0001708877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001340499,"about_ca_topic_score_gemma":0.00003403497,"domain_scores_codex":[0.9952851,0.002389391,0.0005126813,0.0002141651,0.001335803,0.0002628437],"domain_scores_gemma":[0.9724826,0.02181677,0.00008113558,0.00069183,0.004840567,0.00008711739],"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.0001213689,0.0002354087,0.0002869493,0.000007214071,0.0001154096,6.875597e-7,0.001546048,0.01476066,0.007419799,0.8563724,0.01394318,0.1051909],"study_design_scores_gemma":[0.0004557284,0.0004448959,0.009492444,0.00005709207,0.00002910834,0.00002177699,0.007121614,0.7484455,0.02282291,0.09521177,0.1157114,0.0001858149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8560032,0.006363909,0.02516305,0.06186296,0.0003036928,0.0006772426,0.00003578206,0.0001357738,0.04945441],"genre_scores_gemma":[0.9918921,0.00025998,0.005277226,0.0000861486,0.00003685569,0.00001048786,0.000001346049,0.000005443975,0.002430395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7611606,"threshold_uncertainty_score":0.9795018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225279906","doi":"10.1007/s10479-022-04689-1","title":"Smart supply chain management in Industry 4.0: the review, research agenda and strategies in North America","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":205,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; University of Windsor; National Science Foundation","keywords":"Supply chain; Information and Communications Technology; Supply chain management; Smart manufacturing; Business; Industry 4.0; Systematic review; Knowledge management; Process management; Industrial organization; Computer science; Engineering management; Marketing; Engineering; Manufacturing engineering; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.2084547590374861,"gpt":0.4274458321997248,"spread":0.2189910731622387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981934,0.00008474087,0.0001397205,0.000691411,0.000265112,0.0001386751,0.0004148423,0.00004847579,0.0003248896],"category_scores_gemma":[0.00007676269,0.00007678748,0.00002156282,0.002884471,0.0002212311,0.0004322777,0.000219753,0.001844421,0.00001574876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006474096,"about_ca_system_score_gemma":0.0001109086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003488474,"about_ca_topic_score_gemma":0.000899253,"domain_scores_codex":[0.9976665,0.000501085,0.000401034,0.0001616054,0.000841064,0.0004287353],"domain_scores_gemma":[0.9992797,0.0001695265,0.000008004255,0.0003183467,0.0001738438,0.0000505143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003790375,0.0003700307,0.006260451,0.001740671,0.0001011576,0.0001089246,0.007983536,0.7690135,0.0001089597,0.01733807,0.143558,0.05337875],"study_design_scores_gemma":[0.001362289,0.0006818766,0.1106356,0.001388753,0.000009023122,0.0000311741,0.1583498,0.05829799,0.000781938,0.001504473,0.6661289,0.0008282661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8605205,0.007002173,0.0000257251,0.01322206,0.00006216452,0.001983277,0.0001672023,0.0000397249,0.1169772],"genre_scores_gemma":[0.9886404,0.009380263,0.00005049507,0.0001464999,0.0000132199,0.0009239421,0.00004753488,0.00001562736,0.0007819607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7107155,"threshold_uncertainty_score":0.8013194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998172110","doi":"10.1007/s10479-005-5732-z","title":"Basis Function Adaptation in Temporal Difference Reinforcement Learning","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":190,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Markov decision process; Bellman equation; Temporal difference learning; Basis function; Function approximation; Mathematical optimization; Basis (linear algebra); Computer science; Theory of computation; Q-learning; Convergence (economics); Markov process; Mathematics; Artificial intelligence; Algorithm; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.2255396635006515,"gpt":0.4118928531180281,"spread":0.1863531896173766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795468,0.00009287867,0.0001281759,0.0005990842,0.0002725683,0.0002002976,0.0005048928,0.00005984934,0.00008719236],"category_scores_gemma":[0.0004803068,0.00009155396,0.00003942791,0.001015105,0.00006737973,0.0008712418,0.000208319,0.0004367151,0.0001047277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005640941,"about_ca_system_score_gemma":0.0001910033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004123539,"about_ca_topic_score_gemma":0.000230164,"domain_scores_codex":[0.9977658,0.000321806,0.0004344844,0.0002619718,0.0008473764,0.0003685946],"domain_scores_gemma":[0.9986761,0.0001499368,0.00004510645,0.0003815484,0.000675984,0.00007130287],"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.00001065656,0.00003482899,0.00141161,0.000008560532,0.000007176196,7.922054e-7,0.001046489,0.9596584,0.0006477443,0.0179498,0.0002057346,0.01901819],"study_design_scores_gemma":[0.0001889004,0.0003406269,0.007907618,0.00003693445,8.063308e-7,6.671843e-7,0.000214714,0.9867536,0.002050462,0.00006248661,0.002354988,0.00008817683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05995004,0.00007519144,0.9328964,0.003314867,0.00005075815,0.0002850705,2.269717e-7,0.00004330525,0.003384158],"genre_scores_gemma":[0.9845845,0.0001614608,0.01089541,0.0001073689,0.00004718338,0.00004593613,0.00001631987,0.000007037598,0.004134838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9246344,"threshold_uncertainty_score":0.3733462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971063635","doi":"10.1007/s10479-011-0991-3","title":"A dynamic vehicle routing problem with multiple delivery routes","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":182,"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; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Heuristic; Theory of computation; Routing (electronic design automation); Operations research; Service (business); Mathematical optimization; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1498618087874064,"gpt":0.3781981942429519,"spread":0.2283363854555455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308954,0.0001110503,0.0001527995,0.0002651064,0.00022964,0.0000615829,0.0002408505,0.00006756488,0.00009800335],"category_scores_gemma":[0.0002220907,0.0001012465,0.00003501088,0.0007264388,0.0001103403,0.0003468069,0.00006638523,0.0002900081,0.00003395971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002685369,"about_ca_system_score_gemma":0.00007843526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003477333,"about_ca_topic_score_gemma":0.0003078342,"domain_scores_codex":[0.9985647,0.000206267,0.000287791,0.0001889708,0.0003526424,0.0003996003],"domain_scores_gemma":[0.9985849,0.0001694255,0.0000150252,0.0003145337,0.0008255494,0.00009052547],"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.00004213756,0.0001322516,0.01011092,0.00008675145,0.0000990384,0.00000765259,0.004048329,0.957653,0.01849001,0.001243045,0.0002294837,0.007857374],"study_design_scores_gemma":[0.0002358161,0.0001247246,0.005924395,0.00006891284,0.000003843412,0.000003444486,0.0004363621,0.9601381,0.03282033,0.00005045347,0.00006094195,0.0001326184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9380337,0.0002000042,0.0535023,0.0001765226,0.00002535252,0.0004450734,0.00001645173,0.0002039675,0.007396643],"genre_scores_gemma":[0.8237801,0.00009028037,0.1757718,0.00001430302,0.00001125114,0.00005218336,0.000009643157,0.00003606464,0.0002344056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1222695,"threshold_uncertainty_score":0.4128712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W122108692","doi":"10.1023/a:1020767501233","title":"Location of Preventive Health Care Facilities","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":161,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; McGill University","funders":"U.S. Food and Drug Administration","keywords":"Theory of computation; Facility location problem; Health care; Quality (philosophy); Computer science; Preventive care; Operations research; Mathematics; Economic growth; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2750182544631937,"gpt":0.4196383342786208,"spread":0.1446200798154271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008257895,0.00006919607,0.0001347479,0.0004434586,0.0002499227,0.00005899433,0.0002052454,0.00002568357,0.001288918],"category_scores_gemma":[0.000337235,0.00006804596,0.0000428246,0.001087064,0.0001249641,0.0006186073,0.0001036289,0.00008742556,0.0003034883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001813748,"about_ca_system_score_gemma":0.00004628906,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00919828,"about_ca_topic_score_gemma":0.003567527,"domain_scores_codex":[0.9986859,0.00005747084,0.0003730527,0.0001670715,0.0004989171,0.0002175768],"domain_scores_gemma":[0.9968223,0.00001479302,0.00002523023,0.0002855047,0.002839265,0.00001288853],"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.00007619741,0.001767206,0.002354677,0.01225898,0.0002252943,0.000001210725,0.02541468,0.127308,0.0005055948,0.4373107,0.2969342,0.09584328],"study_design_scores_gemma":[0.001573709,0.0005729996,0.03214614,0.00092367,0.00003073113,6.822684e-7,0.1249982,0.3022433,0.005039588,0.001918623,0.5296456,0.0009068404],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8342015,0.01108065,0.002607432,0.05101881,0.0003831903,0.002677157,0.00006361291,0.0001117671,0.09785595],"genre_scores_gemma":[0.9938169,0.0002907322,0.0000914888,0.0002346896,0.00006905884,0.00004814461,0.00004694006,0.000005812829,0.0053963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4353921,"threshold_uncertainty_score":0.999624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022317074","doi":"10.1007/s10479-010-0736-8","title":"Facility location for large-scale emergencies","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Node (physics); Facility location problem; Theory of computation; Computer science; Scale (ratio); Center (category theory); Path (computing); Operations research; Location model; Mathematical optimization; Computer network; Geography; Mathematics; Algorithm; Engineering; Cartography","retraction":null,"screen_n_in":null,"score":{"opus":0.2162994888100631,"gpt":0.4215558370122323,"spread":0.2052563482021692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003459756,0.00008880041,0.000117645,0.000356629,0.0005419629,0.0001449176,0.0003059588,0.00005855921,0.001380061],"category_scores_gemma":[0.001114174,0.00008518236,0.00007032928,0.000858498,0.00009172755,0.0008235968,0.000135652,0.0001760128,0.0005087464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005567036,"about_ca_system_score_gemma":0.00005924455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00195356,"about_ca_topic_score_gemma":0.01580586,"domain_scores_codex":[0.9986005,0.00002656615,0.0003341946,0.0002578448,0.0004394308,0.0003414556],"domain_scores_gemma":[0.9961951,0.00003159747,0.00001424838,0.0004285939,0.003311171,0.00001923441],"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.0001741203,0.001710856,0.005449499,0.001846895,0.00009616937,4.340394e-7,0.0009131038,0.02546069,0.03137839,0.7113086,0.2116265,0.01003471],"study_design_scores_gemma":[0.0005091203,0.00005097007,0.02214275,0.00002291255,0.00001439597,1.91422e-7,0.002572566,0.2972555,0.005762627,0.003539426,0.6678164,0.0003131653],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9577177,0.00007192438,0.01467173,0.01420995,0.0006457419,0.001419817,0.00008238685,0.0000788839,0.01110193],"genre_scores_gemma":[0.9957466,0.0000290886,0.0004773489,0.000327065,0.0002265047,0.0002408381,0.0002766914,0.000007375365,0.002668556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7077692,"threshold_uncertainty_score":0.9995328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983758874","doi":"10.1007/s10479-011-0895-2","title":"The orienteering problem with stochastic travel and service times","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"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":"Orienteering; Heuristics; Theory of computation; Computer science; Variety (cybernetics); Service (business); Mathematical optimization; Operations research; Stochastic programming; Mathematics; Marketing; Artificial intelligence; Algorithm; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.1754939365175115,"gpt":0.3804113370696934,"spread":0.2049174005521819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028002,0.00006299858,0.0000754935,0.00009032377,0.0002814926,0.00006238904,0.0001406003,0.00002840119,0.00003212049],"category_scores_gemma":[0.00009214088,0.00004390235,0.000008764245,0.0004468071,0.00008898552,0.0001367471,0.00004054321,0.0001657211,0.000007011875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000586457,"about_ca_system_score_gemma":0.00003966401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009867478,"about_ca_topic_score_gemma":0.0001219922,"domain_scores_codex":[0.9992293,0.00009121944,0.0001453311,0.00009788669,0.0002166971,0.0002195449],"domain_scores_gemma":[0.9990437,0.0001364673,0.000006546802,0.0001869367,0.00057028,0.00005608106],"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.00003006639,0.0000345909,0.0001088772,0.00008409882,0.00007401023,0.000001343507,0.006836624,0.9686763,0.002381048,0.01623551,0.000301769,0.005235742],"study_design_scores_gemma":[0.0001656429,0.0001182785,0.001687306,0.00006368992,0.000004502732,0.000007796644,0.001163935,0.984895,0.01138193,0.0002595223,0.0001463601,0.0001060267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5011655,0.001236668,0.4636205,0.003269569,0.00007909194,0.001392473,0.00002133692,0.0002165313,0.02899831],"genre_scores_gemma":[0.9536431,0.0001166915,0.04574076,0.00002115448,0.00001701286,0.00005858587,0.000002209243,0.00002406962,0.0003764026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4524776,"threshold_uncertainty_score":0.2165042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112502728","doi":"10.1007/s10479-015-1907-4","title":"Operations Research challenges in forestry: 33 open problems","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":130,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Dalhousie University; Université Laval","funders":"","keywords":"Forestry; Community forestry; Forest management; Environmental planning; Computer science; Management science; Operations research; Business; Environmental resource management; Engineering; Geography; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.7507399674572494,"gpt":0.5250244848031548,"spread":0.2257154826540946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005094521,0.000111667,0.0001828808,0.0009680282,0.0002066627,0.0003376543,0.0008146965,0.00009596285,0.0001143348],"category_scores_gemma":[0.0005338649,0.0001081483,0.00002617748,0.001477962,0.0001824437,0.00064932,0.0004835893,0.0003828516,0.0001824217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007623326,"about_ca_system_score_gemma":0.0002370001,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058451,"about_ca_topic_score_gemma":0.02883822,"domain_scores_codex":[0.9975223,0.0004029422,0.0003862836,0.0002793613,0.0008598444,0.0005492695],"domain_scores_gemma":[0.9977461,0.0000701558,0.000004771154,0.0005507462,0.001428364,0.0001998595],"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.00002031496,0.0003761397,0.0004451185,0.0001638431,0.00004677304,0.00001074106,0.004462575,0.7310422,0.0006516224,0.2098013,0.04773154,0.005247803],"study_design_scores_gemma":[0.001915862,0.0008651538,0.00692976,0.000407421,0.000004454248,0.00000582878,0.01622275,0.6189409,0.008722031,0.006690717,0.3387368,0.0005582648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5145605,0.008657043,0.001124224,0.03464771,0.0003611438,0.006495492,0.000102139,0.0002491791,0.4338026],"genre_scores_gemma":[0.9912782,0.004525332,0.0008314539,0.00002814506,0.00005077072,0.000640561,0.00006498025,0.00003296498,0.002547616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4767177,"threshold_uncertainty_score":0.988883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896479483","doi":"10.1007/s10479-018-3076-8","title":"Shared mobility systems: an updated survey","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":128,"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":"TRIPS architecture; Variety (cybernetics); Field (mathematics); Computer science; Point (geometry); Operations research; Transport engineering; Data science; Telecommunications; Management science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3362647373297932,"gpt":0.4692835955316023,"spread":0.1330188582018091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00203906,0.00007380687,0.0001215587,0.0002570976,0.0002049225,0.00009272694,0.0002103767,0.00006877413,0.0005702942],"category_scores_gemma":[0.000128843,0.00007460077,0.00002168621,0.001089444,0.0002017048,0.0003941423,0.00001119023,0.0001682427,0.0001046574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001559993,"about_ca_system_score_gemma":0.0001006949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001630456,"about_ca_topic_score_gemma":0.004777202,"domain_scores_codex":[0.9987093,0.0002129889,0.0003624944,0.0001677714,0.0003176538,0.0002297573],"domain_scores_gemma":[0.9962395,0.00005202091,0.000007330083,0.0004724483,0.003136388,0.00009225988],"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.0002343676,0.002656013,0.04695706,0.0004117402,0.0006068829,0.000006908913,0.007986374,0.413532,0.123026,0.07234185,0.3283945,0.003846303],"study_design_scores_gemma":[0.0003289702,0.0003692619,0.7225667,0.0000288871,0.000004582716,0.000001401628,0.0007899099,0.2390693,0.02655185,0.00008572003,0.009938819,0.0002645462],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9942886,0.00004941105,0.001643636,0.0001660419,0.000117784,0.0003934849,0.0005612688,0.0001241653,0.002655608],"genre_scores_gemma":[0.9981776,0.00001584307,0.0002226189,0.00002314136,0.00005201527,0.00006807229,0.001154739,0.00001481452,0.0002711598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6756096,"threshold_uncertainty_score":0.6244321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089233175","doi":"10.1023/b:anor.0000039515.90453.1d","title":"Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Theory of computation; Path (computing); Mathematical optimization; Mathematics; Heuristic; Set (abstract data type); Local search (optimization); Network planning and design; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1840381061706795,"gpt":0.3873745427847574,"spread":0.2033364366140779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006236,0.00008611563,0.0001343866,0.000116506,0.0002255634,0.0001014166,0.0001059553,0.00007022643,0.00005051139],"category_scores_gemma":[0.0003206279,0.00008091242,0.00002840029,0.0003929953,0.000123126,0.0001362521,0.00002528599,0.0002358394,0.00001535855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700445,"about_ca_system_score_gemma":0.00005891309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005382003,"about_ca_topic_score_gemma":0.0000229198,"domain_scores_codex":[0.9989751,0.0001123521,0.0002342553,0.0001189752,0.0002499077,0.0003093966],"domain_scores_gemma":[0.9991707,0.0001791304,0.000008415477,0.0001894693,0.0003361105,0.0001162074],"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.000005586074,0.00006284684,0.00001206939,0.00005701763,0.00001407784,0.000001793006,0.0002378019,0.9895903,0.0003451922,0.007660192,0.0003947604,0.001618389],"study_design_scores_gemma":[0.0003684629,0.00009665495,0.00008475396,0.00009887445,0.000003292857,0.000001099665,0.00005348588,0.9905731,0.00429009,0.004154856,0.0001746939,0.0001006561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06260461,0.0004022242,0.933629,0.001277094,0.00004825114,0.0005529463,0.000007363436,0.0001624883,0.00131608],"genre_scores_gemma":[0.8560601,0.0001355878,0.1436357,0.00005484817,0.00003073171,0.00003606125,0.00001131699,0.0000189874,0.0000166765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7934555,"threshold_uncertainty_score":0.3299513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043465029","doi":"10.1007/s10479-008-0511-2","title":"Supply chain DEA: production possibility set and performance evaluation model","year":2009,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Supply chain; Benchmarking; Production (economics); Computer science; Set (abstract data type); Supply chain management; Service management; Theory of computation; Supply chain risk management; Operations research; Business; Microeconomics; Economics; Algorithm; Mathematics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.555066990663382,"gpt":0.5787012297465279,"spread":0.02363423908314588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02834273,0.00008801971,0.0001906044,0.0007757504,0.0006848112,0.0002924877,0.0004151054,0.00006313386,0.0001100393],"category_scores_gemma":[0.01125443,0.00006784619,0.00005308203,0.002149493,0.0002826226,0.0008900603,0.0000736572,0.000222734,0.00005135652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003217434,"about_ca_system_score_gemma":0.0004149704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007781041,"about_ca_topic_score_gemma":0.0001357743,"domain_scores_codex":[0.9944063,0.0008900674,0.0006092964,0.0005768105,0.003222037,0.0002954859],"domain_scores_gemma":[0.9930003,0.0002384486,0.00005483465,0.0008120025,0.005806393,0.00008798461],"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.00006695744,0.0002688302,0.004652061,0.000005620683,0.00001076111,3.453939e-7,0.002664337,0.7811005,0.00823515,0.001344864,0.005099271,0.1965513],"study_design_scores_gemma":[0.00008087174,0.0001984553,0.05537934,0.00001325402,0.000004738418,0.000001724854,0.0002902777,0.9297301,0.007676228,0.00648709,0.00007135142,0.00006655873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9810576,0.0002894382,0.001260201,0.01589147,0.00002988753,0.0004465635,0.0000114588,0.00001079317,0.001002529],"genre_scores_gemma":[0.9971614,0.0001422608,0.001236169,0.000118244,0.00004333923,0.00002005746,0.0000152383,0.00000366437,0.00125957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1964847,"threshold_uncertainty_score":0.9970742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229025461","doi":"10.1007/s10479-022-04713-4","title":"Designing an integrated responsive-green-cold vaccine supply chain network using Internet-of-Things: artificial intelligence-based solutions","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Healthcare and Environmental Waste Management","field":"Medicine","cited_by":114,"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; Supply chain network; Mathematical optimization; Heuristic; Pareto principle; Supply chain; Pareto optimal; Variable neighborhood search; Operations research; Supply chain management; Metaheuristic; Multi-objective optimization; Artificial intelligence; Machine learning; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3749417683933092,"gpt":0.4543444267938807,"spread":0.07940265840057154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004402989,0.0001313874,0.0002986586,0.0006545311,0.0006754981,0.00003455993,0.0002591099,0.00005938303,0.0007588826],"category_scores_gemma":[0.0002682884,0.0001312666,0.00008947511,0.001328599,0.000144045,0.000182564,0.0003060398,0.0006199148,0.00001015525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001866799,"about_ca_system_score_gemma":0.0005105148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005397152,"about_ca_topic_score_gemma":0.000294606,"domain_scores_codex":[0.9965146,0.001142217,0.0006688797,0.0003268171,0.0007977068,0.0005498309],"domain_scores_gemma":[0.9986606,0.0001983724,0.00006060047,0.0004380478,0.0004528665,0.0001895334],"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.003172672,0.00258975,0.002106821,0.0002932837,0.0002902113,0.0001404108,0.005522927,0.7440739,0.1303183,0.01620382,0.004819549,0.0904684],"study_design_scores_gemma":[0.0003537517,0.004714961,0.0006931265,0.0003347028,0.00004185572,0.00001346646,0.01229279,0.8939687,0.08262567,0.0003788484,0.004356884,0.0002252367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8448867,0.0006664522,0.1341666,0.01759338,0.0001448195,0.002108733,0.00004613744,0.00004369605,0.0003435458],"genre_scores_gemma":[0.9840499,0.00005377525,0.01414005,0.0007838748,0.00008797451,0.0001245677,0.0001581852,0.00002818432,0.0005735378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1498948,"threshold_uncertainty_score":0.8309231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224298152","doi":"10.1007/s10479-022-04661-z","title":"Sustainable closed-loop supply chain with energy efficiency: Lagrangian relaxation, reformulations and heuristics","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"University of Melbourne","keywords":"Supply chain; Lagrangian relaxation; Heuristics; Remanufacturing; Computer science; Profit (economics); Environmental economics; Operations research; Supply chain management; Theory of computation; Mathematical optimization; Business; Economics; Manufacturing engineering; Microeconomics; Marketing; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04350973340699243,"gpt":0.3126777133944018,"spread":0.2691679799874094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002592868,0.0001527506,0.0001827598,0.001438057,0.002345615,0.0004249914,0.0003980761,0.00003754483,0.0004293993],"category_scores_gemma":[0.0006460582,0.0001420287,0.000039705,0.002905665,0.0002155078,0.000894543,0.0007919714,0.0002796205,0.00001067876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009147032,"about_ca_system_score_gemma":0.0002090288,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008663191,"about_ca_topic_score_gemma":0.0006548236,"domain_scores_codex":[0.9974621,0.0001259705,0.0003468356,0.0003827851,0.001024055,0.0006582838],"domain_scores_gemma":[0.9971463,0.0001220659,0.00009941276,0.000466174,0.002133139,0.00003287253],"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.0000982077,0.0003117243,0.003938153,0.0002187447,0.00004874925,0.0000618911,0.00048356,0.09595618,0.00006849301,0.8805758,0.01661639,0.001622061],"study_design_scores_gemma":[0.001896747,0.0005893875,0.01399675,0.00005640437,0.00006291748,0.000012194,0.0849174,0.2888585,0.0003069653,0.01955905,0.5889423,0.0008012857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8995978,0.0008866775,0.00496529,0.04795508,0.0001160632,0.002320041,0.00004224013,0.0001866938,0.04393015],"genre_scores_gemma":[0.975841,0.00005836224,0.0002316516,0.0007500532,0.000155838,0.0003540897,0.0001927672,0.00003630511,0.02237986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8610168,"threshold_uncertainty_score":0.9989532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060085351","doi":"10.1007/s10479-011-0869-4","title":"A survey of optimization models on cancer chemotherapy treatment planning","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Mathematical Biology Tumor Growth","field":"Mathematics","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Chemotherapy; Computer science; Colorectal cancer; Theory of computation; Limit (mathematics); Cancer treatment; Cancer chemotherapy; Cancer; Medicine; Mathematics; Surgery; Algorithm; Internal medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.7989043348658895,"gpt":0.5617408224880779,"spread":0.2371635123778116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441993,0.0001005436,0.0002730097,0.0002137553,0.00009236707,0.000009801658,0.000188187,0.00007362526,0.0005926829],"category_scores_gemma":[0.0006315807,0.00007441622,0.0000471241,0.0003444541,0.0001554003,0.00009017154,0.00002925621,0.0001027962,0.000005913031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002360803,"about_ca_system_score_gemma":0.000138666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001403756,"about_ca_topic_score_gemma":0.0001721513,"domain_scores_codex":[0.9985452,0.0003840628,0.0003638204,0.0001758795,0.0003044778,0.0002265836],"domain_scores_gemma":[0.9979921,0.0006038513,0.00004901133,0.0003496493,0.0009464535,0.00005895719],"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.001659819,0.009963359,0.008942725,0.0005542691,0.001098875,0.00001454465,0.03519841,0.229085,0.003648348,0.6955377,0.00779559,0.006501293],"study_design_scores_gemma":[0.001547735,0.003321366,0.008406427,0.0004598513,0.00002411304,0.000002628556,0.0004863851,0.6658008,0.2454927,0.07405946,0.0000255172,0.0003730218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.96538,0.0001998028,0.01639847,0.0005026894,0.00002423537,0.0008300112,0.0001090752,0.00002679463,0.01652888],"genre_scores_gemma":[0.9860908,0.0002488867,0.01289742,0.00003319061,0.00001252032,0.0001227005,0.0000176773,0.00001911367,0.0005577189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6214783,"threshold_uncertainty_score":0.6489463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989473899","doi":"10.1007/s10479-019-03437-2","title":"Designing an efficient blood supply chain network in crisis: neural learning, optimization and case study","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Supply chain; Process (computing); Business; Blood collection; Operations management; Health care; Computer science; Operations research; Medicine; Medical emergency; Economics; Economic growth; Engineering; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.1084607641975998,"gpt":0.3876371638371688,"spread":0.279176399639569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003094574,0.00009036168,0.0001388467,0.0005422027,0.0004090976,0.0004917512,0.0001181595,0.00004332635,0.0003011817],"category_scores_gemma":[0.0001893327,0.00008595566,0.00001961565,0.0009864677,0.0000330345,0.001487055,0.00009167266,0.000308483,0.00001847839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003017203,"about_ca_system_score_gemma":0.00002992254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006120144,"about_ca_topic_score_gemma":0.002201543,"domain_scores_codex":[0.9985183,0.000267399,0.0002855986,0.0002798522,0.0003920765,0.0002567293],"domain_scores_gemma":[0.9990118,0.0001230553,0.00004476182,0.000169459,0.0006292902,0.00002162453],"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.00003194825,0.000716001,0.06213406,0.00002697908,0.00001846546,0.00008571365,0.000799056,0.9339539,0.0001059175,0.001543364,0.00006099046,0.0005235903],"study_design_scores_gemma":[0.001070857,0.0002276793,0.006417176,0.00002583133,0.00002012283,0.00002089591,0.02071971,0.9710738,0.00005817013,0.00001862062,0.0002169058,0.0001301965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9964131,0.000131599,0.0003494672,0.001707669,0.00004553828,0.0007506841,5.680013e-7,0.00002544413,0.0005759553],"genre_scores_gemma":[0.9988831,0.0000438776,0.000568288,0.0002369393,0.0001055013,0.0000442264,0.00001142725,0.00001513206,0.00009154053],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05571688,"threshold_uncertainty_score":0.9251869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973085655","doi":"10.1007/s10479-011-1038-5","title":"Impacts of earmarked private donations for disaster fundraising","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":101,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"York University","keywords":"Liberian dollar; Agency (philosophy); Finance; Business; Donation; Work (physics); Economics; Economic growth","retraction":null,"screen_n_in":null,"score":{"opus":0.4694540937713886,"gpt":0.4392171200550644,"spread":0.03023697371632422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001508798,0.0000752382,0.0001238772,0.0005254782,0.0002449038,0.00007280806,0.0002532118,0.00003168976,0.0009142091],"category_scores_gemma":[0.0006156224,0.00006961824,0.00007613859,0.0006825853,0.0001218555,0.000900819,0.0001404606,0.00007100244,0.00008066924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006708303,"about_ca_system_score_gemma":0.00003531803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003089269,"about_ca_topic_score_gemma":0.00173396,"domain_scores_codex":[0.9988289,0.00002813276,0.0003725776,0.0001622162,0.0003506283,0.0002575475],"domain_scores_gemma":[0.9980681,0.0000341865,0.0000264953,0.0002882911,0.00156603,0.00001691715],"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.0003507716,0.001429614,0.008400944,0.001514716,0.0002446588,9.534789e-7,0.002924147,0.00548756,0.01194321,0.924239,0.03259227,0.01087219],"study_design_scores_gemma":[0.003747908,0.0005421905,0.3086039,0.0005873885,0.0001455566,0.000001222183,0.009076037,0.3488958,0.04587635,0.0293594,0.2518025,0.001361724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9651965,0.00006406266,0.005832167,0.004078072,0.0001377209,0.0009297166,0.00002221661,0.000026714,0.02371282],"genre_scores_gemma":[0.9977038,0.0000373062,0.00111662,0.0002270639,0.00008381918,0.00007344596,0.00004914641,0.00001089476,0.000697906],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8948796,"threshold_uncertainty_score":0.9999991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070062192","doi":"10.1007/s10479-008-0448-5","title":"On risk minimizing portfolios under a Markovian regime-switching Black-Scholes economy","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Hamilton–Jacobi–Bellman equation; Differential game; Dynamic risk measure; Markov chain; Mathematical economics; Markov process; Mathematical optimization; Risk measure; Mathematics; Measure (data warehouse); Stochastic differential equation; Stochastic control; Theory of computation; Computer science; Applied mathematics; Bellman equation; Economics; Optimal control; Finance; Portfolio","retraction":null,"screen_n_in":null,"score":{"opus":0.2100355513104114,"gpt":0.3685797505975054,"spread":0.158544199287094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122906,0.0001282657,0.000295827,0.0005851642,0.0007954329,0.00008740785,0.0003556042,0.00009958915,0.0002107144],"category_scores_gemma":[0.0006723235,0.0001444162,0.0001100686,0.0006723369,0.000203447,0.0002968037,0.00008735568,0.0004025428,0.0006455443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003508187,"about_ca_system_score_gemma":0.0001388388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008984153,"about_ca_topic_score_gemma":0.00006990414,"domain_scores_codex":[0.9984111,0.00002239527,0.0006317013,0.0004423376,0.00009565153,0.0003968557],"domain_scores_gemma":[0.9986756,0.0002023754,0.0001312755,0.0005153531,0.0003516878,0.0001236971],"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.00002273189,0.0001937858,0.000648013,0.00001470333,0.00003820506,0.000003168623,0.0005745306,0.002810655,0.00002502739,0.9912212,0.003669539,0.0007783702],"study_design_scores_gemma":[0.000964544,0.0005110996,0.02149581,0.000115819,0.000007581407,0.00002187445,0.000879969,0.02433606,0.001198519,0.9097028,0.04008377,0.0006821133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6098508,0.001476851,0.282649,0.007338066,0.00009910026,0.0007846947,0.0002853122,0.00004545418,0.09747072],"genre_scores_gemma":[0.9957477,0.0008833646,0.00143057,0.0003247679,0.0001485973,0.0001323123,0.00002135558,0.00002523989,0.001286105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3858969,"threshold_uncertainty_score":0.8297381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007073703","doi":"10.1007/s10479-011-0885-4","title":"Workforce-constrained maintenance scheduling for military aircraft fleet: a case study","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Schedule; Theory of computation; Integer programming; Operations research; Computer science; Scheduling (production processes); Aircraft maintenance; Job shop scheduling; Constraint (computer-aided design); Workforce; Constraint programming; Fleet management; Mathematical optimization; Engineering; Aeronautics; Operations management; Stochastic programming; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2253498403542211,"gpt":0.399505614178517,"spread":0.1741557738242959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001555241,0.0001148596,0.0001770997,0.0002242482,0.0002563597,0.0000241139,0.0001810303,0.00007212455,0.00006706065],"category_scores_gemma":[0.0005288695,0.0001080727,0.00007510464,0.0004257266,0.0001647717,0.0003125453,0.00003748221,0.0002152329,0.00001067449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002422449,"about_ca_system_score_gemma":0.00008060028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001024427,"about_ca_topic_score_gemma":0.001220718,"domain_scores_codex":[0.9986754,0.00009526441,0.0003735178,0.0002256241,0.0002100831,0.0004200901],"domain_scores_gemma":[0.9983152,0.0001225905,0.000008572178,0.000380836,0.001077909,0.00009487288],"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.0001103492,0.0005898537,0.000809036,0.00016313,0.0001202892,0.0001388959,0.009702291,0.9752115,0.0009044905,0.003870432,0.001226412,0.007153304],"study_design_scores_gemma":[0.0007618706,0.0006979989,0.0004158413,0.0001038694,0.0000119101,0.00006820083,0.01702046,0.9761263,0.003662398,0.000550782,0.0003491472,0.0002312267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9297081,0.0003998582,0.06597085,0.0002496698,0.00009370158,0.001624694,0.00003315417,0.00008621928,0.001833733],"genre_scores_gemma":[0.9686473,0.0002333051,0.03037753,0.00002299643,0.00004113388,0.0003811996,0.000008476866,0.00002632289,0.0002617498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03893917,"threshold_uncertainty_score":0.4407078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084750728","doi":"10.1007/s10479-014-1663-x","title":"A short-turning policy for the management of demand disruptions in rapid transit systems","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":89,"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; Occupancy; Offset (computer science); Operations research; Transit (satellite); Theory of computation; Service (business); Demand management; Service level; Service quality; On demand; Order (exchange); Transport engineering; Business; Public transport; Economics; Engineering; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.219226179489936,"gpt":0.4944262840176408,"spread":0.2752001045277048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003159632,0.00003760543,0.00008876079,0.0002361054,0.0005280259,0.00005737192,0.0001678303,0.00003772853,0.00001164535],"category_scores_gemma":[0.0001409071,0.00003000499,0.00003734709,0.0006767605,0.0001652263,0.0001284915,0.000005479435,0.00007506933,0.000001100078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001108583,"about_ca_system_score_gemma":0.00009233962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002312904,"about_ca_topic_score_gemma":0.001897414,"domain_scores_codex":[0.9988487,0.0002680211,0.0002418607,0.00009785339,0.0003525841,0.0001909511],"domain_scores_gemma":[0.9990374,0.0003339403,0.00001594471,0.0001220044,0.0004537069,0.00003703824],"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.00002276105,0.0000694002,0.000953029,0.00009698357,0.00003903759,2.542728e-7,0.01182487,0.6141611,0.00009234833,0.3645233,0.000273796,0.007943112],"study_design_scores_gemma":[0.00179982,0.0005549037,0.2144732,0.001147551,0.00008821553,9.155279e-7,0.1069809,0.5625297,0.001205692,0.001687121,0.1090475,0.0004844475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4299203,0.002141083,0.4924205,0.03739635,0.0002444769,0.005834023,0.0001721656,0.00006148942,0.03180967],"genre_scores_gemma":[0.9971639,0.001048356,0.0008292514,0.00001528965,0.00005420686,0.0002252978,0.00002359261,0.000004633152,0.0006354903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5672436,"threshold_uncertainty_score":0.4061202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W202756272","doi":"10.1023/a:1020957904442","title":"Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cannibalization; Theory of computation; Key (lock); Constant (computer programming); Computer science; Mathematical optimization; Mathematical economics; Mathematics; Economics; Algorithm; Industrial organization","retraction":null,"screen_n_in":null,"score":{"opus":0.2314592520300225,"gpt":0.3697326085357868,"spread":0.1382733565057643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006313859,0.0001084029,0.0001447486,0.0003915705,0.0004896041,0.0003599682,0.000184262,0.00004142394,0.002501895],"category_scores_gemma":[0.0002197661,0.00009431565,0.00003335784,0.0003731303,0.0001144291,0.001649107,0.0001232851,0.0002602057,0.00009274178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001261896,"about_ca_system_score_gemma":0.00002612906,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0186257,"about_ca_topic_score_gemma":0.003564246,"domain_scores_codex":[0.9987312,0.00005700807,0.0002389828,0.0002268796,0.000449421,0.0002965287],"domain_scores_gemma":[0.9985608,0.0002096675,0.00003801614,0.0002282311,0.0009466291,0.00001660442],"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.001336368,0.003516484,0.06391854,0.002030001,0.0005206837,0.0000781144,0.01572942,0.4007885,0.01992913,0.2688217,0.03719881,0.1861323],"study_design_scores_gemma":[0.00067554,0.00007814352,0.001918863,0.0002264344,0.00001946571,0.000004313933,0.009950535,0.9499162,0.002031984,0.0005043874,0.03435527,0.000318797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7563323,0.0003103071,0.01652643,0.001978737,0.0001985245,0.0009433108,0.00004385476,0.0001074718,0.2235591],"genre_scores_gemma":[0.9975519,0.00002703715,0.0004545881,0.0001190275,0.0001957545,0.00007182577,0.00004216691,0.00001469125,0.00152308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5491278,"threshold_uncertainty_score":0.9984099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979700544","doi":"10.1023/b:anor.0000032576.73681.29","title":"Solving VRPTWs with Constraint Programming Based Column Generation","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"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","funders":"","keywords":"Column generation; Constraint programming; Theory of computation; Mathematical optimization; Computer science; Scheduling (production processes); Concurrent constraint logic programming; Constraint logic programming; Constraint satisfaction; Constraint (computer-aided design); Directed graph; Directed acyclic graph; Mathematics; Stochastic programming; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2097232830225987,"gpt":0.4249395268656753,"spread":0.2152162438430766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561726,0.0001002971,0.0001370393,0.0002790676,0.0002974042,0.0001765568,0.0001419748,0.00006926497,0.00007120646],"category_scores_gemma":[0.0003063041,0.00009834172,0.00003210812,0.000752272,0.0001659862,0.0002341493,0.00002056145,0.0002571791,0.00001204319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005207212,"about_ca_system_score_gemma":0.0002894362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000109012,"about_ca_topic_score_gemma":0.000268199,"domain_scores_codex":[0.9985859,0.0001554774,0.0002774254,0.0001770341,0.0004545984,0.0003495979],"domain_scores_gemma":[0.9985893,0.00008448736,0.00001357812,0.0002611583,0.000956889,0.00009463444],"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.000004267457,0.00004753126,0.0001030932,0.00003279759,0.0000201442,0.000003226264,0.000279761,0.9723473,0.01806441,0.001892106,0.0001241046,0.00708131],"study_design_scores_gemma":[0.0004311729,0.0001675187,0.0001712873,0.00007829342,0.000003741139,0.000004969437,0.0001957926,0.8699803,0.1282862,0.00002406838,0.0005169489,0.0001396162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3163082,0.0001322712,0.6797941,0.001316057,0.00004732997,0.0006200702,0.00001107252,0.0001712315,0.001599657],"genre_scores_gemma":[0.7111902,0.00002304367,0.2885327,0.0000337927,0.00005325663,0.00007373083,0.00002825917,0.00002469821,0.000040281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.394882,"threshold_uncertainty_score":0.4010259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3183082635","doi":"10.1007/s10479-021-04114-z","title":"Credit risk classification: an integrated predictive accuracy algorithm using artificial and deep neural networks","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Financial Distress and Bankruptcy Prediction","field":"Business, Management and Accounting","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Undersampling; Computer science; Oversampling; Machine learning; Artificial intelligence; Support vector machine; Artificial neural network; Resampling; Algorithm; Statistical classification; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.1978456949107665,"gpt":0.4008726326045339,"spread":0.2030269376937674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008142991,0.0001180626,0.0001638265,0.0002469349,0.0008360209,0.0006601992,0.0001557997,0.0001080838,0.0001596121],"category_scores_gemma":[0.00090096,0.0001123567,0.00004722109,0.001084027,0.0002051665,0.001843718,0.0001448368,0.0003823804,0.000007209168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001592791,"about_ca_system_score_gemma":0.00008758242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001923493,"about_ca_topic_score_gemma":0.0009157711,"domain_scores_codex":[0.9984691,0.0001337838,0.0003453535,0.0003464328,0.0004039113,0.0003013922],"domain_scores_gemma":[0.9969287,0.00008206097,0.00007422821,0.000268297,0.002616326,0.00003042576],"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.0002242506,0.0009015417,0.006995792,0.00008488746,0.000109214,0.00004038819,0.0002914745,0.1249395,0.002823588,0.03959581,0.001893274,0.8221003],"study_design_scores_gemma":[0.0001243494,0.00004326526,0.03327008,0.00002672583,0.00002027686,0.000002422606,0.001123293,0.962969,0.0002438659,0.0007401445,0.001335227,0.0001013583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8630862,0.0006465393,0.1330578,0.001447226,0.0003847327,0.0004128464,0.00010057,0.00006905828,0.0007950977],"genre_scores_gemma":[0.996613,0.0002675652,0.0009824979,0.0001164774,0.001513729,0.00003233267,0.0004285355,0.00001698726,0.00002887003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8380295,"threshold_uncertainty_score":0.6430082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021665984","doi":"10.1007/s10479-005-2038-0","title":"Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":80,"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":"Heuristics; Theory of computation; Heuristic; Maximization; Computer science; Greedy algorithm; Mathematical optimization; Extension (predicate logic); Upper and lower bounds; Simple (philosophy); Computational complexity theory; Transit (satellite); Algorithm; Mathematics; Public transport; Transport engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2356324665256801,"gpt":0.4466647061607565,"spread":0.2110322396350764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002988445,0.00003833937,0.0000801331,0.0002010508,0.0002823977,0.00004904943,0.0001790439,0.00004486274,0.0001036904],"category_scores_gemma":[0.0002676725,0.0000325232,0.00002529277,0.001039975,0.0001490457,0.0002698122,0.000003197333,0.00009653725,0.000005373388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002169197,"about_ca_system_score_gemma":0.0002177815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673354,"about_ca_topic_score_gemma":0.004664484,"domain_scores_codex":[0.9983442,0.0005001883,0.000269539,0.00009798696,0.0006182819,0.0001697617],"domain_scores_gemma":[0.9989729,0.0001890499,0.00002465149,0.0001201406,0.0006648771,0.00002838062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007259577,0.0007509284,0.001066835,0.00003289842,0.00001788127,0.000001662436,0.1526456,0.772374,0.003789108,0.04094763,0.001783838,0.02651705],"study_design_scores_gemma":[0.00727166,0.002878924,0.1782396,0.00157179,0.00007967168,0.000005007806,0.2604828,0.1042296,0.1759715,0.003194711,0.2646494,0.001425357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9130157,0.001015043,0.01444823,0.04584089,0.00004670785,0.0009787537,0.00002410769,0.00002089264,0.02460968],"genre_scores_gemma":[0.9982101,0.0005050338,0.0007712635,0.0001334187,0.00004005018,0.00002548605,0.00002740839,0.000003480184,0.0002837185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6681444,"threshold_uncertainty_score":0.2602892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224239365","doi":"10.1007/s10479-022-04673-9","title":"A flexible robust model for blood supply chain network design problem","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Supply chain; Robustness (evolution); Supply chain network; Facility location problem; Network planning and design; Computer science; Robust optimization; Blood supply; Coronavirus disease 2019 (COVID-19); Risk analysis (engineering); Operations research; Supply chain risk management; Supply chain management; Operations management; Service management; Mathematical optimization; Business; Engineering; Computer network; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.3244326607639991,"gpt":0.398151544860401,"spread":0.07371888409640187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004562505,0.00009522394,0.0001435632,0.0004392861,0.001646387,0.000342675,0.0003692384,0.0000352212,0.001063497],"category_scores_gemma":[0.0002226787,0.00009551875,0.00007400344,0.001211837,0.00005652349,0.001075436,0.0002091777,0.0002821896,0.00002701291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006637101,"about_ca_system_score_gemma":0.0001863927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003417534,"about_ca_topic_score_gemma":0.0001680168,"domain_scores_codex":[0.9982622,0.0001106852,0.0003078862,0.0002665401,0.000657299,0.0003954385],"domain_scores_gemma":[0.9983333,0.0002254608,0.00005235323,0.000226204,0.001143216,0.00001940712],"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.0001065236,0.0003830075,0.00007123788,0.00005021524,0.00004128416,0.000001148602,0.0001072554,0.799068,0.0003202422,0.1535303,0.04512588,0.001194862],"study_design_scores_gemma":[0.0006646686,0.00008463656,0.00003726387,0.0000135041,0.00002487425,0.000001415739,0.0003114746,0.9480292,0.0004782607,0.009679021,0.04055076,0.0001248811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04289546,0.001915284,0.7160057,0.177558,0.0004460497,0.0103007,0.0001975889,0.0004224442,0.05025868],"genre_scores_gemma":[0.9531707,0.0001404916,0.03195177,0.002802909,0.0004580788,0.002004987,0.0001575584,0.00004473333,0.009268739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9102753,"threshold_uncertainty_score":0.9998497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014530950","doi":"10.1007/s10479-008-0339-9","title":"Optimal location with equitable loads","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Theory of computation; Tabu search; Facility location problem; Heuristic; Computer science; Path (computing); Tree (set theory); Mathematics; Algorithm; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.2937564709182184,"gpt":0.3996784297114063,"spread":0.1059219587931879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001037647,0.00008326268,0.0001067201,0.0004380933,0.0006146334,0.0001051434,0.0002467281,0.00003076024,0.0008852074],"category_scores_gemma":[0.0001881586,0.00007133409,0.00002760074,0.001405374,0.0001841876,0.001160384,0.0001487006,0.0001194677,0.0008167947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001155295,"about_ca_system_score_gemma":0.00009470937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004622643,"about_ca_topic_score_gemma":0.001198462,"domain_scores_codex":[0.998562,0.00002401992,0.0002363963,0.0002096182,0.0006248402,0.0003430992],"domain_scores_gemma":[0.9974495,0.000012645,0.00001214298,0.0003261869,0.002182867,0.00001665154],"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.0001235167,0.000611051,0.003040914,0.0002789424,0.00006954143,0.00000916577,0.0003897836,0.789597,0.0007563955,0.1039855,0.09911998,0.00201814],"study_design_scores_gemma":[0.00151617,0.0003611674,0.0529393,0.0001739589,0.00003100403,0.00001035121,0.003543099,0.6741366,0.006029896,0.0004174869,0.2600251,0.0008159208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9483643,0.0001685689,0.005568886,0.009128059,0.00006948532,0.0004903739,0.000002494967,0.00005623693,0.03615164],"genre_scores_gemma":[0.9927059,0.0001022831,0.0005174105,0.0004360171,0.0001558804,0.00006951313,0.00005198074,0.00001064051,0.005950353],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1609051,"threshold_uncertainty_score":0.9999612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1552630275","doi":"10.1023/a:1023307319633","title":"An Oligopolistic Investment Model of the Finnish Electricity Market","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Oligopoly; Economics; Microeconomics; Investment (military); Electricity market; Mixed complementarity problem; Production (economics); Stochastic programming; Market power; Complementarity (molecular biology); Industrial organization; Electricity; Mathematical optimization; Cournot competition; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1255670274870545,"gpt":0.3778045452850975,"spread":0.252237517798043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127326,0.00007492432,0.0001249031,0.000194934,0.0001303452,0.00003265295,0.0002754274,0.00005793477,0.0000670331],"category_scores_gemma":[0.0004671841,0.00006177615,0.00003732978,0.0008744274,0.00006780493,0.0001624001,0.00001683147,0.0001783233,0.000003823217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004001451,"about_ca_system_score_gemma":0.0002111869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000869186,"about_ca_topic_score_gemma":0.00005610067,"domain_scores_codex":[0.9985654,0.0003403962,0.0002801816,0.0001145062,0.0004298906,0.0002696493],"domain_scores_gemma":[0.9988033,0.00007013919,0.00001496211,0.0004511368,0.0005973569,0.00006311165],"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.000002772616,0.00007340722,0.0001149642,0.00003633664,0.00002093655,1.367658e-7,0.0001807936,0.955979,0.01019481,0.02384201,0.009482115,0.00007276621],"study_design_scores_gemma":[0.00007192756,0.00005518549,0.0002566787,0.00001572469,0.000002818326,0.000001084803,0.00002032711,0.8998146,0.09886017,0.000682366,0.0001630183,0.00005606518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7461169,0.001395268,0.09345528,0.0005384859,0.00017246,0.001631322,0.0000890156,0.0001098166,0.1564914],"genre_scores_gemma":[0.9975349,0.0001745989,0.001437196,0.00004586382,0.00001045164,0.00004462354,0.000004349335,0.00001678867,0.0007312396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2514179,"threshold_uncertainty_score":0.2519158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505327332","doi":"10.1023/a:1018925302021","title":"The management of high seas fisheries","year":2000,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Marine and fisheries research","field":"Environmental Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Fish stock; Exclusive economic zone; Fisheries management; Stock (firearms); Negotiation; Fishery; Fishing; United Nations Convention on the Law of the Sea; Geography; International waters; Herring; Territorial waters; Business; International law; Political science; Fish <Actinopterygii>; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.1135251018553638,"gpt":0.3874397394850085,"spread":0.2739146376296447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001108471,0.00005414436,0.00008272373,0.00003186145,0.0004484512,0.00006821547,0.0004916294,0.00002725495,0.03777591],"category_scores_gemma":[0.00003209793,0.00003743159,0.00003689225,0.0005625743,0.00076906,0.0001878037,0.0003029745,0.0001456614,0.0002540692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001306884,"about_ca_system_score_gemma":0.00001826599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003233886,"about_ca_topic_score_gemma":0.0005223978,"domain_scores_codex":[0.9983447,0.0001545347,0.0002058288,0.0001531047,0.000827555,0.0003143298],"domain_scores_gemma":[0.999314,0.00008063476,0.000008614073,0.0004380914,0.00009479005,0.00006390947],"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.0001949041,0.0003043164,0.01008432,0.0000571071,0.0001097685,0.00001273873,0.0004927715,0.002359651,0.0003987018,0.01873981,0.08669113,0.8805548],"study_design_scores_gemma":[0.0002124918,0.0003100478,0.0673278,0.00001324284,0.000003388001,0.000001627092,0.0006690837,0.001684314,0.005226525,0.001853112,0.9225883,0.0001100241],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4592609,0.00002760181,0.000008235394,0.007443259,0.00001045609,0.0002568139,0.000007898613,0.000005024391,0.5329798],"genre_scores_gemma":[0.8916878,0.003350896,0.0004886165,0.00005142399,0.00001596025,0.00007304527,0.000007540091,0.000007689163,0.1043171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8804448,"threshold_uncertainty_score":0.9631037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015067034","doi":"10.1007/s10479-010-0806-y","title":"An interior-point Benders based branch-and-cut algorithm for mixed integer programs","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Benders' decomposition; Branch and cut; Mathematics; Theory of computation; Cutting-plane method; Mathematical optimization; Integer programming; Integer (computer science); Branch and bound; Interior point method; Steiner tree problem; Facility location problem; Algorithm; Point (geometry); Linear programming relaxation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1365524725644542,"gpt":0.441505552289733,"spread":0.3049530797252788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224477,0.0001102969,0.0001624422,0.0002917816,0.0001817043,0.0001782732,0.0002221505,0.0001103047,0.00007434417],"category_scores_gemma":[0.000390454,0.0001085241,0.00005348984,0.0003477292,0.0001435914,0.00029062,0.00003407482,0.0003919568,0.000004640194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001309243,"about_ca_system_score_gemma":0.00008121122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007413854,"about_ca_topic_score_gemma":0.0003181178,"domain_scores_codex":[0.9987593,0.0001632411,0.0002827045,0.000210422,0.0002485669,0.0003357392],"domain_scores_gemma":[0.9984454,0.0001795095,0.00001166094,0.0003495142,0.0008679154,0.0001459795],"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.00002424964,0.0001871285,0.0002520703,0.0001485513,0.00008035546,0.000001285362,0.001296714,0.1411255,0.1241296,0.001613991,0.001366595,0.729774],"study_design_scores_gemma":[0.0002418368,0.0001762105,0.0001501756,0.00002322857,0.000002921528,0.000001759441,0.0001819359,0.9078565,0.09031888,0.00009969332,0.0008400726,0.0001068419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1669431,0.00004290664,0.83047,0.001267431,0.0001620622,0.0006928781,0.00003297127,0.0001294769,0.0002591589],"genre_scores_gemma":[0.6930179,0.00002222319,0.3064849,0.00003877304,0.00006884748,0.0001884705,0.0000613879,0.00003668903,0.00008084996],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.766731,"threshold_uncertainty_score":0.4425485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134125472","doi":"10.1007/s10479-015-1805-9","title":"Multi-period hub network design problems with modular capacities","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer programming; Theory of computation; Modular design; Mathematical optimization; Set (abstract data type); Integer (computer science); Computer science; Relevance (law); Linear programming; Measure (data warehouse); Network planning and design; Facility location problem; Mathematics; Algorithm; Data mining; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.4236026363841622,"gpt":0.4270872876495254,"spread":0.003484651265363181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003030585,0.0001129997,0.0001739717,0.0001853737,0.0001977671,0.0001153203,0.0002168053,0.00007442728,0.00003358764],"category_scores_gemma":[0.0003531557,0.0001001345,0.00002413104,0.0007500416,0.0002073928,0.000281846,0.00003958587,0.0002760809,0.00002554212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002924066,"about_ca_system_score_gemma":0.0001682493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008129709,"about_ca_topic_score_gemma":0.00004301411,"domain_scores_codex":[0.998203,0.0004764373,0.0002514996,0.0001617457,0.0004870005,0.0004203268],"domain_scores_gemma":[0.9981002,0.0000960548,0.00001112547,0.0003346659,0.001306101,0.0001518484],"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.000009908865,0.00002956143,0.0001034528,0.00002742907,0.00003802594,0.000002496632,0.002188192,0.9925668,0.001750894,0.0003368572,0.0025809,0.0003655474],"study_design_scores_gemma":[0.0002748753,0.0001640618,0.00009300734,0.00005675399,0.000002767667,0.000005757058,0.0006774158,0.9898185,0.008012553,0.0000784064,0.0006918841,0.000123991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05036964,0.0008197482,0.9464127,0.0005478611,0.0000618069,0.0005942094,0.000008949533,0.0001541651,0.001030869],"genre_scores_gemma":[0.4729449,0.00009547545,0.5260765,0.00001816548,0.00007373457,0.0001080586,0.0000106205,0.0000398448,0.0006327549],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4225752,"threshold_uncertainty_score":0.4083366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999993900","doi":"10.1007/s10479-011-0983-3","title":"An efficient memetic algorithm for the graph partitioning problem","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":68,"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":"Memetic algorithm; Crossover; Graph partition; Tabu search; Theory of computation; Computer science; Partition (number theory); Mathematical optimization; Vertex (graph theory); Graph; Operator (biology); Algorithm; Mathematics; Local search (optimization); Theoretical computer science; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2813694063939959,"gpt":0.4229850109156691,"spread":0.1416156045216732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202923,0.00005816322,0.00007330772,0.0001621611,0.0002889748,0.00005355705,0.0002204253,0.00003806523,0.00008303539],"category_scores_gemma":[0.00003301184,0.00004283642,0.00004252242,0.0003134352,0.00009213248,0.0001050701,0.00001606404,0.0001264926,0.000008248219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005912706,"about_ca_system_score_gemma":0.00002461622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050349,"about_ca_topic_score_gemma":0.00002964633,"domain_scores_codex":[0.9992294,0.00006272864,0.0001656778,0.0001001503,0.000201854,0.0002401826],"domain_scores_gemma":[0.9991231,0.00008397788,0.000005315881,0.0002553157,0.0004830297,0.00004924818],"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.00002849236,0.0009361677,0.0001076322,0.0002232886,0.0003217211,0.000005417849,0.01157872,0.3523674,0.05111108,0.09277878,0.02786426,0.462677],"study_design_scores_gemma":[0.00007189998,0.0002685682,0.0002333571,0.00002344878,0.00000514884,0.000001302508,0.000280186,0.8035454,0.1927314,0.001918901,0.0008393413,0.00008099098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01820221,0.0006909059,0.9758065,0.0002322979,0.00004456684,0.001122236,0.00003954297,0.0001793429,0.003682409],"genre_scores_gemma":[0.9445738,0.0002558506,0.05436609,0.00001841217,0.00004194152,0.0006407353,0.00001088421,0.00001848092,0.00007381877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9263716,"threshold_uncertainty_score":0.222259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119909670","doi":"10.1007/s10479-020-03871-7","title":"Designing a hybrid reinforcement learning based algorithm with application in prediction of the COVID-19 pandemic in Quebec","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Concordia University","funders":"","keywords":"Pandemic; Reinforcement learning; Computer science; Coronavirus disease 2019 (COVID-19); Artificial intelligence; Dominance (genetics); Operations research; Machine learning; Mathematics; Medicine; Infectious disease (medical specialty)","retraction":null,"screen_n_in":null,"score":{"opus":0.5094805475649316,"gpt":0.5179004433015533,"spread":0.008419895736621719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00462105,0.00008184677,0.0002410691,0.0001891229,0.0002046875,0.00001873986,0.0001723988,0.00005019519,0.00003397849],"category_scores_gemma":[0.01207499,0.00005673341,0.00004381246,0.000958915,0.0001803666,0.00009293568,0.0001341362,0.0003947193,0.000001369429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002076199,"about_ca_system_score_gemma":0.0007575557,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01664367,"about_ca_topic_score_gemma":0.02773248,"domain_scores_codex":[0.9973591,0.001145002,0.0005222323,0.0002418579,0.0004888922,0.000242933],"domain_scores_gemma":[0.9962699,0.002743102,0.00007268716,0.0002975533,0.0005662053,0.00005059597],"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.00008901957,0.000347984,0.1806831,0.0003114766,0.0000449453,0.000008808895,0.001904088,0.7968555,0.006729606,0.004275776,0.0008157037,0.00793405],"study_design_scores_gemma":[0.001652542,0.0004222928,0.03106606,0.0004288506,0.00001488626,0.000006361096,0.002873207,0.927181,0.02594681,0.007569334,0.002637935,0.000200718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3146896,0.0003050949,0.6721646,0.01107558,0.00001187425,0.001415169,0.00001612675,0.00003280291,0.0002891753],"genre_scores_gemma":[0.9917935,0.0001673778,0.006963104,0.0003119796,0.00001344774,0.0003604238,0.00002017978,0.000008237163,0.0003617282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6771039,"threshold_uncertainty_score":0.9962467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088808478","doi":"10.1007/s10479-014-1623-5","title":"Modeling the impact of donor behavior on humanitarian aid operations","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Cash; Donation; Extant taxon; Quality (philosophy); Computer science; Business; Operations research; Marketing; Finance; Political science; Law; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2543970857097044,"gpt":0.4529091149931896,"spread":0.1985120292834852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955285,0.00009203729,0.0001330883,0.0004483852,0.0007732715,0.0003632466,0.000340539,0.00004660312,0.0008275568],"category_scores_gemma":[0.0006133469,0.0000609427,0.0001082745,0.0005956145,0.0001023727,0.001114791,0.00007261867,0.0002345626,0.0001145202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000663952,"about_ca_system_score_gemma":0.00007939807,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009770183,"about_ca_topic_score_gemma":0.003202261,"domain_scores_codex":[0.9987061,0.0001036309,0.0003244644,0.0001700979,0.0004946625,0.0002010127],"domain_scores_gemma":[0.9978095,0.0001319451,0.00002801257,0.0003590026,0.001655543,0.00001599295],"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.00007741519,0.001069437,0.001307144,0.00003255222,0.00008076054,8.57625e-7,0.0003666739,0.5930725,0.003918378,0.3919336,0.002472468,0.005668245],"study_design_scores_gemma":[0.0006086638,0.0002001308,0.006492015,0.00004712812,0.00003647881,0.000001018694,0.0006741921,0.9852991,0.001323078,0.001050204,0.004107144,0.0001608475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9713479,0.00003298343,0.0008335573,0.006685885,0.00005123748,0.0004368334,0.00001024313,0.00001810694,0.02058324],"genre_scores_gemma":[0.9988146,0.00004003381,0.0001185117,0.0003744289,0.0002316679,0.00007737664,0.00003513691,0.00001376256,0.0002944134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3922266,"threshold_uncertainty_score":0.9968238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029114129","doi":"10.1007/s10479-020-03642-4","title":"The distributionally robust optimization model for a remanufacturing system under cap-and-trade policy: a newsvendor approach","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Taishan Scholar Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Newsvendor model; Remanufacturing; Theory of computation; Robust optimization; Computer science; Mathematical optimization; Operations research; Business; Mathematics; Supply chain; Algorithm; Manufacturing engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.211452882669301,"gpt":0.3585557259986584,"spread":0.1471028433293574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383136,0.0001249076,0.0001552225,0.0002518339,0.001144884,0.0007074281,0.0003564857,0.00004960952,0.000005849247],"category_scores_gemma":[0.0007357139,0.00009834362,0.00006855428,0.0007253635,0.0001277189,0.0006262959,0.0003159359,0.0001549235,0.000004059075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006342533,"about_ca_system_score_gemma":0.0001592249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004490515,"about_ca_topic_score_gemma":0.00003970711,"domain_scores_codex":[0.9983717,0.00005011499,0.0003179887,0.0003048619,0.000518196,0.0004371205],"domain_scores_gemma":[0.9988301,0.0001338297,0.00005370325,0.0002412267,0.0007062366,0.00003493788],"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.00004068292,0.00002469035,0.00001174982,0.000332202,0.00003407374,4.813621e-7,0.00009476194,0.740553,0.00001079631,0.2521252,0.006555058,0.0002172331],"study_design_scores_gemma":[0.0002816373,0.0000137666,0.00005887838,0.00001970103,0.00001282876,4.156832e-7,0.003859743,0.9904422,0.00003450526,0.0007275867,0.004451386,0.0000973666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002183971,0.0001789967,0.8452778,0.1479245,0.00002155882,0.001743512,0.00003246156,0.00006717535,0.00257009],"genre_scores_gemma":[0.9917777,0.00005709004,0.004917963,0.001537255,0.0005705901,0.0004312281,0.000195561,0.00003020572,0.0004824157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9895937,"threshold_uncertainty_score":0.880564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021293262","doi":"10.1007/s10479-015-1827-3","title":"Bounded and discrete data and Likert scales in data envelopment analysis: application to regional energy efficiency in China","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; China Scholarship Council; Tongji University; National Natural Science Foundation of China; Worcester Polytechnic Institute","keywords":"Data envelopment analysis; Bounded function; Likert scale; Theory of computation; Scale (ratio); Computer science; Integer (computer science); Mathematical optimization; Limit (mathematics); Mathematics; Econometrics; Statistics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.4963289187534319,"gpt":0.5551049537861926,"spread":0.05877603503276069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01870993,0.0001104178,0.0003435236,0.002614325,0.0002188638,0.0004597921,0.002211734,0.00006096635,0.00001003197],"category_scores_gemma":[0.00507916,0.00008760732,0.00002162023,0.007360482,0.0003802585,0.0008185374,0.002059232,0.0001682711,0.00001251582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000294386,"about_ca_system_score_gemma":0.0003754557,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004686029,"about_ca_topic_score_gemma":0.05588389,"domain_scores_codex":[0.9948581,0.0007552446,0.0008066187,0.001104034,0.002141858,0.0003340883],"domain_scores_gemma":[0.9960197,0.0005971433,0.00005783502,0.002399553,0.0006996355,0.0002261763],"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.0005702125,0.003131549,0.3209794,0.00003739313,0.0005296357,0.00004401708,0.02386037,0.3315843,0.004220561,0.06042818,0.06010867,0.1945057],"study_design_scores_gemma":[0.0002117237,0.00005861431,0.1041348,0.00001976306,0.00001179232,0.000001908751,0.001356156,0.8838865,0.0001276392,0.002955768,0.007102573,0.0001328133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9245676,0.001341038,0.04288859,0.03016084,0.00001644384,0.0003492586,0.0001396166,0.000008059783,0.000528535],"genre_scores_gemma":[0.9962321,0.0004274396,0.002636353,0.00015721,0.00001780149,0.00002768443,0.0002934306,0.000005468713,0.000202547],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5523022,"threshold_uncertainty_score":0.9613438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034123046","doi":"10.1007/s10479-020-03667-9","title":"A new inverse DEA cost efficiency model for estimating potential merger gains: a case of Canadian banks","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Data envelopment analysis; Restructuring; Cost efficiency; Mergers and acquisitions; Efficiency; Industrial organization; Inverse; Computer science; Economics; Econometrics; Operational efficiency; Operations research; Mathematical optimization; Finance; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.6036382136610892,"gpt":0.5492192108670334,"spread":0.05441900279405576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006081755,0.0001259558,0.0003522372,0.002003917,0.0007503182,0.000259992,0.0008884708,0.0000934768,0.0003242521],"category_scores_gemma":[0.01936851,0.0001065719,0.000216244,0.005337822,0.0002593492,0.0003858757,0.0001477859,0.000249966,0.00006134489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949458,"about_ca_system_score_gemma":0.002921251,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.09185468,"about_ca_topic_score_gemma":0.1386813,"domain_scores_codex":[0.9961898,0.0003657394,0.0009632908,0.0005289089,0.001389682,0.0005625882],"domain_scores_gemma":[0.9937767,0.0007739086,0.0001005996,0.0005984453,0.004117687,0.000632663],"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.00002163771,0.00005209911,0.00002333353,0.00001032284,0.00002058512,0.00003668784,0.003082033,0.9503102,0.003398862,0.001612225,0.03499695,0.006435093],"study_design_scores_gemma":[0.0002070213,0.0001265501,0.00001054411,0.00001736539,0.00001240981,0.00001267745,0.000952432,0.9958854,0.001703573,0.0004764604,0.0004965997,0.00009901116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3668916,0.0001266593,0.6068343,0.02402836,0.00006809559,0.0008892319,0.0002546534,0.00001366993,0.000893497],"genre_scores_gemma":[0.9318385,0.00001031379,0.06687302,0.0004589568,0.00006924995,0.00002798197,0.00001246931,0.00001344226,0.0006961299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5649469,"threshold_uncertainty_score":0.9888918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W194305686","doi":"10.1023/a:1019288220413","title":"Maximization of Manufacturing Yield of Systems with Arbitrary Distributions of Component Values","year":2000,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Bounded function; Hypercube; Monte Carlo method; Mathematical optimization; Probability density function; Nonlinear system; Mathematics; Applied mathematics; Function (biology); Random variable; Yield (engineering); Computer science; Algorithm; Discrete mathematics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.4890581218960466,"gpt":0.5390253233917611,"spread":0.04996720149571454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004335475,0.00009099196,0.0003809317,0.0004488743,0.0001436658,0.00005635909,0.0005394144,0.000060196,0.0008130998],"category_scores_gemma":[0.000819845,0.00006642669,0.00008376158,0.0009299661,0.0005356341,0.0003709786,0.00007927034,0.0001426238,0.0000120042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001337286,"about_ca_system_score_gemma":0.0001562293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009106672,"about_ca_topic_score_gemma":0.00001264912,"domain_scores_codex":[0.9958913,0.0008344238,0.0009583235,0.0002469996,0.001863795,0.0002051035],"domain_scores_gemma":[0.9963526,0.001215292,0.0001265681,0.0005961391,0.001631431,0.00007797206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009829028,0.002134815,0.003114894,0.000238739,0.00023186,0.000006994289,0.003032923,0.5470456,0.4013068,0.02345353,0.003229073,0.01522192],"study_design_scores_gemma":[0.0001676814,0.0005530567,0.006908783,0.0001590534,0.000005099046,0.00000375129,0.001187138,0.01695572,0.9730361,0.0008245536,0.0001284679,0.0000706053],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9783577,0.0004966091,0.01391819,0.0003098703,0.00002724262,0.0004809664,0.0002128262,0.000006137822,0.006190505],"genre_scores_gemma":[0.9845866,0.0001355582,0.01434573,0.000005161085,0.00001252524,0.00002269939,0.00002148942,0.000007808841,0.0008624367],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5717293,"threshold_uncertainty_score":0.8902873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2730563372","doi":"10.1007/s10479-017-2567-3","title":"A meta-heuristic for capacitated green vehicle routing problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Alternative fuel vehicle; Heuristic; Routing (electronic design automation); Ant colony optimization algorithms; Computer science; Ant colony; Engineering; Automotive engineering; Alternative fuels; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.484601735208781,"gpt":0.4827331472826162,"spread":0.001868587926164789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003346347,0.0001128388,0.0002647818,0.0001947424,0.0009408182,0.0002664422,0.0004654481,0.00007604043,0.00006869796],"category_scores_gemma":[0.001574576,0.00010647,0.0001115833,0.0002111662,0.0001482046,0.0003583836,0.00008206911,0.0002348101,0.00001868209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001807021,"about_ca_system_score_gemma":0.00006744803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004457489,"about_ca_topic_score_gemma":0.0001059768,"domain_scores_codex":[0.9985015,0.0001986344,0.000359147,0.0001951215,0.0003313633,0.0004142663],"domain_scores_gemma":[0.9976161,0.0003345516,0.00003357404,0.0006109081,0.001311328,0.00009354784],"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.00002407703,0.00008326255,0.000317481,0.0002889801,0.001139162,0.000003238305,0.001875704,0.9496488,0.02237333,0.01333548,0.003073616,0.007836887],"study_design_scores_gemma":[0.0002671024,0.00007728803,0.0006355938,0.00002915499,0.00006027886,0.000001334555,0.00009838126,0.969481,0.02763108,0.0009097417,0.0006717138,0.0001373475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5202175,0.001311334,0.4255792,0.01409092,0.0003357139,0.004543619,0.0004875785,0.0006716257,0.03276243],"genre_scores_gemma":[0.9159498,0.00005542617,0.08214051,0.00002067483,0.00006879518,0.0002439795,0.00001716341,0.00004218992,0.001461426],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3957323,"threshold_uncertainty_score":0.7236108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109343421","doi":"10.1007/s10479-012-1298-8","title":"An integrated optimization model for fuel management and fire suppression preparedness planning","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Fogarty International Center; Bushfire Cooperative Research Centre","keywords":"Preparedness; Theory of computation; Integer programming; Computer science; Operations research; Emergency management; Engineering; Economics; Algorithm; Management","retraction":null,"screen_n_in":null,"score":{"opus":0.1433380873892168,"gpt":0.4245741071868484,"spread":0.2812360197976316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002817641,0.00006548547,0.00007559145,0.0001431511,0.0001381923,0.0001314587,0.0001067827,0.00005153845,0.00005212901],"category_scores_gemma":[0.00003348587,0.00006062774,0.00001450564,0.0001718471,0.00003336492,0.0004667529,0.00002573805,0.00007952555,0.000002796096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001302704,"about_ca_system_score_gemma":0.00002032735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002881273,"about_ca_topic_score_gemma":0.00001297554,"domain_scores_codex":[0.999341,0.00003645275,0.0001660684,0.0001236193,0.0001696288,0.0001632276],"domain_scores_gemma":[0.9991903,0.00002925853,0.000006472597,0.0001692472,0.0005379716,0.0000667243],"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.000007711159,0.00003007546,0.00003101193,0.0001016142,0.00001409777,1.399469e-7,0.001157082,0.9924835,0.0004187233,0.0005202894,0.002690851,0.002544889],"study_design_scores_gemma":[0.0001505504,0.00004119349,0.0001797246,0.00004153584,0.000002290363,2.956528e-7,0.0009192149,0.9980751,0.0002496366,0.0001844706,0.00009094534,0.00006501683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3306741,0.0002519856,0.6671296,0.0002468274,0.00002808379,0.0007788872,0.00003715573,0.0000711988,0.0007822046],"genre_scores_gemma":[0.96474,0.00034488,0.03363736,0.00002473875,0.00001074754,0.0002921675,0.0002232168,0.00001766933,0.0007092667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6340659,"threshold_uncertainty_score":0.2472328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3093320459","doi":"10.1007/s10479-020-03813-3","title":"A multi-objective distributionally robust model for sustainable last mile relief network design problem","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Ambiguity; Computer science; Mile; Operations research; Natural disaster; Mathematical optimization; Emergency management; Network planning and design; Set (abstract data type); Economics; Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.3112154428233858,"gpt":0.3813135937394925,"spread":0.07009815091610672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894355,0.0001266534,0.0001697231,0.0001664842,0.0007754712,0.0002757872,0.0003379134,0.00005460306,0.0001602612],"category_scores_gemma":[0.001083117,0.0001250167,0.00008650313,0.001150429,0.00009330714,0.0009719737,0.0002633268,0.0001612261,0.0001157781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003102043,"about_ca_system_score_gemma":0.0001948391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009039771,"about_ca_topic_score_gemma":0.0006530719,"domain_scores_codex":[0.9982233,0.0000536229,0.000369398,0.0003541003,0.0004491536,0.0005504301],"domain_scores_gemma":[0.9958248,0.00005279827,0.00002474181,0.0002130781,0.003845767,0.00003882643],"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.00009135505,0.0001648926,0.0000401974,0.0002239238,0.00003183099,8.120563e-7,0.0001403414,0.7816539,0.00007014153,0.06670995,0.1507371,0.0001355895],"study_design_scores_gemma":[0.000352154,0.00005345007,0.0002078727,0.00001926687,0.000009182118,5.705617e-8,0.0007646526,0.9804869,0.00006903944,0.001412864,0.01649627,0.0001282844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002922722,0.0001405917,0.9671536,0.02500885,0.00003020235,0.002538568,0.00003530099,0.00007040027,0.002099731],"genre_scores_gemma":[0.943083,0.0001066997,0.04385225,0.002601552,0.000587825,0.001285607,0.0005344074,0.00003832471,0.007910307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9401603,"threshold_uncertainty_score":0.5964376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2741806916","doi":"10.1007/s10479-017-2593-1","title":"A modular capacitated multi-objective model for locating maritime search and rescue vessels","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Backup; Coast guard; Computer science; Search and rescue; Operations research; Modular design; Artificial intelligence; Marine engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.385724764705991,"gpt":0.4452719322457438,"spread":0.05954716753975281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002602741,0.0001170438,0.000173028,0.0004106442,0.001793859,0.000675811,0.0004343125,0.00005983942,0.00005324422],"category_scores_gemma":[0.001614383,0.0001164993,0.00005403024,0.0002340186,0.0003070985,0.001417757,0.0003741682,0.000178864,0.00004860806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001493804,"about_ca_system_score_gemma":0.00007366948,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01548532,"about_ca_topic_score_gemma":0.009635084,"domain_scores_codex":[0.9984764,0.00003993677,0.0003015001,0.0003594302,0.0004222442,0.0004004154],"domain_scores_gemma":[0.9967263,0.00003039731,0.00001561281,0.0005897449,0.002608933,0.00002902337],"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.0001426553,0.0004996681,0.0009225657,0.001004596,0.0001537357,0.000002421655,0.001609619,0.8765498,0.008790483,0.09779939,0.003090966,0.009434088],"study_design_scores_gemma":[0.0004112599,0.00002032638,0.007390127,0.00004722612,0.000007085597,1.589685e-7,0.0007745636,0.9895367,0.0007429799,0.0006048416,0.0003426199,0.0001220792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.942843,0.0001287957,0.04165025,0.01152571,0.00007417666,0.001573363,0.00004660686,0.00004105358,0.002117062],"genre_scores_gemma":[0.9935303,0.00009072202,0.00260089,0.000223995,0.0001025895,0.0002130643,0.000050694,0.00001883151,0.003168931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1129869,"threshold_uncertainty_score":0.9995057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}