{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":82,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":82,"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":"5fc4432d917b","filters":{"venue":"Operations Research Letters"}},"results":[{"id":"W2054151210","doi":"10.1016/j.orl.2004.11.011","title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematical optimization; Node (physics); Computer science; Algorithm; Longest path problem; K shortest path routing; Repetition (rhetorical device); Widest path problem; Mathematics; Theoretical computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.07945066765209823,"gpt":0.3697209552786762,"spread":0.2902702876265779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002568466,0.0001551458,0.0001249369,0.0001637095,0.0009643737,0.0003870409,0.0003556622,0.00005984633,0.0001332974],"category_scores_gemma":[0.0002387133,0.0001299765,0.00004083927,0.0006025989,0.0001386273,0.0002716691,0.00006390936,0.0004876012,0.00002482805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001945345,"about_ca_system_score_gemma":0.00006819993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003396267,"about_ca_topic_score_gemma":0.00004965158,"domain_scores_codex":[0.9981119,0.0002716625,0.0003547967,0.0002609044,0.000402219,0.0005985369],"domain_scores_gemma":[0.9985985,0.0007253788,0.00001316449,0.0003359428,0.0002311146,0.00009595731],"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.000004202593,0.00001959752,0.00005605896,0.00001163786,0.0000528439,0.000001545715,0.0004025568,0.8992649,0.03456663,0.0001518857,0.02230992,0.04315817],"study_design_scores_gemma":[0.0005328845,0.00002602433,0.00006110589,0.00002211197,0.00001026899,0.000005410705,0.0003108942,0.9639624,0.003784344,0.000003211942,0.03113097,0.0001504048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05594113,0.0002675346,0.8747395,0.06303556,0.0001262315,0.003300341,0.0001781147,0.0006403624,0.001771268],"genre_scores_gemma":[0.1824186,0.00004527558,0.813144,0.002030786,0.0006528466,0.0009088045,0.0002406398,0.0001026854,0.0004563871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1264774,"threshold_uncertainty_score":0.741728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018660239","doi":"10.1016/j.orl.2008.09.006","title":"Certification of an optimal TSP tour through 85,900 cities","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":171,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Travelling salesman problem; Certification; Code (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Operations research; Bottleneck traveling salesman problem; Mathematics; Programming language; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1210279980760836,"gpt":0.374011808626763,"spread":0.2529838105506794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006290692,0.0001042061,0.0001332882,0.0002152678,0.0003861142,0.00007234568,0.0002529063,0.00006395906,0.0002572661],"category_scores_gemma":[0.0001961404,0.0001115342,0.00003635674,0.0005657591,0.000276155,0.0006163678,0.00003425129,0.0002888387,0.00004107712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009976253,"about_ca_system_score_gemma":0.00005871126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001117361,"about_ca_topic_score_gemma":0.00001373021,"domain_scores_codex":[0.9984382,0.0003142454,0.0002916674,0.0001949775,0.0004502444,0.00031063],"domain_scores_gemma":[0.9991372,0.00009971079,0.00001169903,0.0004202596,0.0002611264,0.00007002623],"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.000005313615,0.00002294969,0.00005647936,0.00001516695,0.00001400107,0.00000393555,0.002044487,0.8788697,0.1136928,0.000161934,0.00453419,0.0005790983],"study_design_scores_gemma":[0.000213586,0.00004561317,0.001047087,0.00001546208,0.000003721745,0.00001621407,0.0004497526,0.877345,0.11915,0.000008702331,0.001549876,0.0001549596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8182901,0.00005175012,0.1774899,0.001463656,0.00008579887,0.0002382211,0.00001405084,0.0001548268,0.002211744],"genre_scores_gemma":[0.7716902,0.00007246708,0.2276123,0.00008996329,0.0001104124,0.00006297376,0.00005461152,0.00003572444,0.000271301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05012248,"threshold_uncertainty_score":0.4548233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969471641","doi":"10.1016/j.orl.2006.11.004","title":"Interior point stabilization for column generation","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Column generation; Degeneracy (biology); Convergence (economics); Interior point method; Acceleration; Point (geometry); Mathematical optimization; Column (typography); Vehicle routing problem; Computer science; Dual (grammatical number); Space (punctuation); Extreme point; Mathematics; Routing (electronic design automation); Algorithm; Control theory (sociology); Combinatorics; Physics; Geometry; Artificial intelligence; Telecommunications; Classical mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.06313064214832748,"gpt":0.3542777629418464,"spread":0.291147120793519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074078,0.00009833364,0.00009917281,0.0002475362,0.0003813622,0.0003207637,0.0001266304,0.00005769218,0.0001049209],"category_scores_gemma":[0.0002409028,0.0001104032,0.00003892825,0.0004380534,0.00006058947,0.0003257292,0.00002328589,0.0001526352,0.00002891915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002526137,"about_ca_system_score_gemma":0.00003548001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008696848,"about_ca_topic_score_gemma":0.000377808,"domain_scores_codex":[0.998741,0.0001932074,0.0002795839,0.0002040401,0.0002638508,0.0003182642],"domain_scores_gemma":[0.9992762,0.0001124933,0.00000817448,0.0002336609,0.0003216333,0.00004784268],"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.000001873149,0.000007935354,0.00005009962,0.00001311125,0.000004811588,3.186447e-7,0.0000765884,0.6526779,0.328705,0.0008517936,0.01693939,0.000671241],"study_design_scores_gemma":[0.0002651889,0.00002442788,0.000147576,0.000008796923,0.000003423351,0.00000153354,0.00003998955,0.9556984,0.03907451,0.00002552918,0.004591843,0.0001188235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2504876,0.00002933976,0.7460912,0.001939255,0.0001869173,0.0006539669,0.00002042088,0.0001735461,0.0004177123],"genre_scores_gemma":[0.7853243,0.00001304975,0.2123996,0.0001953456,0.000593296,0.000571277,0.000386643,0.00006547832,0.0004510206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5348366,"threshold_uncertainty_score":0.450211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090915089","doi":"10.1016/j.orl.2013.07.007","title":"Routing vehicles to minimize fuel consumption","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Routing (electronic design automation); Generalization; Heuristic; Fuel efficiency; Mathematical optimization; Computer science; Mathematics; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.06715273491549184,"gpt":0.352071978879783,"spread":0.2849192439642912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009555464,0.0001229842,0.0001226353,0.0003391022,0.0003148791,0.0004551257,0.0002352113,0.00006197402,0.0005714925],"category_scores_gemma":[0.0004613044,0.0001298813,0.00003321689,0.0005506955,0.00007024899,0.0003894687,0.00007488134,0.0003496872,0.002356117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000168793,"about_ca_system_score_gemma":0.0000231889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001424472,"about_ca_topic_score_gemma":0.00002055807,"domain_scores_codex":[0.998293,0.0003024748,0.0002654884,0.0002349813,0.0004001202,0.0005039375],"domain_scores_gemma":[0.9989981,0.0002403585,0.00000600058,0.0003298793,0.0002315909,0.0001940873],"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.000001412078,0.000009878772,0.001098069,0.00002117237,0.0000145147,0.000001627296,0.0005877264,0.7821255,0.2006196,0.0002187824,0.01126419,0.00403755],"study_design_scores_gemma":[0.0002743285,0.00001493965,0.01250537,0.00004114949,0.000003646081,0.000004319889,0.000201258,0.9777254,0.007406302,0.00001521594,0.001568547,0.0002394896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7570183,0.00004477627,0.2331496,0.007304347,0.00016408,0.0006805596,0.000005954839,0.0003464286,0.001285947],"genre_scores_gemma":[0.7772074,0.00002820003,0.2211788,0.0007214608,0.0001407738,0.0003131208,0.00001640673,0.00004775784,0.0003460673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1956,"threshold_uncertainty_score":0.9984207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089509243","doi":"10.1016/j.orl.2007.03.005","title":"New formulations and valid inequalities for a bilevel pricing problem","year":2007,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fédération Wallonie-Bruxelles","keywords":"Bilevel optimization; Toll; Commodity; Mathematical optimization; Computer science; Revenue; Inequality; Mathematical economics; Flow network; Operations research; Revenue management; Mathematics; Optimization problem; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.135590153453481,"gpt":0.4340305973277018,"spread":0.2984404438742209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002206722,0.00005061088,0.00006068186,0.0002549556,0.00157524,0.0002403199,0.00007944608,0.00004486449,0.00003757251],"category_scores_gemma":[0.0002698989,0.00005057026,0.00001979164,0.0004198059,0.00008200551,0.0004016605,0.000006869038,0.0001011473,0.00000346464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000665898,"about_ca_system_score_gemma":0.0002280708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00389014,"about_ca_topic_score_gemma":0.009012789,"domain_scores_codex":[0.9989197,0.00008807537,0.0001841886,0.0001470176,0.0003442883,0.0003167329],"domain_scores_gemma":[0.9991706,0.0004205922,0.00001350557,0.00007176628,0.0001999823,0.0001235797],"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.00006047652,0.00005820463,0.01039858,0.00006125384,0.00004098989,0.000003319136,0.161412,0.1016619,0.009245742,0.6733068,0.01812147,0.02562921],"study_design_scores_gemma":[0.007168327,0.0006821126,0.09479328,0.0005697243,0.0001186441,0.00000743782,0.09589564,0.06579141,0.00596223,0.02099793,0.7058278,0.00218542],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1405228,0.00003294153,0.8419759,0.0138743,0.00005731267,0.0008016806,0.00001413696,0.0000649325,0.002656008],"genre_scores_gemma":[0.7881468,0.00002743522,0.2071037,0.000417122,0.0002570838,0.000070783,0.00008593831,0.000012584,0.003878576],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6877064,"threshold_uncertainty_score":0.9997246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983553101","doi":"10.1016/j.orl.2005.06.002","title":"The k-level facility location game","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Facility location problem; Monotonic function; Scheme (mathematics); Computer science; Game theory; 1-center problem; Mathematical optimization; Mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1621553426125074,"gpt":0.3297216512856123,"spread":0.1675663086731049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003980243,0.00006611567,0.00009948786,0.0001218305,0.0007752896,0.0003413753,0.0003033004,0.00003783305,0.0001811694],"category_scores_gemma":[0.0006387286,0.00005713094,0.00003763286,0.0003398686,0.0001847713,0.0002551961,0.00004407037,0.0002611227,0.005453194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001542324,"about_ca_system_score_gemma":0.00002608431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003241482,"about_ca_topic_score_gemma":0.0003624601,"domain_scores_codex":[0.9988586,0.0001565666,0.0003433336,0.0002372294,0.00008079036,0.0003235147],"domain_scores_gemma":[0.9992139,0.0001739936,0.00002641554,0.0004269963,0.0001017853,0.00005689914],"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.00002274023,0.0001068041,0.003793443,0.00002219069,0.00005285641,0.000001282048,0.002639854,0.04978147,0.00236766,0.9053516,0.02641659,0.009443538],"study_design_scores_gemma":[0.0005053623,0.00005277164,0.01564816,0.0000187147,0.000001620928,0.000006113476,0.0004906657,0.05818542,0.000855396,0.003021027,0.920913,0.000301712],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8912769,0.00075902,0.02471985,0.07214715,0.0002842203,0.0005743509,0.0001292555,0.00005009192,0.01005917],"genre_scores_gemma":[0.9925522,0.00003073107,0.0002082286,0.0004361105,0.0002045824,0.00009178016,0.00001614257,0.000006785211,0.006453431],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9023305,"threshold_uncertainty_score":0.9953212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086959235","doi":"10.1016/j.orl.2012.01.011","title":"Model of transfer tax on transboundary water pollution in China’s river basin","year":2012,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Local Government Finance and Decentralization","field":"Social Sciences","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Stackelberg competition; Pollution; Tax rate; Pollutant; China; Environmental science; Drainage basin; Structural basin; Water pollution; Water transfer; Environmental tax; Reduction (mathematics); Water resource management; Economics; Tax reform; Geography; Geology; Microeconomics; Mathematics; Public economics; Chemistry; Ecology","retraction":null,"screen_n_in":null,"score":{"opus":0.06665134195146924,"gpt":0.3497308808681951,"spread":0.2830795389167259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266224,0.00006073086,0.00008519852,0.0001521715,0.0004139059,0.00005020545,0.0001274425,0.00006131035,0.0002031339],"category_scores_gemma":[0.0000466145,0.00004868841,0.00003775125,0.000293233,0.0003448251,0.0006565531,0.000008923701,0.0001731208,0.00003653245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002670613,"about_ca_system_score_gemma":0.00009762016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005505091,"about_ca_topic_score_gemma":0.002517442,"domain_scores_codex":[0.9980987,0.0003657411,0.0001622403,0.0001261709,0.0007716811,0.0004755195],"domain_scores_gemma":[0.9997423,0.00001784463,0.000003657357,0.000113085,0.00004713298,0.00007600936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002200199,0.0009257983,0.01042713,0.00003554551,0.00002391364,0.000003579796,0.2237839,0.3068974,0.2007228,0.2433011,0.01002315,0.003635624],"study_design_scores_gemma":[0.008322194,0.0007375025,0.2449735,0.0005122693,0.00006411314,0.000001891494,0.01146529,0.1776879,0.3441851,0.003199686,0.2066782,0.002172276],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9596297,0.00001425196,0.009638822,0.02631894,0.00006703621,0.0003363258,0.00002897351,0.000009036943,0.003956947],"genre_scores_gemma":[0.998189,0.00009980321,0.0001877863,0.0008044731,0.00007621812,0.00003125329,0.00002080248,0.000007064455,0.0005835986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2401015,"threshold_uncertainty_score":0.8322086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990311848","doi":"10.1016/j.orl.2008.09.004","title":"Evaluating a warm standby system with components having proportional hazard rates","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Component (thermodynamics); Statistics; Proportional hazards model; Hazard ratio; Hazard; Computer science; Reliability engineering; Mathematics; Control theory (sociology); Engineering; Physics; Artificial intelligence; Biology; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.1038903510729244,"gpt":0.3509936052648227,"spread":0.2471032541918983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007983124,0.000111662,0.0001254946,0.0001588953,0.0007765029,0.0001201829,0.000128539,0.00003833717,0.00004013316],"category_scores_gemma":[0.0001052426,0.00009242679,0.00002634113,0.0003674211,0.0001824187,0.0003706643,0.00002726033,0.0002940689,0.00004978631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003836619,"about_ca_system_score_gemma":0.00009803803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009955006,"about_ca_topic_score_gemma":0.00006224801,"domain_scores_codex":[0.9983221,0.0001478705,0.0002376413,0.0002186147,0.0007175168,0.0003562988],"domain_scores_gemma":[0.999231,0.00006128287,0.00001055596,0.0002281931,0.0003861194,0.00008277981],"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.00001694581,0.00002042582,0.0009591958,0.00006703673,0.00002221384,0.00002022138,0.0003772593,0.9477332,0.04915335,0.0002777306,0.00123325,0.0001191482],"study_design_scores_gemma":[0.0003883187,0.00006493382,0.001752438,0.0001389093,0.000004006794,0.00004830636,0.0002457018,0.9942729,0.002738543,0.000001766033,0.0002105973,0.0001335776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9185339,0.00004084357,0.07894967,0.001006667,0.00007599298,0.0006101073,0.00001019016,0.0001727377,0.0005999511],"genre_scores_gemma":[0.9823138,0.00003163272,0.01704375,0.00004233354,0.00007232487,0.0002405743,0.00008218912,0.00002813628,0.0001453088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06377991,"threshold_uncertainty_score":0.5972311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967726020","doi":"10.1016/j.orl.2008.02.001","title":"A new formulation for the conditional -median and -center problems","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Center (category theory); Computer science; Mathematical optimization; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1198496466162401,"gpt":0.3206096362429959,"spread":0.2007599896267557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004580965,0.00006608055,0.0000505856,0.0001812365,0.001130272,0.0002312616,0.0001319828,0.00002537327,0.0003681713],"category_scores_gemma":[0.0001275588,0.00004948227,0.00002938411,0.0002736794,0.00006701601,0.0007747495,0.000067774,0.000124828,0.0001793824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002680285,"about_ca_system_score_gemma":0.0000283459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001533918,"about_ca_topic_score_gemma":0.001958321,"domain_scores_codex":[0.9991452,0.00001194769,0.0001445489,0.0001683737,0.0003201372,0.0002097563],"domain_scores_gemma":[0.999585,0.00004457958,0.000007836913,0.0001483723,0.0001975963,0.00001658754],"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.00003364003,0.00009528343,0.004210041,0.000122147,0.0000639555,0.000001668399,0.0005810604,0.04990447,0.001769456,0.1407102,0.7963815,0.006126633],"study_design_scores_gemma":[0.0008537609,0.00001094331,0.0191368,0.00001062339,0.00000894665,0.000001858755,0.0001694381,0.3460893,0.00001560362,0.0007093211,0.6328682,0.0001252338],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.2409719,0.0001057622,0.2485157,0.5030444,0.0004915496,0.003778073,0.00002634817,0.0001085136,0.002957805],"genre_scores_gemma":[0.9895598,0.00004221928,0.0008327603,0.006263371,0.0006994068,0.0003441608,0.000287156,0.00001045904,0.001960668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7485879,"threshold_uncertainty_score":0.8693251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204221696","doi":"10.1016/j.orl.2022.01.018","title":"Guidelines for the computational testing of machine learning approaches to vehicle routing problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Vehicle routing problem; Computer science; Routing (electronic design automation); Work (physics); Machine learning; Management science; Operations research; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3807223978616506,"gpt":0.3906359972719764,"spread":0.009913599410325769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003990556,0.00008800356,0.0001100209,0.000195692,0.00140151,0.0001041064,0.0002987767,0.00001606021,0.00003369728],"category_scores_gemma":[0.002460388,0.00007897461,0.00003736222,0.001007324,0.00004796357,0.00008754252,0.0001765456,0.0004175165,0.000002834329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001151173,"about_ca_system_score_gemma":0.00005227229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001277044,"about_ca_topic_score_gemma":0.00001515183,"domain_scores_codex":[0.9983147,0.0003582098,0.0003557861,0.0001798061,0.0004955992,0.0002958495],"domain_scores_gemma":[0.9980093,0.001379225,0.00001941779,0.000165439,0.0003794681,0.00004717313],"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.000003365441,0.00001079106,0.0006260025,0.00002288644,0.00002257576,2.295959e-7,0.0007935879,0.9815492,0.01018926,0.0004585811,0.0009454181,0.005378068],"study_design_scores_gemma":[0.0001752422,0.00004565846,0.0001515444,0.00001224393,0.000004432179,0.000002946718,0.0004449775,0.9963211,0.0004480361,0.00001841297,0.002291061,0.00008435851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07793654,0.0001239726,0.9038987,0.01661618,0.00008239972,0.001010269,0.00003680761,0.0001371703,0.0001579189],"genre_scores_gemma":[0.6022679,0.000001554449,0.3966491,0.000250766,0.00008175218,0.0005593747,0.00004219586,0.0000370029,0.000110426],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5243313,"threshold_uncertainty_score":0.9998986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041485345","doi":"10.1016/j.orl.2005.01.009","title":"The multiple TSP with time windows: vehicle bounds based on precedence graphs","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Combinatorics; Traveling purchaser problem; Mathematics; Computer science; Similarity (geometry); Mathematical optimization; 2-opt; Routing (electronic design automation); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0257977929190062,"gpt":0.3082450610410842,"spread":0.282447268122078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376694,0.0001351634,0.00009574334,0.0001938646,0.001060214,0.0004744964,0.0003534633,0.00004877028,0.00009443751],"category_scores_gemma":[0.0003743923,0.00009933302,0.00003411314,0.0007578642,0.0002117965,0.0002613062,0.00002847819,0.0004976403,0.000268527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001791684,"about_ca_system_score_gemma":0.00006583147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003118791,"about_ca_topic_score_gemma":0.0001672544,"domain_scores_codex":[0.9980717,0.0003977861,0.0001867644,0.0002299929,0.0006229552,0.0004908284],"domain_scores_gemma":[0.9983967,0.0007968874,0.000008530838,0.0005230504,0.0001653008,0.0001095629],"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.00001952618,0.00002178082,0.0003249563,0.000004384004,0.0000139589,0.000001745787,0.0001580583,0.9656298,0.02668233,0.00008644521,0.004226022,0.002831007],"study_design_scores_gemma":[0.0004143796,0.00005906962,0.000769308,0.0000280755,0.000002799641,0.000001566196,0.00003059562,0.9840193,0.007808084,0.000002160459,0.006733983,0.0001307244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8108965,0.0001042993,0.1385361,0.03970207,0.0001502028,0.00161097,0.00002975057,0.0007958612,0.008174285],"genre_scores_gemma":[0.9476478,0.00001656316,0.05068595,0.0006441692,0.0001108346,0.0002085554,0.00001698719,0.0000562481,0.0006128723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1367513,"threshold_uncertainty_score":0.8154418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038708756","doi":"10.1016/j.orl.2010.09.006","title":"Weak aggregating algorithm for the distribution-free perishable inventory problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Class (philosophy); Parametric statistics; Computer science; Distribution (mathematics); Mathematics; Algorithm; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1251349721004983,"gpt":0.4507296444040477,"spread":0.3255946723035494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01292568,0.0001883987,0.000224313,0.0003596217,0.004025338,0.002399697,0.003196973,0.000111067,0.0007965566],"category_scores_gemma":[0.02087137,0.0001204745,0.0001614849,0.002019722,0.001142049,0.001160534,0.0007830408,0.001544765,0.0003885659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001771064,"about_ca_system_score_gemma":0.0004554852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003954232,"about_ca_topic_score_gemma":0.001255929,"domain_scores_codex":[0.9931927,0.0005494282,0.0006410268,0.0007837298,0.003753668,0.001079453],"domain_scores_gemma":[0.9902147,0.0050682,0.00006300419,0.001965994,0.002407612,0.0002804548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002558434,0.000147635,0.0003228915,0.000009957242,0.00005805722,0.00001107152,0.0007188559,0.02322847,0.01963668,0.004005055,0.5542904,0.3975454],"study_design_scores_gemma":[0.0006310006,0.00007793139,0.0002936824,0.00001250081,0.000004217321,0.00001351783,0.001255179,0.6393008,0.001942082,0.003822431,0.352458,0.000188611],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01950736,0.0001869864,0.886681,0.08839652,0.0007580216,0.003040204,0.0006198665,0.00008345918,0.0007265331],"genre_scores_gemma":[0.2525287,0.0002153913,0.6396388,0.002919111,0.008696177,0.0152764,0.001019231,0.0003357036,0.07937045],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6160724,"threshold_uncertainty_score":0.9986359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033097589","doi":"10.1016/j.orl.2003.08.005","title":"A bilevel programming approach to the travelling salesman problem","year":2003,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Travelling salesman problem; Bilevel optimization; Mathematical optimization; Extension (predicate logic); Linear programming relaxation; Computer science; Relaxation (psychology); Toll; Linear programming; Dual (grammatical number); Optimization problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07996579037548483,"gpt":0.3380938230751212,"spread":0.2581280326996364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795647,0.00012655,0.0001050416,0.0002503863,0.000647045,0.0004068797,0.000311226,0.00004941549,0.00002246621],"category_scores_gemma":[0.0002941238,0.0001004438,0.00003739996,0.001268151,0.00006995493,0.0001418852,0.00003105876,0.0004934729,0.00009373141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233166,"about_ca_system_score_gemma":0.00005146365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002334711,"about_ca_topic_score_gemma":0.00002265882,"domain_scores_codex":[0.9979907,0.0005305676,0.0002318715,0.0002554177,0.0004402128,0.000551217],"domain_scores_gemma":[0.9992121,0.0001282463,0.000005400654,0.0003858409,0.0001394119,0.0001289307],"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":[8.150098e-7,0.00002286185,0.00003450424,0.0000197073,0.00001650306,9.135455e-7,0.001521868,0.9792521,0.008152109,0.003131356,0.001805471,0.006041783],"study_design_scores_gemma":[0.0002080116,0.00002289685,0.00008741408,0.00002803643,0.000006021858,0.00001539606,0.000530001,0.9336976,0.003879338,0.00002080828,0.06125622,0.0002482732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02270816,0.00004779713,0.9650635,0.002528223,0.00007550878,0.001201729,0.00000329087,0.0002066858,0.008165152],"genre_scores_gemma":[0.2750981,0.000009502074,0.7235469,0.000262578,0.00008673294,0.00059323,0.00001143182,0.00005359836,0.0003380219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2523899,"threshold_uncertainty_score":0.4976613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2921838721","doi":"10.1016/j.orl.2019.03.003","title":"Double-sided matching queues: Priority and impatient customers","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Computer science; Poisson distribution; Priority queue; Patience; Matching (statistics); Queueing theory; Poisson process; Mathematical optimization; Computer network; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03104915051129636,"gpt":0.3234884503273505,"spread":0.2924392998160542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001206051,0.0001288617,0.0001608334,0.0005438078,0.00058633,0.0006802799,0.0002280727,0.00003850968,0.0003043964],"category_scores_gemma":[0.0001409128,0.0001182265,0.00004912342,0.0007514597,0.0001286805,0.001718617,0.0002661148,0.0003542937,0.0008763383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009720797,"about_ca_system_score_gemma":0.00002484205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002002524,"about_ca_topic_score_gemma":0.0004256552,"domain_scores_codex":[0.9985031,0.0000614683,0.0002081671,0.00036266,0.0004657135,0.000398847],"domain_scores_gemma":[0.9992475,0.0001105939,0.00003181944,0.0003658729,0.0002191749,0.00002505214],"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.0003389864,0.0001990147,0.01005272,0.0003376739,0.0002135009,0.00004041212,0.001929773,0.5867139,0.161644,0.2285955,0.004869808,0.005064761],"study_design_scores_gemma":[0.01121966,0.0001489144,0.009481997,0.0008963902,0.0002977152,0.00002020865,0.01623561,0.7125254,0.004611209,0.01353394,0.227492,0.003536981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9892272,0.00002499509,0.000312837,0.005555415,0.0001094159,0.0004605791,0.000001402246,0.00007100626,0.004237155],"genre_scores_gemma":[0.9967359,0.000009682117,0.0003141413,0.001913415,0.0002630532,0.00004661796,0.000032423,0.00002412315,0.000660653],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2226222,"threshold_uncertainty_score":0.9999016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060240953","doi":"10.1016/j.orl.2003.09.006","title":"Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Bernoulli's principle; Queue; Queueing theory; Random variable; Service (business); Bulk queue; Computer science; Bernoulli trial; Applied mathematics; Burke's theorem; Discrete time and continuous time; Variable (mathematics); Mathematics; Mathematical optimization; Queue management system; Statistics; Physics; Computer network; Fork–join queue; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02512876416846612,"gpt":0.3082282290858865,"spread":0.2830994649174204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215331,0.0001363164,0.0002512703,0.0009554425,0.0007918926,0.0003216112,0.0007685824,0.0000444098,0.0006477407],"category_scores_gemma":[0.0005384858,0.0001001115,0.000222745,0.007353996,0.0002392402,0.0009322262,0.0003745137,0.0003097685,0.0004632058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223761,"about_ca_system_score_gemma":0.00005344435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005103499,"about_ca_topic_score_gemma":0.003708448,"domain_scores_codex":[0.9981819,0.0001000352,0.0003122488,0.0003312394,0.0006979323,0.0003766631],"domain_scores_gemma":[0.9984674,0.0001060882,0.00006384202,0.0008093207,0.0005351965,0.00001812687],"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.00001377146,0.00005660549,0.0007313627,0.00001902426,0.0004138632,0.000003094914,0.0001310316,0.9401326,0.04103773,0.01698232,0.000374925,0.0001036492],"study_design_scores_gemma":[0.001834784,0.0000277415,0.0241969,0.0002343613,0.003243978,0.000002245841,0.001404992,0.92592,0.006437783,0.007642614,0.02789218,0.001162421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9418885,0.00001816159,0.003403471,0.0518655,0.00005004115,0.0003043407,0.00001111435,0.00005007302,0.00240882],"genre_scores_gemma":[0.9936585,0.000003169606,0.0003627875,0.005073821,0.0002329616,0.00004799269,0.0000812504,0.00002256154,0.0005169542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05177002,"threshold_uncertainty_score":0.7714998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095553101","doi":"10.1016/j.orl.2006.03.014","title":"A list heuristic for vertex cover","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Heuristic; Cover (algebra); Sequence (biology); Degree (music); Mathematics; Approximation algorithm; Order (exchange); Discrete mathematics; Mathematical optimization; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05137916255268932,"gpt":0.3526719316432403,"spread":0.301292769090551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907738,0.00007716419,0.00008163972,0.0002423848,0.0006854535,0.0009095464,0.0006124263,0.00003212672,0.0001056301],"category_scores_gemma":[0.0002288619,0.00007198337,0.00004446897,0.0006144448,0.0001121415,0.000529926,0.0001329484,0.0001772606,0.0002588692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008920071,"about_ca_system_score_gemma":0.0001418472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000322417,"about_ca_topic_score_gemma":0.0001145389,"domain_scores_codex":[0.9983925,0.0001787815,0.0001755424,0.0003170246,0.0004954627,0.0004406872],"domain_scores_gemma":[0.9988736,0.0002369567,0.000008137975,0.0004195367,0.0003732904,0.00008851058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007970447,0.0001468383,0.00007646306,0.00002148035,0.00001128009,0.00001115353,0.0002527406,0.1894481,0.01900394,0.3096796,0.4799956,0.001344789],"study_design_scores_gemma":[0.000454532,0.00006488632,0.0002097021,0.000009704652,0.00000101243,0.000003367719,0.000009644294,0.9215925,0.000603679,0.0008307649,0.07609924,0.0001210072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004689885,0.00002861225,0.9545683,0.03589936,0.0001240596,0.0006738988,0.00001293635,0.00008528293,0.003917651],"genre_scores_gemma":[0.803899,0.00002198443,0.1746785,0.004239854,0.0002736718,0.0007558506,0.0001303849,0.00003127751,0.01596941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7992092,"threshold_uncertainty_score":0.8770776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029207664","doi":"10.1016/j.orl.2010.08.007","title":"Lifting, tilting and fractional programming revisited","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer programming; Connection (principal bundle); Simple (philosophy); Linear programming; Mathematical optimization; Mathematics; Key (lock); Integer (computer science); Fractional programming; Computer science; Algorithm; Nonlinear programming; Programming language; Nonlinear system; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08743048111281011,"gpt":0.4442686572291453,"spread":0.3568381761163352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913643,0.0001149553,0.0001296993,0.0003824438,0.001063119,0.0004603489,0.0002074487,0.00007751623,0.0005068257],"category_scores_gemma":[0.006141909,0.0001095075,0.00002988408,0.000682345,0.0002965221,0.0004727142,0.0001765702,0.001291999,0.00006537321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005532193,"about_ca_system_score_gemma":0.00008945191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003601884,"about_ca_topic_score_gemma":0.0001001601,"domain_scores_codex":[0.9978387,0.0002286404,0.0002673068,0.0003519779,0.0008212794,0.0004920674],"domain_scores_gemma":[0.9980298,0.0007953243,0.00002461492,0.0003575793,0.0006079357,0.0001847581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007965967,0.0007758679,0.005088849,0.0003938268,0.0002095638,0.0001368859,0.003943512,0.0117798,0.5573649,0.2212437,0.04140413,0.1575793],"study_design_scores_gemma":[0.002312325,0.0001995118,0.001545464,0.0002248336,0.00002709513,0.000236728,0.001536299,0.7787294,0.008417279,0.00648883,0.1991257,0.001156501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6546261,0.00007081679,0.3048049,0.03337066,0.0002469515,0.002448534,0.00002529136,0.0003989932,0.004007787],"genre_scores_gemma":[0.1510083,0.00003355579,0.8458136,0.0003433645,0.0005075662,0.000278809,0.00004546623,0.00006481863,0.001904512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7669497,"threshold_uncertainty_score":0.8176758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1428174065","doi":"10.1016/j.orl.2015.07.006","title":"Approximated cooperative equilibria for games played over event trees","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Saint Petersburg State University","keywords":"Stochastic game; Mathematical economics; Event (particle physics); Focus (optics); Class (philosophy); Tree (set theory); Mathematics; Event horizon; Computer science; Horizon; Mathematical optimization; Combinatorics; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.3516116309144722,"gpt":0.5185068786424022,"spread":0.16689524772793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006916842,0.0001465688,0.0002294946,0.0003996242,0.000687031,0.0009419782,0.0009105633,0.00006501641,0.0005026068],"category_scores_gemma":[0.005637359,0.0001075642,0.00009322946,0.00136385,0.0004303173,0.0006456567,0.0001912466,0.0002501097,0.0008067962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001181077,"about_ca_system_score_gemma":0.0003067704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006815756,"about_ca_topic_score_gemma":0.0002327046,"domain_scores_codex":[0.9960341,0.0008790597,0.0005110598,0.0005834675,0.001497705,0.0004946471],"domain_scores_gemma":[0.9958686,0.001654566,0.00003751459,0.0007995387,0.001343294,0.0002964382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000283413,0.000314786,0.0002645599,0.000003971128,0.00006122783,0.000004752168,0.004136531,0.07765722,0.2784122,0.1201316,0.5153308,0.003399035],"study_design_scores_gemma":[0.004113761,0.0007087083,0.00228845,0.00004106827,0.00002522897,0.00001538062,0.009352952,0.6027688,0.03614487,0.03370367,0.3100531,0.0007839769],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.913731,0.00004668937,0.05766707,0.02419996,0.000127397,0.001489323,0.0001542632,0.00006007363,0.002524169],"genre_scores_gemma":[0.9876675,0.000003006314,0.003019165,0.0008658458,0.0001822645,0.001036881,0.00008286057,0.00002034504,0.007122142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5251116,"threshold_uncertainty_score":0.9999712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009389420","doi":"10.1016/j.orl.2004.08.004","title":"Response time in a tandem queue with blocking, Markovian arrivals and phase-type services","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Queue; Blocking (statistics); Computer science; Tandem; Markov chain; Fork–join queue; Markov process; Discrete time and continuous time; Mathematical optimization; Control theory (sociology); Mathematics; Queue management system; Computer network; Statistics; Control (management); Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02084687635789415,"gpt":0.3171079521990768,"spread":0.2962610758411826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001970475,0.0001339472,0.000164058,0.0007958782,0.0004710965,0.0005535071,0.0002303624,0.00004023725,0.0001798224],"category_scores_gemma":[0.0002607438,0.0001156626,0.00002113352,0.001512848,0.0001759756,0.001174708,0.0001220765,0.0002693913,0.0001798073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001047905,"about_ca_system_score_gemma":0.00005236853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007836163,"about_ca_topic_score_gemma":0.002103931,"domain_scores_codex":[0.9985781,0.0001472914,0.0001885233,0.00034204,0.0003747372,0.0003693447],"domain_scores_gemma":[0.9993318,0.0001168105,0.00002932366,0.0002941368,0.0002033862,0.00002455782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003031554,0.0006069808,0.01113706,0.000155525,0.0002018979,0.0006669245,0.001597079,0.4453446,0.5222542,0.01209495,0.001172684,0.001736553],"study_design_scores_gemma":[0.05003203,0.001504785,0.03360996,0.004548048,0.0005129232,0.0001527762,0.01211043,0.623394,0.01686492,0.01891822,0.2323346,0.006017213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9791608,0.00003322935,0.0003552679,0.0196365,0.00001398691,0.0002930682,0.000001316691,0.00005080328,0.0004550338],"genre_scores_gemma":[0.9957595,0.000006811851,0.0008908661,0.002752533,0.0001398989,0.00003934954,0.00002553171,0.00002693011,0.0003585464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5053893,"threshold_uncertainty_score":0.5337482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089329646","doi":"10.1016/s0167-6377(00)00059-6","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Oracle; Linear programming; Mathematics; Polynomial; Convergence (economics); Time complexity; Algorithm; Construct (python library); Computer science; Mathematical optimization; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07014629511236242,"gpt":0.3576475601690094,"spread":0.287501265056647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001174682,0.0002060159,0.0002322607,0.000245319,0.001784426,0.00102537,0.001171769,0.0001020554,0.000103727],"category_scores_gemma":[0.0001259757,0.0002119069,0.0001818497,0.0006247808,0.0002299883,0.00056079,0.0001497408,0.0003946463,0.00003070277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001465702,"about_ca_system_score_gemma":0.0003597222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007700888,"about_ca_topic_score_gemma":0.0004151894,"domain_scores_codex":[0.9972105,0.0001579271,0.0004146176,0.0007266208,0.0004965003,0.0009938462],"domain_scores_gemma":[0.998297,0.0004029186,0.00003141952,0.0007126965,0.0003548232,0.0002011911],"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.0003622126,0.0003754763,0.00005024837,0.00006122686,0.000152283,0.00001080947,0.002264315,0.3090389,0.01398266,0.002043738,0.2178665,0.4537917],"study_design_scores_gemma":[0.0008003055,0.0002422694,0.0000326918,0.0000213352,0.000005903933,0.000003290822,0.00004654844,0.8361503,0.002759971,0.00001348027,0.1596957,0.0002281199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09720608,0.000122502,0.8694527,0.03001794,0.0004584908,0.002420597,0.0001338951,0.0001319175,0.00005591966],"genre_scores_gemma":[0.3011917,0.0000632624,0.6818416,0.004704678,0.00368712,0.002940671,0.0001673263,0.00008050328,0.005323182],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5271115,"threshold_uncertainty_score":0.9995151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2975579666","doi":"10.1016/j.orl.2019.09.009","title":"Assortment optimization under the multinomial logit model with product synergies","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Cornell University","keywords":"Attractiveness; Mathematical optimization; Product (mathematics); Combinatorics; Treewidth; Computer science; Mathematics; Path (computing); Graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.05254429056906057,"gpt":0.2816712590283065,"spread":0.2291269684592459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015704,0.0001310042,0.00009794851,0.0002603031,0.0005793553,0.0009080966,0.0003497578,0.00002192908,0.0004946156],"category_scores_gemma":[0.0000442793,0.00008240309,0.0000344566,0.0004772491,0.0001313969,0.00105208,0.0002156217,0.0002128093,0.0004879556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125057,"about_ca_system_score_gemma":0.00004128051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004144697,"about_ca_topic_score_gemma":0.0001384496,"domain_scores_codex":[0.9984477,0.00004741773,0.000161171,0.0003421172,0.000639596,0.0003620532],"domain_scores_gemma":[0.9992214,0.00003346834,0.00002709891,0.0004674617,0.000238956,0.00001163684],"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.00002350705,0.00005358607,0.0004350963,0.00002275775,0.00003120364,0.000001610523,0.00005306197,0.9570276,0.001175545,0.01219216,0.02885364,0.0001302177],"study_design_scores_gemma":[0.000431553,0.00001345383,0.0003458333,0.00001654354,0.00001278844,4.018211e-7,0.0007329758,0.9812476,0.00007553121,0.00003013105,0.01695159,0.0001415732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7257272,0.00004668337,0.04449005,0.1947504,0.0004644216,0.00368708,0.000005503402,0.0001927208,0.03063598],"genre_scores_gemma":[0.9847753,0.00000800382,0.001807102,0.007586292,0.0006585232,0.0002763711,0.000101211,0.00003162219,0.004755571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2590481,"threshold_uncertainty_score":0.8756797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065245021","doi":"10.1016/j.orl.2010.06.001","title":"A note on demand functions with uncertainty","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematical optimization; Utility maximization; Maximization; Mathematical economics; Demand curve; On demand; Inverse demand function; Utility maximization problem; Mathematics; Economics; Computer science; Econometrics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.03633866740808209,"gpt":0.2979967812589659,"spread":0.2616581138508838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007669533,0.0001238576,0.00008865103,0.0005327027,0.0009510545,0.0007768841,0.0002586743,0.00003745544,0.001456856],"category_scores_gemma":[0.0001516675,0.00009467433,0.0000373877,0.0007041457,0.0001982509,0.0006767571,0.0001050519,0.0005324266,0.001945816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004595337,"about_ca_system_score_gemma":0.0000317834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009473791,"about_ca_topic_score_gemma":0.00417267,"domain_scores_codex":[0.9985634,0.00002865661,0.0001314203,0.0003125703,0.0005768518,0.0003870708],"domain_scores_gemma":[0.9992603,0.00005563984,0.00001498619,0.0004209719,0.0002218562,0.00002623565],"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.0002294381,0.000544906,0.003814578,0.00009954669,0.0001050747,0.00008139235,0.0002605186,0.1444796,0.05970999,0.1601624,0.6234542,0.007058379],"study_design_scores_gemma":[0.00077167,0.0000521336,0.002431299,0.00002982169,0.00001704987,0.000001793858,0.0003397385,0.0627006,0.0001562393,0.0001063871,0.9331356,0.0002577038],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8641895,0.000003764752,0.002537366,0.06156839,0.0005650753,0.0007820667,0.000004569455,0.0001338544,0.0702154],"genre_scores_gemma":[0.9850259,0.00000159365,0.0002815252,0.01014576,0.001282852,0.0002178106,0.00007025265,0.00002472838,0.00294953],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3096814,"threshold_uncertainty_score":0.9994559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083670109","doi":"10.1016/j.orl.2011.11.009","title":"Impact of discounting and competition on benefit of decentralization with strategic customers","year":2011,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"University of International Business and Economics","keywords":"Discounting; Decentralization; Profit (economics); Competition (biology); Business; Microeconomics; Industrial organization; Channel (broadcasting); Decentralised system; Marketing; Economics; Computer science; Finance; Market economy; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0806537895905129,"gpt":0.2914829584913931,"spread":0.2108291689008802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001962375,0.00006345906,0.0000928192,0.0002485656,0.0001046623,0.0002226329,0.00006993257,0.0000174817,0.00009321945],"category_scores_gemma":[0.00001249138,0.00004710511,0.00002349048,0.0002409692,0.0001136567,0.002012687,0.0000279281,0.00006338402,0.00001268812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002676262,"about_ca_system_score_gemma":0.0000186487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307895,"about_ca_topic_score_gemma":0.0004919912,"domain_scores_codex":[0.999442,0.000001460064,0.0001500699,0.0001094542,0.0001433061,0.0001536898],"domain_scores_gemma":[0.9996971,0.00001163817,0.00004308169,0.00009578362,0.0001415423,0.00001085243],"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.0002039181,0.0002531241,0.08193,0.0001435282,0.00008912302,0.000003004209,0.0002761142,0.06078773,0.006789742,0.8482897,0.0001092015,0.001124814],"study_design_scores_gemma":[0.004247324,0.001168565,0.8068237,0.0009079192,0.0001037386,0.000008425432,0.00965578,0.158744,0.003448082,0.01345503,0.0002579786,0.001179443],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831617,0.000002695491,0.00005295531,0.00007196073,0.00001281508,0.0001438782,0.000004215432,0.000006259839,0.01654345],"genre_scores_gemma":[0.9997272,0.000006726034,0.00008753446,0.00006272985,0.00003652067,0.000005555175,0.00005167043,0.00000884052,0.00001322465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8348346,"threshold_uncertainty_score":0.3488862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092197733","doi":"10.1016/s0167-6377(02)00126-8","title":"Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system","year":2002,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Computer science; Bulk queue; Constant (computer programming); Real-time computing; Mathematics; Mathematical optimization; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02083138433353086,"gpt":0.2590667789316579,"spread":0.238235394598127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007620191,0.0001881643,0.0002874085,0.0002780212,0.0006194923,0.0003610569,0.0002587354,0.00006066704,0.0004757727],"category_scores_gemma":[0.0003185837,0.0001590107,0.00004643353,0.001066011,0.0002265713,0.001054001,0.0001287984,0.0002466287,0.0009315296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009903753,"about_ca_system_score_gemma":0.0000136475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005823338,"about_ca_topic_score_gemma":0.00009837894,"domain_scores_codex":[0.9982519,0.0001519629,0.0003531024,0.0003833325,0.0004713593,0.0003883484],"domain_scores_gemma":[0.9987184,0.0002102687,0.00009522501,0.000391803,0.00054892,0.00003537648],"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.0006073606,0.0006042984,0.002558227,0.003112974,0.001083862,0.0004001242,0.001237815,0.7179379,0.2231883,0.02993266,0.01689105,0.002445441],"study_design_scores_gemma":[0.0005273085,0.00002415168,0.0001686581,0.0003485256,0.00009926757,0.000007100603,0.0002423503,0.997346,0.0002223099,0.00002239643,0.0007802181,0.0002117357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9909071,0.00003990572,0.002708152,0.004700666,0.0000269119,0.0005961035,0.00004986148,0.0001313324,0.0008399211],"genre_scores_gemma":[0.9980674,0.000002210212,0.0002385138,0.0003147148,0.0001359949,0.00006581632,0.0002949193,0.00003343952,0.0008469626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2794081,"threshold_uncertainty_score":0.9998463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012762076","doi":"10.1016/s0167-6377(01)00095-5","title":"Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model","year":2001,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Subject (documents); Single use; Computer science; Upper and lower bounds; Operations management; Operations research; Mathematics; Economics; Engineering; Process engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2700245598731367,"gpt":0.4598726996339618,"spread":0.1898481397608251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005111917,0.0002620984,0.000334711,0.00102377,0.002114618,0.002999365,0.000809531,0.0001200674,0.0004205505],"category_scores_gemma":[0.006074449,0.0002242703,0.00009553571,0.001965531,0.0003747062,0.001158838,0.0004776871,0.0006176067,0.0008815779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004325067,"about_ca_system_score_gemma":0.0003433611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289906,"about_ca_topic_score_gemma":0.001833573,"domain_scores_codex":[0.9943563,0.0005774528,0.0006020698,0.001167857,0.0023034,0.0009929594],"domain_scores_gemma":[0.9963981,0.001469266,0.00003976375,0.0009230811,0.0006940044,0.0004757998],"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.0003706169,0.0003559995,0.001429875,0.00001522703,0.00005730471,0.00009039324,0.01092103,0.7687758,0.1537457,0.003319819,0.01896014,0.04195808],"study_design_scores_gemma":[0.001157518,0.0004578222,0.0003276616,0.0002297607,0.00001093292,0.00006844327,0.003978131,0.9613107,0.005210037,0.003660097,0.02287962,0.00070925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9202163,0.00008162879,0.02882554,0.04164179,0.00009725038,0.001046147,0.00001343417,0.00004647942,0.008031461],"genre_scores_gemma":[0.9798453,0.00009609448,0.007593124,0.009296205,0.00008425419,0.0001576319,0.000005124754,0.00003864953,0.002883576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1925349,"threshold_uncertainty_score":0.9998963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031070862","doi":"10.1016/j.orl.2008.05.001","title":"The influence of the node criticality relation on some measures of component importance","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Regional Development Fund; Royal Canadian Geographical Society","keywords":"Criticality; Component (thermodynamics); Ranking (information retrieval); Reliability (semiconductor); Relation (database); Computer science; Reliability engineering; Node (physics); Mathematics; Statistics; Data mining; Artificial intelligence; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04816845958036342,"gpt":0.2923257338945415,"spread":0.2441572743141781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071079,0.00005328887,0.00007433905,0.00004017697,0.0003965409,0.00001736363,0.0002081738,0.00003105008,0.000004043886],"category_scores_gemma":[0.000784372,0.00003299181,0.00003753027,0.0002472297,0.0005048189,0.0001678066,0.00002574955,0.0002475405,0.000004226618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008272705,"about_ca_system_score_gemma":0.00003791189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008418185,"about_ca_topic_score_gemma":0.00004476052,"domain_scores_codex":[0.9988508,0.0001766502,0.0002481697,0.0000923116,0.0004691554,0.0001629129],"domain_scores_gemma":[0.999079,0.0002256253,0.00001212845,0.0003946453,0.0002632497,0.00002532835],"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.000007223897,0.00001731441,0.001570993,0.00001420406,0.000006728749,3.035166e-7,0.0001734963,0.9247237,0.0656286,0.007079312,0.0007419937,0.00003614117],"study_design_scores_gemma":[0.000432809,0.0000652933,0.5225043,0.0001746566,0.000008410098,0.000004778651,0.0001401701,0.4177943,0.05639191,0.0007938223,0.001500939,0.0001885817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9911387,0.00005012978,0.001241613,0.006968706,0.00005028899,0.000273865,0.000007191667,0.00001520377,0.000254331],"genre_scores_gemma":[0.9991965,0.0002545752,0.0003275518,0.0001385527,0.00001391757,0.00003568561,0.000003050028,0.000006859018,0.00002332382],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5209334,"threshold_uncertainty_score":0.3049912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042788891","doi":"10.1016/j.orl.2010.09.004","title":"Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Linear programming relaxation; Hypergraph; Mathematics; Upper and lower bounds; Combinatorics; Bounded function; Relaxation (psychology); Linear programming; Tree (set theory); Approximation algorithm; Discrete mathematics; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06305174887661538,"gpt":0.3385172516865786,"spread":0.2754655028099633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511372,0.00009244034,0.0001724965,0.0003497125,0.0002598796,0.00007856858,0.001213485,0.0000591387,0.00003728],"category_scores_gemma":[0.0004000071,0.00006369701,0.0001409803,0.001543374,0.0009123703,0.0003916521,0.000315493,0.0005479521,0.000001666854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000196386,"about_ca_system_score_gemma":0.0001856435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007776275,"about_ca_topic_score_gemma":0.00195786,"domain_scores_codex":[0.9979404,0.0003603797,0.0003955873,0.0002571813,0.0008181876,0.0002282186],"domain_scores_gemma":[0.9980973,0.0001761611,0.00005038692,0.001043564,0.0005828796,0.00004972643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001709073,0.0004443048,0.009196136,0.00007073665,0.00006632475,0.000001371019,0.002399621,0.002095982,0.7614553,0.2113337,0.001727064,0.01119237],"study_design_scores_gemma":[0.001072936,0.0004821678,0.117923,0.0003395072,0.00003267389,0.00002842737,0.0005639892,0.3653974,0.4963423,0.01357961,0.00369542,0.0005425209],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9697189,0.0000236902,0.02102113,0.008056075,0.0001821272,0.0004430868,0.00001554474,0.0000121698,0.0005272772],"genre_scores_gemma":[0.9880609,0.000005468752,0.01164521,0.0000880904,0.00003246388,0.00004649854,0.000003819035,0.000005961148,0.000111569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3633014,"threshold_uncertainty_score":0.3361667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963290245","doi":"10.1016/j.orl.2018.10.003","title":"On the asymptotic behaviour of the Aragón Artacho–Campoy algorithm","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Saudi Arabian Cultural Bureau; Natural Sciences and Engineering Research Council of Canada; Saudi Arabia Cultural Bureau in London","keywords":"Hilbert space; Mathematics; Resolvent; Monotone polygon; Intersection (aeronautics); Generalization; Projection (relational algebra); Interpretation (philosophy); Algorithm; Regular polygon; Operator (biology); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03923236557992851,"gpt":0.3265307217875624,"spread":0.2872983562076339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009331749,0.00006786096,0.0000688465,0.0001555613,0.0009130525,0.0002872247,0.001065629,0.00002602174,0.000259179],"category_scores_gemma":[0.0002975926,0.00003706061,0.00006997783,0.001274153,0.0002489287,0.0002175351,0.0002012943,0.000226102,0.0001898495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004904591,"about_ca_system_score_gemma":0.000109967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001424449,"about_ca_topic_score_gemma":0.0000701891,"domain_scores_codex":[0.998163,0.00046696,0.0001743296,0.0002171435,0.0007775071,0.0002010046],"domain_scores_gemma":[0.9984816,0.0002593632,0.00002378603,0.000712071,0.0004781882,0.00004497035],"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.000005265751,0.0003255742,0.001014994,0.000003327256,0.0001112713,0.0000028666,0.00207436,0.09066581,0.006901285,0.8385921,0.05579962,0.004503498],"study_design_scores_gemma":[0.0001321852,0.00006009763,0.007212281,0.00001314481,0.000006321839,0.000002010453,0.00004471255,0.9880514,0.003013832,0.000553323,0.0008314085,0.00007928469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07805872,0.000007503732,0.7297971,0.1895299,0.0002450094,0.0004153088,0.00001228699,0.00003048421,0.001903754],"genre_scores_gemma":[0.9772897,0.000003913749,0.01646413,0.004746348,0.0001250071,0.00004783448,0.000005137401,0.000006411668,0.001311521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.899231,"threshold_uncertainty_score":0.7022554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969119890","doi":"10.1016/j.orl.2014.10.001","title":"Decomposition theorems for linear programs","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Linear programming; Bounded function; Decomposition; Residual; Class (philosophy); Applied mathematics; Combinatorics; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05506757424898105,"gpt":0.390566865604166,"spread":0.335499291355185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644275,0.00008033437,0.00008488332,0.0001557458,0.000329954,0.0001675522,0.0001565894,0.00004795761,0.00002583593],"category_scores_gemma":[0.0002427733,0.0000794955,0.00003861171,0.0003108595,0.00007153864,0.0001536577,0.00002025225,0.0001930322,0.00005216821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007106422,"about_ca_system_score_gemma":0.00001262502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001016861,"about_ca_topic_score_gemma":0.00001369936,"domain_scores_codex":[0.9989036,0.0002407847,0.0001572113,0.0001555446,0.0002207811,0.0003220785],"domain_scores_gemma":[0.9993013,0.0002105192,0.00000436454,0.0002313328,0.0001785656,0.00007398139],"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.000003722784,0.00001590207,0.00004681812,0.00002271553,0.00001189149,2.081475e-7,0.0001503329,0.9198787,0.05726882,0.004355102,0.001448598,0.01679718],"study_design_scores_gemma":[0.0002243348,0.00004412685,0.00004660976,0.00001548536,0.000002746924,0.000001521643,0.00002105374,0.9821484,0.007610175,0.00008143204,0.00970979,0.00009431293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1110087,0.00001033433,0.8849468,0.002184267,0.0001166384,0.0005454686,0.00000392196,0.0002346138,0.0009492801],"genre_scores_gemma":[0.5528152,0.000007511404,0.4459912,0.0002153932,0.0003134738,0.0003879057,0.000113291,0.00004695169,0.0001091249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4418064,"threshold_uncertainty_score":0.3241733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036223399","doi":"10.1016/s0167-6377(02)00178-5","title":"A mountain process with state dependent input and output and a correlated dam","year":2002,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outflow; Generalization; Equivalence (formal languages); Production (economics); Process (computing); Work (physics); Production rate; State (computer science); State dependent; Work in process; Mathematics; Constant (computer programming); Computer science; Mathematical economics; Economics; Operations management; Thermodynamics; Engineering; Mathematical analysis; Algorithm; Discrete mathematics; Process engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03403268896689165,"gpt":0.2893857000473459,"spread":0.2553530110804542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077659,0.0001174715,0.0001196794,0.0004949979,0.0006003838,0.0006438868,0.0001242306,0.00002775321,0.00007771057],"category_scores_gemma":[0.000188313,0.00009604184,0.00001122719,0.0007564725,0.0002421117,0.001176438,0.0001132161,0.0002981356,0.00007071331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003806467,"about_ca_system_score_gemma":0.000009352319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003333348,"about_ca_topic_score_gemma":0.0007623271,"domain_scores_codex":[0.9987664,0.00004403639,0.0001497653,0.0003145465,0.0003955912,0.0003296649],"domain_scores_gemma":[0.9994437,0.00007039186,0.00002555108,0.0001848955,0.0002480753,0.00002744292],"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.001000778,0.0008865999,0.0778223,0.0009855933,0.0009500615,0.001198662,0.009173126,0.7730409,0.02512841,0.02991837,0.009976735,0.06991845],"study_design_scores_gemma":[0.001825493,0.00006490705,0.001927625,0.0001373731,0.00008148813,0.00002970218,0.001974425,0.986176,0.0002762785,0.001111995,0.005821022,0.0005737207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9872009,0.00006962484,0.005590017,0.005815011,0.00001242902,0.0003178785,0.000002120773,0.00005345616,0.0009386335],"genre_scores_gemma":[0.9967796,0.000021668,0.0002902642,0.001614195,0.00008111382,0.00005077502,0.00001243026,0.00002206808,0.001127842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2131351,"threshold_uncertainty_score":0.6209015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403411684","doi":"10.1016/j.orl.2024.107194","title":"Structured pruning of neural networks for constraints learning","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Artificial neural network; Computer science; Artificial intelligence; Machine learning; Biology; Botany","retraction":null,"screen_n_in":null,"score":{"opus":0.04766301081933947,"gpt":0.3484694934558907,"spread":0.3008064826365512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012122,0.000081293,0.00009864214,0.0002460156,0.0004908443,0.0005942407,0.0004185074,0.0000454996,0.00002376183],"category_scores_gemma":[0.0001826208,0.00007403911,0.00005044532,0.0005595415,0.0001546298,0.0003765338,0.00009953258,0.0005338255,0.000004269478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003627349,"about_ca_system_score_gemma":0.0001172909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003668146,"about_ca_topic_score_gemma":0.00001057354,"domain_scores_codex":[0.9986346,0.0002401903,0.0001833033,0.000288448,0.000285307,0.0003681939],"domain_scores_gemma":[0.9989382,0.000623468,0.00001118109,0.0002108955,0.0001498773,0.00006637195],"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.000003556079,0.000004206175,0.0001566694,0.0000413771,0.00002258556,0.00001350151,0.001112883,0.9292481,0.01477382,0.01578,0.003107511,0.0357358],"study_design_scores_gemma":[0.00009535295,0.00006663195,0.00006130319,0.00009667836,0.000002237228,0.000009077974,0.00005722976,0.9974975,0.0007084408,0.00008257693,0.001245255,0.00007774471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0517805,0.0003457376,0.9406917,0.006391283,0.0002448437,0.0002789865,0.000005598934,0.0001127165,0.0001486324],"genre_scores_gemma":[0.9610503,0.00000532019,0.03842155,0.0001678051,0.0001140219,0.00004279389,0.0000246762,0.00001085953,0.0001626927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9092698,"threshold_uncertainty_score":0.5730277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033053245","doi":"10.1016/j.orl.2010.08.003","title":"On the supplier diversification under binomial yield","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Toronto; University of New Brunswick; Dalhousie University","funders":"","keywords":"Diversification (marketing strategy); Binomial (polynomial); Yield (engineering); Mathematics; Binomial distribution; Business; Statistics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.08486870141100007,"gpt":0.2964477325248592,"spread":0.2115790311138591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009919256,0.0000918236,0.00005617661,0.0003190444,0.001051035,0.0008401318,0.0004377589,0.00003888761,0.005014983],"category_scores_gemma":[0.0002848233,0.00006490036,0.00004347305,0.0004379906,0.0001886964,0.0005247704,0.0001775335,0.000476684,0.003227444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003881692,"about_ca_system_score_gemma":0.00001641852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006764089,"about_ca_topic_score_gemma":0.0005905574,"domain_scores_codex":[0.9988242,0.00002840336,0.0001205616,0.0002378223,0.000496137,0.0002928738],"domain_scores_gemma":[0.9992499,0.0001502675,0.00001488673,0.0004441186,0.0001266508,0.00001414311],"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.0000128634,0.00006045398,0.000275417,0.000006268372,0.00001392017,0.000001974472,0.00004643723,0.00179041,0.03938951,0.5301332,0.4278707,0.0003988517],"study_design_scores_gemma":[0.0007012215,0.00002888086,0.01026631,0.00002706141,0.00002464503,7.931266e-7,0.001809561,0.04298583,0.002081549,0.003260766,0.938363,0.0004503811],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7828658,0.000001580204,0.0004254871,0.1784109,0.0005637294,0.0005283781,0.000002191967,0.00004645692,0.03715551],"genre_scores_gemma":[0.9757796,0.000001799682,0.00003940683,0.02123567,0.001084738,0.0001250315,0.00003655367,0.0000144075,0.001682802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5268725,"threshold_uncertainty_score":0.9975486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037455685","doi":"10.1016/j.orl.2010.03.003","title":"Revisiting a simple algorithm for the planar multiterminal cut problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Planar; Algorithm; SIMPLE algorithm; Mathematics; Maximum cut; Combinatorics; Terminal (telecommunication); Time complexity; Minimum cut; Computer science; Physics; Telecommunications; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05934213711343048,"gpt":0.3612582802058003,"spread":0.3019161430923698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001820861,0.0001097945,0.000102098,0.0001875598,0.002064936,0.001069156,0.001427839,0.00004196345,0.00003538198],"category_scores_gemma":[0.0002051427,0.00008062826,0.00008252,0.0005940382,0.0002454011,0.0005162607,0.0002410493,0.0006904809,0.00003961026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002634355,"about_ca_system_score_gemma":0.0001025616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002752526,"about_ca_topic_score_gemma":0.0002998688,"domain_scores_codex":[0.9982466,0.000140135,0.0002097316,0.0003844455,0.0004950705,0.0005240096],"domain_scores_gemma":[0.9980727,0.0008116966,0.00001781754,0.0007128874,0.0002864242,0.00009843864],"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.000003587342,0.00006088499,0.00005483507,0.00002239695,0.00003657338,0.00002180078,0.001100516,0.001013659,0.02980924,0.07186814,0.01561714,0.8803912],"study_design_scores_gemma":[0.0002272626,0.00003605293,0.0001746999,0.00001286675,0.00000270347,0.00002964192,0.00006449834,0.919279,0.0009210671,0.001027689,0.07809916,0.000125374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006909056,0.00003233539,0.9552117,0.03648559,0.0002159914,0.0008503639,0.00003205719,0.00007522798,0.0001876548],"genre_scores_gemma":[0.03401531,0.00001423139,0.9620458,0.001841434,0.001028211,0.0006536099,0.00003014942,0.00001826009,0.0003529612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9182653,"threshold_uncertainty_score":0.9999678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006832443","doi":"10.1016/j.orl.2009.01.001","title":"On competitiveness in uniform utility allocation markets","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Georgia Institute of Technology; National Science Foundation","keywords":"Business; Industrial organization; Microeconomics; Mathematical optimization; Computer science; Economics; Operations research; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1668413364227684,"gpt":0.4718000991088989,"spread":0.3049587626861305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006772263,0.00008283947,0.0001172839,0.0005905523,0.0006067093,0.0003181603,0.0005572467,0.00004585921,0.001525428],"category_scores_gemma":[0.002041873,0.00006814182,0.00004062296,0.001815733,0.0002120057,0.0004247278,0.00004054768,0.0003500167,0.001031687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001185729,"about_ca_system_score_gemma":0.00008732961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003780333,"about_ca_topic_score_gemma":0.0001686016,"domain_scores_codex":[0.9968262,0.0009609,0.0003780468,0.0004216282,0.001134671,0.0002785273],"domain_scores_gemma":[0.9977379,0.001127496,0.00002195225,0.0006430943,0.0003766582,0.00009290988],"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.0001815008,0.0006030391,0.001128691,0.000001999146,0.00000579795,0.000009572385,0.0007691875,0.03996676,0.01980845,0.8482168,0.01039223,0.07891598],"study_design_scores_gemma":[0.001370052,0.0002721235,0.6341359,0.00007486167,0.000003497498,0.00001190048,0.002860527,0.1089688,0.01091718,0.1581914,0.08267371,0.0005200786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8885548,0.000006825979,0.02447314,0.06495944,0.00006198904,0.0004854576,0.00001402152,0.00002759357,0.02141676],"genre_scores_gemma":[0.996146,0.000006130594,0.0003921248,0.001809801,0.00004487077,0.00007330425,0.00002059633,0.00000400308,0.001503173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6900254,"threshold_uncertainty_score":0.9997461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382930395","doi":"10.1016/j.orl.2023.06.006","title":"Unconstrained traveling tournament problem is APX-complete","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Hamiltonian path; Combinatorics; Complete graph; Mathematics; Travelling salesman problem; APX; Graph; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.09799900504041466,"gpt":0.3645096889024662,"spread":0.2665106838620516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730694,0.0001285667,0.00013338,0.0003834205,0.0004647801,0.0003014853,0.0002477888,0.00005409122,0.0002815295],"category_scores_gemma":[0.0001328248,0.0001343492,0.00005097346,0.001422402,0.00008851163,0.0001891859,0.00005889782,0.0004455558,0.0005710966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001809232,"about_ca_system_score_gemma":0.00005545469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004127171,"about_ca_topic_score_gemma":0.00001529288,"domain_scores_codex":[0.998109,0.0002309032,0.0002981581,0.0002417622,0.0005367767,0.0005834287],"domain_scores_gemma":[0.9992477,0.0001669643,0.000007031354,0.0002979259,0.0001494663,0.0001309492],"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.000001157691,0.00000589451,0.00004504759,0.00002304046,0.00002712858,0.0000105467,0.001049423,0.8507766,0.1258481,0.0002258072,0.01705015,0.004937197],"study_design_scores_gemma":[0.0002671065,0.00001570336,0.0001531908,0.00003831655,0.000003693915,0.000005716967,0.0003188698,0.9856899,0.004918342,0.00003695728,0.008384718,0.000167503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5316176,0.00007671212,0.4113208,0.04497036,0.000452286,0.001485015,0.00009998147,0.001834789,0.008142457],"genre_scores_gemma":[0.7157285,0.0001623138,0.2801165,0.001244566,0.0003942128,0.0003799116,0.0001398115,0.0001469018,0.001687245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.184111,"threshold_uncertainty_score":0.7340482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088456596","doi":"10.1016/j.orl.2014.12.008","title":"A tight bound on the speed-up through storage for quickest multi-commodity flows","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Computer science; Speedup; Commodity; Parallel computing; Mathematics; Mathematical optimization; Simulation; Business; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1471800480679098,"gpt":0.3804564062101811,"spread":0.2332763581422713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002608342,0.0001369907,0.0001294619,0.0001536599,0.001892244,0.001361857,0.001352027,0.00005381562,0.00007348356],"category_scores_gemma":[0.0008517723,0.00009483849,0.00007411838,0.0005961963,0.0002254182,0.0007160627,0.0002429812,0.0004824053,0.0003456317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001202785,"about_ca_system_score_gemma":0.0001403716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001626714,"about_ca_topic_score_gemma":0.0003590237,"domain_scores_codex":[0.9971449,0.0008655532,0.0002187529,0.0004565695,0.0007381514,0.0005760718],"domain_scores_gemma":[0.9975804,0.0008964468,0.00001866065,0.0009978486,0.0003808529,0.000125754],"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.000024131,0.0003959406,0.0000234753,0.00003323665,0.00004560646,0.000004936468,0.006673654,0.3047607,0.01608669,0.4182675,0.249847,0.003837178],"study_design_scores_gemma":[0.0005347258,0.0001192085,0.0000493605,0.00001405307,0.000001065847,0.000001283455,0.00005305226,0.8809648,0.001001124,0.0002659158,0.1168755,0.0001199609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01841068,0.000009813156,0.8574906,0.1213741,0.0002960552,0.001221516,0.00001893361,0.0000703226,0.001107954],"genre_scores_gemma":[0.7341527,0.00006090389,0.2265861,0.02838549,0.0007670646,0.001111902,0.0001336884,0.00007355413,0.008728599],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.715742,"threshold_uncertainty_score":0.9996748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037492274","doi":"10.1016/j.orl.2014.04.005","title":"Stochastic capacity expansion with multiple sources of capacity","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Tissue expansion; Mathematics; Mathematical optimization; Computer science; Medicine; Surgery","retraction":null,"screen_n_in":null,"score":{"opus":0.07668023595771185,"gpt":0.2631691389677981,"spread":0.1864889030100863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474191,0.00009180071,0.0002318334,0.000410441,0.0003228803,0.0000941461,0.0001784643,0.00004196231,0.000153001],"category_scores_gemma":[0.0002602409,0.0000803263,0.00006827267,0.0004242002,0.0003457376,0.00023128,0.00004001675,0.0002035793,0.0001713845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006220725,"about_ca_system_score_gemma":0.00001244336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004534601,"about_ca_topic_score_gemma":0.001446194,"domain_scores_codex":[0.9989702,0.00007309794,0.000293329,0.0002784421,0.0001230049,0.0002619319],"domain_scores_gemma":[0.9993154,0.0001215457,0.00004722153,0.000331993,0.00009860483,0.00008521773],"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.00006988197,0.0005275093,0.06515288,0.00008439543,0.0003052616,0.000002951362,0.007683897,0.3133618,0.03027047,0.5790989,0.003000559,0.0004415544],"study_design_scores_gemma":[0.00212165,0.0005726082,0.03735222,0.00008231567,0.00002976767,0.000006914227,0.0008555934,0.9373511,0.01080326,0.005619455,0.004466128,0.0007390072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9821745,0.0001671273,0.01526495,0.001666128,0.00003425917,0.000178474,0.0000447572,0.0000129321,0.0004568971],"genre_scores_gemma":[0.9977849,0.00003381948,0.001634889,0.0001711375,0.00006478059,0.00003987702,0.00001734502,0.00001246344,0.0002408647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6239893,"threshold_uncertainty_score":0.6854991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1758756115","doi":"10.1016/j.orl.2015.10.002","title":"A primal-simplex based Tardos’ algorithm","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Japan Society for the Promotion of Science","keywords":"Unimodular matrix; Simplex algorithm; Simplex; Linear programming; Dimension (graph theory); Mathematics; Revised simplex method; Algorithm; Matrix (chemical analysis); Coefficient matrix; Polynomial; Bounded function; Mathematical optimization; Computer science; Combinatorics; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.2905634287283733,"gpt":0.4823722494864992,"spread":0.1918088207581259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863975,0.0002046611,0.0002463589,0.0006870865,0.0005778192,0.0003902904,0.0005966118,0.00009723535,0.0007368001],"category_scores_gemma":[0.003915241,0.0001925554,0.00007637798,0.001454645,0.0003841227,0.0005455198,0.0002363841,0.0007587432,0.0005397109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005867159,"about_ca_system_score_gemma":0.0007835751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001185413,"about_ca_topic_score_gemma":0.00007712692,"domain_scores_codex":[0.9952652,0.0008215246,0.0004055885,0.0005082362,0.002099205,0.0009001786],"domain_scores_gemma":[0.9964137,0.0006211515,0.00002566039,0.0008386937,0.001555943,0.0005448633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001210696,0.001488569,0.000116554,0.0001094391,0.0001532378,0.0003331718,0.002216625,0.309029,0.006477801,0.02856353,0.5954766,0.05591438],"study_design_scores_gemma":[0.002080095,0.000143447,0.00001822183,0.00002835103,0.000007198711,0.00001432728,0.000494339,0.9423931,0.002615968,0.003697708,0.04816647,0.0003408245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006130711,0.0000488034,0.9631634,0.0254978,0.0001265854,0.001362861,0.0000603867,0.000235463,0.003374037],"genre_scores_gemma":[0.0118069,0.00001157629,0.9822389,0.001387671,0.000325799,0.000541756,0.0001254929,0.0001012334,0.003460642],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6333641,"threshold_uncertainty_score":0.8067445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889569267","doi":"10.1016/j.orl.2018.09.002","title":"On Eulerian orientations of even-degree hypercubes","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eulerian path; Hypercube; Degree (music); Orientation (vector space); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Undirected graph; Graph; Node (physics); Connectivity; Discrete mathematics; Computer science; Physics; Geometry; Artificial intelligence; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1056014198098545,"gpt":0.3706132696872155,"spread":0.265011849877361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781027,0.00007288215,0.00009865221,0.0003158008,0.0005765646,0.0002380459,0.0005686752,0.00003536579,0.0001888394],"category_scores_gemma":[0.0001708736,0.00006239822,0.00004388748,0.0007822799,0.0002014961,0.000389108,0.00009913093,0.0001747661,0.0003774243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006329551,"about_ca_system_score_gemma":0.0000791813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002894512,"about_ca_topic_score_gemma":0.0004693955,"domain_scores_codex":[0.9984187,0.0003274001,0.0002286138,0.0002698814,0.0004836686,0.0002717552],"domain_scores_gemma":[0.9986594,0.0001701554,0.00001554715,0.0005556268,0.0005263021,0.00007293991],"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.00001811673,0.0001690163,0.000138392,0.0000116443,0.00004780119,0.000009631578,0.004468631,0.009510938,0.0979623,0.7409645,0.1405178,0.006181237],"study_design_scores_gemma":[0.001640738,0.002826733,0.005922697,0.0003448026,0.000009333933,0.00007116338,0.001471064,0.8613174,0.05089345,0.002439721,0.07224687,0.0008160401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5809035,0.00001413606,0.3874746,0.01324829,0.001173713,0.0004239524,0.000008450557,0.00006985713,0.01668347],"genre_scores_gemma":[0.9933417,0.000002630525,0.00468878,0.0007659504,0.0003194072,0.00005379171,0.000004208754,0.000007320647,0.0008161794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8518065,"threshold_uncertainty_score":0.4851151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080259970","doi":"10.1016/j.orl.2009.09.002","title":"Bounds on the cleaning times of robot vacuums","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Protocol (science); Robot; Simple (philosophy); Enhanced Data Rates for GSM Evolution; Polynomial; Exponential function; Computer science; Mathematics; Combinatorics; Artificial intelligence; Medicine; Mathematical analysis; Pathology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.0580586038922692,"gpt":0.3224082306799817,"spread":0.2643496267877125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522919,0.00006724694,0.00007168419,0.0001084035,0.0002401551,0.0001100268,0.0002414723,0.00002499056,0.0003512923],"category_scores_gemma":[0.0000693784,0.00004680595,0.00003161567,0.000261335,0.0000676018,0.00008561211,0.00001493364,0.0002892378,0.0001214915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003928161,"about_ca_system_score_gemma":0.00001370815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003415199,"about_ca_topic_score_gemma":0.00001513319,"domain_scores_codex":[0.999147,0.00007315016,0.0001332289,0.000102674,0.0003163452,0.0002276078],"domain_scores_gemma":[0.9995174,0.00009001864,0.000003591647,0.0002887553,0.00006348455,0.00003676492],"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.000002566052,0.00001677656,0.000007934646,0.00000394179,0.00001267219,0.00000313289,0.0003951457,0.8255915,0.1290831,0.02173679,0.0179031,0.005243366],"study_design_scores_gemma":[0.0001564469,0.0002793956,0.00171127,0.0001083463,0.000006138532,0.000005938903,0.0003903708,0.7459844,0.2399724,0.00050739,0.01058229,0.0002955588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8589337,0.0002193757,0.06340256,0.04282792,0.000202476,0.0006184606,0.000008160942,0.0001457334,0.0336416],"genre_scores_gemma":[0.9981509,0.0000436792,0.0007759007,0.0005899719,0.00006449009,0.00001340488,0.000003871241,0.00001026993,0.0003475065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1392172,"threshold_uncertainty_score":0.3846404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313350174","doi":"10.1016/j.orl.2022.12.006","title":"Gradient boosting for convex cone predict and optimize problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Regret; Gradient boosting; Convex optimization; Mathematical optimization; Boosting (machine learning); Regular polygon; Computer science; Quadratic programming; Quadratic equation; Artificial intelligence; Mathematics; Machine learning; Random forest","retraction":null,"screen_n_in":null,"score":{"opus":0.2601772201591964,"gpt":0.4724558772527916,"spread":0.2122786570935952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01077246,0.0001316682,0.0002449488,0.0007812734,0.003423869,0.0008235333,0.0008909745,0.00003078391,0.0007583722],"category_scores_gemma":[0.006502343,0.0001114773,0.0000667549,0.001392341,0.0005774341,0.0005183943,0.0009083392,0.0007133725,0.00004460297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002506377,"about_ca_system_score_gemma":0.0002217729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114533,"about_ca_topic_score_gemma":0.00005380099,"domain_scores_codex":[0.9936216,0.0009906302,0.000527558,0.0007843917,0.003284757,0.0007910975],"domain_scores_gemma":[0.9948825,0.003393878,0.00004071691,0.0005994947,0.0008312993,0.0002521029],"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.0001276486,0.0001535444,0.0005908634,0.00001922732,0.00004660366,0.00003597159,0.002162936,0.8696664,0.02109328,0.001418381,0.08909677,0.0155884],"study_design_scores_gemma":[0.001693154,0.0005765675,0.0004564814,0.00001197463,0.000004486992,0.00004566207,0.003233446,0.8452106,0.0007473399,0.001691688,0.1460843,0.0002443167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4176125,0.0008352206,0.4676271,0.1033834,0.0006923301,0.007876932,0.0008196339,0.000143315,0.001009563],"genre_scores_gemma":[0.9490845,0.00006940458,0.03283025,0.001415388,0.0003467971,0.005919631,0.0001299021,0.00006789079,0.01013627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.531472,"threshold_uncertainty_score":0.9978735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955163350","doi":"10.1016/j.orl.2019.06.006","title":"Idealness and 2-resistant sets","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypercube; Unit cube; Combinatorics; Ideal (ethics); Cardinality (data modeling); Mathematics; Cube (algebra); Set (abstract data type); Regular polygon; Convex hull; Unit (ring theory); Discrete mathematics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03179020033189318,"gpt":0.3315998570981613,"spread":0.2998096567662681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875091,0.00005283585,0.0000699197,0.0002400481,0.0003018297,0.0005358419,0.0003223785,0.00002054981,0.000175192],"category_scores_gemma":[0.00006151169,0.00004594287,0.00002034786,0.0006764206,0.00003837349,0.0005441735,0.0001629769,0.0001163,0.0003086544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003604736,"about_ca_system_score_gemma":0.0000632781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001655014,"about_ca_topic_score_gemma":0.00005750463,"domain_scores_codex":[0.9988456,0.0001706581,0.0001152456,0.0002588024,0.0004254509,0.0001842768],"domain_scores_gemma":[0.9993135,0.00009429544,0.000007479618,0.0003176701,0.0001911986,0.00007587661],"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.000007299642,0.00006155406,0.001766027,0.00001642332,0.00005027233,0.000009014592,0.0007716898,0.1168462,0.0460417,0.8247393,0.007021009,0.00266947],"study_design_scores_gemma":[0.0002553762,0.00002927356,0.007599976,0.000006593325,0.000002091249,0.000003019621,0.0000491242,0.9853701,0.000393341,0.0003409564,0.005830996,0.0001191794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4440578,0.00005986665,0.4298738,0.1215402,0.0001429281,0.000415145,0.000007171315,0.00008290065,0.003820228],"genre_scores_gemma":[0.9712714,0.00001783873,0.02542334,0.00184092,0.00002330807,0.00002501523,0.00001446995,0.000004923041,0.001378789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8685239,"threshold_uncertainty_score":0.5167135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012217367","doi":"10.1016/j.orl.2013.09.009","title":"Binary group facets with complete support and non-binary coefficients","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Binary number; Group (periodic table); Mathematics; Combinatorics; Binary data; Discrete mathematics; Arithmetic; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1354584550971923,"gpt":0.3894642043212603,"spread":0.254005749224068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005721162,0.0001466117,0.0001975542,0.0001504353,0.0006631847,0.0003122833,0.0002396695,0.00004670637,0.001064328],"category_scores_gemma":[0.000112409,0.0001090085,0.00002945748,0.0003307552,0.000363452,0.0002490311,0.0001671206,0.0002936473,0.0004307266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004568206,"about_ca_system_score_gemma":0.00003511705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002618178,"about_ca_topic_score_gemma":0.00004377905,"domain_scores_codex":[0.9982684,0.0001392303,0.0002866737,0.0003078302,0.0005380565,0.0004598502],"domain_scores_gemma":[0.9986262,0.0004635169,0.00002100543,0.0004817568,0.0002135615,0.0001940098],"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.00003014637,0.001428037,0.0004434589,0.0006147521,0.0001483173,0.00003721023,0.004680483,0.0008160676,0.255119,0.3938431,0.3419374,0.000902052],"study_design_scores_gemma":[0.01005582,0.005521918,0.01940327,0.00137119,0.000234415,0.0003319156,0.02716986,0.7617998,0.004959394,0.05035827,0.1140754,0.004718821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.963032,0.000007298339,0.01665983,0.01516524,0.00001569327,0.001471319,0.00004385349,0.00005498318,0.003549788],"genre_scores_gemma":[0.9739289,0.000009587608,0.02213721,0.0008324581,0.00004912444,0.0009509862,0.00007018955,0.0000343785,0.001987161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7609837,"threshold_uncertainty_score":0.9998488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978372231","doi":"10.1016/j.orl.2009.01.010","title":"An edge-reduction algorithm for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Vertex cover; Edge cover; Cover (algebra); Vertex (graph theory); Feedback vertex set; Reduction (mathematics); Algorithm; Combinatorics; Mathematics; Upper and lower bounds; Approximation algorithm; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05798311254050664,"gpt":0.3598596864221159,"spread":0.3018765738816093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001105145,0.00009829991,0.00008241613,0.0001889647,0.001611237,0.0009925214,0.001175393,0.00003661465,0.00002641771],"category_scores_gemma":[0.00003903967,0.0000736262,0.00006384018,0.00075845,0.0001677382,0.001046263,0.0000741687,0.0003013314,0.00005349814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007049897,"about_ca_system_score_gemma":0.0001058072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008477791,"about_ca_topic_score_gemma":0.00001382454,"domain_scores_codex":[0.9983429,0.0001948935,0.0001601521,0.0003797634,0.0005001026,0.0004221694],"domain_scores_gemma":[0.9987264,0.0001552679,0.00001106535,0.0007221607,0.0002903654,0.00009477289],"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.000004503968,0.0001759926,0.000001278861,0.000002861115,0.00001897841,0.000002843628,0.0008386603,0.01598244,0.01712725,0.07424286,0.04204164,0.8495607],"study_design_scores_gemma":[0.0002496896,0.000244064,0.0002098261,0.000007844828,0.000002748042,0.00001530807,0.00006302373,0.9709917,0.001650685,0.003934165,0.02251053,0.0001204259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001796136,0.00006459224,0.944539,0.05217448,0.000290363,0.0008025132,0.000009428758,0.00008286833,0.0002406311],"genre_scores_gemma":[0.1733306,0.00006806751,0.8190526,0.004834833,0.0009531919,0.0005714772,0.00005173256,0.00002016964,0.001117301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9550093,"threshold_uncertainty_score":0.9996885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W586461037","doi":"10.1016/j.orl.2015.06.006","title":"Robust binary optimization using a safe tractable approximation","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Marriott International (Canada)","funders":"","keywords":"Robust optimization; Mathematical optimization; Binary number; Optimization problem; Mathematics; Nonlinear programming; Linear programming; Nonlinear system; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.4841275584469856,"gpt":0.4660255832628508,"spread":0.01810197518413476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007538552,0.0001371055,0.0001912729,0.001102324,0.0008227309,0.00136645,0.0005344909,0.00009796511,0.0004010959],"category_scores_gemma":[0.003337337,0.0001143396,0.0000587159,0.002960196,0.0001699068,0.002311866,0.0001221927,0.0003010889,0.0003694831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002610848,"about_ca_system_score_gemma":0.000441653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004151563,"about_ca_topic_score_gemma":0.00005650728,"domain_scores_codex":[0.9948594,0.001013656,0.0006205073,0.0005120962,0.002550825,0.0004435098],"domain_scores_gemma":[0.9969882,0.0002895359,0.0000679564,0.0006412131,0.001740516,0.0002725483],"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.00002416624,0.00006165358,0.000513314,9.606737e-7,0.000005577911,0.000006331146,0.0006432175,0.9716787,0.002107672,0.0003746247,0.02312128,0.001462514],"study_design_scores_gemma":[0.0003599552,0.00004928693,0.0001422339,0.000008595813,0.000004919024,0.00001222228,0.000945397,0.9921953,0.0002698915,0.0001340129,0.005741931,0.0001362257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2210534,0.00007101121,0.7660603,0.007239348,0.0002830663,0.0005902818,0.0000122234,0.00004694799,0.004643424],"genre_scores_gemma":[0.5898868,0.0001325186,0.4047159,0.0007726758,0.0004756805,0.0001142962,0.0002410516,0.00005073483,0.00361035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3688334,"threshold_uncertainty_score":0.9996702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083184497","doi":"10.1016/j.orl.2020.08.014","title":"Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation","year":2020,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complement (music); Sampling (signal processing); Algorithm; Polyhedron; Computer science; Markov chain Monte Carlo; Set (abstract data type); Pipeline (software); Boundary (topology); Data set; Artificial intelligence; Pattern recognition (psychology); Mathematics; Bayesian probability; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.2966483137067856,"gpt":0.4570154344034947,"spread":0.1603671206967091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007044,0.00007287815,0.00009430917,0.00004566269,0.0005667435,0.0003900051,0.001761236,0.0000154854,0.00004230282],"category_scores_gemma":[0.0001643511,0.00005538307,0.00002463237,0.0003359041,0.00007059496,0.0005443007,0.0005104289,0.0002163825,0.00001249584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002392811,"about_ca_system_score_gemma":0.00008658799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001823563,"about_ca_topic_score_gemma":0.0001113792,"domain_scores_codex":[0.9983224,0.0003406711,0.0002078447,0.0004058157,0.0004920998,0.0002312025],"domain_scores_gemma":[0.9986085,0.0003669304,0.00002389853,0.0007836791,0.0001252377,0.00009180479],"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.00001649413,0.0001469164,0.0003286938,0.00001872257,0.0001004593,0.000003813625,0.009785055,0.03710837,0.05266955,0.006524995,0.0274852,0.8658117],"study_design_scores_gemma":[0.000323413,0.0001141215,0.000342095,0.000008218022,0.000003400094,4.501119e-7,0.000279028,0.9878913,0.0006624606,0.00004514537,0.01026625,0.00006408532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009333368,0.00003488161,0.8978763,0.09203846,0.00006656504,0.0003997523,0.0002065929,0.00003158352,0.00001247331],"genre_scores_gemma":[0.07886087,0.000008521875,0.9150442,0.004371295,0.0005184163,0.0000787175,0.001087,0.00001214737,0.00001880486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.950783,"threshold_uncertainty_score":0.435899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400943839","doi":"10.1016/j.orl.2024.107146","title":"Optimal transport divergences induced by scoring functions","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.200695500219769,"gpt":0.4479512296532597,"spread":0.2472557294334907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748415,0.0001228631,0.0001335474,0.0002760794,0.0005733195,0.0002478005,0.0002143239,0.00006286221,0.0002999137],"category_scores_gemma":[0.0002547115,0.0001051733,0.0000913845,0.0006463968,0.0001024962,0.0003147167,0.00005067692,0.0005311432,0.000006812933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009935661,"about_ca_system_score_gemma":0.0001121353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002928344,"about_ca_topic_score_gemma":0.0002054181,"domain_scores_codex":[0.9981857,0.0002759241,0.0002357706,0.0003546005,0.000551058,0.0003969649],"domain_scores_gemma":[0.9990827,0.0003656173,0.000005816478,0.0002938845,0.0001233662,0.0001286358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001936103,0.0001435335,0.0001726476,0.0002081432,0.0001855367,0.00008802031,0.003253845,0.002231397,0.736622,0.02225716,0.2265339,0.008284448],"study_design_scores_gemma":[0.001767444,0.001030384,0.0004169965,0.001378797,0.0003255776,0.00009204366,0.01304403,0.1930349,0.1061542,0.001029886,0.6789113,0.002814474],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9145839,0.0002202321,0.07278749,0.007904499,0.0005113399,0.0003800395,0.00005657,0.0001455321,0.003410353],"genre_scores_gemma":[0.9687338,0.00007169948,0.02107838,0.0001767453,0.0003480712,0.0002932354,0.0000492804,0.00004241726,0.009206363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6304678,"threshold_uncertainty_score":0.4409568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051229026","doi":"10.1016/j.orl.2013.04.011","title":"Network design with a discrete set of traffic matrices","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Variety (cybernetics); Set (abstract data type); Scheme (mathematics); Time complexity; Computer science; Approximation algorithm; Network planning and design; Computational complexity theory; Polynomial; Mathematical optimization; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.07737951602445946,"gpt":0.3222089761203714,"spread":0.2448294600959119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261967,0.00008852412,0.000114982,0.000205989,0.0004395232,0.0004818352,0.0008817388,0.00002430559,0.00007730811],"category_scores_gemma":[0.00003083768,0.00006639583,0.00003086463,0.00136259,0.0002488601,0.0007403022,0.0001679047,0.0002345343,0.00007418875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002315143,"about_ca_system_score_gemma":0.00008887121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002135824,"about_ca_topic_score_gemma":0.00005340626,"domain_scores_codex":[0.9982347,0.0003760323,0.0001675867,0.0002686421,0.0005467423,0.0004062497],"domain_scores_gemma":[0.9989115,0.0002674258,0.00001666697,0.0004985426,0.000215984,0.00008986922],"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.000007086809,0.00003148758,0.00004097098,0.00001346775,0.0000292806,0.00001029317,0.0008771527,0.9475952,0.001493159,0.01124541,0.02934495,0.009311496],"study_design_scores_gemma":[0.0002443909,0.0002518466,0.0005083938,0.00004785057,0.000002708756,0.00001091324,0.00009103047,0.9965477,0.0003928004,0.000628026,0.001114667,0.0001596672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09799498,0.0000885107,0.8821607,0.01886964,0.00005333855,0.0006110819,0.000003099445,0.00005822644,0.0001604684],"genre_scores_gemma":[0.5761396,0.00001852647,0.4230166,0.0004051831,0.0001144714,0.0001790151,0.000004924443,0.00000871306,0.0001129598],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4781446,"threshold_uncertainty_score":0.4646348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2739784970","doi":"10.1016/j.orl.2017.07.005","title":"The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers","year":2017,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Government of Canada","keywords":"Class (philosophy); Queueing theory; Computer science; Poisson distribution; Queueing system; Mathematical optimization; Server; Routing (electronic design automation); Layered queueing network; Nash equilibrium; Operations research; Computer network; Mathematics; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08374648839579794,"gpt":0.3626902892683113,"spread":0.2789438008725134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002575811,0.0001568493,0.0002358876,0.0003683431,0.002009648,0.00105473,0.0007282337,0.00005353536,0.000009508896],"category_scores_gemma":[0.0008067817,0.0001071819,0.00005782445,0.0005103571,0.000704002,0.002831926,0.000235588,0.0005486513,0.00005311073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001306821,"about_ca_system_score_gemma":0.00006931379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005731216,"about_ca_topic_score_gemma":0.01066007,"domain_scores_codex":[0.998154,0.0002157628,0.0003331742,0.0003435967,0.0005220596,0.0004314395],"domain_scores_gemma":[0.9982363,0.0002411117,0.0001807323,0.0008769966,0.0004449645,0.00001990625],"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.000300549,0.0003089202,0.0335806,0.0002785816,0.0003145251,0.0001532941,0.0007460966,0.6305459,0.01469817,0.3183145,0.000187676,0.0005712431],"study_design_scores_gemma":[0.002828718,0.00003400905,0.01418075,0.0005740857,0.0000730245,0.000002378376,0.01268953,0.9641747,0.0003260711,0.0003501669,0.004221513,0.0005449907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9883465,0.0001203828,0.001933329,0.005067658,0.0001084436,0.0008113781,0.000003790024,0.00003695736,0.00357152],"genre_scores_gemma":[0.9974489,0.00002815455,0.0006108893,0.00008815426,0.00009876913,0.00009162694,0.000009028772,0.00002598155,0.001598461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3336289,"threshold_uncertainty_score":0.9999823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3179697346","doi":"10.1016/j.orl.2021.06.014","title":"Busy periods of discrete-time queues using the Lagrange implicit function theorem","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Bernoulli's principle; Mathematics; Discrete time and continuous time; Applied mathematics; Operator (biology); Notation; Bernoulli process; Generating function; Function (biology); Probability distribution; Discrete mathematics; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03858907018433338,"gpt":0.3290342602465398,"spread":0.2904451900622064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255489,0.0001160129,0.000165059,0.0002576789,0.0009903954,0.0004918972,0.0002816987,0.00003734535,0.0007230206],"category_scores_gemma":[0.0004867277,0.00008494405,0.0001099893,0.001428302,0.0003001367,0.0009750035,0.0002330501,0.0002612749,0.0001062133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005702509,"about_ca_system_score_gemma":0.00004337397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007734538,"about_ca_topic_score_gemma":0.000402839,"domain_scores_codex":[0.9985191,0.0002065819,0.0002344666,0.0002731165,0.0004567474,0.0003100292],"domain_scores_gemma":[0.9987113,0.0001588654,0.00004418184,0.0005010582,0.000572359,0.00001226507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004480496,0.0000466701,0.0004633232,0.00004063971,0.0001088177,0.000009932716,0.0001865966,0.0989301,0.8244039,0.07356633,0.001216658,0.0009822664],"study_design_scores_gemma":[0.001164287,0.00003946626,0.002589972,0.0002735062,0.0005086451,0.00001465897,0.01147281,0.9093456,0.02250865,0.01153083,0.0396074,0.0009441425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9679773,0.0001069024,0.01657501,0.01265704,0.00007781015,0.0002263729,0.000006331277,0.00004557185,0.0023277],"genre_scores_gemma":[0.9963923,0.000008709174,0.0005842,0.001774724,0.0005863434,0.00003087698,0.00006286235,0.00002726515,0.0005326812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8104155,"threshold_uncertainty_score":0.7916569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}