{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":365,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":365,"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":"c88ddfbd5449","filters":{"venue":"INFOR Information Systems and Operational Research"}},"results":[{"id":"W2124417247","doi":"10.1080/03155986.2000.11732409","title":"Web-Hipre: Global Decision Support By Value Tree And AHP Analysis","year":2000,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":232,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Java applet; Decision tree; Decision support system; Weighting; Analytic hierarchy process; Decision analysis; Java; World Wide Web; Data mining; Operations research; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1312893094682656,"gpt":0.4697411430817452,"spread":0.3384518336134796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01174448,0.0002126033,0.00045624,0.001083268,0.0008248567,0.005208646,0.0006324589,0.0002655288,0.00212922],"category_scores_gemma":[0.002993643,0.0001552582,0.0001096728,0.002822573,0.000210169,0.004834314,0.0002593373,0.0003186423,0.001492785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001420964,"about_ca_system_score_gemma":0.0003261278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003854577,"about_ca_topic_score_gemma":0.00009341657,"domain_scores_codex":[0.9912784,0.0003767963,0.001886441,0.0004211344,0.00557904,0.0004581831],"domain_scores_gemma":[0.9949372,0.00205453,0.0001936062,0.0005871592,0.001835019,0.0003924741],"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.0003648808,0.00004202282,0.02437617,0.00002049955,0.00013966,0.00000522438,0.001327913,0.007684621,0.0000735418,0.02514958,0.1645686,0.7762473],"study_design_scores_gemma":[0.0009611461,0.00009410628,0.03066415,0.00002318664,0.00001557444,0.00004675446,0.001026139,0.3101327,0.00001038403,0.0007763779,0.656049,0.0002004966],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8967711,0.0005193654,0.02333957,0.001299076,0.0004025283,0.001324798,0.001203169,0.00007258035,0.07506779],"genre_scores_gemma":[0.9935175,0.0001946832,0.00161974,0.0004589166,0.00008554565,0.00007140325,0.0001836094,0.00000640256,0.00386226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7760468,"threshold_uncertainty_score":0.9992847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060942325","doi":"10.3138/infor.46.4.265","title":"Using Operational Research for Supply Chain Planning in the Forest Products Industry","year":2008,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":216,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":true},"ca_institutions":"Université Laval","funders":"","keywords":"Supply chain; Forest industry; Context (archaeology); Business; Operational planning; Forest management; Strategic planning; Community forestry; Computer science; Environmental resource management; Environmental planning; Operations research; Forestry; Marketing; Engineering; Environmental science; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.1954837904854315,"gpt":0.3846174089176178,"spread":0.1891336184321863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004154191,0.0001178718,0.0001223476,0.0007596113,0.00084392,0.0005441337,0.000231946,0.0001641884,0.00001294031],"category_scores_gemma":[0.0004266271,0.00009161279,0.00001886718,0.000862225,0.0001480738,0.001580226,0.00006582133,0.0005022982,0.00002535131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001635587,"about_ca_system_score_gemma":0.0002521426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001634578,"about_ca_topic_score_gemma":0.00004472421,"domain_scores_codex":[0.9976186,0.000131944,0.0005308142,0.00012506,0.001181422,0.0004122308],"domain_scores_gemma":[0.9984894,0.0002772929,0.00002842199,0.0001810725,0.0009551306,0.00006872309],"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.00006265556,0.00003539849,0.0274512,0.0006108352,0.00003306878,0.000006437819,0.009798748,0.5987151,0.0001653142,0.3050121,0.05756347,0.0005456037],"study_design_scores_gemma":[0.0008096372,0.00007919517,0.02520991,0.0001217855,0.000001518259,0.00006685919,0.006258859,0.6357164,0.0001037868,0.00008741979,0.3313691,0.0001754482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.958024,0.0005937211,0.01067244,0.001936925,0.0005307182,0.005615207,0.0001339294,0.000101942,0.02239117],"genre_scores_gemma":[0.9977292,0.00004576138,0.0005190294,0.0001343075,0.0002264396,0.0006463872,0.0003127412,0.00001163686,0.0003744917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3049247,"threshold_uncertainty_score":0.6490836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399793648","doi":"10.1080/03155986.2001.11732424","title":"A Control-Limit Policy And Software For Condition-Based Maintenance Optimization","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":185,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":true},"ca_institutions":"University of Toronto","funders":"University of Toronto; Nanyang Technological University","keywords":"Limit (mathematics); Control (management); Software; Computer science; Control limits; Reliability engineering; Engineering; Mathematics; Operating system; Artificial intelligence; Control chart","retraction":null,"screen_n_in":null,"score":{"opus":0.02083121742888067,"gpt":0.2946814852633072,"spread":0.2738502678344265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784954,0.0001135884,0.0001445448,0.0003380092,0.0003401767,0.0004816349,0.00006903427,0.0001118661,0.00001651847],"category_scores_gemma":[0.001119522,0.0001027222,0.00002220717,0.0003369725,0.00009910805,0.001623947,0.00001332217,0.0001165579,0.00001160068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001426892,"about_ca_system_score_gemma":0.0001884606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001002412,"about_ca_topic_score_gemma":0.00000821809,"domain_scores_codex":[0.9988329,0.00003252949,0.0004187056,0.0000991386,0.0003420036,0.0002747102],"domain_scores_gemma":[0.9980184,0.0003729745,0.00004413976,0.0001141899,0.00134534,0.0001049858],"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.00005611786,0.000004892208,0.0002520011,0.0001956835,0.00001150964,1.770414e-7,0.0001338351,0.9597006,0.000009018859,0.03544455,0.002183195,0.002008431],"study_design_scores_gemma":[0.0012075,0.00006601273,0.0003446543,0.00006344055,0.000002744932,0.00001192329,0.000179879,0.9095792,0.00001368716,0.0001413582,0.08827771,0.0001118487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003877852,0.0001039169,0.9908834,0.0008609085,0.0001262307,0.001354491,0.0002075854,0.0001107937,0.00247489],"genre_scores_gemma":[0.989757,0.0003401962,0.007578388,0.0004274866,0.0001667553,0.0007743972,0.0006429541,0.00001611406,0.0002966878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9858792,"threshold_uncertainty_score":0.4644416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119790020","doi":"10.3138/infor.45.3.123","title":"A Survey of the Generalized Assignment Problem and Its Applications","year":2007,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":166,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Naif Arab University for Security Sciences","keywords":"Knapsack problem; Heuristic; Generalized assignment problem; Mathematical optimization; Metaheuristic; Variable neighborhood search; Scheduling (production processes); Assignment problem; Computer science; Frequency assignment; Simple (philosophy); Operations research; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05733725566763038,"gpt":0.3254829878951147,"spread":0.2681457322274843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427076,0.0000544705,0.00007041907,0.0001022867,0.0001792168,0.00009330678,0.00006533132,0.00004744594,0.00000328387],"category_scores_gemma":[0.0001069788,0.00003919561,0.000007440306,0.0001777514,0.00004006839,0.0003855315,0.00003716854,0.0001001573,0.000004528523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004055149,"about_ca_system_score_gemma":0.00003531922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001236837,"about_ca_topic_score_gemma":0.00003015863,"domain_scores_codex":[0.9991516,0.00002866096,0.0003263011,0.00004320071,0.0003298355,0.0001204151],"domain_scores_gemma":[0.9992094,0.000184139,0.00003918278,0.00008202992,0.0004403318,0.00004492582],"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.00001456304,0.000006697874,0.001033633,0.0002861583,0.00001923657,4.620839e-8,0.0005618521,0.8687121,0.0001680152,0.1229893,0.0004326876,0.00577575],"study_design_scores_gemma":[0.001013642,0.00006104424,0.0757877,0.00009584004,0.000006121492,0.00001382359,0.0005868747,0.83157,0.003666076,0.0004220916,0.08649567,0.0002810679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0532312,0.001176086,0.9194958,0.0001023833,0.0002061995,0.00279905,0.0002131794,0.00008667547,0.0226894],"genre_scores_gemma":[0.9988162,0.0001196814,0.0007227614,0.00001324265,0.00002070089,0.00009498646,0.00005994529,0.000003894821,0.0001485852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.945585,"threshold_uncertainty_score":0.159835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398231527","doi":"10.1080/03155986.2006.11732749","title":"The Pickup And Delivery Problem With Time Windows And Transshipment","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"HEC Montréal; Simon Fraser University","funders":"","keywords":"Transshipment (information security); Pickup; Computer science; Service (business); Point (geometry); Operations research; Business; Transport engineering; Operations management; Engineering; Marketing; Computer security; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01759764908911724,"gpt":0.2484557544751977,"spread":0.2308581053860805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993653,0.00007218873,0.00006786213,0.0001118662,0.0004297346,0.0004911146,0.00003839213,0.00004125902,0.000006779154],"category_scores_gemma":[0.000006783232,0.00004813173,0.000006261575,0.0001583028,0.0001079282,0.0008952031,0.000006530138,0.0001189301,0.00001339055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002587329,"about_ca_system_score_gemma":0.00005672534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001712535,"about_ca_topic_score_gemma":0.0001032499,"domain_scores_codex":[0.9991293,0.00001588858,0.0003132645,0.00005430541,0.0003442303,0.000142991],"domain_scores_gemma":[0.9994428,0.0001090568,0.00001789559,0.00006497007,0.0003202185,0.00004508979],"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.0002291733,0.00004524054,0.01779693,0.00119987,0.0002055675,0.000002500775,0.008951565,0.1590981,0.001576434,0.7504053,0.02155383,0.03893549],"study_design_scores_gemma":[0.002095735,0.0001987661,0.1439188,0.0001353912,0.00001228888,0.00006673235,0.00297907,0.1579893,0.000255837,0.0002428299,0.6917391,0.000366037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9592468,0.0007891668,0.00481593,0.001136171,0.00007062243,0.001937441,0.0001220699,0.000128711,0.03175311],"genre_scores_gemma":[0.9988491,0.000106132,0.0002339258,0.00003504345,0.00002755524,0.0001749801,0.0001124747,0.000004637187,0.0004561374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7501624,"threshold_uncertainty_score":0.4735829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005777882","doi":"10.3138/infor.49.2.109","title":"Liner Shipping Cargo Allocation with Repositioning of Empty Containers","year":2011,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Strategic Research Council; Danmarks Frie Forskningsfond","keywords":"Column generation; Solver; Mathematical optimization; Flow network; Linear programming relaxation; Rounding; Computer science; Flow (mathematics); Linear programming; Relaxation (psychology); Integer programming; Path (computing); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06570098745531755,"gpt":0.2852097498314138,"spread":0.2195087623760962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523317,0.00007057496,0.0001054795,0.0001924132,0.000133204,0.0001313952,0.00005765946,0.00005857883,0.00003801652],"category_scores_gemma":[0.00007330204,0.00005631035,0.00001188429,0.0001566685,0.0000673768,0.0009123055,0.00001822054,0.0001293475,0.000009532689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004146289,"about_ca_system_score_gemma":0.00007702617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006244697,"about_ca_topic_score_gemma":0.00002289954,"domain_scores_codex":[0.9989707,0.00002062151,0.0004194214,0.00005031314,0.0003972012,0.0001417312],"domain_scores_gemma":[0.9989592,0.00005564197,0.00004948367,0.0001019276,0.0007740503,0.00005968359],"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.000245345,0.00004868926,0.02941783,0.002418514,0.000278509,0.000009962065,0.02640162,0.2074239,0.0008854095,0.7139318,0.0057215,0.01321691],"study_design_scores_gemma":[0.00182789,0.0005614986,0.0460672,0.0007524047,0.00002743327,0.0001930774,0.01329984,0.860386,0.004155427,0.0001785411,0.07184538,0.0007053403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3391963,0.0004014006,0.1426494,0.0001126733,0.0004217714,0.001711635,0.0001042936,0.0002155299,0.515187],"genre_scores_gemma":[0.9986457,0.00002638522,0.0009235172,0.00002053942,0.00004241899,0.00005830292,0.0001179775,0.000005691299,0.0001594658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7137533,"threshold_uncertainty_score":0.2296269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057562686","doi":"10.3138/infor.45.1.31","title":"Deploying Wildland Fire Suppression Resources with a Scenario-Based Standard Response Model","year":2007,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Software deployment; Heuristic; Computer science; Operations research; Environmental science; Simulation; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0497889241941249,"gpt":0.3089257054545395,"spread":0.2591367812604146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005595644,0.0001456828,0.000144874,0.0006388432,0.0008794878,0.001302902,0.0001731038,0.00007906729,0.00005789626],"category_scores_gemma":[0.0003729804,0.0001099698,0.00002623984,0.0005539601,0.0001004641,0.003743178,0.0001108221,0.0001978248,0.0001312216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000992186,"about_ca_system_score_gemma":0.0001533679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001336604,"about_ca_topic_score_gemma":0.0003033758,"domain_scores_codex":[0.9974782,0.00003378779,0.0005581306,0.0001615084,0.001411258,0.0003570989],"domain_scores_gemma":[0.9983393,0.0001093013,0.00007061378,0.0002146329,0.001218652,0.00004750327],"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.006251686,0.0000474873,0.009394961,0.0008784718,0.00003564771,0.000004693442,0.001506725,0.930502,0.0001085758,0.02655661,0.0183971,0.006316056],"study_design_scores_gemma":[0.0008606443,0.00004335956,0.004463002,0.0001226368,0.00000439247,0.000001908684,0.001808875,0.7263036,0.00001656991,0.00001816629,0.2662084,0.0001485036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9576954,0.0000673169,0.0296832,0.001861,0.0001457044,0.001067764,0.00002577848,0.0001132482,0.009340556],"genre_scores_gemma":[0.997735,0.00000646739,0.0003775669,0.0008746005,0.0001311829,0.00007670474,0.0001251199,0.00001003114,0.0006633603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2478112,"threshold_uncertainty_score":0.9997339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2335850549","doi":"10.1080/03155986.2016.1166793","title":"The pickup and delivery problem with time windows and scheduled lines","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"TKI DINALOG; Technische Universiteit Eindhoven","keywords":"Pickup; Public transport; Vehicle routing problem; Computer science; Transport engineering; Integer programming; Set (abstract data type); Routing (electronic design automation); Operations research; Destinations; Line (geometry); Business; Engineering; Computer network; Tourism; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0279345455576845,"gpt":0.2916587786160583,"spread":0.2637242330583738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635523,0.00008779986,0.00009478284,0.0001269572,0.0004348916,0.0006333117,0.00006464411,0.00006075052,0.000007303426],"category_scores_gemma":[0.000170555,0.00004572151,0.000006591044,0.0001468987,0.0001334732,0.001403053,0.00005112391,0.0001063695,0.00003056223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003353853,"about_ca_system_score_gemma":0.00007055846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002194274,"about_ca_topic_score_gemma":0.000005340936,"domain_scores_codex":[0.998987,0.00006882232,0.0003046798,0.0000694317,0.0003845454,0.0001855907],"domain_scores_gemma":[0.9987552,0.0005061004,0.00003203077,0.00009810295,0.0005243692,0.00008424166],"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.0006167757,0.00002762144,0.03239412,0.001794753,0.0004933181,0.000003977237,0.009110386,0.276272,0.006987833,0.2106288,0.01087601,0.4507945],"study_design_scores_gemma":[0.001686482,0.0001486035,0.006318756,0.0002924411,0.000005823338,0.00009222831,0.0007733442,0.87921,0.0003981194,0.0000720617,0.1107386,0.0002635604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8804243,0.002030263,0.09149251,0.00281376,0.0002061334,0.003078823,0.00009554207,0.0003425817,0.01951609],"genre_scores_gemma":[0.9881694,0.0007104367,0.009422584,0.00004857131,0.0001083503,0.0001807657,0.00001820542,0.0000158951,0.001325789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.602938,"threshold_uncertainty_score":0.6107039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403377275","doi":"10.1080/03155986.2002.11732640","title":"Determinants Of Retail Electronic Purchasing: A Multi-Period Investigation1","year":2002,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Period (music); Purchasing; Business; Commerce; Marketing; Art","retraction":null,"screen_n_in":null,"score":{"opus":0.2747402621555026,"gpt":0.4329957008910718,"spread":0.1582554387355692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004575036,0.0001119851,0.0002342573,0.0009817482,0.0004642177,0.0006297275,0.0004343412,0.0001773821,0.0003069592],"category_scores_gemma":[0.003118512,0.00008589682,0.00004579243,0.0009453612,0.0003503459,0.002510246,0.0001306839,0.000338553,0.0005560898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007302213,"about_ca_system_score_gemma":0.0001934308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008075518,"about_ca_topic_score_gemma":0.00003337624,"domain_scores_codex":[0.9961805,0.0001783183,0.001210115,0.0001747026,0.001921332,0.000335042],"domain_scores_gemma":[0.9969829,0.0002884122,0.0002627584,0.0003579922,0.001980646,0.0001273487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008249213,0.0001757608,0.5796007,0.0001190391,0.00003833549,0.000005431586,0.01491062,0.001071478,0.001035282,0.2788499,0.01262457,0.1114864],"study_design_scores_gemma":[0.002399308,0.0004680061,0.1744067,0.000124359,0.000007892566,0.0002591442,0.01193248,0.4707681,0.001186241,0.000968811,0.3370375,0.0004414685],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9937741,0.0002177689,0.001765503,0.000870383,0.000141092,0.0005822711,0.0000438211,0.00004375382,0.002561362],"genre_scores_gemma":[0.996292,0.00004683359,0.0004092624,0.00009423047,0.00002409472,0.00008169581,0.00001372346,0.000004641432,0.003033516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4696966,"threshold_uncertainty_score":0.7147595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408452789","doi":"10.1080/03155986.2005.11732724","title":"Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Block (permutation group theory); Integer programming; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Induced subgraph isomorphism problem; Linear programming; Induced subgraph; Discrete mathematics; Mathematical optimization; Computer science; Line graph; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06202741432814226,"gpt":0.3603149411181166,"spread":0.2982875267899744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002920347,0.0001293108,0.0001380375,0.0004141842,0.001657329,0.001717712,0.0006564413,0.00006829091,0.000007548929],"category_scores_gemma":[0.0002910734,0.00008255113,0.00005804894,0.0005548469,0.0001433844,0.005387349,0.0002753678,0.0002833947,0.00005783344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022141,"about_ca_system_score_gemma":0.0001893127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003465809,"about_ca_topic_score_gemma":0.00002891687,"domain_scores_codex":[0.9976159,0.00009417452,0.0005721748,0.0001648926,0.001080131,0.0004726749],"domain_scores_gemma":[0.9970654,0.0009990021,0.00008731939,0.0003897235,0.001323785,0.0001347781],"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.00001578827,0.00001218677,0.0001977186,0.00005378092,0.00001322483,6.049198e-8,0.001752117,0.004312347,0.00006727562,0.9676752,0.00216738,0.0237329],"study_design_scores_gemma":[0.000726146,0.0001507977,0.001509672,0.00005540666,0.00000194337,0.00002700928,0.0006729536,0.5474412,0.0003087056,0.01330868,0.4356023,0.0001952017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01420571,0.0004406318,0.9652456,0.00812597,0.0001837307,0.003694293,0.00005778277,0.0001142855,0.007931997],"genre_scores_gemma":[0.986094,0.00006754172,0.01096602,0.0003520864,0.0001793408,0.001449628,0.00005737051,0.000007757424,0.0008262765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718882,"threshold_uncertainty_score":0.9996424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2753651486","doi":"10.1080/03155986.2017.1361198","title":"Impact of government incentive on price competition of closed-loop supply chain systems","year":2017,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Remanufacturing; Incentive; Industrial organization; Government (linguistics); Competition (biology); Profit (economics); Business; Supply chain; Economics; Microeconomics; Environmental economics; Marketing; Engineering; Manufacturing engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03427597392497316,"gpt":0.3198035592343234,"spread":0.2855275853093502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002590646,0.0001488811,0.0002593049,0.0004466162,0.0005967699,0.001362112,0.0003646232,0.00007479371,0.00006326312],"category_scores_gemma":[0.000653562,0.0001210411,0.00006581448,0.0002264879,0.0001611928,0.004409827,0.0003307111,0.0001539522,0.00007488432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003305149,"about_ca_system_score_gemma":0.000109939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006478869,"about_ca_topic_score_gemma":0.00001667304,"domain_scores_codex":[0.9970288,0.00003983713,0.0007164378,0.0001318172,0.001793931,0.0002891967],"domain_scores_gemma":[0.9971882,0.0001424466,0.0006709012,0.0003921417,0.001578703,0.00002759891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0003410901,0.000104913,0.06413902,0.002190491,0.0001372409,0.000002288253,0.0004669183,0.01877157,0.0001103655,0.9056716,0.005940837,0.002123681],"study_design_scores_gemma":[0.003649534,0.0004686145,0.6095393,0.00118725,0.00002624302,0.000004050695,0.0178399,0.2576067,0.0001286379,0.0002920708,0.1087603,0.000497391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8890731,0.00006080352,0.0008005616,0.0003959816,0.0004098956,0.002580179,0.0001937021,0.00002294477,0.1064628],"genre_scores_gemma":[0.9985779,0.00002439562,0.00001437919,0.00004972417,0.0002449917,0.000142093,0.0001377438,0.000008525323,0.0008002416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9053795,"threshold_uncertainty_score":0.9996746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3011455298","doi":"10.1080/03155986.2020.1730676","title":"A survey of nonlinear robust optimization","year":2020,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Robust optimization; Mathematical optimization; Optimization problem; Ellipsoid; Computer science; Set (abstract data type); Polyhedron; Nonlinear system; Nonlinear programming; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2975716726628017,"gpt":0.4326705183870813,"spread":0.1350988457242796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00733785,0.00009346286,0.0002310383,0.0004427102,0.0002688002,0.0008789824,0.0003121634,0.0001018737,0.0001420816],"category_scores_gemma":[0.007840823,0.00007021977,0.00003087093,0.00166508,0.0001092804,0.002884154,0.0001167182,0.000161344,0.0001882587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002195435,"about_ca_system_score_gemma":0.0003725357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006755245,"about_ca_topic_score_gemma":0.00001863921,"domain_scores_codex":[0.9956024,0.0003530492,0.00126646,0.0001579543,0.002438974,0.0001811066],"domain_scores_gemma":[0.9929233,0.0009019481,0.0002762688,0.0002002613,0.005513519,0.0001847062],"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.00007304341,0.000008256841,0.01369539,0.00001577562,0.000008208868,2.000111e-7,0.001303348,0.9675025,0.000004460916,0.004790148,0.007628096,0.004970622],"study_design_scores_gemma":[0.0003240982,0.00009593137,0.01284453,0.000009981625,0.000001173983,0.000002686381,0.000897078,0.9422368,0.00002414252,0.00001173723,0.04347556,0.00007629913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07330871,0.000539485,0.8737149,0.003474416,0.0005885413,0.002391445,0.001073726,0.00007780427,0.04483103],"genre_scores_gemma":[0.9934644,0.0002653601,0.004954302,0.0002914001,0.0001068972,0.00003128351,0.0005646877,0.000006632659,0.0003150253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9201557,"threshold_uncertainty_score":0.9386764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2338680530","doi":"10.1080/03155986.2016.1167357","title":"Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"City logistics; Vehicle routing problem; Transport engineering; Point (geometry); Business; Distribution (mathematics); Computer science; Routing (electronic design automation); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08966874283481639,"gpt":0.3823053147348017,"spread":0.2926365718999853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075561,0.0001148911,0.0001915037,0.0004467783,0.0001361619,0.000150145,0.0001641069,0.00008934871,0.00007794928],"category_scores_gemma":[0.0002973728,0.00009215988,0.00002182345,0.0008013136,0.00006971639,0.0006887962,0.00001344779,0.0001074311,0.00009367704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001589641,"about_ca_system_score_gemma":0.0003078974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003562288,"about_ca_topic_score_gemma":0.0006902583,"domain_scores_codex":[0.9980832,0.0001342005,0.0007907267,0.0001075061,0.000674649,0.0002097658],"domain_scores_gemma":[0.9974731,0.0007476556,0.00007447259,0.0002415373,0.001308362,0.0001549227],"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.00009070633,0.00002123749,0.02607098,0.0002105126,0.00004808189,2.920906e-7,0.00110599,0.9318557,0.0005358055,0.01718104,0.006264923,0.01661468],"study_design_scores_gemma":[0.001324754,0.00009366799,0.4758646,0.0002279353,0.000009748912,8.592525e-7,0.0001889792,0.4257704,0.001593459,0.00005588815,0.09447869,0.0003910209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02194065,0.0000762328,0.9687524,0.0002903002,0.0001507165,0.001159132,0.002614113,0.0001163763,0.004900111],"genre_scores_gemma":[0.9862997,0.00004776541,0.01210316,0.00004534291,0.00006900229,0.0003320767,0.0007739284,0.00001473426,0.0003143215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.964359,"threshold_uncertainty_score":0.5385138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988125100","doi":"10.3138/infor.50.4.195","title":"A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations","year":2012,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Norges Forskningsråd","keywords":"Heuristic; Neighbourhood (mathematics); Submarine pipeline; Mathematical optimization; Time horizon; Computer science; Offshore oil and gas; Operations research; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04873724817383932,"gpt":0.3493930717933106,"spread":0.3006558236194713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003895337,0.000150489,0.0002065179,0.0005709152,0.000576188,0.0009362268,0.00009956611,0.0001348301,0.00001912658],"category_scores_gemma":[0.0003989032,0.0001457367,0.00002143079,0.0004159218,0.00005530099,0.00254054,0.00007037575,0.0003539102,0.00001447328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001390226,"about_ca_system_score_gemma":0.0001591199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008996252,"about_ca_topic_score_gemma":0.00001224625,"domain_scores_codex":[0.9980118,0.0001316259,0.0006408314,0.0001139965,0.0005244339,0.0005773556],"domain_scores_gemma":[0.9987963,0.0003666414,0.00002816853,0.0001256796,0.0004951007,0.0001881237],"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.00005294563,0.00004125011,0.02559105,0.001557546,0.00004333464,8.532201e-7,0.04676291,0.8549172,0.0002527832,0.05773731,0.0007629858,0.01227986],"study_design_scores_gemma":[0.0009391489,0.00004402409,0.006303553,0.0002116004,0.000003771474,0.00003569342,0.006884112,0.9735055,0.00005851465,0.00001690564,0.01181041,0.0001868013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7811808,0.002300691,0.2028833,0.0006690527,0.0003587331,0.001642678,0.0003427445,0.0001983033,0.0104237],"genre_scores_gemma":[0.9867573,0.0001422232,0.01206174,0.0000464617,0.0001503017,0.000430193,0.0002506309,0.00002078473,0.0001404004],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2055765,"threshold_uncertainty_score":0.9028057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408645284","doi":"10.1080/03155986.2006.11732743","title":"Steiner Tree Problems With Profits","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Steiner tree problem; Revenue; Travelling salesman problem; Combinatorics; Profit (economics); Computer science; Graph; Mathematics; Tree (set theory); Mathematical optimization; Mathematical economics; Economics; Microeconomics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.03667131125969007,"gpt":0.3026544600794135,"spread":0.2659831488197235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254362,0.0001076766,0.0001169888,0.0002967197,0.000229933,0.0005965007,0.00008941373,0.00007932145,0.00001729192],"category_scores_gemma":[0.00005215361,0.00008295275,0.00001222179,0.0004135336,0.00005464646,0.00169039,0.0000255371,0.0001894694,0.00007894445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007464411,"about_ca_system_score_gemma":0.00007620849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001426599,"about_ca_topic_score_gemma":0.00001919543,"domain_scores_codex":[0.9984705,0.00005610855,0.0004297417,0.00007585448,0.0007164709,0.0002513534],"domain_scores_gemma":[0.9989555,0.0001022447,0.00003537508,0.0001263351,0.0007141487,0.00006643394],"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.00001085851,0.000005597348,0.002167605,0.0002413063,0.00001448765,4.482913e-7,0.0003922063,0.9494909,0.0001485632,0.04068779,0.003483122,0.003357087],"study_design_scores_gemma":[0.0006809959,0.00007252287,0.004399111,0.00008867571,0.000002350135,0.00003291721,0.0003318668,0.8510604,0.0003100941,0.00002923968,0.1428051,0.0001867589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1890781,0.0006618318,0.3104,0.0005418963,0.0004411456,0.003907038,0.0001093544,0.0008242627,0.4940364],"genre_scores_gemma":[0.9902385,0.00001801068,0.00732342,0.00002748245,0.0001487154,0.0002761601,0.0001703954,0.00001714637,0.00178016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8011605,"threshold_uncertainty_score":0.575207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2271441614","doi":"10.1080/03155986.2001.11732431","title":"An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Waseda University","keywords":"Tabu search; Guided Local Search; Constraint satisfaction problem; Constraint (computer-aided design); Mathematical optimization; Constraint satisfaction; Constraint satisfaction dual problem; Computer science; Local consistency; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04851963617864127,"gpt":0.3632475017710505,"spread":0.3147278655924093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003973612,0.0001305038,0.0001356014,0.0003632502,0.001200108,0.002150388,0.0003185607,0.0001123852,0.00004875396],"category_scores_gemma":[0.0001261415,0.00009310262,0.00004004282,0.0005662961,0.0001149569,0.004675879,0.00007784828,0.000266224,0.00003295735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152189,"about_ca_system_score_gemma":0.000458354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008326783,"about_ca_topic_score_gemma":0.0001081644,"domain_scores_codex":[0.9978969,0.0002112123,0.0005755255,0.0002042196,0.0007709123,0.0003412526],"domain_scores_gemma":[0.9969321,0.0007074391,0.0001003065,0.0003264729,0.001776437,0.0001572715],"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.00005466924,0.00001437921,0.001139879,0.00005234531,0.00003521327,3.559369e-7,0.00212643,0.0154061,0.0004340858,0.5302216,0.000768679,0.4497462],"study_design_scores_gemma":[0.0006145681,0.0001378052,0.004699481,0.00001499144,0.000002602696,0.00008923979,0.001474977,0.9434468,0.00008854058,0.0002443765,0.04906414,0.0001224658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001641857,0.0000428028,0.9915034,0.002210708,0.000213788,0.001915408,0.00003526079,0.00008731145,0.002349518],"genre_scores_gemma":[0.8721331,0.0001655287,0.125653,0.0004930969,0.0001982335,0.0008198494,0.0001468165,0.00001006476,0.0003802242],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9280407,"threshold_uncertainty_score":0.9988855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402773259","doi":"10.1080/03155986.2006.11732739","title":"Measuring Bank Branch Efficiency Using Data Envelopment Analysis: Managerial And Implementation Issues","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":true},"ca_institutions":"University of Calgary","funders":"","keywords":"Data envelopment analysis; Envelopment; Work (physics); Computer science; Operations research; Econometrics; Business; Economics; Engineering; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2558205261929286,"gpt":0.4746162341464873,"spread":0.2187957079535588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01618793,0.0001528396,0.0003223394,0.002054511,0.001146864,0.004142053,0.000632857,0.00007978317,0.00009869965],"category_scores_gemma":[0.0008619787,0.0001200323,0.00004692516,0.002691894,0.0001639634,0.004747424,0.0004965491,0.0001545686,0.00008051474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133562,"about_ca_system_score_gemma":0.0002772316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004461556,"about_ca_topic_score_gemma":0.0004587766,"domain_scores_codex":[0.9931885,0.0003337142,0.001554261,0.0004026857,0.004153263,0.0003675689],"domain_scores_gemma":[0.9969804,0.000546152,0.0002893135,0.0006356582,0.0014453,0.0001031451],"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.0002121908,0.0001824437,0.1551942,0.0002688093,0.0009092317,0.000008422277,0.01401418,0.4995492,0.001922471,0.2025606,0.02431899,0.1008593],"study_design_scores_gemma":[0.0007729777,0.00004780964,0.05747991,0.00003459014,0.00008081055,0.0000183731,0.007000732,0.8155907,0.0001981173,0.0004398953,0.1180129,0.0003231688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9379789,0.0007171751,0.05427722,0.0006372232,0.0003702008,0.0009904705,0.0001842638,0.00003947044,0.004805056],"genre_scores_gemma":[0.9980095,0.00003647259,0.0008655166,0.00004791162,0.0002565448,0.00002382694,0.000412265,0.000004689419,0.0003432998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3160415,"threshold_uncertainty_score":0.9968917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149139265","doi":"10.3138/infor.48.3.143","title":"Goal Programming Model for Fire and Emergency Service Facilities Site Selection","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Decision maker; Operations research; Service (business); Process (computing); Computer science; Site selection; Selection (genetic algorithm); Goal programming; Function (biology); Decision-making; Operations management; Process management; Business; Engineering; Artificial intelligence; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.04245466412944671,"gpt":0.3167141210032354,"spread":0.2742594568737887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006937486,0.00009305878,0.00009891325,0.0001296754,0.0003565492,0.0004525872,0.00005073833,0.0001008383,0.00002427405],"category_scores_gemma":[0.0001525503,0.00008398039,0.00001677592,0.0001836611,0.00003035647,0.001543148,0.0000278396,0.000198757,0.00002098103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002152537,"about_ca_system_score_gemma":0.00004402806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007230657,"about_ca_topic_score_gemma":0.00008528954,"domain_scores_codex":[0.9990219,0.000009811585,0.0003725336,0.00007148206,0.0003078411,0.0002163797],"domain_scores_gemma":[0.9990197,0.00006927164,0.00002503381,0.00006472321,0.000720246,0.0001010513],"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.00006841798,0.00004257465,0.001348385,0.007135274,0.00008998405,1.692204e-7,0.02440848,0.5307756,0.001622594,0.3147742,0.006559751,0.1131745],"study_design_scores_gemma":[0.0001988898,0.00002106113,0.00004522776,0.00001477217,0.000001895089,0.000006769656,0.0007545242,0.9343756,0.00002549196,0.0001203238,0.06434298,0.00009248348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4450377,0.0002064844,0.542298,0.000475742,0.0006086992,0.003624633,0.0002288406,0.0004599635,0.007059931],"genre_scores_gemma":[0.9858547,0.00005123276,0.01231459,0.00002693521,0.00008760885,0.0005573957,0.0001592335,0.00001150525,0.0009367752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.540817,"threshold_uncertainty_score":0.4364309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407846668","doi":"10.1080/03155986.2002.11732647","title":"Manufacturer-Retailer Supply Chain Cooperation Through Franchising: A Chance Constrained Game Approach","year":2002,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Franchising Strategies and Performance","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Procter and Gamble","keywords":"Supply chain; Business; Game theory; Bargaining power; Profit (economics); Industrial organization; General partnership; Dominance (genetics); Payment; Microeconomics; Bargaining problem; Profit sharing; Marketing; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.06361520385942697,"gpt":0.2825379827791156,"spread":0.2189227789196886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00104022,0.0002203054,0.0002391897,0.0003689477,0.0008463595,0.002792785,0.0002143621,0.0001548938,0.0004332208],"category_scores_gemma":[0.0001128796,0.0001823416,0.00004554357,0.0005692664,0.0002031153,0.009042095,0.00008094265,0.000367163,0.0006993897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005006536,"about_ca_system_score_gemma":0.00005238609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008624733,"about_ca_topic_score_gemma":0.00001439958,"domain_scores_codex":[0.9977638,0.00002724576,0.0006431043,0.0002095204,0.0009091059,0.0004472099],"domain_scores_gemma":[0.9986237,0.00006915909,0.0001661309,0.0002254842,0.0008831983,0.00003235757],"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.0001270468,0.0001089175,0.001609584,0.001716951,0.00007065909,0.000002528656,0.005847066,0.02044057,0.0001582347,0.8932308,0.06274875,0.01393888],"study_design_scores_gemma":[0.0008149449,0.00003153659,0.001317607,0.00008316866,0.000004208686,0.00001941018,0.001265759,0.4220964,0.00002358309,0.0001042147,0.5739918,0.0002473402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3149303,0.001926643,0.02818395,0.004170832,0.001788877,0.003957182,0.0001091799,0.0003573211,0.6445757],"genre_scores_gemma":[0.9951904,0.0001252167,0.0003119149,0.001477299,0.001038429,0.0001859893,0.0003615257,0.00001392989,0.001295339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8931266,"threshold_uncertainty_score":0.9982424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400788038","doi":"10.1080/03155986.2004.11732701","title":"Combining Goal Programming Model With Simulation Analysis For Bank Asset Liability Management","year":2004,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Solvency; Balance sheet; Market liquidity; Liability; Goal programming; Computer science; Interest rate; Asset (computer security); Order (exchange); Actuarial science; Business; Econometrics; Economics; Operations research; Risk analysis (engineering); Finance; Engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.1596867471610688,"gpt":0.4551165224040205,"spread":0.2954297752429517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01265124,0.0001428737,0.0003167454,0.001563945,0.00100037,0.002703878,0.0003644907,0.00008919911,0.0000112544],"category_scores_gemma":[0.001371925,0.00009979388,0.00010711,0.002952443,0.0001562132,0.003090264,0.0001135644,0.0001688475,0.000046686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002100618,"about_ca_system_score_gemma":0.0002766023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001441564,"about_ca_topic_score_gemma":0.00006395068,"domain_scores_codex":[0.9945502,0.000127705,0.001180462,0.000312508,0.00346856,0.0003605123],"domain_scores_gemma":[0.9945996,0.001095376,0.0002537265,0.0004316742,0.003484999,0.0001346086],"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.00006328363,0.00002742697,0.003242108,0.00003411632,0.000109887,2.64088e-7,0.001076066,0.9176663,0.000002199597,0.07383253,0.00005321046,0.003892578],"study_design_scores_gemma":[0.0007464633,0.0001152931,0.004061267,0.00002729588,0.0000455185,0.000001523395,0.002376122,0.9799092,0.000008477284,0.001146943,0.01142909,0.0001328008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1213898,0.00002002621,0.8729976,0.0004127631,0.00004662572,0.001384901,0.0000568103,0.00003297306,0.003658411],"genre_scores_gemma":[0.9866664,0.00000229938,0.01228226,0.00008175705,0.00002860188,0.0002772803,0.0001911611,0.000005140155,0.000465145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8652765,"threshold_uncertainty_score":0.9983314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2624312899","doi":"","title":"A importância da utilização de diferentes recursos didáticos no Ensino de Ciências e Biologia","year":2017,"lang":"pt","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Science and Education Research","field":"Social Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.2556733311565305,"gpt":0.4845421306801718,"spread":0.2288687995236413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01477509,0.0002361368,0.0003149125,0.0005728226,0.007167264,0.008712974,0.001221228,0.0004099483,0.0004955886],"category_scores_gemma":[0.01117161,0.000202645,0.00009056882,0.0005022793,0.001367047,0.005082147,0.0004269214,0.0007110094,0.001368475],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006623943,"about_ca_system_score_gemma":0.005975524,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01187618,"about_ca_topic_score_gemma":0.0003000681,"domain_scores_codex":[0.9943591,0.0006491528,0.00090584,0.000315193,0.002431279,0.001339385],"domain_scores_gemma":[0.9937968,0.000765275,0.0003739588,0.0006255084,0.003690454,0.0007479839],"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.0003849377,0.0002709962,0.3194563,0.0007798166,0.0001789205,0.00001390193,0.1181102,0.0002202475,0.0005803103,0.3332367,0.1713674,0.05540034],"study_design_scores_gemma":[0.001151091,0.000493917,0.1504326,0.0005528117,0.00001615077,0.00004719317,0.1047006,0.08790572,0.000189923,0.0005073136,0.6533144,0.0006882405],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7994465,0.0008311807,0.001383475,0.01724121,0.002779147,0.003914286,0.0004220648,0.0001037791,0.1738783],"genre_scores_gemma":[0.9842187,0.0009997073,0.00009111162,0.000471578,0.0006003297,0.000250797,0.0000995868,0.00001006652,0.01325817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.481947,"threshold_uncertainty_score":0.9996597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399994135","doi":"10.1080/03155986.2006.11732744","title":"Gender-Specific Genetic Algorithms<sup>*</sup>","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06962427366799345,"gpt":0.326702144233142,"spread":0.2570778705651485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002787193,0.0001876575,0.0002167658,0.0009239403,0.0008011584,0.003404589,0.0007696863,0.0001389515,0.0001055596],"category_scores_gemma":[0.0002283883,0.000165985,0.00004597209,0.001152744,0.0001594548,0.003684894,0.0003817707,0.0003731311,0.0009086112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001554672,"about_ca_system_score_gemma":0.0004984645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003323497,"about_ca_topic_score_gemma":0.000001470219,"domain_scores_codex":[0.9952493,0.0002774863,0.0009626686,0.0003052769,0.002612158,0.0005930834],"domain_scores_gemma":[0.9964243,0.0003769297,0.0001062255,0.0005443271,0.002315391,0.000232828],"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.00001337725,0.0000483742,0.0005808307,0.0001198021,0.00002456762,0.00001019161,0.001294004,0.1850362,0.00001872417,0.740509,0.03620258,0.03614229],"study_design_scores_gemma":[0.0004297936,0.00004414826,0.002520198,0.00001232517,7.378585e-7,0.00006761242,0.0002378123,0.7393154,0.00002504656,0.0004402637,0.2567541,0.0001525442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002482222,0.0006835171,0.95815,0.0005651266,0.0002322013,0.001096499,0.00004892141,0.0001249847,0.0366165],"genre_scores_gemma":[0.7387022,0.0006774419,0.2500017,0.0004508257,0.001290748,0.0008634144,0.0005300017,0.00004122435,0.007442362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7400688,"threshold_uncertainty_score":0.9998693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W197662372","doi":"10.1080/03155986.2000.11732399","title":"On The Single Server Retrial Queue With Balking","year":2000,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Retrial queue; Queue; Computer science; Computer network; Queueing system","retraction":null,"screen_n_in":null,"score":{"opus":0.03922271785103644,"gpt":0.2728534931082743,"spread":0.2336307752572379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560401,0.00007712746,0.00006861848,0.0001005707,0.0003138396,0.0004444396,0.00007629597,0.00005182161,0.0001304859],"category_scores_gemma":[0.0001050897,0.00004791639,0.000009800821,0.0001606298,0.0000477573,0.0008067069,0.000009778229,0.0001942309,0.0001191781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006835472,"about_ca_system_score_gemma":0.00002893231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003733926,"about_ca_topic_score_gemma":0.000005857254,"domain_scores_codex":[0.9990587,0.00003058532,0.0002207668,0.00005347906,0.0004771789,0.0001592776],"domain_scores_gemma":[0.9993863,0.0002378939,0.00001721331,0.0001196515,0.000195962,0.00004303484],"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.00004148463,0.000003002442,0.000007501243,0.00002674455,0.00000855437,2.812946e-7,0.0003310696,0.9326098,0.000004504496,0.06166024,0.001575114,0.003731732],"study_design_scores_gemma":[0.001055984,0.0003067278,0.0006235265,0.0001829698,0.000004025771,0.00002762183,0.0008836559,0.7052156,0.0006625153,0.0005521699,0.2901811,0.0003041605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4676666,0.000201428,0.08261332,0.0009318496,0.000624755,0.002464477,0.0001041041,0.0004570278,0.4449365],"genre_scores_gemma":[0.9987023,0.0000377721,0.0002285475,0.0000853314,0.00009533991,0.0000579303,0.0000576103,0.000007044275,0.0007281249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5310357,"threshold_uncertainty_score":0.4285741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734925211","doi":"10.1080/03155986.2017.1346915","title":"The zone-based dynamic facility layout problem","year":2017,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Facility location problem; Engineering drawing; Operations research; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03752301968987841,"gpt":0.3225654708859657,"spread":0.2850424511960872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009871735,0.00007931885,0.00007385576,0.00007549881,0.001761454,0.001588346,0.0001959908,0.00006172787,0.000004832933],"category_scores_gemma":[0.0002495779,0.00005589475,0.00001539611,0.00003800223,0.0001388118,0.001221339,0.0000441658,0.0001940573,0.00007465158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008151339,"about_ca_system_score_gemma":0.00006816685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000928385,"about_ca_topic_score_gemma":0.00004207021,"domain_scores_codex":[0.9990066,0.00002333489,0.0002896319,0.00005895294,0.000420223,0.0002012664],"domain_scores_gemma":[0.99907,0.0001492963,0.0000492015,0.0002797898,0.0003913861,0.00006027676],"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.00001245226,0.000001982295,0.0001690059,0.000100935,0.000008551599,1.845588e-7,0.0001635364,0.9740821,0.000005286873,0.0145488,0.0007847652,0.01012244],"study_design_scores_gemma":[0.000245498,0.00001790481,0.002678029,0.00002032791,9.862461e-7,0.000002036779,0.0002026168,0.8332199,0.00004498161,0.0001005883,0.1633849,0.00008220912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02085811,0.000361094,0.9172912,0.001119701,0.0008224283,0.001853703,0.0003555471,0.0002858256,0.05705234],"genre_scores_gemma":[0.9983605,0.00006027133,0.0007178524,0.00001671964,0.00002737628,0.0001234644,0.0001246632,0.000004047808,0.0005651459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9775023,"threshold_uncertainty_score":0.9995381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605705048","doi":"10.1080/03155986.2017.1303960","title":"New large-scale data instances for CARP and new variations of CARP","year":2017,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Samfund og Erhverv, Det Frie Forskningsråd","keywords":"Arc routing; Carp; Scale (ratio); Computer science; Time horizon; Routing (electronic design automation); Interval (graph theory); Horizon; Operations research; Fish <Actinopterygii>; Environmental science; Fishery; Geography; Mathematics; Biology; Mathematical optimization; Cartography; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1421400732301555,"gpt":0.4055165549706601,"spread":0.2633764817405046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001879152,0.00008359995,0.0001553971,0.0001679446,0.0005707656,0.0007817383,0.0003119074,0.00008521942,0.00001325011],"category_scores_gemma":[0.000781039,0.00007865528,0.00001366028,0.00009964175,0.00004304685,0.003234925,0.0001589663,0.0001139792,0.000005214212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000313251,"about_ca_system_score_gemma":0.0002944287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005030683,"about_ca_topic_score_gemma":0.00009934755,"domain_scores_codex":[0.9988301,0.00003092325,0.0004543154,0.00009630746,0.0004022609,0.0001861252],"domain_scores_gemma":[0.9986201,0.0002270238,0.00009599826,0.0004349954,0.0004886432,0.0001332276],"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.000119579,0.00002328432,0.01430669,0.00205934,0.00025482,4.059166e-7,0.01794283,0.3235996,0.0004662997,0.4400639,0.08398478,0.1171784],"study_design_scores_gemma":[0.0008065805,0.00002761548,0.004508482,0.0000628886,0.000005679753,0.000003966644,0.0006809508,0.8483753,0.0001008937,0.000114204,0.145213,0.0001004697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006183287,0.0003986013,0.9798306,0.000439968,0.0003812488,0.000946302,0.0007050185,0.00005259275,0.01106242],"genre_scores_gemma":[0.8213696,0.0003354297,0.1750266,0.00004632353,0.000493131,0.00008471758,0.0007760656,0.00002336783,0.001844815],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8151863,"threshold_uncertainty_score":0.753832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134787308","doi":"10.3138/infor.47.1.5","title":"A Discrete Stochastic Goal Program for Portfolio Selection: The Case of United Arab Emirates Equity Market","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Portfolio; Equity (law); Stochastic programming; Goal programming; Normality; Selection (genetic algorithm); Economics; Computer science; Econometrics; Portfolio optimization; Modern portfolio theory; Actuarial science; Financial economics; Operations research; Mathematical optimization; Mathematics; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04476132573014004,"gpt":0.3676382944881015,"spread":0.3228769687579615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348512,0.0000943502,0.0001286186,0.0002391412,0.0003208322,0.0004529864,0.00008860685,0.0000700833,0.0000321485],"category_scores_gemma":[0.0003183915,0.00006552871,0.00003235929,0.0004930121,0.00006865355,0.0007958278,0.00002700199,0.0001516007,0.000005110105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004547083,"about_ca_system_score_gemma":0.00006544343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003142438,"about_ca_topic_score_gemma":0.000005453005,"domain_scores_codex":[0.9988675,0.00003343635,0.0005010118,0.00005861167,0.0003152609,0.0002242371],"domain_scores_gemma":[0.9987425,0.0002543943,0.00005320834,0.00009548718,0.0007720453,0.00008242631],"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.0001276211,0.00006263666,0.00001977165,0.001069124,0.00009429983,0.000002970432,0.002067304,0.4005458,0.00004756147,0.4901565,0.01266993,0.09313644],"study_design_scores_gemma":[0.0003452657,0.000174657,0.00005101626,0.00004966137,0.000005780841,0.000142475,0.001083264,0.9815114,0.00002936038,0.00037167,0.01615146,0.00008404781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0598336,0.0004167162,0.8443024,0.001076558,0.0004286681,0.01195377,0.0002882401,0.0006324788,0.08106758],"genre_scores_gemma":[0.9974493,0.00001079893,0.001748535,0.00004151763,0.00005793435,0.0003764649,0.0001008426,0.000005882938,0.0002086569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9376158,"threshold_uncertainty_score":0.4368158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402530292","doi":"10.1080/03155986.2002.11732639","title":"Business-To-Business Ecommerce Of Information Systems: Two Cases Of Asp-To-Sme Erental","year":2002,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Outsourcing and Supply Chain Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Application service provider; Business; The Internet; Product (mathematics); Hospitality; Service (business); Marketing; Service provider; Tourism; Computer science; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.05857629589769801,"gpt":0.303531020033408,"spread":0.24495472413571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001827612,0.0001981479,0.0003480348,0.001835909,0.000358536,0.001200864,0.0003120832,0.00007996781,0.0001091661],"category_scores_gemma":[0.0008609886,0.0001735075,0.00004204396,0.001911586,0.00007233538,0.006594707,0.0003210307,0.0001443078,0.0007593325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008520243,"about_ca_system_score_gemma":0.00005974868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006316136,"about_ca_topic_score_gemma":0.00004557458,"domain_scores_codex":[0.9968512,0.00003905993,0.001236229,0.000133716,0.00138769,0.000352097],"domain_scores_gemma":[0.9954671,0.0001764687,0.0003333775,0.0002869122,0.003676277,0.00005990781],"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.0003832768,0.0002229312,0.04156135,0.01182373,0.0001916496,0.000005941185,0.006397716,0.533532,0.0001872001,0.2741632,0.1100345,0.02149658],"study_design_scores_gemma":[0.001759437,0.00009190798,0.04976273,0.000921491,0.00002562251,0.00002797611,0.01058596,0.2308694,0.00002116107,0.00002337167,0.7054284,0.0004824714],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7974091,0.0003219284,0.02997497,0.006603356,0.002474247,0.007357066,0.0004524498,0.0002276729,0.1551792],"genre_scores_gemma":[0.998028,0.00001793226,0.00013235,0.0005735616,0.0003276753,0.0001671169,0.0002844903,0.00001084544,0.0004580027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.595394,"threshold_uncertainty_score":0.999836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397709794","doi":"10.1080/03155986.2005.11732727","title":"Strategic and Dilemma Analyses of a Water Export Conflict","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Global Energy Security and Policy","field":"Energy","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":true},"ca_institutions":"University of Waterloo","funders":"","keywords":"Dilemma; Conflict resolution; Complement (music); Outcome (game theory); Social dilemma; Phase (matter); Face (sociological concept); Political science; Law and economics; Positive economics; Management science; Business; Economics; Sociology; Epistemology; Microeconomics; Law; Social science; Philosophy; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.1595954610058773,"gpt":0.4019734812727606,"spread":0.2423780202668833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008253739,0.00009358595,0.0001601581,0.0002799878,0.000204041,0.0003211112,0.00008834964,0.00009734607,0.0001297016],"category_scores_gemma":[0.00005804286,0.00006435948,0.0000256056,0.0001480467,0.000128356,0.001529037,0.00006466041,0.0001253218,0.00009737424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002948485,"about_ca_system_score_gemma":0.00008475552,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008747733,"about_ca_topic_score_gemma":0.000209868,"domain_scores_codex":[0.9985335,0.00006478977,0.0005315676,0.00007800182,0.0005598352,0.0002323359],"domain_scores_gemma":[0.9990017,0.00007570837,0.00005377672,0.0001204296,0.0006333099,0.0001150937],"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.00003045445,0.000009348796,0.00007134078,0.0000758586,0.00003004674,3.775003e-7,0.001733631,0.01079431,0.0006586281,0.984411,0.0004662336,0.001718788],"study_design_scores_gemma":[0.0005507024,0.00009018517,0.0009337722,0.00003187471,0.000004354072,0.00003415089,0.001397556,0.01438626,0.003397892,0.0002175941,0.9788409,0.0001147754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7996234,0.000251003,0.00001799312,0.0004155425,0.00004665049,0.0002057618,0.00004930663,0.00001861824,0.1993718],"genre_scores_gemma":[0.9986667,0.0001135899,0.00005965472,0.0001582776,0.0001353064,0.00004011481,0.0001779325,0.000003513261,0.0006448823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9841934,"threshold_uncertainty_score":0.9978531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404114287","doi":"10.1080/03155986.2005.11732731","title":"Development of a Decision Algorithm to Support Emergency Triage of Scrotal Pain and its Implementation in the met system","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Triage; Workflow; Computer science; Scrotal Pain; Algorithm; Clinical decision support system; Decision support system; USable; Medical emergency; Medicine; Artificial intelligence; Scrotum","retraction":null,"screen_n_in":null,"score":{"opus":0.05964374840539965,"gpt":0.4098256530799815,"spread":0.3501819046745819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004521277,0.00005668874,0.0001008534,0.0001622451,0.00009371177,0.00003532338,0.00009899175,0.00006595185,0.00001152347],"category_scores_gemma":[0.0002475001,0.00003863203,0.00001392752,0.0001624501,0.00002611417,0.0000344207,0.00006885693,0.00005160144,0.000004064344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001882864,"about_ca_system_score_gemma":0.000150785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003880282,"about_ca_topic_score_gemma":0.00005207215,"domain_scores_codex":[0.9986167,0.0001067887,0.0006268116,0.00007315195,0.0004572853,0.0001192642],"domain_scores_gemma":[0.9994321,0.00006362299,0.00007746748,0.00007591162,0.0003085796,0.00004233505],"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.0001122371,0.00002817778,0.001075984,0.0002614402,0.00002873473,3.864542e-7,0.008405425,0.0001135138,0.006160436,0.004029002,0.002128839,0.9776558],"study_design_scores_gemma":[0.005002818,0.003576993,0.03849809,0.0003786997,0.00001197622,0.00009703511,0.1345451,0.02656535,0.03790248,0.00002237037,0.7528805,0.000518616],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9819251,0.0002199674,0.01655536,0.0001013297,0.00005160706,0.000649906,0.00006269518,0.000002831168,0.000431165],"genre_scores_gemma":[0.9922096,0.00002870134,0.007421627,0.00003272848,0.00003916412,0.0001053329,0.0001323567,0.000001853967,0.00002866736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9771372,"threshold_uncertainty_score":0.1575368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071356625","doi":"10.3138/infor.48.3.171","title":"Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Duration (music); Single-machine scheduling; Sequence (biology); Optimal maintenance; Time complexity; Mathematics; Algorithm; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.0328483672833578,"gpt":0.3003176171823294,"spread":0.2674692498989716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00176983,0.0001886466,0.0001830741,0.0003140699,0.0005894618,0.001467928,0.0001075611,0.0001434341,0.00003271495],"category_scores_gemma":[0.0002030328,0.0001507655,0.00002150447,0.0003076612,0.0001186208,0.003659058,0.00003182227,0.0006188604,0.00003491243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008433047,"about_ca_system_score_gemma":0.0001370372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009932224,"about_ca_topic_score_gemma":0.00009186283,"domain_scores_codex":[0.9982516,0.00008693703,0.0004213517,0.0001574148,0.000766717,0.0003159839],"domain_scores_gemma":[0.9984552,0.0002399309,0.00007408168,0.0001847135,0.0008765666,0.0001695406],"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.00003810956,0.00001750074,0.0008310074,0.0001819041,0.00002972172,8.199909e-7,0.0007228515,0.9747562,0.007791821,0.009444351,0.00003016348,0.006155484],"study_design_scores_gemma":[0.0007654483,0.0001999639,0.001025162,0.00009651026,0.0000036253,0.00008626151,0.0003595229,0.9943485,0.00159843,0.00002035817,0.001279676,0.0002165958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8302689,0.00005191496,0.1654361,0.0002053964,0.0004119342,0.0008244422,0.00003956812,0.000238152,0.00252367],"genre_scores_gemma":[0.9809282,0.000009914418,0.01835101,0.00005655255,0.0001858358,0.0001710664,0.0002137729,0.00002005259,0.00006363619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1506593,"threshold_uncertainty_score":0.9995686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2564993082","doi":"10.1080/03155986.2016.1262581","title":"Evaluating NBA player performance using bounded integer data envelopment analysis","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"China Scholarship Council; National Natural Science Foundation of China; Worcester Polytechnic Institute","keywords":"Bounded function; Integer (computer science); Data envelopment analysis; Basketball; Set (abstract data type); Mathematics; Data set; Integer programming; Measure (data warehouse); Computer science; Mathematical optimization; Statistics; Data mining; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.5586766781706949,"gpt":0.5519394211901244,"spread":0.006737256980570483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.03184778,0.0001636558,0.0003616707,0.002200024,0.001184354,0.002685518,0.001180056,0.0001097594,0.0003334491],"category_scores_gemma":[0.007485883,0.00009351569,0.00007122571,0.003125237,0.0002465724,0.007580482,0.000743141,0.000200222,0.000721818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002516513,"about_ca_system_score_gemma":0.0008276017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003159521,"about_ca_topic_score_gemma":0.00004279646,"domain_scores_codex":[0.9909412,0.0004650521,0.001771315,0.0004288282,0.005952401,0.0004411758],"domain_scores_gemma":[0.992646,0.002132576,0.0003665359,0.001116313,0.003565402,0.0001731302],"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.0004786082,0.0001484496,0.1652987,0.0001570067,0.001732904,0.000004627795,0.01154236,0.323117,0.00390017,0.06256203,0.0138568,0.4172013],"study_design_scores_gemma":[0.0003954508,0.00005005856,0.008761549,0.00006231335,0.00003418514,0.00001099006,0.001201246,0.9404159,0.0001117026,0.0000870119,0.04870038,0.0001692561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8921928,0.0001055217,0.1013103,0.0007255677,0.0002734694,0.0005632809,0.000146829,0.00002888843,0.004653363],"genre_scores_gemma":[0.9959171,0.00003243291,0.002231634,0.000120565,0.00009404962,0.00003258369,0.0001095968,0.000005324979,0.001456655],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6172988,"threshold_uncertainty_score":0.9983498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2562878095","doi":"10.1080/03155986.2016.1262584","title":"A hybrid data envelopment analysis approach to analyse college graduation rate at higher education institutions","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Graduation (instrument); Higher education; Transparency (behavior); Accountability; Data envelopment analysis; Context (archaeology); Mathematics education; Computer science; Political science; Economics; Psychology; Mathematics; Economic growth; Statistics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.3466908090103628,"gpt":0.4714223450038434,"spread":0.1247315359934806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01461262,0.000182054,0.0003668337,0.00363522,0.001290611,0.001473426,0.001095146,0.00008397796,0.0002049522],"category_scores_gemma":[0.003713024,0.0001126958,0.00008720106,0.005102667,0.0001937971,0.005009141,0.0007082554,0.0001307081,0.001477851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005637082,"about_ca_system_score_gemma":0.00148949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004233788,"about_ca_topic_score_gemma":0.00008982929,"domain_scores_codex":[0.9932576,0.0005579802,0.001590832,0.0005573211,0.003660276,0.0003759877],"domain_scores_gemma":[0.9934153,0.001067331,0.0003059312,0.001297358,0.003580292,0.0003337842],"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.0002208868,0.0003419294,0.01697928,0.00005116242,0.0008157665,0.000001521671,0.002251388,0.09463298,0.0006703251,0.60458,0.2499844,0.02947037],"study_design_scores_gemma":[0.000474564,0.00004510169,0.05008193,0.00003876981,0.00008495658,0.0000128488,0.001234091,0.1229573,0.00009753754,0.0004095177,0.8242598,0.000303613],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5448589,0.0003474669,0.315454,0.01792701,0.001459582,0.004194367,0.003583382,0.0001459464,0.1120294],"genre_scores_gemma":[0.9828022,0.00002504628,0.001356324,0.000405438,0.0001165216,0.0002428479,0.001077693,0.000005384845,0.01396854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6041704,"threshold_uncertainty_score":0.9995632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401571420","doi":"10.1080/03155986.2024.2385189","title":"Diagnosing infeasible optimization problems using large language models","year":2024,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Solver; Optimization problem; Artificial intelligence; Natural language; Machine learning; Mathematical optimization; Programming language; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1203811663468925,"gpt":0.3876422347020393,"spread":0.2672610683551468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002499392,0.0001115327,0.0001172663,0.0006367561,0.0005881605,0.004493637,0.0003014118,0.00009057839,0.00001988814],"category_scores_gemma":[0.0001601053,0.00009801434,0.00002820222,0.0009577987,0.000045771,0.01359476,0.0002317842,0.0002323774,0.0001376964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000168097,"about_ca_system_score_gemma":0.0004034903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006195657,"about_ca_topic_score_gemma":0.00001633071,"domain_scores_codex":[0.9979072,0.00009649602,0.0005338273,0.0001814292,0.0009039395,0.0003770644],"domain_scores_gemma":[0.9985897,0.000245915,0.00004891399,0.0002314427,0.0007730095,0.0001110503],"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.00000153379,0.000006417495,0.00002284438,0.0001214431,0.000006400178,0.000002188458,0.005192921,0.55606,0.00004484938,0.4358914,0.0002998046,0.00235029],"study_design_scores_gemma":[0.00007550365,0.00003262548,0.000006184237,0.0001924754,0.000001210568,0.00003895881,0.001638424,0.9860438,0.0002917375,0.000626464,0.01093565,0.0001170022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007237496,0.0009231284,0.9830009,0.0002991893,0.0003336225,0.0006859427,0.00002175353,0.0001460028,0.007351914],"genre_scores_gemma":[0.9891824,0.0001198112,0.009936917,0.0001131686,0.0001307347,0.0001390805,0.00006377441,0.00000913505,0.0003049922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9819449,"threshold_uncertainty_score":0.9965398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977015962","doi":"10.3138/infor.47.4.289","title":"On Accommodating Customer Flexibility in Service Systems","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Flexibility (engineering); Computer science; Queueing theory; Service (business); Distributed computing; Simple (philosophy); Computer network; Mathematical optimization; Operations research; Mathematics; Business; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06432650438958139,"gpt":0.352736722981126,"spread":0.2884102185915446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003668882,0.0001325044,0.000201198,0.0008912841,0.0004216509,0.001415928,0.0002108669,0.00008657361,0.00003861308],"category_scores_gemma":[0.0007283147,0.000113004,0.00002615696,0.001166595,0.00003457489,0.006557598,0.00008473687,0.000308044,0.0008048564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265176,"about_ca_system_score_gemma":0.00005462633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224768,"about_ca_topic_score_gemma":0.00005043884,"domain_scores_codex":[0.9979848,0.00005727235,0.0006655213,0.0001552288,0.0008392134,0.0002979696],"domain_scores_gemma":[0.9982924,0.0002518047,0.0001537532,0.000241237,0.001036625,0.00002416261],"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.00008985789,0.00002576578,0.0008242851,0.0001982591,0.000007984306,9.998779e-7,0.000233741,0.2042343,0.00003098259,0.7905753,0.0008815664,0.002896933],"study_design_scores_gemma":[0.000933743,0.00003374222,0.006230081,0.0003185156,0.000005823373,0.00000555702,0.003454626,0.8766235,0.00001224579,0.003933934,0.1081302,0.0003180794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8096297,0.00008943326,0.001311505,0.00207945,0.000340913,0.001551942,0.00001941371,0.000142233,0.1848354],"genre_scores_gemma":[0.9975714,0.000003472936,0.00003019306,0.001721946,0.0002652697,0.00007201284,0.0001243276,0.000005361777,0.0002060367],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7866414,"threshold_uncertainty_score":0.9999731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008110601","doi":"10.3138/infor.51.3.103","title":"A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China","year":2013,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Centre for International Governance Innovation; Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Graph; China; Computer science; Component (thermodynamics); Water diversion; Operations research; Conflict resolution; Graph theory; Management science; Mathematical optimization; Theoretical computer science; Mathematics; Economics; Political science; Environmental science; Water resource management","retraction":null,"screen_n_in":null,"score":{"opus":0.1114583082501823,"gpt":0.3902588848800015,"spread":0.2788005766298192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005039711,0.000128766,0.0001992236,0.0009048465,0.0006168258,0.001013302,0.0003700425,0.0001089315,0.00004641974],"category_scores_gemma":[0.0004953421,0.00007903534,0.00003398185,0.0006865418,0.0001471836,0.002453861,0.0001374553,0.0002139411,0.0006893305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007779334,"about_ca_system_score_gemma":0.0001137775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004505115,"about_ca_topic_score_gemma":0.00004310862,"domain_scores_codex":[0.9969475,0.0001371364,0.0007958233,0.0002687148,0.001474169,0.0003766423],"domain_scores_gemma":[0.997129,0.0005449587,0.00008553035,0.0003483216,0.001667493,0.0002246929],"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.0006160557,0.00007609931,0.001733354,0.00007468488,0.00001763272,2.181371e-7,0.01983393,0.289413,0.002666347,0.6597623,0.009112368,0.01669398],"study_design_scores_gemma":[0.0009484133,0.0001660466,0.008623569,0.00003295388,0.00000190752,0.000007402674,0.001547514,0.8999455,0.0002618988,0.007720995,0.08057853,0.000165254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5871665,0.00001423319,0.3984927,0.00433388,0.00004107427,0.004692488,0.0001022502,0.00003038361,0.00512651],"genre_scores_gemma":[0.9943985,0.000005538545,0.0009864442,0.000335207,0.00004500697,0.002678322,0.0001752575,0.000006135504,0.001369578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6520414,"threshold_uncertainty_score":0.9771292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156834446","doi":"10.3138/infor.46.2.93","title":"Supply Chain Optimization: Current Practices and Overview of Emerging Research Opportunities","year":2008,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Supply chain; Current (fluid); Supply chain management; Supply chain optimization; Computer science; Field (mathematics); Systems engineering; Management science; Risk analysis (engineering); Business; Engineering; Marketing; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3463561009143949,"gpt":0.4233349593594498,"spread":0.07697885844505492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001741486,0.00009569014,0.0001454562,0.0005181573,0.0004851671,0.0001917522,0.00009035261,0.00006499161,0.00002470892],"category_scores_gemma":[0.0005299542,0.00008816717,0.00001299115,0.0002658984,0.0001977796,0.002000591,0.00007254117,0.0002899237,0.000006378771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005384042,"about_ca_system_score_gemma":0.0001312058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008896235,"about_ca_topic_score_gemma":0.000002717227,"domain_scores_codex":[0.9983078,0.00009817573,0.0004825928,0.00008583154,0.0007987433,0.0002268681],"domain_scores_gemma":[0.9982215,0.0003553179,0.0001013565,0.0001262005,0.001099678,0.00009594108],"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.00001333728,0.000007327986,0.0001941764,0.0006572979,0.00001294581,8.577181e-7,0.002039869,0.9517052,0.000005744109,0.03900639,0.001462926,0.004893915],"study_design_scores_gemma":[0.000339645,0.00006628805,0.0005925078,0.0001881206,0.000002629589,0.00004347705,0.003150634,0.8699861,0.0001259823,0.00008536014,0.1252745,0.0001447754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1782245,0.06738335,0.6450217,0.002451539,0.002413223,0.006592271,0.0007171531,0.0007014402,0.0964948],"genre_scores_gemma":[0.9645692,0.03194433,0.002804338,0.00001297762,0.0001068278,0.0001165824,0.0002080685,0.00001141016,0.0002262888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7863446,"threshold_uncertainty_score":0.3731562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401783591","doi":"10.1080/03155986.2024.2388452","title":"LM4OPT: Unveiling the potential of Large Language Models in formulating mathematical optimization problems","year":2024,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Topic Modeling","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Comprehension; Task (project management); Computer science; Shot (pellet); Natural language processing; Artificial intelligence; Machine learning; Engineering; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.0502706093629151,"gpt":0.3448931668239208,"spread":0.2946225574610057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003162856,0.00006869964,0.0001028351,0.0003152069,0.0001792724,0.0008815592,0.0002595707,0.00006136311,0.000007977921],"category_scores_gemma":[0.0001226829,0.00004658383,0.00002395728,0.0004265826,0.00002765815,0.003667435,0.0001847093,0.0002105446,0.00001264957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005097066,"about_ca_system_score_gemma":0.0001712022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001084294,"about_ca_topic_score_gemma":0.000005159927,"domain_scores_codex":[0.9982522,0.00007069664,0.0006044022,0.0001049139,0.000758699,0.0002091406],"domain_scores_gemma":[0.999222,0.0002036664,0.00004830579,0.0001847223,0.0003046149,0.0000367387],"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.000001145196,0.000003396108,0.00000819176,0.0001668937,0.000003241563,4.469593e-7,0.005230573,0.5801072,0.00002388438,0.4130022,0.00001524792,0.001437663],"study_design_scores_gemma":[0.0001526861,0.00001545,0.00001885799,0.0001933128,7.596725e-7,0.00001906812,0.001724317,0.9958665,0.00002540701,0.00168819,0.0002446685,0.00005082672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01741434,0.0003017365,0.977677,0.0003610173,0.00009488775,0.0005238153,0.000008477577,0.00003389596,0.003584831],"genre_scores_gemma":[0.989857,0.00001981556,0.009860132,0.00003267561,0.00004606223,0.00007050986,0.00001955038,0.00000354318,0.00009074221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9724426,"threshold_uncertainty_score":0.8500896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140138578","doi":"10.3138/infor.47.3.185","title":"The Strategic Design of Forest Industry Supply Chains","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Forest Management and Policy","field":"Environmental Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":true},"ca_institutions":"Université Laval","funders":"","keywords":"Rationalization (economics); Supply chain; Computer science; Stochastic programming; Vendor; Operations research; Automotive industry; Adaptation (eye); Industrial organization; Industrial engineering; Business; Marketing; Mathematical optimization; Economics; Microeconomics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07795472769526672,"gpt":0.3339345970646677,"spread":0.2559798693694009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692595,0.00006513858,0.00006687731,0.00008751277,0.0004477149,0.0003653986,0.0001944833,0.00008249722,0.0001602143],"category_scores_gemma":[0.00006576152,0.00004211351,0.00001459558,0.0002787118,0.0001737548,0.001105565,0.00006464621,0.000200664,0.0003576065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005019077,"about_ca_system_score_gemma":0.00005444925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004978154,"about_ca_topic_score_gemma":0.00002339042,"domain_scores_codex":[0.9986386,0.00006634954,0.0003329193,0.00005622966,0.0006914157,0.0002144298],"domain_scores_gemma":[0.9995154,0.0001394929,0.00006483471,0.0001328928,0.00008012341,0.00006723565],"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.00006465237,0.00001805414,0.01190625,0.00002530641,0.00001156954,5.186924e-7,0.001075721,0.09703559,0.00005894123,0.8440051,0.03952647,0.006271828],"study_design_scores_gemma":[0.001014538,0.0007570595,0.1618848,0.00006859939,0.000005036943,0.00001825452,0.003242648,0.4511152,0.00007634687,0.002550349,0.3789681,0.0002990338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6382974,0.0001137804,0.001070087,0.003024856,0.0001594907,0.001986078,0.00003123748,0.00003177065,0.3552853],"genre_scores_gemma":[0.9952922,0.0000534438,0.00006710693,0.0001368107,0.00004463747,0.00003755842,0.00002122396,0.000001777953,0.004345237],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8414547,"threshold_uncertainty_score":0.4596428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401386467","doi":"10.1080/03155986.2024.2381306","title":"Optimization modeling and verification from problem specifications using a multi-agent multi-stage LLM framework","year":2024,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of British Columbia; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Task (project management); Modeling language; Solver; Representation (politics); Artificial intelligence; Optimization problem; Machine learning; Programming language; Systems engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2535615152377986,"gpt":0.3732107720741901,"spread":0.1196492568363914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001174422,0.0001656345,0.000172307,0.0007934952,0.0008041668,0.004553191,0.000136852,0.0001460798,0.00004905452],"category_scores_gemma":[0.0002381992,0.0001471874,0.00003687381,0.0008779712,0.00006462246,0.006394363,0.0001130352,0.0002838039,0.000106503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008380702,"about_ca_system_score_gemma":0.0001309567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003035655,"about_ca_topic_score_gemma":0.00002337891,"domain_scores_codex":[0.9981662,0.0000236545,0.0006630093,0.000268923,0.0006415523,0.0002366824],"domain_scores_gemma":[0.9982607,0.00008595095,0.0001117414,0.0001849726,0.001320805,0.00003586649],"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.00001260163,0.0000275051,0.0004395114,0.0004927806,0.00003752378,5.56313e-7,0.0007211714,0.9422927,0.00007882585,0.05348779,0.00005562,0.002353453],"study_design_scores_gemma":[0.0002267845,0.000003449396,0.0001380872,0.0003268497,0.00002231001,0.000001674628,0.001855102,0.9863672,0.00000362723,0.0001682838,0.01071471,0.0001719018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03266638,0.0009797479,0.9644551,0.0004957877,0.0001918992,0.0005459893,0.00005379963,0.0001202905,0.0004909803],"genre_scores_gemma":[0.96466,0.0002434628,0.03340749,0.0001484794,0.000486075,0.0001450413,0.0006893779,0.00002007167,0.0001999739],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9319937,"threshold_uncertainty_score":0.9964802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2250241007","doi":"10.3138/infor.52.3.138","title":"A Fuzzy Goal Programming Model for Venture Capital Investment Decision Making","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Venture capital; Cardinality (data modeling); Investment (military); Fuzzy logic; Selection (genetic algorithm); Computer science; Operations research; Process (computing); Capital (architecture); Decision-making; Economics; Business; Actuarial science; Finance; Operations management; Mathematics; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.03860612207624459,"gpt":0.329191563143555,"spread":0.2905854410673104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239622,0.0001121726,0.0001364381,0.0002226822,0.0003036695,0.0007388027,0.00009863577,0.0001007352,0.000004703875],"category_scores_gemma":[0.0003729459,0.00009563353,0.00003500467,0.0001563352,0.00004111875,0.001152695,0.00004398983,0.0001512614,0.00003493407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008431882,"about_ca_system_score_gemma":0.0000493161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003807208,"about_ca_topic_score_gemma":0.000003233931,"domain_scores_codex":[0.998595,0.00001966517,0.0004690509,0.00008528734,0.0005500877,0.0002809279],"domain_scores_gemma":[0.999069,0.0002308446,0.00003618075,0.0001148758,0.0004383737,0.0001106785],"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.00001892129,0.00001063778,0.00002036444,0.000461922,0.00001609051,7.832903e-8,0.002055124,0.540006,0.0000123123,0.4037707,0.001738896,0.05188886],"study_design_scores_gemma":[0.0003749177,0.00004789384,0.00001790297,0.0001129507,0.000002579703,0.000005249165,0.000512889,0.9468177,0.000007706807,0.002218346,0.04977264,0.0001092285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0107479,0.0001139395,0.9760801,0.00006321373,0.0001986728,0.001505681,0.00002522273,0.0001423749,0.01112293],"genre_scores_gemma":[0.947934,0.00001264637,0.05106881,0.0001194342,0.00009540393,0.0005512733,0.00009609501,0.00001401321,0.000108349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9371861,"threshold_uncertainty_score":0.7124292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4256181475","doi":"10.3138/infor.45.1.003","title":"Deploying Wildland Fire Suppression Resources with a Scenario‐Based Standard Response Model","year":2008,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Software deployment; Heuristic; Computer science; Operations research; Environmental science; Unit (ring theory); Simulation; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06958698537920914,"gpt":0.2979728731670277,"spread":0.2283858877878185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139797,0.0001474964,0.0001571448,0.0005218353,0.001275578,0.0008552472,0.0001744344,0.00007123146,0.0000692476],"category_scores_gemma":[0.0003217737,0.0001109775,0.00002775711,0.0004999678,0.000137471,0.004263109,0.0001172925,0.0001894387,0.0001695068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007866089,"about_ca_system_score_gemma":0.0002175988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001413291,"about_ca_topic_score_gemma":0.00009808099,"domain_scores_codex":[0.99761,0.00004686479,0.0004875056,0.0001645235,0.001394265,0.0002968057],"domain_scores_gemma":[0.998437,0.0000728396,0.00006468627,0.0002236759,0.001159721,0.00004201623],"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.00295842,0.00003687746,0.008537017,0.0005431373,0.00002696733,0.000005006683,0.001587782,0.9450057,0.00004707313,0.009319545,0.03068492,0.001247616],"study_design_scores_gemma":[0.0008315643,0.0000396575,0.0038097,0.00009497131,0.000003434516,0.000005271767,0.0008757626,0.7627826,0.000007777418,0.00001039256,0.2313998,0.0001390708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9836338,0.00006843801,0.006775999,0.00195307,0.0001065229,0.0009217473,0.00003012012,0.0001048715,0.006405476],"genre_scores_gemma":[0.9974499,0.00002023573,0.0002954072,0.0008141359,0.0001107009,0.0001584021,0.00013501,0.00001005367,0.001006174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2007149,"threshold_uncertainty_score":0.9810847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3025788976","doi":"10.1080/03155986.2020.1730675","title":"Generalization bounds for regularized portfolio selection with market side information","year":2020,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Volatility (finance); Portfolio optimization; Exploit; Portfolio; Investment strategy; Econometrics; Computer science; Financial market; Mathematical optimization; Mathematics; Economics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.1067991051117002,"gpt":0.3865618332264635,"spread":0.2797627281147633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005216784,0.0001899525,0.0002905058,0.0008256834,0.0009427105,0.003686064,0.0002947105,0.000179226,0.0001449293],"category_scores_gemma":[0.002839975,0.0001395755,0.00005804829,0.001752982,0.0001069425,0.01132306,0.0000739148,0.0002031769,0.0001507948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009756821,"about_ca_system_score_gemma":0.0006128662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001543108,"about_ca_topic_score_gemma":0.0000159687,"domain_scores_codex":[0.9949875,0.0002183716,0.001456737,0.00023076,0.002747715,0.0003589481],"domain_scores_gemma":[0.9929867,0.000500428,0.0004534734,0.0002193652,0.005562597,0.0002774296],"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.00258983,0.00003680361,0.01274817,0.0002100284,0.0001161698,0.000001008274,0.007918329,0.2626193,0.0001988626,0.2558047,0.3988123,0.05894456],"study_design_scores_gemma":[0.0009618272,0.0002373372,0.002226367,0.0000143663,0.000005385271,0.00001885784,0.001218811,0.4875802,0.00008393847,0.0002720776,0.5072364,0.0001444059],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02679328,0.00007949911,0.9147205,0.004453936,0.0003796157,0.00392117,0.0002848816,0.0001463068,0.04922083],"genre_scores_gemma":[0.982492,0.0002308498,0.009136188,0.002122123,0.0005714623,0.0007433383,0.001719677,0.00002151015,0.002962825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9556987,"threshold_uncertainty_score":0.9973482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139177468","doi":"10.3138/infor.49.1.015","title":"A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations","year":2011,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"Université Laval","funders":"Mitacs","keywords":"Guided Local Search; Incremental heuristic search; Search and rescue; Beam search; Best-first search; Computer science; Mathematical optimization; Search algorithm; Search theory; Constraint (computer-aided design); Iterative deepening depth-first search; Constraint programming; Object (grammar); Operations research; Algorithm; Artificial intelligence; Mathematics; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.1259053238034037,"gpt":0.3202113026547849,"spread":0.1943059788513812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382472,0.00009661849,0.0001295731,0.0005578343,0.0006443799,0.000404897,0.0002718678,0.00007499787,0.00002871012],"category_scores_gemma":[0.0004212767,0.00007729541,0.00001787352,0.0008456547,0.0002140391,0.002220713,0.0001678966,0.000228092,0.000001407019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007584709,"about_ca_system_score_gemma":0.0005040017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321887,"about_ca_topic_score_gemma":0.0001524024,"domain_scores_codex":[0.9981618,0.0002206513,0.0005861103,0.0001661292,0.0006427965,0.0002225226],"domain_scores_gemma":[0.9977396,0.0003781682,0.0000318235,0.0002277526,0.00154569,0.0000770098],"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.00002879372,0.00001815168,0.0008470836,0.00005707622,0.00001037421,7.092096e-8,0.006594594,0.7686546,0.00002476885,0.2183959,0.00001696442,0.005351659],"study_design_scores_gemma":[0.0006907136,0.00008961575,0.004527614,0.00001582375,0.000001729822,0.00001844391,0.007016134,0.9872027,0.0001004183,0.000008022142,0.0002451193,0.00008366406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01122234,0.00007848895,0.9848891,0.0002772272,0.00006977264,0.001859596,0.00005082363,0.00002045158,0.001532206],"genre_scores_gemma":[0.9416542,0.0001313496,0.05748341,0.00005671267,0.00001677487,0.000448039,0.0001471649,0.000004647365,0.00005770425],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9304318,"threshold_uncertainty_score":0.4956114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397645628","doi":"10.1080/03155986.2001.11732429","title":"A Due-Window Determination In Minmax Scheduling Problems","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Tardiness; Mathematical optimization; Minimax; Scheduling (production processes); Computer science; Upper and lower bounds; Interval (graph theory); Due date; Schedule; Single-machine scheduling; Heuristic; Mathematics; Job shop scheduling; Algorithm; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04165794731630743,"gpt":0.3063424480025656,"spread":0.2646845006862582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342398,0.0001101911,0.0001333695,0.0006688593,0.0001874318,0.0005726563,0.0001043774,0.0001209896,0.00003258899],"category_scores_gemma":[0.000201716,0.0001057185,0.00001852935,0.0005991993,0.00003897803,0.002076399,0.00002854288,0.0002664353,0.0001261148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250422,"about_ca_system_score_gemma":0.0000786088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009927247,"about_ca_topic_score_gemma":0.00002568296,"domain_scores_codex":[0.9984439,0.00004468164,0.0005503296,0.00008970685,0.0005937094,0.000277683],"domain_scores_gemma":[0.9991508,0.0001247512,0.00003423216,0.0001113745,0.0004845232,0.00009427773],"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.00001252794,0.00001053623,0.002660146,0.0001597917,0.000008646133,0.000002950051,0.002138478,0.9731268,0.00006053158,0.004784142,0.0001067393,0.01692867],"study_design_scores_gemma":[0.0005508023,0.00002553887,0.002436279,0.0001002596,9.157467e-7,0.00005090776,0.001160442,0.9820594,0.00005302904,0.00002872255,0.01340352,0.0001302079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7969826,0.001111538,0.1466463,0.000499103,0.0009526366,0.002224206,0.00004067643,0.0003845144,0.05115848],"genre_scores_gemma":[0.9934549,0.0002067939,0.005524201,0.00004971919,0.0001130367,0.0002336664,0.0001187388,0.00001151446,0.0002874453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1964723,"threshold_uncertainty_score":0.5522138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2915524785","doi":"10.1080/03155986.2018.1554420","title":"Integrating revenue management and sales and operations planning in a Make-To-Stock environment: softwood lumber case study","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":true},"ca_institutions":"Université TÉLUQ; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Revenue; Time horizon; Revenue management; Stock (firearms); Order (exchange); Context (archaeology); Sales management; Operations research; Demand forecasting; Sales and operations planning; Business; Marketing; Industrial organization; Computer science; Engineering; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.0525702225763954,"gpt":0.3141237569894008,"spread":0.2615535344130054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001728122,0.0001439743,0.000166503,0.0007581507,0.0004227571,0.001530889,0.00009396399,0.00004622243,0.00003788112],"category_scores_gemma":[0.00007836895,0.0001302954,0.00001291868,0.0003041247,0.00004091283,0.002419223,0.000396906,0.0001812578,0.0001762271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006563288,"about_ca_system_score_gemma":0.00001544749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002157505,"about_ca_topic_score_gemma":0.0003590606,"domain_scores_codex":[0.9984673,0.0000407206,0.0005028708,0.0002088891,0.0005295631,0.0002507116],"domain_scores_gemma":[0.9995428,0.00007599596,0.00005665142,0.0001611356,0.0001260507,0.0000373089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001630528,0.0002651801,0.676385,0.002543442,0.0001909599,0.0002943562,0.02600208,0.04630166,0.00004519837,0.2106758,0.004820138,0.03231315],"study_design_scores_gemma":[0.004090913,0.0002342302,0.08109093,0.0005990055,0.00002859546,0.0001729307,0.2039455,0.3705698,0.000001833139,0.0001344873,0.3384504,0.0006813035],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9883125,0.0001029776,0.0004313167,0.0002489141,0.0001110892,0.002608828,0.00001132861,0.00001901232,0.00815405],"genre_scores_gemma":[0.997485,0.00001395989,0.0002301361,0.0004488587,0.0001080106,0.000412812,0.0000571424,0.000009619535,0.001234499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5952941,"threshold_uncertainty_score":0.9995056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057619336","doi":"10.3138/infor.50.1.001","title":"Déploiement et Redéploiement des Véhicules Ambulanciers dans la Gestion d'un Service Préhospitalier d'Urgence","year":2012,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Humanities; Political science; Physics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.06635167146025572,"gpt":0.3161531792752222,"spread":0.2498015078149665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.008120386,0.0003102442,0.0002419956,0.0005658034,0.001270402,0.002133643,0.0002986457,0.0002144581,0.0006614949],"category_scores_gemma":[0.0005162121,0.0002977914,0.00006680375,0.001026205,0.0002817683,0.0148856,0.000423859,0.0003925949,0.002316324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003856506,"about_ca_system_score_gemma":0.000152877,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01040567,"about_ca_topic_score_gemma":0.000601106,"domain_scores_codex":[0.9959039,0.0002222863,0.001079434,0.0002377344,0.001744755,0.0008118877],"domain_scores_gemma":[0.9968514,0.0001094213,0.0001436336,0.0003195052,0.002426641,0.0001493673],"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.00006243302,0.0002905498,0.01560157,0.004365959,0.0001650543,0.000001453404,0.01324919,0.02432584,0.00005034655,0.8994002,0.02939237,0.01309499],"study_design_scores_gemma":[0.0005297143,0.00003489777,0.06129613,0.0004386064,0.00003369921,0.00001173307,0.01507017,0.05767871,0.00002545289,0.0001425621,0.8643816,0.0003567201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6983999,0.01495941,0.02773025,0.05279145,0.007647966,0.007219007,0.0003430662,0.0003460093,0.1905629],"genre_scores_gemma":[0.9897043,0.001245495,0.0005596871,0.001994557,0.0005895192,0.0005493278,0.0007615091,0.0000216952,0.00457388],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8992577,"threshold_uncertainty_score":0.9999474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107073001","doi":"10.3138/infor.48.4.239","title":"Analysis of Quantized Double Auctions with Application to Competitive Electricity Markets","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Common value auction; Maximization; Electricity; Computer science; Microeconomics; Double auction; Economics; Competition (biology); Electricity market; Mathematical optimization; Mathematics; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0144049939271217,"gpt":0.2929452550271692,"spread":0.2785402611000475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142806,0.00009893514,0.0002146434,0.001272934,0.0001847645,0.0002153346,0.0001189316,0.00008773814,0.00002685641],"category_scores_gemma":[0.00007300177,0.00008570409,0.00002779522,0.002442674,0.00004006531,0.0009713807,0.0000207199,0.0002259648,0.00003735327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007559762,"about_ca_system_score_gemma":0.0001093536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002869464,"about_ca_topic_score_gemma":0.0002073969,"domain_scores_codex":[0.9984992,0.0000355991,0.000498293,0.00009710107,0.0006673268,0.0002024529],"domain_scores_gemma":[0.998107,0.0001566776,0.00006747301,0.000197461,0.001364258,0.0001071378],"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.0002895595,0.00003390425,0.007772343,0.0002395991,0.0006990116,2.67942e-7,0.001998371,0.7093118,0.004615233,0.2713053,0.001063855,0.002670742],"study_design_scores_gemma":[0.0006293488,0.00007783898,0.01828934,0.0000220184,0.00004263154,0.00001017609,0.000379377,0.9565009,0.001459127,0.000004110856,0.0224251,0.0001599812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4526717,0.00005268571,0.497152,0.0001434303,0.0002265956,0.002451605,0.0001272001,0.000164251,0.04701056],"genre_scores_gemma":[0.9983959,0.00001423232,0.0008636186,0.00001389567,0.00003076074,0.0003354292,0.0002333783,0.000007407113,0.0001054025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5457242,"threshold_uncertainty_score":0.3494911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400260427","doi":"10.1080/03155986.2001.11732447","title":"An Effective Lagrangian Heuristic For The Generalized Assignment Problem","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Subgradient method; Lagrangian relaxation; Heuristics; Mathematical optimization; Lagrangian; Heuristic; Generalized assignment problem; Weapon target assignment problem; Relaxation (psychology); Augmented Lagrangian method; Assignment problem; Computer science; Mathematics; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04332303666399995,"gpt":0.3577360311696445,"spread":0.3144129945056446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959976,0.000100912,0.0001135996,0.0001700302,0.0005295152,0.0006877745,0.0001413777,0.00007450581,0.00001907356],"category_scores_gemma":[0.0001905111,0.00007161297,0.00002534127,0.0002682474,0.00004732624,0.001113615,0.00002066976,0.0001521051,0.00002701054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001081684,"about_ca_system_score_gemma":0.00004675282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008172889,"about_ca_topic_score_gemma":0.000006739564,"domain_scores_codex":[0.9986527,0.0001371995,0.0003839696,0.0000786886,0.0004997767,0.0002476986],"domain_scores_gemma":[0.9984751,0.0006305297,0.000035325,0.0001605057,0.0006064189,0.00009210491],"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.00003500349,0.000006749707,0.0002803341,0.0001221899,0.00003613707,2.005788e-7,0.001449518,0.943299,0.0001481189,0.02979419,0.001638672,0.02318989],"study_design_scores_gemma":[0.000533835,0.00007324271,0.001351404,0.00002174979,0.000004195881,0.00001271456,0.0006103393,0.8993614,0.00008378413,0.00005263007,0.09780144,0.00009324472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01891692,0.0002770824,0.9702547,0.000304086,0.0002855915,0.003463876,0.00006597009,0.0001528228,0.006279005],"genre_scores_gemma":[0.9876984,0.0001153047,0.009743806,0.00009546155,0.0002167954,0.001676962,0.0001540267,0.00001653676,0.0002826527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9687815,"threshold_uncertainty_score":0.6632225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397677619","doi":"10.1080/03155986.2002.11732653","title":"Quantification De L’importance Relative Des Membres D’un Groupe En Vue De Déterminer Un Préordre Collectif","year":2002,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Humanities; Context (archaeology); Preference; Sociology; Welfare economics; Philosophy; Economics; Geography; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.06912181684024822,"gpt":0.3098678725798961,"spread":0.2407460557396479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.003869651,0.0002525866,0.0002458584,0.0007322346,0.001678612,0.002825537,0.0002444136,0.000368957,0.0009691545],"category_scores_gemma":[0.001210982,0.0002474161,0.000050557,0.001847872,0.0003300392,0.01672901,0.0001106425,0.0005334967,0.0005998273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003474838,"about_ca_system_score_gemma":0.0002287169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001655689,"about_ca_topic_score_gemma":0.00008897934,"domain_scores_codex":[0.9971287,0.0001544429,0.001042624,0.0002279772,0.0008379015,0.0006084048],"domain_scores_gemma":[0.9957693,0.0003068911,0.0003692951,0.0002268065,0.00326842,0.00005933],"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.0001103552,0.0001307713,0.03407094,0.002212851,0.0001125509,0.000008493756,0.005596358,0.004211863,0.0003287008,0.8968237,0.03714446,0.01924897],"study_design_scores_gemma":[0.001249297,0.00007067934,0.0716778,0.0006197784,0.00003673796,0.0001113404,0.004593995,0.3669466,0.0002024084,0.003306683,0.5506887,0.0004959783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7389209,0.01162681,0.02454982,0.02426148,0.001781992,0.003792601,0.0001694036,0.0002195288,0.1946774],"genre_scores_gemma":[0.9850588,0.001032772,0.0008170841,0.0006448571,0.0008659257,0.0002961048,0.0003959605,0.00002215013,0.01086631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.893517,"threshold_uncertainty_score":0.9999978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105277320","doi":"10.3138/infor.45.1.41","title":"Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière","year":2007,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Minimisation (clinical trials); Humanities; Computer science; Philosophy; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04160118805698877,"gpt":0.3296998969432384,"spread":0.2880987088862496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01132943,0.0002752429,0.0002894724,0.0006623829,0.0006620969,0.0006259358,0.0002308708,0.000588118,0.0001708007],"category_scores_gemma":[0.0007517625,0.0003015949,0.00006481877,0.000898538,0.0001898962,0.002979365,0.00005580663,0.0007846311,0.0001910928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006987351,"about_ca_system_score_gemma":0.0006233536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001435571,"about_ca_topic_score_gemma":0.00003756308,"domain_scores_codex":[0.996051,0.0002024568,0.001392572,0.0001943163,0.001317062,0.0008425853],"domain_scores_gemma":[0.9968651,0.0008488741,0.0001440898,0.0002426437,0.001470607,0.000428714],"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.00008821896,0.00004019235,0.00973093,0.0008727733,0.0001120918,0.00001180665,0.009368483,0.6751853,0.0001095641,0.1697688,0.005465067,0.1292468],"study_design_scores_gemma":[0.0009291168,0.00008362266,0.02058035,0.0002118902,0.00001585003,0.0001508362,0.002713588,0.6334737,0.0006786522,0.0001154511,0.3407384,0.0003085814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05110631,0.0008937364,0.9212283,0.002940104,0.0009907085,0.001455579,0.0001966063,0.0001556057,0.02103306],"genre_scores_gemma":[0.905413,0.0005885034,0.08768668,0.0002798064,0.001588234,0.0001570026,0.0007304872,0.00006039846,0.003495893],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8543067,"threshold_uncertainty_score":0.9999436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}