{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":25,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"35770617e078","filters":{"venue":"Operations Research Forum"}},"results":[{"id":"W3192162026","doi":"10.1007/s43069-021-00068-x","title":"Review on Nature-Inspired Algorithms","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Variety (cybernetics); Process (computing); Set (abstract data type); Engineering optimization; Class (philosophy); Optimization problem; Optimization algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0741606981322478,"gpt":0.4232050557761675,"spread":0.3490443576439197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002468393,0.0001659463,0.000255583,0.0003871894,0.0009381186,0.0008437899,0.001465656,0.0001416585,0.0008183386],"category_scores_gemma":[0.004517947,0.0001470965,0.00009962286,0.003391905,0.0001190771,0.0005845781,0.0008544985,0.001275777,0.001577265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000164611,"about_ca_system_score_gemma":0.001167298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002756389,"about_ca_topic_score_gemma":0.00005338913,"domain_scores_codex":[0.9950325,0.001091144,0.0003902213,0.0007993567,0.001857011,0.0008297664],"domain_scores_gemma":[0.9949064,0.00037663,0.00001941156,0.001779045,0.002581081,0.0003374302],"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.000005638134,0.0006054961,0.00002060992,0.0002728491,0.00006694319,0.0003351245,0.00009463616,0.004261764,0.0005812115,0.4910029,0.3465004,0.1562524],"study_design_scores_gemma":[0.0003998989,0.0001800544,0.00006100886,0.0005694765,0.000003643612,0.00006192591,0.00004794818,0.6004558,0.004883293,0.0009243212,0.3921466,0.0002660197],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005690078,0.03235608,0.763772,0.1513978,0.0008355463,0.001591514,0.00004650449,0.0003001503,0.04964351],"genre_scores_gemma":[0.01001656,0.06361721,0.8239211,0.02512441,0.0004860993,0.001170295,0.0003686439,0.0001053057,0.07519036],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.596194,"threshold_uncertainty_score":0.9992001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388929300","doi":"10.1007/s43069-023-00277-6","title":"ChatGPT-Based Investment Portfolio Selection","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Portfolio; Portfolio optimization; Selection (genetic algorithm); Investment strategy; Black–Litterman model; Computer science; Stock (firearms); Stock market; Econometrics; Economics; Artificial intelligence; Replicating portfolio; Financial economics; Microeconomics; Engineering; Context (archaeology)","retraction":null,"screen_n_in":null,"score":{"opus":0.2278071890230692,"gpt":0.4938378116246731,"spread":0.2660306226016039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0061098,0.0001125404,0.0001522955,0.001877382,0.001337607,0.0008453623,0.0004943343,0.00009784626,0.001379756],"category_scores_gemma":[0.002717878,0.00008799882,0.00008131851,0.007369616,0.000135702,0.0005942326,0.0001329938,0.0002659146,0.005655841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001089472,"about_ca_system_score_gemma":0.0006003122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002967562,"about_ca_topic_score_gemma":0.0009253775,"domain_scores_codex":[0.9953657,0.0005192712,0.0004967788,0.000494049,0.002492858,0.000631303],"domain_scores_gemma":[0.9974728,0.0004087379,0.0000342141,0.0005681656,0.001296526,0.0002195247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002328737,0.00009879877,0.01072267,0.000001385123,0.00001139332,0.00001132856,0.0002547049,0.4008622,0.001212439,0.03518013,0.5364633,0.01515834],"study_design_scores_gemma":[0.0002702723,0.0001509104,0.004837465,0.000006004721,0.000002199941,0.000003075213,0.0006966968,0.6314335,0.002165636,0.005442811,0.3548687,0.0001226684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6004482,0.0002867627,0.0719412,0.07616735,0.00198285,0.004127698,0.0001636176,0.001222522,0.2436598],"genre_scores_gemma":[0.9257899,0.0002593141,0.002446877,0.000732337,0.0001654772,0.0003359189,0.0002101835,0.00002852861,0.07003145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3253417,"threshold_uncertainty_score":0.9999625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4328121662","doi":"10.1007/s43069-023-00194-8","title":"Vaccine Allocation and Distribution: A Review with a Focus on Quantitative Methodologies and Application to Equity, Hesitancy, and COVID-19 Pandemic","year":2023,"lang":"en","type":"review","venue":"Operations Research Forum","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; McMaster University","funders":"","keywords":"Equity (law); Pandemic; Context (archaeology); Distribution (mathematics); Coronavirus disease 2019 (COVID-19); Management science; Resource allocation; Operations research; Computer science; Economics; Political science; Infectious disease (medical specialty); Geography; Engineering; Medicine; Disease","retraction":null,"screen_n_in":null,"score":{"opus":0.7992309039181115,"gpt":0.666315419516724,"spread":0.1329154844013875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009256306,0.0004019531,0.001669719,0.0002528905,0.001022615,0.0001485832,0.0002793328,0.0002224075,0.0000104995],"category_scores_gemma":[0.05353018,0.0002544407,0.00007786174,0.001267577,0.0002717325,0.0001213717,0.001185636,0.0006187764,0.00003376084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005964139,"about_ca_system_score_gemma":0.0003976588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003650713,"about_ca_topic_score_gemma":0.00378235,"domain_scores_codex":[0.9949403,0.002271033,0.0007669314,0.0009668004,0.0005083359,0.0005466411],"domain_scores_gemma":[0.9791231,0.0194659,0.0001449507,0.0005501715,0.0003864187,0.0003294201],"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.00006233263,0.00006459791,0.00008844129,0.04773297,0.000282918,0.000007963945,0.0001758415,0.00001810736,0.000001692247,0.3815365,0.01901431,0.5510144],"study_design_scores_gemma":[0.0004295158,0.001478645,0.0001127611,0.02048329,0.0006224939,0.00006995893,0.0004980748,0.0003924608,6.784304e-7,0.1034585,0.8718016,0.0006519688],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000008900591,0.8563906,0.1122804,0.02533627,0.000009924785,0.005490123,0.0002908799,0.0001347841,0.00005807812],"genre_scores_gemma":[0.00005506821,0.9834151,0.01041666,0.0004817148,0.0000327025,0.005111138,0.0002167241,0.00003855972,0.0002322813],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.8527873,"threshold_uncertainty_score":0.9999908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3118945546","doi":"10.1007/s43069-020-00044-x","title":"Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Branch and price; Arc routing; Technician; Column generation; Solver; Mathematical optimization; Integer programming; Scheduling (production processes); Algorithm; Routing (electronic design automation); Mathematics; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.08663084792724975,"gpt":0.3906069132587584,"spread":0.3039760653315087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001405516,0.0001052274,0.0001412426,0.000148666,0.0007093897,0.0003194404,0.00009159516,0.00009422775,0.00001389257],"category_scores_gemma":[0.000971488,0.0001139257,0.00002646807,0.0005558793,0.00005716102,0.0002394506,0.0001445868,0.0003215015,0.000004605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007360305,"about_ca_system_score_gemma":0.0000941519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001756763,"about_ca_topic_score_gemma":0.0001449991,"domain_scores_codex":[0.9987275,0.0001044136,0.0002262526,0.0002631751,0.0001798875,0.0004988004],"domain_scores_gemma":[0.999056,0.0001867021,0.000008101204,0.0001992801,0.0004353691,0.0001145083],"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.000005870209,0.00006396801,0.004415133,0.0002791048,0.00007911006,0.000006324045,0.0009732173,0.8501771,0.1005322,0.01715779,0.0003368355,0.02597334],"study_design_scores_gemma":[0.0004652655,0.00002342381,0.0003654577,0.00006896212,0.000005295811,0.00001595569,0.0005347442,0.9819887,0.01478677,0.00007613596,0.001532365,0.0001369125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04091056,0.0007605418,0.9553169,0.001795931,0.00004643449,0.000608667,0.00002793747,0.0002003837,0.0003326282],"genre_scores_gemma":[0.3859794,0.0001569897,0.6130509,0.00003354175,0.00003665817,0.0001619332,0.0000262541,0.00003544291,0.0005189059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3450688,"threshold_uncertainty_score":0.5456124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321599248","doi":"10.1007/s43069-022-00180-6","title":"A General Mathematical Framework for Constrained Mixed-variable Blackbox Optimization Problems with Meta and Categorical Variables","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Institut de Valorisation des Données; Hydro-Québec; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical variable; Computer science; Notation; Mathematical optimization; Optimization problem; Variable (mathematics); Continuous optimization; Context (archaeology); Flexibility (engineering); Artificial intelligence; Machine learning; Algorithm; Mathematics; Multi-swarm optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.07086614826535843,"gpt":0.3587239731420137,"spread":0.2878578248766552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227297,0.0002054589,0.0003095549,0.000383231,0.001004286,0.000726713,0.0004566224,0.0001395716,0.0000815658],"category_scores_gemma":[0.001141441,0.0001590106,0.00004865419,0.002275092,0.000286782,0.0009312758,0.0003327422,0.000313359,0.00002812877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008961015,"about_ca_system_score_gemma":0.0003817143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002497217,"about_ca_topic_score_gemma":0.00002121382,"domain_scores_codex":[0.9974763,0.0002178597,0.000318905,0.0006623509,0.0005715635,0.0007530208],"domain_scores_gemma":[0.9974421,0.0008191447,0.00003495538,0.0005255126,0.0009577597,0.000220491],"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.000005084732,0.00005112502,0.000003966135,0.00001592947,0.00007872802,0.000003104194,0.0001472444,0.5126109,0.00005606578,0.4863826,0.0003176774,0.0003275827],"study_design_scores_gemma":[0.0005155148,0.0002064717,0.000002671257,0.0000203797,0.00002934741,0.00003677673,0.0002104737,0.9276978,0.000179607,0.07007028,0.0008418868,0.000188741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005205443,0.0000494509,0.9928799,0.004550017,0.00006631016,0.001566616,0.00003759487,0.0002531507,0.0005448931],"genre_scores_gemma":[0.004531019,0.00006228236,0.9912503,0.00008746971,0.00005370134,0.001650578,0.0000946369,0.00003755248,0.002232397],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4163123,"threshold_uncertainty_score":0.7724254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4294405730","doi":"10.1007/s43069-022-00156-6","title":"A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis","year":2022,"lang":"en","type":"review","venue":"Operations Research Forum","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cluster analysis; Taxonomy (biology); Discipline; Computer science; Data science; Set (abstract data type); Cross disciplinary; Bibliometrics; Information retrieval; Data mining; Management science; Artificial intelligence; Social science; Sociology; Engineering; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.1684976250791352,"gpt":0.4663325407691728,"spread":0.2978349156900376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.001960763,0.0005449604,0.001785612,0.06859875,0.001729187,0.001197023,0.0009796082,0.0001321726,0.006044296],"category_scores_gemma":[0.00006411453,0.0004063128,0.00115701,0.2931336,0.0001324092,0.0004003675,0.0008819514,0.0021537,0.0001202902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003868974,"about_ca_system_score_gemma":0.0005366475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008361175,"about_ca_topic_score_gemma":0.0001181212,"domain_scores_codex":[0.9949032,0.001122702,0.0009223257,0.001019072,0.001283657,0.0007490155],"domain_scores_gemma":[0.9969006,0.0005452807,0.0002183143,0.001575534,0.0005606442,0.0001996701],"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.00001103191,0.00029864,0.0004057775,0.005174683,0.002286796,0.00001956976,0.00001876124,0.00567462,2.173051e-8,0.002204903,0.01704673,0.9668584],"study_design_scores_gemma":[0.00008855455,0.0002278386,0.00001982215,0.01518499,0.001571079,0.000005626716,0.00002100645,0.006728745,7.448413e-8,0.00002763431,0.9757156,0.0004090551],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000001550949,0.9735361,0.01290138,0.0001181097,0.00003913584,0.003129527,0.0003602498,0.00007225281,0.009841701],"genre_scores_gemma":[0.000100675,0.9759228,0.001209125,0.0000290516,0.0002260565,0.007679549,0.008928642,0.00007759242,0.005826489],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9664494,"threshold_uncertainty_score":0.9998398,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":["bibliometrics"],"domain":null,"study_design":"not_applicable","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics"],"domain":null,"study_design":"design_other","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W3079159037","doi":"10.1007/s43069-020-00016-1","title":"Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems","year":2020,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Constraint (computer-aided design); Computer science; Set (abstract data type); Degeneracy (biology); Exploit; Mathematical optimization; Scale (ratio); Column generation; Pairing; Algorithm; Operations research; Mathematics; Engineering; Aeronautics","retraction":null,"screen_n_in":null,"score":{"opus":0.05093061371344633,"gpt":0.3443331500059634,"spread":0.2934025362925171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380205,0.0001468963,0.0001785522,0.0001681877,0.0006380882,0.0002545572,0.0002156984,0.0001064538,0.0001128325],"category_scores_gemma":[0.0007745734,0.0001599214,0.00007222857,0.000601266,0.00007002995,0.0003886081,0.00009683592,0.0004013663,0.0000501553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001697329,"about_ca_system_score_gemma":0.0001162675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009334543,"about_ca_topic_score_gemma":0.0002224769,"domain_scores_codex":[0.9982376,0.00009636868,0.0003620795,0.0003016654,0.0003403761,0.0006618776],"domain_scores_gemma":[0.9989786,0.0001932866,0.00001473638,0.0002312858,0.0003916823,0.000190479],"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.00000638609,0.00002268914,0.0001665875,0.0001335123,0.00002374417,0.000001010652,0.0009410318,0.9762513,0.01236108,0.0008816796,0.001228201,0.007982754],"study_design_scores_gemma":[0.00051695,0.00008480371,0.00004589773,0.00006990637,0.000005850062,0.000002596557,0.0009969221,0.989413,0.003883762,0.00008777052,0.004726,0.0001665501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01794305,0.0002445951,0.9741751,0.005011647,0.0001236675,0.001137871,0.00008271963,0.0004426415,0.0008387142],"genre_scores_gemma":[0.7115299,0.00008781995,0.2872923,0.0001321156,0.00009567693,0.000321257,0.0001832829,0.00007459,0.0002831483],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6935868,"threshold_uncertainty_score":0.6521404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225962937","doi":"10.1007/s43069-021-00116-6","title":"Nature-Inspired Techniques for Dynamic Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Scheduling (production processes); Set (abstract data type); Constraint satisfaction; Context (archaeology); Optimization problem; Sequence (biology); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02781063245877669,"gpt":0.3492063004535139,"spread":0.3213956679947372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001200297,0.0001108908,0.0001123564,0.0004937067,0.002359564,0.0004095138,0.0004484162,0.00008353856,0.0002697804],"category_scores_gemma":[0.0001743175,0.0001174213,0.00007036269,0.0008575426,0.0001141907,0.0006270933,0.0003265543,0.0006651841,0.00001319747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000432648,"about_ca_system_score_gemma":0.0004503864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001243164,"about_ca_topic_score_gemma":0.001239084,"domain_scores_codex":[0.9979951,0.0002573572,0.0002650039,0.0004322481,0.0006130506,0.0004371744],"domain_scores_gemma":[0.9988744,0.0001294138,0.00002985441,0.0004388748,0.0004351237,0.00009230787],"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.00001984228,0.0001373292,0.0007452103,0.00002473304,0.00003651283,0.000004231737,0.0005554116,0.03715544,0.01448698,0.5523987,0.009093244,0.3853423],"study_design_scores_gemma":[0.0004558395,0.0004374018,0.001166234,0.00001189341,0.000003066013,0.00006169501,0.0007131142,0.9278449,0.001923901,0.004891458,0.0622419,0.0002486202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002434738,0.00006916948,0.9750575,0.01756504,0.0003663786,0.002020215,0.00008901687,0.0003638227,0.002034069],"genre_scores_gemma":[0.8986329,0.00003173847,0.09771974,0.0003486397,0.00002238907,0.002089457,0.00009466734,0.00001502432,0.001045477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8961982,"threshold_uncertainty_score":0.9989392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4327814502","doi":"10.1007/s43069-023-00209-4","title":"PPE Supply Optimization Under Risks of Disruption from the COVID-19 Pandemic","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pandemic; Stochastic programming; Context (archaeology); Supply chain; Personal protective equipment; Pareto principle; Coronavirus disease 2019 (COVID-19); Constraint (computer-aided design); Expected shortfall; Operations research; Computer science; Economics; Business; Risk management; Operations management; Mathematical optimization; Engineering; Marketing; Mathematics; Medicine; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.2382746855180554,"gpt":0.4329145980250108,"spread":0.1946399125069554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001596968,0.0001086744,0.0001159968,0.0004176772,0.001179484,0.0004505071,0.0004688654,0.0000663843,0.001071306],"category_scores_gemma":[0.0007059042,0.00007472058,0.00006153076,0.001880925,0.0002108137,0.0008018537,0.0004269727,0.0002112822,0.0006359707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008883449,"about_ca_system_score_gemma":0.0001012051,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01570524,"about_ca_topic_score_gemma":0.006601113,"domain_scores_codex":[0.99822,0.00009031326,0.0002684307,0.0002940213,0.0007017765,0.0004254567],"domain_scores_gemma":[0.9989294,0.0003109351,0.00004249961,0.0004262527,0.0002625916,0.00002826509],"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.00002438579,0.00004811823,0.08455814,0.00002393583,0.00002616905,0.000002764606,0.000160979,0.826149,0.0002436944,0.0220346,0.06476755,0.001960656],"study_design_scores_gemma":[0.0007312867,0.00002647765,0.02929149,0.00003293708,0.00003146757,7.351467e-7,0.01559903,0.8260624,0.00002967133,0.006612078,0.1213718,0.0002106481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7342206,0.0003759424,0.09974242,0.1539018,0.0007426356,0.003271341,0.0001472744,0.0005609102,0.007037045],"genre_scores_gemma":[0.9939027,0.0005982599,0.0002088578,0.002110213,0.0003766364,0.0001939632,0.0007773611,0.00002182897,0.001810119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2596821,"threshold_uncertainty_score":0.9998419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414133469","doi":"10.1007/s43069-025-00516-y","title":"Stochastic Optimization Approaches to Biomass-to-Bioenergy Supply Chain Network Design Under Demand Uncertainty","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":3,"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; Supply chain network; Stochastic programming; Robust optimization; Supply chain optimization; Renewable energy; Profit (economics); Electricity; Stochastic optimization; Network planning and design","retraction":null,"screen_n_in":null,"score":{"opus":0.09649546229807995,"gpt":0.3038192620057607,"spread":0.2073237997076808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002720226,0.0002666942,0.0002426105,0.001799906,0.001636552,0.001596985,0.0006688833,0.0001047216,0.0002891625],"category_scores_gemma":[0.0007394971,0.0002594303,0.00006307026,0.005182698,0.0001018902,0.000736248,0.001058669,0.0002207486,0.0002386868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000437957,"about_ca_system_score_gemma":0.0002199796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001784539,"about_ca_topic_score_gemma":0.001897278,"domain_scores_codex":[0.9968292,0.0001726251,0.0003848426,0.0006952775,0.0006671149,0.001251009],"domain_scores_gemma":[0.9984422,0.0002051238,0.00002888526,0.0006272107,0.0006240319,0.00007250089],"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.00006804628,0.00007283301,0.00008613096,0.00004877934,0.00004794437,0.000003612231,0.00003953938,0.7470093,0.00002619924,0.1963988,0.0552624,0.0009364061],"study_design_scores_gemma":[0.0004338939,0.00004742773,0.000162676,0.00007859455,0.00002392904,2.953988e-7,0.003108516,0.9669676,0.00002290606,0.005835977,0.02304065,0.0002774987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000941126,0.00007993059,0.9297436,0.06092305,0.0002524657,0.002839152,0.000003965714,0.000133233,0.005083452],"genre_scores_gemma":[0.946873,0.000006266013,0.02952958,0.005572625,0.000755205,0.002248137,0.0002541929,0.00007232225,0.01468864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9459319,"threshold_uncertainty_score":0.9999858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4322771373","doi":"10.1007/s43069-022-00190-4","title":"Model Development and Solver Demonstrations Using Randomized Test Problems","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Solver; Python (programming language); Visualization; MATLAB; Scalability; Software engineering; Analytics; Development (topology); Programming language; Data science; Artificial intelligence; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.1298099136693669,"gpt":0.3470276789235193,"spread":0.2172177652541523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003894,0.0001012613,0.0001501625,0.0003568324,0.000734506,0.0002709437,0.0000865809,0.00006506628,0.00004239336],"category_scores_gemma":[0.0002195081,0.00009370107,0.0000264155,0.0006888615,0.0001151543,0.0002621025,0.00006159127,0.0001996924,0.00009300229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005695079,"about_ca_system_score_gemma":0.0001652367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001864905,"about_ca_topic_score_gemma":0.0003069763,"domain_scores_codex":[0.9988695,0.00005863706,0.0002610897,0.0001573924,0.0002654031,0.0003880079],"domain_scores_gemma":[0.9994016,0.0001777892,0.000005864347,0.0001417795,0.0001710706,0.0001018998],"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.00001257049,0.00001274995,0.00005895982,0.00002293342,0.00001856003,6.461009e-7,0.0007204403,0.9915266,0.002238651,0.003495472,0.001248306,0.0006441008],"study_design_scores_gemma":[0.003693727,0.000005593996,0.000008486954,0.00003193663,0.000003797081,0.000002567268,0.0001563649,0.9936251,0.0007604942,0.0003092513,0.001289813,0.0001128585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.151821,0.0004814744,0.8107154,0.003167972,0.0002689074,0.003853603,0.00007021274,0.001588766,0.02803272],"genre_scores_gemma":[0.9284442,0.0003183252,0.06655895,0.00002668933,0.00002338788,0.0003750821,0.0001067106,0.00004483019,0.004101814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7766232,"threshold_uncertainty_score":0.5649301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4327973085","doi":"10.1007/s43069-023-00207-6","title":"The Setup Carryover Assignment Problem","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Unimodular matrix; Integer programming; Mathematical optimization; Integer (computer science); Sizing; Linear programming; Time horizon; Extension (predicate logic); Computer science; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0795060178158165,"gpt":0.3382009867105791,"spread":0.2586949688947626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002128013,0.0001041665,0.00007614281,0.0003351834,0.002422065,0.001512701,0.0004605972,0.00003531454,0.0005952423],"category_scores_gemma":[0.0001776984,0.00007112095,0.00005525886,0.001378881,0.0001326136,0.0007413639,0.0006344402,0.0002172254,0.006828911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009270791,"about_ca_system_score_gemma":0.00004556737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006594427,"about_ca_topic_score_gemma":0.001460423,"domain_scores_codex":[0.9979684,0.00004738811,0.0001997848,0.0002545668,0.0008222218,0.0007076843],"domain_scores_gemma":[0.9992253,0.00007770969,0.0000161369,0.0004140341,0.0002463257,0.00002045668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006636701,0.00003054428,0.0007160535,0.0000206009,0.00002202307,0.000006144642,0.00004525158,0.002238367,0.0001823983,0.2632262,0.7281414,0.005364384],"study_design_scores_gemma":[0.0001874443,0.00001271576,0.0006273685,0.00001262637,0.000003933262,1.983611e-7,0.002586615,0.04933488,0.00003708369,0.00362296,0.9434782,0.00009601412],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03964736,0.0002590037,0.0007600784,0.2346622,0.001772174,0.004112781,0.00001792666,0.0008155685,0.7179529],"genre_scores_gemma":[0.8642766,0.0001269319,0.00007960388,0.001839515,0.001072456,0.001067204,0.0001576221,0.00004705842,0.131333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8246293,"threshold_uncertainty_score":0.9995238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401368705","doi":"10.1007/s43069-024-00350-8","title":"A Modeling and Hybridized Decomposition Approach for the Multi-level Capacitated Lot-Sizing Problem with Setup Carryover, Backlogging, and Emission Control","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematical optimization; Sizing; Column generation; Computer science; Time horizon; Heuristic; Production planning; Decomposition; Integer programming; Inventory control; Set (abstract data type); Holding cost; Linear programming; Production (economics); Dynamic programming; Operations research; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.09136895763153578,"gpt":0.3325534853734296,"spread":0.2411845277418938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001256607,0.0001498397,0.0001329499,0.0002926961,0.001333022,0.001684342,0.0001314542,0.00004120957,0.00001832913],"category_scores_gemma":[0.00006966296,0.00009686319,0.00003404016,0.0003311091,0.0001106811,0.0009803339,0.0001330813,0.0002196843,0.000005439905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005721897,"about_ca_system_score_gemma":0.00004427988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000852833,"about_ca_topic_score_gemma":0.0003378693,"domain_scores_codex":[0.9986788,0.00003991273,0.0001907918,0.0003843524,0.0003020827,0.0004040308],"domain_scores_gemma":[0.9994369,0.0000976066,0.00001414768,0.0001674893,0.0002553352,0.00002853582],"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.001541207,0.0008893591,0.003159066,0.006231224,0.001554561,0.00005013925,0.004089476,0.613394,0.03060451,0.2025465,0.05571991,0.08022004],"study_design_scores_gemma":[0.001292204,0.00003329639,0.00003156906,0.0001369813,0.00004697893,0.000004420537,0.002620587,0.9860063,0.00003957273,0.0002309425,0.009418637,0.0001385742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06838372,0.002390211,0.9124572,0.01003217,0.0001308921,0.004450524,0.00004949666,0.0001880803,0.001917672],"genre_scores_gemma":[0.9878036,0.00008621891,0.009635428,0.0003606049,0.0001818666,0.0007103172,0.0001371947,0.00003774649,0.00104698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9194199,"threshold_uncertainty_score":0.9999671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400184785","doi":"10.1007/s43069-024-00336-6","title":"One-Shot Learning for MIPs with SOS1 Constraints","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Institut de Valorisation des Données","keywords":"Shot (pellet); Computer science; Artificial intelligence; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.167723785632976,"gpt":0.4224603991404561,"spread":0.2547366135074801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00236043,0.0001287684,0.0001574604,0.000663336,0.001096188,0.002430649,0.0008465942,0.00007191457,0.000371878],"category_scores_gemma":[0.001075166,0.0001116779,0.0000546166,0.001680537,0.0003712512,0.0008434321,0.0003139196,0.0006705533,0.0003795528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001196314,"about_ca_system_score_gemma":0.001138718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003544435,"about_ca_topic_score_gemma":0.00008609395,"domain_scores_codex":[0.9967722,0.0003498794,0.0002563666,0.0006399406,0.001149805,0.0008317714],"domain_scores_gemma":[0.9973773,0.000722079,0.000009577322,0.0005266105,0.001114564,0.0002498905],"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.0000258388,0.0001786479,0.00006057613,0.0001360434,0.0001381041,0.00005506751,0.0009388493,0.0675058,0.001780226,0.6859291,0.01335315,0.2298986],"study_design_scores_gemma":[0.000278037,0.0003625119,0.00001988923,0.0000675326,0.000003240107,0.0000203854,0.0002511585,0.9386383,0.001143311,0.0006998833,0.05837058,0.0001451847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002509727,0.0002555273,0.9787889,0.01217867,0.0001374233,0.001007564,0.00001796835,0.0002217158,0.007141267],"genre_scores_gemma":[0.3497646,0.0001863172,0.6185719,0.0001400536,0.000204043,0.001037516,0.0001009232,0.00006174779,0.02993283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8711325,"threshold_uncertainty_score":0.998605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4323312451","doi":"10.1007/s43069-023-00202-x","title":"Model Development with Maple in PhD-Level Management Science Courses: A Personal Account","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Maple; Computer science; Presentation (obstetrics); Mathematics education; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.4506563412510798,"gpt":0.5069861037775598,"spread":0.05632976252648003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01002999,0.0001072861,0.0001261378,0.001503905,0.001802279,0.0008339796,0.001298344,0.00003152262,0.0002601944],"category_scores_gemma":[0.0004184075,0.0000766147,0.0000236959,0.006797605,0.0006628979,0.0006952267,0.0005925581,0.0002453464,0.002436701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002287741,"about_ca_system_score_gemma":0.00103777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003914649,"about_ca_topic_score_gemma":0.001893135,"domain_scores_codex":[0.9949566,0.0001148942,0.0003488476,0.0006481158,0.003153976,0.0007776294],"domain_scores_gemma":[0.9982961,0.0002401453,0.00001956855,0.0005923047,0.0006849487,0.0001669419],"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.0001076007,0.0005441435,0.003799297,0.00001408882,0.00002742508,0.00004151641,0.01212398,0.2179548,0.004568828,0.6712899,0.02815116,0.06137731],"study_design_scores_gemma":[0.0006490822,0.0000682124,0.01711169,0.00005044261,0.000002449239,0.000006901088,0.03996444,0.8887026,0.00131783,0.02422529,0.02762715,0.0002738935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9394101,0.00001402962,0.02261093,0.010947,0.00004315632,0.001123083,0.00005737515,0.00006657068,0.02572775],"genre_scores_gemma":[0.9514428,0.00001120779,0.01050253,0.0001088179,0.00001159416,0.0007358146,0.00001468954,0.00001013592,0.03716247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6707478,"threshold_uncertainty_score":0.9994972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404612850","doi":"10.1007/s43069-024-00375-z","title":"A Behavioral Test and Classification of Solution Concepts in Games","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Test (biology); Psychology; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1646582393781355,"gpt":0.472597361497433,"spread":0.3079391221192976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007511693,0.00005135673,0.0000681862,0.0003372767,0.0001336587,0.0003200716,0.000275605,0.00004735578,0.00002101154],"category_scores_gemma":[0.0002642782,0.00004758931,0.00001731676,0.0007887699,0.0002537603,0.0007528185,0.0001645582,0.0001965672,0.0000616215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007249587,"about_ca_system_score_gemma":0.0001950375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004461789,"about_ca_topic_score_gemma":0.002300819,"domain_scores_codex":[0.9988933,0.000110014,0.0002121106,0.000254198,0.0002930636,0.0002373149],"domain_scores_gemma":[0.9992705,0.0002391385,0.00000705141,0.0002465644,0.0001922053,0.0000445222],"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.000003737645,0.0002476592,0.007498269,0.00003120796,0.000004458995,0.00001271778,0.005276779,0.0004322257,0.1611502,0.505264,0.002591918,0.3174868],"study_design_scores_gemma":[0.00003458361,0.0001987833,0.00492836,0.00007951116,0.000001080177,0.000005427106,0.0009813184,0.967845,0.01941188,0.003533139,0.002905422,0.00007549926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6936591,0.001769292,0.280425,0.02018578,0.0003036642,0.0008663408,0.00002200207,0.0001432524,0.002625639],"genre_scores_gemma":[0.9942029,0.00007487788,0.004997416,0.000009362294,0.00001698343,0.00007582094,0.000003827915,0.000004581414,0.0006142213],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9674128,"threshold_uncertainty_score":0.3086458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4221126329","doi":"10.1007/s43069-022-00126-y","title":"Understanding the Design Continuum Between Group Technology and Fractal Cell Designs for Manufacturing Systems Through the Central Backup Cellular Manufacturing System","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Backup; Fractal; Remainder; Group technology; Cellular manufacturing; Unification; Computer science; Conceptual design; Distributed computing; Topology (electrical circuits); Parallel computing; Theoretical computer science; Engineering; Mathematics; Arithmetic; Mathematical optimization; Operating system; Mechanical engineering; Combinatorics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1198597447833993,"gpt":0.2915348363211791,"spread":0.1716750915377799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001065725,0.0002265704,0.0002239323,0.0002484539,0.004087214,0.0004101628,0.0004863355,0.0001068122,0.00001322062],"category_scores_gemma":[0.00003512974,0.0001643793,0.0000538625,0.0002469413,0.0001978884,0.0002655952,0.0002621917,0.0008024435,0.000003712885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000746945,"about_ca_system_score_gemma":0.00003386633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006028348,"about_ca_topic_score_gemma":0.00002418293,"domain_scores_codex":[0.9976958,0.0003166648,0.0003371026,0.000339331,0.0004151361,0.0008959433],"domain_scores_gemma":[0.9986514,0.0007608144,0.00003652828,0.0004278421,0.0000495528,0.0000739012],"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.0000146746,0.00001121835,0.00002017823,0.0001067754,0.00004856057,0.000005001991,0.0004796217,0.9860429,0.000831687,0.01152699,0.0007690327,0.0001434062],"study_design_scores_gemma":[0.001140293,0.0003287441,0.00005593401,0.00007723799,0.00008224569,0.0000738839,0.05413771,0.8496468,0.075385,0.005126204,0.01333935,0.0006065675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01231523,0.0005030963,0.9833158,0.0006469304,0.0003654759,0.002076228,0.0001235084,0.0002640786,0.0003896261],"genre_scores_gemma":[0.9915316,0.00005194902,0.00687748,0.00001013687,0.0001516029,0.0009120647,0.0000747818,0.00007086894,0.0003195255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9792163,"threshold_uncertainty_score":0.9972093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312223687","doi":"10.1007/s43069-022-00184-2","title":"Using LINGO for Business Students","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Spreadsheets and End-User Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Computer science; Scalar (mathematics); Set (abstract data type); Problem solver; Software; Integer programming; Mode (computer interface); Algebraic number; Linear programming; Theoretical computer science; Mathematical optimization; Algebra over a field; Algorithm; Mathematics; Programming language; Software engineering; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2237411920510421,"gpt":0.4667497925859651,"spread":0.243008600534923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001427925,0.00007554537,0.00009171105,0.0002699493,0.003286153,0.0008012602,0.001504341,0.00001922814,0.00004422573],"category_scores_gemma":[0.0001580754,0.00007549604,0.00003899612,0.001242122,0.00003125054,0.0004117286,0.002138729,0.0002329205,0.00001240352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001699079,"about_ca_system_score_gemma":0.0002900385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003893262,"about_ca_topic_score_gemma":0.00007567991,"domain_scores_codex":[0.9979706,0.0001522046,0.0001717568,0.0003482544,0.0008119559,0.0005451787],"domain_scores_gemma":[0.998854,0.0001140982,0.00001253795,0.0004777932,0.0004639839,0.00007761145],"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.00002284324,0.0006093708,0.004594946,0.00002868032,0.00005842445,0.00002255634,0.00255365,0.7712533,0.007645357,0.1725739,0.01474253,0.02589435],"study_design_scores_gemma":[0.000335376,0.00009704335,0.0006406278,0.000008322452,0.000001487041,0.00001335821,0.0004086954,0.9556198,0.0003359378,0.0006517,0.04176935,0.0001182671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1710269,0.0001082027,0.8224631,0.004246452,0.000662324,0.0007286532,0.0000141123,0.00009939633,0.0006508966],"genre_scores_gemma":[0.9112894,0.000004326805,0.08674032,0.000231454,0.0001346462,0.000265411,0.0000137661,0.00001717333,0.001303495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7402626,"threshold_uncertainty_score":0.9980114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206974572","doi":"10.1007/s43069-021-00119-3","title":"Able Construction: A Spreadsheet Activity for Teaching Bayes’ Theorem","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Wilfrid Laurier University","funders":"","keywords":"Exploit; Bayes' theorem; Graduation (instrument); Analytics; Computer science; Mathematics education; Bidding; Competence (human resources); Judgement; Autonomy; Data science; Bayesian probability; Artificial intelligence; Psychology; Engineering; Management; Epistemology; Marketing; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.3169519663384597,"gpt":0.5358044830076717,"spread":0.218852516669212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004660662,0.00009072394,0.0001504953,0.0002171562,0.003120514,0.0001482233,0.0002594156,0.00003585366,0.001490243],"category_scores_gemma":[0.008504136,0.00008672985,0.00005826659,0.000247508,0.0002035828,0.0001408279,0.0002315977,0.0005533182,0.0000164111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000210088,"about_ca_system_score_gemma":0.0004106633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001125967,"about_ca_topic_score_gemma":0.0001258058,"domain_scores_codex":[0.9975061,0.001198245,0.0001824848,0.0002611715,0.0004303093,0.0004217361],"domain_scores_gemma":[0.9957513,0.003495613,0.00002623156,0.0003791341,0.000270501,0.00007718117],"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.00004048796,0.0001489978,0.00004571959,0.00002047066,0.00002007507,6.616448e-7,0.001145992,0.0002195123,0.001294563,0.8741521,0.1142534,0.008657938],"study_design_scores_gemma":[0.0006752978,0.0003739934,0.00004172436,0.00001388873,0.00001796849,0.00005461514,0.04820108,0.01770322,0.004534607,0.6775081,0.2506346,0.0002409978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08054922,0.00006303629,0.8637668,0.01618573,0.001741584,0.002509226,0.0010193,0.0002171041,0.03394803],"genre_scores_gemma":[0.3443147,0.000008972205,0.6279631,0.0001165716,0.0001511802,0.002268784,0.0000729987,0.00003477148,0.02506897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2637655,"threshold_uncertainty_score":0.9998477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414212781","doi":"10.1007/s43069-025-00548-4","title":"Conditional Correlation via Generalized Random Forests with Application to Hedge Funds","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Toronto; York University","funders":"","keywords":"Conditional variance; Estimator; Hedge fund; Explanatory power; Variance (accounting); Correlation; Asset (computer security); Financial market; Financial asset","retraction":null,"screen_n_in":null,"score":{"opus":0.04186775848480495,"gpt":0.3287152352177544,"spread":0.2868474767329494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009757917,0.0001024042,0.0002092971,0.0005513821,0.0007729703,0.0001622376,0.0001826773,0.00009121866,0.0001286813],"category_scores_gemma":[0.0002383981,0.0001065655,0.00004972514,0.000895404,0.00007130709,0.0003103349,0.00006978199,0.0002182271,0.0004824658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001878153,"about_ca_system_score_gemma":0.0001224301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001050122,"about_ca_topic_score_gemma":0.004645062,"domain_scores_codex":[0.998688,0.0000421845,0.0004133772,0.0003961796,0.0001049589,0.0003553301],"domain_scores_gemma":[0.9991641,0.00008394374,0.00002952227,0.0003366968,0.0002985913,0.00008711202],"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.0001943779,0.00009221496,0.04113733,0.00001194604,0.0000247358,4.534757e-7,0.0001677775,0.1452712,0.0001574898,0.8065619,0.003932208,0.002448309],"study_design_scores_gemma":[0.001441331,0.0001004357,0.0232901,0.00001774624,0.000002908203,8.878266e-7,0.00005047416,0.8694689,0.0001316538,0.06521472,0.0401313,0.000149486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.101314,0.0002432074,0.8865595,0.004398247,0.00008869392,0.0009079889,0.0001114998,0.00002936695,0.006347483],"genre_scores_gemma":[0.9898369,0.00002690436,0.004082168,0.000254145,0.00006034988,0.0006889761,0.0003591561,0.00001377765,0.004677568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8885229,"threshold_uncertainty_score":0.6201282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410461442","doi":"10.1007/s43069-025-00467-4","title":"Time-Dependent Routing and Road Network Precision","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02942081969389774,"gpt":0.3490775654963211,"spread":0.3196567458024234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001594883,0.00006446137,0.0000741336,0.0001811111,0.0009196347,0.001159085,0.0006928178,0.00002978267,0.0000340591],"category_scores_gemma":[0.0001505928,0.00005642602,0.00001623191,0.000744351,0.00005543281,0.0009188775,0.001752494,0.0001756697,0.000186903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003504011,"about_ca_system_score_gemma":0.00007058719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008641771,"about_ca_topic_score_gemma":0.0001103036,"domain_scores_codex":[0.9986153,0.0001481315,0.0001425025,0.0003282933,0.0003625923,0.0004031654],"domain_scores_gemma":[0.9992344,0.00008761859,0.000006722794,0.0004902051,0.0001255685,0.00005541917],"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.000004644112,0.00006061079,0.0003256291,0.000007547692,0.00002706261,0.000008718844,0.0001317396,0.006663962,0.0002804449,0.2653941,0.09488841,0.6322072],"study_design_scores_gemma":[0.0001814326,0.00004422117,0.0006336651,0.00004055479,0.000001584662,9.569972e-7,0.00007828979,0.964948,0.0001338253,0.002549551,0.03131429,0.00007363487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00479607,0.000492216,0.9224247,0.0192269,0.0003798952,0.0008371989,0.000007804641,0.0001606995,0.05167453],"genre_scores_gemma":[0.6411215,0.0004232518,0.1138099,0.0008941518,0.0003059967,0.0002255796,0.00008091086,0.00002121741,0.2431175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.958284,"threshold_uncertainty_score":0.9998778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3209835046","doi":"10.1007/s43069-021-00097-6","title":"Deterministic Asymmetric-cost Differential Games for Energy Production with Production Bounds","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamilton–Jacobi–Bellman equation; Differential game; Profit (economics); Production (economics); Bounded function; Mathematical economics; Mathematics; Economics; Mathematical optimization; Upper and lower bounds; Optimal control; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.1715276890276076,"gpt":0.3473127858381008,"spread":0.1757850968104932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005306575,0.0001366737,0.0002548868,0.000528444,0.0008537383,0.0004551331,0.0001490432,0.00008801186,0.0002037513],"category_scores_gemma":[0.001046191,0.0001468962,0.00007494458,0.000677862,0.000122533,0.0004313339,0.00008419211,0.0001659838,0.0001117465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002767168,"about_ca_system_score_gemma":0.0001320154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003071545,"about_ca_topic_score_gemma":0.004431307,"domain_scores_codex":[0.9982705,0.00003630383,0.000401364,0.0006394555,0.00006926856,0.0005830807],"domain_scores_gemma":[0.9989834,0.00006685549,0.00005688237,0.0004669648,0.0003217831,0.0001041431],"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.00027385,0.0009991938,0.005659802,0.000203717,0.0002351891,0.000008972237,0.001037803,0.003756048,0.001909551,0.9345084,0.03027553,0.02113197],"study_design_scores_gemma":[0.002413983,0.001108226,0.005349754,0.0001162079,0.00003903364,0.0001727437,0.00296691,0.0794499,0.04587273,0.04132494,0.8198326,0.00135297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8174145,0.002191009,0.07379833,0.0676948,0.004806111,0.003196248,0.001933236,0.0001861707,0.02877963],"genre_scores_gemma":[0.9767971,0.0006245937,0.001376084,0.000109912,0.0007953676,0.001047173,0.0004799859,0.00004338177,0.01872641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8931834,"threshold_uncertainty_score":0.6566352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224298808","doi":"10.1007/s43069-022-00136-w","title":"Distributed Integral Column Generation for Set Partitioning Problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Scheduling (production processes); Heuristic; Crew scheduling; Column (typography); Heuristics; Set (abstract data type); Tree (set theory); Integer programming; Algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.1274940943018242,"gpt":0.3847809595954399,"spread":0.2572868652936157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001718885,0.00009369836,0.0001094809,0.0001870359,0.001966379,0.0002689051,0.0001929756,0.00004218348,0.0003764012],"category_scores_gemma":[0.0003034981,0.00010953,0.00004656193,0.0006876673,0.00004344436,0.0002417407,0.0001112917,0.000388014,0.00001453519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000373701,"about_ca_system_score_gemma":0.00009828006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005007129,"about_ca_topic_score_gemma":0.0002844448,"domain_scores_codex":[0.9984094,0.0002599486,0.0002626909,0.0002149215,0.0003819771,0.0004710763],"domain_scores_gemma":[0.9992676,0.00008841882,0.000009909721,0.0002357614,0.0003166448,0.0000816319],"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.000003498118,0.00002223434,0.0002915293,0.0000124513,0.00001552176,3.613925e-7,0.0002282865,0.959419,0.008631924,0.003655958,0.02682244,0.000896785],"study_design_scores_gemma":[0.000302329,0.00009775587,0.0000363098,0.000005123325,0.000003630786,0.000004349706,0.0006160073,0.955868,0.002667821,0.0001707921,0.04010991,0.000117937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05767012,0.00009293112,0.9366494,0.002047028,0.0003642083,0.001493461,0.0007837579,0.0003347739,0.0005642932],"genre_scores_gemma":[0.9325721,0.00001434177,0.0592986,0.00004657718,0.00013094,0.003570113,0.003235473,0.00004984962,0.001082066],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8773508,"threshold_uncertainty_score":0.9993329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2939963135","doi":"10.1007/s43069-020-00042-z","title":"The Inventory Routing Problem with Demand Moves","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Time horizon; Routing (electronic design automation); Operations research; Inventory theory; Computer science; Holding cost; Demand forecasting; Perpetual inventory; Total cost; Inventory cost; Inventory control; Operations management; Business; Economics; Mathematical optimization; Supply chain; Microeconomics; Marketing; Engineering; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03831725747215989,"gpt":0.3362077405177609,"spread":0.2978904830456011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001374556,0.00008190799,0.00007750319,0.00006409564,0.001173549,0.0004596389,0.0001713501,0.00004498959,0.00004604231],"category_scores_gemma":[0.0003072296,0.00005875727,0.00001861987,0.000651973,0.00009806131,0.0002041208,0.00009261867,0.0003595821,0.00003209811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009099044,"about_ca_system_score_gemma":0.0001784249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001806568,"about_ca_topic_score_gemma":0.0006529535,"domain_scores_codex":[0.9985769,0.0002657185,0.0001730816,0.0001594835,0.0003678231,0.0004569491],"domain_scores_gemma":[0.9990028,0.0001751366,0.000005857461,0.0003255749,0.0004088639,0.00008174214],"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.000003073435,0.00001418756,0.001304777,0.00001525143,0.00003757975,0.000007608093,0.0003852588,0.9719508,0.003627793,0.01607905,0.002318549,0.004256062],"study_design_scores_gemma":[0.0002062331,0.00003294432,0.0002298006,0.00004337325,0.000003572783,0.0000152229,0.001510784,0.9723505,0.01104536,0.0002379762,0.0142076,0.0001166601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1818,0.00416008,0.6720392,0.01675405,0.0004326121,0.00180392,0.00002047946,0.001005404,0.1219842],"genre_scores_gemma":[0.8380393,0.0003586539,0.1502713,0.0000666273,0.0001148116,0.0002307699,0.00002760428,0.00007560452,0.01081533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6562393,"threshold_uncertainty_score":0.9026107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409217833","doi":"10.1007/s43069-025-00437-w","title":"On the Existence of Monge Solutions to Multi-marginal Optimal Transport with Quadratic Cost and Uniform Discrete Marginals","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":0,"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":"Quadratic equation; Mathematics; Applied mathematics; Mathematical optimization; Mathematical economics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1147092383121214,"gpt":0.3981596332955925,"spread":0.2834503949834711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634416,0.0001238633,0.0002255006,0.0004757885,0.0009864647,0.0001411433,0.0002980092,0.00004624947,0.0001055296],"category_scores_gemma":[0.0008359303,0.00007070461,0.00006144141,0.001852409,0.0002336876,0.0001647445,0.00007334496,0.000377205,0.00001056834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006235121,"about_ca_system_score_gemma":0.0002300403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001438814,"about_ca_topic_score_gemma":0.002835243,"domain_scores_codex":[0.9983544,0.0001479144,0.0002902456,0.0002206619,0.000556805,0.0004299284],"domain_scores_gemma":[0.9982888,0.0005634398,0.00002561566,0.0004367201,0.0005721112,0.0001133089],"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.0001293283,0.0003945709,0.0009027566,0.00007549468,0.0002094479,0.000009056887,0.001213028,0.008130265,0.0002811713,0.9816498,0.005866175,0.001138865],"study_design_scores_gemma":[0.008581411,0.008333674,0.05788447,0.003820985,0.001270744,0.0001075861,0.1343002,0.6726265,0.00491976,0.05169436,0.05393417,0.002526165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5752285,0.0001979223,0.3862303,0.02822711,0.00004264112,0.002266438,0.0001150903,0.00002441236,0.007667539],"genre_scores_gemma":[0.9726359,0.00004425651,0.01879613,0.00008871906,0.000009358315,0.0002314785,0.00001190683,0.00001031184,0.008171922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9299555,"threshold_uncertainty_score":0.7587188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}