{"meta":{"query_hash":"6fd521a8eea0","filters":{"venue":"Operations Research"},"cohort_total":330,"direct_labels_cover":0,"predictions_cover":330,"exported":330,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/6fd521a8eea0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operations+Research"},"results":[{"id":"W133224232","doi":"10.1287/opre.2017.1598","title":"Simplex Algorithm for Countable-State Discounted Markov Decision Processes","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sequence (biology); Countable set; Markov decision process; Simplex; Mathematics; Mathematical optimization; Monotonic function; Computation; Markov chain; Algorithm; Computer science; Discrete mathematics; Markov process; Combinatorics","score_opus":0.10959950376740257,"score_gpt":0.3972092885550222,"score_spread":0.2876097847876196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133224232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1937217,0.0007099048,0.45879033,0.026154514,0.0038538217,0.014439673,0.000471904,0.00063734606,0.3012208],"genre_scores_gemma":[0.91461486,0.00026507353,0.0156694,0.001505245,0.0034380872,0.0021259445,0.000627015,0.00013632188,0.06161807],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805963,0.000016284095,0.0002635554,0.00041792088,0.00070396316,0.0005386466],"domain_scores_gemma":[0.9976223,0.0001272832,0.000053453612,0.0007320826,0.0014385785,0.000026288864],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016276262,0.00015406229,0.00016022248,0.0003791887,0.0036272206,0.004544933,0.0008554689,0.000047283775,0.0008018875],"category_scores_gemma":[0.0012846261,0.00013229268,0.000051822466,0.00035929494,0.0001935302,0.002648325,0.00052821724,0.00016114209,0.00047414203],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016261554,0.0004976004,0.0016522005,0.0006489069,0.000100555066,0.000021826314,0.00017974495,0.0014331604,0.00030812196,0.018377457,0.3325064,0.6441114],"study_design_scores_gemma":[0.00081487215,0.000022816994,0.00090813247,0.00006988954,0.000011965224,4.249405e-7,0.00040092156,0.29040357,0.00011663869,0.0026041928,0.7044498,0.00019682162],"about_ca_topic_score_codex":0.0016468437,"about_ca_topic_score_gemma":0.003366407,"teacher_disagreement_score":0.72089314,"about_ca_system_score_codex":0.0000831922,"about_ca_system_score_gemma":0.00012323825,"threshold_uncertainty_score":0.99766994},"labels":[],"label_agreement":null},{"id":"W1516611346","doi":"10.1287/opre.2017.1705","title":"Inverse Optimization with Noisy Data","year":2018,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Inverse problem; Regularization (linguistics); Optimization problem; Mathematics; Heuristics; Curse of dimensionality; Computer science; Duality (order theory); Algorithm; Artificial intelligence","score_opus":0.20894179008982508,"score_gpt":0.39535653920595293,"score_spread":0.18641474911612785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516611346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042462137,0.00042719697,0.89927965,0.0006205703,0.0005865468,0.0018316709,0.00034263098,0.0018638688,0.052585747],"genre_scores_gemma":[0.50936544,0.0012180664,0.48264405,0.000050353774,0.0009936794,0.00023607619,0.0037518675,0.00017802342,0.0015624407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865484,0.000107566775,0.00015626878,0.0004058084,0.00041448115,0.00026101785],"domain_scores_gemma":[0.9973876,0.000032791875,0.00000755333,0.0019073562,0.0005953439,0.00006937516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042711178,0.00015464629,0.0001479231,0.00029004583,0.00022808678,0.0003964583,0.0008368198,0.00019022594,0.00021403754],"category_scores_gemma":[0.00007745068,0.00013932036,0.000015156938,0.00029054735,0.00015802568,0.00020030889,0.0011787907,0.00078220194,0.0001012401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044556027,0.0000149323405,0.000011378091,0.000019988813,0.000038478185,0.000007612186,0.000088956906,0.9313119,0.000277742,0.0000622857,0.0677627,0.00039956457],"study_design_scores_gemma":[0.00006763079,0.000032118507,0.000011877136,0.00016502393,0.0000100075795,0.000004252487,0.000031610594,0.9913926,0.0024986516,0.000065590015,0.005552979,0.00016765845],"about_ca_topic_score_codex":0.00028358924,"about_ca_topic_score_gemma":0.00074162416,"teacher_disagreement_score":0.4669033,"about_ca_system_score_codex":0.000092044276,"about_ca_system_score_gemma":0.00019666359,"threshold_uncertainty_score":0.5681319},"labels":[],"label_agreement":null},{"id":"W1731991363","doi":"10.1287/opre.1120.1155","title":"Dynamic Business Share Allocation in a Supply Chain with Competing Suppliers","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Incentive; Markov decision process; Microeconomics; Supply chain; Time horizon; Principal (computer security); Imperfect; Repeated game; Process (computing); Principal–agent problem; Computer science; Operations research; Business; Game theory; Economics; Markov process; Marketing; Finance","score_opus":0.046234154945537495,"score_gpt":0.3092002736619232,"score_spread":0.2629661187163857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1731991363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9449716,0.00018319495,0.0011268011,0.009393633,0.00025731436,0.0015616141,0.000007733774,0.00011753784,0.04238055],"genre_scores_gemma":[0.995978,0.000016974991,0.0006360558,0.00043570952,0.0003478444,0.00035745025,0.00040301867,0.00003530658,0.0017896458],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815863,0.00005786775,0.00023875774,0.00028722498,0.00058624434,0.0006712521],"domain_scores_gemma":[0.99915034,0.000044847457,0.000025229949,0.00031529355,0.00043455965,0.00002970479],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017136751,0.00014899854,0.00014057077,0.00091142376,0.0004891281,0.00053221395,0.00030843404,0.000052922478,0.0012926417],"category_scores_gemma":[0.00016957533,0.00013143598,0.000021593522,0.0020798335,0.0001047112,0.001782846,0.00022427597,0.0002734232,0.0006722845],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003733474,0.0027595132,0.5288661,0.0015961585,0.00014931768,0.0000662885,0.0051688766,0.07858661,0.0076274932,0.32641175,0.025221912,0.023172619],"study_design_scores_gemma":[0.0026419105,0.000046380486,0.33140945,0.00048089775,0.000030173656,0.0000069265957,0.018635541,0.47119242,0.00012114763,0.00022278412,0.17429511,0.0009172828],"about_ca_topic_score_codex":0.0018873409,"about_ca_topic_score_gemma":0.004589602,"teacher_disagreement_score":0.3926058,"about_ca_system_score_codex":0.00019889603,"about_ca_system_score_gemma":0.000057110046,"threshold_uncertainty_score":0.9996203},"labels":[],"label_agreement":null},{"id":"W1813559903","doi":"10.1287/opre.2015.1396","title":"Multistate Bayesian Control Chart Over a Finite Horizon","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"State (computer science); State space; Observable; Cartesian coordinate system; Optimal control; Computer science; Control (management); Markov process; Limit (mathematics); Coordinate system; Horizon; Transformation (genetics); Process (computing); Mathematical optimization; Time horizon; Mathematics; Control theory (sociology); Algorithm; Mathematical analysis; Physics; Statistics; Geometry","score_opus":0.3992216259290546,"score_gpt":0.5642323833587184,"score_spread":0.1650107574296638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813559903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014799022,0.00012904842,0.96992,0.0025956556,0.00038569493,0.00051625795,0.00012842607,0.000053664557,0.0114722755],"genre_scores_gemma":[0.96918905,0.0000058090877,0.013525643,0.00004933959,0.00029146788,0.00012306981,0.000008411702,0.00001842187,0.016788773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479604,0.00065231277,0.000491253,0.00054637133,0.0029726904,0.0005413571],"domain_scores_gemma":[0.99413675,0.0023690076,0.000026137572,0.00062709267,0.0023563274,0.0004847031],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005390147,0.00011784762,0.00021455662,0.00040367618,0.00059635646,0.0008472326,0.00067312655,0.00006593348,0.0004922066],"category_scores_gemma":[0.034003165,0.00009087251,0.00003784476,0.0013261163,0.00026194088,0.0007650909,0.00016688873,0.0004728542,0.002282235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070144987,0.0006721481,0.009790828,0.000023343904,0.000075394084,0.00037402188,0.0056562265,0.28783467,0.0091450075,0.11022209,0.09723793,0.47826687],"study_design_scores_gemma":[0.002018582,0.00049853645,0.0016358775,0.000021342203,0.000004626238,0.0000072511425,0.001901452,0.8824953,0.00075901527,0.04086083,0.06950172,0.00029550274],"about_ca_topic_score_codex":0.00021751224,"about_ca_topic_score_gemma":0.00033526088,"teacher_disagreement_score":0.9563943,"about_ca_system_score_codex":0.00015195683,"about_ca_system_score_gemma":0.00036431383,"threshold_uncertainty_score":0.9984946},"labels":[],"label_agreement":null},{"id":"W1892095999","doi":"10.1287/opre.1110.0964","title":"Rational Generating Functions and Integer Programming Games","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Integer programming; Nash equilibrium; Integer (computer science); Dimension (graph theory); Class (philosophy); Price of anarchy; Stochastic game; Game theory; Action (physics)","score_opus":0.47876759126902424,"score_gpt":0.5057032951195757,"score_spread":0.02693570385055144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892095999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81667435,0.00021621518,0.1096299,0.0023811774,0.00014213551,0.0008171847,0.00002770846,0.000081889964,0.07002946],"genre_scores_gemma":[0.9446275,0.000009419255,0.019070262,0.00005160523,0.00012647161,0.0003667514,0.0000139513095,0.000008763987,0.035725247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976647,0.0004721647,0.00036512592,0.00041196318,0.0008193764,0.0002666901],"domain_scores_gemma":[0.9977537,0.0006093176,0.000020534391,0.0004595277,0.001020715,0.0001362263],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0047311415,0.00008049879,0.00010248244,0.0003601063,0.0015592107,0.00066767185,0.0003505363,0.000052819152,0.002599478],"category_scores_gemma":[0.0023495355,0.00006075343,0.000035681904,0.0011019974,0.00038586173,0.00048300732,0.00017639312,0.0002937588,0.0010390145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025983703,0.00030796413,0.0036881433,0.0000029555806,0.000026188256,0.0000035100184,0.006974122,0.0012107111,0.014772409,0.6969182,0.009818218,0.26625162],"study_design_scores_gemma":[0.0012837688,0.0007196318,0.028435318,0.000059059545,0.00003652756,0.00016261001,0.065499686,0.22121601,0.0128291,0.14532062,0.52336615,0.0010714929],"about_ca_topic_score_codex":0.00009005782,"about_ca_topic_score_gemma":0.00036823534,"teacher_disagreement_score":0.55159754,"about_ca_system_score_codex":0.000022704455,"about_ca_system_score_gemma":0.00015153886,"threshold_uncertainty_score":0.9997406},"labels":[],"label_agreement":null},{"id":"W1919130806","doi":"10.1287/opre.2015.1427","title":"Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Stadium; Mathematical optimization; Norm (philosophy); Computer science; Optimization problem; Set (abstract data type); Mathematics; Algorithm","score_opus":0.4458326972844299,"score_gpt":0.4791435195208626,"score_spread":0.03331082223643267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919130806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073657406,0.00006846668,0.9769226,0.0013798644,0.00006315001,0.0019484569,0.000008746212,0.00010261861,0.018769544],"genre_scores_gemma":[0.002593069,0.000051987143,0.948687,0.000051781033,0.00025472857,0.0002546689,0.000045346675,0.00007039605,0.047991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632883,0.00063090696,0.00042348535,0.000600705,0.0013324893,0.0006835875],"domain_scores_gemma":[0.9962744,0.00041004192,0.000026957956,0.00068026263,0.0017130021,0.0008953509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036705977,0.00019965069,0.00025412577,0.00066305697,0.0005453146,0.0006281607,0.000433923,0.00013813625,0.00019429043],"category_scores_gemma":[0.0066681188,0.00018840733,0.000029541197,0.0014232411,0.00013978103,0.00063090597,0.00040747787,0.0005251252,0.00024136998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008054016,0.0002292705,0.000011658242,0.000024766397,0.000021321703,0.0000033466922,0.0034367256,0.95958596,0.000085297455,0.009575849,0.020721532,0.006223725],"study_design_scores_gemma":[0.0009733282,0.00024665703,0.0000064742567,0.000021144018,0.0000071184386,0.00001897779,0.0020269053,0.9895539,0.00037854657,0.0027869525,0.0037427994,0.00023719697],"about_ca_topic_score_codex":0.00021510271,"about_ca_topic_score_gemma":0.000050569248,"teacher_disagreement_score":0.029967934,"about_ca_system_score_codex":0.00033013115,"about_ca_system_score_gemma":0.0010016549,"threshold_uncertainty_score":0.7982843},"labels":[],"label_agreement":null},{"id":"W1921096321","doi":"10.1287/opre.2015.1412","title":"Government Debt Control: Optimal Currency Portfolio and Payments","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Monetary Policy and Economic Impact","field":"Economics, Econometrics and Finance","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Economics; Debt; External debt; Monetary economics; Internal debt; Portfolio; Government debt; Recourse debt; Currency; Debt-to-GDP ratio; Debt levels and flows; Debt ratio; Financial economics; Macroeconomics","score_opus":0.2207238178726541,"score_gpt":0.34175915211057667,"score_spread":0.12103533423792256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921096321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88039166,0.0017847664,0.0015135071,0.0023416497,0.00022596878,0.00050383917,0.0019356863,0.000021521162,0.11128141],"genre_scores_gemma":[0.99028337,0.00018615407,0.00073775137,0.00015401068,0.00012965722,0.0000770174,0.000048176506,0.000012819109,0.008371045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988412,0.00004078758,0.00034770783,0.00029725803,0.00009050536,0.0003825277],"domain_scores_gemma":[0.9993572,0.00004881009,0.000029542693,0.00026679528,0.000029904832,0.00026769532],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013152772,0.000093020695,0.00019659955,0.0001276679,0.00022203955,0.00021015096,0.00015564654,0.0000575103,0.0027705505],"category_scores_gemma":[0.00030993696,0.000099657605,0.00003178771,0.00012544193,0.00008505802,0.00037747176,0.0000773857,0.00019260822,0.0015860522],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020421017,0.0007767696,0.17246227,0.000038468,0.00034796615,0.00003095172,0.0035318069,0.04708768,0.000061652085,0.3646707,0.40139678,0.009390717],"study_design_scores_gemma":[0.0036143737,0.0005907052,0.03405324,0.00001853352,0.000007092545,0.000028168839,0.0006557723,0.49189898,0.0000735122,0.0072158794,0.4612992,0.00054454955],"about_ca_topic_score_codex":0.0012264104,"about_ca_topic_score_gemma":0.00008083965,"teacher_disagreement_score":0.44481128,"about_ca_system_score_codex":0.00019437642,"about_ca_system_score_gemma":0.000044305976,"threshold_uncertainty_score":0.99919134},"labels":[],"label_agreement":null},{"id":"W1931616235","doi":"10.1287/opre.2015.1401","title":"Benders Decomposition for Production Routing Under Demand Uncertainty","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematical optimization; Production (economics); Routing (electronic design automation); Generalization; Branch and cut; Stochastic programming; Computer science; Pareto principle; Benders' decomposition; Upper and lower bounds; Exploit; Decomposition method (queueing theory); Decomposition; Time horizon; Mathematics; Linear programming; Economics","score_opus":0.16131367666491017,"score_gpt":0.438498401075115,"score_spread":0.2771847244102048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931616235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1363008,0.00006988941,0.8594272,0.001142014,0.00032555414,0.0006708321,0.0000062433587,0.00021959085,0.0018378438],"genre_scores_gemma":[0.8794162,0.000013264602,0.119468175,0.000015929103,0.00023272149,0.00016691082,0.00007651555,0.00003226972,0.000577968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878865,0.0002226903,0.00019026348,0.00020036616,0.00029836988,0.0002996728],"domain_scores_gemma":[0.99888754,0.000121253564,0.0000061447076,0.00020604496,0.00066953845,0.000109490735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025238812,0.00008183222,0.00008827205,0.00018881644,0.00040138405,0.00015029384,0.00010351436,0.00007124522,0.000017138245],"category_scores_gemma":[0.0006600243,0.000085680564,0.000025531102,0.0004707755,0.000058285044,0.00026484035,0.000026003478,0.00019983154,0.000026131253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007723458,0.0000151619315,0.000053455442,0.000013537885,0.000013620351,1.5570659e-7,0.0005959082,0.9890614,0.0047064694,0.0022039101,0.0019479342,0.0013807017],"study_design_scores_gemma":[0.0002925481,0.000037966285,0.00008591691,0.00001503056,0.000005127246,0.0000044669064,0.001270547,0.99117357,0.0059747063,0.0004792334,0.00055955193,0.00010135937],"about_ca_topic_score_codex":0.000042035943,"about_ca_topic_score_gemma":0.00011805701,"teacher_disagreement_score":0.7431154,"about_ca_system_score_codex":0.00032903408,"about_ca_system_score_gemma":0.0001106096,"threshold_uncertainty_score":0.34939522},"labels":[],"label_agreement":null},{"id":"W1938812469","doi":"10.1287/opre.2015.1375","title":"<i>M/M/c</i> Queue with Two Priority Classes","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Priority queue; Computer science; Class (philosophy); Queue; Mathematical optimization; Mathematics; Discrete mathematics; Computer network","score_opus":0.09841692185489291,"score_gpt":0.38846801163469635,"score_spread":0.29005108977980343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938812469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.771101,0.0001214293,0.012115081,0.006739472,0.00014279508,0.00064025685,0.00000383325,0.0002820961,0.20885405],"genre_scores_gemma":[0.9909327,0.0000040121445,0.0023396083,0.00038061698,0.0007276544,0.00006469244,0.000030184012,0.000023367134,0.005497142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857014,0.00007760597,0.00014311961,0.0002730239,0.0006122737,0.00032380642],"domain_scores_gemma":[0.998132,0.00007293155,0.000018562614,0.00041013912,0.0013348005,0.000031556345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017803863,0.00009947632,0.00012628484,0.00034591494,0.0005435055,0.0006398403,0.00029575307,0.000031783,0.00018970495],"category_scores_gemma":[0.0007448018,0.00007802914,0.000026307554,0.0015101088,0.00017900846,0.0016166304,0.00019198119,0.00030289675,0.0012416827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020612516,0.00031443703,0.009042925,0.000049079754,0.00008118075,0.0000583743,0.00024899744,0.15295485,0.001942085,0.81695163,0.013985289,0.0041650287],"study_design_scores_gemma":[0.0032276658,0.00012819906,0.000749523,0.00011208862,0.000112381866,0.000016162347,0.0048637204,0.268516,0.001425204,0.045641717,0.6742884,0.0009189483],"about_ca_topic_score_codex":0.0017606628,"about_ca_topic_score_gemma":0.0055378797,"teacher_disagreement_score":0.7713099,"about_ca_system_score_codex":0.00008113495,"about_ca_system_score_gemma":0.00015917404,"threshold_uncertainty_score":0.999536},"labels":[],"label_agreement":null},{"id":"W1967038038","doi":"10.1287/opre.51.1.160.12799","title":"Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dynamic programming; Sizing; Lead time; Mathematical optimization; Computer science; Stochastic programming; Fixed cost; Production (economics); Holding cost; Operations research; Operations management; Mathematics; Economics; Microeconomics","score_opus":0.06871421562970181,"score_gpt":0.3307891546678844,"score_spread":0.2620749390381826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967038038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93120205,0.000520095,0.0060352874,0.0049678325,0.00027542634,0.0009869282,0.0000051814122,0.00013253836,0.055874646],"genre_scores_gemma":[0.9895658,0.000023999579,0.00050290965,0.00078190817,0.0004068084,0.00009647688,0.000027622707,0.00003512665,0.008559364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998252,0.00008900456,0.00022665269,0.00035699978,0.0005441108,0.00053124747],"domain_scores_gemma":[0.9992428,0.000105644496,0.000022874574,0.0003058602,0.000285569,0.000037279402],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010860922,0.00016810665,0.00015491186,0.0005431327,0.0010783143,0.0012875344,0.00022956853,0.000058991103,0.00071824994],"category_scores_gemma":[0.00035377292,0.00015687496,0.00003993421,0.00063959166,0.00019665097,0.0009954732,0.0002790921,0.00028682454,0.0005576627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010146693,0.00048583193,0.0032177945,0.00024414342,0.0001196222,0.000019489362,0.0010776113,0.11459039,0.003071293,0.83864605,0.031891942,0.006534344],"study_design_scores_gemma":[0.0043967157,0.0002844105,0.011572456,0.00042987103,0.00012299375,0.0000148708095,0.03777731,0.79383034,0.0006229588,0.003754384,0.14550698,0.0016867458],"about_ca_topic_score_codex":0.0018144036,"about_ca_topic_score_gemma":0.000792991,"teacher_disagreement_score":0.8348917,"about_ca_system_score_codex":0.00010823682,"about_ca_system_score_gemma":0.000059534053,"threshold_uncertainty_score":0.99974924},"labels":[],"label_agreement":null},{"id":"W1968204503","doi":"10.1287/opre.1080.0530","title":"Technical Note—Optimal Dynamic Joint Inventory-Pricing Control for Multiplicative Demand with Fixed Order Costs and Lost Sales","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Memorial University of Newfoundland","funders":"","keywords":"Fixed cost; Dynamic pricing; Profit (economics); Holding cost; Multiplicative function; Inventory control; Time horizon; Lost sales; Variable cost; Order (exchange); Economics; Microeconomics; Mathematical optimization; Mathematics; Operations management","score_opus":0.0528497840669696,"score_gpt":0.3201161866071586,"score_spread":0.267266402540189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968204503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6341537,0.00035124144,0.3401708,0.010042757,0.00011823737,0.0065790648,0.00003457181,0.00020344008,0.0083461795],"genre_scores_gemma":[0.9908639,0.000043011096,0.0058612823,0.00050026056,0.00020078698,0.00058388925,0.0000902811,0.00003611223,0.0018204735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984356,0.00004811055,0.00024976092,0.00042225677,0.00042105038,0.0004231796],"domain_scores_gemma":[0.9987773,0.00012239495,0.00003790915,0.00029272487,0.0007323809,0.00003732444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396881,0.00016654402,0.00020995011,0.00042154954,0.0010414736,0.00030329416,0.00020223312,0.00007032477,0.00010311938],"category_scores_gemma":[0.00042984562,0.00013482843,0.00003919475,0.00057027524,0.00039056534,0.0006059958,0.00019570238,0.00024543304,0.00014467096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052968864,0.006228569,0.122894555,0.00309352,0.0011204439,0.00040904983,0.004749408,0.1539701,0.2165101,0.2537623,0.20043904,0.031526],"study_design_scores_gemma":[0.0037853175,0.00016693515,0.011350128,0.000103423416,0.000042894648,0.000011350815,0.0009359145,0.96005327,0.00019924698,0.0000776097,0.022907913,0.0003660231],"about_ca_topic_score_codex":0.0003370344,"about_ca_topic_score_gemma":0.0013612385,"teacher_disagreement_score":0.80608314,"about_ca_system_score_codex":0.00015783151,"about_ca_system_score_gemma":0.00007358411,"threshold_uncertainty_score":0.80102783},"labels":[],"label_agreement":null},{"id":"W1968355947","doi":"10.1287/opre.1090.0741","title":"Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1895,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Probabilistic logic; Ambiguity; Portfolio optimization; Stochastic programming; Portfolio; Robust optimization; Covariance; Moment (physics); Covariance matrix; Range (aeronautics); Probability distribution; Gaussian; Optimization problem; Mathematics; Algorithm; Finance; Artificial intelligence; Statistics","score_opus":0.19840338857256148,"score_gpt":0.45345395033015923,"score_spread":0.25505056175759777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968355947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017332032,0.0000078372195,0.9696411,0.008673959,0.00009810441,0.0013008598,0.00025377172,0.000042419233,0.0026499059],"genre_scores_gemma":[0.8636986,0.00006555849,0.12797654,0.00013169087,0.00021895718,0.0005363431,0.00346794,0.000025183122,0.0038792023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955615,0.0002748469,0.00050883566,0.0008515954,0.0024238038,0.00037942134],"domain_scores_gemma":[0.99478203,0.00030283,0.000052513675,0.0016555395,0.0029391074,0.00026795585],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004219231,0.000136899,0.00016117352,0.00047565554,0.0010111821,0.0010870805,0.0013710605,0.00010595374,0.0008217488],"category_scores_gemma":[0.00089719455,0.0000969395,0.000023329438,0.0027849763,0.00017740161,0.00088621,0.0003834665,0.0004139746,0.0005197996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023841045,0.00011117101,0.0005987646,8.935868e-7,0.000008678965,5.2451463e-7,0.00011942577,0.9730078,0.0007822291,0.013820614,0.006969972,0.004556082],"study_design_scores_gemma":[0.00022468457,0.00008614289,0.0014150076,0.0000053849776,0.0000049120267,0.000005353417,0.00021122825,0.96149015,0.00007377277,0.0004233588,0.035923664,0.00013632003],"about_ca_topic_score_codex":0.00046791192,"about_ca_topic_score_gemma":0.00544656,"teacher_disagreement_score":0.8463665,"about_ca_system_score_codex":0.00010782203,"about_ca_system_score_gemma":0.0005831501,"threshold_uncertainty_score":0.9999499},"labels":[],"label_agreement":null},{"id":"W1969327924","doi":"10.1287/opre.2013.1248","title":"Combinatorial Benders' Cuts for the Strip Packing Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bounding overwatch; Packing problems; Benchmark (surveying); Scheduling (production processes); Heuristic; Mathematical optimization; Benders' decomposition; Computer science; Heuristics; Bin packing problem; Set (abstract data type); Preprocessor; Algorithm; Container (type theory); Set packing; Mathematics; Artificial intelligence","score_opus":0.0674461263503884,"score_gpt":0.3422510084130599,"score_spread":0.2748048820626715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969327924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029691125,0.0003165211,0.87872845,0.004615261,0.00201513,0.002957553,0.00003919589,0.0004951482,0.10786361],"genre_scores_gemma":[0.993718,0.000067174326,0.0040138834,0.000031356103,0.0003362412,0.0003033297,0.000040130464,0.000032768738,0.0014570986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991048,0.000087972454,0.00014150854,0.00012331292,0.0002583961,0.00028403132],"domain_scores_gemma":[0.9990617,0.000367808,0.0000042280817,0.00024137417,0.0002717093,0.000053195385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087293,0.000072836265,0.00007254749,0.0000952672,0.000679765,0.0003234018,0.00020664923,0.000061031442,0.00009137813],"category_scores_gemma":[0.00018650698,0.000055613044,0.000030779298,0.00032166374,0.000051188665,0.00011940146,0.000030342722,0.0002472229,0.00005574595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003826489,0.000019480154,0.00003736382,0.000032499745,0.000021788868,8.036543e-8,0.000495293,0.8276622,0.00045974957,0.15377286,0.012616507,0.004878336],"study_design_scores_gemma":[0.00041471227,0.000046566533,0.000031025967,0.000014134096,0.0000037884877,6.838497e-7,0.00011346182,0.86817545,0.00054247235,0.0016752292,0.12890156,0.00008090717],"about_ca_topic_score_codex":0.000032812564,"about_ca_topic_score_gemma":0.00010055332,"teacher_disagreement_score":0.9907489,"about_ca_system_score_codex":0.00004514353,"about_ca_system_score_gemma":0.000044511544,"threshold_uncertainty_score":0.52282715},"labels":[],"label_agreement":null},{"id":"W1970355999","doi":"10.1287/opre.1050.0234","title":"Selected Topics in Column Generation","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1084,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Column (typography); Perspective (graphical); Integer programming; Computer science; Dual (grammatical number); Linear programming; Decomposition; Point (geometry); Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Algorithm","score_opus":0.08886315424571074,"score_gpt":0.393188984849525,"score_spread":0.3043258306038143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970355999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8878965,0.00019493903,0.095174156,0.0019945889,0.00013622786,0.00051372265,0.0000050609947,0.00026100286,0.01382385],"genre_scores_gemma":[0.84629667,0.00007394569,0.1492654,0.00002663841,0.00041238486,0.0000882588,0.0000391667,0.00002269407,0.0037748846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990349,0.00020893157,0.00017928099,0.00012200078,0.00021770144,0.0002371774],"domain_scores_gemma":[0.9994796,0.000040061223,0.000002208469,0.0001693464,0.00026382162,0.00004496438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078355893,0.000054552267,0.000066657674,0.00024607196,0.00015194686,0.00012602189,0.00010183201,0.00006981999,0.00026230206],"category_scores_gemma":[0.00028149862,0.000063129315,0.000009377187,0.0011237588,0.000020997839,0.00019315613,0.000020324442,0.00028865633,0.00011838752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6544826e-7,0.00001710715,0.0004029769,0.0000035929063,0.0000026267476,6.6794706e-7,0.0002772106,0.96837544,0.016759647,0.00062135473,0.0020490289,0.0114897825],"study_design_scores_gemma":[0.00015168157,0.000009975788,0.0015445488,0.00000409481,5.749879e-7,0.000001464266,0.00002119201,0.97894037,0.010235224,0.0000040896025,0.009021394,0.00006537659],"about_ca_topic_score_codex":0.000048499205,"about_ca_topic_score_gemma":0.002064953,"teacher_disagreement_score":0.054091226,"about_ca_system_score_codex":0.0002127083,"about_ca_system_score_gemma":0.00007154743,"threshold_uncertainty_score":0.28720236},"labels":[],"label_agreement":null},{"id":"W1970974711","doi":"10.1287/opre.1050.0218","title":"The Black and White Traveling Salesman Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Combinatorics; Mathematics; Vertex (graph theory); Traveling purchaser problem; 2-opt; Bounded function; Vehicle routing problem; Branch and cut; Mathematical optimization; Hamiltonian path; Integer programming; Discrete mathematics; Graph; Computer science; Routing (electronic design automation)","score_opus":0.03776718920947337,"score_gpt":0.3386011763200925,"score_spread":0.30083398711061915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970974711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60639584,0.0005715982,0.25531736,0.003973988,0.0001333338,0.0011404842,0.000011823109,0.0004756237,0.13197994],"genre_scores_gemma":[0.91453683,0.00016417695,0.079707086,0.000005981811,0.00012095613,0.000049016027,0.0000097981165,0.000029384199,0.005376789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990836,0.00016876763,0.00015796731,0.000116454234,0.00021437574,0.00025886676],"domain_scores_gemma":[0.99945927,0.00015771565,0.0000030418103,0.00018015219,0.00016093848,0.000038871352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013861149,0.000060693274,0.000053794498,0.00006402884,0.00067352934,0.00037030567,0.000114622395,0.000042999392,0.0000237422],"category_scores_gemma":[0.00007362287,0.0000478117,0.000011796398,0.0003660653,0.00012622417,0.00009562285,0.000034746183,0.0002558414,0.000040859977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4359484e-7,0.000005584778,0.0006479214,0.000011133975,0.000004854232,6.62577e-7,0.00024133269,0.98660064,0.002928578,0.0050381846,0.0012576887,0.0032625038],"study_design_scores_gemma":[0.00010856617,0.000009590062,0.0032650302,0.0000101070755,0.0000016370813,0.000002907762,0.00015234077,0.9910462,0.0008904777,0.00028225954,0.0041625896,0.00006829453],"about_ca_topic_score_codex":0.00004929995,"about_ca_topic_score_gemma":0.00032448338,"teacher_disagreement_score":0.308141,"about_ca_system_score_codex":0.000039449103,"about_ca_system_score_gemma":0.000028569215,"threshold_uncertainty_score":0.5180311},"labels":[],"label_agreement":null},{"id":"W1973643330","doi":"10.1287/opre.1080.0639","title":"<b>Technical note</b>—Linear Inflation Rules for the Random Yield Problem: Analysis and Computations","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Heuristics; Heuristic; Multiplicative function; Computer science; Mathematical optimization; Class (philosophy); Inflation (cosmology); Computation; Simple (philosophy); Algorithm; Mathematics; Artificial intelligence","score_opus":0.07899981008836447,"score_gpt":0.3603235500987226,"score_spread":0.2813237400103581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973643330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013431734,0.00019863369,0.9116253,0.050048213,0.000109983404,0.003228956,0.000012834204,0.00015337205,0.021190934],"genre_scores_gemma":[0.98642987,0.00005470714,0.010099011,0.0010733912,0.0006281181,0.00029947673,0.00018568285,0.00001087556,0.0012188745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894077,0.000030268538,0.00023346725,0.00022936235,0.00033683277,0.00022932202],"domain_scores_gemma":[0.9988677,0.00044247502,0.000023911607,0.00023278932,0.0004189175,0.000014193154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014765048,0.00008832635,0.00012820125,0.0005625929,0.0012023562,0.0006780964,0.00020151229,0.00004739066,0.00015674053],"category_scores_gemma":[0.00051269605,0.00006350223,0.00007963066,0.0011930518,0.00009518762,0.0005088624,0.000092376526,0.00015765085,0.0000621014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002380874,0.00044279752,0.0034988872,0.00014628792,0.0002563961,0.0000029094263,0.00038541202,0.24688205,0.00259801,0.6271571,0.0536119,0.064780146],"study_design_scores_gemma":[0.0006788285,0.000029870816,0.01081293,0.000015051754,0.00018157203,2.8426786e-7,0.00018876222,0.93852425,0.00002691997,0.004881435,0.044544283,0.000115841474],"about_ca_topic_score_codex":0.00045620606,"about_ca_topic_score_gemma":0.0017206144,"teacher_disagreement_score":0.97299814,"about_ca_system_score_codex":0.000028468849,"about_ca_system_score_gemma":0.000027936001,"threshold_uncertainty_score":0.9247673},"labels":[],"label_agreement":null},{"id":"W1974130218","doi":"10.1287/opre.1070.0396","title":"Locating a Circle on a Sphere","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Great circle; Surface (topology); Computer science; Mathematical optimization; Unit circle; Mathematics; Combinatorics; Geometry","score_opus":0.12046695772042208,"score_gpt":0.37993483815600204,"score_spread":0.25946788043557995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974130218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.608575,0.00003833455,0.0070797238,0.0056935586,0.00031927865,0.000655608,0.0000012109258,0.00014861862,0.3774887],"genre_scores_gemma":[0.9909798,0.0000035917196,0.00029914136,0.0010335047,0.0005207588,0.00004363107,0.000025603924,0.000013342613,0.007080655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852544,0.000018359706,0.0002248354,0.00026397628,0.00057488563,0.00039249982],"domain_scores_gemma":[0.99913955,0.000028273376,0.0000058455435,0.00034577042,0.00046139225,0.000019187937],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0024234932,0.000077742836,0.00006942831,0.00037423996,0.00072819553,0.00036243355,0.00024393579,0.000037184018,0.0021443395],"category_scores_gemma":[0.0004300141,0.00007957922,0.000032093518,0.0011831408,0.00006071495,0.00048290595,0.00013721114,0.00022048916,0.00792968],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010772876,0.0009840102,0.0025598728,0.00035495416,0.000046004032,0.000029588651,0.00052321824,0.091759786,0.0034702234,0.60066617,0.048911598,0.2505868],"study_design_scores_gemma":[0.0012222246,0.00009306771,0.05921974,0.00011249838,0.000018050276,0.0000018066505,0.008343036,0.34657794,0.001031392,0.0015285892,0.5811401,0.0007115505],"about_ca_topic_score_codex":0.004732354,"about_ca_topic_score_gemma":0.015986823,"teacher_disagreement_score":0.5991376,"about_ca_system_score_codex":0.000067606015,"about_ca_system_score_gemma":0.000032340962,"threshold_uncertainty_score":0.99876785},"labels":[],"label_agreement":null},{"id":"W1981854401","doi":"10.1287/opre.1080.0564","title":"The Innovest Austrian Pension Fund Financial Planning Model InnoALM","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pension; Stochastic programming; Computer science; Benchmark (surveying); Time horizon; Stochastic modelling; Economics; Financial market; Cash; Mutual fund; Mathematical optimization; Finance; Econometrics; Mathematics","score_opus":0.3235202847495317,"score_gpt":0.37457135404437253,"score_spread":0.05105106929484082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981854401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19199666,0.0021032973,0.7613665,0.0064234408,0.00025500913,0.00088135694,0.00018943672,0.000059647857,0.036724668],"genre_scores_gemma":[0.9912356,0.00014773886,0.002504284,0.00010875119,0.00023434067,0.000295516,0.00003014427,0.000017950168,0.00542564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986755,0.000010926693,0.0004383457,0.00034300896,0.00011049914,0.00042167323],"domain_scores_gemma":[0.9990499,0.00012196391,0.00004220282,0.00042092384,0.00028329945,0.00008169822],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00088529236,0.000098917924,0.0001589549,0.00022164974,0.003286512,0.00017411412,0.0003919685,0.000101143356,0.0000333172],"category_scores_gemma":[0.0008381317,0.00009032072,0.000040592447,0.0010499652,0.00026568185,0.00020879536,0.00014368408,0.00043812976,0.00069594925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119755605,0.000050925126,0.0005098552,0.0000029032713,0.0000040743466,0.0000026313235,0.0003806349,0.008170998,0.00007761735,0.98658,0.0036076605,0.0006007344],"study_design_scores_gemma":[0.0009625999,0.0001997728,0.023743536,0.000029714374,0.0000032242879,0.00003965288,0.00025038345,0.528346,0.00015697241,0.241249,0.2044716,0.0005475453],"about_ca_topic_score_codex":0.0004010249,"about_ca_topic_score_gemma":0.00016864894,"teacher_disagreement_score":0.799239,"about_ca_system_score_codex":0.00009873311,"about_ca_system_score_gemma":0.00030824865,"threshold_uncertainty_score":0.99801105},"labels":[],"label_agreement":null},{"id":"W1983931196","doi":"10.1287/opre.51.5.771.16749","title":"A Three-Stage Model for a Decentralized Distribution System of Retailers","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Residual; Profit (economics); Stage (stratigraphy); Transshipment (information security); Supply chain; Third stage; Supply and demand; Operations research; Microeconomics; Computer science; Business; Economics; Mathematics; Marketing","score_opus":0.4011792634695643,"score_gpt":0.5137170311918997,"score_spread":0.11253776772233542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983931196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060107563,0.000039602102,0.93593574,0.00046196216,0.000040933042,0.0008661432,0.0004039423,0.000020937792,0.002123164],"genre_scores_gemma":[0.9859737,0.0000066334865,0.0069961925,0.000006257703,0.000013209174,0.00049685326,0.000052006468,0.0000072273137,0.006447917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975987,0.00034648375,0.000492503,0.00032430643,0.0009738795,0.0002641277],"domain_scores_gemma":[0.9969363,0.0007153723,0.000045997804,0.0006159052,0.0015816103,0.00010481987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00723141,0.000067707515,0.00015773183,0.00016274286,0.0008268787,0.00019310652,0.0004290113,0.000065874294,0.00027216077],"category_scores_gemma":[0.0038621249,0.00005297119,0.00009157959,0.0011956741,0.00020996721,0.00022320253,0.000037966307,0.00012468486,0.00011866207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000299111,0.000054678316,0.00008642335,0.000007224477,0.000006505341,1.13622704e-7,0.00016774928,0.059945326,0.0022193058,0.933928,0.0029117172,0.00064300833],"study_design_scores_gemma":[0.00039554128,0.00003379192,0.00005518467,0.0000097046,0.0000048011148,0.0000019433407,0.0021192438,0.94931173,0.0052921707,0.024552956,0.018153168,0.00006974819],"about_ca_topic_score_codex":0.000026813392,"about_ca_topic_score_gemma":0.00019382442,"teacher_disagreement_score":0.9289396,"about_ca_system_score_codex":0.00010198407,"about_ca_system_score_gemma":0.00031308332,"threshold_uncertainty_score":0.6359766},"labels":[],"label_agreement":null},{"id":"W1987222495","doi":"10.1287/opre.1080.0532","title":"Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Outsourcing; Computer science; Queueing theory; Context (archaeology); Holding cost; Mathematical optimization; Scheduling (production processes); Operations research; Order (exchange); Resource allocation; Control (management); Distributed computing; Computer network; Business; Mathematics","score_opus":0.032219875897832935,"score_gpt":0.30815311910021703,"score_spread":0.2759332432023841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987222495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72687,0.00012007471,0.2512139,0.00209339,0.00006085045,0.0012094846,0.000018046474,0.00013472175,0.018279517],"genre_scores_gemma":[0.992316,0.0000071291443,0.0038780505,0.00010782589,0.00008809991,0.00016289527,0.000027208029,0.000023808529,0.0033889932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986362,0.00006405284,0.0002474014,0.00025781014,0.0005008447,0.00029369173],"domain_scores_gemma":[0.99814445,0.00008802086,0.000037190937,0.00043009516,0.0012774662,0.00002277138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061014964,0.00010544939,0.00020394311,0.0005238577,0.00079096755,0.00009628104,0.00025428485,0.000037249458,0.00018177206],"category_scores_gemma":[0.00019317617,0.00008828673,0.00004065985,0.0019800176,0.000148946,0.00040111213,0.00007622576,0.00016856882,0.00031812632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010181122,0.00006509652,0.0021818564,0.00007150238,0.00006288873,0.000017035394,0.00009821065,0.9110029,0.00081683684,0.08524947,0.00013719819,0.00019519917],"study_design_scores_gemma":[0.0012174485,0.000045758337,0.003214802,0.000120101045,0.00004932825,0.000009278833,0.0010451484,0.9892496,0.000037103557,0.00022349968,0.004541456,0.00024646934],"about_ca_topic_score_codex":0.0019737456,"about_ca_topic_score_gemma":0.007350281,"teacher_disagreement_score":0.26544598,"about_ca_system_score_codex":0.000100170524,"about_ca_system_score_gemma":0.0001143019,"threshold_uncertainty_score":0.6083563},"labels":[],"label_agreement":null},{"id":"W1988154361","doi":"10.1287/opre.1080.0585","title":"Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Staffing; Service level; Computer science; Service-level agreement; Profit (economics); Quality of service; Operations research; Abandonment (legal); Service level objective; Service (business); Service quality; Time horizon; Operations management; Business; Microeconomics; Economics; Computer network; Service provider; Finance; Mathematics; Marketing; Service design","score_opus":0.11190395337215261,"score_gpt":0.3681207014365225,"score_spread":0.2562167480643699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988154361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8526729,0.000017348995,0.10534514,0.028721021,0.00010200096,0.0026740448,0.000035474946,0.00015063978,0.010281459],"genre_scores_gemma":[0.9719747,0.000003065845,0.016607365,0.0036390692,0.0003956777,0.00024870678,0.00011592373,0.00003362372,0.0069818925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984242,0.000028278288,0.00020181072,0.00037319295,0.0004821822,0.0004903757],"domain_scores_gemma":[0.9984896,0.000042647804,0.000027131822,0.00035903664,0.0010476377,0.000033907418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008415332,0.00013422807,0.00014781262,0.00049021887,0.00071044336,0.0006007757,0.0004150664,0.00003032486,0.0001305583],"category_scores_gemma":[0.00020021816,0.00011325309,0.0000381172,0.0011754138,0.00002475788,0.00095837674,0.00013509598,0.00015645644,0.00034282042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020919011,0.0006520564,0.004371508,0.00034907676,0.00038440368,0.000057613957,0.0011889318,0.7290006,0.035340432,0.16221869,0.011601765,0.05274301],"study_design_scores_gemma":[0.0077827033,0.0006103747,0.007093652,0.00078833173,0.00024589465,0.0000073535375,0.0035715252,0.8548681,0.0052123526,0.014541946,0.10333017,0.0019476009],"about_ca_topic_score_codex":0.00061436434,"about_ca_topic_score_gemma":0.0024818268,"teacher_disagreement_score":0.14767674,"about_ca_system_score_codex":0.00009363729,"about_ca_system_score_gemma":0.00003914793,"threshold_uncertainty_score":0.5793294},"labels":[],"label_agreement":null},{"id":"W1988297777","doi":"10.1287/opre.51.2.228.12786","title":"An Oil Pipeline Design Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Port (circuit theory); Integer programming; Pipeline (software); Mathematical optimization; Set (abstract data type); Integer (computer science); Computer science; Connection (principal bundle); Variable (mathematics); Submarine pipeline; Branch and cut; Mathematics; Engineering; Geometry","score_opus":0.11329738327680722,"score_gpt":0.4025412408418159,"score_spread":0.2892438575650087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988297777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635239,0.00010561262,0.9577064,0.00011520781,0.000060737075,0.00016544899,0.0000029953533,0.00025940212,0.036948994],"genre_scores_gemma":[0.22809768,0.000081373415,0.7665103,0.000015050924,0.00005561471,0.000110481014,0.000012785683,0.0000439027,0.0050728014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981393,0.0008667905,0.00018403432,0.00017415715,0.0003045348,0.0003311449],"domain_scores_gemma":[0.9990566,0.00012512846,0.0000028781205,0.00035394193,0.0003383741,0.00012310335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029571464,0.000082551414,0.00008326778,0.00020047011,0.00032755875,0.00020581612,0.00017158163,0.00006989285,0.00048415404],"category_scores_gemma":[0.00038419268,0.00008348073,0.000015286663,0.0007446233,0.00004277921,0.0002482697,0.000011613277,0.00030756596,0.00020455598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011412185,0.00003116938,0.000022192773,0.000010231389,0.0000039682955,0.0000014962716,0.00021757431,0.97222185,0.014683233,0.0037776905,0.0012100842,0.007819363],"study_design_scores_gemma":[0.00015650124,0.00003202013,0.000011121499,0.00000810573,0.0000016592244,0.000005217528,0.000090432855,0.9747919,0.019123541,0.000096515825,0.0055803256,0.000102655045],"about_ca_topic_score_codex":0.000016438169,"about_ca_topic_score_gemma":0.000022421786,"teacher_disagreement_score":0.22346243,"about_ca_system_score_codex":0.00008130896,"about_ca_system_score_gemma":0.000110337,"threshold_uncertainty_score":0.5301147},"labels":[],"label_agreement":null},{"id":"W1988638622","doi":"10.1287/opre.1110.0969","title":"TECHNICAL NOTE—An Optimal Policy for Joint Dynamic Price and Lead-Time Quotation","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Universidade de Macau; National Science Foundation","keywords":"Lead time; Joint (building); Function (biology); Value (mathematics); Lead (geology); Economics; Bellman equation; Computer science; Variable (mathematics); Mathematical optimization; Dynamic programming; Mathematical economics; Microeconomics; Mathematics; Operations management","score_opus":0.11477036001542965,"score_gpt":0.36630565345224014,"score_spread":0.25153529343681047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988638622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33822447,0.00019410705,0.3118473,0.02210853,0.00046632657,0.008845276,0.000040661485,0.000767951,0.3175054],"genre_scores_gemma":[0.9603815,0.000020273463,0.030436788,0.0006367674,0.0006833801,0.00053029024,0.00017007363,0.000044408906,0.007096486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987908,0.000036314334,0.00020848007,0.00031405158,0.00029978534,0.000350548],"domain_scores_gemma":[0.99928623,0.00002920127,0.000021276366,0.0002727666,0.00036345737,0.00002703454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243,0.00010580348,0.000110988105,0.00066372723,0.0005904424,0.00044164018,0.00021207912,0.00006284944,0.0005447411],"category_scores_gemma":[0.00035434644,0.00009905534,0.000036058853,0.0005375345,0.00012752032,0.001155252,0.00021576695,0.00015266039,0.0003663507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005015512,0.0019690325,0.00031066305,0.0006768176,0.000075200514,0.000020185957,0.0028435006,0.003001898,0.12590015,0.7171198,0.02981472,0.11776644],"study_design_scores_gemma":[0.00064826803,0.00013580416,0.0027447552,0.000024590761,0.00001715096,0.0000022519864,0.0006521015,0.9617991,0.0004050962,0.0018032179,0.031528577,0.00023912977],"about_ca_topic_score_codex":0.0009324852,"about_ca_topic_score_gemma":0.0003928298,"teacher_disagreement_score":0.95879716,"about_ca_system_score_codex":0.00011330931,"about_ca_system_score_gemma":0.00006287997,"threshold_uncertainty_score":0.5964533},"labels":[],"label_agreement":null},{"id":"W1990099879","doi":"10.1287/opre.48.5.745.12412","title":"Topological Design of Two-Level Telecommunication Networks with Modular Switches","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Heuristic; Multiplexer; Mathematical optimization; Modular design; Topology (electrical circuits); Greedy algorithm; Steiner tree problem; Tabu search; Network planning and design; Linear programming; Network topology; Algorithm; Mathematics; Computer network; Multiplexing; Telecommunications","score_opus":0.10332006569717207,"score_gpt":0.34418479393032864,"score_spread":0.24086472823315658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990099879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15976596,0.00057011517,0.8359448,0.0002575882,0.000010284184,0.00039985217,0.0000026238247,0.00026028775,0.0027885148],"genre_scores_gemma":[0.7089317,0.0007520256,0.28992558,0.0000046489804,0.000019576664,0.00009792965,0.000007206749,0.000014924212,0.0002464288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906087,0.00009157789,0.00017703122,0.00014156544,0.00021443916,0.00031452544],"domain_scores_gemma":[0.9990743,0.0002114511,0.000004006126,0.00052303006,0.00014451372,0.000042727224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038159356,0.00009156535,0.00013176032,0.00009027927,0.00018535463,0.000037652047,0.00037096356,0.00010080921,0.00027314722],"category_scores_gemma":[0.00007272965,0.00007229254,0.000015844327,0.0006204637,0.00030770607,0.00018643455,0.000050291434,0.0004927145,0.000035339206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013214391,0.000029686473,0.000031954914,0.0000033085842,0.000013256652,0.0000013366273,0.000026428266,0.966851,0.0027506466,0.0048077353,0.000049656926,0.025421808],"study_design_scores_gemma":[0.00018204529,0.00013575096,0.00029409723,0.000019220486,0.000002879456,0.0000043493824,0.00006703319,0.9953429,0.0025428883,0.0011080425,0.00020240888,0.000098400684],"about_ca_topic_score_codex":0.00002179701,"about_ca_topic_score_gemma":0.00004747811,"teacher_disagreement_score":0.5491657,"about_ca_system_score_codex":0.00005790801,"about_ca_system_score_gemma":0.000022138329,"threshold_uncertainty_score":0.29907703},"labels":[],"label_agreement":null},{"id":"W1991473881","doi":"10.1287/opre.50.6.1032.349","title":"Brownian Approximations of Multiclass Open-Queueing Networks","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; National Science Foundation","keywords":"Queueing theory; Computer science; Queue; Limit (mathematics); Moment (physics); Brownian motion; Heavy traffic approximation; Mathematical optimization; Layered queueing network; FIFO (computing and electronics); Applied mathematics; Mathematics; Computer network; Discrete mathematics; Mathematical analysis","score_opus":0.12657399318451437,"score_gpt":0.3612122193316534,"score_spread":0.234638226147139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991473881","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27808332,0.00054461113,0.19322415,0.011249967,0.00034583587,0.0031837143,0.000014174553,0.00033247392,0.51302177],"genre_scores_gemma":[0.989752,0.000018797395,0.0039917575,0.0001628671,0.00029548272,0.00010142507,0.000024861998,0.000023262455,0.005629536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870396,0.00008388891,0.0002964024,0.00025910584,0.00033894897,0.00031770268],"domain_scores_gemma":[0.9986788,0.00014168014,0.000041918687,0.00046864018,0.0006514998,0.000017476696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012724076,0.00009465106,0.00016556159,0.00046402743,0.00086017285,0.00067143573,0.0006574701,0.00005354995,0.002033977],"category_scores_gemma":[0.00069743017,0.00009017085,0.00005004745,0.0018367044,0.00016542422,0.0018923655,0.000495773,0.00027731634,0.00046165008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013742332,0.0003292586,0.00063415995,0.000047414902,0.000053560034,0.0000051165302,0.0002022297,0.56697106,0.002367716,0.41524863,0.00443128,0.0096958615],"study_design_scores_gemma":[0.00025453416,0.0000063556336,0.00011322294,0.00003259472,0.000014558585,6.531094e-7,0.0003317417,0.9879164,0.00011758425,0.0016487116,0.009456824,0.000106814725],"about_ca_topic_score_codex":0.0007761004,"about_ca_topic_score_gemma":0.00076513865,"teacher_disagreement_score":0.71166867,"about_ca_system_score_codex":0.000042100655,"about_ca_system_score_gemma":0.000013143273,"threshold_uncertainty_score":0.9988783},"labels":[],"label_agreement":null},{"id":"W1991548888","doi":"10.1287/opre.2014.1307","title":"An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université Laval","funders":"","keywords":"Bin packing problem; Packing problems; Mathematical optimization; Algorithm; Set packing; Benchmark (surveying); Branch and cut; Benders' decomposition; Preprocessor; Integer programming; Cutting stock problem; Relaxation (psychology); Heuristics; Computer science; Mathematics; Exact solutions in general relativity; Integer (computer science); Optimization problem; Bin","score_opus":0.0416455721630172,"score_gpt":0.3361884072885659,"score_spread":0.2945428351255487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991548888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008509349,0.000051219413,0.9842901,0.0004455524,0.00011223407,0.0009312357,0.00004212221,0.00017757906,0.0054405765],"genre_scores_gemma":[0.85995096,0.000006116979,0.1391225,0.000048700724,0.00017053401,0.0002271889,0.00009868562,0.00003993009,0.0003354025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988074,0.00012199344,0.0001605086,0.0001972405,0.00035948146,0.0003534033],"domain_scores_gemma":[0.9989106,0.00034298137,0.0000074820205,0.00024774327,0.00038899982,0.00010217961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206418,0.00010956083,0.00009502714,0.000128784,0.0008278057,0.00034528135,0.00018250404,0.00004622171,0.0002708994],"category_scores_gemma":[0.000043212767,0.00007512651,0.000024620938,0.00033475278,0.00017227278,0.00022784875,0.000019884536,0.0002893749,0.00003188619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034564105,0.000019771722,0.000067609995,0.000011306497,0.000023500306,5.16984e-7,0.00021160625,0.92928785,0.0012246758,0.0059360177,0.00026338565,0.06295033],"study_design_scores_gemma":[0.00046790863,0.000098636316,0.0000716455,0.00003066808,0.0000058637665,0.000013407083,0.00008834985,0.99606293,0.0007162737,0.00009532561,0.0022308005,0.00011818594],"about_ca_topic_score_codex":0.000023717197,"about_ca_topic_score_gemma":0.00016507991,"teacher_disagreement_score":0.85144156,"about_ca_system_score_codex":0.000043477914,"about_ca_system_score_gemma":0.000097957636,"threshold_uncertainty_score":0.6366896},"labels":[],"label_agreement":null},{"id":"W1994554484","doi":"10.1287/opre.48.6.939.12393","title":"Global Stochastic Optimization with Low-Dispersion Point Sets","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Smoothness; Basis (linear algebra); Euclidean space; Mathematics; Mathematical optimization; Bounded function; Domain (mathematical analysis); Rate function; Function (biology); Large deviations theory; Point (geometry); Space (punctuation); Stochastic optimization; Applied mathematics; Sample (material); Computer science; Statistics; Mathematical analysis","score_opus":0.021883795247685297,"score_gpt":0.3426205580910039,"score_spread":0.3207367628433186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994554484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026676902,0.000044725923,0.99149704,0.0010990608,0.000051940828,0.0005874885,0.000012916404,0.00014340408,0.0038957351],"genre_scores_gemma":[0.17808914,0.000052288367,0.8187493,0.00013277863,0.00005110739,0.00013386279,0.000052229556,0.000020734758,0.0027185266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977906,0.0002338694,0.00019654063,0.00056222785,0.00077793497,0.00043885657],"domain_scores_gemma":[0.998269,0.00006656008,0.000014133378,0.00062107964,0.00084857683,0.00018063538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038660286,0.00014554097,0.00012162552,0.00018388625,0.0008096981,0.00046127528,0.00059259223,0.000064718864,0.0008157895],"category_scores_gemma":[0.00011683309,0.00012490003,0.000027482096,0.0020369105,0.0001510528,0.0013719746,0.00014066095,0.00020871851,0.00034091392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018207258,0.00011463186,0.000009138012,0.0000023956727,0.00000721599,0.000009396861,0.00022666347,0.97586435,0.000022976381,0.0027262967,0.000119659875,0.02087904],"study_design_scores_gemma":[0.0005909013,0.00015145108,0.00019560897,0.000024518948,0.0000020140042,0.000039186696,0.00007138557,0.99845755,0.00006211525,0.00009747486,0.0001489347,0.00015883514],"about_ca_topic_score_codex":0.00011528704,"about_ca_topic_score_gemma":0.000111707996,"teacher_disagreement_score":0.17542146,"about_ca_system_score_codex":0.00035010386,"about_ca_system_score_gemma":0.00030558757,"threshold_uncertainty_score":0.8932323},"labels":[],"label_agreement":null},{"id":"W1994720654","doi":"10.1287/opre.1120.1070","title":"Overflow Networks: Approximations and Implications to Call Center Outsourcing","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Call management; Context (archaeology); Call Admission Control; Call control; Pooling; Heuristics; Computer network; Buffer overflow; Service (business); Operations research; Telecommunications; Mathematics; Artificial intelligence; Operating system; Wireless network","score_opus":0.05606187948473124,"score_gpt":0.35077038680602535,"score_spread":0.2947085073212941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994720654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37862083,0.00033779256,0.551306,0.020762363,0.00026018257,0.0016065082,0.000026227168,0.00028688056,0.046793196],"genre_scores_gemma":[0.9930983,0.000009769965,0.0033858346,0.00078354625,0.0009431455,0.00020017776,0.00007391089,0.00002280557,0.0014824837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988835,0.00004760695,0.00018210117,0.00021948355,0.00021004783,0.00045726166],"domain_scores_gemma":[0.9991151,0.00009989611,0.000016515389,0.0003632773,0.00035281148,0.000052401232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011177579,0.00009481142,0.00010494373,0.0004405072,0.0010864489,0.0004738979,0.00018413797,0.00004126057,0.00019974366],"category_scores_gemma":[0.000490947,0.00008988708,0.000032120446,0.0011474692,0.000068452086,0.001431546,0.0002982034,0.00020886322,0.00045515576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022798413,0.00038722108,0.054213434,0.00004980028,0.00007174641,8.231173e-7,0.00077425677,0.37479678,0.0019336505,0.5427362,0.014323685,0.0106896395],"study_design_scores_gemma":[0.00054458925,0.000015540036,0.034871962,0.00007364637,0.00006981291,0.000007177561,0.0012646955,0.74359846,0.00006816982,0.0035135085,0.2153891,0.00058335764],"about_ca_topic_score_codex":0.000187588,"about_ca_topic_score_gemma":0.000307922,"teacher_disagreement_score":0.6144775,"about_ca_system_score_codex":0.00005668087,"about_ca_system_score_gemma":0.000012317826,"threshold_uncertainty_score":0.8356196},"labels":[],"label_agreement":null},{"id":"W1999377979","doi":"10.1287/opre.50.3.517.7752","title":"The Censored Newsvendor and the Optimal Acquisition of Information","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Mitacs","keywords":"Newsvendor model; Unobservable; Censoring (clinical trials); Bayesian probability; Economics; Parametric statistics; Econometrics; Computer science; Lost sales; Decision process; Markov chain; Markov decision process; Markov process; Mathematical optimization; Mathematics; Supply chain; Statistics","score_opus":0.0423997385936676,"score_gpt":0.2831538766877301,"score_spread":0.24075413809406251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999377979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43230453,0.00136181,0.0031465343,0.13510895,0.0006965317,0.004227741,0.000012586854,0.000119256685,0.42302206],"genre_scores_gemma":[0.99631184,0.00019241104,0.0001167729,0.0005045579,0.00023088384,0.00010160469,0.000017224851,0.0000046214172,0.0025200793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918216,0.00005308239,0.00018247632,0.00006849337,0.0003522273,0.00016155756],"domain_scores_gemma":[0.99938244,0.000098377815,0.00002533897,0.00020255629,0.0002849724,0.0000063428915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012796326,0.000049484523,0.0000574513,0.00014666424,0.00096406625,0.0007177514,0.00019451225,0.000019325418,0.00046014859],"category_scores_gemma":[0.00021920566,0.000027307586,0.000025485446,0.0003800561,0.00029569777,0.0010778242,0.00016393536,0.000104750645,0.0002553119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007676237,0.000041593874,0.00017851264,0.000045801724,0.000026964337,4.6931808e-7,0.0006908033,0.0028244455,0.000084778985,0.90412843,0.06895797,0.022943491],"study_design_scores_gemma":[0.0011797034,0.000014633313,0.0011887171,0.000013240897,0.00001056856,6.9896737e-7,0.0030684057,0.5780094,0.00005520445,0.0007556073,0.41563827,0.0000655178],"about_ca_topic_score_codex":0.00040781932,"about_ca_topic_score_gemma":0.00007717375,"teacher_disagreement_score":0.9033728,"about_ca_system_score_codex":0.000015137186,"about_ca_system_score_gemma":0.000005261907,"threshold_uncertainty_score":0.74149156},"labels":[],"label_agreement":null},{"id":"W1999655917","doi":"10.1287/opre.1110.1023","title":"Cargo Capacity Management with Allotments and Spot Market Demand","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Allotment; Spot market; Profit (economics); Spot contract; Operations research; Computer science; Monotonic function; Mathematical optimization; Microeconomics; Economics; Mathematics; Finance","score_opus":0.07978966545282967,"score_gpt":0.3034165120761624,"score_spread":0.2236268466233327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999655917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6265438,0.00019141794,0.0004782383,0.0013836884,0.00018297316,0.0010776507,0.0000033127171,0.00006816585,0.37007073],"genre_scores_gemma":[0.9820647,0.0000722616,0.0010985824,0.00068509276,0.0005117493,0.00023366569,0.000025392463,0.000025779153,0.015282731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983209,0.00005444451,0.00015802695,0.00027543952,0.000615915,0.0005752928],"domain_scores_gemma":[0.99943984,0.000023647397,0.000016813381,0.00031753042,0.00015452148,0.000047654536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015698263,0.00014629019,0.00011937105,0.00042891878,0.0006894089,0.00056360016,0.0002004001,0.000037434354,0.0013933923],"category_scores_gemma":[0.000030609914,0.0001173656,0.000022411714,0.00053154543,0.00014969811,0.0013755439,0.00036015033,0.00016719317,0.0003888602],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024139787,0.0013694173,0.18244688,0.0010344407,0.00054252375,0.000057612553,0.0010561609,0.00062046497,0.000471459,0.54953396,0.25032836,0.01229733],"study_design_scores_gemma":[0.0015948439,0.000051095816,0.094961755,0.00009508511,0.00008203307,0.000006210634,0.0029446918,0.011941837,0.0001291342,0.000447877,0.8872725,0.00047293399],"about_ca_topic_score_codex":0.0005296208,"about_ca_topic_score_gemma":0.00029935097,"teacher_disagreement_score":0.6369442,"about_ca_system_score_codex":0.000070582224,"about_ca_system_score_gemma":0.000009046887,"threshold_uncertainty_score":0.99951947},"labels":[],"label_agreement":null},{"id":"W2001296587","doi":"10.1287/opre.1040.0175","title":"A Continuous Model for Multistore Competitive Location","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Profit (economics); Competition (biology); Microeconomics; Fixed cost; Industrial organization; Market share; Business; Economics; Computer science; Operations research; Marketing; Mathematics","score_opus":0.10153215376961179,"score_gpt":0.3715009590033098,"score_spread":0.26996880523369804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001296587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6103165,0.0005425855,0.23070844,0.016388442,0.00039489698,0.0049685175,0.000055597495,0.0003706697,0.13625434],"genre_scores_gemma":[0.98683494,0.000005332476,0.0037421465,0.0002614675,0.00049365417,0.00030411867,0.0000878717,0.000017676755,0.008252802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913055,0.000017204156,0.00015469492,0.00020442405,0.00023902209,0.000254102],"domain_scores_gemma":[0.99854857,0.00008167525,0.000013633144,0.00017710001,0.0011669308,0.000012122177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076201267,0.000074958836,0.000090782785,0.00026745576,0.00065449794,0.00039493022,0.00015553273,0.00004065387,0.00021656688],"category_scores_gemma":[0.00028394783,0.00007416287,0.00003277357,0.00038465104,0.0000642993,0.0007120168,0.00008020094,0.0001462503,0.000279051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025194872,0.00081371074,0.011228827,0.00027946886,0.000052708147,0.000004639743,0.0017960191,0.11493463,0.011374426,0.43542874,0.039859556,0.38397533],"study_design_scores_gemma":[0.00039739843,0.0000050297276,0.0015256434,0.00001865577,0.000011314856,4.803056e-7,0.00027438026,0.92371076,0.000056069024,0.00009961018,0.0738022,0.000098458004],"about_ca_topic_score_codex":0.00061648514,"about_ca_topic_score_gemma":0.005142356,"teacher_disagreement_score":0.80877614,"about_ca_system_score_codex":0.00005922441,"about_ca_system_score_gemma":0.00007324653,"threshold_uncertainty_score":0.50339353},"labels":[],"label_agreement":null},{"id":"W2003903403","doi":"10.1287/opre.1090.0788","title":"Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Production schedule; Integer programming; Job shop scheduling; Schedule; Distributed computing; Mathematical optimization; Dynamic priority scheduling; Batch production; Fair-share scheduling; Algorithm; Operations management; Engineering; Mathematics","score_opus":0.03853692663469973,"score_gpt":0.34059762792393494,"score_spread":0.30206070128923523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003903403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6380085,0.00020323896,0.35719457,0.00027501542,0.00023479162,0.00030675638,0.00003195855,0.00026949894,0.0034756763],"genre_scores_gemma":[0.7543638,0.000014896229,0.24495086,0.0000097216625,0.00006251761,0.000025447096,0.000036732454,0.00003071386,0.00050530245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987937,0.00007030849,0.00029122736,0.00020112419,0.00032374897,0.00031987406],"domain_scores_gemma":[0.9989566,0.00012670264,0.000012579172,0.00025982066,0.0005216987,0.00012259837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267362,0.00012639891,0.00015525283,0.0002728012,0.00036876215,0.00016872372,0.00023154198,0.0001364562,0.00048903894],"category_scores_gemma":[0.00033132685,0.00012370542,0.000036077123,0.00059236336,0.00032888798,0.00016864017,0.000045997986,0.00071896135,0.000052298874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042871125,0.00004228153,0.00025228332,0.000035499834,0.00001682079,0.0000025465079,0.00043139132,0.9384854,0.04583004,0.0008803395,0.00002867287,0.013990459],"study_design_scores_gemma":[0.00047383358,0.000011159169,0.00043450537,0.000031443542,0.000003736434,0.000006179658,0.00060827425,0.993562,0.004623072,0.000020859814,0.00009314384,0.00013182436],"about_ca_topic_score_codex":0.00012322563,"about_ca_topic_score_gemma":0.00020630269,"teacher_disagreement_score":0.11635532,"about_ca_system_score_codex":0.000027592196,"about_ca_system_score_gemma":0.00009489971,"threshold_uncertainty_score":0.53546333},"labels":[],"label_agreement":null},{"id":"W2004020123","doi":"10.1287/opre.1110.0988","title":"Optimizing the Societal Benefits of the Annual Influenza Vaccine: A Stochastic Programming Approach","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Influenza Virus Research Studies","field":"Medicine","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Flu season; Shot (pellet); Transmission (telecommunications); Influenza vaccine; Computer science; Influenza pandemic; Operations research; Environmental health; Vaccination; Medicine; Virology; Mathematics; Coronavirus disease 2019 (COVID-19); Disease","score_opus":0.2398278237660135,"score_gpt":0.43036331187778776,"score_spread":0.19053548811177426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004020123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96170413,0.0049842987,0.002013454,0.0024405762,0.00012907009,0.0070970864,0.00010128595,0.00009796573,0.021432124],"genre_scores_gemma":[0.987556,0.00004694419,0.009918481,0.0001858411,0.00016088202,0.00073863554,0.0000057859347,0.000035076402,0.0013524026],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99707425,0.0003375551,0.00035534782,0.0003020746,0.0012798437,0.0006509225],"domain_scores_gemma":[0.9970411,0.00021004461,0.000030187017,0.00075080764,0.0018556617,0.000112174916],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021259692,0.00014856248,0.00023639167,0.00017968233,0.0014132793,0.0000775306,0.0005556361,0.00008915522,0.00008972648],"category_scores_gemma":[0.0017030237,0.000076980454,0.00013863777,0.0012468857,0.00061454426,0.00020594138,0.00068149983,0.0010002445,0.000035479337],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034146036,0.007673935,0.028289843,0.0016744705,0.003913076,0.000028865263,0.5500294,0.16205575,0.016487464,0.09754119,0.019747537,0.109143876],"study_design_scores_gemma":[0.021965321,0.006978016,0.41964346,0.0021357196,0.0009871556,0.0004914379,0.32023945,0.16061027,0.03082266,0.0005038005,0.03329587,0.0023268368],"about_ca_topic_score_codex":0.00053612696,"about_ca_topic_score_gemma":0.0001213134,"teacher_disagreement_score":0.3913536,"about_ca_system_score_codex":0.00011027247,"about_ca_system_score_gemma":0.0005155462,"threshold_uncertainty_score":0.99988675},"labels":[],"label_agreement":null},{"id":"W2007510152","doi":"10.1287/opre.1110.0933","title":"TECHNICAL NOTE—Inventory Systems with a Generalized Cost Model","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Holding cost; Quasiconvex function; Constraint (computer-aided design); Function (biology); Position (finance); Total cost; Order (exchange); Economic order quantity; Computer science; Economic shortage; Convex function; Carrying cost; Regular polygon; Penalty method; Mathematics; Convex optimization; Economics; Convex set; Supply chain; Microeconomics","score_opus":0.188592250929087,"score_gpt":0.3413608655243467,"score_spread":0.1527686145952597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007510152","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035900872,0.000245982,0.11884198,0.0017650254,0.00051698025,0.004469564,0.000010605636,0.0005171512,0.83773184],"genre_scores_gemma":[0.9774963,0.00002106751,0.004240828,0.0005714655,0.00058221706,0.0011005296,0.000062106235,0.00005084458,0.01587459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981595,0.00006535944,0.00024441996,0.00036137877,0.00070143834,0.000467846],"domain_scores_gemma":[0.99892247,0.000015096393,0.000024076762,0.00050935417,0.0004934226,0.00003559465],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014015225,0.00014693387,0.00015694008,0.0005325111,0.000700802,0.00054446555,0.00044455522,0.00007294273,0.0007669443],"category_scores_gemma":[0.00008746508,0.000116301766,0.00004428418,0.00072859676,0.00018368955,0.0008801357,0.00027803655,0.00034032756,0.0009106764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019287175,0.0006827539,0.0013479601,0.00021195618,0.000041570576,0.000057349032,0.00039439191,0.07249068,0.002059695,0.8317235,0.089523755,0.0012735396],"study_design_scores_gemma":[0.0006232535,0.000028925173,0.000119111784,0.000043241937,0.000017375804,0.000002357699,0.00042353244,0.9289637,0.00005304727,0.00033489338,0.06918702,0.00020351983],"about_ca_topic_score_codex":0.0026562752,"about_ca_topic_score_gemma":0.0010891008,"teacher_disagreement_score":0.9415955,"about_ca_system_score_codex":0.000121481455,"about_ca_system_score_gemma":0.00008946453,"threshold_uncertainty_score":0.9998672},"labels":[],"label_agreement":null},{"id":"W2009623592","doi":"10.1287/opre.49.6.938.10026","title":"A Dynamic Airline Seat Inventory Control Model and Its Optimal Policy","year":2001,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Revenue management; Inventory control; Control (management); Operations research; Computer science; Revenue; Process (computing); Poisson process; Yield management; Simple (philosophy); Mathematical optimization; Optimal control; Poisson distribution; Economics; Mathematics; Finance; Statistics","score_opus":0.06564980331470498,"score_gpt":0.34722009260935477,"score_spread":0.2815702892946498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009623592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8943103,0.00062316726,0.0044724764,0.029090688,0.00014170537,0.0015214788,0.000012718616,0.00017448727,0.06965301],"genre_scores_gemma":[0.9743026,0.00016975105,0.0001750192,0.001832877,0.0005037948,0.00016759623,0.000048039314,0.000028250523,0.02277211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844605,0.000042035404,0.0002107765,0.00032971415,0.0004894199,0.00048199383],"domain_scores_gemma":[0.99927753,0.000022256614,0.00001673869,0.00025901044,0.00038281886,0.000041661773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009184473,0.000139255,0.00014092008,0.00084340683,0.0006667886,0.00058571243,0.00026284685,0.000058559854,0.0004779765],"category_scores_gemma":[0.00022841265,0.00013113079,0.00004193776,0.00079403556,0.000098387536,0.0010814717,0.00028632078,0.00023987363,0.000522445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018372155,0.00055652263,0.0025781486,0.00023020402,0.00011905101,0.00006640408,0.00036645686,0.53948975,0.0040593874,0.41907606,0.027258208,0.0060160863],"study_design_scores_gemma":[0.0008255572,0.000016688513,0.00035054577,0.00001642884,0.000010238959,0.0000021283638,0.0002547601,0.95676637,0.0000051864727,0.00045143988,0.041166123,0.00013454977],"about_ca_topic_score_codex":0.00061549875,"about_ca_topic_score_gemma":0.00068521564,"teacher_disagreement_score":0.4186246,"about_ca_system_score_codex":0.00012198436,"about_ca_system_score_gemma":0.000094081595,"threshold_uncertainty_score":0.67151475},"labels":[],"label_agreement":null},{"id":"W2012645345","doi":"10.1287/opre.50.6.1068.344","title":"When Uncertainty Is Beneficial: Interesting Implications for the Hydrocarbon Discovery Process","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Global Energy and Sustainability Research","field":"Energy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Process (computing); Computer science; Risk analysis (engineering); Data science; Management science; Biochemical engineering; Economics; Business; Engineering","score_opus":0.10983419810685717,"score_gpt":0.40013601531382714,"score_spread":0.29030181720696996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012645345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6833912,0.0018188518,0.007482856,0.21225624,0.0002475228,0.004239217,0.00023132212,0.00025682594,0.09007593],"genre_scores_gemma":[0.9813048,0.000082989776,0.00017488575,0.00027505055,0.00022156298,0.0015494329,0.00003907793,0.000027714701,0.016324442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978002,0.00024546322,0.00029965764,0.00044939705,0.0004756443,0.00072966766],"domain_scores_gemma":[0.9968721,0.0009959287,0.000015071576,0.00077473954,0.0012258346,0.00011630468],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011442227,0.00013813087,0.00014202882,0.00016550714,0.002154835,0.00064087944,0.00078418176,0.000109332446,0.00044559978],"category_scores_gemma":[0.002283038,0.00009838746,0.000098507604,0.0008190117,0.0003183156,0.0004002067,0.0001922053,0.00045520856,0.00006441888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073528376,0.000368007,0.00071643706,0.00009285119,0.00009414288,0.0000016595095,0.004212282,0.39032853,0.00076596386,0.5237417,0.006729825,0.07287507],"study_design_scores_gemma":[0.0005899485,0.00024084811,0.00074551074,0.000039501334,0.000020113655,0.000008568841,0.0047997464,0.78089523,0.0009077155,0.1137725,0.09766946,0.00031084806],"about_ca_topic_score_codex":0.008295763,"about_ca_topic_score_gemma":0.007635875,"teacher_disagreement_score":0.4099692,"about_ca_system_score_codex":0.00025942002,"about_ca_system_score_gemma":0.00020513628,"threshold_uncertainty_score":0.9991442},"labels":[],"label_agreement":null},{"id":"W2014447686","doi":"10.1287/opre.1080.0601","title":"Technical Note—A Multiperiod Model of Inventory Competition","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Newsvendor model; Duopoly; Stockout; Substitution (logic); Inventory theory; Economics; Context (archaeology); Microeconomics; Inventory management; Mathematical economics; Computer science; Supply chain; Operations management; Business; Cournot competition","score_opus":0.09884320516322087,"score_gpt":0.3497422375017635,"score_spread":0.2508990323385426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014447686","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2785519,0.00018037159,0.08362491,0.019912608,0.00043315007,0.0027775916,0.000016865662,0.00043114423,0.6140715],"genre_scores_gemma":[0.9947269,0.000015070041,0.002292748,0.0007474751,0.00029169067,0.000045927613,0.00005536792,0.00001077867,0.001814035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869084,0.000027603897,0.0002508056,0.0002182441,0.00055296347,0.00025952817],"domain_scores_gemma":[0.9992266,0.000014404551,0.00002151523,0.0003190133,0.0004019396,0.000016478634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085577526,0.00008943069,0.000121630226,0.000508539,0.00032856563,0.00019675429,0.00029459732,0.000060099672,0.00044281015],"category_scores_gemma":[0.00016419817,0.00008533106,0.000056461235,0.0005679273,0.00012715133,0.0006689029,0.00013760476,0.00021524355,0.00028099053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004168121,0.0006756578,0.00035465005,0.000085532956,0.0000062383856,0.0000038452267,0.00013095065,0.05763626,0.0681056,0.851031,0.014499203,0.0074293464],"study_design_scores_gemma":[0.00039117556,0.00003417914,0.00076313183,0.0000379779,0.00000696468,2.5604953e-7,0.00018674518,0.9754368,0.000598672,0.0029212004,0.019498685,0.00012418634],"about_ca_topic_score_codex":0.00024599864,"about_ca_topic_score_gemma":0.00026789337,"teacher_disagreement_score":0.91780055,"about_ca_system_score_codex":0.000071407274,"about_ca_system_score_gemma":0.00004633309,"threshold_uncertainty_score":0.48484606},"labels":[],"label_agreement":null},{"id":"W2015274422","doi":"10.1287/opre.1070.0387","title":"The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Combinatorics; Euclidean geometry; Mathematics; Undirected graph; Bottleneck traveling salesman problem; Disjoint sets; Algorithm; Graph; Computer science; Discrete mathematics","score_opus":0.08440112380429196,"score_gpt":0.384531815803507,"score_spread":0.30013069199921505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015274422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22343856,0.004072683,0.5731156,0.010989378,0.0011009398,0.0033797552,0.000065530185,0.002094026,0.18174353],"genre_scores_gemma":[0.66347826,0.0006831635,0.3197004,0.000032771928,0.0003819476,0.000047096524,0.000048620313,0.00008704119,0.015540691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998379,0.00021772509,0.00031301766,0.00020870616,0.00036695512,0.00051463174],"domain_scores_gemma":[0.9987567,0.00049840397,0.0000075672833,0.00032250187,0.00022027717,0.0001945563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032869643,0.00010644492,0.00009278792,0.00017023564,0.00085210305,0.0003726309,0.00020604365,0.000082394086,0.000017653425],"category_scores_gemma":[0.00050644483,0.00008448668,0.000018123685,0.0008590228,0.00014748004,0.00014098555,0.00007083423,0.00042164265,0.000041841922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012058335,0.00007446804,0.00046755804,0.00005840298,0.000116991534,0.000036919184,0.00608713,0.5703604,0.041883975,0.009652176,0.0154178,0.3557236],"study_design_scores_gemma":[0.0010628045,0.00010027575,0.0035244022,0.00004288017,0.000008317021,0.000046747908,0.0005673905,0.95695806,0.009681721,0.00023108762,0.027481213,0.00029512902],"about_ca_topic_score_codex":0.00023437336,"about_ca_topic_score_gemma":0.00077714445,"teacher_disagreement_score":0.4400397,"about_ca_system_score_codex":0.00009427702,"about_ca_system_score_gemma":0.000105304185,"threshold_uncertainty_score":0.6553774},"labels":[],"label_agreement":null},{"id":"W2015501288","doi":"10.1287/opre.1080.0635","title":"Conflict Resolution in the Scheduling of Television Commercials","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Association of Canadian Universities for Research in Astronomy","keywords":"Weighting; Combinatorics; Scheduling (production processes); Partition (number theory); Mathematics; Extension (predicate logic); Computer science; Upper and lower bounds; Generalization; Mathematical optimization","score_opus":0.15234418232633448,"score_gpt":0.45514144534738327,"score_spread":0.3027972630210488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015501288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45546088,0.0012474043,0.49807057,0.029399406,0.000075561875,0.001840248,0.000007498302,0.00006675261,0.0138316825],"genre_scores_gemma":[0.9762471,0.00011903773,0.023295976,0.00013150794,0.000032619864,0.000030349893,0.000004024786,0.0000033252963,0.0001360606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687797,0.0013182954,0.0002710792,0.00025207584,0.00090438087,0.00037621293],"domain_scores_gemma":[0.99809504,0.0005924526,0.000014305925,0.000793056,0.00045787933,0.000047256628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00638272,0.00006539719,0.00011580643,0.0005106881,0.00045495512,0.00019708577,0.0014436858,0.000051152125,0.000016623375],"category_scores_gemma":[0.00091133796,0.00004719998,0.00003400127,0.0022916882,0.00017383261,0.0005294493,0.00016076126,0.0005121354,0.00003827526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019780471,0.0001966877,0.000114044575,0.00000557945,0.0000024486842,0.000008247309,0.0023399177,0.018320734,0.0336749,0.8940163,0.0002473265,0.051054012],"study_design_scores_gemma":[0.0013731527,0.0013616984,0.02779611,0.00020510105,0.0000023599173,0.000030717467,0.0018974219,0.86375207,0.024692018,0.06913292,0.009393587,0.00036286225],"about_ca_topic_score_codex":0.0000916537,"about_ca_topic_score_gemma":0.00007936062,"teacher_disagreement_score":0.8454313,"about_ca_system_score_codex":0.00005122437,"about_ca_system_score_gemma":0.00012571737,"threshold_uncertainty_score":0.3499193},"labels":[],"label_agreement":null},{"id":"W2018213245","doi":"10.1287/opre.1060.0288","title":"An Economic Analysis of Interconnection Arrangements Between Internet Backbone Providers","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta; Carnegie Mellon University; Ford Motor Company","keywords":"Peering; Service provider; The Internet; Computer science; Incentive; Revenue; Computer network; Quality of service; Service (business); Network packet; Business; Industrial organization; Microeconomics; Economics; Marketing","score_opus":0.042654550153279285,"score_gpt":0.3527544471638261,"score_spread":0.3100998970105468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018213245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5864496,0.000026390597,0.41129774,0.0006691689,0.00007309368,0.00020927099,0.000008066195,0.00004233197,0.0012243217],"genre_scores_gemma":[0.9963641,0.0000040589734,0.002370529,0.00001506874,0.0001211567,0.000051111147,0.00006376636,0.000004977834,0.001005225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986558,0.0002743676,0.00028809675,0.00032396684,0.0002424847,0.0002152641],"domain_scores_gemma":[0.9991532,0.00010065213,0.000024523875,0.00045090562,0.00020939525,0.000061347135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082541833,0.00007168976,0.00017032017,0.00066227675,0.00013447957,0.00030886038,0.0005621736,0.000044192693,0.00015438283],"category_scores_gemma":[0.000015053164,0.00006992806,0.0000664972,0.00087696145,0.00007139122,0.00066444423,0.000078012374,0.00013765536,0.00007394437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024956633,0.00027295228,0.030822996,0.000010371316,0.00087927596,0.0000033578976,0.0012454201,0.61843306,0.002491676,0.11875291,0.0040511773,0.22301182],"study_design_scores_gemma":[0.00022206658,0.0001201713,0.011328684,0.000005364301,0.000042028227,2.7677007e-7,0.00007989656,0.9866511,0.00062442076,0.00014016304,0.0007102582,0.00007552366],"about_ca_topic_score_codex":0.0027737275,"about_ca_topic_score_gemma":0.00553638,"teacher_disagreement_score":0.4099145,"about_ca_system_score_codex":0.00010398804,"about_ca_system_score_gemma":0.0000964786,"threshold_uncertainty_score":0.4193065},"labels":[],"label_agreement":null},{"id":"W2019377880","doi":"10.1287/opre.1110.0972","title":"The Impact of Delaying the Delay Announcements","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Postponement; Credibility; Profit (economics); Service provider; Business; Service (business); Retard; Focus (optics); Computer science; Microeconomics; Marketing; Economics","score_opus":0.12991589512478754,"score_gpt":0.39241821771528,"score_spread":0.26250232259049244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019377880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176428,0.00018467534,0.0032149693,0.0006185149,0.00007785659,0.0004908666,0.0000054248344,0.000034544628,0.07773036],"genre_scores_gemma":[0.9982521,0.000023617467,0.00015361565,0.000042515192,0.00014821347,0.000053130145,0.000009391553,0.000011301532,0.0013061061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989434,0.00008906565,0.00019489827,0.00013364688,0.00035722906,0.00028178818],"domain_scores_gemma":[0.998608,0.00015933222,0.000035301895,0.00046821134,0.0007210437,0.000008131497],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025027506,0.00007269156,0.00007653593,0.00015697948,0.0017428481,0.00025792938,0.00055088394,0.000022989543,0.00045243226],"category_scores_gemma":[0.0005870506,0.000035510227,0.000083188206,0.0010399406,0.0002607232,0.0006536445,0.00023336844,0.00020962355,0.00024506036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038307626,0.0005100784,0.025002778,0.00003747895,0.0008225868,0.000016539188,0.0025582362,0.12555857,0.012224744,0.78850126,0.012321576,0.03206307],"study_design_scores_gemma":[0.0012289544,0.00020492736,0.024197085,0.00011134135,0.00018282114,0.000008649528,0.011202165,0.8187186,0.0013076967,0.095551126,0.046560604,0.0007260217],"about_ca_topic_score_codex":0.0033905457,"about_ca_topic_score_gemma":0.0006059743,"teacher_disagreement_score":0.69316006,"about_ca_system_score_codex":0.00004536246,"about_ca_system_score_gemma":0.00005198322,"threshold_uncertainty_score":0.9995567},"labels":[],"label_agreement":null},{"id":"W2020562184","doi":"10.1287/opre.2014.1267","title":"Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Inverse; Inverse problem; Multi-objective optimization; Mathematics; Optimization problem; Computer science; Pareto principle; Applied mathematics","score_opus":0.0292310296067893,"score_gpt":0.39634759271075093,"score_spread":0.3671165631039616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020562184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03893145,0.000015816851,0.9574552,0.0005833932,0.000012641322,0.0009766837,0.000012463324,0.0000530202,0.0019592915],"genre_scores_gemma":[0.5506713,0.0000665139,0.4424201,0.00022516085,0.00036252724,0.004023327,0.00008488283,0.00004626329,0.002099938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905527,0.00015680416,0.0001013766,0.0002581412,0.00022705775,0.00020136834],"domain_scores_gemma":[0.99912006,0.000036042602,0.000012659205,0.00028533125,0.00047071907,0.000075212105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025384696,0.00008938058,0.00009286547,0.00014575962,0.00036153226,0.00008313686,0.00013815562,0.00002535876,0.00046603696],"category_scores_gemma":[0.00000823912,0.00007182,0.000017858507,0.0005071858,0.00005772277,0.00018781258,0.0000205655,0.00014145853,0.000014130394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051550473,0.000077876226,0.002093029,0.000001063793,0.00002746552,4.3866706e-8,0.0005327735,0.91745365,0.02402114,0.01279516,0.000555742,0.04239051],"study_design_scores_gemma":[0.0010218008,0.00023684002,0.00037001618,0.000014318519,0.0000030807555,2.2182066e-7,0.00014330409,0.9142759,0.052711762,0.00028340172,0.030714551,0.00022478797],"about_ca_topic_score_codex":0.002193139,"about_ca_topic_score_gemma":0.0002505818,"teacher_disagreement_score":0.51503515,"about_ca_system_score_codex":0.00008922426,"about_ca_system_score_gemma":0.00008686154,"threshold_uncertainty_score":0.5102778},"labels":[],"label_agreement":null},{"id":"W2021035803","doi":"10.1287/opre.1110.0937","title":"Multiple Variable Proportionality in Data Envelopment Analysis","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Proportionality (law); Bundle; Returns to scale; Variable (mathematics); Envelopment; Computer science; Econometrics; Set (abstract data type); Operations research; Mathematics; Mathematical optimization; Economics; Microeconomics","score_opus":0.6788556956010486,"score_gpt":0.5484107332782845,"score_spread":0.13044496232276415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021035803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7778632,0.000157321,0.1660202,0.002488449,0.00016515514,0.0010184871,0.00018081823,0.0000574924,0.05204887],"genre_scores_gemma":[0.95632577,0.000009508511,0.03702239,0.000035669713,0.00002145569,0.000047505666,0.00015486221,0.000005281658,0.0063775717],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99349624,0.001221992,0.00087249436,0.00095761276,0.0030363542,0.00041532487],"domain_scores_gemma":[0.9949597,0.0009036153,0.00004239994,0.0026180446,0.0013528927,0.00012331689],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.029705528,0.00009104177,0.00026429576,0.002091356,0.0005913917,0.00042430917,0.0023564948,0.00006749946,0.005320292],"category_scores_gemma":[0.014056831,0.00006864121,0.00005939077,0.01365328,0.00024341301,0.0007315732,0.00090054574,0.00032489968,0.0009140688],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060265866,0.002348203,0.83754325,0.0000047701537,0.00040440093,0.00004098888,0.004743837,0.105769165,0.0018341915,0.029762818,0.008142753,0.009345357],"study_design_scores_gemma":[0.00018139719,0.000018539766,0.22045493,0.000004488893,0.000035490753,0.0000010509195,0.00086449285,0.7657113,0.00039581239,0.0029618475,0.009230293,0.0001403682],"about_ca_topic_score_codex":0.0075653614,"about_ca_topic_score_gemma":0.028085623,"teacher_disagreement_score":0.6599421,"about_ca_system_score_codex":0.00012500722,"about_ca_system_score_gemma":0.0007109307,"threshold_uncertainty_score":0.99986386},"labels":[],"label_agreement":null},{"id":"W2021485348","doi":"10.1287/opre.1070.0500","title":"CAR-DEA: Context-Dependent Assurance Regions in DEA","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Multiplier (economics); Computer science; Context (archaeology); Database transaction; Lagrange multiplier; Operations research; Set (abstract data type); Mathematical optimization; Econometrics; Economics; Mathematics","score_opus":0.35486349429978864,"score_gpt":0.4996666543145463,"score_spread":0.14480316001475768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021485348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9562848,0.001100198,0.009358695,0.009893263,0.00018739958,0.0005351087,0.000021766047,0.000042963162,0.022575794],"genre_scores_gemma":[0.9720766,0.00015086269,0.0007153321,0.00012958437,0.00006923219,0.00008061362,0.0000052188993,0.000012629479,0.02675995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99243516,0.0015128598,0.00076929724,0.0007837029,0.003897332,0.00060164556],"domain_scores_gemma":[0.99437225,0.0022841918,0.00003359237,0.0013956744,0.0017450596,0.00016925012],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009157935,0.00012888366,0.00032500047,0.0013907411,0.001478458,0.00045327772,0.0013286921,0.00010768285,0.0006550918],"category_scores_gemma":[0.012320902,0.000102376194,0.00013466888,0.005011005,0.0005739858,0.0005359651,0.00023876954,0.000642373,0.0027225055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011869257,0.0021501502,0.109118134,0.000012364352,0.00013139054,0.0011317579,0.016430946,0.58625776,0.015044708,0.08733918,0.14993776,0.03232716],"study_design_scores_gemma":[0.0037726134,0.00059201807,0.18242359,0.00019132294,0.00003460024,0.00042358635,0.015664581,0.5049803,0.00846889,0.011823379,0.27000204,0.0016230402],"about_ca_topic_score_codex":0.003671432,"about_ca_topic_score_gemma":0.032149024,"teacher_disagreement_score":0.120064266,"about_ca_system_score_codex":0.00021244546,"about_ca_system_score_gemma":0.0008683604,"threshold_uncertainty_score":0.9998215},"labels":[],"label_agreement":null},{"id":"W2021662179","doi":"10.1287/opre.1040.0158","title":"Selecting Attributes to Measure the Achievement of Objectives","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":369,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"U.S. Department of Energy","keywords":"Measure (data warehouse); Computer science; Statement (logic); Proxy (statistics); Foundation (evidence); Meaning (existential); Management science; Problem statement; Operations research; Risk analysis (engineering); Data mining; Machine learning; Mathematics; Business","score_opus":0.3172619526135115,"score_gpt":0.5063036430112521,"score_spread":0.1890416903977406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021662179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7945226,0.00049868214,0.028177598,0.16154625,0.000054134518,0.000725851,0.000026830365,0.000018321643,0.014429773],"genre_scores_gemma":[0.98917323,0.000041396965,0.0029292288,0.00008680305,0.000108868655,0.00004198234,0.0000016564093,0.000004052614,0.0076127984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99585426,0.00094514416,0.00039832375,0.00027662647,0.002267152,0.0002584927],"domain_scores_gemma":[0.9957412,0.0015156666,0.00002045158,0.00055949565,0.0020827274,0.00008045061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012439452,0.000058180984,0.00014167947,0.00039393897,0.001142065,0.0003104981,0.00078171643,0.000030918032,0.00046805415],"category_scores_gemma":[0.008331117,0.000031826967,0.00007959948,0.0034113189,0.0001080718,0.00022407118,0.00019388701,0.00024084387,0.0005790627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007527022,0.00035286945,0.01616314,0.0000023007517,0.00013079496,0.00000109839,0.015299221,0.40179268,0.03832845,0.01557969,0.02827576,0.48399872],"study_design_scores_gemma":[0.0010625938,0.0009335992,0.17541397,0.00007088664,0.00005601742,0.000009340367,0.06371969,0.23141047,0.1730366,0.009589164,0.344065,0.0006326654],"about_ca_topic_score_codex":0.00034872093,"about_ca_topic_score_gemma":0.005737465,"teacher_disagreement_score":0.48336604,"about_ca_system_score_codex":0.000064178996,"about_ca_system_score_gemma":0.00019162206,"threshold_uncertainty_score":0.99737275},"labels":[],"label_agreement":null},{"id":"W2023482164","doi":"10.1287/opre.50.3.415.7751","title":"An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":282,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Integer (computer science); Mathematical optimization; Computer science; Integer programming; Routing (electronic design automation); Operations research; TRIPS architecture; Mathematics","score_opus":0.07063186204221393,"score_gpt":0.3441733096093075,"score_spread":0.27354144756709353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023482164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007858652,0.000110877125,0.9896825,0.00041773487,0.000048544705,0.00097211404,0.000020812508,0.00024480434,0.00064398843],"genre_scores_gemma":[0.72811407,0.000014475295,0.27034846,0.000028974488,0.00012012701,0.0005377062,0.00002240674,0.00006782935,0.00074593467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842197,0.00022724424,0.0002400555,0.0002456471,0.0003741906,0.0004908951],"domain_scores_gemma":[0.99836767,0.0005438496,0.000010366746,0.00038566158,0.0005829768,0.00010945564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015466877,0.00013895144,0.0001300001,0.00015488012,0.000957034,0.0003677683,0.00030466157,0.0000752634,0.00017168734],"category_scores_gemma":[0.0001873732,0.000099129305,0.0000285006,0.0008448548,0.000121206926,0.0003174107,0.000027495827,0.00045055966,0.000039100123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036326926,0.000036564965,0.000012657253,0.000010203643,0.000034614375,8.9711045e-7,0.0014559464,0.97062725,0.0029868872,0.00032962617,0.00026031685,0.024241399],"study_design_scores_gemma":[0.0004566754,0.00013478815,0.000027828946,0.000026781585,0.00001220868,0.000007830081,0.0006293818,0.99780095,0.0005598681,0.000018066292,0.00018391866,0.00014171256],"about_ca_topic_score_codex":0.000053076667,"about_ca_topic_score_gemma":0.00009989234,"teacher_disagreement_score":0.72025543,"about_ca_system_score_codex":0.000097669144,"about_ca_system_score_gemma":0.000035327983,"threshold_uncertainty_score":0.73608285},"labels":[],"label_agreement":null},{"id":"W2025737929","doi":"10.1287/opre.1120.1062","title":"Strategies for a Centralized Single Product Multiclass <i>M/G/</i>1 Make-to-Stock Queue","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Computer science; Rationing; Priority queue; Operations research; Stock (firearms); Queueing theory; Mathematical optimization; Computer network; Mathematics; Economics","score_opus":0.122920014462063,"score_gpt":0.3896624787333305,"score_spread":0.26674246427126747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025737929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8371705,0.00040693284,0.10415497,0.014742156,0.00075320114,0.005521754,0.000039941424,0.00048455157,0.03672604],"genre_scores_gemma":[0.9843305,0.000002526522,0.008446104,0.00043764175,0.001507445,0.00056504353,0.00006829658,0.000043249343,0.00459924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813896,0.00007815744,0.00024911578,0.0003363367,0.00040446315,0.0007929738],"domain_scores_gemma":[0.99847835,0.00014605466,0.00002612601,0.00045014458,0.00085142127,0.00004788959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742436,0.00014758794,0.0001807735,0.0004587394,0.0008639024,0.0008651472,0.00031840967,0.000045196637,0.00027867727],"category_scores_gemma":[0.001221828,0.00013464777,0.00007676932,0.001228791,0.00009921063,0.0019324756,0.00017654976,0.00019412847,0.0006069073],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030713502,0.0010636363,0.001232638,0.0002523683,0.00011894416,0.0000028413187,0.0010279841,0.06233011,0.15346913,0.756336,0.013941492,0.009917768],"study_design_scores_gemma":[0.0016549369,0.000077163146,0.000642391,0.00009783693,0.000116426614,0.0000033447216,0.005939711,0.11953215,0.009026998,0.009328722,0.85273045,0.00084987987],"about_ca_topic_score_codex":0.00040209282,"about_ca_topic_score_gemma":0.0009959225,"teacher_disagreement_score":0.8387889,"about_ca_system_score_codex":0.000102792,"about_ca_system_score_gemma":0.000066772205,"threshold_uncertainty_score":0.83426344},"labels":[],"label_agreement":null},{"id":"W2026308543","doi":"10.1287/opre.1060.0248","title":"Dynamic Pricing Through Discounts for Optimizing Multiple-Class Demand Fulfillment","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Dynamic pricing; Class (philosophy); Order (exchange); Service (business); Discounting; Microeconomics; Service level; Computer science; Inventory control; Revenue management; Holding cost; Operations research; Sensitivity (control systems); Business; Economics; Marketing; Operations management; Mathematics","score_opus":0.062323284341600504,"score_gpt":0.3370553331496807,"score_spread":0.2747320488080802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026308543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46350265,0.0006209311,0.2613482,0.017765157,0.0015653695,0.008181619,0.000047916197,0.000394858,0.24657333],"genre_scores_gemma":[0.9783182,0.000023313569,0.0076113674,0.0005051045,0.0007381462,0.0007068142,0.00029887672,0.000045928275,0.011752251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800324,0.00003335636,0.00033545308,0.0004321079,0.00058819837,0.000607669],"domain_scores_gemma":[0.9990816,0.00011440502,0.000034883702,0.0003532547,0.00040196392,0.000013909304],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011390643,0.00017071256,0.00016506917,0.00036641175,0.0013066577,0.0010972957,0.00033333496,0.000058005746,0.00039816403],"category_scores_gemma":[0.00017667719,0.00015417647,0.00008184067,0.0006018749,0.00010305619,0.0014258763,0.00028214222,0.00017497365,0.00026078604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020119225,0.0012375234,0.0054496545,0.00090740295,0.00016378216,0.000025153066,0.0005426368,0.39623675,0.012955058,0.40844384,0.1684714,0.0053656246],"study_design_scores_gemma":[0.0010596581,0.000022518749,0.0009950644,0.000059280435,0.000019316902,5.490336e-7,0.0010713238,0.745564,0.00022887107,0.0017753665,0.24896301,0.00024107847],"about_ca_topic_score_codex":0.002254287,"about_ca_topic_score_gemma":0.0034977528,"teacher_disagreement_score":0.51481557,"about_ca_system_score_codex":0.00020974416,"about_ca_system_score_gemma":0.000036316636,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W2028552829","doi":"10.1287/opre.48.3.444.12431","title":"Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":273,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; University of Prince Edward Island","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Heuristics; Tabu search; Mathematical optimization; Computer science; Euclidean geometry; Local search (optimization); Mathematics; Variable (mathematics); Variable neighborhood search; Metaheuristic","score_opus":0.10924677996224828,"score_gpt":0.37099140498009536,"score_spread":0.26174462501784707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028552829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748369,0.00013654436,0.0029715216,0.0054994305,0.00009557557,0.002223975,0.000018058534,0.00004558187,0.014172454],"genre_scores_gemma":[0.9907537,0.000027305228,0.0010078633,0.00015411213,0.00009013516,0.0001869903,0.000054232325,0.000010369559,0.007715289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989934,0.000020976142,0.00028052073,0.00018037233,0.00030218886,0.00022254104],"domain_scores_gemma":[0.99923056,0.0000469152,0.000011955302,0.00021152254,0.0004886579,0.000010365518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094016455,0.000074685035,0.00009849107,0.00012646145,0.0007224072,0.00024329046,0.00018463844,0.000028178898,0.00065218227],"category_scores_gemma":[0.00017538466,0.00005622639,0.000024732612,0.00040948618,0.00012739474,0.00029081528,0.00008420901,0.00011689073,0.000102798644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033377815,0.002042377,0.016616741,0.002359628,0.00032512101,0.0000010128057,0.00615373,0.28886154,0.016265888,0.15978909,0.14320725,0.36404383],"study_design_scores_gemma":[0.00045899386,0.000028641092,0.002419827,0.00002263351,0.000016335298,8.225527e-8,0.0014852075,0.88031447,0.00017904474,0.00033660204,0.11464172,0.00009643277],"about_ca_topic_score_codex":0.0026422553,"about_ca_topic_score_gemma":0.002758443,"teacher_disagreement_score":0.59145296,"about_ca_system_score_codex":0.00001697946,"about_ca_system_score_gemma":0.000017049588,"threshold_uncertainty_score":0.71409386},"labels":[],"label_agreement":null},{"id":"W2030248705","doi":"10.1287/opre.1060.0344","title":"Price Guarantees in Dynamic Pricing and Revenue Management","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dynamic pricing; Revenue management; Heuristics; Computer science; Mathematical optimization; Time horizon; Bounding overwatch; Revenue; Product (mathematics); Dynamic programming; Reservation price; Economics; Microeconomics; Mathematics; Finance","score_opus":0.04099805616896895,"score_gpt":0.3416617658530268,"score_spread":0.30066370968405787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030248705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83958066,0.00030654005,0.0024026711,0.0024378786,0.000194489,0.0011385005,0.0000015096048,0.000053127562,0.15388465],"genre_scores_gemma":[0.9898896,0.000108625834,0.0007333054,0.00044426456,0.00016951427,0.000059481124,0.000015423377,0.000017465381,0.008562305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860024,0.000024946545,0.0002400853,0.00029210935,0.00040631852,0.00043631857],"domain_scores_gemma":[0.99957967,0.00004066285,0.00001573498,0.00023697945,0.0001125085,0.000014430626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029317571,0.000096566306,0.000098633034,0.0010444064,0.0003576084,0.00038111108,0.00021030592,0.0000362684,0.00017207908],"category_scores_gemma":[0.00008432484,0.000094584335,0.000019082296,0.0011398959,0.00007679898,0.0006233758,0.00033331514,0.000210245,0.00023044951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018695046,0.00096064847,0.03633869,0.0016901118,0.00012322712,0.00062660436,0.0017974373,0.004201732,0.004659114,0.7596151,0.022731774,0.16706859],"study_design_scores_gemma":[0.0023172738,0.000051477058,0.23317112,0.00047272115,0.000026701036,0.0000061071805,0.010971264,0.13838562,0.00012964681,0.004963789,0.6088136,0.0006906644],"about_ca_topic_score_codex":0.00081122766,"about_ca_topic_score_gemma":0.0040146443,"teacher_disagreement_score":0.7546513,"about_ca_system_score_codex":0.00011003818,"about_ca_system_score_gemma":0.000009721567,"threshold_uncertainty_score":0.3857037},"labels":[],"label_agreement":null},{"id":"W2030656388","doi":"10.1287/opre.1070.0411","title":"Pricing and Manufacturing Decisions When Demand Is a Function of Prices in Multiple Periods","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Computer science; Operations research; Economics; Microeconomics; Mathematics","score_opus":0.0915634208709816,"score_gpt":0.32874465491254334,"score_spread":0.23718123404156174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030656388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799383,0.00012073676,0.006555446,0.00045911004,0.00007578186,0.00041433374,6.922226e-7,0.000016883765,0.0124187125],"genre_scores_gemma":[0.9978305,0.000055073455,0.0010840942,0.00021841822,0.00016113414,0.000026424546,0.000008972012,0.000011194512,0.00060418254],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988303,0.0000149284115,0.00026550138,0.00022808507,0.00038469912,0.00027649483],"domain_scores_gemma":[0.9994885,0.00017447512,0.000024482952,0.00018406636,0.0001122859,0.000016231223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020562222,0.00008058053,0.00010677298,0.0009004623,0.00038437208,0.00026923305,0.00013400216,0.00004308166,0.0004323058],"category_scores_gemma":[0.0002936651,0.000072844356,0.000023488334,0.0003861186,0.000074463205,0.00076432654,0.00023281401,0.00015838392,0.000043438577],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077057583,0.0015161242,0.41331446,0.0012214216,0.00021180452,0.00007439965,0.011798229,0.009187553,0.028570544,0.07141787,0.01614642,0.4457706],"study_design_scores_gemma":[0.0023843506,0.0000970767,0.5561412,0.00032946857,0.000032650205,0.0000018097946,0.013990702,0.1310216,0.007208123,0.0032136103,0.28511602,0.00046338057],"about_ca_topic_score_codex":0.0016413304,"about_ca_topic_score_gemma":0.003955587,"teacher_disagreement_score":0.4453072,"about_ca_system_score_codex":0.00004470001,"about_ca_system_score_gemma":0.00001537572,"threshold_uncertainty_score":0.47334453},"labels":[],"label_agreement":null},{"id":"W2032091434","doi":"10.1287/opre.1100.0906","title":"Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":196,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; National Science Foundation","keywords":"Estimator; Newsvendor model; Computer science; Nonparametric statistics; Consistency (knowledge bases); Mathematical optimization; Econometrics; Inventory control; Quantile; Product (mathematics); Mathematics; Statistics; Operations research","score_opus":0.1650692678379945,"score_gpt":0.32017182759900814,"score_spread":0.15510255976101364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032091434","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12933484,0.00016723719,0.057257608,0.007619669,0.00095300283,0.007856106,0.00026721795,0.0006892184,0.7958551],"genre_scores_gemma":[0.9931464,0.0000032501655,0.0026552535,0.0014691381,0.00041557237,0.00022648727,0.00028677835,0.000041947267,0.0017551341],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979045,0.000105014995,0.0002225758,0.0005324775,0.00076667534,0.00046879784],"domain_scores_gemma":[0.9984841,0.00006401014,0.00003592329,0.0009505984,0.00041954234,0.000045873785],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010870612,0.0001858868,0.00018349377,0.00060933706,0.00069063867,0.00039222,0.0007318837,0.000059492708,0.002269486],"category_scores_gemma":[0.00017710224,0.00014605706,0.000033288812,0.0005862785,0.00021830777,0.0011032806,0.00024054215,0.000292029,0.0013076053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037337653,0.0035827027,0.061441705,0.00041302975,0.0006702288,0.00048731372,0.000811071,0.13352004,0.00035090352,0.37307835,0.41845843,0.0034524524],"study_design_scores_gemma":[0.0016836681,0.00013493803,0.00330073,0.00007019101,0.000038596983,5.5323085e-7,0.0005120985,0.95726705,0.000032441647,0.000112209775,0.03662454,0.00022297645],"about_ca_topic_score_codex":0.0010832703,"about_ca_topic_score_gemma":0.0009317291,"teacher_disagreement_score":0.8638116,"about_ca_system_score_codex":0.00007342487,"about_ca_system_score_gemma":0.00010344844,"threshold_uncertainty_score":0.99947},"labels":[],"label_agreement":null},{"id":"W2032740850","doi":"10.1287/opre.51.4.585.16095","title":"Operations and Shipment Scheduling of a Batch on a Flexible Machine","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Batch processing; Mathematical optimization; Dynamic programming; Heuristic; Sequence (biology); Job shop scheduling; Set (abstract data type); Operations research; Algorithm; Schedule; Mathematics; Artificial intelligence; Operating system","score_opus":0.057835699636865384,"score_gpt":0.34438555306586766,"score_spread":0.2865498534290023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032740850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7858681,0.0020225707,0.18496689,0.0008796477,0.00026559428,0.0008079866,0.00004000375,0.00024810957,0.024901072],"genre_scores_gemma":[0.8534333,0.00029366947,0.14516474,0.00001891426,0.000024131508,0.00007118432,0.00001828691,0.000020593268,0.0009551837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990844,0.000101598605,0.00018866803,0.00015106377,0.0002748526,0.0001994303],"domain_scores_gemma":[0.99942523,0.0000736955,0.00000277592,0.0002065653,0.00020282688,0.00008889154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062480255,0.000082876206,0.00010208712,0.0002549827,0.00029318748,0.0001170894,0.000078764555,0.00005324211,0.0002357862],"category_scores_gemma":[0.00026140982,0.000078849174,0.00001819017,0.00040140442,0.000048438735,0.00010376038,0.000017439184,0.00025627651,0.00004518878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023223213,0.000046381065,0.000059064103,0.000014296706,0.000014328765,8.4293515e-7,0.00039335035,0.9834161,0.0021206343,0.013014834,0.00002548612,0.0008923531],"study_design_scores_gemma":[0.0002922961,0.00006030888,0.000057772126,0.000029063036,0.0000029350006,0.0000030133724,0.0003403057,0.9761698,0.022417672,0.00004255369,0.00049739936,0.00008688505],"about_ca_topic_score_codex":0.00005519962,"about_ca_topic_score_gemma":0.0001239488,"teacher_disagreement_score":0.06756517,"about_ca_system_score_codex":0.000044679655,"about_ca_system_score_gemma":0.00007181466,"threshold_uncertainty_score":0.32153758},"labels":[],"label_agreement":null},{"id":"W2033834766","doi":"10.1287/opre.2015.1350","title":"Multiattribute Utility Functions Satisfying Mutual Preferential Independence","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Ryerson University; University of Southern California; National Science Foundation","keywords":"Independence (probability theory); Function (biology); Univariate; Isoelastic utility; Expected utility hypothesis; Mathematics; Complement (music); Mathematical economics; Nonparametric statistics; Econometrics; Mathematical optimization; Statistics; Multivariate statistics","score_opus":0.8056785903405422,"score_gpt":0.6029653570957907,"score_spread":0.20271323324475155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033834766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74594796,0.00015856003,0.2355136,0.0017996719,0.0016560934,0.0010409276,0.00023475588,0.00012906286,0.013519377],"genre_scores_gemma":[0.97603726,0.0000046534324,0.008718726,0.000055330624,0.00029536852,0.000114934664,0.000037502774,0.000019445046,0.014716796],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98775953,0.0023337149,0.0010119815,0.001059127,0.0071111927,0.00072446413],"domain_scores_gemma":[0.9892793,0.0022272654,0.00005699971,0.0017106034,0.0061396407,0.0005861422],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.020034855,0.00019090196,0.00030995757,0.0010754581,0.0014573534,0.0025173936,0.0015736438,0.00021043044,0.0050887186],"category_scores_gemma":[0.04021265,0.00015184845,0.00010709406,0.002756362,0.00033467103,0.0014622798,0.0011502188,0.0009932088,0.009490441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070267566,0.0012710756,0.079156816,0.000013757514,0.00010647685,0.0000962423,0.01076799,0.03430155,0.019949341,0.009862934,0.4225676,0.42120352],"study_design_scores_gemma":[0.002353724,0.00026591346,0.054005887,0.000044417484,0.000013135537,0.00005157198,0.009054411,0.75260496,0.0019244328,0.0061707124,0.17294832,0.0005624994],"about_ca_topic_score_codex":0.00076786743,"about_ca_topic_score_gemma":0.003497901,"teacher_disagreement_score":0.71830344,"about_ca_system_score_codex":0.00022208695,"about_ca_system_score_gemma":0.0011033409,"threshold_uncertainty_score":0.9998426},"labels":[],"label_agreement":null},{"id":"W2035133691","doi":"10.1287/opre.48.1.177.12451","title":"Minimizing Cycle Time in a Blocking Flowshop","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Heuristic; Computer science; Set (abstract data type); Mathematical optimization; Throughput; Algorithm; Mathematics; Artificial intelligence","score_opus":0.02777353314887171,"score_gpt":0.3146552187995641,"score_spread":0.2868816856506924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035133691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9394111,0.0002662034,0.0016726295,0.00042000556,0.00006730444,0.00024300968,0.000005528672,0.00024102259,0.057673194],"genre_scores_gemma":[0.9239958,0.00017674785,0.06540516,0.000031848234,0.00015878692,0.00009483416,0.000030823274,0.000044558616,0.01006145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912983,0.00006658645,0.00015534747,0.0001409495,0.0002247785,0.00028251563],"domain_scores_gemma":[0.9996285,0.000059101436,0.0000011630632,0.00018318732,0.00006714367,0.00006091424],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004563697,0.00006454957,0.00007829047,0.00024726667,0.00017334742,0.00014182938,0.00012620934,0.00005640668,0.0035361391],"category_scores_gemma":[0.00006514691,0.00006921489,0.000017706147,0.00073456095,0.00002713514,0.00014040025,0.000014093543,0.00027688532,0.0014334978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018087012,0.000018189523,0.00002365172,0.0000033272872,0.0000036918584,0.000005002477,0.00047645936,0.9825862,0.00088627345,0.000031198288,0.00021556129,0.015748644],"study_design_scores_gemma":[0.00018937263,0.000008157442,0.0001095167,0.000022720027,7.1860904e-7,0.0000030907388,0.00009153011,0.9975412,0.00077016634,0.000012192523,0.0011720425,0.00007929794],"about_ca_topic_score_codex":0.000057316174,"about_ca_topic_score_gemma":0.000086614295,"teacher_disagreement_score":0.063732535,"about_ca_system_score_codex":0.000070490554,"about_ca_system_score_gemma":0.000035159548,"threshold_uncertainty_score":0.999344},"labels":[],"label_agreement":null},{"id":"W2035935080","doi":"10.1287/opre.48.5.671.12410","title":"The Uncapacitated Facility Location Problem with Client Matching","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Facility location problem; Matching (statistics); Computer science; Mathematical optimization; Heuristic; 1-center problem; Greedy algorithm; Location-allocation; Triangle inequality; Mathematics; Statistics","score_opus":0.059186491149751816,"score_gpt":0.30878786840386757,"score_spread":0.24960137725411574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035935080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84955716,0.000086693086,0.002926798,0.018637842,0.000116035815,0.0017771856,0.0000068276913,0.0001938707,0.12669761],"genre_scores_gemma":[0.9802382,0.000051396433,0.00022578794,0.00026564513,0.00010617855,0.00028971746,0.000104461564,0.000008997285,0.018709607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983466,0.00007081155,0.00025923306,0.00028928957,0.00066645246,0.00036759654],"domain_scores_gemma":[0.9987025,0.000027970846,0.00000775167,0.00043609727,0.0008079703,0.000017704477],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018849554,0.00010562747,0.00007331075,0.0001420441,0.0021424652,0.0009529665,0.0003096347,0.000030283369,0.0024315116],"category_scores_gemma":[0.00007584247,0.00006849918,0.000022767555,0.0013419278,0.00017461767,0.0008385066,0.00006777392,0.00023569688,0.0046310993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017491118,0.0003719475,0.00080334157,0.00019130416,0.00006593948,0.0000027914373,0.00088422623,0.7086348,0.00020801321,0.15815456,0.017974611,0.11253359],"study_design_scores_gemma":[0.00067724194,0.000051700154,0.008256637,0.000055669036,0.000019124664,0.0000015577224,0.0039757993,0.23902524,0.00005034831,0.0026994902,0.7448194,0.00036778202],"about_ca_topic_score_codex":0.007393769,"about_ca_topic_score_gemma":0.017831843,"teacher_disagreement_score":0.7268448,"about_ca_system_score_codex":0.00007393926,"about_ca_system_score_gemma":0.00006175132,"threshold_uncertainty_score":0.9992161},"labels":[],"label_agreement":null},{"id":"W2036221507","doi":"10.1287/opre.1080.0642","title":"Optimal Real-Time Traffic Control in Metro Stations","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada)","funders":"","keywords":"Train; Computer science; Scheduling (production processes); Schedule; Routing (electronic design automation); Real-time computing; Branch and bound; Control (management); Process (computing); Real-time Control System; Column generation; Operations research; Mathematical optimization; Computer network; Engineering; Mathematics","score_opus":0.022008900855764395,"score_gpt":0.3124288843492416,"score_spread":0.2904199834934772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036221507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751032,0.00012907565,0.0027858866,0.00041288423,0.000051623163,0.00027057424,0.00001471716,0.00013156164,0.021100476],"genre_scores_gemma":[0.9964749,0.00005556877,0.001579955,0.000009203823,0.000065589324,0.00006885255,0.000019522266,0.000013869277,0.0017125222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988336,0.00011045979,0.00022961834,0.00015179567,0.0002977937,0.0003767253],"domain_scores_gemma":[0.99950194,0.00007725324,0.0000029654225,0.0002142276,0.00012042557,0.00008317463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006707108,0.00008209718,0.00012846738,0.00041356016,0.00018866378,0.00013161292,0.00015117569,0.00005836428,0.00020101489],"category_scores_gemma":[0.00006198264,0.00007891757,0.000027756256,0.0008039528,0.00003019703,0.00017965566,0.000005808408,0.00021910142,0.00027611398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002793674,0.000045898236,0.000013984608,0.0000027684607,0.00000479673,0.000005888758,0.00029590106,0.9790224,0.015993921,0.0012473689,0.0013561301,0.0020081818],"study_design_scores_gemma":[0.00035356314,0.00008269414,0.0016764384,0.000011005939,0.0000013352333,0.0000012141096,0.00023391422,0.99611205,0.00021390553,0.0000060119132,0.0012166572,0.00009122984],"about_ca_topic_score_codex":0.00019896372,"about_ca_topic_score_gemma":0.0006283695,"teacher_disagreement_score":0.021371717,"about_ca_system_score_codex":0.00013041955,"about_ca_system_score_gemma":0.00006916471,"threshold_uncertainty_score":0.35489786},"labels":[],"label_agreement":null},{"id":"W2037937636","doi":"10.1287/opre.1070.0430","title":"Price and Order Postponement in a Decentralized Newsvendor Model with Multiplicative and Price-Dependent Demand","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Postponement; Newsvendor model; Economic order quantity; Microeconomics; Economics; Profit (economics); Order (exchange); Reservation price; Competition (biology); Business; Supply chain; Operations management; Marketing","score_opus":0.05070238379216252,"score_gpt":0.327808316254729,"score_spread":0.2771059324625665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037937636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9568892,0.00030270635,0.01955646,0.0036356382,0.00002872844,0.0019967784,0.0000026521745,0.00004294651,0.017544871],"genre_scores_gemma":[0.9937101,0.00017769392,0.0033399926,0.0005695078,0.00007260798,0.0001744497,0.000019318251,0.000022699876,0.001913621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836296,0.000033817505,0.00024109945,0.00039844247,0.0004788116,0.0004848715],"domain_scores_gemma":[0.9993159,0.00006532404,0.000026897185,0.00021784942,0.00033047854,0.000043510518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017056823,0.00014021742,0.00014105118,0.00054155017,0.00038192386,0.00043323083,0.00014793138,0.000043621923,0.0001325752],"category_scores_gemma":[0.00013099985,0.00011411183,0.0000112982125,0.0007457784,0.00013501212,0.0006628555,0.00029802095,0.00020776261,0.000029483886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041138106,0.0050058486,0.32092422,0.0016981434,0.0005707578,0.00041079347,0.014582823,0.10749832,0.024799898,0.467486,0.0103250565,0.042584352],"study_design_scores_gemma":[0.0066820374,0.000114550654,0.058560286,0.00014382528,0.000032438682,0.00000690352,0.006336059,0.8969445,0.00044127268,0.00082374614,0.029345585,0.0005687872],"about_ca_topic_score_codex":0.0010983894,"about_ca_topic_score_gemma":0.005713547,"teacher_disagreement_score":0.7894462,"about_ca_system_score_codex":0.00009495872,"about_ca_system_score_gemma":0.000046029687,"threshold_uncertainty_score":0.4653345},"labels":[],"label_agreement":null},{"id":"W2038494487","doi":"10.1287/opre.2013.1254","title":"Scheduled Service Network Design for Freight Rail Transportation","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":146,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Operations research; Service quality; Service (business); Transport engineering; Mathematical optimization; Engineering; Mathematics","score_opus":0.09823931024490097,"score_gpt":0.32584816960354257,"score_spread":0.2276088593586416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038494487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003959734,0.0000771137,0.9897795,0.00044958477,0.00012958162,0.0005313082,0.00001946698,0.00009788055,0.004955839],"genre_scores_gemma":[0.87182057,0.0000409285,0.12539595,0.00008631618,0.00050878007,0.00040316535,0.000270425,0.00003885497,0.0014350258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917597,0.000070356306,0.00015913244,0.00012398623,0.00017806333,0.00029252423],"domain_scores_gemma":[0.99919677,0.00021037406,0.0000033533336,0.00018347864,0.0003352414,0.00007076512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000940713,0.00007080274,0.00008899775,0.00006172398,0.00030821457,0.00010685425,0.000117288524,0.00006878252,0.00038166888],"category_scores_gemma":[0.00009091991,0.000068066984,0.000021295868,0.00028739788,0.000022887754,0.00008947161,0.000004464447,0.00015995555,0.00006346999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006390773,0.000011980182,0.00003122584,0.000045133525,0.000011132511,4.869493e-7,0.00010271569,0.9629896,0.000477583,0.022886476,0.010968947,0.0024683166],"study_design_scores_gemma":[0.00022347321,0.000039143193,0.0004076103,0.0000126484565,0.000006240663,3.7401432e-7,0.00001976736,0.9488259,0.00072987616,0.0010258316,0.04861778,0.00009137591],"about_ca_topic_score_codex":0.00008021037,"about_ca_topic_score_gemma":0.00089327706,"teacher_disagreement_score":0.8678608,"about_ca_system_score_codex":0.000025088068,"about_ca_system_score_gemma":0.00004050458,"threshold_uncertainty_score":0.41790065},"labels":[],"label_agreement":null},{"id":"W2038683608","doi":"10.1287/opre.1110.0922","title":"A Unified Framework for Dynamic Prediction Market Design","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Bidding; Function (biology); Mechanism design; Bounded function; Convex optimization; Bellman equation; Regular polygon; Mathematical economics; Economics; Mathematics; Microeconomics","score_opus":0.558322727140912,"score_gpt":0.5555112619072152,"score_spread":0.002811465233696797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038683608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015557734,0.00007970923,0.9910284,0.00075594644,0.00023648089,0.0017373456,0.0001089945,0.000058728023,0.0044385693],"genre_scores_gemma":[0.35191262,0.00009376568,0.60370076,0.000036106474,0.00017409648,0.0014141935,0.000023203442,0.000044786535,0.042600468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99400246,0.00132236,0.00055482396,0.0007436695,0.0026312268,0.00074548303],"domain_scores_gemma":[0.990381,0.005268819,0.000030412155,0.0011407434,0.0029292349,0.000249771],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.013755752,0.000136262,0.00020820968,0.0010285963,0.0012951121,0.00055156543,0.0012738005,0.00018841767,0.0051606596],"category_scores_gemma":[0.02397882,0.00010592952,0.00008759584,0.0025050973,0.00038031128,0.00073684606,0.00024932332,0.00066246797,0.0007824728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042710393,0.0024435725,0.0014554954,0.000063867905,0.0002873847,0.00010344492,0.0146872,0.06309831,0.0069377366,0.16621427,0.22262631,0.51781136],"study_design_scores_gemma":[0.0004518907,0.00057614234,0.003576808,0.000022070255,0.0000037807138,0.0000079404235,0.0017119524,0.70327944,0.0017625528,0.28001928,0.008431868,0.00015628435],"about_ca_topic_score_codex":0.000058161462,"about_ca_topic_score_gemma":0.00013373395,"teacher_disagreement_score":0.6401811,"about_ca_system_score_codex":0.00020192866,"about_ca_system_score_gemma":0.0005149154,"threshold_uncertainty_score":0.9999955},"labels":[],"label_agreement":null},{"id":"W2039188731","doi":"10.1287/opre.1110.0953","title":"TECHNICAL NOTE—Decentralized Inventory Sharing with Asymmetric Information","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Information asymmetry; Incentive; Incentive compatibility; Information sharing; Order (exchange); Business; Microeconomics; Shapley value; Inventory theory; Computer science; Supply chain; Industrial organization; Operations research; Game theory; Economics; Marketing; Finance","score_opus":0.10688045215639169,"score_gpt":0.31877461293883125,"score_spread":0.21189416078243956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039188731","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046273902,0.000077204255,0.018914565,0.0014679385,0.00035880363,0.0018644407,0.00000300104,0.00039111267,0.93064904],"genre_scores_gemma":[0.99449575,0.000024993375,0.002544397,0.00083077507,0.0002521298,0.0002508382,0.00008667144,0.000022112461,0.0014923058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983687,0.000024436573,0.0002714881,0.00022501843,0.00068145327,0.00042895018],"domain_scores_gemma":[0.99905723,0.000014749368,0.000030606323,0.00039461817,0.0004723736,0.000030401101],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012079705,0.00012120362,0.00011386198,0.0012442762,0.00051744824,0.0006565913,0.00046506673,0.00006325768,0.0016563347],"category_scores_gemma":[0.00022332728,0.00009997233,0.000038706152,0.0019087187,0.00011877383,0.003214921,0.00036690527,0.00029275866,0.001912181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025638778,0.00064424414,0.027527858,0.00028591225,0.00004849326,0.000028358963,0.00090411195,0.00087178533,0.00037820346,0.89379185,0.04653522,0.02872757],"study_design_scores_gemma":[0.002709211,0.00015268015,0.025781745,0.00013992132,0.000055271383,0.000006351316,0.0020798678,0.1520661,0.00054773374,0.0024941324,0.8132282,0.00073879847],"about_ca_topic_score_codex":0.0021682663,"about_ca_topic_score_gemma":0.0006893797,"teacher_disagreement_score":0.94822186,"about_ca_system_score_codex":0.00012723668,"about_ca_system_score_gemma":0.00004929931,"threshold_uncertainty_score":0.9992563},"labels":[],"label_agreement":null},{"id":"W2040805004","doi":"10.1287/opre.1080.0629","title":"Dynamics of New Product Introduction in Closed Rental Systems","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Renting; Product (mathematics); Computer science; Independent and identically distributed random variables; Quality (philosophy); Process (computing); Service (business); Set (abstract data type); Mathematical optimization; Business; Random variable; Mathematics; Marketing; Statistics","score_opus":0.05997174526730138,"score_gpt":0.3267792495267479,"score_spread":0.26680750425944655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040805004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81259835,0.00046644924,0.0013297561,0.10361308,0.002293254,0.0034152202,0.0000057149377,0.00014125404,0.07613693],"genre_scores_gemma":[0.9863143,0.000017610504,0.00014228963,0.00007623346,0.002151878,0.000023225346,0.00012447563,0.000009224606,0.011140766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875224,0.000038177488,0.0002742915,0.00025719695,0.00043616467,0.00024192195],"domain_scores_gemma":[0.99941033,0.000008081769,0.000024270701,0.00030626022,0.00023908369,0.000011980674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348142,0.00007889888,0.00012101118,0.0007185061,0.00014199853,0.00027043375,0.00021255713,0.000029909983,0.00024802136],"category_scores_gemma":[0.0001881049,0.000075566946,0.00002612125,0.0011614849,0.00004315242,0.0007423341,0.00007424223,0.00017759258,0.00013814482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009712683,0.00070786005,0.0047500697,0.00021174455,0.000023327484,0.000009194565,0.00028328985,0.03795256,0.0047461097,0.7158873,0.19781722,0.037514184],"study_design_scores_gemma":[0.0018347133,0.00014919821,0.027728317,0.00014759324,0.000019468725,0.000003245835,0.0041315653,0.7241451,0.00062826794,0.003966089,0.23680066,0.00044578602],"about_ca_topic_score_codex":0.0030276699,"about_ca_topic_score_gemma":0.0014937085,"teacher_disagreement_score":0.7119212,"about_ca_system_score_codex":0.00014951333,"about_ca_system_score_gemma":0.000050010396,"threshold_uncertainty_score":0.45769513},"labels":[],"label_agreement":null},{"id":"W2041183433","doi":"10.1287/opre.48.1.129.12455","title":"A Tabu Search Heuristic for the Capacitated arc Routing Problem","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":278,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Routing (electronic design automation); Computer science; Heuristic; Arc (geometry); Vehicle routing problem; Guided Local Search; Operations research; Mathematics; Computer network","score_opus":0.09081247834877422,"score_gpt":0.38017269494339595,"score_spread":0.28936021659462174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041183433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17461358,0.0005036002,0.78360546,0.0033695903,0.00018284042,0.004075391,0.00010051074,0.0007646176,0.03278438],"genre_scores_gemma":[0.8628458,0.00015202504,0.12674232,0.000029872894,0.00018711406,0.0006285801,0.00003909149,0.00007428656,0.009300929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981822,0.00033758994,0.0002649246,0.00021801952,0.00042109942,0.00057616294],"domain_scores_gemma":[0.99811333,0.00096807437,0.0000039505635,0.00037871944,0.0004454508,0.00009046114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030296147,0.00011151667,0.000114192124,0.0001462669,0.0011260549,0.0003552973,0.0003313551,0.00007057533,0.0008759877],"category_scores_gemma":[0.00045446065,0.00008892971,0.00004319878,0.00095667416,0.00012341567,0.00014570326,0.00003152834,0.0005158729,0.00020639504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072271373,0.000016439839,0.000031715157,0.000027976788,0.000024878898,9.068692e-7,0.0013877356,0.97107303,0.0018806739,0.0014989581,0.0011928924,0.022857562],"study_design_scores_gemma":[0.00025253074,0.000033319517,0.00015283607,0.00002237306,0.0000057326824,0.0000056230106,0.0003644028,0.99342775,0.0011934448,0.0000698679,0.004365942,0.00010620001],"about_ca_topic_score_codex":0.00017074293,"about_ca_topic_score_gemma":0.00009223954,"teacher_disagreement_score":0.6882322,"about_ca_system_score_codex":0.00012127246,"about_ca_system_score_gemma":0.00011257996,"threshold_uncertainty_score":0.9591451},"labels":[],"label_agreement":null},{"id":"W2048344733","doi":"10.1287/opre.1100.0845","title":"Average Cost Single-Stage Inventory Models: An Analysis Using a Vanishing Discount Approach","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dynamic programming; Mathematical optimization; Discounting; Markov decision process; Inventory control; Holding cost; Average cost; Time horizon; Stochastic programming; Set (abstract data type); Markov chain; Computer science; Markov process; Mathematical economics; Mathematics; Economics; Operations research; Microeconomics","score_opus":0.21189073373721143,"score_gpt":0.3600370492108812,"score_spread":0.14814631547366977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048344733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8163783,0.000033037817,0.08608302,0.0003666364,0.00040871563,0.0012831768,0.000017338116,0.0001682424,0.09526156],"genre_scores_gemma":[0.9916578,0.0000047570425,0.002998264,0.0004191132,0.0010460358,0.00015773502,0.0003851269,0.00005133595,0.0032798203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710673,0.00011061402,0.0003820919,0.0006670392,0.0010674788,0.0006660361],"domain_scores_gemma":[0.9984215,0.000029465346,0.000051930874,0.00089285756,0.0005342958,0.00006993503],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026908454,0.00022648583,0.0002583377,0.0015936104,0.0014314167,0.003206413,0.00072710885,0.00011472177,0.0014169132],"category_scores_gemma":[0.00016167431,0.00021671718,0.0001438109,0.002406657,0.00021059868,0.0048428313,0.0005103354,0.00071134063,0.00011992886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002149127,0.00089125684,0.0027448267,0.00009674863,0.00019924293,0.000016413798,0.00072771433,0.81458586,0.008575897,0.17048775,0.00070216396,0.0009506262],"study_design_scores_gemma":[0.00027169765,0.000011432219,0.00015968067,0.000008535627,0.00008409408,6.113047e-7,0.0027665691,0.9773966,0.000054203698,0.00042698515,0.018556142,0.00026346062],"about_ca_topic_score_codex":0.005715708,"about_ca_topic_score_gemma":0.007690458,"teacher_disagreement_score":0.17527954,"about_ca_system_score_codex":0.0001870672,"about_ca_system_score_gemma":0.00008009517,"threshold_uncertainty_score":0.9998686},"labels":[],"label_agreement":null},{"id":"W2049461017","doi":"10.1287/opre.1100.0835","title":"Optimal Control of a Mean-Reverting Inventory","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Science and Engineering Foundation; Ajou University","keywords":"Mean reversion; Inventory control; Inventory theory; Inventory management; Impulse (physics); Cycle count; Operations management; Computer science; Control (management); Operations research; Mathematical optimization; Mathematics; Economics; Econometrics","score_opus":0.05925667283727002,"score_gpt":0.3262379166299188,"score_spread":0.26698124379264876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049461017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92659235,0.00004140594,0.0012443422,0.0020859865,0.00043119863,0.0006040473,0.0000028639035,0.000057317753,0.06894051],"genre_scores_gemma":[0.99568933,0.0000030431897,0.00049923337,0.00042208028,0.00080562953,0.000090466165,0.000013489863,0.000018339148,0.0024583999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858826,0.000036396857,0.00027419793,0.00022163961,0.0005514398,0.00032804944],"domain_scores_gemma":[0.99899083,0.000044477896,0.00003127871,0.0003530566,0.00056038256,0.000019962254],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019100885,0.0000924745,0.00013228739,0.00048933364,0.0003935822,0.00028041023,0.00036811378,0.00005449749,0.0023223753],"category_scores_gemma":[0.00046392376,0.000085161635,0.000061309795,0.0005738179,0.00017549733,0.0007196805,0.00020469891,0.00037301917,0.00051984243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107618434,0.00078041723,0.02102296,0.00038028482,0.00014591345,0.00002136953,0.00072937284,0.013364913,0.15921322,0.74246836,0.050674696,0.0110909045],"study_design_scores_gemma":[0.001937347,0.00004849382,0.0035622574,0.000058535832,0.00003611895,0.0000014967856,0.0019964515,0.56834275,0.0022583592,0.0007297734,0.42066905,0.00035940204],"about_ca_topic_score_codex":0.0010594814,"about_ca_topic_score_gemma":0.0010248933,"teacher_disagreement_score":0.74173856,"about_ca_system_score_codex":0.000021600916,"about_ca_system_score_gemma":0.000052581003,"threshold_uncertainty_score":0.99858963},"labels":[],"label_agreement":null},{"id":"W2051358678","doi":"10.1287/opre.1060.0283","title":"A Branch-and-Cut Algorithm for the Dial-a-Ride Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":672,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Travelling salesman problem; Vehicle routing problem; Computer science; Integer programming; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Branch and price; 2-opt; Traveling purchaser problem; Algorithm; Mathematics; Computer network","score_opus":0.044993797217322926,"score_gpt":0.3588639218862965,"score_spread":0.31387012466897357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051358678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041259467,0.00040897675,0.9898782,0.0011480595,0.000073257484,0.00082602253,0.000024578887,0.00012990882,0.0033850938],"genre_scores_gemma":[0.21456799,0.00018959008,0.7757881,0.00003309386,0.00058664434,0.0011161393,0.000043183896,0.00007318611,0.0076020337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909866,0.00010996548,0.00016061135,0.0001387428,0.00021305717,0.0002789523],"domain_scores_gemma":[0.9990296,0.0005066628,0.0000037320729,0.00020319784,0.00021923071,0.00003757239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196903,0.00007237522,0.00007705641,0.000100170255,0.00057860004,0.00024746236,0.00013909917,0.00005021537,0.000041482886],"category_scores_gemma":[0.00012690864,0.000055945322,0.000025143827,0.00036829917,0.00007633612,0.00011551698,0.00003906368,0.00020535958,0.000021535152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015121934,0.000015294867,0.000043253294,0.000019842786,0.000015617734,5.008947e-7,0.00017327207,0.87141883,0.0028532785,0.0038937354,0.003926619,0.11763823],"study_design_scores_gemma":[0.00021144692,0.000015390193,0.00026274534,0.000007405521,0.0000043457694,0.000004332659,0.000033976503,0.9854132,0.0028670093,0.0003565242,0.010752422,0.00007120999],"about_ca_topic_score_codex":0.00020521387,"about_ca_topic_score_gemma":0.00020835568,"teacher_disagreement_score":0.21409002,"about_ca_system_score_codex":0.00004661217,"about_ca_system_score_gemma":0.000042831478,"threshold_uncertainty_score":0.44501823},"labels":[],"label_agreement":null},{"id":"W2051455848","doi":"10.1287/opre.1080.0617","title":"Joint Design and Pricing on a Network","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Joint (building); Computer science; Mathematical optimization; Revenue; Process (computing); Service (business); Integer (computer science); Relaxation (psychology); Feature (linguistics); Network planning and design; Operations research; Microeconomics; Economics; Business; Marketing; Mathematics; Engineering; Telecommunications","score_opus":0.23010109357432437,"score_gpt":0.3253705734276819,"score_spread":0.09526947985335751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051455848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62044543,0.00035046437,0.029813005,0.012464869,0.0005931219,0.0029797792,8.43143e-7,0.00027713078,0.33307534],"genre_scores_gemma":[0.9886431,0.00008149356,0.0019514048,0.0015320888,0.0011123726,0.00011902357,0.0000087926355,0.000018949679,0.006532767],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989056,0.0000522415,0.00013331347,0.00022200268,0.0003718784,0.00031498267],"domain_scores_gemma":[0.9995676,0.000050530733,0.000010181949,0.0002008672,0.00015508747,0.000015690994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011839204,0.00007970405,0.00008562015,0.00029358664,0.0011724255,0.00030609372,0.00011538007,0.000028041664,0.00040675158],"category_scores_gemma":[0.00014423371,0.000069109585,0.000019752239,0.0005664448,0.00009558156,0.0004096297,0.00017488527,0.00017663017,0.0006604092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066695735,0.00025537345,0.0022994787,0.000083852385,0.000045597422,0.00009200059,0.00040164293,0.17773913,0.0008415582,0.3230394,0.48886377,0.006271511],"study_design_scores_gemma":[0.0008668535,0.00011762585,0.013530246,0.000109203305,0.000011225496,0.0000072799585,0.0005132589,0.52644837,0.00016178617,0.0018187526,0.45605972,0.00035567256],"about_ca_topic_score_codex":0.00029733562,"about_ca_topic_score_gemma":0.00003913675,"teacher_disagreement_score":0.36819765,"about_ca_system_score_codex":0.000037032343,"about_ca_system_score_gemma":0.000031154905,"threshold_uncertainty_score":0.90174675},"labels":[],"label_agreement":null},{"id":"W2053714494","doi":"10.1287/opre.2013.1173","title":"Data Envelopment Analysis with Nonhomogeneous DMUs","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Homogeneity (statistics); Missing data; Value (mathematics); Homogeneous; Computer science; Set (abstract data type); Econometrics; Mathematical optimization; Operations research; Mathematics; Statistics","score_opus":0.3976795714158436,"score_gpt":0.5188015055533886,"score_spread":0.12112193413754496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053714494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88912344,0.00020860636,0.078011096,0.009180322,0.00006977308,0.0008082369,0.00010886087,0.00005512458,0.022434557],"genre_scores_gemma":[0.9627788,0.000020348065,0.015370469,0.000083067505,0.000048107257,0.000077192104,0.0001344231,0.000010297123,0.021477275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99277455,0.0008023183,0.0005741771,0.001036804,0.0043042544,0.00050788093],"domain_scores_gemma":[0.99234045,0.001089702,0.00003638107,0.0037053651,0.0026074024,0.0002206878],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008491386,0.00012408674,0.00029120944,0.0019707829,0.0011688141,0.0023692262,0.0031002678,0.000058107296,0.007337046],"category_scores_gemma":[0.0031964886,0.00007684116,0.00006940274,0.011917659,0.00034382622,0.000790302,0.0008576143,0.00029747668,0.0077451994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035899255,0.0011092647,0.038261417,0.0000046747136,0.0018593558,0.00010462317,0.002517591,0.68469363,0.007413255,0.003438468,0.10533884,0.15522297],"study_design_scores_gemma":[0.00017278222,0.00009016787,0.021821022,0.0000048787474,0.00010753919,0.000009350715,0.0013250902,0.9384067,0.00051307946,0.00027884834,0.03704172,0.0002287921],"about_ca_topic_score_codex":0.0023275563,"about_ca_topic_score_gemma":0.0111087235,"teacher_disagreement_score":0.25371307,"about_ca_system_score_codex":0.00008726639,"about_ca_system_score_gemma":0.00052219525,"threshold_uncertainty_score":0.9986664},"labels":[],"label_agreement":null},{"id":"W2054587269","doi":"10.1287/opre.1080.0602","title":"On a Data-Driven Method for Staffing Large Call Centers","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Staffing; Computer science; Mathematical optimization; Simple (philosophy); Class (philosophy); Abandonment (legal); Operations research; Mathematics; Artificial intelligence","score_opus":0.11256234357756166,"score_gpt":0.44164854840340784,"score_spread":0.32908620482584616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054587269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027624015,0.000036719455,0.9429539,0.012432238,0.00012802551,0.0012319171,0.00012130621,0.00018234484,0.015289531],"genre_scores_gemma":[0.93263835,0.0000091128295,0.057748314,0.003033086,0.00091652555,0.000096523436,0.0010811024,0.000039316245,0.004437672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985666,0.00007700177,0.00017929863,0.00040925405,0.00034863097,0.000419174],"domain_scores_gemma":[0.9986146,0.00025798872,0.000022186296,0.0006971327,0.00039114853,0.000016939763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002400353,0.00009771277,0.00013683779,0.00044982464,0.0008868589,0.0004869221,0.0005985459,0.000038959093,0.00019527548],"category_scores_gemma":[0.001516359,0.00008864385,0.000047931826,0.00072277524,0.000025636835,0.0011138808,0.00022575082,0.0002220823,0.00023553375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014655553,0.00037767133,0.000040947925,0.00003379303,0.000056535206,0.000008511446,0.00008889321,0.16161147,0.0030438295,0.7888273,0.029338652,0.016425839],"study_design_scores_gemma":[0.00043119848,0.000029976918,0.00004351938,0.000026099227,0.00002096551,2.6029392e-7,0.0001695094,0.91588664,0.00006205048,0.007239031,0.07597204,0.0001187205],"about_ca_topic_score_codex":0.00013097332,"about_ca_topic_score_gemma":0.0006141474,"teacher_disagreement_score":0.90501434,"about_ca_system_score_codex":0.000057603447,"about_ca_system_score_gemma":0.000031854623,"threshold_uncertainty_score":0.6821091},"labels":[],"label_agreement":null},{"id":"W2063249628","doi":"10.1287/opre.1030.0091","title":"A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Representation (politics); Flow network; Field (mathematics); Traffic flow (computer networking); Work (physics); Arc (geometry); Flow (mathematics); Operations research; Mathematical optimization; Theoretical computer science; Management science; Computer network; Mathematics","score_opus":0.1596230623152449,"score_gpt":0.40318978250698306,"score_spread":0.24356672019173817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063249628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86528146,0.000043692013,0.12829822,0.0012404976,0.00003927704,0.00047477122,0.000021303875,0.000032110685,0.0045686527],"genre_scores_gemma":[0.9921034,0.000097750366,0.0071771718,0.000012338301,0.000014719586,0.000048501654,0.000067444176,0.000006012613,0.00047268113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986935,0.00022730784,0.0002158282,0.00013396404,0.00047740884,0.00025196004],"domain_scores_gemma":[0.99951744,0.00006388213,0.00001208444,0.00007766755,0.00025946944,0.000069440284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503025,0.00004741267,0.000081565995,0.00020719787,0.00035793608,0.00007412575,0.00010273207,0.000066272856,0.000071480485],"category_scores_gemma":[0.000066196255,0.00004785679,0.000017086171,0.0008163366,0.00017664333,0.00017521973,0.0000033118706,0.00019657472,0.000007463357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008016575,0.00009638581,0.000046577272,0.000003849046,0.0000032718722,0.0000017160152,0.01520282,0.9719063,0.000081037724,0.012409289,0.0000204884,0.000220261],"study_design_scores_gemma":[0.00035089173,0.000037201844,0.00011206078,0.000030669697,0.0000018734395,6.356287e-8,0.00766218,0.9912199,0.000023405515,0.0005027891,0.000008293861,0.000050715455],"about_ca_topic_score_codex":0.0018562143,"about_ca_topic_score_gemma":0.023513071,"teacher_disagreement_score":0.1268219,"about_ca_system_score_codex":0.0001539456,"about_ca_system_score_gemma":0.00078406284,"threshold_uncertainty_score":0.99430525},"labels":[],"label_agreement":null},{"id":"W2064035628","doi":"10.1287/opre.51.4.655.16098","title":"Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Neighbourhood (mathematics); Tabu search; Mathematical optimization; Fixed charge; Network planning and design; Metaheuristic; Flow network; Computer science; Simple (philosophy); Flow (mathematics); Multi-commodity flow problem; Mathematics","score_opus":0.12441746632498082,"score_gpt":0.37505291087653597,"score_spread":0.2506354445515552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064035628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005515533,0.00009806172,0.9904651,0.00024103042,0.00021902494,0.0010358577,0.000028786764,0.00026234772,0.0021342558],"genre_scores_gemma":[0.38130862,0.0000125964925,0.61766064,0.00004566898,0.0000958299,0.00040382057,0.000043311626,0.000060793827,0.00036874053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746144,0.0010176143,0.0002924229,0.0002496893,0.0003156968,0.0006631611],"domain_scores_gemma":[0.997775,0.0011341514,0.000009602235,0.00041395516,0.0005092947,0.00015799461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037525422,0.00015247599,0.00017561785,0.00018519291,0.00077746034,0.00022092332,0.00020612999,0.00013663704,0.00040526773],"category_scores_gemma":[0.0017379248,0.00016101787,0.00005745428,0.0008424799,0.00007368735,0.00016695722,0.000015292673,0.0004027746,0.0000939937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009134175,0.000042274136,0.00007439404,0.000022635322,0.000019187068,9.17448e-7,0.00010135939,0.98707694,0.0027531711,0.0040538386,0.005155132,0.00069101795],"study_design_scores_gemma":[0.0006465916,0.000051234816,0.00005007425,0.000015032765,0.0000061259498,0.0000013106239,0.000022027087,0.9808561,0.014160385,0.00020245426,0.0038146295,0.00017401489],"about_ca_topic_score_codex":0.000023253817,"about_ca_topic_score_gemma":0.000028543647,"teacher_disagreement_score":0.37579307,"about_ca_system_score_codex":0.00016725429,"about_ca_system_score_gemma":0.00017002206,"threshold_uncertainty_score":0.6566118},"labels":[],"label_agreement":null},{"id":"W2072078883","doi":"10.1287/opre.1060.0278","title":"Dual-Optimal Inequalities for Stabilized Column Generation","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Dual (grammatical number); Mathematical optimization; Column generation; Mathematics; Linear programming; Column (typography); Binary number; Convergence (economics); Reduction (mathematics); Degeneracy (biology); Computer science","score_opus":0.12007847672213226,"score_gpt":0.35955937299492363,"score_spread":0.23948089627279137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072078883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61211795,0.00043010223,0.3580205,0.0011982069,0.00059446506,0.0022581643,0.00025014026,0.00061263127,0.024517845],"genre_scores_gemma":[0.9516672,0.000046585974,0.033444893,0.000017751694,0.00047564987,0.0006323897,0.0006912465,0.000040150586,0.012984124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990798,0.000069749636,0.00022069961,0.00013703955,0.00023321105,0.00025948792],"domain_scores_gemma":[0.9992871,0.000089189416,0.0000043373075,0.0001661158,0.00041445918,0.00003876365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061904243,0.00007598206,0.00008781269,0.00016859105,0.00040224462,0.000322883,0.00006472718,0.00006590577,0.000361585],"category_scores_gemma":[0.00008245633,0.00008058489,0.000029639321,0.00030321686,0.000047870522,0.000202597,0.00001488418,0.00012141491,0.000057235466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034717316,0.00002389052,0.000023856388,0.00002519279,0.0000065077597,2.5171843e-7,0.00023036177,0.9329107,0.028296484,0.016492642,0.02175947,0.00022716225],"study_design_scores_gemma":[0.00040667775,0.00004343287,0.000040548442,0.000005830163,0.0000024686476,0.0000011247271,0.0001217358,0.95179063,0.011243285,0.0001068622,0.03612456,0.000112842965],"about_ca_topic_score_codex":0.00016807884,"about_ca_topic_score_gemma":0.0010421947,"teacher_disagreement_score":0.33954927,"about_ca_system_score_codex":0.00008227115,"about_ca_system_score_gemma":0.00006467147,"threshold_uncertainty_score":0.3959102},"labels":[],"label_agreement":null},{"id":"W2072310184","doi":"10.1287/opre.1090.0803","title":"Subproblem Approximation in Dantzig-Wolfe Decomposition of Variational Inequality Models with an Application to a Multicommodity Economic Equilibrium Model","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Variational inequality; Parameterized complexity; Mathematics; Mathematical optimization; Mathematical economics; Inverse; Convergence (economics); Applied mathematics; Economics; Combinatorics","score_opus":0.06283831369694398,"score_gpt":0.3800135655064066,"score_spread":0.3171752518094626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072310184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21677877,8.359076e-7,0.7805046,0.0018089452,0.000019480047,0.00049549586,0.00003255911,0.000028599277,0.00033074318],"genre_scores_gemma":[0.61390156,9.744957e-7,0.38564828,0.000031825162,0.000020906264,0.00019241119,0.00017671112,0.000006012588,0.0000213349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804884,0.00026088467,0.0004596932,0.00047578,0.00052898994,0.0002258137],"domain_scores_gemma":[0.9982728,0.00010784243,0.000054667515,0.0006536943,0.00077210285,0.00013889805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018656561,0.000108771186,0.00016728841,0.0005924799,0.00020961517,0.0002553435,0.0005955331,0.00008394614,0.000028535802],"category_scores_gemma":[0.00005645163,0.000103430284,0.000029182234,0.0009121812,0.00004864838,0.0020335934,0.0001580575,0.00026252697,0.000023469513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017530407,0.0001941905,0.0002242831,0.000005015584,0.0000049907176,6.992055e-8,0.00046192994,0.64514446,0.011534437,0.34209183,0.000006487298,0.00031479154],"study_design_scores_gemma":[0.00034604192,0.00006671787,0.002153692,0.0000052789073,0.0000030152646,0.0000011251373,0.000021283686,0.9846834,0.0013856731,0.011210106,0.0000042666475,0.00011941891],"about_ca_topic_score_codex":0.001141649,"about_ca_topic_score_gemma":0.0051087956,"teacher_disagreement_score":0.39712277,"about_ca_system_score_codex":0.00014969705,"about_ca_system_score_gemma":0.00049040513,"threshold_uncertainty_score":0.42177644},"labels":[],"label_agreement":null},{"id":"W2074827511","doi":"10.1287/opre.2014.1305","title":"Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Marketing; Word of mouth; Profit (economics); Time horizon; Computer science; Product (mathematics); Digital marketing; Service (business); Marketing mix; Business; Marketing strategy; Multi-level marketing; Phone; New product development; Economics; Mathematics","score_opus":0.23667949996030535,"score_gpt":0.48841302498512673,"score_spread":0.2517335250248214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074827511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9444059,0.00010249166,0.011416115,0.03426534,0.00041186975,0.00075772684,0.0000067452434,0.00005239936,0.008581385],"genre_scores_gemma":[0.930587,0.000010217328,0.012217608,0.00022065597,0.0005836228,0.000024798743,0.000013008653,0.000013428885,0.056329682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996068,0.00079691585,0.0008915526,0.0005174491,0.0014081678,0.0003179248],"domain_scores_gemma":[0.99110466,0.0014008421,0.00013469049,0.0007733224,0.0064407503,0.00014575233],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0199631,0.00009391771,0.00018726863,0.00075819215,0.0007583545,0.00046455648,0.00043289753,0.000047770434,0.0022446176],"category_scores_gemma":[0.06478703,0.00006651448,0.000019475588,0.0051864143,0.00015051808,0.00042363297,0.00024848836,0.00027431775,0.00017642906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014614098,0.00012140345,0.0047269766,0.000050915336,0.000013404508,4.8626356e-7,0.0040654154,0.0033925294,0.0087396065,0.0101816505,0.081215955,0.8873455],"study_design_scores_gemma":[0.002348543,0.00023702112,0.13633053,0.0003166191,0.00002149102,0.000113458045,0.026129497,0.34904245,0.010097423,0.010243193,0.46433142,0.00078836473],"about_ca_topic_score_codex":0.00032326567,"about_ca_topic_score_gemma":0.00107204,"teacher_disagreement_score":0.88655716,"about_ca_system_score_codex":0.000027540682,"about_ca_system_score_gemma":0.0005275056,"threshold_uncertainty_score":0.9986675},"labels":[],"label_agreement":null},{"id":"W2077559824","doi":"10.1287/opre.1090.0705","title":"Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"GAVI Alliance","keywords":"Markov decision process; Monotone polygon; Mathematical optimization; Algorithm; Convergence (economics); Markov chain; Operator (biology); Mathematics; Computer science; Dynamic programming; Contraction (grammar); Acceleration; Linear programming; Markov process","score_opus":0.10822638641660903,"score_gpt":0.42880517446279043,"score_spread":0.3205787880461814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077559824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009757719,0.0000673095,0.9818187,0.0057702656,0.000105772706,0.0012870256,0.0000015119882,0.0000402798,0.0011514447],"genre_scores_gemma":[0.8128249,0.00008020664,0.18509606,0.0007144877,0.00016124222,0.00033018296,0.00004814017,0.000008973081,0.00073583465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977187,0.0003241357,0.0003447509,0.0003712643,0.00086636865,0.00037476543],"domain_scores_gemma":[0.9979531,0.00059941225,0.000019266816,0.0005584999,0.00082908035,0.0000406373],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028564443,0.00011280189,0.000102523554,0.00036786147,0.0009367064,0.0022530328,0.0011440108,0.000076192664,0.000013433677],"category_scores_gemma":[0.0014550589,0.000081646765,0.00002917321,0.0017628096,0.00003673348,0.0015463609,0.00008199775,0.00031495857,0.00003683981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012026436,0.00009530191,0.00006697046,0.000013169794,0.0000030627004,0.000002884918,0.0026387835,0.89757675,0.00085499056,0.046758115,0.0023390495,0.049638905],"study_design_scores_gemma":[0.0003521733,0.00035640004,0.0011136219,0.000036246125,0.0000012755589,0.000005072714,0.00015705412,0.9922379,0.0012685873,0.00077928597,0.0035832785,0.000109095046],"about_ca_topic_score_codex":0.000028891267,"about_ca_topic_score_gemma":0.00007713408,"teacher_disagreement_score":0.80306715,"about_ca_system_score_codex":0.00011348617,"about_ca_system_score_gemma":0.0003894376,"threshold_uncertainty_score":0.9987827},"labels":[],"label_agreement":null},{"id":"W2078227935","doi":"10.1287/opre.1090.0713","title":"Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":198,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Knapsack problem; Mathematical optimization; Computer science; Relaxation (psychology); Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Set (abstract data type); Bounded function; Mathematics; Computer network","score_opus":0.03652744760081844,"score_gpt":0.32538523900211375,"score_spread":0.2888577914012953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078227935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65837157,0.0009707982,0.3207959,0.007080074,0.000051797648,0.0032150387,0.000026580477,0.00046524982,0.009022999],"genre_scores_gemma":[0.9147499,0.00012661472,0.08312275,0.000074551135,0.00010606757,0.00012665981,0.0000085813335,0.000034175282,0.0016507054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.0001276438,0.00017801051,0.00020972744,0.00024962358,0.0003605163],"domain_scores_gemma":[0.9989249,0.0005055119,0.000008233385,0.00023964018,0.0002412758,0.00008041688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015595258,0.00010890198,0.00012078943,0.000103381615,0.0007565379,0.00032307277,0.00014934198,0.000061009516,0.000035315195],"category_scores_gemma":[0.00016081314,0.0000788769,0.00001950158,0.0004065693,0.000081225204,0.00022793925,0.00004233787,0.00029742162,0.000019201714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003084413,0.000025680374,0.00029036298,0.00003625779,0.000046384466,0.0000012145426,0.0012810288,0.9149184,0.020553825,0.0043800646,0.0005323803,0.057903506],"study_design_scores_gemma":[0.00042716382,0.00012613657,0.0018376483,0.000030989057,0.000009850473,0.000009273521,0.00009307171,0.99474084,0.0017249095,0.00009390914,0.00079008547,0.000116091825],"about_ca_topic_score_codex":0.000029312096,"about_ca_topic_score_gemma":0.000022353992,"teacher_disagreement_score":0.25637832,"about_ca_system_score_codex":0.000052017756,"about_ca_system_score_gemma":0.000055014978,"threshold_uncertainty_score":0.58187544},"labels":[],"label_agreement":null},{"id":"W2078286604","doi":"10.1287/opre.1080.0603","title":"Technical Note—A Risk-Averse Newsvendor Model Under the CVaR Criterion","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":332,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education of the People's Republic of China","keywords":"Newsvendor model; CVAR; Economics; Comparative statics; Expected shortfall; Multiplicative function; Mathematical economics; Econometrics; Risk measure; Mathematical optimization; Mathematics; Risk management; Microeconomics; Supply chain; Financial economics","score_opus":0.09269831753737455,"score_gpt":0.36495761886079714,"score_spread":0.2722593013234226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078286604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13780479,0.0002765495,0.20032778,0.16267727,0.000826576,0.0044176867,0.000023899955,0.0007360373,0.4929094],"genre_scores_gemma":[0.9858356,0.00004941236,0.0013868704,0.0042877477,0.0007780537,0.00008668052,0.0000359246,0.000018640892,0.007521032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998371,0.000068261535,0.00021695378,0.00030034973,0.00063774927,0.0004056994],"domain_scores_gemma":[0.99908394,0.000058047983,0.000022442817,0.00054144615,0.00027323898,0.000020895774],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014606027,0.00012313767,0.0001022926,0.00032537224,0.001272534,0.000887261,0.0005018633,0.000065895554,0.00077697204],"category_scores_gemma":[0.00027316253,0.00008758731,0.00007251726,0.00073726644,0.00012921303,0.00083080796,0.000246565,0.000455591,0.0011763846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006622164,0.00047838356,0.00013750771,0.00002791845,0.000014789271,0.000012758607,0.00018815549,0.18030326,0.007209294,0.5477339,0.24389637,0.019931441],"study_design_scores_gemma":[0.00034176122,0.000025035148,0.0013116944,0.000014473517,0.000016656764,8.89042e-7,0.00055437826,0.8422463,0.00005603974,0.0068738125,0.14841647,0.00014249056],"about_ca_topic_score_codex":0.0007598304,"about_ca_topic_score_gemma":0.0006178938,"teacher_disagreement_score":0.84803087,"about_ca_system_score_codex":0.0000988393,"about_ca_system_score_gemma":0.000049452385,"threshold_uncertainty_score":0.9996013},"labels":[],"label_agreement":null},{"id":"W2078854659","doi":"10.1287/opre.1110.0934","title":"TECHNICAL NOTE—Queueing Systems with Synergistic Servers","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Server; Computer science; Throughput; Queueing theory; Distributed computing; Markov process; Computer network; Operating system; Mathematics; Wireless","score_opus":0.08291687160238158,"score_gpt":0.33351531416601654,"score_spread":0.25059844256363495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078854659","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22482906,0.0001792404,0.3323872,0.0010951562,0.00032607396,0.0017112512,0.0000067223596,0.000796819,0.43866846],"genre_scores_gemma":[0.9941078,0.000003141047,0.0028269442,0.00006815982,0.00031021115,0.00012528208,0.000016715429,0.000029609384,0.0025121758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862593,0.00006410572,0.00019507854,0.00030219328,0.00045802124,0.00035465974],"domain_scores_gemma":[0.99883705,0.000079165125,0.000025183115,0.00044834273,0.00058890163,0.000021324066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219932,0.00011101679,0.00014487485,0.0004772566,0.00072213303,0.0004013943,0.00035526854,0.000059044225,0.0004255189],"category_scores_gemma":[0.0004450725,0.00008818825,0.000034807545,0.0013665853,0.00019191798,0.0010680495,0.00017730721,0.00032304955,0.00076896674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001125799,0.00018342506,0.0011238599,0.00013573846,0.000038999788,0.000111432215,0.00013396883,0.09465153,0.0056476,0.896185,0.0007921964,0.0008837027],"study_design_scores_gemma":[0.0011331534,0.00013259923,0.0015260213,0.00048466388,0.00021139323,0.000023797631,0.0031649556,0.95441735,0.0011030895,0.0067255786,0.030013045,0.0010643657],"about_ca_topic_score_codex":0.0026927427,"about_ca_topic_score_gemma":0.001593432,"teacher_disagreement_score":0.8894594,"about_ca_system_score_codex":0.000081584425,"about_ca_system_score_gemma":0.000052050684,"threshold_uncertainty_score":0.9883768},"labels":[],"label_agreement":null},{"id":"W2086768946","doi":"10.1287/opre.49.1.145.11186","title":"Reducing Delay in Preemptive Repeat Priority Queues","year":2001,"lang":"en","type":"article","venue":"Operations Research","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Computer science; Computer network","score_opus":0.0850953309610087,"score_gpt":0.39908738632059065,"score_spread":0.31399205535958197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086768946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9165644,0.00024639317,0.052730836,0.0022588565,0.00016085307,0.0007610389,0.0000010604288,0.00011038161,0.027166193],"genre_scores_gemma":[0.9575207,0.00006972912,0.038513985,0.000015517759,0.00011530049,0.00012075985,0.0000029324476,0.0000101900205,0.0036308384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724513,0.0006704762,0.00033474382,0.00055694644,0.0006811958,0.00051147625],"domain_scores_gemma":[0.99826485,0.00021009696,0.000015884449,0.000901437,0.00048812057,0.00011960876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033592826,0.00009910662,0.00014745526,0.00045467142,0.0004531345,0.00074347813,0.00086309854,0.00008115262,0.000041523188],"category_scores_gemma":[0.00064664526,0.00009307167,0.000033087144,0.0016579423,0.00007327105,0.0013879912,0.00039384578,0.00049874105,0.00029280703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095421194,0.0013870365,0.05148638,0.00013734955,0.00011636748,0.0016973075,0.07004808,0.31134745,0.14436239,0.28294313,0.0058350298,0.13054405],"study_design_scores_gemma":[0.0004754983,0.0001697727,0.010688783,0.00019771753,0.0000013683564,0.00016490428,0.0008158123,0.977368,0.006492789,0.0006606997,0.0026635334,0.0003011175],"about_ca_topic_score_codex":0.007050264,"about_ca_topic_score_gemma":0.0029727668,"teacher_disagreement_score":0.6660205,"about_ca_system_score_codex":0.00029099968,"about_ca_system_score_gemma":0.0004298321,"threshold_uncertainty_score":0.99956185},"labels":[],"label_agreement":null},{"id":"W2090486231","doi":"10.1287/opre.48.5.761.12406","title":"Manufacturing to Order with Random Yield and Costly Inspection","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Production (economics); Order (exchange); Yield (engineering); Key (lock); Operations research; Mathematical optimization; Mathematics; Economics; Microeconomics","score_opus":0.0535474151393696,"score_gpt":0.29819078264280685,"score_spread":0.24464336750343724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090486231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8269228,0.000028240773,0.00060143357,0.005244222,0.00008130316,0.0008149216,9.392944e-7,0.00010051075,0.16620563],"genre_scores_gemma":[0.98059654,0.00004701381,0.00037594402,0.0013255634,0.0006114482,0.00016002015,0.0000135977625,0.00001836296,0.016851496],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905604,0.000015139977,0.00010838143,0.00024059467,0.00033323996,0.0002466218],"domain_scores_gemma":[0.9995139,0.00003500727,0.0000053921385,0.00018500852,0.00023835039,0.000022297],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004888968,0.0000838608,0.00008131849,0.00033923925,0.00067767914,0.0007351266,0.00011304967,0.000025513924,0.0036372766],"category_scores_gemma":[0.00012109846,0.00006721962,0.000011605416,0.00050109584,0.000054748587,0.00066591304,0.000079732585,0.00014236395,0.0009808114],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027073799,0.0010366944,0.011424439,0.0006316009,0.0003104642,0.00010739802,0.0019375262,0.12453077,0.0035087273,0.049333304,0.5224253,0.2820464],"study_design_scores_gemma":[0.0017649399,0.0000884932,0.0087004835,0.00009859191,0.000016940521,0.0000023584928,0.0011623504,0.0172679,0.001021962,0.00016841936,0.96940637,0.00030116804],"about_ca_topic_score_codex":0.0018638156,"about_ca_topic_score_gemma":0.0030413787,"teacher_disagreement_score":0.4469811,"about_ca_system_score_codex":0.000034387922,"about_ca_system_score_gemma":0.000017745186,"threshold_uncertainty_score":0.99979705},"labels":[],"label_agreement":null},{"id":"W2092472841","doi":"10.1287/opre.48.1.26.12456","title":"Stability of Multiclass Queueing Networks Under Priority Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Stability (learning theory); Layered queueing network; Computer science; Mathematical optimization; Set (abstract data type); Lyapunov function; Service (business); Lyapunov optimization; Queueing system; Mathematics; Computer network; Nonlinear system; Artificial intelligence; Lyapunov equation","score_opus":0.0708570981113848,"score_gpt":0.36531046775722054,"score_spread":0.29445336964583574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092472841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98482937,0.00004697542,0.005257444,0.002121558,0.000038062048,0.00028900465,0.000002631914,0.000057822006,0.0073571634],"genre_scores_gemma":[0.9978157,0.000015117102,0.0006662105,0.00017640388,0.0003671249,0.000031375566,0.000029243807,0.000017281038,0.0008815373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998582,0.000114824266,0.0002968417,0.00029530385,0.0003907946,0.0003202248],"domain_scores_gemma":[0.99839497,0.0001863434,0.000025739024,0.00048777327,0.0008877862,0.00001741304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001721248,0.000103622624,0.00017204475,0.00017075222,0.0006547493,0.00023499932,0.00032091202,0.00006007574,0.0025245512],"category_scores_gemma":[0.0002595595,0.00009232306,0.00005360382,0.0017968928,0.00015557732,0.0011467568,0.00019751687,0.000292449,0.00020931273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007596519,0.00023944554,0.0039556418,0.000095251424,0.00003825765,0.0000017630815,0.0001640741,0.9508962,0.002737243,0.035381433,0.00007789542,0.00633684],"study_design_scores_gemma":[0.00023679565,0.0000054330776,0.0040770704,0.00003260425,0.00002093652,2.4276798e-7,0.00058002915,0.98943377,0.00034300663,0.0031598867,0.0019757627,0.00013444397],"about_ca_topic_score_codex":0.002388021,"about_ca_topic_score_gemma":0.00840863,"teacher_disagreement_score":0.0385376,"about_ca_system_score_codex":0.000056429933,"about_ca_system_score_gemma":0.000042656877,"threshold_uncertainty_score":0.9983873},"labels":[],"label_agreement":null},{"id":"W2094141022","doi":"10.1287/opre.1080.0622","title":"Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Windsor","funders":"","keywords":"Supply chain; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Holding cost; Supply chain management; Approximation algorithm; Total cost; Inventory cost; Algorithm; Mathematics; Economics; Schedule; Business; Microeconomics; Marketing","score_opus":0.04923602046159838,"score_gpt":0.3225391663908933,"score_spread":0.27330314592929494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094141022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0945974,0.0011576648,0.8956295,0.004972297,0.0002174207,0.0024431455,0.000042649637,0.00024333177,0.0006965646],"genre_scores_gemma":[0.3784172,0.00029163572,0.61972666,0.00016066249,0.0002706309,0.0006065907,0.00007810887,0.000036199403,0.00041228245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998755,0.00006416658,0.00023664522,0.00024834016,0.00031499335,0.0003808511],"domain_scores_gemma":[0.99906474,0.00022193091,0.000007952968,0.00023156509,0.00033037068,0.00014341825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054051,0.0001277098,0.00012197001,0.0002827243,0.0007212445,0.00041825225,0.00019954758,0.00008494294,0.000029377985],"category_scores_gemma":[0.00020487106,0.000109630324,0.00003239479,0.00052142795,0.0000464456,0.00022867069,0.000037599733,0.00026955936,0.000021860309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012710694,0.000027956654,0.000028991313,0.000021259611,0.00002070162,6.62278e-7,0.0010986223,0.9358908,0.0028098628,0.0019248482,0.0006371501,0.057526458],"study_design_scores_gemma":[0.0004065407,0.000058630565,0.00016683686,0.00004127897,0.0000069520033,0.0000035261933,0.00090929127,0.9951579,0.0025383502,0.00008575737,0.00048755165,0.00013741618],"about_ca_topic_score_codex":0.000030455738,"about_ca_topic_score_gemma":0.000028261227,"teacher_disagreement_score":0.2838198,"about_ca_system_score_codex":0.0001474641,"about_ca_system_score_gemma":0.000061870516,"threshold_uncertainty_score":0.55473024},"labels":[],"label_agreement":null},{"id":"W2096168409","doi":"10.1287/opre.1060.0326","title":"Joint Pricing-Production Decisions in Supply Chains of Complementary Products with Uncertain Demand","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":180,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Irvine; Wilfrid Laurier University","keywords":"Consignment; Profit (economics); Microeconomics; Business; Production (economics); Supply chain; Multiplicative function; Revenue management; Product (mathematics); Revenue; Revenue sharing; Industrial organization; Channel (broadcasting); Economics; Computer science; Marketing; Mathematics","score_opus":0.10133371633132568,"score_gpt":0.32237278983911805,"score_spread":0.22103907350779237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096168409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736438,0.00009920636,0.00068109354,0.010783695,0.00016275821,0.0015296147,0.0000056263416,0.000039196006,0.01305502],"genre_scores_gemma":[0.99463046,0.000026452326,0.001298575,0.00014028283,0.0006004828,0.00014991118,0.0002110969,0.000021699256,0.0029210146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979974,0.00006730136,0.00040556878,0.00041467877,0.00072092627,0.00039411566],"domain_scores_gemma":[0.9988731,0.000037146885,0.000043059008,0.00042043824,0.00061408145,0.000012130791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661904,0.00013183503,0.00018055664,0.0011024416,0.00040413922,0.00019697432,0.00022854848,0.000029873549,0.0003232046],"category_scores_gemma":[0.0002463503,0.000109084904,0.000026682872,0.0019700709,0.00015817091,0.0007226816,0.00020296559,0.00020184211,0.00007232749],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033033424,0.003109494,0.14359011,0.0006042863,0.00010237506,0.00008065592,0.00086077064,0.29901934,0.040008564,0.32585827,0.17810462,0.008331211],"study_design_scores_gemma":[0.0072494578,0.0005275644,0.43534893,0.0014426496,0.00011010836,0.000016871873,0.015346364,0.22553618,0.022506945,0.0075978343,0.28267676,0.0016403259],"about_ca_topic_score_codex":0.011644607,"about_ca_topic_score_gemma":0.016800072,"teacher_disagreement_score":0.31826043,"about_ca_system_score_codex":0.00012606898,"about_ca_system_score_gemma":0.0000768442,"threshold_uncertainty_score":0.99493694},"labels":[],"label_agreement":null},{"id":"W2096575645","doi":"10.1287/opre.2013.1238","title":"Coordinating Inventory Control and Pricing Strategies Under Batch Ordering","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Holding cost; Inventory control; Time horizon; Mathematical optimization; Order (exchange); Profit (economics); Regular polygon; Function (biology); Economics; Computer science; Mathematics; Operations research; Microeconomics; Finance","score_opus":0.051384569112780824,"score_gpt":0.3135753049715604,"score_spread":0.26219073585877956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096575645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.736922,0.00019226655,0.033714857,0.0073105455,0.00035508166,0.00095082104,9.934947e-7,0.00019996606,0.22035344],"genre_scores_gemma":[0.99644715,0.0000098489145,0.00022214386,0.0008851354,0.0006583131,0.000084465595,0.000010550509,0.00002322884,0.0016591601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863875,0.000077357356,0.00020603469,0.00028928477,0.00040631669,0.00038225067],"domain_scores_gemma":[0.99933994,0.00008774305,0.00002259563,0.00022379111,0.00030366497,0.000022267901],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019179014,0.00011854039,0.0001329414,0.00042029403,0.00091164105,0.0015273796,0.00019709479,0.000043992637,0.0002845957],"category_scores_gemma":[0.00027090314,0.00011126663,0.000025374795,0.00049225724,0.00012784339,0.0013217098,0.00023350406,0.00023798739,0.00015929317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015285517,0.00009182285,0.0070660156,0.00025819163,0.000048757152,0.0000036598344,0.00028488567,0.024613256,0.0038546256,0.94753486,0.0059895893,0.010239048],"study_design_scores_gemma":[0.0011848138,0.00003611726,0.005365413,0.00008234167,0.000017990375,0.0000010954703,0.008126523,0.87714404,0.000041318992,0.005345038,0.102368414,0.00028690902],"about_ca_topic_score_codex":0.0013931488,"about_ca_topic_score_gemma":0.00082712393,"teacher_disagreement_score":0.9421898,"about_ca_system_score_codex":0.000050790975,"about_ca_system_score_gemma":0.00003544313,"threshold_uncertainty_score":0.99950916},"labels":[],"label_agreement":null},{"id":"W2098400882","doi":"10.1287/opre.1050.0240","title":"A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Column generation; Linear programming relaxation; Branch and cut; Polytope; Scheduling (production processes); Branch and bound; Mathematical optimization; Mathematics; Variable (mathematics); Computer science; Cutting-plane method; Lagrangian relaxation; Integer programming; Algorithm; Combinatorics","score_opus":0.050032287516005525,"score_gpt":0.34981777819464754,"score_spread":0.299785490678642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098400882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035039425,0.0005422738,0.9619544,0.0006527312,0.000060144655,0.0008220011,0.000017566355,0.00015693193,0.00075452833],"genre_scores_gemma":[0.4590064,0.000048794234,0.539563,0.000012921572,0.00018656056,0.00038931,0.000016007129,0.000035925823,0.00074106845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893725,0.0001164372,0.00019747509,0.00017505958,0.00023615547,0.0003376467],"domain_scores_gemma":[0.9987558,0.0007071099,0.0000055353535,0.0002177663,0.00026692558,0.00004684213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293204,0.000087403474,0.00008944868,0.000107273576,0.000802107,0.00028457443,0.00015672618,0.00006479581,0.000021149377],"category_scores_gemma":[0.00022792113,0.00007120371,0.000029948278,0.00041939426,0.00007711845,0.00015171219,0.000050224822,0.00026870827,0.00001819352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016531084,0.000015344935,0.00020788176,0.000018618153,0.0000127058975,3.388702e-7,0.00012284584,0.93391424,0.00908124,0.0008451438,0.00024520032,0.05553477],"study_design_scores_gemma":[0.00036386485,0.000016034246,0.0004608628,0.000012227713,0.0000047379185,0.000003390074,0.00007708152,0.9892592,0.007669643,0.00014486404,0.0019014972,0.00008664245],"about_ca_topic_score_codex":0.00025829932,"about_ca_topic_score_gemma":0.000353205,"teacher_disagreement_score":0.42396697,"about_ca_system_score_codex":0.00005490217,"about_ca_system_score_gemma":0.00004509345,"threshold_uncertainty_score":0.6169239},"labels":[],"label_agreement":null},{"id":"W2098428248","doi":"10.1287/opre.1080.0591","title":"Technical Note—Approximating Vehicle Dispatch Probabilities for Emergency Service Systems with Location-Specific Service Times and Multiple Units per Location","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Service (business); Workload; Operations research; Location model; Real-time computing; Mathematical optimization; Mathematics; Business","score_opus":0.07938656670688697,"score_gpt":0.3117703666889604,"score_spread":0.23238379998207342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098428248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69062036,0.0014365864,0.22227335,0.060238086,0.00071682886,0.013749539,0.0000487332,0.000877141,0.010039407],"genre_scores_gemma":[0.99438447,0.000041245694,0.0028411716,0.0003273382,0.00036446846,0.00060301425,0.00028669226,0.00002467718,0.0011269199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980402,0.00005624819,0.0004717197,0.00048447482,0.00054658897,0.00040076338],"domain_scores_gemma":[0.99339485,0.000058742386,0.000031986954,0.000458497,0.006021186,0.00003475417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012386343,0.0001864724,0.00017393258,0.00029511921,0.0011080526,0.0005643559,0.0002922994,0.000081110185,0.00012503826],"category_scores_gemma":[0.0004237769,0.00016334327,0.000017021986,0.0025786813,0.000057326095,0.0012736481,0.00011031427,0.00019406564,0.00017255278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027113064,0.00091132853,0.0037399293,0.004886448,0.000042999818,8.7691984e-7,0.0037322296,0.7730896,0.0052211354,0.18833686,0.010708454,0.00905901],"study_design_scores_gemma":[0.00052634085,0.000053033807,0.006137603,0.00012007984,0.000016941349,8.061835e-7,0.004761949,0.9721779,0.000046927482,0.000254742,0.015634269,0.00026939146],"about_ca_topic_score_codex":0.0041206353,"about_ca_topic_score_gemma":0.010551318,"teacher_disagreement_score":0.30376413,"about_ca_system_score_codex":0.00009244693,"about_ca_system_score_gemma":0.00009729096,"threshold_uncertainty_score":0.8522357},"labels":[],"label_agreement":null},{"id":"W2098959416","doi":"10.1287/opre.1060.0270","title":"On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Heuristic; Bounded function; Computer science; Set (abstract data type); Asymptotically optimal algorithm; Job shop scheduling; Algorithm; Mathematics; Schedule","score_opus":0.060112270423902034,"score_gpt":0.31740270179026403,"score_spread":0.257290431366362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098959416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033173468,0.000342107,0.9611373,0.0025646414,0.00006119219,0.0017442071,0.00026697718,0.000106416504,0.00060369744],"genre_scores_gemma":[0.95753014,0.000018855926,0.041115068,0.00004732886,0.00012015429,0.00027754888,0.0002161075,0.0000375573,0.00063721434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989009,0.00012131739,0.00023678782,0.00017230933,0.00033942077,0.00022925464],"domain_scores_gemma":[0.99780464,0.0014176717,0.000013741781,0.00024943196,0.00047157513,0.000042924883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008234175,0.00011122358,0.00013016512,0.00012536976,0.0006633165,0.00010314373,0.00014619104,0.00005086637,0.000116471834],"category_scores_gemma":[0.00025560055,0.00006798112,0.00003531798,0.00040737216,0.000092766786,0.00005269653,0.00003401185,0.00025105217,0.000030843894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009169603,0.00010532775,4.6096747e-7,0.000008623969,0.000019637951,2.3771658e-7,0.000051164294,0.98841214,0.001310354,0.007701496,0.00048776096,0.0018936024],"study_design_scores_gemma":[0.00033416713,0.00019708625,0.000041094354,0.000029739409,0.000011357626,0.000002629129,0.00002987709,0.99758804,0.0011435489,0.00047862795,0.00006855843,0.00007529662],"about_ca_topic_score_codex":0.00005685734,"about_ca_topic_score_gemma":0.00003247692,"teacher_disagreement_score":0.9243567,"about_ca_system_score_codex":0.000048138732,"about_ca_system_score_gemma":0.00003197012,"threshold_uncertainty_score":0.5101762},"labels":[],"label_agreement":null},{"id":"W2099943113","doi":"10.1287/opre.1070.0439","title":"Improved Bounds for the Symmetric Rendezvous Value on the Line","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Rendezvous; Conjecture; Mathematics; Value (mathematics); Semidefinite programming; Line (geometry); Markov decision process; Markov chain; Combinatorics; Mathematical optimization; Quadratic equation; Applied mathematics; Discrete mathematics; Markov process; Statistics; Physics; Geometry","score_opus":0.1417237002608727,"score_gpt":0.42065610245908586,"score_spread":0.27893240219821314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099943113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055623474,0.00012845096,0.9485522,0.04042914,0.00017203904,0.0012914187,0.0000048567504,0.000051225208,0.008814427],"genre_scores_gemma":[0.9180812,0.00020098184,0.047747478,0.0019696378,0.00038344623,0.0006060337,0.000013453368,0.000025475852,0.030972248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812406,0.00024547445,0.00020263412,0.00027817985,0.0006589455,0.00049069227],"domain_scores_gemma":[0.9957291,0.0025685998,0.00001249926,0.00083106844,0.00076644315,0.0000923193],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.007661143,0.0000776038,0.00006594704,0.00031694965,0.0021500138,0.0010205811,0.0013216657,0.000050316456,0.000049297436],"category_scores_gemma":[0.001670515,0.000040296025,0.000050360908,0.0022556072,0.00013844579,0.00020854187,0.00023805634,0.00042835865,0.00007630039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013097324,0.00009640879,0.000003938098,0.000003532154,0.000015463454,0.0000010048709,0.00050409656,0.020757243,0.0008173231,0.9376081,0.0057462943,0.034433473],"study_design_scores_gemma":[0.00021717623,0.00028257864,0.0000881464,0.0000045133656,0.0000011849468,0.000002139504,0.00011951521,0.96506023,0.001615435,0.0010109103,0.031538535,0.0000596538],"about_ca_topic_score_codex":0.0001457585,"about_ca_topic_score_gemma":0.0002159871,"teacher_disagreement_score":0.944303,"about_ca_system_score_codex":0.00008699696,"about_ca_system_score_gemma":0.00026603744,"threshold_uncertainty_score":0.999149},"labels":[],"label_agreement":null},{"id":"W2100652140","doi":"10.1287/opre.48.2.243.12377","title":"Probabilistic Analysis of Renewal Cycles: An Application to a Non-Markovian Inventory Problem with Multiple Objectives","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Random variable; Probability distribution; Mathematical optimization; Markov chain; Probabilistic logic; Renewal theory; Computer science; Mathematics; Statistics","score_opus":0.02247976830931433,"score_gpt":0.3230117444600153,"score_spread":0.300531976150701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100652140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805013,0.000007324857,0.009561663,0.0002733304,0.0000046269543,0.0009830889,0.000008850505,0.000054489774,0.008605326],"genre_scores_gemma":[0.99471915,0.0000025589634,0.003426092,0.00007133274,0.00011217993,0.0005215666,0.0001629081,0.00002304971,0.00096116145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983873,0.000096323856,0.00028432283,0.00046749148,0.00047763507,0.00028697934],"domain_scores_gemma":[0.99848586,0.000082657614,0.000039206563,0.0006123443,0.00074174383,0.000038156923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010919147,0.00012521168,0.00024463047,0.0012872058,0.00046961452,0.00020814972,0.00034290383,0.00004414758,0.00044545316],"category_scores_gemma":[0.00023657916,0.00010813298,0.00006545991,0.005536512,0.00016223869,0.0009014956,0.00007227548,0.00014841459,0.00011195097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019215458,0.00034230592,0.008491504,0.00004991895,0.0002514335,0.0000013739356,0.0006623113,0.97301453,0.0034883579,0.0055405293,0.00002827271,0.007937325],"study_design_scores_gemma":[0.0002996866,0.00007636447,0.008083077,0.000039858667,0.0003128425,2.6245476e-7,0.0010698873,0.9867107,0.0001804827,0.0020078353,0.0009993564,0.00021961768],"about_ca_topic_score_codex":0.0038479709,"about_ca_topic_score_gemma":0.024103932,"teacher_disagreement_score":0.020255962,"about_ca_system_score_codex":0.00008995231,"about_ca_system_score_gemma":0.00006638651,"threshold_uncertainty_score":0.9937036},"labels":[],"label_agreement":null},{"id":"W2100723108","doi":"10.1287/opre.1090.0779","title":"<b>Technical Note</b>—Capacitated Serial Inventory Systems: Sample Path and Stability Properties Under Base-Stock Policies","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Stock (firearms); Constraint (computer-aided design); Inventory control; Computer science; Path (computing); Base (topology); Mathematical optimization; Operations research; Economic order quantity; Sample (material); Mathematics; Supply chain; Business","score_opus":0.1423247791892315,"score_gpt":0.32576561107754015,"score_spread":0.18344083188830865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100723108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787238,0.00012543089,0.0017371827,0.0056518493,0.0010242644,0.001910513,0.000029934426,0.00026129914,0.0105356835],"genre_scores_gemma":[0.9969264,0.000012725459,0.00040261893,0.00042527326,0.0011267569,0.00033421942,0.00006226681,0.000032933138,0.0006767639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795705,0.00012653523,0.00034391443,0.0004275471,0.0006492619,0.0004956627],"domain_scores_gemma":[0.9985293,0.00009143957,0.000029919855,0.00054031034,0.00075863075,0.000050395254],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002153277,0.00017806688,0.00019512928,0.00041647174,0.00093774614,0.0013701613,0.00033312917,0.00012735474,0.0005600438],"category_scores_gemma":[0.0012049729,0.00014686934,0.00004515859,0.0006046952,0.00051785546,0.0010773409,0.0004733112,0.000558529,0.0001345666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019001872,0.00081401644,0.009191126,0.000868418,0.000047269863,0.000008105582,0.0010320394,0.0022088136,0.27720937,0.6649301,0.042727917,0.00077281496],"study_design_scores_gemma":[0.0028690612,0.00022777914,0.0073076957,0.00025108742,0.00008434499,0.000010032742,0.020414323,0.63566816,0.0033083223,0.007330884,0.32104707,0.0014812376],"about_ca_topic_score_codex":0.018548079,"about_ca_topic_score_gemma":0.008923527,"teacher_disagreement_score":0.6575992,"about_ca_system_score_codex":0.00011716894,"about_ca_system_score_gemma":0.00011886439,"threshold_uncertainty_score":0.9996665},"labels":[],"label_agreement":null},{"id":"W2101006865","doi":"10.1287/opre.1080.0577","title":"Dynamic Pricing with Online Learning and Strategic Consumers: An Application of the Aggregating Algorithm","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dynamic pricing; Computer science; Monopolistic competition; Product (mathematics); Supply and demand; Service (business); Sample (material); Mathematical optimization; Operations research; Microeconomics; Economics; Marketing; Mathematics; Business; Monopoly","score_opus":0.04015049543557236,"score_gpt":0.33190773288321523,"score_spread":0.29175723744764287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101006865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863588,0.00010040372,0.004028171,0.0015673637,0.000024384495,0.0006902372,0.0000017157184,0.000043920096,0.007184954],"genre_scores_gemma":[0.99657273,0.000018152341,0.0026732998,0.00012661747,0.00006729913,0.000021003432,0.00004879391,0.000009720639,0.00046240014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.000049689366,0.00015451285,0.00020368348,0.0003374077,0.0001860371],"domain_scores_gemma":[0.9994611,0.000022930113,0.000043260083,0.00018990871,0.00027109397,0.000011705231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060719915,0.000077719575,0.00008341658,0.0001866396,0.0006022813,0.00028549109,0.00016922313,0.000026345251,0.000032978056],"category_scores_gemma":[0.000046058645,0.000054105247,0.000014226565,0.00066211796,0.0001160373,0.00048213452,0.00007910451,0.00023307723,0.000007100791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005268327,0.0008913695,0.021605367,0.00027794918,0.00007758218,0.0000070752617,0.0010355144,0.029035857,0.022678275,0.12649255,0.00007204028,0.7977737],"study_design_scores_gemma":[0.00029192274,0.000060824204,0.006280209,0.000059517104,0.000012033706,0.0000013046098,0.0051984354,0.9859814,0.00006904232,0.00072389113,0.0012310522,0.000090364374],"about_ca_topic_score_codex":0.0006682805,"about_ca_topic_score_gemma":0.00084673933,"teacher_disagreement_score":0.95694554,"about_ca_system_score_codex":0.000030119258,"about_ca_system_score_gemma":0.00002667667,"threshold_uncertainty_score":0.4632322},"labels":[],"label_agreement":null},{"id":"W2104288018","doi":"10.1287/opre.2014.1300","title":"Double-Sided Batch Queues with Abandonment: Modeling Crossing Networks","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abandonment (legal); Queue; Computer science; Queueing theory; Function (biology); Order (exchange); Real-time computing; Mathematical optimization; Mathematics; Computer network; Economics","score_opus":0.0602799683063076,"score_gpt":0.33512833002595727,"score_spread":0.27484836171964966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104288018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63458645,0.00006618953,0.34889394,0.001000454,0.000058017456,0.00032193022,4.420418e-7,0.00013892836,0.014933618],"genre_scores_gemma":[0.9955707,0.00000872835,0.0014100169,0.0002376007,0.00092573283,0.00008455943,0.000044012868,0.00004105674,0.0016775874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982787,0.00007090698,0.00024310626,0.00039107513,0.0005184018,0.0004978177],"domain_scores_gemma":[0.99878633,0.00011925185,0.000028935005,0.00045843754,0.0005824694,0.00002455094],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020230012,0.00014969018,0.00018502412,0.00036779777,0.0022243087,0.0023052653,0.00030597125,0.00006157469,0.00023774891],"category_scores_gemma":[0.00023360025,0.000121972604,0.00004742945,0.00110641,0.0001993967,0.0015768245,0.00019214657,0.000384735,0.00019842148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009766043,0.000034962988,0.0002813226,0.000013292394,0.000023417775,0.0000024603037,0.00009349554,0.94824094,0.0003565277,0.049247645,0.00008678499,0.0015215108],"study_design_scores_gemma":[0.0006634709,0.000010681962,0.000022752034,0.00007083053,0.000021949882,8.6997613e-7,0.0001785309,0.9938551,0.00009151812,0.0018869509,0.0030268088,0.00017053542],"about_ca_topic_score_codex":0.0018724398,"about_ca_topic_score_gemma":0.0023328473,"teacher_disagreement_score":0.36098424,"about_ca_system_score_codex":0.00006230999,"about_ca_system_score_gemma":0.000040300034,"threshold_uncertainty_score":0.99907464},"labels":[],"label_agreement":null},{"id":"W2105819246","doi":"10.1287/opre.2014.1318","title":"The Value of Stochastic Modeling in Two-Stage Stochastic Programs with Cost Uncertainty","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Stochastic programming; Mathematical optimization; Computer science; Stochastic modelling; Heuristic; Stochastic optimization; Expected value; Value (mathematics); Linear programming; Bellman equation; Function (biology); Stochastic investment model; Random variable; Stochastic process; Mathematics; Economics","score_opus":0.21360839487146607,"score_gpt":0.4764161017725425,"score_spread":0.26280770690107647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105819246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23889332,0.000040342897,0.7581904,0.0005300684,0.00004810397,0.0008937898,0.0000057759053,0.000010338353,0.0013878754],"genre_scores_gemma":[0.9960566,0.000015620251,0.0018527778,0.0000101635715,0.000041681888,0.00019857637,0.000014860209,0.000011926989,0.0017977544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604803,0.0007968249,0.0005358785,0.000349317,0.0018767011,0.0003932444],"domain_scores_gemma":[0.9963188,0.0014326271,0.000044274817,0.00067179155,0.0014322741,0.00010019079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009086373,0.00009697081,0.00017738443,0.0003847833,0.0007141931,0.0005616899,0.0006529761,0.000038042956,0.000037161877],"category_scores_gemma":[0.003540891,0.000053367283,0.000032370306,0.0019704655,0.00030754635,0.0002566883,0.00010693854,0.00032323351,0.00005283766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053214277,0.00004910803,0.0001943407,8.3249967e-7,0.0000035539513,4.640157e-7,0.00051897694,0.9517191,0.00002838583,0.022097358,0.000023477527,0.025311187],"study_design_scores_gemma":[0.00041527773,0.00013352717,0.00007141003,0.000025216179,0.000002218582,0.0000015534399,0.0014981782,0.9957636,0.000009079008,0.0017737008,0.00023762308,0.000068594505],"about_ca_topic_score_codex":0.0018936022,"about_ca_topic_score_gemma":0.010387779,"teacher_disagreement_score":0.75716335,"about_ca_system_score_codex":0.00006098806,"about_ca_system_score_gemma":0.00037233287,"threshold_uncertainty_score":0.57966244},"labels":[],"label_agreement":null},{"id":"W2107357529","doi":"10.1287/opre.2014.1263","title":"Hub Location as the Minimization of a Supermodular Set Function","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Solver; Mathematical optimization; Benchmark (surveying); Class (philosophy); Minification; Heuristic; Set (abstract data type); Mathematics; Integer programming; Greedy algorithm; Integer (computer science); Function (biology); Path (computing); Exploit; Computer science; Artificial intelligence","score_opus":0.056461730768427844,"score_gpt":0.36038887978756,"score_spread":0.30392714901913215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107357529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1827278,0.00009409902,0.80963963,0.00069446856,0.0001660428,0.00042892902,0.0000041014205,0.00012292282,0.006121974],"genre_scores_gemma":[0.9881482,0.00003747368,0.010934886,0.000030696814,0.000101829915,0.00007406526,0.000060738734,0.00002625087,0.0005858496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985068,0.00054942333,0.0002310176,0.00013687224,0.00039428374,0.00018160406],"domain_scores_gemma":[0.99866027,0.00021978372,0.000009165693,0.00038401256,0.00068541383,0.000041357576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018604969,0.00007280272,0.00008564279,0.00018704498,0.00031011412,0.00008952854,0.00017370925,0.000073785435,0.00017947285],"category_scores_gemma":[0.00094832544,0.000060516097,0.000022285023,0.0010185444,0.000082690516,0.0001848277,0.000032103602,0.00020844143,0.00010324829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042947095,0.000012061225,0.00011229777,0.000031470536,0.000009109573,5.352724e-8,0.0005566458,0.9779009,0.0076862583,0.0076118805,0.0005210257,0.005553999],"study_design_scores_gemma":[0.00014801577,0.000049504306,0.0014500117,0.00001631038,0.000006789783,0.0000018512387,0.00022846878,0.9878901,0.0073430226,0.00020333611,0.0025984766,0.000064076296],"about_ca_topic_score_codex":0.00007632024,"about_ca_topic_score_gemma":0.000036441503,"teacher_disagreement_score":0.8054204,"about_ca_system_score_codex":0.000055207267,"about_ca_system_score_gemma":0.00006033805,"threshold_uncertainty_score":0.24677747},"labels":[],"label_agreement":null},{"id":"W2107911578","doi":"10.1287/opre.1110.0948","title":"Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Scheduling (production processes); Due date; Computer science; Mathematical optimization; Retard; Scheme (mathematics); Job shop scheduling; Operations research; Mathematics; Schedule; Queue; Computer network","score_opus":0.06483650528397482,"score_gpt":0.29525844216900915,"score_spread":0.23042193688503432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107911578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9442557,0.00032725668,0.04194951,0.00011150953,0.00007932722,0.00045150038,0.0000056346503,0.00021942394,0.012600133],"genre_scores_gemma":[0.8301165,0.00010167047,0.16888984,0.000009470666,0.000049155344,0.000099919285,0.000031784733,0.00002888653,0.00067276374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904907,0.00009152642,0.0001781417,0.0001566614,0.00027640435,0.00024820166],"domain_scores_gemma":[0.99933714,0.000048338687,0.000004859972,0.00018348494,0.00036370027,0.00006245394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005565177,0.00008818548,0.00010768488,0.0003680033,0.00017144706,0.00010430925,0.0001328745,0.0000540417,0.00048353767],"category_scores_gemma":[0.00009337506,0.00007942184,0.00001537516,0.0008064869,0.000054672175,0.00030705036,0.000019475732,0.00026920828,0.0002759198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018797215,0.000032357384,0.0005044106,0.00002251362,0.00001377759,0.000008092505,0.0017464384,0.99473906,0.0012180107,0.00041138826,0.00004570832,0.0012394452],"study_design_scores_gemma":[0.00036042894,0.00003736452,0.0010013346,0.00006728554,0.0000028770698,0.000003963207,0.000652327,0.9948772,0.0028124987,0.000016764097,0.00004634926,0.0001216094],"about_ca_topic_score_codex":0.00018486126,"about_ca_topic_score_gemma":0.00017820319,"teacher_disagreement_score":0.12694032,"about_ca_system_score_codex":0.00007525693,"about_ca_system_score_gemma":0.0000766686,"threshold_uncertainty_score":0.52943987},"labels":[],"label_agreement":null},{"id":"W2108062658","doi":"10.1287/opre.2014.1291","title":"Modified Echelon (<i>r, Q</i>) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristic; Mathematical optimization; Position (finance); Upstream (networking); Upper and lower bounds; Computer science; Integer (computer science); Poisson distribution; Homogeneous; Inventory control; Fixed cost; Holding cost; Mathematics; Operations research; Combinatorics; Economics; Statistics; Microeconomics","score_opus":0.05600325632335443,"score_gpt":0.3196833356274496,"score_spread":0.2636800793040952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108062658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8681196,0.00003864341,0.12487642,0.0005709393,0.00021204076,0.00094285246,0.0000063673992,0.00012790842,0.0051052314],"genre_scores_gemma":[0.99508977,0.0000018153427,0.00029745876,0.00015440742,0.0013328299,0.00044810347,0.000058846257,0.000038333947,0.0025784587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.000070616436,0.00023848636,0.00030104662,0.00044976056,0.00045385672],"domain_scores_gemma":[0.9986542,0.00012870618,0.000043355823,0.00039660546,0.0007567068,0.000020461044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018682813,0.00014649786,0.00020823936,0.00051882706,0.0012789065,0.0008155701,0.00033768464,0.000061142644,0.000022836677],"category_scores_gemma":[0.000501604,0.00012039285,0.000045017558,0.0008138051,0.00020047306,0.0009619646,0.00010511343,0.00020475406,0.00010024662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024852957,0.00005561843,0.00015793694,0.00016700286,0.000039542057,3.5790188e-7,0.0001237416,0.78517175,0.0016820543,0.21149495,0.00046277672,0.00039573933],"study_design_scores_gemma":[0.0007177483,0.00007075627,0.000069827576,0.00006959186,0.000033590935,0.000001524248,0.00031445213,0.9916358,0.000076272445,0.0009880235,0.0058389427,0.00018344818],"about_ca_topic_score_codex":0.00083273795,"about_ca_topic_score_gemma":0.0005552772,"teacher_disagreement_score":0.21050693,"about_ca_system_score_codex":0.00007940784,"about_ca_system_score_gemma":0.000059848833,"threshold_uncertainty_score":0.98364437},"labels":[],"label_agreement":null},{"id":"W2110483583","doi":"10.1287/opre.2015.1349","title":"Technical Note—Trading Off Quick versus Slow Actions in Optimal Search","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterative deepening depth-first search; Set (abstract data type); Search algorithm; Order (exchange); Computer science; Beam stack search; Search engine; Search problem; Search cost; Linear search; Best-first search; Beam search; Algorithm; Information retrieval; Economics","score_opus":0.2697715929038695,"score_gpt":0.4593099383107204,"score_spread":0.18953834540685094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110483583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012261606,0.00012715801,0.91698426,0.01862567,0.00043320746,0.0010947853,0.000007859181,0.00025738214,0.05020805],"genre_scores_gemma":[0.71812177,0.00008325345,0.277724,0.000051804444,0.00011084504,0.0001950387,0.000019642637,0.000019091598,0.0036745826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966734,0.00062389305,0.000291679,0.00048729376,0.0012223823,0.0007013715],"domain_scores_gemma":[0.9978011,0.00031030952,0.000008331345,0.00068256306,0.00079523097,0.00040243354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003321874,0.00011152569,0.00013939201,0.0008389642,0.00053361175,0.0008031879,0.0011149109,0.00012437775,0.000118129414],"category_scores_gemma":[0.00083314616,0.00010954267,0.00004032931,0.002724499,0.00019545337,0.0011677494,0.0005656601,0.0009825297,0.00050024944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012314573,0.00073749595,0.00024151952,0.000015130888,0.0000118476855,0.00006882645,0.0048533864,0.69424736,0.0061714347,0.24035588,0.01750903,0.03566493],"study_design_scores_gemma":[0.0010615411,0.00027231875,0.0001471874,0.00001484991,6.946721e-7,0.00001080706,0.00037017497,0.987769,0.00052075554,0.000095598305,0.009603978,0.00013305695],"about_ca_topic_score_codex":0.00038684995,"about_ca_topic_score_gemma":0.0008322579,"teacher_disagreement_score":0.70586014,"about_ca_system_score_codex":0.0005187173,"about_ca_system_score_gemma":0.0013727364,"threshold_uncertainty_score":0.7745159},"labels":[],"label_agreement":null},{"id":"W2110620774","doi":"10.1287/opre.1120.1154","title":"An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Benchmark (surveying); Column generation; Mathematical optimization; Routing (electronic design automation); Computer science; Vehicle routing problem; Arc (geometry); Enhanced Data Rates for GSM Evolution; Mathematics; Artificial intelligence","score_opus":0.05729250841713738,"score_gpt":0.3586774357342097,"score_spread":0.3013849273170723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110620774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04350312,0.000049921255,0.9534964,0.00033226315,0.00003522759,0.0014013036,0.000008793168,0.00018795698,0.000985043],"genre_scores_gemma":[0.48094556,0.00001253589,0.5177647,0.000012347869,0.00008536769,0.0007118451,0.000020582023,0.00004592886,0.00040113885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00025012408,0.00020576835,0.0002077722,0.0003053408,0.00047376336],"domain_scores_gemma":[0.99837434,0.0005444712,0.000008598156,0.0003365917,0.0006281308,0.0001078849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019377356,0.00011595809,0.000109973866,0.00014829503,0.0009898954,0.0006153723,0.0002566644,0.000062078434,0.00010808259],"category_scores_gemma":[0.0001502446,0.00007962452,0.000021411834,0.000608719,0.00008782712,0.00048728526,0.000022582739,0.00034728242,0.00004237916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016001695,0.000016779735,0.00012738087,0.000015067082,0.00003363442,4.744958e-7,0.0010752396,0.94329983,0.008313262,0.0005574081,0.00027556557,0.046283737],"study_design_scores_gemma":[0.00025136044,0.000082409126,0.0003018955,0.000026233067,0.0000065025843,0.0000065743957,0.0008210493,0.99446166,0.003664869,0.0000497719,0.00021076095,0.00011691028],"about_ca_topic_score_codex":0.0002946126,"about_ca_topic_score_gemma":0.00012567652,"teacher_disagreement_score":0.43744245,"about_ca_system_score_codex":0.00009857536,"about_ca_system_score_gemma":0.00007030009,"threshold_uncertainty_score":0.76135755},"labels":[],"label_agreement":null},{"id":"W2110645003","doi":"10.1287/opre.1060.0295","title":"Incorporating Multiprocess Performance Standards into the DEA Framework","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Efficient frontier; Computer science; Set (abstract data type); Measure (data warehouse); Dual (grammatical number); Efficiency; Sample (material); Operations research; Mathematical optimization; Econometrics; Data mining; Economics; Mathematics; Statistics","score_opus":0.13041832186749444,"score_gpt":0.4962029636701631,"score_spread":0.3657846418026687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110645003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176379,0.00029488062,0.06521982,0.005159985,0.00011298176,0.00028369302,0.000010136489,0.000037320006,0.011243292],"genre_scores_gemma":[0.98302835,0.000011334864,0.012313072,0.000090918584,0.00024083223,0.000064384665,0.0000065487716,0.000012686653,0.0042318446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99185,0.00088179944,0.0006783365,0.00054867775,0.005606943,0.00043420837],"domain_scores_gemma":[0.99173677,0.0025018125,0.00005845591,0.0011241094,0.004505492,0.00007334234],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.022281531,0.00012087913,0.00018192969,0.00055474404,0.003978741,0.0021201305,0.0016354346,0.00010000732,0.00038189863],"category_scores_gemma":[0.014216221,0.00006983015,0.00007119154,0.0057684476,0.00069450226,0.0005950648,0.0003327865,0.0007582197,0.0005931692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003567913,0.00025236083,0.040235914,0.000012265874,0.000018818464,0.00000993574,0.0052901627,0.7950712,0.0032150967,0.07149473,0.011396335,0.07296754],"study_design_scores_gemma":[0.00016850448,0.000093702554,0.008566549,0.000051494666,0.0000069009766,0.000004287678,0.0027848205,0.9330055,0.0037873304,0.026791994,0.02452392,0.00021496775],"about_ca_topic_score_codex":0.001583796,"about_ca_topic_score_gemma":0.004198573,"teacher_disagreement_score":0.13793436,"about_ca_system_score_codex":0.00019518058,"about_ca_system_score_gemma":0.0008387827,"threshold_uncertainty_score":0.9989158},"labels":[],"label_agreement":null},{"id":"W2110819585","doi":"10.1287/opre.1110.1026","title":"A Simulation Optimization Approach to Long-Term Care Capacity Planning","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto; University of British Columbia","funders":"World Health Organization","keywords":"Term (time); Operations research; Computer science; Time horizon; Service (business); Capacity planning; Event (particle physics); Discrete event simulation; Operations management; Mathematical optimization; Business; Economics; Simulation; Mathematics","score_opus":0.393411276172048,"score_gpt":0.565187191770833,"score_spread":0.17177591559878497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110819585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2682085,0.00018892386,0.71553046,0.00051388313,0.00033667247,0.002459066,0.000028431543,0.00011274537,0.012621348],"genre_scores_gemma":[0.84858423,0.000013597577,0.14764442,0.00028380778,0.0007428517,0.0008801053,0.0006123242,0.00004363746,0.0011950536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956264,0.0017048056,0.0005802011,0.0003838735,0.00068838743,0.0010163259],"domain_scores_gemma":[0.9961839,0.0004532972,0.000034308512,0.0005112627,0.0023031863,0.0005141025],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024878152,0.00017053455,0.00020960197,0.00055404066,0.00519626,0.00012906194,0.00021511335,0.0003057176,0.00042819357],"category_scores_gemma":[0.0014980942,0.00016123259,0.000040249903,0.001308313,0.00005544842,0.0007964373,0.00013702126,0.0009850264,0.00038432222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016998047,0.00010948746,0.048712473,0.00011093321,0.000007837763,2.5309805e-7,0.02602188,0.9224515,0.00007057045,0.0018535344,0.000148227,0.0004963132],"study_design_scores_gemma":[0.00038995396,0.00007100915,0.024021741,0.00014320752,0.000008578475,9.637287e-7,0.0056265295,0.96890825,0.000028130973,0.0000017858482,0.0005764234,0.00022340288],"about_ca_topic_score_codex":0.00040572713,"about_ca_topic_score_gemma":0.00013223478,"teacher_disagreement_score":0.58037573,"about_ca_system_score_codex":0.000684483,"about_ca_system_score_gemma":0.00055708515,"threshold_uncertainty_score":0.9960988},"labels":[],"label_agreement":null},{"id":"W2112394655","doi":"10.1287/opre.1110.0951","title":"An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Computer science; Algorithm; Interior point method; Point (geometry); Constraint (computer-aided design); Linear programming; Branch and bound; Mathematics","score_opus":0.15512991551741845,"score_gpt":0.44455638657097624,"score_spread":0.2894264710535578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112394655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072811695,0.0000623764,0.99369913,0.0004960879,0.00005091467,0.0038247667,0.00015934584,0.00016142314,0.00081785035],"genre_scores_gemma":[0.038075674,0.000061900675,0.95724,0.00010922927,0.00022780235,0.0027129303,0.0011203593,0.000099174526,0.00035296447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968152,0.0004886962,0.0005968571,0.00068488135,0.00077333895,0.0006410136],"domain_scores_gemma":[0.995301,0.00018707314,0.00008503192,0.00081793556,0.0032939294,0.00031504335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669747,0.00023391149,0.00028409457,0.00054505985,0.0011927059,0.00027439327,0.0003909325,0.00014323501,0.00041588765],"category_scores_gemma":[0.00035200967,0.00021229644,0.000052975178,0.0008545515,0.00029521607,0.0008344809,0.00007727783,0.00040180032,0.00002913266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022606373,0.0013454112,0.00004362304,0.00033673225,0.00017832409,0.000009812711,0.0325089,0.29079023,0.0048737046,0.06433777,0.0022049618,0.60314447],"study_design_scores_gemma":[0.0009358244,0.001006653,0.000004972116,0.00003560799,0.000008500396,0.000015865387,0.0051454813,0.98641294,0.005371665,0.00038369326,0.00043198882,0.0002467934],"about_ca_topic_score_codex":0.00013697898,"about_ca_topic_score_gemma":0.00057333184,"teacher_disagreement_score":0.69562274,"about_ca_system_score_codex":0.00048709838,"about_ca_system_score_gemma":0.0007446797,"threshold_uncertainty_score":0.91734505},"labels":[],"label_agreement":null},{"id":"W2112881180","doi":"10.1287/opre.1080.0528","title":"Allocation of Cost Savings in a Three-Level Supply Chain with Demand Information Sharing: A Cooperative-Game Approach","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":157,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Cost allocation; Computer science; Economic shortage; Holding cost; Game theory; Information sharing; Scheme (mathematics); Function (biology); Cooperative game theory; Unit cost; Resource allocation; Operations research; Microeconomics; Mathematical optimization; Economics; Business; Mathematics; Marketing","score_opus":0.12443434643478501,"score_gpt":0.30179119948740757,"score_spread":0.17735685305262255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112881180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298368,0.000041741834,0.02567054,0.001481754,0.00004919198,0.0024805074,0.000009689335,0.00005147174,0.04037828],"genre_scores_gemma":[0.99664927,0.00002585192,0.0007867335,0.00026700686,0.00010554032,0.0005252443,0.0002944789,0.00001636788,0.001329527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983185,0.000036423688,0.00039187615,0.00022801202,0.0006803452,0.00034482183],"domain_scores_gemma":[0.99881333,0.000029384399,0.00005250492,0.00032302088,0.0007604107,0.000021364956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013028772,0.00014336577,0.00018540047,0.0010081611,0.00037916962,0.00031915275,0.00035475445,0.000060901213,0.00022370106],"category_scores_gemma":[0.0001880362,0.00012245908,0.000027757445,0.001587117,0.00020741505,0.002846008,0.0002274228,0.000254543,0.00013281242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005912606,0.0018229713,0.2426862,0.0010473214,0.00014948842,0.000022957955,0.01083015,0.2327095,0.0020702526,0.49026403,0.010945227,0.006860647],"study_design_scores_gemma":[0.0027509807,0.00010343249,0.11157351,0.00016201046,0.000013712137,0.000007769445,0.004235484,0.86315304,0.00032703183,0.0002127026,0.017076949,0.00038336468],"about_ca_topic_score_codex":0.003202251,"about_ca_topic_score_gemma":0.0026379651,"teacher_disagreement_score":0.6304436,"about_ca_system_score_codex":0.00011523806,"about_ca_system_score_gemma":0.000110890935,"threshold_uncertainty_score":0.49937364},"labels":[],"label_agreement":null},{"id":"W2113574878","doi":"10.1287/opre.2013.1160","title":"Robust Partitioning for Stochastic Multivehicle Routing","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Boeing","keywords":"Computer science; Partition (number theory); Independent and identically distributed random variables; Vehicle routing problem; Heuristic; Mathematical optimization; Regular polygon; Workload; Order (exchange); Product (mathematics); Service (business); Routing (electronic design automation); Operations research; Random variable; Mathematics; Economics; Artificial intelligence","score_opus":0.1431070788548276,"score_gpt":0.3784082997950221,"score_spread":0.2353012209401945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113574878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08086171,0.000043661363,0.9164227,0.0003000233,0.00009059009,0.000833277,0.000008401941,0.00023180064,0.0012077895],"genre_scores_gemma":[0.7762306,0.0000037243663,0.22190936,0.000013750976,0.00012050475,0.0007833205,0.00002391991,0.000038314607,0.00087653246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987995,0.00013762644,0.00021809901,0.00018452253,0.00022802076,0.00043225766],"domain_scores_gemma":[0.9986657,0.0004220642,0.0000057884145,0.000206419,0.0006016337,0.00009843274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384192,0.00008833797,0.00009880624,0.00016115393,0.000656762,0.0003376132,0.00014259992,0.0000650587,0.00037165196],"category_scores_gemma":[0.00090554886,0.000093243,0.000032129705,0.00043939654,0.00005459979,0.00036475563,0.00004024883,0.0002555219,0.00027903047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0976266e-7,0.00001283261,0.00007213459,0.000012154126,0.0000098249,1.2496572e-7,0.0003269689,0.9868843,0.007270572,0.0010779706,0.0006487751,0.0036834585],"study_design_scores_gemma":[0.00024438213,0.000021467642,0.0006298018,0.000022740298,0.0000025190652,0.0000012546003,0.0003637342,0.9963327,0.002048285,0.00008663684,0.00014062917,0.00010584822],"about_ca_topic_score_codex":0.00010865894,"about_ca_topic_score_gemma":0.000047365946,"teacher_disagreement_score":0.6953689,"about_ca_system_score_codex":0.000112508074,"about_ca_system_score_gemma":0.000042162097,"threshold_uncertainty_score":0.5051349},"labels":[],"label_agreement":null},{"id":"W2114020259","doi":"10.1287/opre.1100.0872","title":"TECHNICAL NOTE—Exact Analysis of a Lost Sales Model Under Stuttering Poisson Demand","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Poisson distribution; Stuttering; Lost sales; Order (exchange); Econometrics; Poisson regression; On demand; Economics; Mathematical economics; Mathematics; Operations research; Statistics; Linguistics; Medicine; Philosophy; Finance","score_opus":0.15821066404328268,"score_gpt":0.38019582963103415,"score_spread":0.22198516558775147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114020259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94266516,0.000052430045,0.036013093,0.00031889934,0.000028026197,0.00026479873,0.000007699343,0.000039867668,0.020609997],"genre_scores_gemma":[0.99755466,0.000013464597,0.0016924068,0.00005999132,0.000048216545,0.00002484005,0.0000341174,0.000015328134,0.00055694784],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876964,0.000037952654,0.0002650665,0.0002468664,0.00040464455,0.0002758009],"domain_scores_gemma":[0.9991171,0.000087392116,0.000025836645,0.0003545781,0.00039741443,0.000017724804],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011259455,0.00009799555,0.00020138652,0.0011490311,0.00030438643,0.00020026905,0.0002736832,0.00006568065,0.0009826473],"category_scores_gemma":[0.00016572949,0.00008866619,0.00009691177,0.0019481906,0.00010998236,0.0005732628,0.0002895318,0.00022924613,0.000100116406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042402826,0.0018324759,0.32690904,0.00036928005,0.0008131152,0.000049848208,0.002041134,0.1185677,0.45258895,0.06722377,0.00193103,0.027249662],"study_design_scores_gemma":[0.00025863393,0.000013581991,0.246257,0.00003697961,0.0005356092,8.720493e-7,0.00030840427,0.7510551,0.0007348892,0.00031346368,0.00027016594,0.00021523875],"about_ca_topic_score_codex":0.0031446486,"about_ca_topic_score_gemma":0.005400153,"teacher_disagreement_score":0.6324875,"about_ca_system_score_codex":0.00003239734,"about_ca_system_score_gemma":0.000051281724,"threshold_uncertainty_score":0.99993056},"labels":[],"label_agreement":null},{"id":"W2114915380","doi":"10.1287/opre.1110.0929","title":"Network Cargo Capacity Management","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Schedule; Operations research; Control (management); Flow network; Stochastic programming; Volume (thermodynamics); Capacity management; Mathematical optimization; Linear programming; Dynamic programming; Air cargo; Command and control; Stochastic control; Optimal control; Transport engineering; Computer network; Mathematics; Engineering; Artificial intelligence; Telecommunications","score_opus":0.2511673845062463,"score_gpt":0.3140859727290876,"score_spread":0.0629185882228413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114915380","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052780263,0.00006241407,0.001099078,0.00078040507,0.00052943197,0.0008219759,0.00000141101,0.0001397724,0.94378525],"genre_scores_gemma":[0.97725433,0.000027419555,0.0028105425,0.0016812388,0.0014890081,0.000325328,0.000032441116,0.000032775366,0.01634693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982291,0.000048394042,0.00022034034,0.00034338675,0.0005679065,0.00059087796],"domain_scores_gemma":[0.99915844,0.000013468028,0.00001664515,0.00049616,0.00029081228,0.000024488996],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014521715,0.00013074846,0.000114423296,0.00040701887,0.000869977,0.00041433304,0.00047444738,0.000047320802,0.004429062],"category_scores_gemma":[0.00004025302,0.00012191656,0.000051846368,0.0010700795,0.0001346224,0.0008215927,0.0004956275,0.00023553452,0.004035818],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001799803,0.0001724745,0.0028068724,0.00008040779,0.00004627399,0.000025977859,0.00018698891,0.00089479424,0.000024435427,0.8488488,0.14413866,0.002756266],"study_design_scores_gemma":[0.00065485534,0.000033297703,0.016436215,0.000060428556,0.00003840681,0.0000013561003,0.0017260136,0.018367492,0.00006883973,0.019913906,0.94227695,0.00042225607],"about_ca_topic_score_codex":0.0020897237,"about_ca_topic_score_gemma":0.00079803413,"teacher_disagreement_score":0.9274383,"about_ca_system_score_codex":0.00007017487,"about_ca_system_score_gemma":0.000013276179,"threshold_uncertainty_score":0.9967396},"labels":[],"label_agreement":null},{"id":"W2116021647","doi":"10.1287/opre.1120.1053","title":"Technical Note—A Sampling-Based Approach to Appointment Scheduling","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Western University","funders":"","keywords":"Convexity; Scheduling (production processes); Computer science; Mathematical optimization; Random variable; Sequence (biology); Operations research; Mathematics; Statistics","score_opus":0.36636740888891783,"score_gpt":0.568893804272135,"score_spread":0.20252639538321715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116021647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024398077,0.00010750816,0.94370115,0.007836198,0.00033191132,0.002965728,0.000027159751,0.00016860811,0.02046369],"genre_scores_gemma":[0.556804,0.00001034091,0.4387713,0.0009283691,0.00056176324,0.0016734268,0.00016225704,0.000035238452,0.001053272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952801,0.0014899914,0.0006833774,0.0004302501,0.00081077236,0.0013055507],"domain_scores_gemma":[0.9967091,0.00054772256,0.000025222907,0.0006966795,0.001305905,0.000715387],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006815348,0.00017308784,0.00023933717,0.0005529865,0.004273217,0.000104250685,0.00030594988,0.00033557558,0.0005290312],"category_scores_gemma":[0.0021301205,0.00015278389,0.000056158668,0.0014604036,0.000081016195,0.00031203654,0.00018535604,0.0015283907,0.0020866122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008197518,0.0013818113,0.0049392213,0.00020832056,0.0000113843425,7.1441536e-7,0.00567154,0.87970823,0.00971893,0.0889291,0.0034405838,0.005908187],"study_design_scores_gemma":[0.0016166514,0.0003962847,0.006168759,0.00036922435,0.000022058506,0.0000058536107,0.0059906016,0.88791615,0.00078228954,0.000077653174,0.09586956,0.00078493217],"about_ca_topic_score_codex":0.000416846,"about_ca_topic_score_gemma":0.00026664673,"teacher_disagreement_score":0.532406,"about_ca_system_score_codex":0.00075860723,"about_ca_system_score_gemma":0.0015643319,"threshold_uncertainty_score":0.99869037},"labels":[],"label_agreement":null},{"id":"W2116230268","doi":"10.1287/opre.1070.0438","title":"Risk in Revenue Management and Dynamic Pricing","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Revenue management; Dynamic pricing; Revenue; Mathematical optimization; Poisson distribution; Computer science; Set (abstract data type); Process (computing); Event (particle physics); Bellman equation; Optimal control; Operations research; Econometrics; Economics; Microeconomics; Mathematics; Finance; Statistics","score_opus":0.03772066603899001,"score_gpt":0.33415361692269374,"score_spread":0.29643295088370375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116230268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8917481,0.00023807387,0.002270763,0.0011351957,0.00017408704,0.00091664406,0.0000023838124,0.00004218476,0.10347262],"genre_scores_gemma":[0.989774,0.00015832706,0.000813803,0.00026697014,0.00017179342,0.000051882012,0.00001576483,0.000016196915,0.008731286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987303,0.00003229122,0.00021530717,0.00027140192,0.00036103488,0.00038964214],"domain_scores_gemma":[0.9995978,0.00004075692,0.000017313323,0.00023622822,0.00009275668,0.000015170088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033490376,0.000085572625,0.00008600575,0.0009855512,0.00041176006,0.0003412575,0.00017550375,0.000034232147,0.0001552135],"category_scores_gemma":[0.00010840669,0.000084107385,0.000018263212,0.0009976127,0.00007062375,0.00051354535,0.00031779782,0.00024821918,0.00026612935],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001675801,0.00084795937,0.20406717,0.00096810755,0.00013676172,0.0004798243,0.0014546674,0.0075751855,0.001175162,0.4193395,0.032286044,0.33150202],"study_design_scores_gemma":[0.0016951722,0.00003331795,0.4380664,0.00019499434,0.00002799878,0.0000023148962,0.006183012,0.14475669,0.000050258754,0.00552956,0.40300873,0.00045155708],"about_ca_topic_score_codex":0.0016996567,"about_ca_topic_score_gemma":0.008092864,"teacher_disagreement_score":0.41380996,"about_ca_system_score_codex":0.000102405684,"about_ca_system_score_gemma":0.000007355517,"threshold_uncertainty_score":0.45160085},"labels":[],"label_agreement":null},{"id":"W2117650498","doi":"10.1287/opre.51.1.137.12796","title":"Dynamic Airline Revenue Management with Multiple Semi-Markov Demand","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Revenue management; Markov decision process; Revenue; Computer science; Markov chain; Markov process; Operations research; Counterexample; Function (biology); Process (computing); Yield management; Value (mathematics); Business; Mathematical optimization; Microeconomics; Economics; Mathematics; Finance","score_opus":0.031652714706798805,"score_gpt":0.2987809569820656,"score_spread":0.26712824227526677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117650498","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37742925,0.0005812744,0.019370312,0.0067133135,0.0007509589,0.0047402442,0.000026748115,0.00031675116,0.59007114],"genre_scores_gemma":[0.95307416,0.00007424795,0.0028721837,0.0006302863,0.00015667501,0.00034871354,0.00009631764,0.0000436637,0.04270375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803686,0.00008357578,0.000239768,0.00043317873,0.0006820914,0.0005245302],"domain_scores_gemma":[0.9990562,0.000044001685,0.000025342133,0.0005305234,0.00031360885,0.000030331177],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015133184,0.00017234645,0.00014867105,0.00057756354,0.00082034804,0.0005886512,0.0003180335,0.000048078222,0.0010990973],"category_scores_gemma":[0.00015640094,0.00014632713,0.000044219276,0.001137531,0.00012229549,0.00071536255,0.0001916774,0.0002552553,0.001001587],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003675283,0.0023563786,0.03726416,0.0018145129,0.00072234316,0.0005743017,0.0005641967,0.08161879,0.0020459718,0.51887256,0.32936063,0.024438633],"study_design_scores_gemma":[0.0016253567,0.00004450925,0.0030464495,0.00011725732,0.000039552026,0.0000041723847,0.0015207028,0.10904021,0.00009725673,0.0006910043,0.8834095,0.00036402082],"about_ca_topic_score_codex":0.0003092288,"about_ca_topic_score_gemma":0.0024615943,"teacher_disagreement_score":0.5756449,"about_ca_system_score_codex":0.00011377455,"about_ca_system_score_gemma":0.000031980966,"threshold_uncertainty_score":0.99981403},"labels":[],"label_agreement":null},{"id":"W2119601963","doi":"10.1287/opre.1120.1048","title":"A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":685,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Population; Genetic algorithm; Routing (electronic design automation); Algorithm; Mathematics; Medicine","score_opus":0.06420246300526486,"score_gpt":0.3580434042946693,"score_spread":0.2938409412894044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119601963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3355439,0.0007417302,0.66238207,0.00008227894,0.0000975229,0.00067614287,0.000019494895,0.00013857338,0.0003182714],"genre_scores_gemma":[0.5581167,0.000060645496,0.44108456,0.000008284718,0.00015796842,0.0002542058,0.000012107833,0.000037294616,0.00026826718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986751,0.00016259994,0.00021736047,0.00017029491,0.00022715853,0.0005474593],"domain_scores_gemma":[0.99923515,0.00019250586,0.000006368768,0.00019851798,0.00020800023,0.00015943217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014455678,0.00010258181,0.00011456363,0.00015372985,0.0005590562,0.000213889,0.00010648524,0.000050705425,0.00004130988],"category_scores_gemma":[0.00028684098,0.000106231746,0.000025228963,0.00024015129,0.0000681301,0.0002522123,0.00006170103,0.000232042,0.000028279394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022392992,0.000069053145,0.003985792,0.00010502245,0.000038980128,0.0000013119143,0.0024842117,0.703074,0.023583867,0.00034243704,0.00034304996,0.26597008],"study_design_scores_gemma":[0.00030090395,0.000027616485,0.0036236965,0.000017771494,0.0000049015107,0.000014461002,0.00012793181,0.9907183,0.003872706,0.000012145859,0.0011562873,0.00012324553],"about_ca_topic_score_codex":0.0000484222,"about_ca_topic_score_gemma":0.000008423943,"teacher_disagreement_score":0.28764436,"about_ca_system_score_codex":0.00007823614,"about_ca_system_score_gemma":0.000037564387,"threshold_uncertainty_score":0.43320048},"labels":[],"label_agreement":null},{"id":"W2120057998","doi":"10.1287/opre.1040.0195","title":"A Stochastic Salvo Model for Naval Surface Combat","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Military Defense Systems Analysis","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Offensive; Navy; Battle; Operations research; Variance (accounting); Computer science; Position (finance); Stochastic modelling; Econometrics; Aeronautics; Economics; Mathematics; Engineering; Statistics; History; Political science; Law","score_opus":0.07946203718585708,"score_gpt":0.35982280027106844,"score_spread":0.28036076308521135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120057998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34555554,0.0007883229,0.6504147,0.00053534657,0.00005359045,0.0007362417,0.00009930568,0.00014721752,0.001669741],"genre_scores_gemma":[0.9755352,0.000016417525,0.014354225,0.000009530802,0.00012074851,0.00014536908,0.000039031558,0.00003528802,0.009744147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988253,0.00005849502,0.000218602,0.00018802984,0.0003481428,0.00036144274],"domain_scores_gemma":[0.999123,0.000118501484,0.0000026171963,0.00035516339,0.00029881464,0.000101952166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353937,0.000094857125,0.00014786552,0.00016182146,0.00029468973,0.00008294268,0.00017334295,0.000060471026,0.00012967759],"category_scores_gemma":[0.00010752465,0.00009404531,0.00006531432,0.0003499515,0.00003966322,0.00017621453,0.00003213167,0.00020713698,0.00033462484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031610214,0.000017631943,0.0000026574799,0.000021218068,0.000035501267,2.812507e-7,0.000593378,0.9826679,0.0058906497,0.0013823934,0.008994592,0.0003906419],"study_design_scores_gemma":[0.00018971453,0.00001691455,0.000007351643,0.000010040385,0.000007523767,0.0000019307934,0.00013907207,0.99791104,0.00020903503,0.000034769248,0.0013747603,0.00009786106],"about_ca_topic_score_codex":0.00015204733,"about_ca_topic_score_gemma":0.0025878542,"teacher_disagreement_score":0.6360605,"about_ca_system_score_codex":0.00016818337,"about_ca_system_score_gemma":0.000073563795,"threshold_uncertainty_score":0.4301037},"labels":[],"label_agreement":null},{"id":"W2121548421","doi":"10.1287/opre.1080.0618","title":"A Dynamic Simulator for the Management of Disorders of the Body Water Homeostasis","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Electrolyte and hormonal disorders","field":"Medicine","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Hypertonic saline; Hyponatremia; Psychological intervention; Simulation; Medicine; Anesthesia","score_opus":0.037290362457864504,"score_gpt":0.37063126313721895,"score_spread":0.33334090067935446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121548421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857475,0.00062398694,0.0005486697,0.009430559,0.000014014795,0.0015254576,0.0000148460895,0.000004878837,0.0020900434],"genre_scores_gemma":[0.9928783,0.0015279762,0.0001771416,0.000046454064,0.000007133686,0.00015187047,0.00001232666,0.000010555056,0.0051882337],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991027,0.000041807314,0.00015118966,0.00010562202,0.0003903277,0.00020833097],"domain_scores_gemma":[0.99932873,0.00008498592,0.0000071919662,0.0003371483,0.00021760755,0.000024346367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003156783,0.000051090698,0.00009765517,0.000075583244,0.0004068068,0.000006828212,0.0001706811,0.000025951029,0.00007607728],"category_scores_gemma":[0.000027230542,0.000023198309,0.000092164046,0.00026279286,0.00024019319,0.000031511514,0.00006716438,0.00012660112,0.0000074061004],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004183543,0.0062831976,0.012191561,0.00292283,0.0061695273,0.000020816113,0.016687358,0.08699031,0.6757711,0.060385004,0.020514274,0.10788049],"study_design_scores_gemma":[0.009585538,0.0029126208,0.4650595,0.00027459094,0.00056117686,0.000022721078,0.006165533,0.38319707,0.088716604,0.0016831217,0.041423354,0.00039816348],"about_ca_topic_score_codex":0.00015829038,"about_ca_topic_score_gemma":0.00024219998,"teacher_disagreement_score":0.5870545,"about_ca_system_score_codex":0.00002609104,"about_ca_system_score_gemma":0.000075781005,"threshold_uncertainty_score":0.312887},"labels":[],"label_agreement":null},{"id":"W2122482669","doi":"10.1287/opre.1070.0437","title":"Compensating for Failures with Flexible Servers","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Independent and identically distributed random variables; Bounded function; Flexibility (engineering); Mathematical optimization; Probabilistic logic; Routing (electronic design automation); Markov process; Layered queueing network; Queueing theory; Distributed computing; Linear programming; Process (computing); Construct (python library); Service (business); Random variable; Mathematics; Computer network; Algorithm","score_opus":0.08480591749249393,"score_gpt":0.38325524129534205,"score_spread":0.2984493238028481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122482669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348652,0.000046110275,0.3012167,0.0047162273,0.00009076888,0.0012835612,0.000005216589,0.00027996156,0.05749626],"genre_scores_gemma":[0.98061436,7.78288e-7,0.014636916,0.00026375172,0.00048554988,0.00006068981,0.00004951959,0.000024823134,0.0038636127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988785,0.000017552093,0.00015830247,0.00022679205,0.0003342083,0.00038466873],"domain_scores_gemma":[0.9987139,0.0002266394,0.000021226855,0.0002383074,0.0007854862,0.000014435131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024652714,0.000082496306,0.000103201215,0.00044149449,0.0010973118,0.0004237073,0.00021186555,0.000031942836,0.00022921288],"category_scores_gemma":[0.00043612765,0.00006837006,0.000036080415,0.0010910383,0.00010620414,0.000919877,0.00008683046,0.00016392008,0.0001647489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023405814,0.000095771196,0.0033723654,0.00010803981,0.000072095965,0.000009328185,0.000149421,0.14263242,0.0058001694,0.8408457,0.0017342204,0.004946415],"study_design_scores_gemma":[0.0031950024,0.00017547834,0.0033140762,0.00023260787,0.00013159555,0.0000069248517,0.01424001,0.49280152,0.01125002,0.024429958,0.44914344,0.0010793693],"about_ca_topic_score_codex":0.0005409009,"about_ca_topic_score_gemma":0.0035961343,"teacher_disagreement_score":0.8164157,"about_ca_system_score_codex":0.000047850706,"about_ca_system_score_gemma":0.000032291824,"threshold_uncertainty_score":0.84397465},"labels":[],"label_agreement":null},{"id":"W2123440207","doi":"10.1287/opre.1120.1064","title":"A Broader View of Designing the Liver Allocation System","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Organ Transplantation Techniques and Outcomes","field":"Medicine","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Kellogg's (Canada)","funders":"School of Medicine and Public Health, University of Wisconsin-Madison; Institute for Clinical and Translational Research, University of Wisconsin, Madison; University of Waterloo; National Institutes of Health; National Science Foundation","keywords":"United Network for Organ Sharing; Waiting list; Queue; Computer science; Metric (unit); Transplantation; Mathematical optimization; Medicine; Liver transplantation; Operations research; Operations management; Economics; Mathematics; Surgery","score_opus":0.1330388460326643,"score_gpt":0.42150586605702295,"score_spread":0.28846702002435864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123440207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7372667,0.015641164,0.18984494,0.014137615,0.00031450458,0.006479669,0.00003171162,0.00039014887,0.035893537],"genre_scores_gemma":[0.9924629,0.00061536767,0.0052732406,0.00006939281,0.00008459641,0.000069565875,0.000013745021,0.000009175646,0.0014020569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991223,0.00017169613,0.00015509741,0.00006716926,0.00032061778,0.00016309024],"domain_scores_gemma":[0.9993339,0.000105584935,0.000009006463,0.00019995308,0.00029662947,0.000054884098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010697691,0.00004234047,0.00008722641,0.0000977926,0.00020112266,0.00002120199,0.000070606926,0.000038395563,0.00018747074],"category_scores_gemma":[0.000058453934,0.000025924594,0.000029625422,0.00029471316,0.00006794271,0.00011228893,0.000014098456,0.00015653849,0.00009527787],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030457156,0.0013743865,0.088888586,0.008445151,0.0004231583,0.000031490355,0.041955873,0.00035753485,0.39244196,0.39307597,0.01491672,0.057784613],"study_design_scores_gemma":[0.0013280252,0.00044145618,0.13340117,0.001059615,0.00021594914,0.00030718805,0.008667562,0.009075747,0.8260278,0.00001641685,0.019202245,0.00025681368],"about_ca_topic_score_codex":0.00017566602,"about_ca_topic_score_gemma":0.000016038355,"teacher_disagreement_score":0.43358585,"about_ca_system_score_codex":0.000052360454,"about_ca_system_score_gemma":0.00008496321,"threshold_uncertainty_score":0.20526731},"labels":[],"label_agreement":null},{"id":"W2123830469","doi":"10.1287/opre.2014.1298","title":"Robustness of Order-Up-to Policies in Lost-Sales Inventory Systems","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asymptotically optimal algorithm; Stock (firearms); Holding cost; Robustness (evolution); Mathematical optimization; Inventory control; Computer science; Economics; Economic order quantity; Heuristic; Stockout; Mathematics; Econometrics; Operations research; Supply chain; Business","score_opus":0.09495723021404204,"score_gpt":0.34006398526220827,"score_spread":0.24510675504816623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123830469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92548656,0.00013531817,0.004128147,0.0044484525,0.00092040555,0.0013808256,0.0000039844754,0.000056406618,0.0634399],"genre_scores_gemma":[0.98901427,0.000011099816,0.000098392695,0.0002548655,0.00068659487,0.00015350616,0.000031541946,0.000022476463,0.009727284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.000109939596,0.00033364416,0.0002496094,0.00057908753,0.00038070756],"domain_scores_gemma":[0.9989042,0.000054230695,0.00002583548,0.00038422924,0.0006069836,0.000024520834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019689351,0.00011082045,0.00018646776,0.0012994233,0.000208817,0.00038530878,0.00041954883,0.00005082812,0.00022995587],"category_scores_gemma":[0.0005558903,0.000104104736,0.000030537303,0.0016480316,0.0001107784,0.00053537247,0.0003405648,0.00016371052,0.00056880835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036545374,0.00024406656,0.012142782,0.00066822214,0.000026733102,0.0000027201668,0.0007318665,0.5849812,0.001317587,0.3390295,0.05967548,0.0011432928],"study_design_scores_gemma":[0.0005907433,0.00004097597,0.0035482878,0.00018744692,0.0000070122423,4.0484565e-7,0.0038049936,0.7465868,0.00010508671,0.00010655542,0.24478836,0.00023332717],"about_ca_topic_score_codex":0.0059577907,"about_ca_topic_score_gemma":0.0038900683,"teacher_disagreement_score":0.33892295,"about_ca_system_score_codex":0.00007466945,"about_ca_system_score_gemma":0.000047393787,"threshold_uncertainty_score":0.9006437},"labels":[],"label_agreement":null},{"id":"W2124847400","doi":"10.1287/opre.1060.0314","title":"Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematical optimization; Piecewise linear function; Flow network; Integer programming; Linear programming; Variable (mathematics); Linear programming relaxation; Flow (mathematics); Computer science; Relaxation (psychology); Class (philosophy); Set (abstract data type); Envelope (radar); Mathematics; Function (biology)","score_opus":0.057923069004432934,"score_gpt":0.3193196992811413,"score_spread":0.26139663027670834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124847400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45364234,0.00034228613,0.2617572,0.011010448,0.00079677283,0.005629517,0.000009010551,0.0003757925,0.26643664],"genre_scores_gemma":[0.98237306,0.000027800657,0.009817114,0.00044521422,0.0008086663,0.00019994084,0.0002808563,0.000025772328,0.006021576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828494,0.000034328452,0.0003022708,0.0003016514,0.0005611702,0.0005156723],"domain_scores_gemma":[0.9990864,0.000029452289,0.000011058015,0.00031150173,0.0005386674,0.000022956157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382559,0.00010862766,0.00010504412,0.0004165633,0.00048923644,0.00030774795,0.00021360758,0.00005209643,0.00079556584],"category_scores_gemma":[0.00019117616,0.0000942661,0.000016679911,0.0026092303,0.00007035965,0.0009956888,0.00012409764,0.00025536164,0.0007385233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053660817,0.00020954588,0.007835569,0.000083906205,0.000012406838,0.000004803884,0.0001000728,0.8987406,0.000088415116,0.07987979,0.00532845,0.0076627876],"study_design_scores_gemma":[0.00061729795,0.000026732383,0.01056772,0.00009870104,0.0000066518646,5.5485776e-7,0.00039984492,0.8833293,0.000016647273,0.00051711535,0.10422368,0.00019579352],"about_ca_topic_score_codex":0.008505907,"about_ca_topic_score_gemma":0.079546854,"teacher_disagreement_score":0.5287307,"about_ca_system_score_codex":0.00014068735,"about_ca_system_score_gemma":0.00005683254,"threshold_uncertainty_score":0.9980965},"labels":[],"label_agreement":null},{"id":"W2125429580","doi":"10.1287/opre.2014.1309","title":"Modeling Short-Range Ballistic Missile Defense and Israel's Iron Dome System","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Military Defense Systems Analysis","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Ballistic missile; Interception; Missile; Range (aeronautics); Dome (geology); Imperfect; Missile defense; Computer science; Civil defense; Computer security; Aeronautics; Operations research; Law; Aerospace engineering; Engineering; Geology; Political science","score_opus":0.04171082980221792,"score_gpt":0.29791477218731666,"score_spread":0.25620394238509875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125429580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91573626,0.0019008868,0.066959545,0.0000744625,0.00010345841,0.00040995327,0.000026951793,0.00022529195,0.014563194],"genre_scores_gemma":[0.99758184,0.00007345519,0.0012539866,0.000004733695,0.00016488046,0.000099294855,0.000024261628,0.000040644245,0.00075692753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825335,0.00026872556,0.0003195944,0.00030118064,0.00046740583,0.00038973903],"domain_scores_gemma":[0.9989594,0.0001085707,0.00000266213,0.00050478335,0.0002321149,0.00019242358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530672,0.00014251641,0.00023738471,0.00033052987,0.00040217972,0.00018517308,0.00016111406,0.000095703384,0.00005683786],"category_scores_gemma":[0.0001524202,0.00013494572,0.000049542352,0.00040417066,0.00004854082,0.00016311358,0.00005516969,0.00028850895,0.00021440118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031809168,0.000009848681,0.0001662256,0.00030708147,0.000034262568,0.0000075328003,0.00038611764,0.9894468,0.0028981545,0.0057299514,0.00036833194,0.0006425115],"study_design_scores_gemma":[0.00011060696,0.000022428572,0.000064960695,0.000064064894,0.000017349448,0.000016593618,0.00079714763,0.99797684,0.00003379013,0.000009554444,0.0007474416,0.0001392482],"about_ca_topic_score_codex":0.0016482248,"about_ca_topic_score_gemma":0.0018222373,"teacher_disagreement_score":0.08184556,"about_ca_system_score_codex":0.00015523362,"about_ca_system_score_gemma":0.00002390112,"threshold_uncertainty_score":0.5502927},"labels":[],"label_agreement":null},{"id":"W2125455067","doi":"10.1287/opre.50.6.1050.354","title":"Linear Facility Location in Three Dimensions—Models and Solution Methods","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Line (geometry); Line segment; Facility location problem; Set (abstract data type); Space (punctuation); Computer science; Linear programming; Mathematical optimization; Directional drilling; Drilling; Geology; Algorithm; Mathematics; Geometry; Artificial intelligence; Engineering; Mechanical engineering","score_opus":0.2640186644653483,"score_gpt":0.4150259626632922,"score_spread":0.15100729819794395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125455067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49679533,0.0005717422,0.4992731,0.00029991768,0.000037232643,0.00029396117,0.0000075084918,0.000109872926,0.0026113256],"genre_scores_gemma":[0.89958847,0.00046578402,0.099673584,0.0000045164948,0.00001536723,0.000069952046,0.000008069663,0.00000691474,0.00016732616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941236,0.00007485617,0.00014467722,0.00013031131,0.000067509645,0.0001702585],"domain_scores_gemma":[0.9996355,0.000056745357,0.0000022892475,0.00019237828,0.00007181558,0.000041283005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010076065,0.00005094704,0.00007212191,0.00015355826,0.00013382589,0.00004485828,0.000062089784,0.0000675433,0.00009957801],"category_scores_gemma":[0.00006294021,0.00005383161,0.0000086320515,0.000227368,0.000039627805,0.00021192519,0.000044917393,0.00022116606,0.0000466904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036249805,0.000055927863,0.0006029545,0.000044470733,0.00000940729,0.0000012368655,0.001111943,0.92111385,0.0064565353,0.010773316,0.0011493368,0.058677394],"study_design_scores_gemma":[0.0000642679,0.000020199248,0.00028524245,0.0000084025805,6.722247e-7,0.0000014201938,0.000026607799,0.9969714,0.00079549185,0.0011681829,0.00060365,0.000054454955],"about_ca_topic_score_codex":0.00023002265,"about_ca_topic_score_gemma":0.0007866298,"teacher_disagreement_score":0.40279314,"about_ca_system_score_codex":0.00009303322,"about_ca_system_score_gemma":0.000009251182,"threshold_uncertainty_score":0.21951893},"labels":[],"label_agreement":null},{"id":"W2125771650","doi":"10.1287/opre.50.3.538.7737","title":"Hybrid Fiber Coaxial Network Design","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristics; Network planning and design; Mathematical optimization; Heuristic; Context (archaeology); Tabu search; Exploit; The Internet; Distributed computing; Algorithm; Computer network; Artificial intelligence; Mathematics","score_opus":0.1388816461261699,"score_gpt":0.3622179414103387,"score_spread":0.2233362952841688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125771650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006598993,0.00046272686,0.95211744,0.0004912689,0.0002424408,0.0005293206,0.000007131176,0.00042977094,0.039120927],"genre_scores_gemma":[0.2874268,0.00024736376,0.6885277,0.000044837732,0.0007335914,0.00016318209,0.00001788345,0.00008394546,0.022754675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846894,0.00044751965,0.00017468842,0.00015644173,0.0003282832,0.0004241029],"domain_scores_gemma":[0.9991817,0.00025054015,0.0000030171618,0.0002892411,0.00017836777,0.00009715442],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013492055,0.000084797895,0.000093446695,0.0001196836,0.00043051998,0.00019541112,0.000183972,0.000050816605,0.004964429],"category_scores_gemma":[0.00022988184,0.00008901159,0.000024698078,0.00045976316,0.00005692966,0.00015660038,0.00004228606,0.00035442412,0.0019713726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010983356,0.0000113833075,0.0000087563085,0.000003967291,0.000008999914,0.0000039701927,0.00007655567,0.9233034,0.00030891554,0.00029776452,0.06766396,0.00831123],"study_design_scores_gemma":[0.00013174233,0.000021986953,0.000021833232,0.000008428289,0.0000019827423,0.000007379821,0.000007965586,0.9772532,0.0013602062,0.000048987047,0.021039788,0.000096478616],"about_ca_topic_score_codex":0.000010668468,"about_ca_topic_score_gemma":0.0000044791004,"teacher_disagreement_score":0.28082782,"about_ca_system_score_codex":0.00008204,"about_ca_system_score_gemma":0.000019451685,"threshold_uncertainty_score":0.9988057},"labels":[],"label_agreement":null},{"id":"W2127277545","doi":"10.1287/opre.51.6.981.24912","title":"Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematical optimization; Parametric statistics; Linear programming relaxation; Scheduling (production processes); Linear programming; Decomposition; Computer science; Mathematics; Relaxation (psychology); Permutation (music); Schedule; Job shop scheduling; Algorithm","score_opus":0.036609564681968756,"score_gpt":0.3075154858989144,"score_spread":0.2709059212169457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127277545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116045296,0.006494645,0.84380794,0.0008368933,0.00038406294,0.0011966897,0.000036013338,0.0006685152,0.030529939],"genre_scores_gemma":[0.49413994,0.00017177785,0.5052988,0.000015321204,0.00005844628,0.00007000147,0.00002744532,0.000020799429,0.00019747695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879986,0.0001851247,0.00021214249,0.00020533381,0.00023450893,0.00036304502],"domain_scores_gemma":[0.99929476,0.00014524846,0.000005256073,0.00018329368,0.00022918692,0.0001422461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082763797,0.00011146801,0.000112873655,0.00014200815,0.000611804,0.00031383728,0.00009668805,0.000076306984,0.00018170792],"category_scores_gemma":[0.00020631801,0.00011412998,0.00001982401,0.00062046334,0.000089502624,0.00018778254,0.000024574352,0.00035597457,0.000043603806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018946544,0.000030406438,0.00008681018,0.000016802753,0.00001732898,0.0000021396263,0.00018951022,0.99130094,0.0020676192,0.004308655,0.000092964176,0.0018849088],"study_design_scores_gemma":[0.00026759866,0.000040071234,0.000021147325,0.000057081903,0.0000045795064,0.000031990017,0.00013337997,0.9973022,0.0012067134,0.00019706026,0.0006021481,0.00013604676],"about_ca_topic_score_codex":0.000018361347,"about_ca_topic_score_gemma":0.00015257487,"teacher_disagreement_score":0.37809464,"about_ca_system_score_codex":0.00005864749,"about_ca_system_score_gemma":0.000074940515,"threshold_uncertainty_score":0.47055638},"labels":[],"label_agreement":null},{"id":"W2127305225","doi":"10.1287/opre.1080.0568","title":"Cross-Selling in a Call Center with a Heterogeneous Customer Population","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Staffing; Profitability index; Center (category theory); Product (mathematics); Market segmentation; Revenue; Business; Computer science; Revenue management; Population; Marketing; Economics; Finance; Mathematics","score_opus":0.04302358875044654,"score_gpt":0.3655008521459309,"score_spread":0.3224772633954844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127305225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99161476,0.000021642356,0.0014598097,0.00052148604,0.000018755596,0.0002461682,0.0000011961029,0.000046371086,0.0060697985],"genre_scores_gemma":[0.9974034,0.000004705816,0.00057236076,0.00030175495,0.00020556577,0.000027042224,0.000065856955,0.0000146497005,0.0014047091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880975,0.00004288484,0.00019892954,0.0002701967,0.0003530339,0.00032520905],"domain_scores_gemma":[0.99938345,0.000027186441,0.000019094008,0.0002453418,0.00031201178,0.000012895593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007090097,0.000092710085,0.000119252225,0.0006199813,0.00039769342,0.0005551251,0.00016890712,0.000042874726,0.00023548029],"category_scores_gemma":[0.000115774325,0.00007837814,0.000030550214,0.001219207,0.000048989572,0.0010358383,0.000042233773,0.00023628706,0.00034365858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012760029,0.00021160996,0.049361646,0.00001748158,0.00001343827,0.000049742222,0.00011202835,0.92838687,0.00080424326,0.016439062,0.00005338973,0.004422877],"study_design_scores_gemma":[0.0021675227,0.000083385064,0.07151969,0.0001920154,0.000027496024,0.000017473885,0.00019202565,0.9034452,0.00039156782,0.005403773,0.015856713,0.0007031592],"about_ca_topic_score_codex":0.0009336471,"about_ca_topic_score_gemma":0.0034992034,"teacher_disagreement_score":0.024941707,"about_ca_system_score_codex":0.000082991544,"about_ca_system_score_gemma":0.000014116616,"threshold_uncertainty_score":0.5353084},"labels":[],"label_agreement":null},{"id":"W2127943707","doi":"10.1287/opre.1080.0608","title":"Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Mathematical optimization; Regular polygon; Computer science; Dynamic pricing; Order (exchange); Scheduling (production processes); Asymptotically optimal algorithm; Lead time; Convex function; Concave function; Nonlinear pricing; Dynamic programming; Nonlinear system; Mathematics; Economics; Microeconomics; Operations management","score_opus":0.027639056450986077,"score_gpt":0.3411861512873318,"score_spread":0.31354709483634574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127943707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97037303,0.00013328237,0.01623322,0.0036667406,0.00003879911,0.00035327778,0.000002486467,0.00010418149,0.009095004],"genre_scores_gemma":[0.9915346,0.000018572346,0.0044555836,0.0006495859,0.00015783642,0.000023197768,0.00008699163,0.000022674507,0.003050947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985141,0.00008979602,0.00023726952,0.00036427865,0.00041141803,0.0003831232],"domain_scores_gemma":[0.99891615,0.00013116206,0.00003403327,0.00026624967,0.00062547205,0.000026949012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012224279,0.000140805,0.00017681411,0.00043965213,0.0011459087,0.0009944375,0.00018236137,0.000080855425,0.00037663733],"category_scores_gemma":[0.0003696244,0.00013771455,0.000043644213,0.0010343113,0.00021741822,0.0015951397,0.000097825665,0.00035694567,0.0017809178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011553588,0.00016987244,0.00026389078,0.00003168209,0.00009474254,0.00002691338,0.0003031484,0.8049535,0.04390096,0.12575881,0.00040964384,0.023971297],"study_design_scores_gemma":[0.00037475632,0.000019700103,0.0007054131,0.000028151064,0.00003298232,0.0000037168472,0.00057785853,0.99497104,0.000121284094,0.0018366748,0.0011386675,0.00018978262],"about_ca_topic_score_codex":0.00016563958,"about_ca_topic_score_gemma":0.00017911984,"teacher_disagreement_score":0.19001752,"about_ca_system_score_codex":0.00013992166,"about_ca_system_score_gemma":0.000060955314,"threshold_uncertainty_score":0.9989963},"labels":[],"label_agreement":null},{"id":"W2128483867","doi":"10.1287/opre.1060.0285","title":"Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":154,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Linear programming; Computer science; Mathematical optimization; Staffing; Routing (electronic design automation); Upper and lower bounds; Center (category theory); Asymptotically optimal algorithm; Mathematics; Computer network; Economics","score_opus":0.03535919632853935,"score_gpt":0.36859466933104584,"score_spread":0.3332354730025065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128483867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1764724,0.00004071889,0.8224129,0.00023745703,0.0000071233517,0.0002644485,0.000019673516,0.000017536951,0.0005277506],"genre_scores_gemma":[0.97886705,0.0000015156788,0.020672427,0.00008258178,0.000051069233,0.000029312478,0.00010208806,0.000012295828,0.00018162857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848014,0.00035121228,0.00031481625,0.00024432383,0.00036966163,0.00023983313],"domain_scores_gemma":[0.9984944,0.00035859368,0.00006079056,0.00033379075,0.00073834124,0.000014098886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032855296,0.00008863497,0.0003077,0.0013452116,0.0002464052,0.000113850874,0.00018796769,0.000043453885,0.00019901898],"category_scores_gemma":[0.00031640113,0.000080126105,0.00008341706,0.0023409813,0.000103870865,0.00048192582,0.000054033822,0.000112457274,0.0000067964847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010408356,0.00042721437,0.0044623846,0.00004704871,0.0003081423,0.000003540174,0.000028339575,0.9403235,0.020456146,0.03313954,0.000039446353,0.0006606229],"study_design_scores_gemma":[0.0007121481,0.000022827606,0.0018478734,0.000010847626,0.000406809,1.2626555e-7,0.00006452946,0.9944152,0.0015009356,0.00069217477,0.00025059073,0.00007589439],"about_ca_topic_score_codex":0.0013386073,"about_ca_topic_score_gemma":0.0013642154,"teacher_disagreement_score":0.8023947,"about_ca_system_score_codex":0.000023037917,"about_ca_system_score_gemma":0.00003717434,"threshold_uncertainty_score":0.3267448},"labels":[],"label_agreement":null},{"id":"W2128586119","doi":"10.1287/opre.51.6.952.24913","title":"Dynamic Server Allocation for Queueing Networks with Flexible Servers","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Layered queueing network; Computer science; Queueing theory; Upper and lower bounds; Independent and identically distributed random variables; Mathematical optimization; Computer network; Routing (electronic design automation); Probabilistic logic; Flexibility (engineering); Distributed computing; Linear programming; Random variable; Mathematics; Algorithm","score_opus":0.04070181517824167,"score_gpt":0.33748427954507054,"score_spread":0.29678246436682887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128586119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.373702,0.0001525714,0.6042124,0.0022213303,0.0001498353,0.0015250888,0.000002481032,0.00024044562,0.017793829],"genre_scores_gemma":[0.9863369,0.000009475296,0.006048905,0.00024682106,0.000119912176,0.00024237556,0.00009454584,0.000036611436,0.0068644667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998822,0.000061328,0.00016252138,0.0002972484,0.00028779628,0.00036911693],"domain_scores_gemma":[0.99872816,0.000099749595,0.000025946127,0.00033550715,0.00079501857,0.000015596022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015973944,0.00010723213,0.00011498188,0.00033560293,0.00097148237,0.00048716544,0.00019233242,0.00005230471,0.00023561188],"category_scores_gemma":[0.00035242233,0.000094500734,0.00004339028,0.0013631844,0.000075594304,0.0013712384,0.00004674907,0.00019052706,0.000107372936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032759963,0.00003702491,0.00047311623,0.000032060674,0.000030420815,0.0000010233647,0.000021945072,0.7668434,0.00023671101,0.23161563,0.00023231679,0.0004436213],"study_design_scores_gemma":[0.00047348722,0.000021257329,0.000216051,0.000042468433,0.000033498618,0.0000010540539,0.00058050535,0.9758278,0.0001641292,0.003881167,0.018568477,0.00019009881],"about_ca_topic_score_codex":0.00024597914,"about_ca_topic_score_gemma":0.002419926,"teacher_disagreement_score":0.6126349,"about_ca_system_score_codex":0.00009810239,"about_ca_system_score_gemma":0.00006230953,"threshold_uncertainty_score":0.74719554},"labels":[],"label_agreement":null},{"id":"W2129895618","doi":"10.1287/opre.1060.0348","title":"Facility Reliability Issues in Network <i>p</i>-Median Problems: Strategic Centralization and Co-Location Effects","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":261,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Facility location problem; Reliability (semiconductor); Heuristic; Computer science; Service (business); Mathematical optimization; Operations research; Reliability engineering; Business; Mathematics; Artificial intelligence; Engineering; Marketing","score_opus":0.06620743073759103,"score_gpt":0.35169316196541583,"score_spread":0.28548573122782483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129895618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785371,0.00031743283,0.0049055945,0.0044078445,0.00026932053,0.0021304162,0.0000039962792,0.00010746211,0.009320867],"genre_scores_gemma":[0.9981643,0.00014026984,0.00023933119,0.00020023977,0.00026278468,0.00010979286,0.00028759823,0.000008409384,0.0005872977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980048,0.000113476955,0.00042034197,0.00042399403,0.0005161915,0.00052117906],"domain_scores_gemma":[0.99899375,0.0000632769,0.000014537637,0.0003314753,0.0005620653,0.00003489856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00501525,0.00013240724,0.00014110352,0.0003519204,0.00048609922,0.0003969227,0.00016737664,0.000085658714,0.00020155136],"category_scores_gemma":[0.0004952409,0.00012983123,0.00002037633,0.0017028472,0.00014306647,0.00095236395,0.00009486696,0.0002465772,0.00030894802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013298988,0.0010421729,0.2287122,0.003152492,0.000032689128,0.000011681417,0.001449641,0.57504696,0.0011290923,0.163957,0.010037556,0.015295505],"study_design_scores_gemma":[0.0014975567,0.00007880822,0.42278287,0.0002258112,0.000020122523,8.6951565e-7,0.0025833703,0.50583917,0.00024223232,0.010105301,0.055968188,0.0006556866],"about_ca_topic_score_codex":0.01106338,"about_ca_topic_score_gemma":0.046940126,"teacher_disagreement_score":0.19407065,"about_ca_system_score_codex":0.00011833627,"about_ca_system_score_gemma":0.000051352894,"threshold_uncertainty_score":0.995522},"labels":[],"label_agreement":null},{"id":"W2131165830","doi":"10.1287/opre.50.3.528.7744","title":"Production and Inventory Model Using Net Present Value","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Economic order quantity; Net present value; Present value; Holding cost; Time value of money; Value (mathematics); Production (economics); Total cost; Heuristic; Carrying cost; Mathematical optimization; Mathematics; Economics; Statistics; Microeconomics","score_opus":0.20324659280699484,"score_gpt":0.34219213654964004,"score_spread":0.1389455437426452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131165830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93330383,0.00051999604,0.0008770395,0.008398373,0.00038668982,0.0011170529,0.0000015977236,0.00010577568,0.055289626],"genre_scores_gemma":[0.9834588,0.000082731945,0.0006512376,0.00038454105,0.0013050953,0.00008357994,0.000011605626,0.000024083794,0.013998329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986413,0.000043689135,0.00017135259,0.00032918065,0.00049849827,0.0003159686],"domain_scores_gemma":[0.9994149,0.000008885097,0.000015895,0.00029275147,0.00024554605,0.000022005148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008206825,0.00010016124,0.000087529355,0.0004680806,0.00075255765,0.0005823489,0.0001607293,0.00004049616,0.00075631216],"category_scores_gemma":[0.00018167726,0.00009628664,0.000025324054,0.00052770774,0.0001286141,0.0012533395,0.00028839748,0.0001861122,0.00024380765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016498381,0.00045950213,0.0025223186,0.00028127705,0.000050670224,0.000009117709,0.0007543738,0.66400903,0.004105256,0.11588574,0.20679784,0.005108351],"study_design_scores_gemma":[0.00012677968,0.0000065642007,0.00009077617,0.00002444977,0.000009205914,0.000001042182,0.00033964927,0.96447396,0.00005637159,0.0007284574,0.034036852,0.00010589362],"about_ca_topic_score_codex":0.00072177686,"about_ca_topic_score_gemma":0.0001323571,"teacher_disagreement_score":0.3004649,"about_ca_system_score_codex":0.000076060955,"about_ca_system_score_gemma":0.000015189564,"threshold_uncertainty_score":0.8281088},"labels":[],"label_agreement":null},{"id":"W2131894029","doi":"10.1287/opre.2013.1250","title":"On Markov Equilibria in Dynamic Inventory Competition","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Booth School of Business, University of Chicago; University of British Columbia; Northwestern University","keywords":"Stockout; Context (archaeology); Markov chain; Mathematical economics; Inventory control; Goodwill; Economics; Mathematical optimization; Markov process; Computer science; Mathematics; Operations management","score_opus":0.04537499564143512,"score_gpt":0.32271123654176376,"score_spread":0.27733624090032866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131894029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68948144,0.000016925405,0.00047882213,0.0040299506,0.00032016242,0.00053128187,0.0000011658207,0.000067405366,0.3050728],"genre_scores_gemma":[0.99280214,0.000007814043,0.000073675175,0.001174465,0.0003208213,0.00012092961,0.00010038652,0.00002022179,0.005379532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985677,0.000106441614,0.00020339756,0.00028476308,0.00049451954,0.00034316795],"domain_scores_gemma":[0.9994371,0.000060772723,0.000014498508,0.00033187156,0.00013996434,0.000015808519],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017786662,0.00009971965,0.00010529226,0.00089380384,0.00028355798,0.00043170177,0.0002762202,0.000046010227,0.0018569487],"category_scores_gemma":[0.00031230133,0.00009765952,0.000034117304,0.0007292716,0.00008485801,0.0006206065,0.00020129158,0.00025609048,0.002427847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040913816,0.00028626077,0.0019110058,0.00009561616,0.000008418197,0.0000062350773,0.00005789799,0.003951098,0.0011546479,0.9672893,0.019948171,0.0052504046],"study_design_scores_gemma":[0.00070769497,0.000040575713,0.0065974994,0.00008587993,0.0000030701876,2.416723e-7,0.00025306753,0.851773,0.000016777964,0.008389495,0.13195883,0.0001738625],"about_ca_topic_score_codex":0.0007241619,"about_ca_topic_score_gemma":0.0027605782,"teacher_disagreement_score":0.95889986,"about_ca_system_score_codex":0.00013925624,"about_ca_system_score_gemma":0.000021187638,"threshold_uncertainty_score":0.9990555},"labels":[],"label_agreement":null},{"id":"W2134850437","doi":"10.1287/opre.1100.0822","title":"Option Pricing Under GARCH Processes Using PDE Methods","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Valuation of options; Valuation (finance); Computation; Autoregressive conditional heteroskedasticity; Mathematical optimization; Interpolation (computer graphics); Computer science; Partial differential equation; Applied mathematics; Spectral method; Numerical analysis; Fourier transform; Mathematics; Econometrics; Algorithm; Volatility (finance); Economics; Finance; Mathematical analysis","score_opus":0.23722773802839608,"score_gpt":0.45727784609853017,"score_spread":0.2200501080701341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134850437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056468353,0.00041341543,0.9355704,0.0008642304,0.0001561498,0.00037733818,0.000030358671,0.00003204295,0.0060877176],"genre_scores_gemma":[0.7532788,0.000050013587,0.24529868,0.000054881377,0.0002638225,0.00023104427,0.00001814006,0.000024960798,0.0007796658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987197,0.000018027691,0.00038363427,0.00041491102,0.000088472116,0.000375259],"domain_scores_gemma":[0.9988468,0.00017233552,0.000040847914,0.0003731996,0.0004733341,0.00009342924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017388604,0.00009793211,0.00017717399,0.0004006939,0.00092763075,0.00028112283,0.00030932325,0.000119247015,0.00019930772],"category_scores_gemma":[0.0011807588,0.00010801732,0.000034928365,0.0014131886,0.00014776729,0.00030649605,0.00011136811,0.00054051867,0.00039768877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030836813,0.00007886401,0.00016789052,0.000028385699,0.000007583403,2.691518e-7,0.0002520979,0.0017460099,0.011738291,0.9839494,0.00002068544,0.0020074146],"study_design_scores_gemma":[0.00041550153,0.00008563773,0.003660463,0.000030462728,0.0000070206165,0.000022495893,0.0004578334,0.22251815,0.005320756,0.7435038,0.02352093,0.0004569498],"about_ca_topic_score_codex":0.0009314419,"about_ca_topic_score_gemma":0.00045982434,"teacher_disagreement_score":0.6968104,"about_ca_system_score_codex":0.000078972866,"about_ca_system_score_gemma":0.00025896245,"threshold_uncertainty_score":0.71346796},"labels":[],"label_agreement":null},{"id":"W2135263108","doi":"10.1287/opre.1120.1081","title":"Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":167,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Masdar Institute of Science and Technology; National Science Foundation","keywords":"Flexibility (engineering); Chain (unit); Computer science; Mathematical optimization; Process (computing); Characterization (materials science); Block (permutation group theory); Property (philosophy); Independent and identically distributed random variables; Order (exchange); Mathematics; Random variable; Economics; Statistics","score_opus":0.35382687927116185,"score_gpt":0.3727503884605931,"score_spread":0.018923509189431253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135263108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98892444,0.00007569593,0.00029083565,0.0017244242,0.00008402831,0.00059123576,4.3136083e-7,0.00000769258,0.008301197],"genre_scores_gemma":[0.9990271,0.000014961775,0.000013159399,0.00015255559,0.00015760047,0.00006593859,0.0000019038257,0.000006912706,0.0005599124],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990357,0.000074670534,0.00015060321,0.000118459306,0.00034705267,0.0002734866],"domain_scores_gemma":[0.99957687,0.000053751024,0.000018793186,0.00024854258,0.00009297859,0.000009041959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030333982,0.00006097833,0.00006543149,0.0001578675,0.0005513715,0.00015954804,0.00024718078,0.000023622242,0.00013018267],"category_scores_gemma":[0.000161636,0.000035481877,0.000016829164,0.00078275974,0.00022437485,0.00077633996,0.0002261274,0.00018565076,0.000016773849],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003424334,0.00023512538,0.87848437,0.00038821227,0.00001526768,4.849548e-7,0.0022278714,0.010533328,0.00045016347,0.1058628,0.0009339452,0.0008342017],"study_design_scores_gemma":[0.00081485696,0.000032231932,0.49537608,0.00021283307,0.000019977624,0.0000015001857,0.018228186,0.4793808,0.001061279,0.0018215723,0.0027918473,0.00025883727],"about_ca_topic_score_codex":0.00024947315,"about_ca_topic_score_gemma":0.0007322002,"teacher_disagreement_score":0.46884745,"about_ca_system_score_codex":0.00007676203,"about_ca_system_score_gemma":0.000027732374,"threshold_uncertainty_score":0.42407593},"labels":[],"label_agreement":null},{"id":"W2135524714","doi":"10.1287/opre.49.4.531.11226","title":"Simultaneous Assignment of Locomotives and Cars to Passenger Trains","year":2001,"lang":"en","type":"article","venue":"Operations Research","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Integer programming; Train; Computer science; Context (archaeology); Flow network; Branch and cut; Simplex algorithm; Node (physics); Integer (computer science); Decomposition; Multi-commodity flow problem; Linear programming relaxation; Linear programming; Branch and bound; Tree (set theory); Mathematics; Engineering","score_opus":0.03675200780820406,"score_gpt":0.3223997203708126,"score_spread":0.28564771256260857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135524714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816789,0.00020138512,0.0056020734,0.0002171262,0.000050313873,0.00021284117,0.0000069602224,0.000030463954,0.011999905],"genre_scores_gemma":[0.99709654,0.00010452546,0.0005627855,0.0000045030156,0.000040897976,0.00004205294,0.0000021553308,0.000012317976,0.0021342316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925506,0.000049875613,0.00013407986,0.00011331071,0.00023954145,0.0002081107],"domain_scores_gemma":[0.99955374,0.00009446298,0.0000020386976,0.0001490857,0.00010648945,0.000094169394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028832143,0.000058379963,0.00008988585,0.00014937001,0.00011534669,0.000046381294,0.000081391525,0.000034528537,0.00007092604],"category_scores_gemma":[0.000081259,0.000051619656,0.0000133980875,0.00032755733,0.00004334175,0.000050134895,0.000023404022,0.00009514306,0.000023120165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015967265,0.000028174234,0.00009936199,0.000010972236,0.00000999334,0.0000099658755,0.001444109,0.9338789,0.054084234,0.0006938491,0.00027185533,0.009467011],"study_design_scores_gemma":[0.0003053401,0.00029465003,0.0021101062,0.0000645204,0.0000037496663,0.000023700022,0.0026418413,0.9260732,0.013083765,0.000016074147,0.055171944,0.00021108681],"about_ca_topic_score_codex":0.00020793772,"about_ca_topic_score_gemma":0.00043633423,"teacher_disagreement_score":0.054900087,"about_ca_system_score_codex":0.000044489723,"about_ca_system_score_gemma":0.000021392922,"threshold_uncertainty_score":0.21049885},"labels":[],"label_agreement":null},{"id":"W2135990523","doi":"10.1287/opre.1120.1117","title":"Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Convex hull; Valuation (finance); Mathematical optimization; Context (archaeology); Regular polygon; Fixed cost; Operations research; Microeconomics; Economics; Mathematics","score_opus":0.04367738569817148,"score_gpt":0.3439887711782291,"score_spread":0.30031138548005765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135990523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.714996,0.000084948995,0.2596116,0.0053977324,0.00022554708,0.0051707104,0.00029753224,0.0003130032,0.013902944],"genre_scores_gemma":[0.99469984,0.0000012871989,0.0021936607,0.000784171,0.0003747043,0.0006732582,0.00062336866,0.000050929535,0.0005988001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781865,0.0002026126,0.00039252834,0.00036379645,0.00060828845,0.00061411865],"domain_scores_gemma":[0.9965282,0.00089148694,0.0001273333,0.0004872704,0.0019047726,0.000060954524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023354464,0.00021499436,0.00033133413,0.0010586773,0.0009677975,0.00022242834,0.00022189139,0.000100586374,0.0002491446],"category_scores_gemma":[0.0014079798,0.00019492653,0.00011268672,0.0016030311,0.00035135745,0.00095007336,0.0000397297,0.00028588512,0.00029599993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009455955,0.00062326016,0.00465624,0.00017829434,0.00015100931,0.0000027391463,0.00015146965,0.95792854,0.0089520635,0.02394863,0.0004472338,0.0020149092],"study_design_scores_gemma":[0.0021130415,0.00020040266,0.00067773974,0.00012125836,0.00014945703,0.0000016312457,0.0008875327,0.9891972,0.0027127576,0.000069202506,0.003526107,0.00034367637],"about_ca_topic_score_codex":0.001211513,"about_ca_topic_score_gemma":0.00040098437,"teacher_disagreement_score":0.27970386,"about_ca_system_score_codex":0.0004777696,"about_ca_system_score_gemma":0.00034647284,"threshold_uncertainty_score":0.7948873},"labels":[],"label_agreement":null},{"id":"W2136602649","doi":"10.1287/opre.2014.1325","title":"Technical Note—Joint Inventory and Pricing Control with General Additive Demand","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Inventory control; Revenue; Mathematical optimization; Profit (economics); Regular polygon; Inventory theory; Economics; Dynamic pricing; Generalization; Computer science; Mathematical economics; Mathematics; Microeconomics; Operations management","score_opus":0.038806703334556,"score_gpt":0.29549633004332604,"score_spread":0.25668962670877005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136602649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47415233,0.00026794255,0.15872869,0.017461987,0.00042012733,0.0042259926,0.000013931976,0.00043945407,0.34428954],"genre_scores_gemma":[0.9941229,0.000013535191,0.0011451232,0.0013943989,0.0009325699,0.0002020829,0.000032701628,0.000023930228,0.002132764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985638,0.00008187,0.00018681718,0.00032856833,0.00048118577,0.0003577094],"domain_scores_gemma":[0.99932086,0.000053953256,0.000023096663,0.0002519756,0.00031774642,0.00003233596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015341999,0.00012411385,0.00015445898,0.00040461723,0.0006374171,0.0005653287,0.000158934,0.000052510186,0.0003317105],"category_scores_gemma":[0.00027352778,0.00009737153,0.000026750755,0.00040751943,0.00022667437,0.00064174295,0.00019833558,0.00026619184,0.00017644347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027161834,0.00060809974,0.011598496,0.00036575078,0.000111635825,0.000051285188,0.0004395228,0.011915839,0.019094318,0.8204578,0.09506669,0.040018912],"study_design_scores_gemma":[0.0024181225,0.00016000148,0.010519459,0.00011287361,0.000043827033,0.000005632057,0.00042534192,0.6851358,0.00033698732,0.0009589735,0.29949483,0.0003881675],"about_ca_topic_score_codex":0.0005100997,"about_ca_topic_score_gemma":0.00078252127,"teacher_disagreement_score":0.81949884,"about_ca_system_score_codex":0.00006478285,"about_ca_system_score_gemma":0.000033014632,"threshold_uncertainty_score":0.5451477},"labels":[],"label_agreement":null},{"id":"W2138340154","doi":"10.1287/opre.1070.0433","title":"Optimal Dynamic Trading Strategies with Risk Limits","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Limit (mathematics); Portfolio; Risk measure; Value at risk; Econometrics; Coherent risk measure; Spectral risk measure; Economics; Actuarial science; Control (management); Measure (data warehouse); Expected shortfall; Risk management; Computer science; Mathematics; Financial economics; Finance","score_opus":0.16309333884309335,"score_gpt":0.4942684075279156,"score_spread":0.33117506868482227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138340154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6990068,0.00009167147,0.26735666,0.00033487132,0.00006410369,0.0002602606,0.0000107489,0.00003059885,0.032844305],"genre_scores_gemma":[0.96403927,0.00029216876,0.02855705,0.000011545058,0.00006852613,0.000017692379,0.000015897054,0.00001444418,0.0069834306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963179,0.0003674367,0.00042820282,0.00042899078,0.0019807566,0.00047666312],"domain_scores_gemma":[0.9971632,0.0009333253,0.00003759157,0.00052764104,0.0011693429,0.00016890278],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00935646,0.00010592399,0.00014318858,0.00081070967,0.0011902833,0.0015502373,0.0005235187,0.000080682206,0.000481063],"category_scores_gemma":[0.0011233367,0.00007079919,0.00003934889,0.0024608981,0.0002296858,0.0010482521,0.00004509464,0.00043792895,0.00036354252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014133436,0.00013147478,0.0078653395,0.0000014125214,0.000024364987,0.00004734679,0.0031130542,0.89349824,0.0013978542,0.012626247,0.0025010395,0.07865228],"study_design_scores_gemma":[0.00057289307,0.0005226155,0.037774097,0.000016311984,0.000009942982,0.00003890069,0.018760648,0.92708683,0.0013889958,0.0017435947,0.011804391,0.00028077414],"about_ca_topic_score_codex":0.00027162844,"about_ca_topic_score_gemma":0.0038646404,"teacher_disagreement_score":0.26503247,"about_ca_system_score_codex":0.00006903643,"about_ca_system_score_gemma":0.00040796754,"threshold_uncertainty_score":0.99948627},"labels":[],"label_agreement":null},{"id":"W2139030509","doi":"10.1287/opre.1040.0117","title":"Valuation and Optimal Operation of Electric Power Plants in Competitive Markets","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Hydroelectricity; Valuation (finance); Electricity; Spot contract; Computer science; Nonlinear system; Thermal power station; Mathematical optimization; Electricity market; Mean reversion; Economics; Econometrics; Mathematics; Futures contract; Engineering; Electrical engineering","score_opus":0.02460379229547448,"score_gpt":0.3068818606813805,"score_spread":0.282278068385906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139030509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95113206,0.00043426003,0.041546695,0.00013386238,0.00005185496,0.0008055666,0.0000066437296,0.000040492814,0.0058485614],"genre_scores_gemma":[0.9968567,0.000201733,0.0027028555,0.0000041907224,0.000012514632,0.00010672923,0.0000341067,0.000016345855,0.0000648415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988659,0.00015710163,0.00025583347,0.00015357917,0.00033858625,0.00022900058],"domain_scores_gemma":[0.9995172,0.00007372104,0.00000765576,0.00012759914,0.0002304853,0.000043315846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007661891,0.00007992302,0.000118583004,0.00053778576,0.0000899251,0.00007726041,0.00008149529,0.00007262673,0.00006400755],"category_scores_gemma":[0.00011475449,0.00008479414,0.000010931037,0.0006036855,0.000027721446,0.0003512283,0.000019567531,0.00020295255,0.00003126149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001085455,0.00004783509,0.00021928473,0.000019437397,0.000011705436,0.0000021412561,0.00095666386,0.9515928,0.042155895,0.004268126,0.000047137466,0.00066813116],"study_design_scores_gemma":[0.0010200079,0.00016528784,0.01884213,0.00008649326,0.0000026525574,0.000015736214,0.0003647411,0.94474006,0.0344013,0.00017569996,0.000032252516,0.00015364993],"about_ca_topic_score_codex":0.000156399,"about_ca_topic_score_gemma":0.00015965437,"teacher_disagreement_score":0.045724623,"about_ca_system_score_codex":0.00024076669,"about_ca_system_score_gemma":0.00012189847,"threshold_uncertainty_score":0.34578046},"labels":[],"label_agreement":null},{"id":"W2139369605","doi":"10.1287/opre.1070.0474","title":"Visualizing and Constructing Cycles in the Simplex Method","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Simplex; Simplex algorithm; Simple (philosophy); Dual (grammatical number); Cycling; Revised simplex method; Computer science; Mathematics; Algorithm; Combinatorics; Mathematical optimization; Linear programming; Geography; Philosophy; Archaeology","score_opus":0.24975057357634586,"score_gpt":0.4890805239239869,"score_spread":0.239329950347641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139369605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21156935,0.00017010856,0.7814553,0.0029117395,0.00005448261,0.00029812285,0.0000013892364,0.00004597341,0.003493539],"genre_scores_gemma":[0.41892993,0.00001964346,0.58083606,0.000073908835,0.000033551154,0.000025625654,0.0000010814928,0.0000032435896,0.00007698131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980946,0.0008287363,0.00014540409,0.00024010308,0.00041288364,0.00027824743],"domain_scores_gemma":[0.99866253,0.0008662396,0.0000074285563,0.0003149416,0.00010754514,0.000041325384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027056101,0.000054768567,0.00007818478,0.00020231633,0.00076574367,0.00028150057,0.0005253167,0.000031076965,0.0000042888687],"category_scores_gemma":[0.00049627776,0.000040154948,0.00001085319,0.0007775962,0.00014125531,0.00032230007,0.00020454844,0.00031890764,0.000016078731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055163373,0.00032722112,0.04390989,0.000040117025,0.000030306705,0.0011119089,0.12135304,0.06615794,0.009792509,0.48370638,0.00242063,0.27114454],"study_design_scores_gemma":[0.00017795256,0.000037400692,0.011075601,0.000016672668,5.493954e-7,0.0006736276,0.002082919,0.98426414,0.0004799,0.0005485663,0.0005562489,0.000086400316],"about_ca_topic_score_codex":0.0003645229,"about_ca_topic_score_gemma":0.000022234819,"teacher_disagreement_score":0.9181062,"about_ca_system_score_codex":0.000024011772,"about_ca_system_score_gemma":0.00012863813,"threshold_uncertainty_score":0.5889559},"labels":[],"label_agreement":null},{"id":"W2139555052","doi":"10.1287/opre.2014.1332","title":"Myopic Bounds for Optimal Policy of POMDPs: An Extension of Lovejoy’s Structural Results","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Extension (predicate logic); Bounded function; Markov decision process; Mathematical optimization; Computer science; Relaxation (psychology); Upper and lower bounds; Mathematical economics; Mathematics; Markov process","score_opus":0.22538392064775611,"score_gpt":0.47345286381946544,"score_spread":0.24806894317170933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139555052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35155785,0.000045869347,0.6426114,0.0019603523,0.00019427043,0.00077761454,0.000021515898,0.000056300294,0.0027748474],"genre_scores_gemma":[0.8164722,0.0000056317026,0.1817744,0.000016289281,0.00009303717,0.000013030871,0.000027968128,0.00000797837,0.0015895204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803525,0.00020155763,0.0003895742,0.0002817723,0.000770644,0.00032119613],"domain_scores_gemma":[0.9969363,0.00014591678,0.000047913716,0.00084684795,0.0018756775,0.00014731154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015850494,0.00008202928,0.00015006775,0.00040140335,0.00020188751,0.00018801016,0.0008478619,0.000065078144,0.0000044512167],"category_scores_gemma":[0.0015480008,0.00007193426,0.000037802183,0.00073332636,0.00014361851,0.00068477285,0.000313355,0.00017022263,0.000009357213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048999478,0.000037606707,0.00006086512,0.000018864104,0.000011383851,8.352151e-7,0.0030300743,0.9080865,0.0045536864,0.08211383,0.000715836,0.0013215297],"study_design_scores_gemma":[0.00077128527,0.0011727145,0.00088449137,0.000016975971,0.0000019608628,0.0000037888638,0.00023100305,0.99052596,0.005063875,0.00032107084,0.000931294,0.00007560825],"about_ca_topic_score_codex":0.00048948854,"about_ca_topic_score_gemma":0.00003302232,"teacher_disagreement_score":0.4649143,"about_ca_system_score_codex":0.000111585374,"about_ca_system_score_gemma":0.0010154218,"threshold_uncertainty_score":0.29333937},"labels":[],"label_agreement":null},{"id":"W2139853536","doi":"10.1287/opre.2013.1181","title":"Optimal Production Management When Demand Depends on the Business Cycle","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Production (economics); Markov chain; Economics; Geometric Brownian motion; Variance (accounting); Brownian motion; Mathematical optimization; Value (mathematics); Markov process; Econometrics; Microeconomics; Mathematical economics; Mathematics; Economy; Statistics","score_opus":0.06901013362510179,"score_gpt":0.29240190252032056,"score_spread":0.22339176889521878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139853536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2872104,0.00050782395,0.5323168,0.06523883,0.00032226724,0.0028932996,0.000051034014,0.000067105866,0.111392416],"genre_scores_gemma":[0.9860149,0.000095753174,0.004523027,0.00013460324,0.00019019221,0.0020009628,0.000016631535,0.00001550991,0.0070084073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907947,0.000011055354,0.00023529703,0.00032890137,0.00009020102,0.00025506355],"domain_scores_gemma":[0.99922156,0.000043681954,0.000022642103,0.00042101924,0.00024753864,0.00004355669],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065814366,0.00007441927,0.000095582465,0.00018766052,0.00082053704,0.00028846037,0.0002957702,0.000040632654,0.000746967],"category_scores_gemma":[0.00021355117,0.000061174076,0.000023738732,0.00065634935,0.0000875329,0.00021299037,0.00009616911,0.00017871558,0.0048443675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032326302,0.00009835035,0.00006323893,0.000009479032,0.000012431512,3.1660738e-7,0.00018684805,0.0048489906,0.00003692777,0.98815155,0.00415078,0.0024378812],"study_design_scores_gemma":[0.0006834257,0.00018931397,0.08318345,0.000068753034,0.00001038576,0.000010839949,0.0012333913,0.07929144,0.000689214,0.74022114,0.09377517,0.0006434547],"about_ca_topic_score_codex":0.0006258021,"about_ca_topic_score_gemma":0.000057363966,"teacher_disagreement_score":0.6988045,"about_ca_system_score_codex":0.00006491103,"about_ca_system_score_gemma":0.000021626702,"threshold_uncertainty_score":0.9959305},"labels":[],"label_agreement":null},{"id":"W2140067350","doi":"10.1287/opre.50.6.1058.350","title":"On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Holding cost; Sizing; Piecewise linear function; Mathematical optimization; Zero (linguistics); Class (philosophy); Order (exchange); Average cost; Function (biology); Inventory cost; Piecewise; Economic order quantity; Total cost; Set (abstract data type); Unit cost; Computer science; Unit (ring theory); Mathematics; Economics; Microeconomics; Business","score_opus":0.10360743428626412,"score_gpt":0.32425443746031396,"score_spread":0.22064700317404984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140067350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95542145,0.00021054654,0.0154740885,0.0034451897,0.00017784022,0.0043410338,0.00002954448,0.000039016944,0.02086131],"genre_scores_gemma":[0.9985367,0.000026805614,0.000110909146,0.00017312139,0.0001463753,0.00039906043,0.000008331285,0.000024154508,0.00057455304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989613,0.00008258662,0.00020073054,0.00019287605,0.0003036043,0.0002588952],"domain_scores_gemma":[0.99869144,0.00059061724,0.000046581346,0.00040315939,0.000258192,0.000010038931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015943131,0.00011582219,0.00015012616,0.00024627434,0.0005867231,0.00019339779,0.00041334497,0.000034153676,0.00016411254],"category_scores_gemma":[0.00023720413,0.000066083,0.00006174787,0.0002859121,0.00024553455,0.0002883527,0.00015648686,0.00016638449,0.000020739339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009605544,0.000045186633,0.0002227835,0.00017218845,0.0000592711,1.8263798e-7,0.00017045785,0.60289085,0.00063263444,0.39348745,0.001752632,0.00047032288],"study_design_scores_gemma":[0.00048689017,0.000050455703,0.0002907825,0.000078486824,0.000020466021,1.6499584e-7,0.00072597346,0.9909459,0.0010685109,0.0018430334,0.0044058035,0.00008353494],"about_ca_topic_score_codex":0.0009615633,"about_ca_topic_score_gemma":0.00041608338,"teacher_disagreement_score":0.39164442,"about_ca_system_score_codex":0.000086349144,"about_ca_system_score_gemma":0.00003630636,"threshold_uncertainty_score":0.45126593},"labels":[],"label_agreement":null},{"id":"W2140122547","doi":"10.1287/opre.1070.0442","title":"Regulated Random Walks and the LCFS Backlog Probability: Analysis and Application","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Probability distribution; Queue; Constraint (computer-aided design); Upper and lower bounds; Mathematics; Computer science; Queueing theory; Mathematical optimization; Statistics","score_opus":0.0334362468084673,"score_gpt":0.3083572831801008,"score_spread":0.2749210363716335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140122547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96515346,0.00020289655,0.024621725,0.0051667537,0.000011054047,0.0008936026,0.0000018156627,0.00006145584,0.0038872657],"genre_scores_gemma":[0.997477,0.000097684264,0.000594234,0.00014992121,0.00012280035,0.00020166431,0.000044498534,0.000009843099,0.0013023481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877965,0.00017217472,0.00021408302,0.00033076436,0.00030555422,0.00019779004],"domain_scores_gemma":[0.9987478,0.00029473292,0.000029580928,0.00043537456,0.00047739004,0.000015075092],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025911608,0.000090685826,0.00021241787,0.00045328555,0.0015468755,0.000285093,0.00016292749,0.000046822955,0.00010928874],"category_scores_gemma":[0.0005433545,0.000060946197,0.00005777985,0.0025385756,0.0008190963,0.00056449405,0.00018826962,0.00020060052,0.000050449267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014318052,0.00028727693,0.024139276,0.00013945415,0.0014924891,0.00001007241,0.0015358472,0.10951836,0.005295843,0.83397955,0.00087119604,0.021298816],"study_design_scores_gemma":[0.002443762,0.000006987303,0.009183318,0.000007671569,0.00039710582,0.000004823477,0.0003934094,0.94757104,0.000109377856,0.03492187,0.0047768103,0.00018385162],"about_ca_topic_score_codex":0.0012573894,"about_ca_topic_score_gemma":0.0013729184,"teacher_disagreement_score":0.83805263,"about_ca_system_score_codex":0.000023236285,"about_ca_system_score_gemma":0.000018980578,"threshold_uncertainty_score":0.999753},"labels":[],"label_agreement":null},{"id":"W2140541505","doi":"10.1287/opre.2013.1247","title":"Integral Simplex Using Decomposition for the Set Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex; Sequence (biology); Simplex algorithm; Mathematics; Polytope; Constructive; Mathematical optimization; Degeneracy (biology); Integer (computer science); Set (abstract data type); Revised simplex method; Decomposition; Combinatorics; Variable (mathematics); Integer programming; Algorithm; Linear programming; Computer science","score_opus":0.1774074885190413,"score_gpt":0.48514672057562436,"score_spread":0.30773923205658305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140541505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952855,0.000039474802,0.9793046,0.003083239,0.000058431793,0.0008326585,0.000007543814,0.000056357876,0.000664822],"genre_scores_gemma":[0.7985736,0.00000803339,0.20034,0.00008663607,0.00012928943,0.00043765618,0.000018730969,0.00001335324,0.00039266775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978183,0.00059291173,0.0001948637,0.000341654,0.00051858946,0.0005336669],"domain_scores_gemma":[0.99729764,0.0012056929,0.000013964691,0.00062868267,0.0007608254,0.000093164505],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035855272,0.00008720291,0.00009005941,0.00023099477,0.0024289116,0.00082854036,0.00096226373,0.000042885473,0.00003449214],"category_scores_gemma":[0.00046498628,0.00006283876,0.000055033357,0.00092341675,0.0002128589,0.00073621864,0.00031497903,0.00035293083,0.0000475685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140920065,0.000035379544,0.000048854254,0.000011678301,0.000013835726,5.867406e-7,0.00057583814,0.081443466,0.010325071,0.88159317,0.0006605775,0.025277443],"study_design_scores_gemma":[0.00019817943,0.00011369599,0.000062827574,0.000017562143,0.0000018456941,0.000008237743,0.00013395766,0.934813,0.0039538355,0.052474022,0.008140924,0.00008186143],"about_ca_topic_score_codex":0.0001131461,"about_ca_topic_score_gemma":0.00022996741,"teacher_disagreement_score":0.8533696,"about_ca_system_score_codex":0.00010327307,"about_ca_system_score_gemma":0.00015375896,"threshold_uncertainty_score":0.9988698},"labels":[],"label_agreement":null},{"id":"W2141532588","doi":"10.1287/opre.1070.0487","title":"The DEA Game Cross-Efficiency Model and Its Nash Equilibrium","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":371,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Data envelopment analysis; Set (abstract data type); Mathematical optimization; Nash equilibrium; Computer science; Efficiency; Mathematical economics; Economics; Mathematics; Statistics","score_opus":0.34381382070265737,"score_gpt":0.5199786983413353,"score_spread":0.17616487763867789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141532588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812036,0.0011068572,0.004641618,0.0033019858,0.00007907453,0.00028674174,0.000011612739,0.000029965895,0.009338499],"genre_scores_gemma":[0.9449558,0.00015123081,0.00034916878,0.00006808033,0.00006160147,0.000038041075,0.0000021082485,0.000012068929,0.054361902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428016,0.0006974977,0.0006199134,0.00069066015,0.0030489068,0.0006628726],"domain_scores_gemma":[0.99392414,0.0022473892,0.000034464636,0.001047038,0.0025527868,0.00019419749],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010540062,0.00012639677,0.00018568052,0.0004887311,0.003953744,0.0019640864,0.0015187016,0.000086291344,0.00015449416],"category_scores_gemma":[0.01236374,0.000075927404,0.00008529382,0.0030252824,0.0012213209,0.000649488,0.0005813047,0.00045975522,0.0010587712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024172747,0.0001788066,0.001981329,0.0000021907028,0.000013645848,0.000015801583,0.0024711108,0.94182277,0.016319467,0.028907912,0.0060456246,0.0022171917],"study_design_scores_gemma":[0.00013660046,0.000045766934,0.0020057142,0.0000033954902,0.000002145566,0.000023845969,0.00018037953,0.99145424,0.0008590453,0.0016133472,0.0035747644,0.000100737896],"about_ca_topic_score_codex":0.000069698326,"about_ca_topic_score_gemma":0.0002624217,"teacher_disagreement_score":0.04963151,"about_ca_system_score_codex":0.00006431022,"about_ca_system_score_gemma":0.00068815565,"threshold_uncertainty_score":0.999719},"labels":[],"label_agreement":null},{"id":"W2142721553","doi":"10.1287/opre.2013.1236","title":"Using Strategic Idleness to Improve Customer Service Experience in Service Networks","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queue; Service (business); Queueing theory; Operations research; Computer network; Quality of service; Service quality; Mathematical optimization; Business; Mathematics; Marketing","score_opus":0.13658974880440025,"score_gpt":0.3996399555342409,"score_spread":0.2630502067298407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142721553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97255653,0.000015002585,0.016117763,0.0014295026,0.00012643174,0.00040073597,9.856607e-7,0.000055125158,0.009297925],"genre_scores_gemma":[0.9953852,0.000002039936,0.0011708302,0.0023130449,0.0006186882,0.00013514646,0.000016158316,0.000030920302,0.00032793076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981969,0.00012349267,0.0002773734,0.00045219366,0.0004096685,0.00054037746],"domain_scores_gemma":[0.9983222,0.000097962,0.000026931795,0.00051735976,0.001000738,0.000034810728],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016288842,0.00014732312,0.00018208455,0.00063371425,0.00060319353,0.00067209883,0.0005337526,0.00007611609,0.00031892073],"category_scores_gemma":[0.00021153994,0.00014453765,0.000027163122,0.0048673586,0.000042184525,0.0013941001,0.00038980268,0.00034125103,0.0008264642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002617211,0.00004938552,0.0003851848,0.000041013875,0.0000059197214,0.0000030227209,0.00025177916,0.94720036,0.010843152,0.04038464,0.000016559663,0.0007927968],"study_design_scores_gemma":[0.00019899783,0.0000045797246,0.0001528293,0.000049270777,0.000007346986,5.5493734e-7,0.0019496154,0.99363774,0.00016550123,0.0012012075,0.0024391995,0.00019317605],"about_ca_topic_score_codex":0.006845676,"about_ca_topic_score_gemma":0.014229038,"teacher_disagreement_score":0.046437345,"about_ca_system_score_codex":0.000101729056,"about_ca_system_score_gemma":0.00004968254,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W2142857718","doi":"10.1287/opre.50.6.1073.358","title":"An Object-Oriented Random-Number Package with Many Long Streams and Substreams","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":343,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Disjoint sets; Generator (circuit theory); Random number generation; Reduction (mathematics); Implementation; Variance reduction; Sequence (biology); Set (abstract data type); Java; Variance (accounting); Algorithm; Parallel computing; Mathematics; Discrete mathematics; Programming language; Statistics; Power (physics)","score_opus":0.03584947236627194,"score_gpt":0.33157427079349944,"score_spread":0.2957247984272275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142857718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5107361,0.0002087228,0.48328096,0.00056316436,0.00006446425,0.0004811745,0.000021866725,0.00011116239,0.004532382],"genre_scores_gemma":[0.96998465,0.00015843622,0.027261814,0.000030040297,0.00007494852,0.00006666726,0.000045198474,0.0000127724525,0.0023654664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980927,0.0002602666,0.00015212291,0.0004932821,0.00061704806,0.00038456384],"domain_scores_gemma":[0.9984814,0.000096662654,0.0000117441095,0.0008896836,0.00029772503,0.00022280913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047263765,0.00012029653,0.00012847256,0.00012757449,0.00081591035,0.0008115542,0.0005164207,0.000054598677,0.00039492175],"category_scores_gemma":[0.000037476468,0.00008583366,0.00001651913,0.00067128707,0.00014772928,0.0014057548,0.00024795526,0.00028572342,0.0001832335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024517885,0.0031539178,0.049949773,0.00007730133,0.0001617148,0.0009673906,0.012648701,0.0032546676,0.008355089,0.09514139,0.02073332,0.80531156],"study_design_scores_gemma":[0.0020092549,0.00034103138,0.0077370545,0.000046093206,0.0000040650057,0.00009574076,0.00024424994,0.9845737,0.0022162702,0.00007524116,0.0024146147,0.0002426771],"about_ca_topic_score_codex":0.0004465804,"about_ca_topic_score_gemma":0.00042190208,"teacher_disagreement_score":0.981319,"about_ca_system_score_codex":0.000031104886,"about_ca_system_score_gemma":0.000044823282,"threshold_uncertainty_score":0.7825836},"labels":[],"label_agreement":null},{"id":"W2143793200","doi":"10.1287/opre.1060.0308","title":"Dynamic Control of a Multiclass Queue with Thin Arrival Streams","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Queue; Mathematical optimization; Queueing theory; Context (archaeology); Operations research; Scheduling (production processes); Holding cost; Revenue management; Real-time computing; Admission control; Revenue; Control (management); Computer network; Mathematics; Economics; Finance","score_opus":0.016247495163008052,"score_gpt":0.3067362332167247,"score_spread":0.29048873805371667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143793200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9452855,0.000051269544,0.0414953,0.001350351,0.00002651289,0.0004460646,0.000011588948,0.000067437526,0.01126595],"genre_scores_gemma":[0.9957128,0.0000016643322,0.0016266404,0.00005296588,0.0001325193,0.000052854408,0.00004526265,0.000020380267,0.0023549136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987744,0.00006515313,0.00021616418,0.00022603288,0.00044675329,0.00027149727],"domain_scores_gemma":[0.9988228,0.00012209296,0.000036582038,0.0003275316,0.00068132085,0.0000096543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271466,0.00009757526,0.00016375263,0.00038484842,0.00036733082,0.00020451158,0.00023305467,0.000039123228,0.00023311765],"category_scores_gemma":[0.00022811227,0.0000766134,0.00004301786,0.00092249946,0.00020979658,0.00068340875,0.00006345006,0.00020647983,0.00013874081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014709246,0.0002698942,0.0028425076,0.000051339277,0.00006608475,0.00001624935,0.000044759912,0.7686521,0.020477368,0.2056967,0.00019660787,0.001539337],"study_design_scores_gemma":[0.0008430655,0.000022022949,0.0008875469,0.000033907538,0.000034452147,9.725292e-7,0.00038539732,0.99249804,0.00048267367,0.0033143796,0.0013748547,0.00012268648],"about_ca_topic_score_codex":0.0035973187,"about_ca_topic_score_gemma":0.0069749155,"teacher_disagreement_score":0.22384597,"about_ca_system_score_codex":0.00005218109,"about_ca_system_score_gemma":0.000049372975,"threshold_uncertainty_score":0.54380935},"labels":[],"label_agreement":null},{"id":"W2144743612","doi":"10.1287/opre.1080.0590","title":"Dynamic Multipriority Patient Scheduling for a Diagnostic Resource","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":380,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Ottawa","funders":"","keywords":"Computer science; Markov decision process; Mathematical optimization; Scheduling (production processes); Dynamic programming; Schedule; Revenue; Bellman equation; Linear programming; Markov process; Operations research; Dynamic priority scheduling; Job shop scheduling; Algorithm; Mathematics; Economics","score_opus":0.22311306431844552,"score_gpt":0.5254930924542827,"score_spread":0.30238002813583714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144743612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9085031,0.00034593977,0.07638831,0.0072575263,0.0003337962,0.004707858,0.000107308966,0.0001363531,0.002219766],"genre_scores_gemma":[0.88267213,0.00031748242,0.10931726,0.00042935737,0.00019016751,0.0026977754,0.00031527874,0.000046010387,0.004014542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622595,0.0013012104,0.00066928944,0.00044959356,0.00053628965,0.00081768376],"domain_scores_gemma":[0.9940341,0.003107421,0.000035867666,0.0005169703,0.0020414048,0.0002642049],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0021375671,0.00014189446,0.00021798466,0.00032766303,0.009369535,0.000048292237,0.00020615467,0.0002512608,0.0002768415],"category_scores_gemma":[0.009856831,0.00013169773,0.0000630106,0.00072463404,0.00014910208,0.0002362403,0.00012057563,0.0010589423,0.00039777253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034061327,0.0012960894,0.024004104,0.0007190722,0.00010010854,0.000054933433,0.065709144,0.83617836,0.004665329,0.023428641,0.019511499,0.023992125],"study_design_scores_gemma":[0.0012289275,0.0003456004,0.0035821013,0.00021309739,0.000007442532,0.000008242182,0.0060617845,0.9341978,0.00008240515,0.00008242048,0.05392305,0.00026717182],"about_ca_topic_score_codex":0.000818014,"about_ca_topic_score_gemma":0.0016695496,"teacher_disagreement_score":0.09801941,"about_ca_system_score_codex":0.00046138003,"about_ca_system_score_gemma":0.0016704435,"threshold_uncertainty_score":0.99848354},"labels":[],"label_agreement":null},{"id":"W2144979199","doi":"10.1287/opre.1110.0976","title":"“We Will Be Right with You”: Managing Customer Expectations with Vague Promises and Cheap Talk","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":179,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Vagueness; Computer science; Service (business); Queueing theory; Robustness (evolution); Business; Service provider; Marketing","score_opus":0.051135704477000145,"score_gpt":0.30671042580661917,"score_spread":0.255574721329619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144979199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7990845,0.00031418988,0.010855661,0.007292489,0.00004996492,0.001596206,0.000009098065,0.000299713,0.18049821],"genre_scores_gemma":[0.98778546,0.000025510437,0.004694038,0.00011809815,0.000163021,0.00027324958,0.00003180597,0.000039626317,0.0068692015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864405,0.00004949959,0.00015959561,0.0003868624,0.00040626497,0.00035374967],"domain_scores_gemma":[0.99902165,0.00005260773,0.00003258904,0.0003593015,0.00050290354,0.000030929667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041028764,0.00015248306,0.00015371636,0.00062152976,0.0011250466,0.0004087973,0.00021236847,0.00003652468,0.0008752739],"category_scores_gemma":[0.00008588751,0.00010853172,0.00002240244,0.0013132116,0.00033001642,0.002352337,0.000130044,0.00024887527,0.00011625019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009664192,0.0011570677,0.010110285,0.00054186786,0.00082117325,0.0004206595,0.015862748,0.017633313,0.0042257374,0.9365307,0.0023573048,0.009372691],"study_design_scores_gemma":[0.01388098,0.0011655391,0.009926322,0.0022837773,0.002049001,0.00026821333,0.21361616,0.34240973,0.016656185,0.07063027,0.32001212,0.007101691],"about_ca_topic_score_codex":0.00066050596,"about_ca_topic_score_gemma":0.0022481,"teacher_disagreement_score":0.86590046,"about_ca_system_score_codex":0.000035150737,"about_ca_system_score_gemma":0.000043280863,"threshold_uncertainty_score":0.95836353},"labels":[],"label_agreement":null},{"id":"W2145105091","doi":"10.1287/opre.2014.1285","title":"Quantity Premiums and Discounts in Dynamic Pricing","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Monopolistic competition; Dynamic pricing; Revenue management; Order (exchange); Product (mathematics); Monotonic function; Microeconomics; Revenue; Holding cost; Economics; Inventory control; Econometrics; Mathematics; Operations management; Monopoly; Finance","score_opus":0.05234862024705213,"score_gpt":0.34137049077913,"score_spread":0.2890218705320779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145105091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93404186,0.000048172315,0.0010337444,0.0019710166,0.0001161559,0.0004148299,6.0313727e-7,0.000024294422,0.06234932],"genre_scores_gemma":[0.9962134,0.00002413269,0.00015023898,0.0002864467,0.00016649385,0.000057303507,0.000017955625,0.000011272048,0.0030727868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989583,0.000046421093,0.00015469866,0.00024246273,0.0003217507,0.0002763971],"domain_scores_gemma":[0.99961525,0.00004000866,0.000010662377,0.000214762,0.000107795124,0.000011509011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016377568,0.000074698066,0.000090606525,0.00047319903,0.00033328525,0.00058350764,0.00016886693,0.000031091076,0.0002686235],"category_scores_gemma":[0.00028153532,0.00006741033,0.000014102929,0.0005542831,0.00008213803,0.00086339656,0.00025842714,0.0001800809,0.0003115374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047551897,0.0005132933,0.21932156,0.000613423,0.000030114594,0.000013412584,0.00068260264,0.008550556,0.0046760575,0.7227525,0.011033504,0.031765435],"study_design_scores_gemma":[0.0005651639,0.000018601258,0.1013515,0.00007531966,0.0000048634834,4.647472e-7,0.00083129026,0.83599603,0.000025973784,0.0017647085,0.05918031,0.00018575291],"about_ca_topic_score_codex":0.002629318,"about_ca_topic_score_gemma":0.008591958,"teacher_disagreement_score":0.8274455,"about_ca_system_score_codex":0.00005675534,"about_ca_system_score_gemma":0.000013706337,"threshold_uncertainty_score":0.56267774},"labels":[],"label_agreement":null},{"id":"W2147965468","doi":"10.1287/opre.1040.0144","title":"Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hoist (device); Integer programming; Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Engineering; Algorithm; Mathematics; Operating system; Structural engineering","score_opus":0.0718429271301883,"score_gpt":0.34431680421789984,"score_spread":0.27247387708771154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147965468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09134617,0.00031392986,0.9053591,0.00023950747,0.00018478055,0.00049542735,0.0000058022065,0.00045863388,0.0015966701],"genre_scores_gemma":[0.41660777,0.000030483254,0.582482,0.00000849899,0.0001079914,0.00022178123,0.00006376131,0.000040745108,0.0004370227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839014,0.00007677267,0.00026899728,0.00030720266,0.00043290356,0.00052399724],"domain_scores_gemma":[0.9990844,0.00003685396,0.000006376176,0.00034487632,0.00034116334,0.00018628995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068551133,0.00016038655,0.00015119568,0.0003509178,0.0005093106,0.00045771376,0.00028626472,0.00013476594,0.00005110572],"category_scores_gemma":[0.00026687855,0.00015676758,0.000058492074,0.0010042394,0.00013312443,0.00024712074,0.00006760781,0.0006921621,0.00027692795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030192396,0.00015206501,0.000020956717,0.00002105108,0.000025790736,0.000004271851,0.0007399783,0.99473053,0.0007217336,0.0011144363,0.000026733054,0.0024394407],"study_design_scores_gemma":[0.0007144619,0.00003373907,0.00004374226,0.000027597776,0.000004613366,0.000013505912,0.0013018483,0.9943292,0.0026288116,0.000006016457,0.0007054885,0.00019094501],"about_ca_topic_score_codex":0.000098438395,"about_ca_topic_score_gemma":0.00006574922,"teacher_disagreement_score":0.3252616,"about_ca_system_score_codex":0.00020264338,"about_ca_system_score_gemma":0.00013630309,"threshold_uncertainty_score":0.63927966},"labels":[],"label_agreement":null},{"id":"W2151937206","doi":"10.1287/opre.51.1.17.12801","title":"Strategic Operations Research and the Edelman Prize Finalist Applications 1989–1998","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Quality and Supply Management","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competition (biology); Competitive advantage; Industrial organization; Strategic information system; Computer science; Marketing; Operations research; Operations management; Business; Economics; Engineering; Information system; Management information systems","score_opus":0.2161297071108789,"score_gpt":0.40684241542285876,"score_spread":0.19071270831197987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151937206","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18921705,0.0011814383,0.009159797,0.07546405,0.00025295274,0.009449142,0.000038967723,0.00022631833,0.7150103],"genre_scores_gemma":[0.974097,0.0001785399,0.0006987947,0.0006466508,0.0005493702,0.0024945305,0.00012617621,0.000029431332,0.021179495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99681807,0.00052670256,0.00040457546,0.0005208259,0.0010769162,0.0006529151],"domain_scores_gemma":[0.99776477,0.00035923376,0.00001519935,0.00080906315,0.0010089208,0.000042834563],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008850599,0.00016198333,0.00018621371,0.0005959711,0.0052369335,0.0035317785,0.0005941219,0.00008409445,0.0006131953],"category_scores_gemma":[0.00049233204,0.00011961808,0.000052319974,0.0021809752,0.001188578,0.0009251686,0.00038556283,0.000776556,0.0016054179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002077304,0.00020185548,0.00007939939,0.000062584346,0.000023248975,0.0000025203833,0.0001677228,0.0018054552,0.00015108033,0.9929514,0.0041906056,0.00034336594],"study_design_scores_gemma":[0.0019159532,0.00004783727,0.00040488906,0.000036926704,0.000030172452,0.0000058268333,0.009402999,0.065880254,0.000050720195,0.09664145,0.8252332,0.0003497591],"about_ca_topic_score_codex":0.00441761,"about_ca_topic_score_gemma":0.009857001,"teacher_disagreement_score":0.8963099,"about_ca_system_score_codex":0.0000703778,"about_ca_system_score_gemma":0.00018351966,"threshold_uncertainty_score":0.999172},"labels":[],"label_agreement":null},{"id":"W2152939240","doi":"10.1287/opre.1060.0274","title":"A New Decomposition Method for Multiregional Economic Equilibrium Models","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decomposition; Mathematical optimization; Convergence (economics); Heuristic; Linear programming; Mathematical economics; Decomposition method (queueing theory); Computer science; Applied mathematics; Mathematics; Economics","score_opus":0.11767786919244236,"score_gpt":0.48055121186255945,"score_spread":0.36287334267011706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152939240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008817,0.000041098552,0.9705002,0.0048913048,0.000102450846,0.00051923445,0.000042073003,0.000060836534,0.015025802],"genre_scores_gemma":[0.4162608,0.000016601103,0.5585887,0.000040629573,0.00065917405,0.00015554109,0.00059469586,0.000015235999,0.023668626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989744,0.00019398861,0.00015834402,0.00018642744,0.00024538708,0.00024145722],"domain_scores_gemma":[0.99934316,0.0002406574,0.000011103969,0.00008597375,0.00023846207,0.00008063378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020171,0.000048301044,0.00006441541,0.00015207817,0.0008697709,0.00022576748,0.00012102422,0.000069667774,0.00017959485],"category_scores_gemma":[0.000032976706,0.00005301214,0.000039508282,0.00017282313,0.00005551364,0.00045547946,0.000005892847,0.00007930481,0.000039921797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014150379,0.000016914655,0.000054772714,0.0000016559349,0.0000030591225,1.9836078e-7,0.0009914443,0.70799917,0.00037177477,0.27909768,0.010347941,0.0011012573],"study_design_scores_gemma":[0.00042084893,0.000029141733,0.0003616897,0.00000831218,0.000004973977,4.293282e-7,0.00046733653,0.967012,0.0003295285,0.010503711,0.02076734,0.000094693794],"about_ca_topic_score_codex":0.023069339,"about_ca_topic_score_gemma":0.020504428,"teacher_disagreement_score":0.41191152,"about_ca_system_score_codex":0.00013704914,"about_ca_system_score_gemma":0.0006997845,"threshold_uncertainty_score":0.9973688},"labels":[],"label_agreement":null},{"id":"W2153152397","doi":"10.1287/opre.1110.0952","title":"Dynamic Pricing with Loss-Averse Consumers and Peak-End Anchoring","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Anchoring; Economics; Dynamic pricing; Microeconomics; Loss aversion; Prospect theory; Monotone polygon; Econometrics; Mathematics; Psychology","score_opus":0.07411331495649127,"score_gpt":0.31758464981729106,"score_spread":0.2434713348607998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153152397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9513644,0.000099864454,0.00044702308,0.00020648706,0.000071999886,0.00034969326,0.0000018635451,0.000062909894,0.047395736],"genre_scores_gemma":[0.9975843,0.000049327813,0.0009399897,0.000058434005,0.000059113878,0.000042442793,0.000012519894,0.000025425037,0.0012284908],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987904,0.000033204327,0.00015509748,0.00030822618,0.00033317218,0.00037989108],"domain_scores_gemma":[0.9993084,0.00005548632,0.000018778812,0.00025682084,0.0003322103,0.000028320152],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008129045,0.00012313644,0.0001206858,0.00046869818,0.00080810435,0.0004668943,0.00016463711,0.000041972915,0.0010996634],"category_scores_gemma":[0.00009456357,0.00010556366,0.000019637,0.00069836655,0.00024288583,0.0010558857,0.00020662599,0.00030844437,0.00014854602],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026246236,0.00025642384,0.8723683,0.0003087027,0.00010518349,0.00024728835,0.0022818283,0.00014908017,0.0066098,0.013240819,0.00042619562,0.10374394],"study_design_scores_gemma":[0.0022395959,0.00009152961,0.9106019,0.00032070556,0.00017789452,0.000053661322,0.006584357,0.05566445,0.00042585636,0.0002898321,0.022573203,0.0009770168],"about_ca_topic_score_codex":0.0059897634,"about_ca_topic_score_gemma":0.005719961,"teacher_disagreement_score":0.10276692,"about_ca_system_score_codex":0.00003486896,"about_ca_system_score_gemma":0.000059097743,"threshold_uncertainty_score":0.99981344},"labels":[],"label_agreement":null},{"id":"W2154326504","doi":"10.1287/opre.1120.1041","title":"Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Polyhedron; Heuristics; Fixed charge; Projection (relational algebra); Facet (psychology); Variable (mathematics); Mathematical optimization; Fixed cost; Computer science; Space (punctuation); Transportation theory; Facility location problem; Charge (physics); Unit (ring theory); Fixed point; Mathematics; Combinatorics; Algorithm; Physics; Mathematical analysis","score_opus":0.059166430063894146,"score_gpt":0.3412065012197392,"score_spread":0.28204007115584506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154326504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7894611,0.0006966094,0.13605016,0.0015743058,0.00075584,0.0046528564,0.000055743538,0.0005061012,0.06624729],"genre_scores_gemma":[0.99247056,0.00002150036,0.0060350117,0.0000044324033,0.0000369874,0.00011206382,0.000014497445,0.000013819326,0.0012911169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992622,0.00005312695,0.0001636273,0.000057054345,0.00025704215,0.00020693197],"domain_scores_gemma":[0.999668,0.000025483932,0.0000061271676,0.00013549624,0.00012022485,0.00004464461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041903183,0.00005021646,0.00005866245,0.000077488534,0.00016940272,0.000031661173,0.000081921906,0.000045402216,0.00021358911],"category_scores_gemma":[0.000048284768,0.000036373167,0.000027825887,0.0004210939,0.00004235353,0.00024766912,0.00000748479,0.000164261,0.000049935734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002400217,0.0012872977,0.006873426,0.0016110418,0.00015132615,4.7777837e-7,0.030302469,0.366347,0.28621617,0.25063944,0.010421709,0.04612567],"study_design_scores_gemma":[0.00087547716,0.0001325777,0.00736142,0.00021436032,0.000040071936,0.000007092667,0.0018783101,0.6914419,0.2685079,0.00047001976,0.028594311,0.0004765774],"about_ca_topic_score_codex":0.000036124737,"about_ca_topic_score_gemma":0.000074483185,"teacher_disagreement_score":0.32509488,"about_ca_system_score_codex":0.000036427366,"about_ca_system_score_gemma":0.00002306974,"threshold_uncertainty_score":0.2338651},"labels":[],"label_agreement":null},{"id":"W2154692792","doi":"10.1287/opre.1100.0810","title":"Dynamic Supplier Contracts Under Asymmetric Inventory Information","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Purchasing; Supply chain; Adverse selection; Business; Order (exchange); Economic order quantity; Downstream (manufacturing); Lead time; Value (mathematics); Microeconomics; Information asymmetry; Operations research; Computer science; Economics; Marketing; Actuarial science; Finance","score_opus":0.03740602588520761,"score_gpt":0.31560985805576197,"score_spread":0.27820383217055433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154692792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54001176,0.00004903234,0.0021691013,0.010090598,0.001837452,0.0015636086,0.000008531838,0.00022437065,0.4440455],"genre_scores_gemma":[0.9927548,0.000011659996,0.00028456192,0.0020183085,0.00038694084,0.00015267564,0.00023806682,0.000017943617,0.0041350294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835265,0.000026839694,0.00028008956,0.00019763327,0.0007119623,0.00043084996],"domain_scores_gemma":[0.998898,0.000044326636,0.00003023363,0.00040529802,0.00058963534,0.00003247978],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015061402,0.00012310519,0.00010722494,0.0014549741,0.0006757435,0.0013154339,0.00037862902,0.00009499202,0.0024556045],"category_scores_gemma":[0.00042829913,0.00011491843,0.000048779093,0.0013922356,0.00013067527,0.0034560296,0.0002457658,0.00056919083,0.0058351667],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003249024,0.00032758468,0.0021093558,0.0001136863,0.00005447456,0.000006042635,0.00017189061,0.0045121643,0.003955937,0.8669486,0.098183185,0.023584558],"study_design_scores_gemma":[0.00074111356,0.000017876915,0.011017584,0.00001078358,0.000012313387,0.0000013559688,0.00088690646,0.17387822,0.00008337324,0.0022731703,0.8108359,0.00024138171],"about_ca_topic_score_codex":0.0008447636,"about_ca_topic_score_gemma":0.0019370889,"teacher_disagreement_score":0.86467546,"about_ca_system_score_codex":0.00008168351,"about_ca_system_score_gemma":0.00007416129,"threshold_uncertainty_score":0.9997213},"labels":[],"label_agreement":null},{"id":"W2154706439","doi":"10.1287/opre.1060.0368","title":"Dynamic Bid Prices in Revenue Management","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":253,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; University of Chicago","keywords":"Monotone polygon; Affine transformation; Dynamic programming; Bellman equation; Monotonic function; Function (biology); Mathematical optimization; Linear programming; Value (mathematics); Mathematics; Computer science; Statistics","score_opus":0.058169592402404255,"score_gpt":0.3646447303312125,"score_spread":0.3064751379288082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154706439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52394557,0.00021644955,0.0026123729,0.00407809,0.0004920865,0.0015244418,0.000003316783,0.00009333323,0.4670343],"genre_scores_gemma":[0.979909,0.000067307374,0.0014900026,0.0006517611,0.00027591252,0.000117746844,0.00004630792,0.000024100578,0.017417844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983511,0.000017377382,0.00026876747,0.00030306407,0.00055305765,0.0005066121],"domain_scores_gemma":[0.999458,0.00003153236,0.000017215041,0.0003335691,0.00014325955,0.000016379576],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031204456,0.00010174019,0.000097601536,0.0013595191,0.0003370168,0.00041114318,0.00036916274,0.00004250437,0.0006518145],"category_scores_gemma":[0.00007182498,0.00009967934,0.000032804506,0.0016753802,0.000072112394,0.0007103962,0.00033647486,0.00023046914,0.0015315398],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112956186,0.0010469792,0.012487959,0.00070819515,0.00008522159,0.00047968427,0.00055693835,0.0054370044,0.0019677035,0.8187433,0.068433374,0.0899407],"study_design_scores_gemma":[0.00084585545,0.000019790066,0.05639076,0.000113696755,0.000010303891,0.0000010261602,0.003059028,0.036575764,0.0000651668,0.002668051,0.8999507,0.0002998806],"about_ca_topic_score_codex":0.0010062038,"about_ca_topic_score_gemma":0.008720717,"teacher_disagreement_score":0.8315173,"about_ca_system_score_codex":0.00015773742,"about_ca_system_score_gemma":0.000013905201,"threshold_uncertainty_score":0.9992459},"labels":[],"label_agreement":null},{"id":"W2155372443","doi":"10.1287/opre.1080.0598","title":"Dynamic Hedging Under Jump Diffusion with Transaction Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hedge; Transaction cost; Jump diffusion; Portfolio; Jump; Asset (computer security); Econometrics; Replicating portfolio; Jump process; Database transaction; Computer science; Economics; Actuarial science; Microeconomics; Portfolio optimization; Financial economics","score_opus":0.048006141880909355,"score_gpt":0.3190268501185358,"score_spread":0.2710207082376265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155372443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058113147,0.00038647733,0.92575246,0.0044119433,0.00003835602,0.00035045767,0.000039253537,0.0000329412,0.010874958],"genre_scores_gemma":[0.99441797,0.00010693294,0.003922055,0.00012851418,0.000037857906,0.00010418829,0.000041024337,0.000012178677,0.0012292799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.0000068536096,0.00023144642,0.00031733522,0.0000816127,0.00027497043],"domain_scores_gemma":[0.9994825,0.000031743886,0.000021709855,0.00025460075,0.00013780345,0.00007164916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003468694,0.000081952494,0.00013418855,0.00027487436,0.0006548019,0.00015442798,0.00016027146,0.00006313882,0.00015315415],"category_scores_gemma":[0.000039219307,0.000081172024,0.000028654515,0.0007594519,0.00006285573,0.00022122853,0.000011996889,0.00023992015,0.00043103902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017454004,0.00016131332,0.00007591813,0.0000047512917,0.0000063914063,9.157227e-7,0.0001996089,0.0022270654,0.0008364834,0.9869219,0.000049190097,0.009498972],"study_design_scores_gemma":[0.0023102807,0.0011291057,0.088695124,0.00012011759,0.000013141792,0.000038225277,0.0011401969,0.49043953,0.00046512054,0.4010906,0.013620739,0.0009378151],"about_ca_topic_score_codex":0.0004841727,"about_ca_topic_score_gemma":0.0006614147,"teacher_disagreement_score":0.9363048,"about_ca_system_score_codex":0.0002076631,"about_ca_system_score_gemma":0.000057317357,"threshold_uncertainty_score":0.55402786},"labels":[],"label_agreement":null},{"id":"W2155819330","doi":"10.1287/opre.1110.0974","title":"Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Exploit; Abandonment (legal); Computer science; Server; Queueing theory; Service (business); Computer network; Real-time computing; Queueing system; Computer security; Business","score_opus":0.06578392342394168,"score_gpt":0.29055063318513075,"score_spread":0.22476670976118907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155819330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617306,0.00006983757,0.0054992307,0.0003919054,0.000048355443,0.0011835012,0.000016985981,0.00013593721,0.030923665],"genre_scores_gemma":[0.9933043,0.000003567539,0.001663908,0.00010892484,0.0002857986,0.00018597084,0.000043695396,0.000033626136,0.0043702186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887204,0.00005890633,0.00016939148,0.0002951547,0.00028817364,0.00031632406],"domain_scores_gemma":[0.99879277,0.000109352026,0.000029974966,0.0002673326,0.00077417167,0.000026373144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012799319,0.000117510324,0.00016737467,0.0003469882,0.0008748186,0.00036734453,0.00019343087,0.000053987238,0.00033586],"category_scores_gemma":[0.00017667291,0.00009323594,0.000023046801,0.0007999335,0.0001157424,0.0010982199,0.00011909701,0.00015710654,0.00060729013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002907143,0.0017733421,0.036402054,0.0053576124,0.002741613,0.00007900319,0.010329133,0.37564826,0.101761475,0.43736467,0.02194015,0.0036955618],"study_design_scores_gemma":[0.00081422454,0.00004309199,0.00057754177,0.00014712977,0.00014334264,0.000006270027,0.0005392513,0.98529625,0.0005768698,0.00079498295,0.010707694,0.00035332606],"about_ca_topic_score_codex":0.001158386,"about_ca_topic_score_gemma":0.00028650588,"teacher_disagreement_score":0.60964805,"about_ca_system_score_codex":0.000033490815,"about_ca_system_score_gemma":0.00003556717,"threshold_uncertainty_score":0.78056884},"labels":[],"label_agreement":null},{"id":"W2156458610","doi":"10.1287/opre.1070.0480","title":"The Optimal Time to Initiate HIV Therapy Under Ordered Health States","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"HIV/AIDS Research and Interventions","field":"Medicine","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute on Alcohol Abuse and Alcoholism; National Institutes of Health; National Science Foundation","keywords":"Human immunodeficiency virus (HIV); Intensive care medicine; Markov decision process; Risk analysis (engineering); Medicine; Computer science; Quality (philosophy); Antiretroviral therapy; Markov process; Immunology; Viral load; Mathematics; Epistemology","score_opus":0.14869159785619798,"score_gpt":0.4715894773964985,"score_spread":0.32289787954030047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156458610","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5491502,0.0038290492,0.017793383,0.36196992,0.000058405087,0.0057586683,0.0002750353,0.00020913372,0.060956188],"genre_scores_gemma":[0.26476425,0.005898944,0.0025160008,0.0014499871,0.00024767424,0.0006657456,0.0003686204,0.000059222602,0.72402954],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972744,0.00057096506,0.0003032069,0.00026161296,0.0008581844,0.0007316186],"domain_scores_gemma":[0.997844,0.00025152537,0.000009635555,0.00049666327,0.00091463694,0.00048354926],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001485113,0.000103197744,0.0001714656,0.0003112743,0.0023627619,0.00018109383,0.00025643586,0.000041717067,0.004328511],"category_scores_gemma":[0.00047687438,0.00006649888,0.00008633663,0.0008829763,0.00032719047,0.00014291967,0.00011111749,0.00053891365,0.00745625],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031958355,0.0005283775,0.00011979188,0.00001286023,0.00012267336,0.00003140609,0.0018090055,0.0014016919,0.0038958257,0.0013328735,0.9708622,0.019563707],"study_design_scores_gemma":[0.003746281,0.014168811,0.004915071,0.00021247646,0.0000052700884,0.00021104084,0.002769099,0.08077228,0.0035414894,0.00027761035,0.88905185,0.00032868734],"about_ca_topic_score_codex":0.00075400266,"about_ca_topic_score_gemma":0.00036058316,"teacher_disagreement_score":0.66307336,"about_ca_system_score_codex":0.0001756923,"about_ca_system_score_gemma":0.0012377821,"threshold_uncertainty_score":0.998936},"labels":[],"label_agreement":null},{"id":"W2157158960","doi":"10.1287/opre.1110.0965","title":"Benders Decomposition for Large-Scale Uncapacitated Hub Location","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":237,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Robustness (evolution); Heuristic; Computer science; Decomposition; Set (abstract data type); Algorithm; Reduction (mathematics); Mathematics","score_opus":0.12692481900359817,"score_gpt":0.40012140670801616,"score_spread":0.273196587704418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157158960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04329809,0.00004106715,0.9486955,0.00010489106,0.00012808996,0.0005624461,0.000023285527,0.00022568284,0.0069209873],"genre_scores_gemma":[0.6991071,0.000018457062,0.3000026,0.000015048587,0.000049490078,0.00022725268,0.00012804687,0.000033310436,0.0004187139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.00016404115,0.00019860442,0.00017252758,0.00020915136,0.00033304177],"domain_scores_gemma":[0.9989133,0.00009714744,0.000005903191,0.00023507068,0.00067002454,0.000078553305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264072,0.00008225231,0.00008427608,0.0002514188,0.00043033974,0.0000826777,0.00013900753,0.00008632309,0.00020950266],"category_scores_gemma":[0.00017110088,0.00009031874,0.000027867154,0.00067758205,0.000035630255,0.0002616386,0.000020489562,0.00018920269,0.00008582722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020143307,0.00011407706,0.00022916385,0.00007290855,0.000037345413,6.3315025e-7,0.005441788,0.9647171,0.015436321,0.0087854015,0.0024788731,0.0026662468],"study_design_scores_gemma":[0.00032290333,0.000050080904,0.00070888654,0.000015259498,0.0000053541376,0.0000016875896,0.0007833117,0.9786235,0.0184791,0.00025409146,0.00064751523,0.00010831221],"about_ca_topic_score_codex":0.000032330205,"about_ca_topic_score_gemma":0.0001569243,"teacher_disagreement_score":0.655809,"about_ca_system_score_codex":0.00012316623,"about_ca_system_score_gemma":0.00005260226,"threshold_uncertainty_score":0.3683091},"labels":[],"label_agreement":null},{"id":"W2158175311","doi":"10.1287/opre.51.6.940.24921","title":"A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Branch and cut; Linear programming relaxation; Mathematical optimization; Facet (psychology); Relaxation (psychology); Undirected graph; Integer programming; Mathematics; Integer (computer science); Linear programming; Algorithm; Polyhedron; Travelling salesman problem; Computer science; Combinatorics; Graph","score_opus":0.06787206902597621,"score_gpt":0.3684388767560152,"score_spread":0.300566807730039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158175311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004063582,0.00045943432,0.9917291,0.00048151662,0.00007798432,0.00085492973,0.00001420073,0.0001242939,0.002194959],"genre_scores_gemma":[0.15151243,0.00026906095,0.8439275,0.000033238113,0.00011319691,0.00074624305,0.00001804197,0.00006743878,0.0033128588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989259,0.00022794964,0.00016649521,0.00015854521,0.00021088871,0.00031021857],"domain_scores_gemma":[0.9989175,0.0005269337,0.0000039960382,0.00020193818,0.00028666246,0.00006296015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020162642,0.000082102786,0.00008760452,0.00009493506,0.0006581249,0.00019698907,0.00011665735,0.000060474886,0.000080118654],"category_scores_gemma":[0.00044421037,0.000064846405,0.000025660316,0.000532081,0.000065217166,0.00010208166,0.000017472517,0.00026758233,0.00001402681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021410904,0.000022651042,0.000025084686,0.000031744832,0.000052463707,5.5518063e-7,0.0009748727,0.84767866,0.0061095953,0.0059345854,0.0006083762,0.13855927],"study_design_scores_gemma":[0.00027789833,0.000018580324,0.000045538636,0.000011108075,0.0000059289014,0.000005767238,0.00015404132,0.98288643,0.0066989125,0.00017640351,0.009635757,0.00008364677],"about_ca_topic_score_codex":0.000027406953,"about_ca_topic_score_gemma":0.000054272034,"teacher_disagreement_score":0.14780161,"about_ca_system_score_codex":0.00005053463,"about_ca_system_score_gemma":0.00006915065,"threshold_uncertainty_score":0.50618315},"labels":[],"label_agreement":null},{"id":"W2158376392","doi":"10.1287/opre.2013.1190","title":"Optimal Economic Dispatch and Risk Management of Thermal Power Plants in Deregulated Markets","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematical optimization; Volatility (finance); Valuation (finance); Econometrics; Risk management; Economics; Spot contract; Computer science; Mathematics; Financial economics; Futures contract","score_opus":0.010377658184469951,"score_gpt":0.2581958759110573,"score_spread":0.24781821772658735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158376392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99037766,0.00025839265,0.0015106098,0.000025978423,0.000037829217,0.00050567073,0.000009315023,0.000023493943,0.007251052],"genre_scores_gemma":[0.9962276,0.0005712336,0.0026151114,6.1456024e-7,0.000006004471,0.000108732616,0.000011618948,0.000016428827,0.0004426297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921733,0.00011012839,0.00019513344,0.00012825777,0.00012605097,0.000223109],"domain_scores_gemma":[0.9996938,0.000041920594,0.0000069026164,0.00017323399,0.000041138454,0.000042979947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990872,0.000067695946,0.000093432405,0.00020469293,0.00006066925,0.00006769513,0.00010188325,0.000048663023,0.0003741813],"category_scores_gemma":[0.000007177375,0.00006648563,0.000009748225,0.00015173809,0.000026800033,0.0002044407,0.00004528618,0.00013570221,0.00008973196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095263895,0.000028249528,0.008118199,0.0000454281,0.0000712488,0.0000037142897,0.00039457198,0.9851041,0.0013653256,0.0003215052,0.00065638905,0.003881753],"study_design_scores_gemma":[0.00031967036,0.000021308811,0.123131186,0.00003849995,0.00000224336,0.0000021279834,0.00016849469,0.8753594,0.00083501515,0.000008749423,0.000038487786,0.00007481859],"about_ca_topic_score_codex":0.0004634046,"about_ca_topic_score_gemma":0.00012472163,"teacher_disagreement_score":0.11501299,"about_ca_system_score_codex":0.000097282864,"about_ca_system_score_gemma":0.000016071941,"threshold_uncertainty_score":0.4097023},"labels":[],"label_agreement":null},{"id":"W2158556837","doi":"10.1287/opre.1040.0116","title":"An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Korea Advanced Institute of Science and Technology; Korea Institute of Science and Technology","keywords":"Queue; Markovian arrival process; Queueing theory; Relation (database); Computer science; Fork–join queue; Discrete time and continuous time; Mathematics; Bulk queue; Mathematical optimization; Applied mathematics; Simple (philosophy); Queue management system; Statistics; Computer network","score_opus":0.05679358312859142,"score_gpt":0.39521664414088753,"score_spread":0.33842306101229613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158556837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18644786,0.000026590173,0.804754,0.0062993118,0.000026114627,0.0004347108,0.000020535379,0.00008045012,0.0019104248],"genre_scores_gemma":[0.91404194,0.000008771149,0.08457885,0.00035062188,0.00021239131,0.00013158633,0.0003207245,0.000017157172,0.00033793715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987536,0.00013898184,0.00019667452,0.00034757203,0.00031139312,0.0002517859],"domain_scores_gemma":[0.9988055,0.00012405418,0.00002280866,0.00031151113,0.0006966175,0.00003946876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015048649,0.00009643002,0.00010741551,0.0004452111,0.0012009259,0.00046483372,0.00018095529,0.000050952043,0.00012803815],"category_scores_gemma":[0.0008019758,0.0000976295,0.00002101314,0.001620752,0.00008519021,0.0020659098,0.00011889215,0.00023100102,0.00022241521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026665934,0.00007611884,0.00013816393,0.000009477516,0.000014606412,0.0000034601742,0.00021737542,0.22944649,0.009462875,0.7574368,0.000055130753,0.0031128107],"study_design_scores_gemma":[0.0017703096,0.00015876342,0.019292045,0.00014197666,0.00011344236,0.000011031564,0.005040996,0.48974836,0.0022732716,0.4465755,0.03398512,0.000889187],"about_ca_topic_score_codex":0.0011777942,"about_ca_topic_score_gemma":0.0017285327,"teacher_disagreement_score":0.7275941,"about_ca_system_score_codex":0.00012824209,"about_ca_system_score_gemma":0.00009274895,"threshold_uncertainty_score":0.92366725},"labels":[],"label_agreement":null},{"id":"W2159784590","doi":"10.1287/opre.1050.0222","title":"Dynamic Aggregation of Set-Partitioning Constraints in Column Generation","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada); Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Crew scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Degeneracy (biology); Equivalence relation; Relaxation (psychology); Set (abstract data type); Equivalence (formal languages); Job shop scheduling; Relation (database); Routing (electronic design automation); Mathematics; Discrete mathematics","score_opus":0.07615527304630118,"score_gpt":0.3934507778213092,"score_spread":0.317295504775008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159784590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83877885,0.000119168544,0.15676449,0.0003216722,0.00007374089,0.0003705606,0.000015962176,0.000079841855,0.0034757338],"genre_scores_gemma":[0.8891908,0.000063978165,0.110293165,0.000007909616,0.000045668217,0.00006178525,0.00007407234,0.000017278497,0.00024538097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987692,0.0002492409,0.00033408764,0.00014068728,0.00028714302,0.00021963619],"domain_scores_gemma":[0.99940556,0.00008590062,0.000010486294,0.00017736811,0.00027699303,0.000043680935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437979,0.00006749603,0.00010278378,0.00036701292,0.00014726294,0.00007802481,0.000095258576,0.000076393495,0.00034217964],"category_scores_gemma":[0.00029487623,0.00008229827,0.00001842705,0.00073308416,0.00010628208,0.00030806763,0.000020239579,0.0002379293,0.000052111587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011271949,0.00001878897,0.0003807291,0.000011746241,0.000004719182,5.152272e-7,0.000510611,0.9360482,0.045525547,0.0009544236,0.00012076855,0.016422812],"study_design_scores_gemma":[0.00024179787,0.000014585593,0.00097454747,0.000030581006,0.0000014600353,0.0000027296294,0.00013610555,0.9794321,0.01892296,0.000017911636,0.00015361655,0.00007159921],"about_ca_topic_score_codex":0.000045467248,"about_ca_topic_score_gemma":0.0014931523,"teacher_disagreement_score":0.050411936,"about_ca_system_score_codex":0.00023509124,"about_ca_system_score_gemma":0.000085419626,"threshold_uncertainty_score":0.3746627},"labels":[],"label_agreement":null},{"id":"W2160597848","doi":"10.1287/opre.1120.1060","title":"Technical Note—On Optimal Policies for Inventory Systems with Batch Ordering","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Series (stratigraphy); Integer (computer science); Markov chain; Computer science; Markov decision process; Order (exchange); Time horizon; Batch processing; Multiple; Markov process; Mathematics; Economics; Statistics; Finance","score_opus":0.1046541837346989,"score_gpt":0.358237815793805,"score_spread":0.25358363205910606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160597848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47478893,0.00086640014,0.09057655,0.017454322,0.002744418,0.010972122,0.00002949368,0.00093455694,0.4016332],"genre_scores_gemma":[0.98991174,0.000007804787,0.0011202467,0.000417186,0.0022147028,0.00094529823,0.000048712813,0.000040998417,0.0052933116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838245,0.000031481864,0.00019228001,0.00022629544,0.0005490247,0.0006184682],"domain_scores_gemma":[0.99922615,0.00006439546,0.000020273888,0.00032782162,0.00032586892,0.000035469086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014108076,0.00013316181,0.00013421889,0.00050107227,0.0007238793,0.0006548786,0.0002812394,0.000061208804,0.0001592433],"category_scores_gemma":[0.00018570732,0.000105775165,0.000040535982,0.0005881551,0.00011494956,0.00094996614,0.00019456043,0.0002144958,0.00036356493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021754474,0.0008496021,0.005415987,0.000623242,0.000054042077,0.0000060396765,0.0005243483,0.059265643,0.0027381892,0.801713,0.12616669,0.002425696],"study_design_scores_gemma":[0.00077713927,0.00012668424,0.00082965946,0.00011679789,0.000022248529,0.000003013547,0.0024079366,0.16283935,0.00018285034,0.00004051485,0.83232963,0.00032419033],"about_ca_topic_score_codex":0.00082706823,"about_ca_topic_score_gemma":0.00021109279,"teacher_disagreement_score":0.80167246,"about_ca_system_score_codex":0.00012968319,"about_ca_system_score_gemma":0.000038492504,"threshold_uncertainty_score":0.63150096},"labels":[],"label_agreement":null},{"id":"W2162205307","doi":"10.1287/opre.2014.1262","title":"Technical Note—A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Newsvendor model; Ambiguity; Economic order quantity; Profit (economics); Risk aversion (psychology); Ambiguity aversion; Standard deviation; Order (exchange); Economics; Mathematical economics; Mathematics; Expected utility hypothesis; Econometrics; Computer science; Microeconomics; Statistics; Business","score_opus":0.04763910670505203,"score_gpt":0.31923872916424817,"score_spread":0.2715996224591961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162205307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83560634,0.000105259256,0.024127625,0.013402165,0.0006706521,0.0026919579,0.000012175753,0.00014358616,0.12324026],"genre_scores_gemma":[0.9946035,0.000030242385,0.00088445307,0.0004798914,0.00029651023,0.000050805633,0.000011061525,0.000016291931,0.0036272262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870044,0.00009184756,0.00021034747,0.00024533653,0.000497812,0.0002541914],"domain_scores_gemma":[0.99898136,0.00007195005,0.00003585789,0.00049775786,0.00039655747,0.000016497313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017494705,0.00009244153,0.00011810563,0.00024268634,0.00067667215,0.0002351369,0.00030062304,0.000057472706,0.00037944003],"category_scores_gemma":[0.001166251,0.00006380207,0.00004529721,0.00072543905,0.00020667868,0.00039771482,0.00064643455,0.0002745022,0.000144274],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020558087,0.0011882121,0.024008036,0.0006487953,0.000054903292,0.0000098839,0.00048571505,0.012128677,0.06332073,0.5501406,0.1611995,0.18660933],"study_design_scores_gemma":[0.0011985467,0.000058345762,0.02912372,0.00008721966,0.000042692147,0.0000020518887,0.0005148363,0.3714685,0.001185276,0.0030087973,0.59306926,0.00024072953],"about_ca_topic_score_codex":0.002104122,"about_ca_topic_score_gemma":0.002136419,"teacher_disagreement_score":0.54713184,"about_ca_system_score_codex":0.000030493877,"about_ca_system_score_gemma":0.000025439242,"threshold_uncertainty_score":0.5204483},"labels":[],"label_agreement":null},{"id":"W2163230183","doi":"10.1287/opre.2015.1354","title":"Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Voronoi diagram; Polygon (computer graphics); Euclidean geometry; Facility location problem; Regular polygon; Mathematical optimization; Computer science; Plane (geometry); Point in polygon; Polynomial; 1-center problem; Variety (cybernetics); Mathematics; Geometry; Artificial intelligence","score_opus":0.1552434604016417,"score_gpt":0.3087525673238241,"score_spread":0.15350910692218242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163230183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99450153,0.00016048385,0.00079855096,0.0012821285,0.00006494857,0.00094354525,0.0000023119935,0.000029213927,0.0022172963],"genre_scores_gemma":[0.99861395,0.000006869462,0.000079146004,0.00003722036,0.00005369723,0.00017808778,0.00005419448,0.0000062734503,0.00097054354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985788,0.00006480955,0.00031013048,0.00024369075,0.0005505564,0.0002520352],"domain_scores_gemma":[0.99834096,0.000006011446,0.000015082717,0.00028334183,0.0013342039,0.000020418865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014685021,0.00009817521,0.00014193247,0.0003046734,0.00015842238,0.00020240698,0.00020560181,0.000036820453,0.00009260464],"category_scores_gemma":[0.00033119723,0.0000730345,0.000015488495,0.0010096447,0.0001728151,0.0009443439,0.000115631585,0.00014516585,0.00015765944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023175999,0.0004436759,0.10527082,0.0010780869,0.00004574679,0.0000027477063,0.0029455887,0.85834956,0.0017629601,0.01937793,0.0016554688,0.008835667],"study_design_scores_gemma":[0.0025791477,0.00016671352,0.07877444,0.00024262721,0.000022781833,0.0000015502571,0.010542307,0.89635277,0.0010773961,0.000523737,0.0091895135,0.00052703236],"about_ca_topic_score_codex":0.020483008,"about_ca_topic_score_gemma":0.05366699,"teacher_disagreement_score":0.038003203,"about_ca_system_score_codex":0.00007570994,"about_ca_system_score_gemma":0.00010930829,"threshold_uncertainty_score":0.9860397},"labels":[],"label_agreement":null},{"id":"W2164092299","doi":"10.1287/opre.1060.0360","title":"Classification and Regression via Integer Optimization","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Regression; Integer programming; Regression analysis; Computer science; Optimization problem; Mathematics; Mathematical optimization; Data mining; Artificial intelligence; Statistics; Machine learning","score_opus":0.08721332552102332,"score_gpt":0.41979486974373104,"score_spread":0.3325815442227077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164092299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007286594,0.00007085413,0.9819533,0.0041813334,0.00007294472,0.00018375972,8.6178227e-7,0.000089071276,0.0061612343],"genre_scores_gemma":[0.8714819,0.00008611541,0.12682006,0.000044833625,0.00006854746,0.000022627912,0.00006801185,0.000007263478,0.0014006458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854326,0.0002376077,0.00020121333,0.0003614417,0.00041980585,0.0002366733],"domain_scores_gemma":[0.9987633,0.00016437918,0.000020211326,0.0005445896,0.00040013783,0.00010738899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027523355,0.000072027084,0.00006378913,0.00036541704,0.00065392273,0.0004083216,0.00036450275,0.000075106545,0.000038031303],"category_scores_gemma":[0.00040735747,0.00005942348,0.00001216683,0.00079833815,0.000085363405,0.0007308076,0.00017156565,0.000325952,0.00008409562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022343276,0.00020524717,0.0052865054,0.000023474933,0.000010740942,0.0000049760747,0.0015006186,0.018301308,0.03272191,0.45462927,0.0019995386,0.48529407],"study_design_scores_gemma":[0.00011707641,0.000057082405,0.022650817,0.000013431574,8.97644e-7,0.000007967102,0.0001081066,0.97106487,0.00038071375,0.00018763576,0.005335159,0.00007622088],"about_ca_topic_score_codex":0.00010173797,"about_ca_topic_score_gemma":0.00010935005,"teacher_disagreement_score":0.95276356,"about_ca_system_score_codex":0.0000630334,"about_ca_system_score_gemma":0.00006246378,"threshold_uncertainty_score":0.5029511},"labels":[],"label_agreement":null},{"id":"W2165622730","doi":"10.1287/opre.1080.0685","title":"Percentile Optimization for Markov Decision Processes with Parameter Uncertainty","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; HEC Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Ambiguity; Computer science; Markov decision process; Mathematical optimization; Parametric statistics; Set (abstract data type); Percentile; Markov chain; Markov process; Process (computing); Decision process; Operations research; Machine learning; Mathematics; Management science; Statistics; Economics","score_opus":0.04191846451408229,"score_gpt":0.3783378437581784,"score_spread":0.33641937924409615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165622730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011680854,0.000047722086,0.99586487,0.0010694065,0.000050200302,0.0011235186,0.00000992358,0.00010248052,0.00056376564],"genre_scores_gemma":[0.08008291,0.000085255226,0.9183091,0.00014344086,0.000046717323,0.0002713251,0.000046595553,0.000014017323,0.0010006466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813014,0.000108311,0.00021124812,0.00055817154,0.0005900671,0.00040208298],"domain_scores_gemma":[0.9961469,0.0005941756,0.000022053406,0.00051838165,0.0026018845,0.00011661696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050800084,0.00013433452,0.00013150171,0.0003115366,0.0008150827,0.000637746,0.00057920255,0.00006263731,0.000069740294],"category_scores_gemma":[0.0015251641,0.00010683286,0.000028090733,0.00156458,0.000081479826,0.0012893765,0.00008182591,0.00017005316,0.00001844263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043447573,0.00013422982,0.000009844848,0.000008037128,0.00000492838,0.0000018860471,0.00027604753,0.94743514,0.00006982444,0.0016828624,0.00024653054,0.05008722],"study_design_scores_gemma":[0.0006610031,0.00039389185,0.00011236461,0.000037988648,0.0000022507954,0.000008856593,0.00008518197,0.996733,0.00057171803,0.00051726744,0.0007244789,0.00015196243],"about_ca_topic_score_codex":0.000013811141,"about_ca_topic_score_gemma":0.00009712534,"teacher_disagreement_score":0.07891482,"about_ca_system_score_codex":0.00015130555,"about_ca_system_score_gemma":0.00050571666,"threshold_uncertainty_score":0.62690395},"labels":[],"label_agreement":null},{"id":"W2166649678","doi":"10.1287/opre.1080.0556","title":"A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Variance reduction; Markov chain; Mathematics; Mathematical optimization; State space; Hybrid Monte Carlo; Computer science; Applied mathematics; Statistics","score_opus":0.3229740488047983,"score_gpt":0.5255334680860169,"score_spread":0.20255941928121857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166649678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028163655,0.000026199623,0.958893,0.0018550057,0.000054063155,0.0034734807,0.000021518847,0.00009674428,0.0074163447],"genre_scores_gemma":[0.319917,0.00002438731,0.6446622,0.00008886029,0.00016521408,0.002128703,0.000029053896,0.000040120933,0.032944437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969384,0.0010880372,0.0006326928,0.0003046029,0.0006920742,0.00034419744],"domain_scores_gemma":[0.9926333,0.0054807337,0.000044776825,0.00040615973,0.0013188344,0.00011618274],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005649259,0.00015338526,0.00046450295,0.00030347446,0.000873829,0.00015020737,0.00019400335,0.00012869667,0.0005612461],"category_scores_gemma":[0.013162246,0.00011570076,0.0002024062,0.00044712238,0.00017061947,0.0002700655,0.000043885255,0.00027082575,0.000079439786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027231039,0.0004747588,0.0000019065931,0.00013336152,0.0000632408,0.0000014098551,0.004104348,0.0036243687,0.00027884904,0.9818197,0.0048766676,0.0018983239],"study_design_scores_gemma":[0.018071167,0.00008027744,0.0000018650223,0.00002863249,0.000017471271,0.0000062972786,0.0002820091,0.9393299,0.00044311598,0.03998999,0.0016243006,0.0001249497],"about_ca_topic_score_codex":0.00009444244,"about_ca_topic_score_gemma":0.00013338539,"teacher_disagreement_score":0.9418297,"about_ca_system_score_codex":0.0001086914,"about_ca_system_score_gemma":0.00016368178,"threshold_uncertainty_score":0.9951503},"labels":[],"label_agreement":null},{"id":"W2167053528","doi":"10.1287/opre.1100.0798","title":"Information Acquisition for Capacity Planning via Pricing and Advance Selling: When to Stop and Act?","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":179,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Revenue management; Capacity management; Revenue; Profit (economics); Business; Capacity planning; Dynamic pricing; Profit maximization; Marginal revenue; Marketing; Maximization; Capacity utilization; Operations research; Computer science; Industrial organization; Microeconomics; Operations management; Economics; Finance","score_opus":0.057075001043509856,"score_gpt":0.3257481535987947,"score_spread":0.26867315255528484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167053528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282968,0.000024406034,0.061617363,0.0028617894,0.0001959137,0.0011271598,0.0000039928887,0.00004843921,0.0058241286],"genre_scores_gemma":[0.9916369,0.0000044781095,0.0063150506,0.0010196315,0.00040779708,0.0001728592,0.000055210563,0.00000948174,0.0003786066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992637,0.0000108009,0.00014716915,0.00013872939,0.00021933077,0.00022025921],"domain_scores_gemma":[0.9994515,0.00004795287,0.000018788367,0.00013460648,0.00032200493,0.000025112475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009612568,0.00007533937,0.00007324556,0.00037494875,0.0007147133,0.00079143606,0.00009429379,0.00004026011,0.00008504506],"category_scores_gemma":[0.00019296938,0.00007307209,0.000011341375,0.00021858486,0.000045526947,0.0023387936,0.00012725164,0.00016533244,0.000045453246],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044795382,0.00032636579,0.031302102,0.0023269658,0.0001250579,0.0000046019727,0.025547164,0.026722241,0.11661933,0.50171053,0.047057908,0.24780974],"study_design_scores_gemma":[0.0008331135,0.00006485716,0.008665322,0.00007746125,0.00001622187,0.0000020950197,0.0027446118,0.39902672,0.0010560179,0.003650764,0.5835574,0.00030537648],"about_ca_topic_score_codex":0.00025176787,"about_ca_topic_score_gemma":0.00014722231,"teacher_disagreement_score":0.5364995,"about_ca_system_score_codex":0.000021416863,"about_ca_system_score_gemma":0.000011002826,"threshold_uncertainty_score":0.7631836},"labels":[],"label_agreement":null},{"id":"W2167252691","doi":"10.1287/opre.1060.0327","title":"Efficient Supply Chain Management at the U.S. Coast Guard Using Part-Age Dependent Supply Replenishment Policies","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Pan-American Association of Ophthalmology","keywords":"Computer science; Supply chain; Homeland security; Operations research; Supply chain management; Merge (version control); Coast guard; Service (business); Database; Business; Environmental science","score_opus":0.029091919467867575,"score_gpt":0.2984447453519369,"score_spread":0.2693528258840693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167252691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690885,0.0004534641,0.012123207,0.0022954664,0.0003203726,0.0017741646,0.00010106599,0.00015904146,0.0136847515],"genre_scores_gemma":[0.988235,0.00031678556,0.0022613318,0.00003608514,0.00014363405,0.00030296904,0.0001374657,0.000034066357,0.008532663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997988,0.00016513221,0.0003312546,0.00028511276,0.00066897523,0.0005615442],"domain_scores_gemma":[0.9991001,0.00006133385,0.0000108253025,0.0005890004,0.00017656766,0.00006217093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011478812,0.00014680432,0.00012605773,0.00017542229,0.00090972806,0.00030456102,0.0002498183,0.00006080582,0.00027437063],"category_scores_gemma":[0.000035831363,0.00011392192,0.000055305012,0.0004725052,0.00017295222,0.00007016655,0.00022453515,0.00023944268,0.000102460086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008011492,0.000065308304,0.00019892564,0.000032260454,0.00001743839,0.0000113412125,0.00032206724,0.98155874,0.002674911,0.004001642,0.010683853,0.00042549],"study_design_scores_gemma":[0.00040731515,0.00003951567,0.0020224894,0.00006144206,0.00001542202,0.000013343804,0.0010578134,0.96626353,0.005694972,0.00009069477,0.024121976,0.00021149196],"about_ca_topic_score_codex":0.0016282686,"about_ca_topic_score_gemma":0.0053167734,"teacher_disagreement_score":0.019146532,"about_ca_system_score_codex":0.00066413695,"about_ca_system_score_gemma":0.0000360774,"threshold_uncertainty_score":0.69969845},"labels":[],"label_agreement":null},{"id":"W2168712456","doi":"10.1287/opre.1060.0333","title":"Online Low-Price Guarantees—A Real Options Analysis","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Reservation; Renting; Purchasing; Reservation price; Business; Product (mathematics); Service (business); Service provider; Marketing; Liberian dollar; Automotive industry; Microeconomics; Commerce; Economics; Computer science; Finance","score_opus":0.07322361096623393,"score_gpt":0.33617223393628537,"score_spread":0.26294862297005145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168712456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9496148,0.006850904,0.0012434319,0.002162271,0.00007035566,0.00024037638,0.00054255285,0.0000484307,0.039226867],"genre_scores_gemma":[0.9442744,0.0055238907,0.0018389366,0.000043058542,0.00024091992,0.000056605008,0.00094295276,0.000016314496,0.047062915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998492,0.00007376736,0.00052700564,0.00041315562,0.00012363863,0.0003704066],"domain_scores_gemma":[0.9991201,0.00007504082,0.000036636993,0.0004890094,0.00020191066,0.00007727345],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010813527,0.000104976556,0.0002956729,0.0015632065,0.000613603,0.0003089823,0.00026454407,0.0000831184,0.0025583503],"category_scores_gemma":[0.00008930162,0.00010879136,0.00024879567,0.003561303,0.00013168555,0.00027347548,0.00007718123,0.00024236683,0.0018180279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004644148,0.0005092153,0.0069650444,0.0000040053733,0.0002493255,0.000004322468,0.0001128472,0.03296425,0.00016411365,0.9562235,0.0027736404,0.000025091203],"study_design_scores_gemma":[0.00056800945,0.00008936824,0.19109082,0.000007953867,0.00012600498,0.0000017775313,0.00046827516,0.759286,0.00017608536,0.03237326,0.015340765,0.00047168473],"about_ca_topic_score_codex":0.020945914,"about_ca_topic_score_gemma":0.014644653,"teacher_disagreement_score":0.92385024,"about_ca_system_score_codex":0.00015191679,"about_ca_system_score_gemma":0.000041195995,"threshold_uncertainty_score":0.9989592},"labels":[],"label_agreement":null},{"id":"W2169634760","doi":"10.1287/opre.48.2.308.12385","title":"Close-Point Spatial Tests and Their Application to Random Number Generators","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Universität Salzburg","keywords":"Mathematics; Hypercube; Point process; Poisson point process; Torus; Poisson distribution; Square root; Unit square; Convergence (economics); Random number generation; Combinatorics; Transformation (genetics); Discrete mathematics; Statistics; Geometry","score_opus":0.026182642608794555,"score_gpt":0.3463407485235901,"score_spread":0.32015810591479554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169634760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35703346,0.000052875446,0.63589936,0.0034827364,0.00006201578,0.0005533472,0.00000615553,0.00005743833,0.0028525894],"genre_scores_gemma":[0.9699945,0.000036652003,0.027285395,0.00029849863,0.0002615631,0.0002559566,0.000030269475,0.000008251769,0.0018289355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853235,0.00023746715,0.00019509533,0.00042899835,0.00035692265,0.00024918036],"domain_scores_gemma":[0.9989198,0.00015695664,0.0000072728144,0.0003987623,0.00034903843,0.00016819745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091321213,0.00010032676,0.00010192534,0.00017446927,0.0006468803,0.0004953162,0.00032387892,0.00004867339,0.0002582162],"category_scores_gemma":[0.00009347336,0.0000857466,0.000025121295,0.0009772244,0.00004406619,0.000388569,0.000118792115,0.00015539736,0.0007486853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032996926,0.00013902741,0.00021813458,0.0000060850357,0.000014655375,0.0000021538726,0.0016593556,0.06272031,0.018382667,0.03757841,0.003929847,0.8753164],"study_design_scores_gemma":[0.0008567222,0.0001341954,0.0038109047,0.000010989444,0.000001979769,0.000033900207,0.00004322804,0.9188971,0.019583635,0.0038382218,0.05253188,0.0002572774],"about_ca_topic_score_codex":0.00026602336,"about_ca_topic_score_gemma":0.0003910022,"teacher_disagreement_score":0.87505907,"about_ca_system_score_codex":0.00005127806,"about_ca_system_score_gemma":0.00014544823,"threshold_uncertainty_score":0.96230847},"labels":[],"label_agreement":null},{"id":"W2169746365","doi":"10.1287/opre.1080.0522","title":"Dynamic Capacity Expansion for a Service Firm with Capacity Deterioration and Supply Uncertainty","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Obsolescence; Revenue; Profit (economics); Stock (firearms); Microeconomics; Economics; Purchasing; Capacity utilization; Industrial organization; Business; Operations management; Finance; Marketing","score_opus":0.13087281211565333,"score_gpt":0.3023482248545646,"score_spread":0.17147541273891126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169746365","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99569994,0.000669704,0.0011297051,0.0014403067,0.00002690666,0.00048548283,0.00019985251,0.000015563943,0.0003325182],"genre_scores_gemma":[0.9927305,0.00089301803,0.0047089653,0.00009694254,0.000026965727,0.00020782807,0.000112257396,0.000013637066,0.0012098978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990328,0.000043655204,0.00025071006,0.00034271256,0.00008009523,0.00025002914],"domain_scores_gemma":[0.9992964,0.00007283239,0.000030034269,0.0002414542,0.00027066798,0.000088595705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521809,0.0000976961,0.00019505975,0.00027706652,0.0009142293,0.00013505224,0.000102464546,0.00007117098,0.00008982899],"category_scores_gemma":[0.00009251235,0.000088273024,0.00004008147,0.00049385417,0.00016649324,0.00037306699,0.000035244706,0.00015049978,0.000076120254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008832406,0.0015523277,0.08838098,0.00051822147,0.00065275154,0.000025156798,0.04280179,0.043366868,0.031267922,0.7843851,0.00447416,0.0016914724],"study_design_scores_gemma":[0.0014096132,0.0005421541,0.06560477,0.000029114763,0.000015256743,0.000026562893,0.0007327299,0.9161542,0.0005273434,0.0106005,0.003933729,0.0004240396],"about_ca_topic_score_codex":0.0059676017,"about_ca_topic_score_gemma":0.013375942,"teacher_disagreement_score":0.8727873,"about_ca_system_score_codex":0.00013286712,"about_ca_system_score_gemma":0.000051340718,"threshold_uncertainty_score":0.90212685},"labels":[],"label_agreement":null},{"id":"W2172232139","doi":"10.1287/opre.1100.0843","title":"A User's Guide to Solving Dynamic Stochastic Games Using the Homotopy Method","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homotopy analysis method; Homotopy; Mathematical optimization; Computer science; Mathematics; Applied mathematics; Mathematical economics; Pure mathematics","score_opus":0.08167783230869059,"score_gpt":0.4043634140647224,"score_spread":0.32268558175603185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172232139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36425966,0.00015871109,0.62415826,0.0032455986,0.00043205943,0.0006054369,0.000098744546,0.000022674914,0.0070188553],"genre_scores_gemma":[0.90224993,0.000018407836,0.08514763,0.0001876024,0.00018254093,0.0001432234,0.000007128376,0.000035639685,0.012027902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858826,0.000062064246,0.00042826365,0.00040764303,0.000056826993,0.00045695965],"domain_scores_gemma":[0.998749,0.00024007622,0.00003230669,0.00070931035,0.00014479987,0.00012446578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003286191,0.00010930404,0.00021044328,0.00032278037,0.00088535435,0.0005020225,0.00052930054,0.00008104428,0.0008358589],"category_scores_gemma":[0.0007341922,0.000099455916,0.000068784604,0.00036378735,0.000111389796,0.00025747344,0.0002510219,0.0005108845,0.00052929274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075346816,0.000037143298,0.000113411006,0.0000048752845,0.000030157167,0.0000010544755,0.0013438417,0.10226357,0.0050895927,0.8888372,0.0008471636,0.0014244529],"study_design_scores_gemma":[0.00023686755,0.00005015331,0.00032741643,0.000010855165,0.0000035082774,0.000014857067,0.00077336445,0.9261639,0.00022852045,0.01976057,0.052199647,0.00023033108],"about_ca_topic_score_codex":0.002201323,"about_ca_topic_score_gemma":0.0030404588,"teacher_disagreement_score":0.8690766,"about_ca_system_score_codex":0.00013348319,"about_ca_system_score_gemma":0.00011485713,"threshold_uncertainty_score":0.9152069},"labels":[],"label_agreement":null},{"id":"W2212120931","doi":"10.1287/opre.2015.1400","title":"Technical Note—Pricing Under the Nested Attraction Model with a Multistage Choice Structure","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nested logit; Tree (set theory); Computer science; Sensitivity (control systems); Mathematical optimization; Mathematical economics; Attraction; Mathematics; Property (philosophy); Index (typography); Econometrics; Combinatorics","score_opus":0.13699189150696017,"score_gpt":0.3864503429709389,"score_spread":0.24945845146397871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212120931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9088443,0.00006427522,0.06766091,0.00719879,0.00015328971,0.0010984922,0.000007557959,0.0001845848,0.014787834],"genre_scores_gemma":[0.99596214,0.0000020233106,0.0016776535,0.0002779141,0.0003001891,0.000055383614,0.000034539316,0.000025314643,0.0016648298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856585,0.000058390615,0.00016275457,0.00025997887,0.0006422967,0.0003107338],"domain_scores_gemma":[0.99870855,0.00014218275,0.000023148974,0.0003792946,0.00072017504,0.00002667068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009636224,0.000117956406,0.00010179771,0.00024482913,0.0008853586,0.0008817639,0.00027737863,0.00007779074,0.00011524156],"category_scores_gemma":[0.00027371768,0.00007526597,0.000024193972,0.0010265047,0.00012299957,0.0009738263,0.000175818,0.0006283611,0.00006462511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038385243,0.0004136096,0.03839871,0.0001267623,0.00004038641,0.000039549683,0.00080974307,0.7698477,0.10720589,0.02714511,0.010950746,0.04463793],"study_design_scores_gemma":[0.0007833414,0.000018366181,0.03576366,0.000039550996,0.000051144012,0.00001522298,0.0010945639,0.95051616,0.00013552878,0.00024682638,0.011088658,0.00024697982],"about_ca_topic_score_codex":0.005140298,"about_ca_topic_score_gemma":0.01828153,"teacher_disagreement_score":0.18066844,"about_ca_system_score_codex":0.000094949886,"about_ca_system_score_gemma":0.00016721406,"threshold_uncertainty_score":0.9996323},"labels":[],"label_agreement":null},{"id":"W2214969595","doi":"10.1287/opre.2016.1535","title":"Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Routing (electronic design automation); Computer science; Battery (electricity); Groundwater recharge; Extension (predicate logic); Algorithm; Mathematical optimization; Real-time computing; Engineering; Mathematics; Computer network; Power (physics)","score_opus":0.05546575356943034,"score_gpt":0.34658538942623596,"score_spread":0.2911196358568056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214969595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069761515,0.00011391142,0.9223574,0.0009715294,0.0000638144,0.0017359914,0.00002855184,0.0005158722,0.0044514635],"genre_scores_gemma":[0.79040176,0.00007513933,0.19776699,0.000022117949,0.00033803072,0.00092334324,0.000027381555,0.0001686075,0.010276658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982421,0.00020538103,0.0002475421,0.00028704433,0.0003988431,0.0006191025],"domain_scores_gemma":[0.99849504,0.000534825,0.000010453429,0.00033242084,0.0005109879,0.00011629198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018515736,0.00013936227,0.00015663264,0.00029731065,0.00044961012,0.00017818814,0.00023015999,0.00009047033,0.00016875623],"category_scores_gemma":[0.0004351534,0.00009664925,0.000034265588,0.0009372238,0.000054120814,0.00031119256,0.00003543287,0.00022632458,0.00020302949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018217761,0.00004382035,0.00027603307,0.000041140338,0.00005922487,0.0000020940126,0.00028444306,0.58022237,0.35262594,0.000708199,0.0010170079,0.06470151],"study_design_scores_gemma":[0.0007274638,0.00015982175,0.00017005925,0.00006876828,0.0000058001547,0.0000069831026,0.000019557869,0.97382253,0.023256281,0.000038649712,0.001545704,0.00017835503],"about_ca_topic_score_codex":0.000018144108,"about_ca_topic_score_gemma":0.000016668411,"teacher_disagreement_score":0.72459036,"about_ca_system_score_codex":0.00020297631,"about_ca_system_score_gemma":0.00012976644,"threshold_uncertainty_score":0.3941242},"labels":[],"label_agreement":null},{"id":"W2231033513","doi":"10.1287/opre.2015.1443","title":"Technical Note—Sequential Multiproduct Price Competition in Supply Chain Networks","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Comparative statics; Competition (biology); Product (mathematics); Supply chain; Downstream (manufacturing); Microeconomics; Marginal cost; Economics; Upstream (networking); Industrial organization; Computer science; Business; Mathematics; Marketing; Operations management","score_opus":0.05754119686171174,"score_gpt":0.32837379562890673,"score_spread":0.270832598767195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231033513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27437955,0.0005103075,0.3051897,0.14299893,0.0035896734,0.0095066065,0.0000334792,0.0010342365,0.2627575],"genre_scores_gemma":[0.9933188,0.00005805519,0.0006138752,0.00044296955,0.0015985611,0.0002655777,0.00006327591,0.00002587228,0.003613045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980771,0.00009528045,0.00030690266,0.00044041715,0.0005434011,0.0005368754],"domain_scores_gemma":[0.9991643,0.00007922374,0.000022153174,0.00041410504,0.00029747514,0.000022779685],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021077052,0.0001306822,0.00013703531,0.0007097484,0.00037376053,0.00038888157,0.00037879025,0.0000871345,0.0019970236],"category_scores_gemma":[0.00043335624,0.00009900749,0.00004697362,0.001072873,0.00018075865,0.0010278738,0.00038109347,0.00028299954,0.0009791529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021389745,0.0012456332,0.012299461,0.00015701682,0.000022307646,0.0000963748,0.00013428184,0.018298384,0.068473525,0.7842531,0.06000031,0.054805666],"study_design_scores_gemma":[0.0035627778,0.000086686814,0.026617862,0.0004211172,0.00001610039,0.0000053177027,0.00039521296,0.36589196,0.0009878235,0.0018492863,0.59938365,0.0007822294],"about_ca_topic_score_codex":0.0009386861,"about_ca_topic_score_gemma":0.0025774103,"teacher_disagreement_score":0.7824038,"about_ca_system_score_codex":0.00021639574,"about_ca_system_score_gemma":0.00004351475,"threshold_uncertainty_score":0.9997987},"labels":[],"label_agreement":null},{"id":"W2232678697","doi":"10.1287/opre.2017.1712","title":"Informational Braess’ Paradox: The Effect of Information on Traffic Congestion","year":2018,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Inefficiency; Computer science; Class (philosophy); Complement (music); Set (abstract data type); Theoretical computer science; Focus (optics); Embedding; Graph; Mathematical economics; Mathematical optimization; Mathematics; Artificial intelligence; Economics","score_opus":0.05161637199998291,"score_gpt":0.4102067467891671,"score_spread":0.35859037478918415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232678697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9531253,0.000053622116,0.0024748077,0.005147515,0.00085524435,0.0026245331,0.00024555827,0.00012635764,0.035347078],"genre_scores_gemma":[0.9969191,0.00011933962,0.000360322,0.00004518453,0.0002244106,0.00026422465,0.0015016447,0.000007404244,0.0005583493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967003,0.0010658279,0.0004487714,0.00014675825,0.0013913979,0.00024694428],"domain_scores_gemma":[0.9976897,0.00072494504,0.00009501046,0.00030607136,0.0011129325,0.000071337585],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0045456123,0.00012424416,0.00015958074,0.00042062893,0.0015001037,0.00044039884,0.00042894456,0.0002868554,0.00026129626],"category_scores_gemma":[0.001305573,0.00009169894,0.00006948004,0.000555306,0.0005904814,0.00060316257,0.000045446413,0.0006897273,0.00023781066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008349599,0.00001893077,0.0003686979,0.000062111605,0.000021865611,1.6283191e-7,0.016546587,0.9587052,0.0000017709914,0.0138929365,0.0045547266,0.005743503],"study_design_scores_gemma":[0.004088063,0.0035228522,0.08998141,0.0020762966,0.00021043686,0.0000037203586,0.014824871,0.6944434,0.0015901251,0.0013500372,0.18634671,0.0015620773],"about_ca_topic_score_codex":0.00080924,"about_ca_topic_score_gemma":0.00096153346,"teacher_disagreement_score":0.2642618,"about_ca_system_score_codex":0.0001363447,"about_ca_system_score_gemma":0.00076337246,"threshold_uncertainty_score":0.9997998},"labels":[],"label_agreement":null},{"id":"W2238342614","doi":"10.1287/opre.2015.1458","title":"The Empirical Implications of Privacy-Aware Choice","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Economic and Environmental Valuation","field":"Economics, Econometrics and Finance","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Conceptualization; Computer science; Consumer choice; Information privacy; Internet privacy; Microeconomics; Economics; Artificial intelligence","score_opus":0.569019847385555,"score_gpt":0.4100003937164621,"score_spread":0.15901945366909293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238342614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94301254,0.0003507494,0.0072437623,0.032599103,0.00007561683,0.00033842842,0.00012809459,0.000010882266,0.016240813],"genre_scores_gemma":[0.99122405,0.00041202197,0.00021353339,0.000044911078,0.000055475775,0.00012626349,0.00000853036,0.0000089746245,0.007906242],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991789,0.00004347103,0.0003422391,0.00019921821,0.000043256732,0.00019290179],"domain_scores_gemma":[0.99909365,0.0003266737,0.00003340901,0.00044840737,0.000050127113,0.000047703576],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010446524,0.00004656389,0.00009065731,0.000086833825,0.00046994069,0.000051486597,0.00029031606,0.000042485754,0.00074979645],"category_scores_gemma":[0.00039479346,0.00003163941,0.000039734514,0.00016491822,0.00020814256,0.00018166075,0.00010594667,0.0000818083,0.0015967585],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004396395,0.00010649439,0.6475123,0.000004073188,0.000028794959,6.461718e-8,0.00033984406,0.00018950108,0.0011505879,0.33147457,0.010439992,0.008749375],"study_design_scores_gemma":[0.0002713187,0.00004912942,0.88878703,0.0000058261953,0.0000010457478,7.8168074e-7,0.00008943484,0.0011167456,0.0004869066,0.01222012,0.09689437,0.00007730825],"about_ca_topic_score_codex":0.00013879982,"about_ca_topic_score_gemma":0.0001715532,"teacher_disagreement_score":0.31925443,"about_ca_system_score_codex":0.00015562182,"about_ca_system_score_gemma":0.000034863548,"threshold_uncertainty_score":0.9991806},"labels":[],"label_agreement":null},{"id":"W2296472172","doi":"10.1287/opre.1060.0337","title":"Competition in Service Industries","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Competition (biology); Service (business); Microeconomics; Benchmark (surveying); Industrial organization; Business; Economics; Marketing","score_opus":0.10573325381209632,"score_gpt":0.32797768007179556,"score_spread":0.22224442625969926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296472172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80915135,0.0000046846476,0.00007048869,0.00083839375,0.00004727208,0.00011092738,7.3465634e-7,0.000014731639,0.18976139],"genre_scores_gemma":[0.9981617,0.0000021158028,0.000058258483,0.0005797315,0.00029727057,0.000009009734,0.000070173875,0.0000066117673,0.00081514794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939865,9.184627e-7,0.00014038863,0.000104582585,0.00012626621,0.0002292206],"domain_scores_gemma":[0.99957865,0.000027329446,0.000006859418,0.000099142024,0.00027992172,0.000008117767],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009998301,0.000041746345,0.000051430998,0.00036975965,0.00018690104,0.0009741295,0.00011402424,0.00004219389,0.00029658002],"category_scores_gemma":[0.00011314471,0.00004032787,0.00000688921,0.0011002269,0.000028171677,0.0033941518,0.00009438035,0.00017258592,0.0014756892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002350686,0.00011339839,0.008410267,0.000030835945,0.0000036298995,0.000009210782,0.000072490606,0.0033473033,0.00029815704,0.9741847,0.0019928678,0.011513652],"study_design_scores_gemma":[0.002410281,0.000051159757,0.15383552,0.00020104961,0.000006859034,0.000007153227,0.024611853,0.12552679,0.0011383989,0.040973805,0.6503444,0.00089277944],"about_ca_topic_score_codex":0.0028907766,"about_ca_topic_score_gemma":0.034266453,"teacher_disagreement_score":0.93321085,"about_ca_system_score_codex":0.00004507873,"about_ca_system_score_gemma":0.00003434395,"threshold_uncertainty_score":0.9993018},"labels":[],"label_agreement":null},{"id":"W2311001255","doi":"10.1287/opre.2016.1483","title":"Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Robust optimization; Newsvendor model; Linear programming; Piecewise linear function; Mathematics; Computer science; Semidefinite programming; Optimization problem; Column generation; Set (abstract data type); Norm (philosophy)","score_opus":0.19865479882426987,"score_gpt":0.4180923603225724,"score_spread":0.21943756149830254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311001255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05787945,0.00003317922,0.9367047,0.0014682555,0.000046372697,0.0008794746,0.000043936187,0.000017754981,0.002926876],"genre_scores_gemma":[0.94961095,0.00019319318,0.0391025,0.000016229063,0.00006884945,0.00027799167,0.000042277316,0.000020059299,0.010667945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687046,0.0003105112,0.0006482939,0.0003952692,0.001555093,0.0002203538],"domain_scores_gemma":[0.9949067,0.00032751652,0.00009449829,0.0007588731,0.0037707377,0.00014162321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002940876,0.00009189702,0.00019101861,0.0009151853,0.00026620962,0.00007103087,0.0004282488,0.00007537991,0.00041119583],"category_scores_gemma":[0.001353449,0.00005402842,0.000041175204,0.0029968987,0.00022488633,0.00051798834,0.00009277921,0.00009481349,0.00017983426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047996724,0.00009509067,0.0052681207,0.0000035842859,0.000009131181,1.4312737e-7,0.00032305124,0.9733946,0.0056618922,0.0015360122,0.0017684791,0.011891948],"study_design_scores_gemma":[0.0010601637,0.00089800666,0.002991813,0.0001209435,0.000018946295,0.0000044194176,0.00092513993,0.9627519,0.012301927,0.00041124158,0.018258564,0.00025691855],"about_ca_topic_score_codex":0.00026728897,"about_ca_topic_score_gemma":0.00063624297,"teacher_disagreement_score":0.8976022,"about_ca_system_score_codex":0.00005763188,"about_ca_system_score_gemma":0.00033721916,"threshold_uncertainty_score":0.4502306},"labels":[],"label_agreement":null},{"id":"W2311766507","doi":"10.1287/opre.2016.1484","title":"Rate-Based Daily Arrival Process Models with Application to Call Centers","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Statistics; Poisson distribution; Sample (material); Estimation; Mathematics","score_opus":0.03866242244906953,"score_gpt":0.33563072899507224,"score_spread":0.2969683065460027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311766507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15147965,0.0000039750535,0.83475524,0.008046218,0.000016651686,0.000634346,0.000005637722,0.00009445892,0.0049638506],"genre_scores_gemma":[0.9958584,8.979088e-7,0.0014950394,0.000598389,0.00019766056,0.0004414407,0.00002996278,0.000027888816,0.0013503209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998681,0.00004198248,0.00015507828,0.0003749578,0.00042008364,0.00032687385],"domain_scores_gemma":[0.99854624,0.0000763445,0.000021482932,0.00041522365,0.0009090335,0.00003165049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958324,0.00010669836,0.00010793615,0.00044095668,0.0004891325,0.0002833255,0.0003393848,0.000032200885,0.00012005342],"category_scores_gemma":[0.0002127057,0.00006932255,0.00002567433,0.0012076779,0.000096842945,0.0012460316,0.000074222684,0.00010853752,0.0006441119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003186391,0.000141248,0.00060467824,0.00004977399,0.000029140963,0.0000045824427,0.00007417942,0.85622567,0.021531055,0.11281777,0.0006696487,0.007533622],"study_design_scores_gemma":[0.0013819898,0.00006054075,0.00037712738,0.00013831367,0.000037392918,6.4942543e-7,0.00035802514,0.96564496,0.0050109825,0.016218444,0.010309538,0.0004620183],"about_ca_topic_score_codex":0.00027032942,"about_ca_topic_score_gemma":0.00082879374,"teacher_disagreement_score":0.84437877,"about_ca_system_score_codex":0.00008583842,"about_ca_system_score_gemma":0.000078107885,"threshold_uncertainty_score":0.827897},"labels":[],"label_agreement":null},{"id":"W2367690866","doi":"10.1287/opre.2016.1495","title":"Robust Control of Partially Observable Failing Systems","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Bellman equation; Computer science; Mathematical optimization; Convexity; Bayesian probability; Dynamic programming; Robust optimization; Optimal decision; Mathematics; Economics; Artificial intelligence; Decision tree","score_opus":0.08018216973207601,"score_gpt":0.29227203387472833,"score_spread":0.21208986414265232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2367690866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060986083,0.00033421078,0.932763,0.0007254868,0.00022781309,0.00057922426,0.000030841955,0.00009702646,0.00425636],"genre_scores_gemma":[0.9962468,0.00023462845,0.0016022479,0.0000027002473,0.000053247713,0.00010334591,0.000004079959,0.000013366208,0.0017395508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991243,0.00009369711,0.00021257218,0.00011087164,0.00022815226,0.00023040682],"domain_scores_gemma":[0.999105,0.00013606544,0.0000051321204,0.00024392495,0.00046096047,0.00004893325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008016174,0.000052910334,0.00010758046,0.00008078368,0.00010653244,0.00005952542,0.00012107548,0.00005471593,0.0000971212],"category_scores_gemma":[0.00031963328,0.000036811234,0.000022744354,0.00022430993,0.00006973769,0.00025588484,0.000015132922,0.000085809435,0.000065649074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052549617,0.000012727451,0.00018676597,0.000034877783,0.000010535393,4.3825696e-7,0.000046202225,0.95456064,0.03867494,0.0052928454,0.00045061455,0.00072414026],"study_design_scores_gemma":[0.000334776,0.000034465207,0.00014024577,0.000082245875,0.0000025817737,7.793366e-7,0.00008490798,0.9914584,0.0052411314,0.000030811592,0.002531235,0.00005838793],"about_ca_topic_score_codex":0.000112812326,"about_ca_topic_score_gemma":0.00011425459,"teacher_disagreement_score":0.9352608,"about_ca_system_score_codex":0.00007494567,"about_ca_system_score_gemma":0.00006085859,"threshold_uncertainty_score":0.15011185},"labels":[],"label_agreement":null},{"id":"W2372440949","doi":"10.1287/opre.2016.1509","title":"Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Microsoft Research; National Science Foundation","keywords":"Mathematical proof; Competitive equilibrium; Characterization (materials science); Mathematical economics; Constructive; Matching (statistics); Point (geometry); Perfect competition; Complete lattice; Competition (biology); Economics; Mathematics; Computer science; Microeconomics","score_opus":0.09652070557818943,"score_gpt":0.3410041735002537,"score_spread":0.24448346792206427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2372440949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88204545,0.000069864545,0.0040784585,0.0010268092,0.00011119051,0.0003085683,0.00011101424,0.00002409995,0.11222457],"genre_scores_gemma":[0.9776728,0.0000104175015,0.00050247106,0.000020592264,0.00010876491,0.00010037782,0.000013136266,0.00001614599,0.021555256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99850917,0.00028490924,0.0003733191,0.0003784225,0.0000772837,0.00037690415],"domain_scores_gemma":[0.9991033,0.000319238,0.000029602877,0.00036388673,0.000107536405,0.00007645513],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003195215,0.00009247771,0.00020538892,0.000343769,0.00030124135,0.0001436212,0.00018655446,0.00004073683,0.0016273466],"category_scores_gemma":[0.0003362512,0.00007248348,0.000033677363,0.00044597438,0.00015566385,0.00035144555,0.00007807068,0.0002186225,0.0012239466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008037546,0.00009605536,0.03805445,0.000009357391,0.000022140757,0.0000058741994,0.00049652107,0.00025461416,0.001820747,0.9584291,0.00021994016,0.0005108091],"study_design_scores_gemma":[0.011698473,0.0007081546,0.7225385,0.0010918651,0.000010690032,0.0000899082,0.0049852193,0.060528073,0.0020764573,0.12886477,0.06561727,0.0017906434],"about_ca_topic_score_codex":0.0014296952,"about_ca_topic_score_gemma":0.003427423,"teacher_disagreement_score":0.82956433,"about_ca_system_score_codex":0.00013990054,"about_ca_system_score_gemma":0.000066715234,"threshold_uncertainty_score":0.99955374},"labels":[],"label_agreement":null},{"id":"W2410106254","doi":"10.1287/opre.2016.1499","title":"Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Queueing theory; Server; Staffing; Process (computing); Service (business); Real-time computing; Distributed computing; Computer network; Operating system","score_opus":0.04115734453721014,"score_gpt":0.31670431190014675,"score_spread":0.2755469673629366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410106254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94402176,0.00036433022,0.051869225,0.0011500573,0.0000348281,0.0005081155,0.0000010189253,0.000051738305,0.0019989498],"genre_scores_gemma":[0.9985989,0.000021657374,0.00045330747,0.00009044408,0.00018430004,0.00011149597,0.0000022929578,0.000020234753,0.0005173741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.000096881515,0.00014747033,0.00028946137,0.00034289656,0.000289042],"domain_scores_gemma":[0.9987998,0.00025174447,0.00001496941,0.00021149243,0.00070733024,0.000014683725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012190405,0.00010233054,0.00014592012,0.00033971557,0.00037299976,0.000397869,0.0001376583,0.000040241965,0.000019888532],"category_scores_gemma":[0.00037754758,0.00006616369,0.000011756065,0.0011334406,0.000053825042,0.0015538913,0.00014313402,0.00015615246,0.00011053953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015166787,0.000042108382,0.0026846726,0.00015416903,0.00003861946,0.000024782932,0.00018302776,0.87817687,0.004042123,0.112397805,0.000024917299,0.0020792596],"study_design_scores_gemma":[0.00047111252,0.00001379906,0.00017403367,0.00060894416,0.000010738958,0.0000010826152,0.0006520866,0.9960048,0.00007444738,0.0016839235,0.00017583458,0.00012916661],"about_ca_topic_score_codex":0.0049556,"about_ca_topic_score_gemma":0.007793,"teacher_disagreement_score":0.11782799,"about_ca_system_score_codex":0.00011304417,"about_ca_system_score_gemma":0.000055033648,"threshold_uncertainty_score":0.7491418},"labels":[],"label_agreement":null},{"id":"W2555169043","doi":"10.1287/opre.2018.1728","title":"Vector Space Decomposition for Solving Large-Scale Linear Programs","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Scale (ratio); Mathematics; Space (punctuation); Computer science; Mathematical optimization; Geography; Cartography","score_opus":0.1455778524276668,"score_gpt":0.5040118269124058,"score_spread":0.35843397448473896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555169043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017305579,0.00003348212,0.9752764,0.002153986,0.00012493243,0.002433607,0.00004934318,0.00016490679,0.0024577454],"genre_scores_gemma":[0.075192615,0.000025800833,0.9091544,0.000030280495,0.0008306718,0.0010443293,0.00015334974,0.00008016769,0.013488339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975457,0.00018934684,0.0002972826,0.0004207931,0.00076620246,0.00078065624],"domain_scores_gemma":[0.9959335,0.00049574993,0.000021817737,0.0005170103,0.0028457881,0.0001861789],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019174475,0.00013443384,0.00017439859,0.00030374515,0.0016097769,0.00028265265,0.00032719754,0.0001175598,0.00053284096],"category_scores_gemma":[0.001717894,0.00012754896,0.00006677859,0.000915309,0.00025655705,0.0003788786,0.00018654318,0.00035867022,0.00030685792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010495912,0.00865045,0.00081719575,0.0011175023,0.00044702773,0.000032275362,0.026703048,0.020353753,0.11713475,0.6842357,0.07884958,0.06060912],"study_design_scores_gemma":[0.00089791365,0.0005629374,0.000023787727,0.000061139275,0.0000071704194,0.0000064509486,0.0009262818,0.9555349,0.01752693,0.0053368416,0.018912986,0.00020269441],"about_ca_topic_score_codex":0.00002229492,"about_ca_topic_score_gemma":0.00073129375,"teacher_disagreement_score":0.93518114,"about_ca_system_score_codex":0.0002019634,"about_ca_system_score_gemma":0.00023929332,"threshold_uncertainty_score":0.99969},"labels":[],"label_agreement":null},{"id":"W2564145587","doi":"10.1287/opre.2016.1549","title":"0/1 Polytopes with Quadratic Chvátal Rank","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Polytope; Rank (graph theory); Combinatorics; Closure (psychology); Mathematics; Quadratic equation; Mathematical optimization; Geometry; Economics","score_opus":0.08095007451776011,"score_gpt":0.3601140009281967,"score_spread":0.2791639264104366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564145587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04734139,0.00010474253,0.9251584,0.016161956,0.00011918841,0.0003633027,0.000007645129,0.00013535967,0.01060806],"genre_scores_gemma":[0.9425698,0.000032714695,0.04925945,0.000081226295,0.00010014786,0.00008637033,0.0000014600429,0.0000081517765,0.0078607015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839836,0.00019658012,0.00012574361,0.00032182192,0.00059331866,0.00036417056],"domain_scores_gemma":[0.9987268,0.00021661234,0.0000061671167,0.0006417649,0.00030063966,0.00010805067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006450487,0.00007977088,0.00008837296,0.00023761138,0.000670295,0.00042651637,0.000854508,0.00003035589,0.0002203579],"category_scores_gemma":[0.00010317701,0.00004487917,0.000027396762,0.0008511173,0.00025340446,0.0007238608,0.00025031145,0.00015582214,0.0004316853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011252872,0.00013013736,0.00027300793,0.000005910139,0.00002124923,0.00002786133,0.0006174375,0.00009553278,0.007082157,0.8825418,0.0018701985,0.10732348],"study_design_scores_gemma":[0.0115718,0.006194914,0.032128032,0.001139915,0.000026321026,0.00077795127,0.0013695494,0.49962446,0.11654112,0.1126966,0.2143939,0.00353543],"about_ca_topic_score_codex":0.0001453464,"about_ca_topic_score_gemma":0.0004951979,"teacher_disagreement_score":0.8952284,"about_ca_system_score_codex":0.000040601502,"about_ca_system_score_gemma":0.00022555797,"threshold_uncertainty_score":0.5548585},"labels":[],"label_agreement":null},{"id":"W2581793543","doi":"10.1287/opre.2017.1660","title":"Robust Defibrillator Deployment Under Cardiac Arrest Location Uncertainty via Row-and-Column Generation","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Sudden cardiac arrest; Automated external defibrillator; Software deployment; Column generation; Computer science; Event (particle physics); Medicine; Mathematical optimization; Internal medicine; Cardiopulmonary resuscitation; Mathematics; Emergency medicine; Resuscitation","score_opus":0.33728593895259956,"score_gpt":0.5044038209829741,"score_spread":0.16711788203037453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581793543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84276974,0.0006994437,0.10788831,0.030648492,0.003004381,0.0051482436,0.00008429114,0.00018681384,0.009570305],"genre_scores_gemma":[0.9828565,0.0006176199,0.008659142,0.0003261935,0.001418962,0.0009354088,0.0003361622,0.00005283849,0.0047971816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584234,0.0015348895,0.00063660566,0.00060140144,0.00067865144,0.0007061334],"domain_scores_gemma":[0.99583346,0.00024359272,0.00008883345,0.0011235415,0.0023793404,0.00033122196],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034499848,0.00019137992,0.00028689852,0.00023314935,0.015360473,0.00060362247,0.00028250818,0.00033325353,0.0002172867],"category_scores_gemma":[0.0011908831,0.0001810983,0.00004661886,0.00032163248,0.0002358259,0.00072144694,0.00024130016,0.00083125295,0.0004144532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005214234,0.00014708619,0.021516811,0.00018185774,0.000093610695,0.000002235586,0.003187931,0.8932317,0.008406558,0.0499284,0.012431872,0.01081982],"study_design_scores_gemma":[0.00084414124,0.00015452958,0.025487736,0.00017926225,0.000026901003,0.0000016536612,0.002090904,0.955754,0.00024912355,0.00019462602,0.014620627,0.0003965056],"about_ca_topic_score_codex":0.010244686,"about_ca_topic_score_gemma":0.017013498,"teacher_disagreement_score":0.14008677,"about_ca_system_score_codex":0.0006105466,"about_ca_system_score_gemma":0.0015540654,"threshold_uncertainty_score":0.9963462},"labels":[],"label_agreement":null},{"id":"W2583727039","doi":"10.1287/opre.2016.1569","title":"Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Ranking (information retrieval); Revenue; Computer science; Relevance (law); Quality (philosophy); Term (time); Function (biology); Simple (philosophy); Endogeneity; Order (exchange); Value (mathematics); Operations research; Mathematical optimization; Econometrics; Information retrieval; Mathematics; Economics; Machine learning","score_opus":0.20782519948124215,"score_gpt":0.4310504833570914,"score_spread":0.22322528387584925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583727039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883542,0.000028640801,0.0011637929,0.002760022,0.00013744395,0.0008550204,0.000056675715,0.000040376108,0.0066038254],"genre_scores_gemma":[0.9938755,0.000018216142,0.002342134,0.00021605131,0.00035387787,0.00011086577,0.00013772106,0.000031516003,0.0029141316],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99858356,0.000020593234,0.00022969762,0.00031888796,0.00042919506,0.00041807062],"domain_scores_gemma":[0.99810094,0.00021487653,0.00007223178,0.00055443845,0.0010354988,0.000022035472],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020812184,0.00013005912,0.00019378228,0.00028265838,0.0031996996,0.0015873031,0.00037161913,0.000059275182,0.00008805013],"category_scores_gemma":[0.0011955602,0.00010681734,0.000056295918,0.00021081413,0.00026595595,0.0014017719,0.000225548,0.00031397442,0.00006730349],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003319166,0.0013776951,0.32146677,0.0013348872,0.0005143811,0.000187713,0.002244999,0.00059150043,0.028304223,0.12320573,0.014212032,0.5032409],"study_design_scores_gemma":[0.012801585,0.00017148655,0.6379169,0.0011057031,0.0003580583,0.000029093875,0.0059773377,0.035812583,0.0021548816,0.002983893,0.2987111,0.0019773939],"about_ca_topic_score_codex":0.0063911667,"about_ca_topic_score_gemma":0.014493732,"teacher_disagreement_score":0.5012635,"about_ca_system_score_codex":0.00003726445,"about_ca_system_score_gemma":0.000100743826,"threshold_uncertainty_score":0.99944913},"labels":[],"label_agreement":null},{"id":"W2596292818","doi":"10.1287/opre.2016.1578","title":"The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tel Aviv University; Government of Ontario","keywords":"Unobservable; Computer science; Queue; Revenue; Join (topology); Valuation (finance); Operations research; Mathematical optimization; Microeconomics; Econometrics; Economics; Mathematics; Computer network; Finance","score_opus":0.09270631862722876,"score_gpt":0.40285870037742794,"score_spread":0.31015238175019916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596292818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893482,0.000014956337,0.000013454191,0.005216881,0.000027361508,0.00021630387,0.000006751505,0.0000100094485,0.0051461365],"genre_scores_gemma":[0.9988613,0.000005339891,0.0000108036875,0.000014673106,0.00021179707,0.00002945252,0.000009247189,0.0000104728815,0.00084688264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992449,0.0000671366,0.00013769105,0.00014990114,0.00021397986,0.00018638729],"domain_scores_gemma":[0.9992982,0.000065461645,0.000049967428,0.000321391,0.00025891094,0.0000060554116],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011627317,0.00006325643,0.00009802692,0.00021095751,0.0019082268,0.0006729977,0.0002477043,0.000038225055,0.00004279557],"category_scores_gemma":[0.0009198161,0.000046011763,0.000043943757,0.00026979376,0.0002473769,0.00082144834,0.00018906106,0.00020898016,0.000022423397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011386675,0.00089011213,0.055584732,0.00017444379,0.0002155775,0.000030752755,0.0011964771,0.05265559,0.033275094,0.8012255,0.0063371225,0.047275968],"study_design_scores_gemma":[0.003235828,0.00028141556,0.71917355,0.00028285562,0.000058025656,0.0000034993425,0.00337055,0.21238759,0.0014594643,0.028061263,0.030960385,0.000725596],"about_ca_topic_score_codex":0.004266962,"about_ca_topic_score_gemma":0.010366066,"teacher_disagreement_score":0.7731642,"about_ca_system_score_codex":0.00009561448,"about_ca_system_score_gemma":0.000022983884,"threshold_uncertainty_score":0.99939114},"labels":[],"label_agreement":null},{"id":"W2601832346","doi":"10.1287/opre.2016.1574","title":"Managing Patient Admissions in a Neurology Ward","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Neurology; Medicine; Emergency department; Patient care; Medical emergency; Nursing; Psychiatry","score_opus":0.3199740043935249,"score_gpt":0.5898453681328765,"score_spread":0.26987136373935156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601832346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7949839,0.000085138534,0.0019915996,0.13810784,0.0007095388,0.002170281,0.000021373899,0.000064790016,0.061865497],"genre_scores_gemma":[0.9898849,0.0002582975,0.003561852,0.0009650907,0.00017060863,0.00072225445,0.000038358103,0.000025106947,0.004373532],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964306,0.0015953897,0.000511811,0.00037337973,0.0003755303,0.00071331405],"domain_scores_gemma":[0.99770904,0.00029015078,0.00004073139,0.0009566601,0.00070822705,0.00029520117],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022307462,0.00010086791,0.00017363233,0.0004208195,0.009165833,0.00016403268,0.00039493162,0.00021508482,0.0013198747],"category_scores_gemma":[0.003974287,0.00009028069,0.000027926237,0.00028611044,0.000102017424,0.0003803714,0.0003354682,0.0015664124,0.00060645066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005435801,0.0013887282,0.28954014,0.000431978,0.00006111731,0.0004105468,0.05774696,0.24670067,0.0038980315,0.19245371,0.036289707,0.17053483],"study_design_scores_gemma":[0.0021773255,0.0005975903,0.111077406,0.00047219876,0.0000060362554,0.000008227561,0.006566522,0.77486384,0.00009305324,0.001700963,0.10197507,0.00046179543],"about_ca_topic_score_codex":0.005667247,"about_ca_topic_score_gemma":0.015011574,"teacher_disagreement_score":0.52816314,"about_ca_system_score_codex":0.00014941383,"about_ca_system_score_gemma":0.001365015,"threshold_uncertainty_score":0.9995931},"labels":[],"label_agreement":null},{"id":"W2604266952","doi":"10.1287/opre.2016.1586","title":"On Integral Policies in Deterministic and Stochastic Distribution Systems","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Upstream (networking); Downstream (manufacturing); Computer science; Product (mathematics); Mathematical optimization; Operations research; Economies of scale; Scale (ratio); Distribution (mathematics); Inventory control; Economics; Mathematics; Operations management; Microeconomics","score_opus":0.11199265230175456,"score_gpt":0.37574951228557446,"score_spread":0.2637568599838199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604266952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9719487,0.000041483843,0.0009326493,0.0028548727,0.0003650273,0.00069608015,0.0000122298,0.000029557215,0.02311939],"genre_scores_gemma":[0.9976994,0.000005100327,0.0000038571575,0.00008277152,0.0002964343,0.00012125869,0.00004662492,0.0000084046505,0.0017361525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911964,0.000026663343,0.00013927507,0.00018926988,0.00027382703,0.00025132718],"domain_scores_gemma":[0.99946296,0.000048110083,0.00002056763,0.0003302596,0.00012472855,0.000013383567],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007275649,0.0000783444,0.000092242604,0.00027523257,0.0010115645,0.0020609545,0.00025354698,0.000032670145,0.000053506494],"category_scores_gemma":[0.0008512734,0.00006777124,0.0000142674735,0.0001302846,0.00017166587,0.000564169,0.00024166997,0.00017090426,0.00019977003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034537396,0.00012782057,0.0024464692,0.00010876245,0.000009524546,0.00001693742,0.00012831236,0.008251108,0.00009829555,0.97861725,0.0066698603,0.0034910974],"study_design_scores_gemma":[0.00087553513,0.00006948264,0.082545266,0.00027569686,0.000010005205,0.0000018828039,0.0017747268,0.8973932,0.0000067424003,0.0028306213,0.0139607,0.00025608877],"about_ca_topic_score_codex":0.0044655493,"about_ca_topic_score_gemma":0.0013870063,"teacher_disagreement_score":0.9757866,"about_ca_system_score_codex":0.00007396254,"about_ca_system_score_gemma":0.000017888115,"threshold_uncertainty_score":0.998975},"labels":[],"label_agreement":null},{"id":"W2657813347","doi":"10.1287/opre.2017.1608","title":"Product Portfolio Management with Production Flexibility in Agribusiness","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Production (economics); Profit (economics); Flexibility (engineering); Agribusiness; Portfolio; Profitability index; Computer science; Raw material; Microeconomics; Product (mathematics); Industrial organization; Economics; Business; Operations research; Mathematics; Agriculture","score_opus":0.12547456536150742,"score_gpt":0.365974699849246,"score_spread":0.2405001344877386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2657813347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7375525,0.000041049934,0.00012185418,0.012109767,0.0005356801,0.0022746653,0.0000012534852,0.00008830818,0.24727489],"genre_scores_gemma":[0.97998255,0.000029116014,0.00037208886,0.00013729569,0.0009247823,0.00043458823,0.000041748768,0.000024149458,0.018053649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978674,0.000037424314,0.00025040904,0.00065325946,0.00072157296,0.0004699561],"domain_scores_gemma":[0.9980018,0.0000066437756,0.00004800063,0.0013813222,0.00054506306,0.000017150807],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023633235,0.0001532702,0.00015053699,0.0006877092,0.0014919976,0.0015796045,0.0006400168,0.000031699525,0.00049390836],"category_scores_gemma":[0.00028421363,0.0001249924,0.00002748657,0.00073697406,0.00026443615,0.0024393336,0.0005365018,0.00025547793,0.00041945832],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075446465,0.0037717766,0.3035656,0.0023191238,0.0002477565,0.00047325427,0.0004428233,0.038392875,0.0014168145,0.42275804,0.1115917,0.1142658],"study_design_scores_gemma":[0.0016704028,0.000044548462,0.69627064,0.00030926263,0.000036917812,0.0000050171957,0.0016003237,0.013706385,0.000592387,0.0023321544,0.2827772,0.00065475766],"about_ca_topic_score_codex":0.002586474,"about_ca_topic_score_gemma":0.004775627,"teacher_disagreement_score":0.42042586,"about_ca_system_score_codex":0.00013328776,"about_ca_system_score_gemma":0.00004238061,"threshold_uncertainty_score":0.99980795},"labels":[],"label_agreement":null},{"id":"W2725132273","doi":"10.1287/opre.2018.1817","title":"Dynamics of Drug Resistance: Optimal Control of an Infectious Disease","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Institute of Allergy and Infectious Diseases","keywords":"Outbreak; Disease; Infectious disease (medical specialty); Drug resistance; Transmission (telecommunications); Public health; Disease control; Resistance (ecology); Drug; Mathematical modelling of infectious disease; Antibiotic resistance; Medicine; Intensive care medicine; Environmental health; Virology; Biology; Computer science; Antibiotics; Pharmacology; Ecology; Microbiology","score_opus":0.02497615012072462,"score_gpt":0.3743885353787218,"score_spread":0.34941238525799717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725132273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96786344,0.00005126783,0.014277466,0.0037963442,0.000022763537,0.00046291543,0.000024500097,0.00000893884,0.013492334],"genre_scores_gemma":[0.99284095,0.000014420814,0.00093177945,0.00006709671,0.000017206394,0.000032514425,0.000030370378,0.0000057251737,0.0060599167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893284,0.0003027884,0.00026320646,0.00014345892,0.000176268,0.00018146174],"domain_scores_gemma":[0.998663,0.0005178819,0.000015111997,0.0002966374,0.000353188,0.00015418205],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014155444,0.00005116658,0.00027493274,0.0000922339,0.0000763114,0.0000037371187,0.00007668255,0.000069001544,0.0013458075],"category_scores_gemma":[0.0011016813,0.000037297857,0.000051922718,0.00014251318,0.00044583812,0.000054446733,0.000027470503,0.0002429588,0.00005908066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005149324,0.0004535098,0.0040357006,0.00020228313,0.000035770117,0.000004256921,0.000094265255,0.0027911342,0.00047371283,0.9912642,0.000053912852,0.00007628776],"study_design_scores_gemma":[0.0016107128,0.0004046155,0.0049493606,0.0000908576,0.000042528947,0.0000036817357,0.00014747244,0.94269115,0.0003658557,0.04957666,0.000050462004,0.00006663779],"about_ca_topic_score_codex":0.000023222388,"about_ca_topic_score_gemma":0.00008544035,"teacher_disagreement_score":0.9416876,"about_ca_system_score_codex":0.00002404529,"about_ca_system_score_gemma":0.00014814988,"threshold_uncertainty_score":0.9995671},"labels":[],"label_agreement":null},{"id":"W2735928715","doi":"10.1287/opre.2017.1613","title":"Nonlinear Accumulating Priority Queues with Equivalent Linear Proxies","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Western University","funders":"","keywords":"Queue; Computer science; Queueing theory; Class (philosophy); Nonlinear system; Mathematical optimization; Service (business); Priority queue; Power (physics); Operations research; Computer network; Mathematics","score_opus":0.13316252936454062,"score_gpt":0.4256130067872707,"score_spread":0.2924504774227301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735928715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97147125,0.000035157347,0.0019885015,0.0033478548,0.00007101559,0.0005526177,0.000004337291,0.00013305931,0.02239619],"genre_scores_gemma":[0.9856789,0.000008554503,0.008518128,0.00008848973,0.0013410815,0.00007451159,0.000030818,0.000034366585,0.004225143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833804,0.000045079938,0.00021461553,0.0003726677,0.00060854305,0.0004210355],"domain_scores_gemma":[0.9978187,0.00008487749,0.0000720423,0.00095494115,0.0010476338,0.000021812464],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016845672,0.0001418915,0.00018012134,0.00029208898,0.0039275493,0.0018025619,0.00067031686,0.000054033888,0.00026379782],"category_scores_gemma":[0.0020015235,0.000111448615,0.000049798084,0.00036026136,0.0003468406,0.0025916188,0.00044892367,0.00039660322,0.00045733983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080872065,0.0015853941,0.09406693,0.0009569408,0.0006060581,0.00023180104,0.0015200782,0.34480584,0.024927225,0.48524907,0.0015068917,0.043735046],"study_design_scores_gemma":[0.0007302904,0.000055402914,0.0028624767,0.0001861447,0.000055490804,0.0000025314066,0.0010194038,0.9624881,0.0019518145,0.002473129,0.027738193,0.00043698127],"about_ca_topic_score_codex":0.0013958408,"about_ca_topic_score_gemma":0.0026074878,"teacher_disagreement_score":0.61768234,"about_ca_system_score_codex":0.000054672466,"about_ca_system_score_gemma":0.00008223198,"threshold_uncertainty_score":0.99923366},"labels":[],"label_agreement":null},{"id":"W2740700989","doi":"10.1287/opre.2017.1632","title":"Screening Strategies for Patients on the Kidney Transplant Waiting List","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Renal Transplantation Outcomes and Treatments","field":"Medicine","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"","keywords":"Waiting list; Medicine; Kidney transplant; Renal transplant; Intensive care medicine; Emergency medicine; Kidney transplantation; Transplantation; Surgery","score_opus":0.18970800458316064,"score_gpt":0.44794471849305634,"score_spread":0.25823671390989567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740700989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425496,0.000014812953,0.002286698,0.017405272,0.00011312984,0.0021092044,0.0004023911,0.00002891976,0.03508998],"genre_scores_gemma":[0.9950188,0.00004426327,0.001002331,0.00024645537,0.00008157652,0.00021361407,0.00026456278,0.000013416799,0.0031150095],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990224,0.000057036566,0.00013762868,0.00016727818,0.00038318217,0.00023244176],"domain_scores_gemma":[0.99903923,0.00022151115,0.000015253076,0.00035005764,0.00026147297,0.000112468886],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003656255,0.000078902434,0.00010075572,0.00007106788,0.00242456,0.0004899964,0.00016218123,0.00003583392,0.0001221354],"category_scores_gemma":[0.00026599917,0.000045618555,0.00006358765,0.000049418144,0.00010265166,0.00017101254,0.000011841285,0.00018242552,0.000030731506],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002777763,0.002504506,0.49675184,0.0009335186,0.0011264246,0.00014703882,0.0068465583,0.0009540227,0.0061351075,0.44559968,0.007135681,0.029087856],"study_design_scores_gemma":[0.035868973,0.008242253,0.68041813,0.008170232,0.0005237242,0.000059469512,0.0064327074,0.19858168,0.023864174,0.0019564086,0.03476703,0.001115211],"about_ca_topic_score_codex":0.0003622161,"about_ca_topic_score_gemma":0.00013512545,"teacher_disagreement_score":0.44364327,"about_ca_system_score_codex":0.000025785801,"about_ca_system_score_gemma":0.00015070151,"threshold_uncertainty_score":0.9988741},"labels":[],"label_agreement":null},{"id":"W2753930878","doi":"10.1287/opre.2018.1825","title":"Exact First-Choice Product Line Optimization","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Mathematical optimization; Computer science; Exploit; Product (mathematics); Integer programming; Integer (computer science); Computation; Set (abstract data type); Product line; Optimization problem; Ranking (information retrieval); Line (geometry); Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.0720320964244561,"score_gpt":0.3290472654477125,"score_spread":0.2570151690232564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753930878","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35648656,0.00033031876,0.0061419294,0.03407566,0.0019401909,0.004939196,0.0000063736506,0.00043619427,0.5956436],"genre_scores_gemma":[0.9521615,0.00003945671,0.00089119177,0.00067884946,0.0017999237,0.00015618214,0.00017023468,0.000035469384,0.044067193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985133,0.000031432086,0.00019564992,0.0003653874,0.0005518941,0.00034237406],"domain_scores_gemma":[0.99892133,0.00005504604,0.000019074305,0.00048063378,0.000508332,0.000015587177],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001000488,0.00010834117,0.00010543164,0.00049480796,0.0005062804,0.0007793598,0.00031415923,0.0000356752,0.0079054255],"category_scores_gemma":[0.0004512758,0.00009870234,0.00003750959,0.0010035436,0.000046542893,0.0013688012,0.0002629796,0.0002054103,0.0052068774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021442042,0.00026180613,0.008028123,0.00022157124,0.000029532499,0.000003392461,0.00006966262,0.8932154,0.00041229164,0.028924128,0.06618913,0.0026234845],"study_design_scores_gemma":[0.00033530328,0.000024794104,0.0008747852,0.000027119098,0.0000056454282,2.6219024e-7,0.00015596843,0.5283471,0.0000801121,0.0000551463,0.469961,0.00013276875],"about_ca_topic_score_codex":0.0010889333,"about_ca_topic_score_gemma":0.00056746596,"teacher_disagreement_score":0.59567493,"about_ca_system_score_codex":0.00007945277,"about_ca_system_score_gemma":0.000037448142,"threshold_uncertainty_score":0.9955677},"labels":[],"label_agreement":null},{"id":"W2768676031","doi":"10.1287/opre.2020.2041","title":"Calibration of Distributionally Robust Empirical Optimization Models","year":2017,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India","keywords":"Robustness (evolution); Resampling; Sample size determination; Mathematics; Statistics; Econometrics; Mathematical optimization; Computer science","score_opus":0.5642433531899352,"score_gpt":0.5464717258657695,"score_spread":0.017771627324165706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768676031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006570741,0.00023817031,0.9751542,0.0036865762,0.00042859645,0.0009240248,0.00071831234,0.00003438987,0.012244959],"genre_scores_gemma":[0.9165817,0.0018346164,0.06805159,0.0000328005,0.00042307304,0.0002519163,0.0035601638,0.000041410254,0.00922271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99191916,0.001253473,0.0013322049,0.00096424186,0.0041386844,0.00039224344],"domain_scores_gemma":[0.9901489,0.00065245887,0.00030126644,0.0021793875,0.0065192785,0.00019868732],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00761357,0.00023996127,0.0005021476,0.00097615836,0.00132226,0.0022132103,0.0019605006,0.0005703196,0.00062117766],"category_scores_gemma":[0.0065524103,0.00019963644,0.00020375641,0.0008560604,0.00048147302,0.0012192777,0.0013320816,0.0009633475,0.000051067116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029012099,0.00012341475,0.00059113133,0.0000071246013,0.000019311832,0.000002330775,0.00030525282,0.97551733,0.000017497088,0.009220817,0.012556006,0.0016107549],"study_design_scores_gemma":[0.00017810927,0.000044813863,0.00037130667,0.000045514902,0.000011998998,0.0000023911184,0.000108898086,0.97952,0.00018020243,0.018317716,0.0010366976,0.00018235017],"about_ca_topic_score_codex":0.0005097643,"about_ca_topic_score_gemma":0.0002670987,"teacher_disagreement_score":0.910011,"about_ca_system_score_codex":0.00017583829,"about_ca_system_score_gemma":0.0023231197,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W2778922089","doi":"10.1287/opre.2019.1953","title":"Network-Based Approximate Linear Programming for Discrete Optimization","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Linear programming; Solver; Graph; Simple (philosophy); Discrete optimization; Stochastic programming; Optimization problem; Theoretical computer science; Algorithm; Mathematics","score_opus":0.13558696193492611,"score_gpt":0.3450257601634374,"score_spread":0.20943879822851127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778922089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012208874,0.00005897752,0.95622396,0.030596282,0.00019044413,0.002919741,0.000006707303,0.00024190272,0.008541111],"genre_scores_gemma":[0.74898547,0.000015176139,0.22004868,0.012336454,0.0103605855,0.0032934498,0.002007601,0.00016779333,0.0027847923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986415,0.000030897874,0.0002114575,0.00031492126,0.00036950517,0.0004317552],"domain_scores_gemma":[0.9992949,0.000039660572,0.000023172905,0.00018955307,0.00042362313,0.000029115687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085341936,0.00010956686,0.00011345325,0.00015100716,0.0007852609,0.00076715037,0.00026195034,0.000043222135,0.00040086397],"category_scores_gemma":[0.00031912135,0.00010146281,0.000055705936,0.0009160846,0.000064294836,0.0006375537,0.00015569026,0.00014623892,0.0001402129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047856895,0.0000438612,0.00019180945,0.00016890097,0.000011513863,0.000001375447,0.000036551526,0.95455647,0.000037669324,0.023454886,0.018832862,0.002616238],"study_design_scores_gemma":[0.00038893026,0.00003783824,0.0000064806873,0.000015343403,0.000008928915,2.973996e-8,0.00014352443,0.7845553,0.000021632493,0.000074455966,0.21464966,0.00009783958],"about_ca_topic_score_codex":0.00007803816,"about_ca_topic_score_gemma":0.000037504116,"teacher_disagreement_score":0.7477646,"about_ca_system_score_codex":0.000031361134,"about_ca_system_score_gemma":0.000041782543,"threshold_uncertainty_score":0.73976487},"labels":[],"label_agreement":null},{"id":"W2784052864","doi":"10.1287/opre.2019.1969","title":"Ambulance Emergency Response Optimization in Developing Countries","year":2020,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Grand Challenges Canada","keywords":"Emergency response; Emergency vehicle; Emergency medical services; Travel time; Routing (electronic design automation); Computer science; Vehicle routing problem; Transport engineering; Operations research; Medical emergency; Medicine; Engineering; Real-time computing; Computer network","score_opus":0.1510531713982814,"score_gpt":0.3811192627914298,"score_spread":0.23006609139314843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784052864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38837814,0.0010871926,0.19866705,0.37031507,0.004473122,0.006918226,0.00008467388,0.0007313448,0.029345173],"genre_scores_gemma":[0.9723809,0.0038243954,0.0102792485,0.0028597785,0.001448748,0.0016009415,0.0013385793,0.000107451975,0.006159961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707377,0.00019598109,0.00068172545,0.0007266794,0.0008621314,0.00045973904],"domain_scores_gemma":[0.99824005,0.000029809871,0.000030420786,0.00057491154,0.0011018817,0.000022944301],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027886885,0.00024490664,0.00026328574,0.001059291,0.00052408996,0.000727182,0.0006722924,0.00017303623,0.00224768],"category_scores_gemma":[0.001209192,0.00026981288,0.00006299846,0.0016633,0.00008094974,0.0007597945,0.0014821185,0.0007020086,0.0015121641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014980425,0.00005355797,0.0009445816,0.0005291016,0.000018701832,0.000008757275,0.00028097793,0.9423911,0.000028923316,0.04384514,0.011599498,0.0001498462],"study_design_scores_gemma":[0.00023138277,0.0000071476898,0.007202164,0.00013292713,0.000008377308,1.6557122e-7,0.00034162283,0.87172997,0.000013879172,0.00067353074,0.11930301,0.00035580032],"about_ca_topic_score_codex":0.00559033,"about_ca_topic_score_gemma":0.010934903,"teacher_disagreement_score":0.58400273,"about_ca_system_score_codex":0.0003065788,"about_ca_system_score_gemma":0.00040292693,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W2788490140","doi":"10.1287/opre.2017.1679","title":"A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Robust optimization; Mathematical optimization; Bounding overwatch; Computer science; Optimization problem; Queue; Convex optimization; Function (biology); Nonlinear system; Mathematics; Regular polygon","score_opus":0.4597327066755495,"score_gpt":0.5606816333251312,"score_spread":0.10094892664958172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788490140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5229822,0.00006744616,0.46407986,0.0012773213,0.0008060426,0.003854379,0.00003529269,0.000073224255,0.0068242685],"genre_scores_gemma":[0.9650631,0.000027036347,0.017764784,0.00005309912,0.00082086097,0.0007338046,0.000061369225,0.000020312107,0.015455664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962202,0.0007494157,0.00067893247,0.0005840336,0.0012810283,0.00048640583],"domain_scores_gemma":[0.99169165,0.0018397655,0.00007490384,0.0007322055,0.0055155205,0.00014596544],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011339294,0.0001255643,0.0001995383,0.00047954294,0.0033864847,0.0016024921,0.00029058784,0.00009928987,0.00077277346],"category_scores_gemma":[0.004714413,0.00010182937,0.00005683115,0.0022646983,0.00010782333,0.0015887571,0.000104669976,0.00021671702,0.0007479344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032488105,0.00074926636,0.016292362,0.0000025998213,0.00005136506,0.00005431298,0.0022672084,0.80509067,0.000063337204,0.00494619,0.1579719,0.012185909],"study_design_scores_gemma":[0.0008014841,0.0011783297,0.00077955204,0.000008856402,0.00002203968,0.0002456836,0.007590658,0.90488946,0.000028302646,0.0011213985,0.08319268,0.0001415436],"about_ca_topic_score_codex":0.0010522173,"about_ca_topic_score_gemma":0.012373577,"teacher_disagreement_score":0.44631508,"about_ca_system_score_codex":0.00012165455,"about_ca_system_score_gemma":0.00039568148,"threshold_uncertainty_score":0.99943393},"labels":[],"label_agreement":null},{"id":"W2795388653","doi":"10.1287/opre.2021.2212","title":"Shortfall Risk Models When Information on Loss Function Is Incomplete","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Function (biology); Complete information; Computer science; Risk analysis (engineering); Medicine; Economics; Mathematical economics","score_opus":0.27562440018042544,"score_gpt":0.44732016697909677,"score_spread":0.17169576679867132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795388653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50247556,0.00013229848,0.33616924,0.01021752,0.0014268782,0.002237758,0.0007884073,0.00016586711,0.14638644],"genre_scores_gemma":[0.98610723,0.00022719608,0.0015808912,0.0006681297,0.000098352524,0.00029801353,0.00024220753,0.000012373343,0.010765606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383706,0.0011391698,0.00063119084,0.00036650742,0.0036946805,0.00033138512],"domain_scores_gemma":[0.9973239,0.0004302408,0.00007105441,0.0008039184,0.0012470898,0.00012384611],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0069833566,0.000110999106,0.00014642441,0.0012348868,0.0030815923,0.0009803415,0.0007029673,0.00005755437,0.0047201016],"category_scores_gemma":[0.0008143596,0.000093485265,0.00007612407,0.0018980425,0.00008666441,0.0021659953,0.00037322272,0.00066699815,0.0017511655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009604409,0.00005772145,0.0007934774,5.067725e-7,0.000008794503,0.0000010798984,0.0025361483,0.83505857,0.000009531681,0.016900487,0.10746829,0.037069317],"study_design_scores_gemma":[0.0002447742,0.00026642627,0.000955653,0.0000014790457,0.0000036782774,0.0000033730785,0.0013077741,0.69938064,0.00002883299,0.03087864,0.2668297,0.000099054334],"about_ca_topic_score_codex":0.00089974405,"about_ca_topic_score_gemma":0.00015396629,"teacher_disagreement_score":0.48363164,"about_ca_system_score_codex":0.00018785412,"about_ca_system_score_gemma":0.0003282902,"threshold_uncertainty_score":0.99902606},"labels":[],"label_agreement":null},{"id":"W2801140890","doi":"10.1287/opre.2018.1811","title":"Plant Capacity and Attainability: Exploration and Remedies","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Psychology","score_opus":0.3779374026428861,"score_gpt":0.4870763867466522,"score_spread":0.1091389841037661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801140890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891646,0.00012901833,0.0012614214,0.006979944,0.00005331783,0.00028682748,0.0000094531715,0.0000126324185,0.0021027655],"genre_scores_gemma":[0.99496037,0.00006647619,0.0009058118,0.00004250702,0.00003081988,0.000021391077,0.0000053159683,0.0000041562707,0.00396314],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968283,0.00070077326,0.000303595,0.0004855028,0.0014564794,0.00022535962],"domain_scores_gemma":[0.9971574,0.001242031,0.000017512028,0.00053767825,0.00095458684,0.00009079142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008344737,0.00006812742,0.00015676852,0.00047995272,0.0006567586,0.0008278989,0.00023124728,0.000052254916,0.0002039048],"category_scores_gemma":[0.006493699,0.0000486705,0.000020601,0.0010471848,0.0004061229,0.00075623544,0.0002022657,0.0002206861,0.0002932022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001880277,0.00073035574,0.39519778,0.00012492952,0.00011824475,0.000026118227,0.05543847,0.039865304,0.10317886,0.26879334,0.022333581,0.114005014],"study_design_scores_gemma":[0.00068842975,0.0005015335,0.06147699,0.00005251653,0.00001540272,0.000027176024,0.022283847,0.8116183,0.0047955653,0.057145562,0.040968925,0.0004256926],"about_ca_topic_score_codex":0.00033001247,"about_ca_topic_score_gemma":0.0015466069,"teacher_disagreement_score":0.7717531,"about_ca_system_score_codex":0.00004397467,"about_ca_system_score_gemma":0.000083696206,"threshold_uncertainty_score":0.7983448},"labels":[],"label_agreement":null},{"id":"W2883470513","doi":"10.1287/opre.2018.1720","title":"Monotonicity of Optimal Contracts Without the First-Order Approach","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Law, Economics, and Judicial Systems","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; University of Southern California","keywords":"Monotonic function; Monotone polygon; Mathematical optimization; Constraint (computer-aided design); Order (exchange); Function (biology); Simple (philosophy); Moral hazard; Mathematics; Property (philosophy); Interval (graph theory); Mathematical economics; Computer science; Economics; Incentive; Combinatorics; Microeconomics","score_opus":0.09626905377919731,"score_gpt":0.3180259912671181,"score_spread":0.2217569374879208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883470513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6230326,0.00059996743,0.011173142,0.0022006691,0.00036495904,0.0011923355,0.00012092606,0.000023032915,0.36129233],"genre_scores_gemma":[0.9960311,0.00009829334,0.0013788164,0.00011083008,0.00045302734,0.0001324586,0.0000105265535,0.00001969023,0.0017652471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856097,0.000059771854,0.0005828604,0.00034620936,0.00007775687,0.00037245845],"domain_scores_gemma":[0.9988587,0.000087806315,0.000078171346,0.0005528723,0.00035029484,0.0000721635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002509134,0.00008424809,0.00031060848,0.0001685928,0.00076252397,0.0002000488,0.00046048977,0.00010434632,0.00040752176],"category_scores_gemma":[0.0003408911,0.00008422771,0.00006507752,0.00038051358,0.00077723194,0.00025004405,0.00011465064,0.00023843076,0.00081303954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053127114,0.00030833343,0.028592788,0.000025860458,0.00011909383,5.1462786e-7,0.0038540175,0.004886847,0.00008386535,0.9575571,0.0042163995,0.00030204956],"study_design_scores_gemma":[0.0021007734,0.00062449736,0.029450558,0.00003816071,0.00001110765,0.0000121658695,0.0018509419,0.69763374,0.0015863734,0.013490865,0.25255758,0.0006432148],"about_ca_topic_score_codex":0.0052931993,"about_ca_topic_score_gemma":0.0018014914,"teacher_disagreement_score":0.9440662,"about_ca_system_score_codex":0.000101048,"about_ca_system_score_gemma":0.00009446512,"threshold_uncertainty_score":0.99996495},"labels":[],"label_agreement":null},{"id":"W2884755476","doi":"10.1287/opre.2017.1717","title":"A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Renal Transplantation Outcomes and Treatments","field":"Medicine","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Probabilistic logic; Computer science; Complement (music); Random walk; Graph; Limit (mathematics); Mathematical optimization; Theoretical computer science; Mathematics; Statistics; Artificial intelligence; Chemistry","score_opus":0.11563832913532152,"score_gpt":0.42516497747076054,"score_spread":0.309526648335439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884755476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6261342,0.00021680552,0.02116642,0.0084253615,0.00023843323,0.0033136061,0.000111750334,0.00014163657,0.34025177],"genre_scores_gemma":[0.96888745,0.00006929002,0.014736536,0.0005812245,0.00015529907,0.00017956372,0.00015449773,0.000018011522,0.015218135],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987217,0.00009033251,0.00015051641,0.00026899346,0.00045475102,0.0003136692],"domain_scores_gemma":[0.9987951,0.000035270354,0.000004542361,0.0002925415,0.00046492464,0.0004076414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038152884,0.00008625896,0.00013823225,0.0004889137,0.00042560528,0.00008949029,0.00009291984,0.000043805256,0.00045425261],"category_scores_gemma":[0.00012345162,0.00006541034,0.000054031632,0.0010665655,0.00009304111,0.00008748466,0.000030061765,0.00015110939,0.0009458356],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003096729,0.01357571,0.4584626,0.0039267777,0.0043324227,0.0006661248,0.05502794,0.0015565822,0.14058189,0.16998759,0.08241247,0.06637318],"study_design_scores_gemma":[0.028971963,0.013624371,0.64819205,0.0038348385,0.0009457014,0.0011089357,0.0038061887,0.083413765,0.06386107,0.0010283526,0.14886546,0.0023473117],"about_ca_topic_score_codex":0.0002511447,"about_ca_topic_score_gemma":0.000067905625,"teacher_disagreement_score":0.3427532,"about_ca_system_score_codex":0.000068924564,"about_ca_system_score_gemma":0.00016422286,"threshold_uncertainty_score":0.99983203},"labels":[],"label_agreement":null},{"id":"W2901274057","doi":"10.1287/opre.2018.1756","title":"Exact Solution of the Evasive Flow Capturing Problem","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Traffic control and management","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Bilevel optimization; Law enforcement; Enforcement; Computer science; Flow network; Revenue; Flow (mathematics); Process (computing); Revenue management; Mathematical optimization; Operations research; Computer security; Business; Law; Optimization problem; Mathematics; Algorithm; Finance","score_opus":0.03332793387422662,"score_gpt":0.2968236532767957,"score_spread":0.2634957194025691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901274057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7404528,0.0007339456,0.047246534,0.005127141,0.0011233245,0.0033306496,0.0000383001,0.00039495304,0.20155233],"genre_scores_gemma":[0.9971251,0.000017150984,0.0010640387,0.0000051186635,0.0001108019,0.000061880266,0.00000187269,0.0000075626895,0.0016064576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939287,0.00004613096,0.0000944594,0.00007622771,0.00022179204,0.00016853424],"domain_scores_gemma":[0.9995796,0.000019875855,0.0000026309308,0.00020615029,0.00016969713,0.000022040886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030925884,0.00003999573,0.000045744357,0.0000680299,0.00021204313,0.000036749374,0.00014482318,0.000021598113,0.00008804177],"category_scores_gemma":[0.0000340412,0.000028419281,0.000022787748,0.00022576863,0.00007496696,0.00007219501,0.00006453505,0.000116026284,0.00008617557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007511516,0.000048391164,0.00004614657,0.0000759727,0.00006705523,8.54941e-7,0.0023508957,0.8699666,0.06446873,0.0041031423,0.01244088,0.046423774],"study_design_scores_gemma":[0.0003234727,0.000060395494,0.0046329056,0.000050768547,0.000007973197,0.000001244535,0.0002511115,0.95952165,0.012043967,0.00009222981,0.022928754,0.00008551592],"about_ca_topic_score_codex":0.00011749443,"about_ca_topic_score_gemma":0.0018381926,"teacher_disagreement_score":0.2566723,"about_ca_system_score_codex":0.000055460732,"about_ca_system_score_gemma":0.00003154191,"threshold_uncertainty_score":0.16308858},"labels":[],"label_agreement":null},{"id":"W2901514607","doi":"10.1287/opre.2018.1736","title":"Technical Note—Closed-Form Solutions for Worst-Case Law Invariant Risk Measures with Application to Robust Portfolio Optimization","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"CVAR; Spectral risk measure; Portfolio; Value at risk; Expected shortfall; Invariant (physics); Mathematics; Risk measure; Portfolio optimization; Dynamic risk measure; Stochastic dominance; Coherent risk measure; Class (philosophy); Mathematical optimization; Risk management; Computer science; Econometrics; Economics","score_opus":0.17700525950768378,"score_gpt":0.43664414526065204,"score_spread":0.25963888575296823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901514607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019116868,0.000028615787,0.9825305,0.0020874054,0.000102823986,0.0026658175,0.00015130617,0.00009711692,0.010424764],"genre_scores_gemma":[0.6756152,0.000116823976,0.32066527,0.00015059202,0.00041805106,0.0012784592,0.00013663255,0.000040486433,0.0015785061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950567,0.00047914995,0.00082867587,0.00092361006,0.0019551085,0.00075677637],"domain_scores_gemma":[0.9916604,0.00073333614,0.00011023739,0.0013024773,0.0058028586,0.00039070132],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009720248,0.00021291751,0.00027577,0.0009690037,0.0043383483,0.0011725571,0.000731909,0.0002207106,0.00026287773],"category_scores_gemma":[0.0037659886,0.0001588192,0.000085606094,0.004006883,0.0005199913,0.00093990745,0.00023870605,0.00037253456,0.0004025499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016866293,0.00017157747,0.000115476345,0.0000013183669,0.0000102368895,0.000009333,0.00039042076,0.91305727,0.00038370615,0.04519045,0.010235841,0.030265722],"study_design_scores_gemma":[0.00059950975,0.00080423674,0.00019134306,0.0000152437015,0.00003086933,0.00016833095,0.00049168454,0.95146906,0.000627646,0.0020545954,0.043258335,0.00028911344],"about_ca_topic_score_codex":0.0019746984,"about_ca_topic_score_gemma":0.027347472,"teacher_disagreement_score":0.6737035,"about_ca_system_score_codex":0.00021747101,"about_ca_system_score_gemma":0.00057312055,"threshold_uncertainty_score":0.99986434},"labels":[],"label_agreement":null},{"id":"W2910327885","doi":"10.1287/opre.2018.1760","title":"On the Relationship Between Quantity Precommitment and Cournot Games","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Precommitment; Cournot competition; Economics; Microeconomics; Supply and demand; Competition (biology); Collusion; Independence (probability theory); Mathematical economics; Mathematics","score_opus":0.2129063993193161,"score_gpt":0.3688137170766243,"score_spread":0.1559073177573082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910327885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9307753,0.000035671306,0.000114633825,0.011964183,0.00011670972,0.0008357187,0.0000025763457,0.00003054571,0.056124676],"genre_scores_gemma":[0.98733836,0.000006777675,0.000036606798,0.0006730537,0.00024002169,0.00009231042,0.000022643038,0.000012014432,0.011578237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988861,0.00008316502,0.0001453171,0.00021656207,0.00044598663,0.00022284476],"domain_scores_gemma":[0.9988878,0.00060005806,0.00001651501,0.00034730896,0.0001356238,0.000012735731],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017723554,0.00008230538,0.00008316705,0.0002519285,0.0007110582,0.0007263303,0.00022737357,0.00003522832,0.0014824818],"category_scores_gemma":[0.00044793796,0.000056583453,0.000026590022,0.00040112,0.00008238139,0.00047480586,0.00016420851,0.0002840485,0.0028354144],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006702777,0.000044202072,0.32091767,0.000033315566,0.000013586498,4.48204e-7,0.000057243993,0.00025948265,0.000013875799,0.65261114,0.025418123,0.0006242264],"study_design_scores_gemma":[0.000678404,0.00008237554,0.7603102,0.00010375224,0.000020815678,2.9642334e-7,0.0016413882,0.020859491,0.000047533733,0.01903755,0.19695228,0.00026595287],"about_ca_topic_score_codex":0.00042250202,"about_ca_topic_score_gemma":0.0002273676,"teacher_disagreement_score":0.6335736,"about_ca_system_score_codex":0.00004408786,"about_ca_system_score_gemma":0.00001904315,"threshold_uncertainty_score":0.9994303},"labels":[],"label_agreement":null},{"id":"W2910417781","doi":"10.1287/opre.2018.1789","title":"Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005)","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Convexity; Order (exchange); Computer science; Mathematical optimization; Integer (computer science); Property (philosophy); Mathematical economics; Mathematics; Economics","score_opus":0.04942121926062811,"score_gpt":0.33858774374732514,"score_spread":0.28916652448669705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910417781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5201814,0.000637816,0.30858925,0.046386205,0.0014030056,0.022987613,0.000049024973,0.00046063476,0.09930503],"genre_scores_gemma":[0.9924826,0.000018704497,0.002674688,0.000788233,0.00012693863,0.00063903985,0.00024782997,0.00003988366,0.0029820907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980589,0.00009829078,0.00034907655,0.00044073624,0.0005325409,0.00052041415],"domain_scores_gemma":[0.9991132,0.000076364864,0.000024161001,0.00032809877,0.0004232153,0.000034986577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018302955,0.00014516141,0.00019397182,0.0011618502,0.00019242376,0.00075673504,0.00025571778,0.00011336253,0.0005383981],"category_scores_gemma":[0.0004807542,0.00014487133,0.000015170186,0.0023937975,0.000045468645,0.00071998336,0.00022172299,0.00031885883,0.00034779753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005117749,0.0002901578,0.008725135,0.00016729742,0.0000038051903,0.000007197372,0.000039779796,0.9743868,0.002107904,0.0025710613,0.01034186,0.001307837],"study_design_scores_gemma":[0.0010752704,0.000027534643,0.0012274242,0.00011218,0.000003108911,2.5230383e-7,0.00047141465,0.9660646,0.000029545614,0.0000041653257,0.030806217,0.00017830842],"about_ca_topic_score_codex":0.0033126138,"about_ca_topic_score_gemma":0.003935822,"teacher_disagreement_score":0.4723012,"about_ca_system_score_codex":0.00022930115,"about_ca_system_score_gemma":0.00011024881,"threshold_uncertainty_score":0.7297213},"labels":[],"label_agreement":null},{"id":"W2922570500","doi":"10.1287/opre.2018.1781","title":"Competitive Facility Location with Selfish Users and Queues","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Facility location problem; Queue; Computer science; Operations research; Business; Operations management; Computer network; Economics; Mathematics","score_opus":0.0462678411129308,"score_gpt":0.37622606208826637,"score_spread":0.32995822097533556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922570500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9561405,0.00003556961,0.0013613211,0.0020958863,0.000033865545,0.00048488396,0.000021971857,0.00005184357,0.039774112],"genre_scores_gemma":[0.9933439,0.00006353146,0.001069579,0.000027523187,0.000016889633,0.000023378989,0.000089152876,0.0000029051564,0.0053631356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99900866,0.00024110948,0.000073760464,0.00015776606,0.00037220342,0.00014648495],"domain_scores_gemma":[0.9990848,0.00010481544,0.000006523696,0.0000869385,0.0006545735,0.00006239209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077356683,0.000037123908,0.000050883616,0.00008347716,0.00067711715,0.0001818556,0.00006141283,0.00004058209,0.00024402786],"category_scores_gemma":[0.00009254174,0.000033153214,0.000005453162,0.00044268646,0.00021390927,0.00032665444,0.0000051540574,0.0001183545,0.00009711204],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009854648,0.00014699191,0.2755983,0.0000517744,0.00003747379,0.0000031428392,0.14046836,0.12381192,0.00031415824,0.45617986,0.00087714696,0.0024123543],"study_design_scores_gemma":[0.0019874165,0.0005857838,0.50754493,0.00020813411,0.000022966151,0.0000025010695,0.28615174,0.028626451,0.00062891166,0.0002951654,0.17329386,0.00065216224],"about_ca_topic_score_codex":0.003306244,"about_ca_topic_score_gemma":0.022216372,"teacher_disagreement_score":0.45588467,"about_ca_system_score_codex":0.000047393743,"about_ca_system_score_gemma":0.00028478584,"threshold_uncertainty_score":0.9956256},"labels":[],"label_agreement":null},{"id":"W2928552923","doi":"10.1287/opre.2021.2244","title":"Transparency and Control in Platforms for Networked Markets","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transparency (behavior); Computer science; Control (management); Industrial organization; Competition (biology); Microeconomics; Business; Economics; Computer security","score_opus":0.0664649550114487,"score_gpt":0.2956678762848659,"score_spread":0.2292029212734172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928552923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97522193,0.000055827135,0.00057612965,0.00062481605,0.00008975458,0.0006868819,0.000017805598,0.000014439651,0.02271239],"genre_scores_gemma":[0.99815387,0.0000072004827,0.00006197866,0.0003562998,0.00015413179,0.0004682483,0.00008309573,0.000011183754,0.00070400647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928373,0.0000016757464,0.0001623759,0.00016239018,0.00012242037,0.00026739974],"domain_scores_gemma":[0.99977046,0.00006224024,0.000009540132,0.00009497938,0.000052737047,0.000010038683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696446,0.00005512915,0.00009113204,0.00024043614,0.0005757948,0.0006289412,0.00013438099,0.000018522556,0.00034005192],"category_scores_gemma":[0.00003867825,0.000051700634,0.000021618478,0.0002815851,0.000031147163,0.0018218638,0.000084553285,0.0001487304,0.000020134321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010940019,0.0005217007,0.023153542,0.00022022818,0.000059729307,0.000017624772,0.000345184,0.11989876,0.00032553048,0.75055933,0.019047806,0.08475656],"study_design_scores_gemma":[0.0022858724,0.00004685168,0.0045246775,0.000009126099,0.0000046293267,0.000001781543,0.0015879384,0.8644385,0.0000022569866,0.035391994,0.0915239,0.00018248383],"about_ca_topic_score_codex":0.00027582637,"about_ca_topic_score_gemma":0.0012772523,"teacher_disagreement_score":0.74453974,"about_ca_system_score_codex":0.000039142527,"about_ca_system_score_gemma":0.000028910874,"threshold_uncertainty_score":0.6064895},"labels":[],"label_agreement":null},{"id":"W2935647296","doi":"10.1287/opre.2018.1835","title":"Robust Dual Dynamic Programming","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Imperial College London","keywords":"Mathematical optimization; Bounding overwatch; Dynamic programming; Computer science; Scheme (mathematics); Dual (grammatical number); Stylized fact; Upper and lower bounds; Robust optimization; Embedding; Algorithm; Mathematics","score_opus":0.2675650150968807,"score_gpt":0.49470294421885547,"score_spread":0.22713792912197478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935647296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92422587,0.00015305664,0.023107644,0.0029440895,0.0004433815,0.0011284176,0.000012340601,0.000061797495,0.047923386],"genre_scores_gemma":[0.8991879,0.0001013352,0.013131846,0.000026652328,0.000055113716,0.00005099919,0.000031894473,0.000011518331,0.08740274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966334,0.0003910888,0.00034708338,0.0004067871,0.0018752762,0.00034633974],"domain_scores_gemma":[0.9976973,0.00038564004,0.00001821649,0.0006457676,0.0011484311,0.00010465326],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0049426993,0.000070459195,0.00011980449,0.0005462215,0.0005017834,0.0011242669,0.00042847884,0.000069569964,0.002399222],"category_scores_gemma":[0.0013534529,0.00005201154,0.0000457008,0.0019926943,0.00009032916,0.0005687737,0.0001446921,0.00027150562,0.008027744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024651345,0.00015994527,0.017709892,0.0000026295704,0.000012871406,0.000011847226,0.0012303534,0.7045076,0.0014115921,0.013991323,0.010506132,0.2504312],"study_design_scores_gemma":[0.00030512936,0.00014815082,0.007208119,0.000008572064,0.0000019388763,0.00001269811,0.001854439,0.82019246,0.00016353141,0.00075321825,0.16920193,0.0001498294],"about_ca_topic_score_codex":0.00013449656,"about_ca_topic_score_gemma":0.0004891644,"teacher_disagreement_score":0.25028136,"about_ca_system_score_codex":0.000054975342,"about_ca_system_score_gemma":0.00024217804,"threshold_uncertainty_score":0.9999127},"labels":[],"label_agreement":null},{"id":"W2964571806","doi":"10.1287/opre.2018.1822","title":"Empty-Car Routing in Ridesharing Systems","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":226,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese University of Hong Kong; University of Hong Kong; University of Toronto","keywords":"Computer science; Vehicle routing problem; Routing (electronic design automation); Operations research; Transport engineering; Mathematical optimization; Computer network; Mathematics; Engineering","score_opus":0.05969899393229509,"score_gpt":0.34784404873476843,"score_spread":0.2881450548024733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964571806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97814476,0.000046832076,0.0011735181,0.00012045028,0.00020429226,0.00047241832,0.000011390647,0.000110511486,0.019715825],"genre_scores_gemma":[0.99791884,0.0000143540265,0.00023440336,0.000007415856,0.000033292712,0.00012033606,0.000045774843,0.000015897042,0.0016097081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991032,0.000037915677,0.00024291818,0.00013651841,0.00023320944,0.00024625956],"domain_scores_gemma":[0.9995154,0.000053361622,0.000002760131,0.0002298496,0.00016225844,0.00003636212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066870585,0.000058484224,0.00008439173,0.00031907987,0.00010281374,0.00013012644,0.000117234835,0.00005018742,0.0002152967],"category_scores_gemma":[0.00004229795,0.00006301596,0.000015554027,0.0008249905,0.000017897779,0.00022194984,0.000011534327,0.00033583635,0.00052320154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013704846,0.000023829027,0.021542,0.00005168826,0.0000097816,0.0000022673632,0.000876525,0.91987675,0.022017669,0.034938868,0.00032329178,0.00033592773],"study_design_scores_gemma":[0.00039549533,0.000018246586,0.06822649,0.00008709693,0.0000015465573,0.0000021868138,0.0016979629,0.9239589,0.0013726492,0.000018583609,0.0040605757,0.00016026602],"about_ca_topic_score_codex":0.000450789,"about_ca_topic_score_gemma":0.00087098207,"teacher_disagreement_score":0.04668449,"about_ca_system_score_codex":0.00011537287,"about_ca_system_score_gemma":0.000051538267,"threshold_uncertainty_score":0.6724872},"labels":[],"label_agreement":null},{"id":"W2969212598","doi":"10.1287/opre.2021.2159","title":"Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Regret; Robust optimization; Mathematical optimization; Computer science; Minification; Optimization problem; Stochastic optimization; Set (abstract data type); Exploit; Computation; Robustness (evolution); Affine transformation; Stochastic programming; Mathematics; Algorithm","score_opus":0.3457333605305196,"score_gpt":0.4837777289242717,"score_spread":0.13804436839375206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969212598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06807714,0.0005411277,0.8923307,0.0020159604,0.00032771216,0.0012184861,0.00020971651,0.000077824,0.035201307],"genre_scores_gemma":[0.7402784,0.0010104802,0.1905276,0.000049571634,0.00015773466,0.00014269815,0.00079471344,0.000046914225,0.06699185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944093,0.0011635468,0.0012106479,0.0007015733,0.0020688316,0.00044609146],"domain_scores_gemma":[0.9905906,0.00065647165,0.00014881381,0.0012393886,0.0071725147,0.00019222927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044988296,0.00016811611,0.00031402978,0.0010259426,0.0011863532,0.00079567597,0.00043901074,0.0001584924,0.003187633],"category_scores_gemma":[0.005184039,0.00014332896,0.00012470884,0.006411343,0.00019309994,0.001505669,0.00023329805,0.00033535878,0.00012486758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013419684,0.00015968879,0.0016196498,0.0000074950312,0.000016073353,0.00006055727,0.00078770344,0.98227215,0.00032719484,0.010362916,0.0018083361,0.0025647923],"study_design_scores_gemma":[0.000609218,0.000060455972,0.00012739492,0.000029473731,0.0000138883,0.00011838227,0.0026285734,0.98883873,0.0016628527,0.0005452409,0.0052030995,0.0001626705],"about_ca_topic_score_codex":0.00058203057,"about_ca_topic_score_gemma":0.0023725613,"teacher_disagreement_score":0.7018031,"about_ca_system_score_codex":0.00013022704,"about_ca_system_score_gemma":0.00089793693,"threshold_uncertainty_score":0.9977236},"labels":[],"label_agreement":null},{"id":"W2996286957","doi":"10.1287/opre.2021.2114","title":"Optimal Sequential Multiclass Diagnosis","year":2021,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"University of Toronto; University of Illinois at Urbana-Champaign; Queen's University","keywords":"Curse of dimensionality; Dimension (graph theory); Computer science; Heuristic; Univariate; Matrix (chemical analysis); Class (philosophy); Statistic; Exponential family; Rank (graph theory); Mathematical optimization; Mathematics; Artificial intelligence; Multivariate statistics; Machine learning; Statistics; Combinatorics","score_opus":0.5527928944872087,"score_gpt":0.6121143874927769,"score_spread":0.059321493005568215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996286957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40591553,0.0009384565,0.58216184,0.0030308305,0.0020612713,0.0010266422,0.0003111826,0.000088636734,0.0044655916],"genre_scores_gemma":[0.85264283,0.00012747016,0.13958247,0.000022330127,0.00060295605,0.0009132642,0.00008522269,0.000035444555,0.0059879753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99049455,0.0014557969,0.0009157015,0.0014896569,0.0049347617,0.0007095163],"domain_scores_gemma":[0.98822975,0.004497549,0.000053587395,0.0015942603,0.005277996,0.00034685683],"candidate_categories":["metaresearch","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00534569,0.00024558444,0.00045730724,0.00062666455,0.0010677531,0.0044154525,0.0018649494,0.0003244373,0.0030080355],"category_scores_gemma":[0.043656413,0.00021375503,0.00015348567,0.0013604927,0.00047066592,0.00051891076,0.0042363373,0.002425582,0.0009088886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019641082,0.00026335032,0.0014000997,0.000042434724,0.000049879713,0.0002229328,0.0013986835,0.9340854,0.0010792515,0.0031570434,0.0037774788,0.054503795],"study_design_scores_gemma":[0.00066040887,0.00014157235,0.0030068448,0.00034303532,0.000033202767,0.000022053011,0.0073913066,0.9385038,0.019588329,0.013888945,0.0153817125,0.0010387743],"about_ca_topic_score_codex":0.00053258566,"about_ca_topic_score_gemma":0.0006414738,"teacher_disagreement_score":0.44672734,"about_ca_system_score_codex":0.0003661987,"about_ca_system_score_gemma":0.0012968314,"threshold_uncertainty_score":0.99987584},"labels":[],"label_agreement":null},{"id":"W2997362232","doi":"10.1287/opre.2022.2366","title":"Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; HEC Montréal","funders":"","keywords":"Dual polyhedron; Bounding overwatch; Lagrangian relaxation; Mathematical optimization; Dual (grammatical number); Integer programming; Lagrangian; Augmented Lagrangian method; Multiplier (economics); Mathematics; Integer (computer science); Lagrange multiplier; Computer science; Linear programming; Stochastic programming; Decision problem; Satisfiability; Applied mathematics; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.1816251271320773,"score_gpt":0.4820940679830823,"score_spread":0.300468940851005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997362232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121842444,0.00020120862,0.87295574,0.0012700118,0.0005872867,0.0017977527,0.0003067765,0.0000564981,0.0009822858],"genre_scores_gemma":[0.9332061,0.000020770127,0.04888978,0.000042292257,0.00016767828,0.0013095033,0.00024838475,0.000029455001,0.016086062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951073,0.00060956203,0.0005624956,0.00057746546,0.0026511366,0.000492055],"domain_scores_gemma":[0.99560493,0.0022689295,0.000041503215,0.00060577807,0.0013212392,0.00015764573],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008502083,0.000116368705,0.00018507845,0.0009173005,0.0032474075,0.001044034,0.0006776841,0.000054621032,0.0012434286],"category_scores_gemma":[0.005555854,0.00009435802,0.00011490586,0.0017280054,0.00013046709,0.00039116477,0.00038536682,0.00037710182,0.00031582976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001359558,0.00022394487,0.0001811785,0.0000017994632,0.000011868258,0.000010506944,0.0012915769,0.6576086,0.0002608262,0.013486879,0.027764073,0.29902276],"study_design_scores_gemma":[0.0006766951,0.00032777956,0.0004454109,0.000006963913,0.0000061776263,0.00001848286,0.005253936,0.7102786,0.00007866825,0.003062138,0.27966225,0.0001829425],"about_ca_topic_score_codex":0.00021544739,"about_ca_topic_score_gemma":0.00071126036,"teacher_disagreement_score":0.824066,"about_ca_system_score_codex":0.00012852787,"about_ca_system_score_gemma":0.00031225054,"threshold_uncertainty_score":0.99999297},"labels":[],"label_agreement":null},{"id":"W3010739339","doi":"10.1287/opre.2019.1892","title":"The Benders Dual Decomposition Method","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Decomposition; Dual (grammatical number); Decomposition method (queueing theory); Exploit; Integer programming; Integer (computer science); Computer science; Node (physics); Mathematics; Algorithm; Engineering","score_opus":0.3165010738985468,"score_gpt":0.5717275746829251,"score_spread":0.2552265007843783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010739339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001086716,0.000087047905,0.94751436,0.041893806,0.0000489226,0.00086112524,0.000015276635,0.0001066504,0.008386078],"genre_scores_gemma":[0.045767847,0.00024367117,0.94616854,0.0003410425,0.00038771564,0.00038056064,0.00004473569,0.00006935805,0.0065965205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970662,0.0009136587,0.00026824052,0.00029312688,0.0010099199,0.0004488637],"domain_scores_gemma":[0.9967252,0.0018225597,0.000013871955,0.0003562278,0.0008647038,0.00021741245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019173191,0.00009480476,0.0001123003,0.00010262304,0.0018736853,0.00039465746,0.0003492363,0.00006138848,0.0004227235],"category_scores_gemma":[0.0037544558,0.000069407695,0.000046218305,0.0010049009,0.00017988619,0.0002526306,0.00022057729,0.00062701176,0.00030495002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013910442,0.00023169984,0.000021364862,0.00005856635,0.0001266828,0.000035584468,0.0046623405,0.12155856,0.010354609,0.74453235,0.06459861,0.05368051],"study_design_scores_gemma":[0.00045978941,0.00014909296,0.00001751729,0.0000082908,0.0000054435277,0.000011407909,0.0023317607,0.9522358,0.0050596143,0.01610908,0.023466378,0.00014578145],"about_ca_topic_score_codex":0.000020846725,"about_ca_topic_score_gemma":0.0000918602,"teacher_disagreement_score":0.8306773,"about_ca_system_score_codex":0.000108941655,"about_ca_system_score_gemma":0.00021715382,"threshold_uncertainty_score":0.99942577},"labels":[],"label_agreement":null},{"id":"W3018789859","doi":"10.1287/opre.2019.1906","title":"Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Reservation; Revenue management; Dynamic pricing; Computer science; Operations research; Service (business); Heuristic; Revenue; Yield management; Mathematical optimization; Duration (music); Demand management; Total revenue; Microeconomics; Business; Economics; Marketing; Computer network; Mathematics","score_opus":0.04003862520928552,"score_gpt":0.3258170514260944,"score_spread":0.2857784262168089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018789859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92647696,0.00012061593,0.018355696,0.026975162,0.000048872615,0.0043428945,0.00007605798,0.00035357047,0.023250155],"genre_scores_gemma":[0.8264689,0.00021135152,0.09849971,0.0044611422,0.0009870268,0.0014820178,0.0008938378,0.0003065512,0.06668947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819523,0.000071166236,0.0003063163,0.00054713065,0.00047274397,0.0004073966],"domain_scores_gemma":[0.99856645,0.00014380807,0.00007154669,0.0004410483,0.0007376471,0.000039481238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770071,0.00016172833,0.00021378565,0.00026970406,0.0010455963,0.00046665035,0.00037973185,0.000042665626,0.00012648151],"category_scores_gemma":[0.00050855393,0.00015328515,0.00002567819,0.0016354768,0.000088120636,0.0012185071,0.00035007924,0.00016270843,0.00033753557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006526375,0.001009531,0.00389737,0.01212437,0.0016028521,0.00038688292,0.0053400407,0.5088787,0.27405235,0.11098145,0.040303774,0.034896296],"study_design_scores_gemma":[0.0009949385,0.00009547685,0.0004212768,0.00029006385,0.00011261864,0.000001771881,0.00046908337,0.93819314,0.000092694776,0.0029513305,0.056042973,0.00033465162],"about_ca_topic_score_codex":0.00019091454,"about_ca_topic_score_gemma":0.00033235003,"teacher_disagreement_score":0.42931443,"about_ca_system_score_codex":0.00008783697,"about_ca_system_score_gemma":0.000029626151,"threshold_uncertainty_score":0.80419874},"labels":[],"label_agreement":null},{"id":"W3020867067","doi":"10.1287/opre.2020.2033","title":"Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Branch and cut; Routing (electronic design automation); Vehicle routing problem; Solver; Reduction (mathematics); Mathematical optimization; Path (computing); Computer science; Mathematics; Node (physics); Inequality; Upper and lower bounds; Algorithm; Integer programming","score_opus":0.08454693968172562,"score_gpt":0.3695019839405457,"score_spread":0.28495504425882007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020867067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5204917,0.0042272615,0.46715257,0.0009516653,0.00017357724,0.0006184441,0.00004760803,0.0004350752,0.0059020664],"genre_scores_gemma":[0.798546,0.0007928095,0.19870049,0.000031212785,0.00010823419,0.00008706832,0.000027517897,0.00004984938,0.0016567903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998138,0.000523503,0.00029794854,0.0002844166,0.0003697617,0.00038636755],"domain_scores_gemma":[0.9986697,0.0005010924,0.000008400068,0.00024296546,0.00045075882,0.0001271232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017979457,0.00012165037,0.00017359391,0.0003085133,0.0004887178,0.00046338592,0.0000908665,0.00009127731,0.0000496065],"category_scores_gemma":[0.0012773029,0.00013043024,0.000022804958,0.0012644985,0.00008522517,0.00028479102,0.00015717448,0.0004181184,0.000018769948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035346586,0.000099036144,0.0046360767,0.00038180526,0.00012199175,0.000032725617,0.007482087,0.6364163,0.02679598,0.0048902202,0.0003566837,0.31878352],"study_design_scores_gemma":[0.000367931,0.000022112683,0.0017189231,0.000053202373,0.0000057951142,0.000027666229,0.00078113563,0.983711,0.012490599,0.0000920003,0.0005717103,0.00015793554],"about_ca_topic_score_codex":0.00017923793,"about_ca_topic_score_gemma":0.000106732616,"teacher_disagreement_score":0.34729466,"about_ca_system_score_codex":0.00007369385,"about_ca_system_score_gemma":0.000089638736,"threshold_uncertainty_score":0.5318791},"labels":[],"label_agreement":null},{"id":"W3029111965","doi":"10.1287/opre.2022.2432","title":"Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ex-ante; Ask price; Resource allocation; Mathematical economics; Economics; Distribution (mathematics); Microeconomics; Computer science; Mathematics","score_opus":0.12477275911177432,"score_gpt":0.34701947911234854,"score_spread":0.22224672000057422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029111965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823618,0.0003112174,0.00011191489,0.0012577919,0.000045612705,0.00027080596,0.00005153309,0.0000152559105,0.015574084],"genre_scores_gemma":[0.9834975,0.00010604229,0.00005608144,0.000015027932,0.00004119945,0.000030591254,0.000034967397,0.000012247467,0.016206361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998982,0.00012383907,0.00036986015,0.00023957614,0.00006223113,0.00022248336],"domain_scores_gemma":[0.9994379,0.00015943243,0.00003056281,0.0002474229,0.000082676794,0.000042002146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033021811,0.000057366782,0.00016798702,0.00071552204,0.00013966103,0.0000933487,0.00015472293,0.0000556828,0.00009569392],"category_scores_gemma":[0.00046063634,0.000064592336,0.000019483054,0.0010393444,0.00010402309,0.00016173955,0.000076766075,0.00016767408,0.00059403054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059125352,0.0002566755,0.0835023,0.0002291854,0.00003201497,0.000010305898,0.009060663,0.0064881546,0.0049539036,0.8910494,0.0014659598,0.0028923345],"study_design_scores_gemma":[0.004042346,0.0010986709,0.5347097,0.0011007331,0.0000088760835,0.00002699282,0.031238992,0.27633092,0.0029554148,0.025949452,0.1212508,0.001287127],"about_ca_topic_score_codex":0.0015105092,"about_ca_topic_score_gemma":0.0011425995,"teacher_disagreement_score":0.8650999,"about_ca_system_score_codex":0.00004071722,"about_ca_system_score_gemma":0.000029565286,"threshold_uncertainty_score":0.7635259},"labels":[],"label_agreement":null},{"id":"W3032098999","doi":"10.1287/opre.2019.1950","title":"Information Disclosure and Pricing Policies for Sales of Network Goods","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Business; Marketing; Advertising; Economics; Microeconomics","score_opus":0.28694872459048065,"score_gpt":0.5045683585616975,"score_spread":0.2176196339712168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032098999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5321681,0.00017547063,0.40411422,0.055149097,0.00006678513,0.0014084919,0.0001597408,0.000040300984,0.006717819],"genre_scores_gemma":[0.9954818,0.000021024283,0.0035722114,0.00019601829,0.00011947409,0.00009375709,0.000021766435,0.0000031897268,0.00049077906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987833,0.00015506151,0.00034003006,0.00010838339,0.0004710699,0.00014217502],"domain_scores_gemma":[0.9982947,0.0008490946,0.00003430041,0.0001853327,0.0005574921,0.00007905047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021268101,0.000043047286,0.00010038876,0.000111899295,0.0006525873,0.0002565457,0.00023522739,0.0000345287,0.000066630855],"category_scores_gemma":[0.0026265967,0.000031954438,0.000028527527,0.001056754,0.00018552317,0.0005806755,0.00010258593,0.00009769372,0.00006581522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004697995,0.000025510844,0.003012834,0.000018051524,0.000012758569,3.6621447e-8,0.009268617,0.04289267,0.002366404,0.88087887,0.030227615,0.03124966],"study_design_scores_gemma":[0.00088117534,0.000555495,0.018991588,0.00003733173,0.000015201568,0.000007106183,0.036512636,0.1994821,0.006064543,0.09452618,0.6426287,0.00029791557],"about_ca_topic_score_codex":0.000020425437,"about_ca_topic_score_gemma":0.000031478026,"teacher_disagreement_score":0.7863527,"about_ca_system_score_codex":0.000008356975,"about_ca_system_score_gemma":0.000076316195,"threshold_uncertainty_score":0.501924},"labels":[],"label_agreement":null},{"id":"W3036533453","doi":"10.1287/opre.2019.1936","title":"Selling Passes to Strategic Customers","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Dynamic pricing; Business; Control (management); Service (business); Microeconomics; Computer science; Time horizon; Marketing; Economics; Finance","score_opus":0.22681424571348233,"score_gpt":0.38273351652243237,"score_spread":0.15591927080895004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036533453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8633642,0.000054691693,0.0003823519,0.01507416,0.000109719076,0.00044905714,0.0000026193622,0.000116909476,0.12044629],"genre_scores_gemma":[0.99691164,0.000009765443,0.00029678136,0.0014010608,0.0005950637,0.000047242418,0.000016623653,0.00001780717,0.00070399395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988461,0.000030756142,0.00015687812,0.00025616976,0.00039909763,0.00031098246],"domain_scores_gemma":[0.99935424,0.00005522741,0.000008111387,0.00015496516,0.00038252314,0.000044927172],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00059975724,0.000083918334,0.00009836149,0.00026894995,0.0005567538,0.0009796025,0.00024715037,0.00003299886,0.0012536169],"category_scores_gemma":[0.00020073805,0.00007918775,0.00003131369,0.0015580719,0.00003201681,0.0005570693,0.00016967095,0.00026870807,0.002789689],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046900535,0.00070258335,0.099688426,0.0010095978,0.0001860104,0.0002990899,0.0046773204,0.08899535,0.22504796,0.28202766,0.09712802,0.19976896],"study_design_scores_gemma":[0.0010474958,0.00009963351,0.012233305,0.0001089698,0.00008115832,0.0000027869635,0.010718825,0.22430319,0.0014567445,0.00048328287,0.74840975,0.0010548957],"about_ca_topic_score_codex":0.001173108,"about_ca_topic_score_gemma":0.0005138975,"teacher_disagreement_score":0.6512817,"about_ca_system_score_codex":0.0000174743,"about_ca_system_score_gemma":0.000073258176,"threshold_uncertainty_score":0.99965936},"labels":[],"label_agreement":null},{"id":"W3042850524","doi":"10.1287/opre.2021.0765","title":"Convolution Bounds on Quantile Aggregation","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantile; Convolution (computer science); Mathematics; Computer science; Econometrics; Artificial intelligence","score_opus":0.34920467722749954,"score_gpt":0.5549997028613539,"score_spread":0.20579502563385438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042850524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6543293,0.0021456818,0.1179251,0.01695962,0.0029410997,0.0013832567,0.00009229192,0.00038345996,0.20384018],"genre_scores_gemma":[0.9524107,0.0004755966,0.0007812393,0.000051897026,0.0002460294,0.00006201006,0.000058362908,0.000012849556,0.045901336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963578,0.00050883496,0.0003804517,0.0004630429,0.0020230997,0.00026676085],"domain_scores_gemma":[0.99767315,0.0008136304,0.000011727157,0.0004979102,0.0009093967,0.00009416665],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0054185363,0.00008144554,0.00010067686,0.0010636128,0.00079400983,0.0023937242,0.00033515794,0.00008779612,0.0014260166],"category_scores_gemma":[0.0022276642,0.00005990252,0.000059166836,0.0027549532,0.0001392087,0.0007412091,0.0000559826,0.00031865458,0.008619649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037115966,0.00011349196,0.0006679819,0.000004779308,0.000016484131,0.00002217074,0.001527489,0.11802517,0.0018764917,0.46160877,0.19054203,0.22555803],"study_design_scores_gemma":[0.000089386696,0.00013853714,0.001097287,0.0000304401,0.0000023565515,0.0000060512407,0.0003637777,0.6891996,0.0012860702,0.007625503,0.30007154,0.00008942014],"about_ca_topic_score_codex":0.00018716126,"about_ca_topic_score_gemma":0.00024336613,"teacher_disagreement_score":0.57117444,"about_ca_system_score_codex":0.000113589034,"about_ca_system_score_gemma":0.00036184487,"threshold_uncertainty_score":0.9994868},"labels":[],"label_agreement":null},{"id":"W3048754379","doi":"10.1287/opre.2020.2011","title":"Patient-Type Bayes-Adaptive Treatment Plans","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Policy and Management","field":"Economics, Econometrics and Finance","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Heuristics; Computer science; Bayes' theorem; Markov decision process; Health care; Population; Bayesian probability; Medicine; Artificial intelligence; Machine learning; Markov process; Markov chain; Markov model; Mathematics; Statistics","score_opus":0.2782701507894075,"score_gpt":0.4004406174145686,"score_spread":0.12217046662516112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048754379","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3042004,0.004283536,0.0039250236,0.05507365,0.0009948887,0.0015646991,0.001060749,0.00009292934,0.62880415],"genre_scores_gemma":[0.97796416,0.00085279346,0.0013208479,0.00032857838,0.00010407755,0.00011873657,0.00007780156,0.000013092293,0.019219916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989378,0.000087008375,0.00026744427,0.000312464,0.00006296788,0.00033231787],"domain_scores_gemma":[0.99930596,0.00005544981,0.000013153284,0.00034554471,0.00017369862,0.00010616494],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036516538,0.00007063621,0.00014400728,0.00020301396,0.00038321264,0.00012440533,0.00008139502,0.00004939413,0.0012516374],"category_scores_gemma":[0.00018685826,0.00007507534,0.000038930768,0.000506366,0.000037476122,0.00011611159,0.00007463021,0.00013294812,0.0027790884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011576842,0.00023987479,0.00072101026,0.000008189766,0.000052387957,0.000033810236,0.0015623772,0.00077111257,0.000034232744,0.98267555,0.003933134,0.009956741],"study_design_scores_gemma":[0.00035127564,0.00055771845,0.0016273931,0.000010030421,0.0000017831572,0.0000041644007,0.0009461079,0.0074038827,0.00083291245,0.005012514,0.9831035,0.00014871563],"about_ca_topic_score_codex":0.006790153,"about_ca_topic_score_gemma":0.005411114,"teacher_disagreement_score":0.9791704,"about_ca_system_score_codex":0.00029243607,"about_ca_system_score_gemma":0.00017715842,"threshold_uncertainty_score":0.9998237},"labels":[],"label_agreement":null},{"id":"W3085631657","doi":"10.1287/opre.2022.2380","title":"Learning Product Rankings Robust to Fake Users","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Leverage (statistics); Computer science; Product (mathematics); Ranking (information retrieval); Analytics; Status quo; Data science; Learning to rank; Machine learning; Artificial intelligence; Mathematics; Economics","score_opus":0.36256294639491365,"score_gpt":0.5291875609008896,"score_spread":0.16662461450597593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085631657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8243497,0.00039163182,0.099814706,0.050235946,0.0010504725,0.004988674,0.00012148791,0.00029477756,0.0187526],"genre_scores_gemma":[0.84749126,0.000013387055,0.00847573,0.00013522436,0.0002714891,0.0009768524,0.000026445281,0.000040671563,0.14256896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9869181,0.0025374547,0.0005360714,0.0011081891,0.00794044,0.0009597289],"domain_scores_gemma":[0.99489677,0.0014732652,0.00002580398,0.0011073276,0.0021672312,0.00032957495],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.018579418,0.00013893787,0.00023495358,0.0018802424,0.0054308902,0.001225635,0.0021179472,0.000031529773,0.0098890355],"category_scores_gemma":[0.02046392,0.00012041699,0.00007880164,0.007952555,0.0002196839,0.0006137092,0.0021588106,0.0018519087,0.0027535863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049947237,0.000080978876,0.00073800713,0.0000014428564,0.000007895924,0.000027207503,0.0019911858,0.9304064,0.0027730514,0.00043537744,0.022660982,0.04082753],"study_design_scores_gemma":[0.0006176202,0.00082400074,0.00263566,0.0000072010544,0.0000022073905,0.000041181414,0.015239988,0.17545182,0.0023482656,0.0011818085,0.8012902,0.00036000853],"about_ca_topic_score_codex":0.00031431872,"about_ca_topic_score_gemma":0.0003622347,"teacher_disagreement_score":0.77862924,"about_ca_system_score_codex":0.0004677001,"about_ca_system_score_gemma":0.00064781157,"threshold_uncertainty_score":0.9998112},"labels":[],"label_agreement":null},{"id":"W3095328311","doi":"10.1287/opre.2020.1990","title":"The Discrete Moment Problem with Nonconvex Shape Constraints","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Moment (physics); Mathematical optimization; Mathematics; Piecewise; Newsvendor model; Second moment of area; Distribution (mathematics); Computation; Applied mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.2198915502003134,"score_gpt":0.4631863808632026,"score_spread":0.24329483066288918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095328311","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14878881,0.0004942671,0.2295925,0.33219895,0.0002472046,0.0046168286,0.00012281023,0.00014912794,0.2837895],"genre_scores_gemma":[0.984594,0.0003410201,0.0060788677,0.0002693201,0.000118927645,0.0001362077,0.0000147017445,0.000012010663,0.008434942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651,0.00044903028,0.0003579297,0.00036886972,0.001993577,0.0003205717],"domain_scores_gemma":[0.99771833,0.00056397094,0.000027039958,0.00040656817,0.0010695151,0.00021459495],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031060653,0.00008263097,0.00011152715,0.00010192582,0.0014296583,0.0014826682,0.0006747472,0.000037924197,0.0011645787],"category_scores_gemma":[0.0008088472,0.000040220733,0.00003186622,0.0015250903,0.00057769835,0.00033997133,0.00014334288,0.00028359145,0.0010003335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030296197,0.0001247146,0.010231454,0.000005754274,0.00008476453,0.000048297978,0.010914549,0.18905717,0.0013527854,0.107403725,0.11916394,0.5613099],"study_design_scores_gemma":[0.0004571195,0.0004979575,0.0013094584,0.000011768147,0.0000049890396,0.0000098382725,0.005312121,0.63804966,0.0006792117,0.0012037829,0.3522833,0.00018083188],"about_ca_topic_score_codex":0.00003941701,"about_ca_topic_score_gemma":0.00019281165,"teacher_disagreement_score":0.8358052,"about_ca_system_score_codex":0.00002843488,"about_ca_system_score_gemma":0.00041613524,"threshold_uncertainty_score":0.99987036},"labels":[],"label_agreement":null},{"id":"W3121305672","doi":"10.1287/opre.2021.2228","title":"Vessel Service Planning in Seaports","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Office of Planning, Research and Evaluation; Strong; Texas Department of Transportation; U.S. Department of Transportation","keywords":"Pilotage; Operations research; Service (business); Benders' decomposition; Computer science; Supply chain; Column generation; Operations management; Mathematical optimization; Engineering; Business; Mathematics","score_opus":0.09651698364591516,"score_gpt":0.3624815964644001,"score_spread":0.26596461281848494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121305672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77841353,0.0007591774,0.0017764176,0.001916116,0.00041891917,0.0006191695,0.000076659286,0.00022938917,0.21579061],"genre_scores_gemma":[0.99746007,0.000012850339,0.00036808226,0.000051138046,0.000041586223,0.00016720031,0.000068556226,0.000014385762,0.0018161068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.00006319249,0.00011572728,0.00009815033,0.00028134102,0.00022477789],"domain_scores_gemma":[0.9997021,0.000040581923,0.0000015520691,0.00015535428,0.000059666156,0.00004074656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005903441,0.000042889187,0.00005546108,0.00018736887,0.00031480475,0.000062275074,0.0001272112,0.000018337834,0.002054763],"category_scores_gemma":[0.000030678344,0.000048456506,0.0000074241807,0.0006046713,0.000012848122,0.000060409868,0.00010844519,0.00045379007,0.000032837845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014566366,0.000022909095,0.001133122,0.000016304019,0.0000028043794,0.00007080282,0.0006491657,0.9860962,0.0003243471,0.0014177227,0.009584384,0.0006807836],"study_design_scores_gemma":[0.0001375536,0.000022141363,0.004198117,0.00000820217,9.600833e-7,0.000014532566,0.0010306232,0.84934795,0.00011320235,0.000115199175,0.1449033,0.000108208464],"about_ca_topic_score_codex":0.00051180494,"about_ca_topic_score_gemma":0.0003403138,"teacher_disagreement_score":0.21904655,"about_ca_system_score_codex":0.000093294766,"about_ca_system_score_gemma":0.000059201942,"threshold_uncertainty_score":0.9988575},"labels":[],"label_agreement":null},{"id":"W3121770743","doi":"10.1287/opre.2020.2001","title":"Technical Note—Global Robust Stability in a General Price and Assortment Competition Model","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oligopoly; Affine transformation; Competition (biology); Competitor analysis; Economics; Stability (learning theory); Product (mathematics); Product differentiation; Piecewise; Function (biology); Set (abstract data type); Multinomial logistic regression; Point (geometry); Marginal cost; Microeconomics; Mathematical economics; Computer science; Cournot competition; Mathematics","score_opus":0.14111669407925567,"score_gpt":0.3597238473263511,"score_spread":0.21860715324709543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121770743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95038086,0.000051784868,0.02363902,0.008931058,0.000029680554,0.00068565836,0.000014974317,0.000063435684,0.016203538],"genre_scores_gemma":[0.99498606,0.000013866268,0.004359779,0.00035332039,0.00012661194,0.00007471292,0.000039314553,0.000007465416,0.000038876988],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988265,0.000055679295,0.0002017701,0.00030333677,0.0003552418,0.0002574903],"domain_scores_gemma":[0.9995621,0.00003693406,0.000011037323,0.00014915575,0.00021107783,0.000029685056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137793,0.00008414198,0.00011424057,0.00010271234,0.00026733693,0.0003895907,0.0001375947,0.000053462918,0.00024677886],"category_scores_gemma":[0.00027624166,0.000081944265,0.00002223299,0.00076899666,0.00007954593,0.0005208246,0.00031862716,0.00029020355,0.00003946904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049036735,0.0013985093,0.50561094,0.00056129193,0.000018496696,0.000079846504,0.00076369016,0.178593,0.06345588,0.20103967,0.0031681445,0.04482017],"study_design_scores_gemma":[0.00036756357,0.000011747258,0.05906445,0.000013110863,0.000007067298,9.648064e-7,0.00008123695,0.939111,0.000032115393,0.0002553279,0.0009444523,0.000110975816],"about_ca_topic_score_codex":0.0011435868,"about_ca_topic_score_gemma":0.003322509,"teacher_disagreement_score":0.760518,"about_ca_system_score_codex":0.00010859179,"about_ca_system_score_gemma":0.000084015235,"threshold_uncertainty_score":0.37568322},"labels":[],"label_agreement":null},{"id":"W3121913816","doi":"10.1287/opre.2017.1606","title":"Inverse Optimization for the Recovery of Market Structure from Market Outcomes: An Application to the MISO Electricity Market","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Electricity market; Residual; Market power; Commodity; Spot contract; Economics; Market price; Econometrics; Commodity market; Shadow price; Electricity; Derivatives market; Microeconomics; Mathematical optimization; Computer science; Futures contract; Financial economics; Mathematics; Algorithm; Monopoly","score_opus":0.026389042195668316,"score_gpt":0.3199694111104669,"score_spread":0.29358036891479855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121913816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018190125,0.00015773434,0.96752995,0.0025062754,0.00037782762,0.004111036,0.0005295441,0.000089758105,0.0065077385],"genre_scores_gemma":[0.9679907,0.0002654276,0.026175248,0.000090328766,0.00024918796,0.0010317675,0.00020386222,0.00007476333,0.003918698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819595,0.00032780896,0.00034852803,0.00030547386,0.00047820393,0.00034404866],"domain_scores_gemma":[0.99706525,0.0006945825,0.000053916374,0.0015183435,0.00058207393,0.00008585811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017808703,0.00016001395,0.00019439775,0.00018401675,0.001258319,0.000476923,0.001050954,0.00013658554,0.00070291717],"category_scores_gemma":[0.0013829978,0.00010918511,0.000059007973,0.0004405038,0.00006460764,0.0004890754,0.00008685221,0.00028283492,0.000008421967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084674335,0.000027154223,0.0006378168,0.00002653407,0.00008779822,1.7230012e-7,0.00024371216,0.9163118,0.0010605124,0.00009691776,0.07475253,0.0066703595],"study_design_scores_gemma":[0.00027143824,0.0000616037,0.0077556777,0.000014090469,0.000021363707,8.647621e-7,0.000093525734,0.98685867,0.00080662104,0.00007036866,0.0039237137,0.00012204433],"about_ca_topic_score_codex":0.0008380468,"about_ca_topic_score_gemma":0.0031724821,"teacher_disagreement_score":0.9498006,"about_ca_system_score_codex":0.00019709812,"about_ca_system_score_gemma":0.00012051234,"threshold_uncertainty_score":0.9678099},"labels":[],"label_agreement":null},{"id":"W3122384578","doi":"10.1287/opre.1080.0654","title":"Toward Robust Revenue Management: Competitive Analysis of Online Booking","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Competitive analysis; Revenue; Online algorithm; Revenue management; Computer science; Operations research; Upper and lower bounds; Perspective (graphical); Sequence (biology); Control (management); Mathematical optimization; Business; Microeconomics; Economics; Algorithm; Mathematics; Finance; Artificial intelligence","score_opus":0.12677905652401197,"score_gpt":0.3956695854522347,"score_spread":0.26889052892822274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122384578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042884587,0.00011543331,0.9385695,0.008973265,0.000044404977,0.00056902424,0.000060676957,0.000060854552,0.047318403],"genre_scores_gemma":[0.80179775,0.00028151777,0.191967,0.000203487,0.000024168541,0.000017360218,0.000088160334,0.000004596295,0.005615989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983911,0.00025873826,0.0002243024,0.00026987557,0.00060171104,0.00025428034],"domain_scores_gemma":[0.99881583,0.000060572176,0.000016247499,0.00045818865,0.0005712283,0.00007794423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087094546,0.00006200723,0.00014761303,0.0010012991,0.00026162906,0.00022200769,0.00067880657,0.000031070536,0.00011877018],"category_scores_gemma":[0.0000657514,0.000059550042,0.00006235592,0.0037023854,0.000064729684,0.00034464494,0.00018573843,0.00019469156,0.000023835204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036530123,0.00020816724,0.000056291246,0.000008453754,0.00013657655,0.00001118082,0.0012152498,0.35757676,0.0002681065,0.62885326,0.0005089919,0.011153316],"study_design_scores_gemma":[0.00021334579,0.0001344146,0.0053942953,0.000031098636,0.00002423769,9.0956695e-7,0.00035145474,0.98999107,0.00016209001,0.00045711576,0.0031492524,0.00009072058],"about_ca_topic_score_codex":0.00005475908,"about_ca_topic_score_gemma":0.0002661988,"teacher_disagreement_score":0.79750925,"about_ca_system_score_codex":0.000050788924,"about_ca_system_score_gemma":0.000076140626,"threshold_uncertainty_score":0.24283803},"labels":[],"label_agreement":null},{"id":"W3122935367","doi":"10.1287/opre.2016.1547","title":"Behavioral Anomalies in Consumer Wait-or-Buy Decisions and Their Implications for Markdown Management","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Stackelberg competition; Revenue management; Generalization; Economics; Microeconomics; Expected utility hypothesis; Preference; Behavioral modeling; Revenue; Sample (material); Consumer behaviour; Computer science; Econometrics; Mathematical economics; Mathematics; Business; Marketing","score_opus":0.15838058325912024,"score_gpt":0.3962216890716573,"score_spread":0.23784110581253703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122935367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97820485,0.00020458466,0.0029162022,0.00852661,0.00011123461,0.0017736639,0.000074237294,0.00006408333,0.008124546],"genre_scores_gemma":[0.992593,0.0002808376,0.0011916882,0.00011449477,0.00009023264,0.00101667,0.000034316396,0.000025280806,0.0046534655],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987177,0.000041192136,0.00028859972,0.00038141877,0.00014395648,0.00042712997],"domain_scores_gemma":[0.99871904,0.000493014,0.000019579391,0.00039929242,0.0003410929,0.000028008953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010570016,0.00014141436,0.0001533466,0.0007403971,0.0007349078,0.00049692375,0.00026913764,0.00005900633,0.0005172088],"category_scores_gemma":[0.00021507769,0.000088687746,0.00004346765,0.00070323684,0.0001740951,0.0007458225,0.00035926548,0.00011661961,0.000075186625],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014177806,0.00028861835,0.15564263,0.000046310626,0.000024253035,0.0000048703555,0.00013391011,0.000005918042,0.0047573834,0.039961018,0.005765794,0.7932275],"study_design_scores_gemma":[0.0025278958,0.000050395935,0.6944025,0.00025240253,0.00006060288,0.000008949435,0.0017555741,0.0011944836,0.00012389844,0.0040657157,0.29504555,0.0005120037],"about_ca_topic_score_codex":0.0005538309,"about_ca_topic_score_gemma":0.006095512,"teacher_disagreement_score":0.7927155,"about_ca_system_score_codex":0.00004991514,"about_ca_system_score_gemma":0.000048564994,"threshold_uncertainty_score":0.56630737},"labels":[],"label_agreement":null},{"id":"W3123093843","doi":"10.1287/opre.2017.1716","title":"Quantile-Based Risk Sharing","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich; Swiss Finance Institute; Michigan State University","keywords":"Subadditivity; Quantile; Expected shortfall; Coherent risk measure; Value at risk; Risk measure; Risk management; Pareto principle; Arrow; Econometrics; Dynamic risk measure; Computer science; Actuarial science; Economics; Mathematics; Mathematical optimization; Financial economics; Finance","score_opus":0.39534550782819544,"score_gpt":0.5564986340027319,"score_spread":0.16115312617453648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123093843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79842675,0.00006672988,0.13500164,0.0017785461,0.00035266555,0.00041032015,0.000028639735,0.00005970039,0.06387503],"genre_scores_gemma":[0.9772626,0.00007751673,0.008285423,0.00006206073,0.00029784153,0.000033006385,0.000012738695,0.0000106543575,0.013958159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662435,0.00047754403,0.0003758067,0.0004589392,0.0017395952,0.0003237831],"domain_scores_gemma":[0.9961407,0.00055732235,0.000027257984,0.0008795515,0.0022673132,0.00012782592],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008074106,0.000070396905,0.0001073961,0.0006895638,0.001556299,0.0011620523,0.0007819976,0.00006608402,0.0032949038],"category_scores_gemma":[0.0055756536,0.00005185956,0.000047522448,0.0023289188,0.00029067197,0.00040968083,0.00014349593,0.00025550174,0.0063275495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017279138,0.00041754404,0.26035503,0.0000027451367,0.000031373194,0.000016604019,0.0031450465,0.32602483,0.0036074505,0.062578104,0.1425091,0.20113936],"study_design_scores_gemma":[0.00022172155,0.00013922591,0.009517417,0.0000055363007,0.0000021863675,0.0000011804358,0.00027204747,0.9156995,0.0027948907,0.0027873062,0.068466894,0.00009210573],"about_ca_topic_score_codex":0.00070450007,"about_ca_topic_score_gemma":0.0012133358,"teacher_disagreement_score":0.58967465,"about_ca_system_score_codex":0.00003645208,"about_ca_system_score_gemma":0.00025718502,"threshold_uncertainty_score":0.99987483},"labels":[],"label_agreement":null},{"id":"W3123368395","doi":"10.1287/opre.2015.1358","title":"Optimal Joint Replenishment and Transshipment Policies in a Multi-Period Inventory System with Lost Sales","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transshipment (information security); Supply chain; Inventory control; Holding cost; Order (exchange); Partition (number theory); Operations research; Computer science; Mathematical optimization; Economics; Business; Mathematics","score_opus":0.177332782922222,"score_gpt":0.3342421378083029,"score_spread":0.15690935488608093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123368395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811624,0.00030819964,0.0006621321,0.0045263567,0.00011269227,0.0012668846,0.000004231331,0.000072924624,0.011884171],"genre_scores_gemma":[0.996402,0.000015552178,0.00088318763,0.00020458529,0.00019064438,0.00028617683,0.000037817674,0.00002577724,0.0019542167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981729,0.000081626255,0.00029944582,0.0003646756,0.00065346784,0.0004279146],"domain_scores_gemma":[0.99932593,0.000010637333,0.00002384818,0.00029956122,0.00028468054,0.000055333127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017096114,0.00015758774,0.00018715413,0.0007034735,0.00028827536,0.0007364864,0.0001897982,0.00004598256,0.00007188384],"category_scores_gemma":[0.000068933776,0.00012921939,0.00002591097,0.00058849266,0.00018972399,0.0007117017,0.0002185364,0.00021333258,0.0002485279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012978036,0.004680833,0.18804492,0.004823086,0.00051083544,0.0010065804,0.042483103,0.16766424,0.0046432656,0.51020443,0.07072655,0.003914337],"study_design_scores_gemma":[0.009212109,0.00045402275,0.026448825,0.0010219128,0.00005541901,0.000034759414,0.1734424,0.6756267,0.00043779795,0.000052334046,0.11209953,0.0011141797],"about_ca_topic_score_codex":0.003708283,"about_ca_topic_score_gemma":0.0045705787,"teacher_disagreement_score":0.5101521,"about_ca_system_score_codex":0.0003028918,"about_ca_system_score_gemma":0.000104615654,"threshold_uncertainty_score":0.71019554},"labels":[],"label_agreement":null},{"id":"W3123807619","doi":"10.1287/opre.2015.1380","title":"Multi-Product Price and Assortment Competition","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Planning, Research and Evaluation","keywords":"Product (mathematics); Competition (biology); Competitor analysis; Demand curve; Economics; Microeconomics; Set (abstract data type); Nash equilibrium; Mathematical economics; Mathematics; Computer science","score_opus":0.19292144946024328,"score_gpt":0.38402246702807763,"score_spread":0.19110101756783435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123807619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9619249,0.00028697157,0.0007575185,0.0034708513,0.00021651822,0.0005612869,0.0000027233548,0.00007280907,0.03270642],"genre_scores_gemma":[0.99577785,0.000019341196,0.001326204,0.00012101409,0.00029105795,0.000055479744,0.00003934017,0.000010612406,0.0023591127],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.999082,0.00004160611,0.000116945164,0.00021227947,0.00034063664,0.00020647557],"domain_scores_gemma":[0.9991955,0.000028843011,0.000009973938,0.0001867246,0.0005546567,0.000024264364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014842969,0.00006592729,0.000071657945,0.00025340903,0.00038946903,0.0005925846,0.0001013553,0.00002192512,0.00022643954],"category_scores_gemma":[0.0003343922,0.000060120645,0.000012601223,0.00044976565,0.00006185168,0.0006630342,0.00019257414,0.00016380737,0.00034346417],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024066755,0.0021509083,0.5946961,0.0004623879,0.00012035465,0.000108383225,0.0021608807,0.0018820215,0.050555874,0.11791564,0.049828738,0.17987806],"study_design_scores_gemma":[0.0025077653,0.00004747866,0.43551677,0.00008200769,0.000055408796,0.000014418943,0.0022366492,0.10105018,0.00048226424,0.0004216919,0.45701203,0.0005733206],"about_ca_topic_score_codex":0.0020100146,"about_ca_topic_score_gemma":0.0010829456,"teacher_disagreement_score":0.4071833,"about_ca_system_score_codex":0.000037925598,"about_ca_system_score_gemma":0.00005132881,"threshold_uncertainty_score":0.5714307},"labels":[],"label_agreement":null},{"id":"W3124606219","doi":"10.1287/opre.2020.2034","title":"Points Gained in Football: Using Markov Process-Based Value Functions to Assess Team Performance","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Football; Football team; Value (mathematics); Process (computing); Computer science; Markov chain; Markov process; Markov decision process; Operations research; Mathematics; Mathematical optimization; Statistics; Geography","score_opus":0.19930816422658443,"score_gpt":0.38648190027871077,"score_spread":0.18717373605212634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124606219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727784,0.00016447862,0.0061229873,0.001618876,0.00017112683,0.0003214712,0.000081507955,0.000015984613,0.018725205],"genre_scores_gemma":[0.99157006,0.00006376717,0.0027501325,0.00027700607,0.00009668997,0.000101127094,0.00007827961,0.000025395284,0.0050375722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998365,0.00003852786,0.0005041399,0.0004701683,0.00015473663,0.00046745568],"domain_scores_gemma":[0.9989321,0.00004836345,0.000031756506,0.00044797763,0.0004044235,0.00013535183],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016363972,0.00011777011,0.00023940389,0.00071292225,0.00049578154,0.00030358796,0.0002204483,0.00008025902,0.001386574],"category_scores_gemma":[0.00031775486,0.00013638273,0.00005186146,0.0019635358,0.00004838378,0.0003312248,0.00007533336,0.00035835273,0.0005466946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003312908,0.0003916318,0.31877166,0.000086434105,0.000025069701,0.000015945885,0.00034685875,0.66584283,0.0003323132,0.012410126,0.0010898713,0.00065411703],"study_design_scores_gemma":[0.00040077232,0.0000730299,0.044071827,0.000058947982,0.0000021249614,0.0000032441649,0.00026738137,0.9418919,0.0006062222,0.00017944664,0.012236008,0.00020907805],"about_ca_topic_score_codex":0.0004852805,"about_ca_topic_score_gemma":0.0009902056,"teacher_disagreement_score":0.27604908,"about_ca_system_score_codex":0.00027936438,"about_ca_system_score_gemma":0.0004703478,"threshold_uncertainty_score":0.9995263},"labels":[],"label_agreement":null},{"id":"W3125033276","doi":"10.1287/opre.2020.2050","title":"Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Queue; Computer science; Operations research; Operations management; Nursing; Computer network; Medicine; Mathematics; Engineering","score_opus":0.15803834856335675,"score_gpt":0.4928225199909892,"score_spread":0.33478417142763245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125033276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616244,0.0001685473,0.030260425,0.005420249,0.00004644249,0.00094316574,0.000027909633,0.000025292842,0.0014835799],"genre_scores_gemma":[0.97100717,0.000029260269,0.022400897,0.000033235447,0.000014996046,0.0010140177,0.000032020766,0.00001684126,0.005451552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599046,0.00058918144,0.00051541993,0.000698155,0.0016650633,0.00054175133],"domain_scores_gemma":[0.9975688,0.0003731877,0.000024527175,0.00081484043,0.001023451,0.00019522615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030055675,0.00012577753,0.0001977266,0.00081384165,0.0004987098,0.00042021842,0.0004646736,0.000056727287,0.00046577438],"category_scores_gemma":[0.0010404146,0.00009328038,0.000028061888,0.0056978,0.00007890751,0.00035201578,0.00011329981,0.00037351786,0.0004907508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008148993,0.0015049127,0.10567558,0.000008354422,0.000038730872,0.00007159794,0.0028338206,0.87444735,0.0026307213,0.007124347,0.00038591347,0.0051971646],"study_design_scores_gemma":[0.003813003,0.0006449915,0.34579656,0.00026086622,0.000030263,0.00002605071,0.033398096,0.5970035,0.0031274187,0.003537745,0.011326888,0.0010346029],"about_ca_topic_score_codex":0.00070801197,"about_ca_topic_score_gemma":0.119454056,"teacher_disagreement_score":0.27744383,"about_ca_system_score_codex":0.00031259278,"about_ca_system_score_gemma":0.00075013126,"threshold_uncertainty_score":0.8966136},"labels":[],"label_agreement":null},{"id":"W3125597808","doi":"10.1287/opre.2018.1806","title":"Dynamic Stable Supplier Coalitions and Invariance in Assembly Systems with Commodity Components","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Commodity; Product (mathematics); Supply chain; Industrial organization; Market power; Business; Microeconomics; Stochastic game; Power (physics); Computer science; Economics; Commerce; Marketing; Mathematics; Monopoly; Finance","score_opus":0.05915052432008149,"score_gpt":0.30220483572923146,"score_spread":0.24305431140914996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125597808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588829,0.00006741186,0.00039225983,0.0016987122,0.00014598797,0.0012719549,0.00001558259,0.00003505554,0.037490085],"genre_scores_gemma":[0.9933683,0.000018164445,0.00012896933,0.00019796562,0.000057277695,0.00020032175,0.00020703649,0.000017620507,0.00580432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865985,0.00006914722,0.00018648975,0.00029565152,0.00044220357,0.00034666367],"domain_scores_gemma":[0.99937016,0.000053238884,0.000018896386,0.00032634477,0.00021214913,0.000019202438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010494788,0.000104714636,0.00015145204,0.0004261266,0.00035543356,0.00088196644,0.00020938674,0.00004097577,0.00037994471],"category_scores_gemma":[0.000028388251,0.0000919334,0.000012071101,0.0006519501,0.00008396452,0.0010761104,0.0002280587,0.00024298998,0.0005812621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018618471,0.0011582058,0.2482489,0.0013326624,0.00010942127,0.000053291475,0.0004489054,0.08202335,0.0052495264,0.63697886,0.023772089,0.00043858247],"study_design_scores_gemma":[0.0013969691,0.000036222253,0.051597238,0.00017488522,0.000008104181,0.0000021972285,0.0020372972,0.8563509,0.000010467527,0.00025700164,0.08787959,0.00024911502],"about_ca_topic_score_codex":0.0064250994,"about_ca_topic_score_gemma":0.0049381293,"teacher_disagreement_score":0.7743276,"about_ca_system_score_codex":0.0001081219,"about_ca_system_score_gemma":0.0000375955,"threshold_uncertainty_score":0.97128713},"labels":[],"label_agreement":null},{"id":"W3125629652","doi":"10.1287/opre.2020.2014","title":"Multilevel Approaches for the Critical Node Problem","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Node (physics); Game theory; Mathematical optimization; Operations research; Mathematical economics; Mathematics; Engineering","score_opus":0.15716474246336812,"score_gpt":0.392743982750647,"score_spread":0.23557924028727886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125629652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013363026,0.0008968952,0.96923006,0.0076085282,0.00011112514,0.0005899206,0.00005693771,0.000078144694,0.008065366],"genre_scores_gemma":[0.9737498,0.000045582976,0.024686296,0.000026838923,0.00013560065,0.00039432544,0.00002283933,0.000012422107,0.00092628784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991123,0.00008543449,0.00012606103,0.00015798649,0.00024053107,0.00027769367],"domain_scores_gemma":[0.99866,0.0006351726,0.0000010865476,0.00029916977,0.0003586747,0.000045864632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611967,0.00005922353,0.000078165926,0.000054298926,0.00066964474,0.0002165734,0.0001626477,0.00005340096,0.00028561364],"category_scores_gemma":[0.0007212723,0.000041359002,0.00005655089,0.00033851698,0.00014540264,0.00011707731,0.00003848538,0.00028873252,0.000032806744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019183883,0.000026177977,0.00003756169,0.000059029142,0.000034029163,0.0000011910603,0.00035551458,0.9528775,0.0031999752,0.026039615,0.0017298141,0.015637629],"study_design_scores_gemma":[0.00006758956,0.0000071564696,0.0002479729,0.0000057589054,0.000009456921,0.0000033851602,0.00066599407,0.9839484,0.0076110885,0.00081936474,0.006556164,0.000057675763],"about_ca_topic_score_codex":0.000025412684,"about_ca_topic_score_gemma":0.00028178032,"teacher_disagreement_score":0.96038675,"about_ca_system_score_codex":0.000045324326,"about_ca_system_score_gemma":0.00010040027,"threshold_uncertainty_score":0.5150434},"labels":[],"label_agreement":null},{"id":"W3125830023","doi":"10.1287/opre.1080.0536","title":"Coalition Stability in Assembly Models","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stackelberg competition; Alliance; Competition (biology); Supply chain; Downstream (manufacturing); Industrial organization; Product (mathematics); Market power; Function (biology); Stability (learning theory); Microeconomics; Economics; Business; Computer science; Marketing; Operations management; Monopoly; Mathematics","score_opus":0.2907694309875252,"score_gpt":0.35552199371255017,"score_spread":0.06475256272502494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125830023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82737476,0.00003455338,0.0012326073,0.0023956418,0.00010384067,0.0005596027,0.0000019862882,0.000054565262,0.16824245],"genre_scores_gemma":[0.99698544,0.000029362063,0.00017118409,0.0004002465,0.00028215355,0.00016709647,0.000057227222,0.000012092524,0.0018951915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860877,0.00006629675,0.00021263429,0.00026469366,0.00052452186,0.00032310517],"domain_scores_gemma":[0.9993262,0.0000334015,0.000009914635,0.00029680732,0.00032054313,0.000013124966],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001493193,0.00007809936,0.00009502759,0.00049377064,0.0004966307,0.00022628308,0.00021505344,0.00004148307,0.0009651918],"category_scores_gemma":[0.00015128434,0.00007614743,0.00003056763,0.0008999194,0.000105798885,0.0017168901,0.00018421347,0.00020944075,0.0006201257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008695526,0.0014850189,0.030695593,0.00023569459,0.000025653782,0.000097342134,0.0011651127,0.06231399,0.0033075523,0.818779,0.079430126,0.0023779457],"study_design_scores_gemma":[0.0008355677,0.000021678045,0.01432038,0.000031688,0.0000035856635,0.0000016812745,0.0018619745,0.91623086,0.0003154006,0.006048217,0.060071878,0.00025710106],"about_ca_topic_score_codex":0.0037703936,"about_ca_topic_score_gemma":0.002554515,"teacher_disagreement_score":0.8539169,"about_ca_system_score_codex":0.000121718134,"about_ca_system_score_gemma":0.00005498917,"threshold_uncertainty_score":0.9999481},"labels":[],"label_agreement":null},{"id":"W3126058378","doi":"10.1287/opre.2021.2101","title":"Technical Note–A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Heuristic; Computer science; Operations research; Distribution (mathematics); Mathematical optimization; Inventory control; Inventory management; Stochastic modelling; Operations management; Mathematics; Economics; Statistics","score_opus":0.06746599596310007,"score_gpt":0.3531220728369406,"score_spread":0.28565607687384054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126058378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042834193,0.0009100102,0.902606,0.01872893,0.0011092257,0.008789995,0.00032848856,0.00053830293,0.024154855],"genre_scores_gemma":[0.9913634,0.00000888759,0.00024179301,0.00034778606,0.0012879885,0.0012250274,0.0018906906,0.00003509463,0.0035993184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979895,0.00007170588,0.00029487238,0.00041870985,0.0006923415,0.0005329193],"domain_scores_gemma":[0.99835795,0.00011448463,0.000032756026,0.00043321343,0.0010165832,0.00004499265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000899814,0.00015487165,0.00018143764,0.00031831826,0.0008417953,0.0009894605,0.00026118566,0.00007206461,0.00014083872],"category_scores_gemma":[0.0010892862,0.00013802615,0.000056194407,0.0009357726,0.00012594915,0.00045559517,0.0002730595,0.00022927609,0.00018938443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024336447,0.0012822179,0.0012436659,0.0011123633,0.00010286169,0.00009062868,0.00011244295,0.07212263,0.0041268812,0.7290666,0.18486096,0.0056353426],"study_design_scores_gemma":[0.0023994006,0.00016749698,0.0018491802,0.00028822472,0.00008128045,0.000010949038,0.0019823257,0.5126711,0.00020137585,0.0010804295,0.4786566,0.0006116307],"about_ca_topic_score_codex":0.0014767136,"about_ca_topic_score_gemma":0.0017539647,"teacher_disagreement_score":0.94852924,"about_ca_system_score_codex":0.00062832964,"about_ca_system_score_gemma":0.00031108607,"threshold_uncertainty_score":0.954139},"labels":[],"label_agreement":null},{"id":"W3128553668","doi":"10.1287/opre.2020.2027","title":"On the Optimal Design of a Bipartite Matching Queueing System","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Computer science; Mathematical optimization; Queueing system; Layered queueing network; Mathematics; Theoretical computer science; Statistics; Computer network; Graph","score_opus":0.08790752156144246,"score_gpt":0.34373971583209384,"score_spread":0.2558321942706514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128553668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69885325,0.0001220223,0.27659166,0.003968457,0.00010549981,0.0005078011,0.0000030560172,0.000101254846,0.01974697],"genre_scores_gemma":[0.9960209,0.000003770406,0.0022974734,0.00013882003,0.00018726567,0.000060825467,0.000007131652,0.000016279915,0.0012675277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872786,0.00023710364,0.00019905332,0.00019840313,0.00041637337,0.00022122706],"domain_scores_gemma":[0.99844086,0.0005174785,0.000027939164,0.00039386263,0.0006118288,0.000008018964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024310467,0.00007252355,0.000118329874,0.00023536073,0.0007841226,0.00039705873,0.0002407636,0.000028232647,0.00035494956],"category_scores_gemma":[0.000933029,0.000052612057,0.00004883612,0.0012546717,0.00007507338,0.00046057883,0.00017979188,0.00023367352,0.00035426804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012169847,0.000023491408,0.0000091500815,0.000029883297,0.000019689483,0.000010418545,0.00007061437,0.49688905,0.009144517,0.4934445,0.00020340472,0.0001431031],"study_design_scores_gemma":[0.00017004598,0.00001251989,0.000029111987,0.00026935546,0.00003013516,0.0000032390064,0.005249667,0.9798812,0.00691131,0.006023644,0.0012846577,0.00013508607],"about_ca_topic_score_codex":0.00023462277,"about_ca_topic_score_gemma":0.00007712096,"teacher_disagreement_score":0.48742086,"about_ca_system_score_codex":0.000048609534,"about_ca_system_score_gemma":0.000063700245,"threshold_uncertainty_score":0.60309166},"labels":[],"label_agreement":null},{"id":"W3130305711","doi":"10.1287/opre.2020.2015","title":"A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University","funders":"","keywords":"Outcome (game theory); Ranking (information retrieval); Matching (statistics); Queue; Computer science; Bipartite graph; Resource allocation; Decision maker; Mathematical optimization; Class (philosophy); Balance (ability); Operations research; Microeconomics; Economics; Mathematics; Artificial intelligence; Statistics; Psychology; Theoretical computer science","score_opus":0.10073748920836752,"score_gpt":0.36512088502437245,"score_spread":0.26438339581600495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130305711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5534229,0.00017493284,0.42687058,0.008474053,0.00007601402,0.00094246,0.000027900542,0.00023586521,0.009775241],"genre_scores_gemma":[0.96436757,0.000026709755,0.01684588,0.0005166417,0.0004367994,0.0004142413,0.00015151684,0.000058919097,0.017181695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813783,0.00006402717,0.0002626563,0.00045362723,0.00062521076,0.00045663872],"domain_scores_gemma":[0.9976324,0.00014518143,0.000030319754,0.00053008564,0.0016360079,0.000026046493],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014585628,0.00014021993,0.0002122232,0.00036386307,0.0010606294,0.0010870587,0.00027056172,0.000056188357,0.00028482062],"category_scores_gemma":[0.0007386146,0.0001269028,0.00007301089,0.000979862,0.000083524894,0.0014688773,0.00025618332,0.00024907338,0.00020589014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010402701,0.00014420995,0.00004734521,0.00009747253,0.00008756496,0.000016734804,0.00028639962,0.8058805,0.025624482,0.1663325,0.0006783455,0.00070041633],"study_design_scores_gemma":[0.00045914133,0.000012597257,0.000013230104,0.00010797015,0.0000556855,0.0000025417417,0.0010311933,0.9597418,0.0038699966,0.0325405,0.0019528214,0.00021256942],"about_ca_topic_score_codex":0.00047381237,"about_ca_topic_score_gemma":0.005378254,"teacher_disagreement_score":0.41094464,"about_ca_system_score_codex":0.00008887258,"about_ca_system_score_gemma":0.00019000724,"threshold_uncertainty_score":0.99994993},"labels":[],"label_agreement":null},{"id":"W3131209981","doi":"10.1287/opre.2020.2079","title":"Duopoly Competition with Network Effects in Discrete Choice Models","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Duopoly; Competitor analysis; Market power; Competition (biology); Industrial organization; Market share; Microeconomics; Business; Market structure; Relevant market; Economics; Unit (ring theory); Marketing; Cournot competition; Monopoly","score_opus":0.0463207155438962,"score_gpt":0.28922834648223805,"score_spread":0.24290763093834186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131209981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8637927,0.00005580122,0.0018547197,0.00062490226,0.00007307799,0.00024417037,0.0000011855449,0.000022714079,0.13333072],"genre_scores_gemma":[0.99655163,0.000009969622,0.0005227831,0.0003160588,0.00046733263,0.000058449717,0.00013932587,0.00001459444,0.0019198594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992156,0.0000049527907,0.000122020996,0.00019453905,0.00016569198,0.00029720328],"domain_scores_gemma":[0.9996029,0.00006367161,0.000009552416,0.000169842,0.00014121906,0.000012830826],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003132063,0.000068877736,0.0000986032,0.00012393013,0.00027549028,0.0016236157,0.00010270923,0.00003199709,0.00010875638],"category_scores_gemma":[0.00006658444,0.00005882791,0.00001833435,0.00064185704,0.000042725253,0.0042415974,0.0001249074,0.00017105453,0.0002560178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001644856,0.00006172368,0.0022395286,0.000049352413,0.000009565633,0.000025430452,0.000016155314,0.30989218,0.0000567344,0.68544704,0.00081249076,0.0013733301],"study_design_scores_gemma":[0.0008086753,0.000025000296,0.0055371323,0.0001772274,0.000005520174,0.0000030611236,0.0003890258,0.9438366,0.000051839397,0.03752316,0.011416811,0.0002259313],"about_ca_topic_score_codex":0.0012947514,"about_ca_topic_score_gemma":0.017876264,"teacher_disagreement_score":0.6479239,"about_ca_system_score_codex":0.000040132145,"about_ca_system_score_gemma":0.000053983153,"threshold_uncertainty_score":0.9994128},"labels":[],"label_agreement":null},{"id":"W3132873744","doi":"10.1287/opre.2020.2037","title":"Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis; Wilfrid Laurier University; Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Branch and cut; Routing (electronic design automation); Mathematical optimization; Algorithm; Mathematics; Integer programming; Computer network","score_opus":0.049962690972596556,"score_gpt":0.3392341381493094,"score_spread":0.2892714471767129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132873744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026392752,0.00064774614,0.9700409,0.0011085363,0.000042645766,0.00075777376,0.000015477439,0.00008644365,0.0009076952],"genre_scores_gemma":[0.85987025,0.000089445486,0.13731864,0.00002360631,0.00006605798,0.00022775121,0.000020387666,0.00004951409,0.0023343617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989785,0.00013689892,0.00016116066,0.00021029323,0.00021824196,0.00029488068],"domain_scores_gemma":[0.9986019,0.00075226865,0.000007252092,0.00018637083,0.0003801146,0.00007207151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992889,0.000096243755,0.00011564717,0.0000708967,0.00069796067,0.00028912007,0.00008694519,0.00006173276,0.000043650074],"category_scores_gemma":[0.00031595168,0.00007206891,0.000014568416,0.00051039015,0.00010882764,0.00013101067,0.000054527034,0.0003171051,0.000005402447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075598227,0.000014450483,0.00005398357,0.000034651373,0.000053647043,0.0000017385328,0.0012125451,0.9773242,0.0046339836,0.001965031,0.000111595255,0.014586608],"study_design_scores_gemma":[0.00048263394,0.00004009754,0.000527236,0.00004045335,0.000014696805,0.000025887644,0.00050773437,0.9962324,0.0018669417,0.00007165685,0.00009259718,0.00009765101],"about_ca_topic_score_codex":0.000033228403,"about_ca_topic_score_gemma":0.0000571521,"teacher_disagreement_score":0.8334775,"about_ca_system_score_codex":0.000038705042,"about_ca_system_score_gemma":0.000100566525,"threshold_uncertainty_score":0.53682196},"labels":[],"label_agreement":null},{"id":"W3132995834","doi":"10.1287/opre.2020.2016","title":"Nonparametric Pricing Analytics with Customer Covariates","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Revenue management; Analytics; Revenue; Profitability index; Regret; Purchasing; Pricing strategies; Business analytics; Profit maximization; Profit (economics); Computer science; Business; Marketing; Microeconomics; Economics; Business model; Data science; Finance; Electronic business","score_opus":0.0766821703988028,"score_gpt":0.348634448130574,"score_spread":0.27195227773177116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132995834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8260674,0.00026884326,0.0035226226,0.002366334,0.00017552135,0.00041787606,0.0000034898444,0.0001082544,0.16706966],"genre_scores_gemma":[0.99170893,0.000025869285,0.0018385529,0.00022647668,0.00025491067,0.000033553744,0.000044620465,0.000022644914,0.0058444417],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985578,0.00004762975,0.00017754069,0.0002931724,0.0005598517,0.00036402923],"domain_scores_gemma":[0.9981147,0.00016571615,0.000016310567,0.0003437139,0.0013398342,0.000019692287],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009239958,0.00010285771,0.00013685931,0.00075499533,0.0007143787,0.0012202488,0.00017891575,0.000045852667,0.0017250592],"category_scores_gemma":[0.00050955825,0.000086405365,0.00003411947,0.0048234956,0.00007317173,0.000687122,0.0002105386,0.00034405015,0.00077898125],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001882878,0.0013219547,0.6899704,0.00049993716,0.00033722311,0.00086120225,0.0005587973,0.026935102,0.02274596,0.13626772,0.01765065,0.10266282],"study_design_scores_gemma":[0.0031955703,0.00007046819,0.28078532,0.00033865866,0.00046605608,0.000086523265,0.004286492,0.28194815,0.0042661303,0.00054782804,0.42239276,0.0016160428],"about_ca_topic_score_codex":0.0014661184,"about_ca_topic_score_gemma":0.001629002,"teacher_disagreement_score":0.40918502,"about_ca_system_score_codex":0.000042084168,"about_ca_system_score_gemma":0.0001892089,"threshold_uncertainty_score":0.99999905},"labels":[],"label_agreement":null},{"id":"W3139482639","doi":"10.1287/opre.2020.2086","title":"Optimal Control of Partially Observable Semi-Markovian Failing Systems: An Analysis Using a Phase Methodology","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Observable; Markov decision process; Limit (mathematics); Computer science; Optimal control; Mathematical optimization; Markov process; Partially observable Markov decision process; Sequence (biology); Control (management); Reliability (semiconductor); Class (philosophy); Markov chain; Control limits; Phase (matter); Process (computing); Mathematics; Artificial intelligence; Statistics","score_opus":0.16210525793678052,"score_gpt":0.41887687022670583,"score_spread":0.2567716122899253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139482639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37786853,0.00027222952,0.6213772,0.00003978025,0.000059241545,0.00018295228,0.000031536332,0.000029904368,0.00013859593],"genre_scores_gemma":[0.91174775,0.00011427281,0.08772759,0.000006066751,0.000049940183,0.00005287824,0.000105099614,0.000017380313,0.00017901037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977285,0.000997946,0.00039914463,0.0002564452,0.00027940882,0.0003385518],"domain_scores_gemma":[0.9980444,0.00033618908,0.000015004403,0.00044819948,0.0010515954,0.00010461257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002235065,0.00009494509,0.00033813872,0.00028339383,0.00021812289,0.0001586512,0.00014404036,0.00010987833,0.00016820166],"category_scores_gemma":[0.0009280032,0.00009755327,0.00008259114,0.0014164316,0.00008122754,0.00037063635,0.000031669777,0.00022153607,0.000003831795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001979126,0.000081761726,0.0001749996,0.00006135692,0.00019923627,0.000007633686,0.00041499978,0.9023952,0.09568808,0.000795875,0.000009437,0.00015161753],"study_design_scores_gemma":[0.0004958036,0.00006086061,0.000029466484,0.000022857952,0.000111755406,0.0000045001652,0.0018818191,0.986734,0.0104461685,0.00000663703,0.00011718592,0.00008895519],"about_ca_topic_score_codex":0.0005484421,"about_ca_topic_score_gemma":0.00093706546,"teacher_disagreement_score":0.5338792,"about_ca_system_score_codex":0.00012567153,"about_ca_system_score_gemma":0.00027860628,"threshold_uncertainty_score":0.3978107},"labels":[],"label_agreement":null},{"id":"W3142903789","doi":"10.1287/opre.2021.0034","title":"Strong Optimal Classification Trees","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Flexibility (engineering); Heuristic; Computer science; Mathematical optimization; Integer (computer science); Decision tree; Machine learning; Revenue; Integer programming; Ranging; Artificial intelligence; Tree (set theory); Sample (material); Relaxation (psychology); Operations research; Mathematics; Statistics; Economics","score_opus":0.15154269227938005,"score_gpt":0.4452963514217984,"score_spread":0.29375365914241836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142903789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009265702,0.00047267656,0.9495042,0.017097076,0.00022168763,0.00021537539,0.000008856019,0.00039588212,0.022818547],"genre_scores_gemma":[0.9637838,0.00006392779,0.026969615,0.000017620909,0.00014690375,0.00009805034,0.00008708851,0.000008963043,0.008824056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984177,0.00028299703,0.00015315665,0.0004214408,0.00048016728,0.0002445342],"domain_scores_gemma":[0.99893975,0.00015600391,0.0000047546373,0.00063581887,0.00018726426,0.000076396034],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001277219,0.0000667708,0.000054917175,0.00035595158,0.00048506103,0.0017946531,0.0006504489,0.00004804028,0.00010886588],"category_scores_gemma":[0.00019241821,0.000057494213,0.000027353755,0.0010269205,0.00006596675,0.00095067907,0.00015314581,0.00042295526,0.001354656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010927179,0.000032138643,0.00006770531,0.000008817813,0.0000066902935,0.000004202689,0.00042308794,0.003303655,0.006611299,0.86000973,0.0058500287,0.12368155],"study_design_scores_gemma":[0.000037324768,0.00003945555,0.0037251038,0.000014901914,0.0000010779985,0.000005737223,0.000105130486,0.9088482,0.00025535005,0.00014973343,0.08675541,0.00006253313],"about_ca_topic_score_codex":0.000117636715,"about_ca_topic_score_gemma":0.00010046128,"teacher_disagreement_score":0.9545181,"about_ca_system_score_codex":0.00008091354,"about_ca_system_score_gemma":0.00025562794,"threshold_uncertainty_score":0.9994229},"labels":[],"label_agreement":null},{"id":"W3148122502","doi":"10.1287/opre.2021.2220","title":"Testing, Voluntary Social Distancing, and the Spread of an Infection","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Social distance; Turnover; Isolation (microbiology); Social isolation; Economics; Demographic economics; Public economics; Social psychology; Coronavirus disease 2019 (COVID-19); Psychology; Biology; Medicine; Disease","score_opus":0.5395695336892157,"score_gpt":0.556651879432337,"score_spread":0.017082345743121286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148122502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940914,0.000027450924,0.00052814075,0.0035829556,0.000022687795,0.00036958346,0.000011286601,0.0000667982,0.0012996907],"genre_scores_gemma":[0.99749357,0.000038076032,0.0014183017,0.000044044205,0.0001224349,0.00013133265,0.0000073005854,0.000008063346,0.00073690485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998483,0.0006841718,0.00020526182,0.00015967873,0.00027066405,0.00019720478],"domain_scores_gemma":[0.9948811,0.0046188524,0.000018253164,0.00016666098,0.00028526346,0.00002988938],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.004183127,0.00005644235,0.00015877569,0.00008155757,0.0009744533,0.000043054453,0.00010120487,0.000043772146,0.000037261965],"category_scores_gemma":[0.019468138,0.00003410151,0.000026975353,0.0006992042,0.0005031732,0.00007974779,0.00021648868,0.00021990042,0.000018483875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023088201,0.00048537282,0.18304566,0.0005225298,0.00019367186,0.000013506484,0.01686482,0.0017688717,0.005925247,0.69881606,0.05876434,0.03336906],"study_design_scores_gemma":[0.0012086404,0.00031856608,0.66655195,0.000053394982,0.000032692344,0.0000033959584,0.0016162051,0.09973295,0.00028532482,0.22638436,0.003627014,0.00018551564],"about_ca_topic_score_codex":0.0054736705,"about_ca_topic_score_gemma":0.005867908,"teacher_disagreement_score":0.4835063,"about_ca_system_score_codex":0.000053437954,"about_ca_system_score_gemma":0.00005383165,"threshold_uncertainty_score":0.9887913},"labels":[],"label_agreement":null},{"id":"W3157557796","doi":"10.1287/opre.2019.1961","title":"Asset Selling Under Debt Obligations","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Asset (computer security); Debt; Recourse debt; Business; Finance; Basis risk; Revenue; Payment; Internal debt; Monetary economics; Economics; Debt-to-GDP ratio; Capital asset pricing model","score_opus":0.22537184848467112,"score_gpt":0.3656735866695345,"score_spread":0.14030173818486336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157557796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5881546,0.0026860738,0.092807174,0.013328628,0.00052937225,0.0003459532,0.00037123763,0.0000615871,0.30171534],"genre_scores_gemma":[0.963653,0.00043515075,0.0040912707,0.00021044648,0.00014405826,0.000060245176,0.00010934643,0.000019657236,0.031276785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988992,0.000047959027,0.0003505311,0.00034715878,0.000042495914,0.00031261923],"domain_scores_gemma":[0.99915755,0.000104782725,0.000018562161,0.0004167787,0.00021117603,0.000091177484],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010205355,0.00006990131,0.00015730625,0.00019087561,0.0005983311,0.00037913953,0.00017107047,0.00007342148,0.0028517905],"category_scores_gemma":[0.00018968956,0.00008650255,0.00005821652,0.0004353824,0.00007336863,0.00030273298,0.00009131783,0.00025223164,0.0024723185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010703211,0.00004509826,0.0005093848,0.0000036516672,0.000020564792,0.0000021532148,0.00023625356,0.020481544,0.00021782552,0.97694397,0.0014156838,0.00012278178],"study_design_scores_gemma":[0.00057138037,0.000046231064,0.0020388528,0.000019370726,0.0000036796525,0.000017045266,0.0017843435,0.11614515,0.0029289902,0.7228221,0.15323608,0.0003867829],"about_ca_topic_score_codex":0.000290527,"about_ca_topic_score_gemma":0.00058937055,"teacher_disagreement_score":0.3754984,"about_ca_system_score_codex":0.00012355336,"about_ca_system_score_gemma":0.00014859882,"threshold_uncertainty_score":0.99830437},"labels":[],"label_agreement":null},{"id":"W3166171467","doi":"10.1287/opre.2021.0243","title":"Robustifying Conditional Portfolio Decisions via Optimal Transport","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Portfolio; Business; Computer science; Finance","score_opus":0.3166300958996918,"score_gpt":0.5139018419605486,"score_spread":0.19727174606085673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166171467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076970376,0.0007628628,0.88833386,0.0027185266,0.00062763796,0.00051512447,0.00017205623,0.00014365926,0.029755905],"genre_scores_gemma":[0.94695777,0.0006107076,0.01914118,0.000062047206,0.00034715352,0.00012078361,0.00036484646,0.00002937591,0.03236614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99438846,0.0003475449,0.00079281663,0.00075020606,0.0032273117,0.00049364276],"domain_scores_gemma":[0.99598193,0.0016138961,0.000018231067,0.0006400857,0.0014700259,0.00027579986],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0061839498,0.00015362255,0.00020879805,0.0016191989,0.0012355844,0.0013796668,0.00069736416,0.00014338757,0.008873491],"category_scores_gemma":[0.0016503483,0.00011810182,0.00015686452,0.003889462,0.00026735198,0.0012331578,0.0000942236,0.000597196,0.003946908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020306234,0.00009384262,0.0007311126,0.0000022082886,0.000029250667,0.00016926297,0.0006165873,0.84811085,0.00075643265,0.043075886,0.0562766,0.050117668],"study_design_scores_gemma":[0.00015777585,0.00006876104,0.0035624388,0.00003256774,0.000010926293,0.00009217393,0.00046985626,0.8090302,0.0002904607,0.0074818046,0.17861225,0.00019078185],"about_ca_topic_score_codex":0.00014449412,"about_ca_topic_score_gemma":0.00020062242,"teacher_disagreement_score":0.86998737,"about_ca_system_score_codex":0.00009504969,"about_ca_system_score_gemma":0.00081279804,"threshold_uncertainty_score":0.999657},"labels":[],"label_agreement":null},{"id":"W316638995","doi":"10.1287/opre.1070.0495","title":"Multivariate Bayesian Control Chart","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control chart; EWMA chart; Control limits; Univariate; CUSUM; Bayesian probability; Multivariate statistics; Statistical process control; Statistics; Mathematics; Computer science; Econometrics; Process (computing)","score_opus":0.45841898425245137,"score_gpt":0.5737235205278415,"score_spread":0.11530453627539011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316638995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025128866,0.00007805713,0.9582712,0.0024766314,0.00022353874,0.00040631415,0.000044068795,0.000048945247,0.013322385],"genre_scores_gemma":[0.9670724,0.0000094776715,0.017948238,0.000054961256,0.00021844913,0.000092434544,0.00000293287,0.000012536992,0.0145885255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580663,0.00053594983,0.00042570132,0.00047494326,0.0022967437,0.00046005368],"domain_scores_gemma":[0.9950858,0.002474734,0.000016881835,0.00055805343,0.0016342447,0.0002303342],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029638002,0.00008946538,0.00017959329,0.0003432416,0.0016358844,0.00027216456,0.00064893777,0.000055367498,0.0010827517],"category_scores_gemma":[0.018336974,0.000067300345,0.000037500307,0.0012123315,0.00035646503,0.0005543485,0.000117882,0.0004277082,0.002667873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005041807,0.0013566646,0.041242994,0.000025715777,0.00012406256,0.0010164585,0.011433778,0.20221283,0.0847178,0.3184442,0.054857407,0.2840639],"study_design_scores_gemma":[0.002443769,0.0003016186,0.045568444,0.000026453343,0.0000050475633,0.00009540327,0.0015696727,0.85968775,0.0045321467,0.042611603,0.042636506,0.00052160025],"about_ca_topic_score_codex":0.0001577794,"about_ca_topic_score_gemma":0.00008135072,"teacher_disagreement_score":0.9419436,"about_ca_system_score_codex":0.00007282418,"about_ca_system_score_gemma":0.0002313001,"threshold_uncertainty_score":0.99983037},"labels":[],"label_agreement":null},{"id":"W3174830915","doi":"10.1287/opre.2022.2303","title":"Star-Shaped Risk Measures","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; University of Waterloo","funders":"","keywords":"Representation (politics); Computer science; Property (philosophy); Star (game theory); Coherent risk measure; Risk measure; Value (mathematics); Risk management; Risk analysis (engineering); Value at risk; Econometrics; Mathematics; Economics; Medicine; Machine learning; Financial economics; Epistemology; Philosophy","score_opus":0.35249811106854556,"score_gpt":0.5086021977632346,"score_spread":0.156104086694689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174830915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8965083,0.00079283817,0.03432842,0.0065048933,0.00073210173,0.0012238843,0.0003417785,0.000106497224,0.059461292],"genre_scores_gemma":[0.9616681,0.00052550377,0.0023796763,0.000070201175,0.000093755,0.00020990503,0.000035124944,0.000011896933,0.035005882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923831,0.002433319,0.00039705515,0.00041312852,0.0040546623,0.00031868942],"domain_scores_gemma":[0.9973106,0.00068326615,0.000031124066,0.0007038847,0.0011509405,0.000120197175],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.012931895,0.000070029295,0.00011959538,0.00070537935,0.0036699327,0.00068246434,0.00087110564,0.00002988084,0.00808239],"category_scores_gemma":[0.0044566463,0.00005606865,0.000059191843,0.0028686898,0.000106251486,0.0003319648,0.0004114057,0.00057282834,0.0010381059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009298474,0.00025502426,0.01342816,4.2586387e-7,0.000023288942,0.000017957425,0.003218734,0.6815235,0.0015742371,0.0126219615,0.15998173,0.12726201],"study_design_scores_gemma":[0.00026109538,0.0001428333,0.0044691325,6.0404403e-7,0.000003048485,0.000006292086,0.0031733618,0.32351333,0.00015448547,0.0042751925,0.66389364,0.000106982654],"about_ca_topic_score_codex":0.00088461523,"about_ca_topic_score_gemma":0.00046847144,"teacher_disagreement_score":0.5039119,"about_ca_system_score_codex":0.00009882809,"about_ca_system_score_gemma":0.0004116652,"threshold_uncertainty_score":0.9997397},"labels":[],"label_agreement":null},{"id":"W3181040298","doi":"10.1287/opre.2021.0393","title":"Technical Note—A Data-Driven Approach to Beating SAA Out of Sample","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Robust optimization; Sample (material); Computer science; Mistake; Optimization problem; Mathematical optimization; Set (abstract data type); Task (project management); Data set; Artificial intelligence; Mathematics; Algorithm; Economics","score_opus":0.5361502316087712,"score_gpt":0.5619995598826671,"score_spread":0.025849328273895966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181040298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02887111,0.000024324303,0.9239123,0.0033997642,0.000216743,0.0011892982,0.0006351154,0.00012455804,0.041626804],"genre_scores_gemma":[0.7065201,0.000118567594,0.284594,0.00004835779,0.00018872641,0.00012049368,0.0008322407,0.000021954827,0.0075556044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959319,0.00041352614,0.00056976476,0.0005733255,0.0021737071,0.0003377399],"domain_scores_gemma":[0.9955921,0.0016165434,0.000028845872,0.0015768515,0.0010379752,0.0001476583],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00807095,0.00007548906,0.00019071407,0.00089210755,0.00053095305,0.00039575362,0.0016237983,0.00008253035,0.00017350246],"category_scores_gemma":[0.017807348,0.00005807632,0.000036475612,0.004329776,0.00012661953,0.0004300271,0.001061425,0.0002484459,0.0012061556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018917839,0.00015273654,0.0024186815,0.0000039699958,0.0000057581087,0.0000020356413,0.0020066001,0.78182405,0.0055352785,0.008400703,0.12932569,0.07030556],"study_design_scores_gemma":[0.000114826056,0.00006282612,0.0021045764,0.000007591671,0.0000025689062,0.0000011633646,0.0008763625,0.9536642,0.00038391328,0.0006464318,0.042045686,0.00008989256],"about_ca_topic_score_codex":0.00041341627,"about_ca_topic_score_gemma":0.00066604436,"teacher_disagreement_score":0.67764896,"about_ca_system_score_codex":0.000034995443,"about_ca_system_score_gemma":0.00028782853,"threshold_uncertainty_score":0.9995715},"labels":[],"label_agreement":null},{"id":"W3184282788","doi":"10.1287/opre.2021.2139","title":"<i>Operations Research</i>: Topics, Impact, and Trends from 1952–2019","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Publication; Per capita; Operations research; Regional science; Computer science; Economics; Political science; Geography; Sociology; Demography; Mathematics; Law","score_opus":0.1327034604691046,"score_gpt":0.40277178049947354,"score_spread":0.27006832003036896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184282788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7309349,0.0019288661,0.00029261294,0.056383323,0.00065039884,0.0006878491,0.0000888529,0.00014557262,0.20888762],"genre_scores_gemma":[0.889829,0.00029260817,0.0006443827,0.0010303532,0.0027721256,0.00016103036,0.000983233,0.000041394844,0.10424591],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751467,0.0001988494,0.00027082398,0.00053156476,0.00089687237,0.0005872203],"domain_scores_gemma":[0.9980377,0.000082232335,0.000008661828,0.0006225701,0.0011925647,0.000056297224],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015817786,0.0001484467,0.0001712885,0.00082233996,0.0015468473,0.002451459,0.00031870714,0.000084627914,0.007034227],"category_scores_gemma":[0.00053244643,0.00013511514,0.00006788507,0.0018773808,0.00022629589,0.0012188156,0.0007349123,0.0005428091,0.0010875115],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004380412,0.0006817488,0.005194979,0.00007642565,0.00019153998,0.00013938526,0.0008233449,0.0047050193,0.008561825,0.21349134,0.70647144,0.05961914],"study_design_scores_gemma":[0.00085470604,0.00003656849,0.016076956,0.000046001263,0.000018223529,0.00000228718,0.0020168037,0.0530267,0.0004381597,0.0014380579,0.9257704,0.00027514555],"about_ca_topic_score_codex":0.012018215,"about_ca_topic_score_gemma":0.013351665,"teacher_disagreement_score":0.21929893,"about_ca_system_score_codex":0.00011031233,"about_ca_system_score_gemma":0.00013963692,"threshold_uncertainty_score":0.999753},"labels":[],"label_agreement":null},{"id":"W3186291209","doi":"10.1287/opre.2021.2185","title":"Single Allocation Hub Location with Heterogeneous Economies of Scale","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Wilfrid Laurier University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Mathematical optimization; Quadratic growth; Linear programming; Piecewise; Lagrangian relaxation; Column generation; Economies of scale; Computer science; Constant function; Scale (ratio); Returns to scale; Consolidation (business); Scalability; Integer programming; Constant (computer programming); Mathematics; Production (economics); Economics; Algorithm","score_opus":0.05497484970647972,"score_gpt":0.33477250748693355,"score_spread":0.27979765778045385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186291209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7373689,0.00032438876,0.2559046,0.0003393096,0.0000655417,0.00022992134,0.000007366906,0.00010229368,0.005657706],"genre_scores_gemma":[0.90736234,0.000047619964,0.09171984,0.0000075468606,0.00003539922,0.000041832165,0.000047682668,0.000023818417,0.0007138925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991183,0.00016773195,0.00019478575,0.0001506822,0.0002010773,0.00016739448],"domain_scores_gemma":[0.9986842,0.0000830063,0.00000810399,0.00029572108,0.00088293775,0.000046019493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043912197,0.00006480522,0.000099066645,0.00013600066,0.00014207758,0.00009577774,0.00009217946,0.00005061036,0.00014308418],"category_scores_gemma":[0.00013092055,0.00006728402,0.00001525025,0.0006546322,0.000071193856,0.00016968223,0.00002812471,0.000121871024,0.000032011558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027860867,0.000038550625,0.00021636723,0.000035089524,0.000015312167,0.0000010277652,0.00030501315,0.9441539,0.05094326,0.00028987727,0.000053666132,0.003945125],"study_design_scores_gemma":[0.00013713652,0.000043600245,0.0003669531,0.000027968988,0.0000039740653,0.000012455497,0.0002272597,0.5825557,0.41613084,0.000017498875,0.00040298185,0.00007361915],"about_ca_topic_score_codex":0.000030495337,"about_ca_topic_score_gemma":0.00049785007,"teacher_disagreement_score":0.3651876,"about_ca_system_score_codex":0.000109997985,"about_ca_system_score_gemma":0.00013576957,"threshold_uncertainty_score":0.27437627},"labels":[],"label_agreement":null},{"id":"W3193281468","doi":"10.1287/opre.2021.2133","title":"Combined Custom Hedging: Optimal Design, Noninsurable Exposure, and Operational Risk Management","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk Management in Financial Firms","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; University of Hong Kong; Egg Farmers of Canada; Carnegie Mellon University","keywords":"Hedge; Risk management; Flexibility (engineering); Optimal design; Newsvendor model; Computer science; Stochastic game; Mathematical optimization; Supply chain; Economics; Business; Mathematics; Mathematical economics; Finance","score_opus":0.057862796860326915,"score_gpt":0.30704461644217446,"score_spread":0.24918181958184754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193281468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7457921,0.0011057567,0.07033657,0.0076535707,0.00093243463,0.0032941517,0.00002810488,0.0003661474,0.17049116],"genre_scores_gemma":[0.93996394,0.0008703571,0.033845443,0.0006491407,0.0007009226,0.00044526084,0.00021979705,0.000063548105,0.023241574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99749714,0.00015114882,0.00035532942,0.00061113975,0.0008316053,0.0005536367],"domain_scores_gemma":[0.9983897,0.000108757966,0.000036388206,0.0005071307,0.0009226617,0.000035357072],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020500743,0.00020183218,0.00020482362,0.0005204722,0.001894054,0.0022888794,0.00035069312,0.00007925779,0.00078230345],"category_scores_gemma":[0.00038525838,0.0002029091,0.000050098795,0.0014751328,0.00015115934,0.0015494993,0.0007771842,0.00040128737,0.000995502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016062474,0.0008080637,0.02828665,0.00026792884,0.0002379019,0.00038265059,0.00022210182,0.10105254,0.0011091867,0.7762627,0.068053715,0.023155915],"study_design_scores_gemma":[0.0045638657,0.00016626407,0.07063288,0.00019257012,0.00017433766,0.000014258207,0.0024813348,0.44148168,0.001456812,0.008057072,0.4695007,0.0012782364],"about_ca_topic_score_codex":0.00050577306,"about_ca_topic_score_gemma":0.00015701263,"teacher_disagreement_score":0.76820564,"about_ca_system_score_codex":0.00007667194,"about_ca_system_score_gemma":0.00009728306,"threshold_uncertainty_score":0.9997823},"labels":[],"label_agreement":null},{"id":"W3193516764","doi":"10.1287/opre.2021.2187","title":"Who Is Next: Patient Prioritization Under Emergency Department Blocking","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Emergency and Acute Care Studies","field":"Medicine","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Prioritization; Stylized fact; Emergency department; Blocking (statistics); Medical emergency; Resource allocation; Operations management; Computer science; Resource (disambiguation); Medicine; Operations research; Business; Process management; Nursing; Engineering","score_opus":0.09496434865947079,"score_gpt":0.4192075600453006,"score_spread":0.3242432113858298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193516764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93400717,0.01050149,0.0008916706,0.019768119,0.0004991313,0.00076805986,0.00004096451,0.000049823146,0.033473592],"genre_scores_gemma":[0.9735541,0.009717048,0.0008359146,0.000507553,0.00025118235,0.00013163402,0.00017991873,0.000020669006,0.014801985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843425,0.00011971878,0.00025995067,0.00028902828,0.0006013044,0.00029577184],"domain_scores_gemma":[0.99795467,0.000024307068,0.000008745269,0.00029905114,0.0016137467,0.00009948646],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000197959,0.000090005524,0.00013793824,0.00011030104,0.0007035985,0.000049685088,0.000049413837,0.000053021566,0.0029819442],"category_scores_gemma":[0.0002609556,0.00008123836,0.00006450464,0.0007437011,0.00004623222,0.00013097028,0.00012134017,0.00022619983,0.0001224205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096596865,0.002018928,0.029573917,0.00040698797,0.00094447023,0.0004119548,0.016065672,0.002053533,0.11158823,0.035557825,0.75151616,0.04976574],"study_design_scores_gemma":[0.0025537382,0.0015597452,0.04781519,0.0007495456,0.00026957152,0.00015888704,0.03101622,0.014716312,0.23033263,0.001650425,0.6681625,0.0010151874],"about_ca_topic_score_codex":0.00005197144,"about_ca_topic_score_gemma":0.0003028741,"teacher_disagreement_score":0.118744396,"about_ca_system_score_codex":0.00010323116,"about_ca_system_score_gemma":0.00030981406,"threshold_uncertainty_score":0.99792945},"labels":[],"label_agreement":null},{"id":"W3193963178","doi":"10.1287/opre.2021.2127","title":"Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multinomial logistic regression; Sequence (biology); Purchasing; Selection (genetic algorithm); Revenue management; Computer science; Revenue; Operations research; Mathematical optimization; Economics; Mathematics; Operations management; Artificial intelligence; Machine learning; Finance","score_opus":0.08828545012358595,"score_gpt":0.3238075738544681,"score_spread":0.23552212373088216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193963178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8201444,0.000078429206,0.14005338,0.02311746,0.00020739474,0.0018276783,0.0000059922154,0.00010172277,0.014463515],"genre_scores_gemma":[0.9958857,0.000055964076,0.0018963111,0.0006352492,0.00027064726,0.000114656556,0.0001392198,0.000016174969,0.0009860402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990149,0.00006702158,0.00015295115,0.00027512037,0.0002818461,0.00020815953],"domain_scores_gemma":[0.9994103,0.000030825773,0.000027809388,0.000099364916,0.00041657218,0.000015176002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064756605,0.00009286318,0.00007501959,0.0001920171,0.00092946156,0.0008732748,0.000057788733,0.00003554358,0.00021059337],"category_scores_gemma":[0.000048124442,0.00006770164,0.000013354376,0.00046468858,0.00007404673,0.0007757094,0.00019156048,0.00016081224,0.000010531609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024120005,0.000078025805,0.000463191,0.000027791848,0.00003172381,0.0000010328919,0.00016552594,0.9863792,0.0006205802,0.008106691,0.0013265728,0.0027755399],"study_design_scores_gemma":[0.00048081198,0.00002336732,0.00033103538,0.000014168833,0.000021496475,0.0000023379139,0.0017738533,0.9937338,0.0001686228,0.00006375699,0.003296566,0.00009015186],"about_ca_topic_score_codex":0.00041184877,"about_ca_topic_score_gemma":0.00066666957,"teacher_disagreement_score":0.1757413,"about_ca_system_score_codex":0.00011769401,"about_ca_system_score_gemma":0.00006216459,"threshold_uncertainty_score":0.8421009},"labels":[],"label_agreement":null},{"id":"W3197777288","doi":"10.1287/opre.2022.0382","title":"Inverse Optimization: Theory and Applications","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"","keywords":"Inverse; Mathematical optimization; Computer science; Optimization problem; Inverse problem; Range (aeronautics); Mathematics; Engineering","score_opus":0.05634145700229787,"score_gpt":0.3915288568863341,"score_spread":0.33518739988403623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197777288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112173424,0.000044389384,0.9936185,0.0011603633,0.000046670677,0.0005562413,0.000006114287,0.0002880267,0.0041675353],"genre_scores_gemma":[0.010586845,0.00064644584,0.9683998,0.00024219186,0.00016177101,0.0014329862,0.00007349814,0.0000312986,0.018425122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984647,0.0003526457,0.000145925,0.00040222678,0.0003541309,0.0002803544],"domain_scores_gemma":[0.99839115,0.00036073782,0.000010112223,0.0005254047,0.0005902048,0.00012237637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267815,0.00008004029,0.00007625277,0.00048200332,0.00095525174,0.0003454629,0.00044452245,0.00004863516,0.00008107711],"category_scores_gemma":[0.00038053843,0.00007928749,0.000016513533,0.0029331099,0.00018607787,0.00076467637,0.00043295516,0.00019671822,0.00045845745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014480034,0.000021874095,0.000013564633,0.0000029395935,0.0000048569905,0.0000026929326,0.0003406295,0.7102177,0.00009664799,0.27740952,0.00036834934,0.0115197385],"study_design_scores_gemma":[0.00019657018,0.000020105419,0.00010128937,0.0000037728494,9.636561e-7,0.00000662091,0.00027450596,0.9901196,0.00016074307,0.0034246724,0.005597345,0.00009383639],"about_ca_topic_score_codex":0.000009635064,"about_ca_topic_score_gemma":0.000018052717,"teacher_disagreement_score":0.27990186,"about_ca_system_score_codex":0.00005812349,"about_ca_system_score_gemma":0.0001441073,"threshold_uncertainty_score":0.73471206},"labels":[],"label_agreement":null},{"id":"W3201081331","doi":"10.1287/opre.2022.2347","title":"Differential Privacy in Personalized Pricing with Nonparametric Demand Models","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"News aggregator; Computer science; Differential privacy; Dynamic pricing; Big data; Information privacy; Revenue; Computer security; Privacy software; Business; Data mining; Marketing; Finance; World Wide Web","score_opus":0.10145991564254946,"score_gpt":0.36013439087622984,"score_spread":0.25867447523368037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201081331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35863385,0.00014263424,0.6273565,0.0120792175,0.000058768524,0.00061039015,0.00001327775,0.00018732107,0.0009180384],"genre_scores_gemma":[0.85334426,0.00003600326,0.14575161,0.000029908313,0.000012737069,0.0004361619,0.000017072496,0.000012068549,0.00036018726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679303,0.0005392557,0.00022072296,0.0006221286,0.0012694494,0.0005554266],"domain_scores_gemma":[0.9951404,0.00029275363,0.000018417453,0.0043131146,0.00016990569,0.00006544544],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012834436,0.00011518004,0.00016138595,0.0012688069,0.0010037926,0.00048751177,0.016669543,0.00004568998,0.00018249813],"category_scores_gemma":[0.004162235,0.00010209617,0.000024791552,0.0046893167,0.00015609419,0.0009337779,0.06561395,0.0009948313,0.000016262577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033215078,0.003238424,0.0082141785,0.0001362031,0.0001956976,0.00070247945,0.010249342,0.44737533,0.016193723,0.37480956,0.08751817,0.051034745],"study_design_scores_gemma":[0.0005977835,0.00016150737,0.00040259885,0.000011658528,0.0000012877391,0.000022123366,0.00018392154,0.98044395,0.0006598909,0.01692701,0.00045155565,0.00013673167],"about_ca_topic_score_codex":0.00040432924,"about_ca_topic_score_gemma":0.00009853635,"teacher_disagreement_score":0.5330686,"about_ca_system_score_codex":0.00039199064,"about_ca_system_score_gemma":0.00035336742,"threshold_uncertainty_score":0.98865074},"labels":[],"label_agreement":null},{"id":"W3209282025","doi":"10.1287/opre.2021.2161","title":"Asymptotically Optimal Lagrangian Policies for Multi-Warehouse, Multi-Store Systems with Lost Sales","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Inventory control; Warehouse; Operations research; Control (management); Order (exchange); Asymptotically optimal algorithm; Brick and mortar; Retail sales; Mathematical optimization; Business; Marketing; Mathematics; Algorithm; Artificial intelligence; The Internet","score_opus":0.16488948422572394,"score_gpt":0.36492144248678327,"score_spread":0.20003195826105932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209282025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5233053,0.002994487,0.36632076,0.037821956,0.0026312836,0.013629589,0.00035004734,0.001136477,0.05181014],"genre_scores_gemma":[0.9273078,0.000043281612,0.019067824,0.0009284973,0.0014771135,0.00069758674,0.00053649774,0.0001103225,0.049831115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811924,0.00006236833,0.0002614737,0.0004240564,0.000559172,0.00057369133],"domain_scores_gemma":[0.9980118,0.00007963264,0.000025094088,0.00041800665,0.0014242532,0.00004118207],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007657713,0.0001775942,0.00020063754,0.0004050411,0.0008678527,0.0016139417,0.00032340153,0.00007727538,0.0002510349],"category_scores_gemma":[0.00035595815,0.00014838712,0.000070886446,0.0008122913,0.00017790025,0.0007153726,0.00025736316,0.00021435766,0.00067481026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031866643,0.0035176275,0.020880388,0.002771635,0.00072536216,0.0002693095,0.0020103091,0.23762129,0.006686839,0.6001257,0.12321411,0.0018587644],"study_design_scores_gemma":[0.0023237295,0.00007625682,0.0038079377,0.00018187177,0.0000492238,0.0000064572228,0.008889911,0.6433187,0.0002509033,0.00001046718,0.3406579,0.0004266515],"about_ca_topic_score_codex":0.0010771992,"about_ca_topic_score_gemma":0.004308009,"teacher_disagreement_score":0.60011524,"about_ca_system_score_codex":0.00009658349,"about_ca_system_score_gemma":0.0001470085,"threshold_uncertainty_score":0.9994225},"labels":[],"label_agreement":null},{"id":"W3212118428","doi":"10.1287/opre.2021.2146","title":"Technical Note—Optimal Pricing Under Multiple-Discrete Customer Choices and Diminishing Return of Consumption","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Product (mathematics); Consumption (sociology); Set (abstract data type); Computer science; Microeconomics; Business; Unit (ring theory); Operations research; Economics; Mathematics","score_opus":0.0845739013869785,"score_gpt":0.37236500989911037,"score_spread":0.28779110851213185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212118428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880379,0.00034370492,0.0035482333,0.0011119944,0.000103251085,0.00030990486,0.0000054444213,0.00005593012,0.006483664],"genre_scores_gemma":[0.99619573,0.00008965302,0.002701313,0.000088744644,0.000169015,0.00003132458,0.00004213788,0.000019570265,0.00066250545],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99855393,0.000078061144,0.00029253308,0.00032388238,0.00045471246,0.00029685948],"domain_scores_gemma":[0.99873155,0.0003622292,0.000035620105,0.00026965985,0.000577767,0.000023174345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551805,0.00011102799,0.00017147687,0.0003344496,0.0005737095,0.00062070315,0.00015132775,0.000093773386,0.00046436553],"category_scores_gemma":[0.0007698793,0.00010560786,0.000044145294,0.00065852137,0.00019257078,0.0009579173,0.0004255427,0.0004238534,0.00005063946],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010244967,0.00024441534,0.39553237,0.0005568563,0.000037075115,0.00004895135,0.0004067754,0.001875549,0.55546546,0.009784733,0.00072587776,0.035219464],"study_design_scores_gemma":[0.0024569249,0.00003993046,0.7336321,0.00064948696,0.00022187683,0.000055936816,0.00206446,0.2174401,0.015153263,0.00016401685,0.027241282,0.00088064885],"about_ca_topic_score_codex":0.0008802233,"about_ca_topic_score_gemma":0.002150036,"teacher_disagreement_score":0.54031223,"about_ca_system_score_codex":0.000032148833,"about_ca_system_score_gemma":0.00008124744,"threshold_uncertainty_score":0.5985455},"labels":[],"label_agreement":null},{"id":"W3214154353","doi":"10.1287/opre.2023.0327","title":"The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations","year":2025,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Polyhedron; Convex hull; Correctness; Cutting-plane method; Nash equilibrium; Mathematical optimization; Integer programming; Leverage (statistics); Computer science; Extreme point; Mathematics; Hull; Regular polygon; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.23782802143130977,"score_gpt":0.5207650283026936,"score_spread":0.2829370068713838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214154353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045488268,0.00097336073,0.8626502,0.03363721,0.0010900361,0.0037379817,0.00057875586,0.00017936519,0.05166482],"genre_scores_gemma":[0.6943399,0.0004043201,0.07611086,0.00040053416,0.0011314582,0.0019805494,0.00034928694,0.00005794327,0.22522515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936917,0.0019314225,0.00097495393,0.0010174034,0.0018164908,0.0005680555],"domain_scores_gemma":[0.98937243,0.0062139495,0.00008696872,0.002163273,0.001985526,0.0001778283],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013944233,0.00023623143,0.00033524737,0.0005689992,0.0043506864,0.004015723,0.002550711,0.00025649258,0.00021965853],"category_scores_gemma":[0.0032670675,0.00015743358,0.0001387631,0.0015428278,0.00081460597,0.00022895499,0.0042115925,0.0016935269,0.00076763076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016806234,0.00022099397,0.00010328697,0.00003105704,0.00013757471,0.0000045140446,0.0047859363,0.020602116,0.0007975496,0.2962144,0.034881234,0.6422045],"study_design_scores_gemma":[0.00014687593,0.000020016723,0.00033566722,0.000057716665,0.000013971744,0.000008058447,0.0011691807,0.7494182,0.0002519755,0.17474443,0.073621765,0.0002121269],"about_ca_topic_score_codex":0.00013807775,"about_ca_topic_score_gemma":0.00027834854,"teacher_disagreement_score":0.7865393,"about_ca_system_score_codex":0.00009445856,"about_ca_system_score_gemma":0.0008285207,"threshold_uncertainty_score":0.9970182},"labels":[],"label_agreement":null},{"id":"W3214888932","doi":"10.1287/opre.2021.2194","title":"Technical Note—A Permutation-Dependent Separability Approach for Capacitated Two-Echelon Inventory Systems","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bottleneck; Permutation (music); Computer science; Mathematical optimization; Permutation matrix; Separable space; Random permutation; Mathematics; Combinatorics; Algorithm; Symmetric group","score_opus":0.11567729904589666,"score_gpt":0.36925948577941925,"score_spread":0.2535821867335226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214888932","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13152154,0.0012298999,0.4049604,0.010901821,0.0026983398,0.012448366,0.0001275137,0.0009811429,0.43513098],"genre_scores_gemma":[0.9826514,0.000011311431,0.0036078703,0.00035269736,0.0009626141,0.001769411,0.000912891,0.000043602664,0.009688164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973985,0.00016794156,0.00043421346,0.0006301922,0.0008494248,0.00051973225],"domain_scores_gemma":[0.99759305,0.000106790845,0.000036435067,0.00059596694,0.0016275685,0.000040202714],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029208115,0.00017439036,0.00022360503,0.00040918565,0.000926516,0.0011505864,0.0003641953,0.00010991949,0.00034234248],"category_scores_gemma":[0.0009548671,0.00017058618,0.00010829011,0.001034948,0.00016410062,0.0008371764,0.00029265613,0.00036463502,0.00025438008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017735179,0.0027811988,0.0032509184,0.002405734,0.00014277497,0.00005788898,0.0006822913,0.19286041,0.044387244,0.6662846,0.08281673,0.0041528596],"study_design_scores_gemma":[0.0012680533,0.000029607161,0.0003757374,0.000040505318,0.000038575607,0.0000062908716,0.0031189416,0.92780477,0.0005740773,0.00095647573,0.065446205,0.000340759],"about_ca_topic_score_codex":0.0011720763,"about_ca_topic_score_gemma":0.0006458173,"teacher_disagreement_score":0.8511299,"about_ca_system_score_codex":0.00034254583,"about_ca_system_score_gemma":0.00020494773,"threshold_uncertainty_score":0.99988633},"labels":[],"label_agreement":null},{"id":"W4200481023","doi":"10.1287/opre.2021.2189","title":"Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Newsvendor model; Replicate; Computer science; Cash flow; Spillover effect; Task (project management); Game theory; Sequence (biology); Replication (statistics); Cash; Microeconomics; Mathematical optimization; Operations research; Economics; Supply chain; Business; Mathematics; Finance","score_opus":0.14891773689538426,"score_gpt":0.41043164990857406,"score_spread":0.2615139130131898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200481023","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022388022,0.00009818433,0.3804647,0.124634534,0.00025219517,0.0037638112,0.00035388547,0.00037539925,0.46766928],"genre_scores_gemma":[0.9204732,0.000034219596,0.07050855,0.00048878434,0.00015840742,0.0004894397,0.0004979943,0.00001301366,0.0073363627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786955,0.000684802,0.00016979717,0.0002654029,0.0007018268,0.00030861705],"domain_scores_gemma":[0.9983235,0.00023084218,0.000010884377,0.00021970108,0.0010846835,0.0001304078],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013613489,0.00006458457,0.00008659643,0.00009769546,0.0017650042,0.00038997256,0.00026805108,0.00007932541,0.00022234113],"category_scores_gemma":[0.0005545368,0.000051754774,0.00003177005,0.0015776115,0.00027390796,0.00016633373,0.000021723954,0.0003272258,0.000094368195],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006375166,0.0007402916,0.001188398,0.00003128842,0.000016029484,0.000033321965,0.03735214,0.220333,0.027547058,0.7003545,0.005080018,0.0072601778],"study_design_scores_gemma":[0.0017103397,0.00031115962,0.032512795,0.0002751737,0.00004500533,0.000012819983,0.04125328,0.104208216,0.007899976,0.0005769379,0.81020373,0.0009905834],"about_ca_topic_score_codex":0.0013316724,"about_ca_topic_score_gemma":0.0058834096,"teacher_disagreement_score":0.89808524,"about_ca_system_score_codex":0.00012386774,"about_ca_system_score_gemma":0.0013678811,"threshold_uncertainty_score":0.99953455},"labels":[],"label_agreement":null},{"id":"W4205107869","doi":"10.1287/opre.2021.2234","title":"Systemic Risk-Driven Portfolio Selection","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; Global Risk Institute in Financial Services","funders":"","keywords":"Portfolio; Systemic risk; Tail risk; Expected shortfall; Value at risk; Stock (firearms); Stock market index; Actuarial science; Economics; Index (typography); Econometrics; Construct (python library); Financial economics; Business; Financial crisis; Risk management; Stock market; Computer science; Finance","score_opus":0.0831123387040463,"score_gpt":0.3049228090445455,"score_spread":0.2218104703404992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205107869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8204481,0.0012458592,0.0007143915,0.00060580485,0.0003903939,0.00058094703,0.00026327893,0.000055163513,0.17569606],"genre_scores_gemma":[0.98593116,0.0003332592,0.00030588024,0.00004900694,0.000107357824,0.00043750586,0.000039071638,0.000015469323,0.01278127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883693,0.00013991793,0.00032418018,0.0003007299,0.00010856467,0.0002896571],"domain_scores_gemma":[0.9995809,0.000032784235,0.00004444051,0.00021178593,0.00008060773,0.000049480685],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015351085,0.00006922146,0.000143526,0.00043317265,0.0017535607,0.00018119295,0.00021881062,0.000033535423,0.004707118],"category_scores_gemma":[0.00015184995,0.000082241684,0.000047778758,0.0008027266,0.00005478751,0.00023727889,0.00013103573,0.00044255727,0.000602283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012241337,0.00010526468,0.029012205,0.000009622734,0.000021422658,0.0000031274592,0.00033496902,0.02309657,0.0001818641,0.9299924,0.016905002,0.00032536135],"study_design_scores_gemma":[0.0011608222,0.0011521594,0.07524383,0.0000194321,0.0000081836715,0.00007970482,0.0026951616,0.24996522,0.00015998141,0.04582539,0.62297225,0.00071787665],"about_ca_topic_score_codex":0.0023115496,"about_ca_topic_score_gemma":0.00014815354,"teacher_disagreement_score":0.88416696,"about_ca_system_score_codex":0.00029746638,"about_ca_system_score_gemma":0.00010996092,"threshold_uncertainty_score":0.999546},"labels":[],"label_agreement":null},{"id":"W4206267728","doi":"10.1287/opre.2021.2157","title":"Robust Learning of Consumer Preferences","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Consumer choice; Focus (optics); Mathematical optimization; Sequence (biology); Asymptotically optimal algorithm; Artificial intelligence; Machine learning; Operations research; Marketing; Algorithm; Mathematics; Business","score_opus":0.14610335025292934,"score_gpt":0.389352057866647,"score_spread":0.24324870761371767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206267728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005210468,0.0002800906,0.98659605,0.00036506506,0.000069986476,0.00013117252,0.000002429877,0.000041719584,0.007302999],"genre_scores_gemma":[0.33918375,0.0002758507,0.6530901,0.000018545361,0.000022734976,0.00004454259,0.000012976515,0.000007733252,0.0073437444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843305,0.00042107847,0.00017233792,0.00030704815,0.0004538307,0.00021262183],"domain_scores_gemma":[0.99742323,0.00022329559,0.000015225924,0.00036011665,0.0019147304,0.00006339356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004718124,0.000059365073,0.00009986851,0.00016266965,0.00037998133,0.00018477927,0.00037586683,0.000038828486,0.00021666457],"category_scores_gemma":[0.0010021054,0.00005706364,0.000023915793,0.0012188822,0.0001285742,0.0005131182,0.00031145304,0.00030383284,0.000078974146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020024202,0.00013544482,0.00074076344,0.000010117927,0.00001909031,0.000013488364,0.0009763007,0.9193625,0.006959445,0.04332962,0.00015867308,0.028292589],"study_design_scores_gemma":[0.00024851123,0.00005132432,0.0007223029,0.000019513112,0.0000012259292,0.00001118335,0.00048247862,0.96619374,0.029077692,0.00028367544,0.0028120538,0.000096304604],"about_ca_topic_score_codex":0.000044609747,"about_ca_topic_score_gemma":0.00007155645,"teacher_disagreement_score":0.33397326,"about_ca_system_score_codex":0.000040302602,"about_ca_system_score_gemma":0.0004551536,"threshold_uncertainty_score":0.29225475},"labels":[],"label_agreement":null},{"id":"W4210906234","doi":"10.1287/opre.2021.2240","title":"Dynamic Learning and Decision Making via Basis Weight Vectors","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Continuation; Basis (linear algebra); Computer science; Mathematical optimization; Bellman equation; Process (computing); Set (abstract data type); Time horizon; Decision maker; Class (philosophy); Mathematics; Artificial intelligence; Algorithm; Operations research","score_opus":0.10884847178026896,"score_gpt":0.5124579529953524,"score_spread":0.4036094812150834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210906234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5724715,0.0012053136,0.41993532,0.0019989484,0.00043345094,0.00096334936,0.000044869685,0.00009020891,0.0028570262],"genre_scores_gemma":[0.9714202,0.00010287076,0.01999274,0.000025173018,0.000053112784,0.00023807597,0.0000124075095,0.000030714837,0.008124648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909055,0.0016352871,0.00050518813,0.0008602448,0.0054107513,0.00068300276],"domain_scores_gemma":[0.9937227,0.0045255395,0.000033715292,0.0006075744,0.0009256215,0.00018489128],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010797964,0.00013657793,0.0002258985,0.0016948971,0.0053423895,0.0008958862,0.0010072833,0.00005510056,0.008681056],"category_scores_gemma":[0.0070148674,0.000114835035,0.000064567175,0.0039962977,0.00030615204,0.0005689766,0.0020558008,0.0015517205,0.0004772037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010646248,0.00010958795,0.0034521467,0.0000033115905,0.000016506576,0.00007558951,0.00093730364,0.15961713,0.0025582865,0.00042994766,0.0020041112,0.8306896],"study_design_scores_gemma":[0.0004349611,0.00033698752,0.0047015306,0.000013010366,0.000002478585,0.000072201336,0.0033867848,0.9135497,0.00018882773,0.0141150635,0.06297898,0.00021944317],"about_ca_topic_score_codex":0.000067682624,"about_ca_topic_score_gemma":0.00035286488,"teacher_disagreement_score":0.8304702,"about_ca_system_score_codex":0.0004311402,"about_ca_system_score_gemma":0.0002724958,"threshold_uncertainty_score":0.99595255},"labels":[],"label_agreement":null},{"id":"W4213252392","doi":"10.1287/opre.1120.1076","title":"Contributors","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.07668920705705379,"score_gpt":0.37988433328914983,"score_spread":0.30319512623209605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213252392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82231355,0.00036508107,0.008156616,0.0043200958,0.00039402558,0.00048090512,0.0000043679242,0.00022078698,0.16374457],"genre_scores_gemma":[0.99325556,0.0000038088378,0.00030324922,0.0003074211,0.0014422764,0.000046908863,0.000027480984,0.000012732437,0.004600544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999024,0.000041819527,0.00011281095,0.00011446968,0.00030242265,0.00040449025],"domain_scores_gemma":[0.99926263,0.000076367025,0.00000954859,0.00023738446,0.00039690937,0.000017131699],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018359295,0.00005822465,0.000077367724,0.00032775235,0.00065797666,0.00026829136,0.00017435002,0.000031393913,0.0016178525],"category_scores_gemma":[0.0009370638,0.000051080377,0.00003411668,0.00095170306,0.00007999146,0.001733327,0.00013926363,0.00018121475,0.0046216724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113856695,0.000117303316,0.00630055,0.000011682795,0.000023092229,0.0000016219577,0.00006598695,0.004144823,0.0024682237,0.9779112,0.006327961,0.002616175],"study_design_scores_gemma":[0.00043883978,0.000008133053,0.0034586606,0.00001904855,0.00003553636,0.0000019369852,0.0009564443,0.04835457,0.001033895,0.008406066,0.93696946,0.0003174163],"about_ca_topic_score_codex":0.00024832692,"about_ca_topic_score_gemma":0.00010827711,"teacher_disagreement_score":0.96950513,"about_ca_system_score_codex":0.000043434582,"about_ca_system_score_gemma":0.000014378456,"threshold_uncertainty_score":0.9992948},"labels":[],"label_agreement":null},{"id":"W4220972597","doi":"10.1287/opre.2022.2288","title":"Spatial Price Integration in Commodity Markets with Capacitated Transportation Networks","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Toronto","funders":"","keywords":"Bottleneck; Commodity; Flow network; Economics; Bounded function; Microeconomics; Supply and demand; Econometrics; Computer science; Mathematical optimization; Operations management; Mathematics; Finance","score_opus":0.054252855732807796,"score_gpt":0.285366181024221,"score_spread":0.2311133252914132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220972597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92549,0.00008839442,0.06206482,0.0007219431,0.00010533628,0.0006133522,0.00037709906,0.000017431126,0.010521583],"genre_scores_gemma":[0.99762547,0.000031647487,0.00050160737,0.00003337401,0.00002555623,0.0003328773,0.00066016003,0.00001388632,0.0007754222],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864924,0.0002286806,0.0003945338,0.00032707,0.00012598815,0.0002744655],"domain_scores_gemma":[0.9994342,0.000095680145,0.00003901925,0.00026438432,0.00011370468,0.00005303898],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028774266,0.000083821404,0.00016465061,0.00035894662,0.0005715881,0.000107602486,0.0001895615,0.000046386212,0.0018512284],"category_scores_gemma":[0.0000876672,0.00009248382,0.000027772461,0.00095291313,0.00006534108,0.00021555522,0.000028552446,0.00065921,0.000009923069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085084833,0.0011494095,0.6353138,0.000037664584,0.000052693453,0.00003168785,0.0043152403,0.1745995,0.000066610875,0.17492825,0.001609123,0.0070451377],"study_design_scores_gemma":[0.00036053942,0.000089325054,0.2175799,0.0000043848913,6.544989e-7,8.7381585e-7,0.00020018329,0.7788252,0.0000034957582,0.0010474018,0.0017949209,0.00009307526],"about_ca_topic_score_codex":0.006357827,"about_ca_topic_score_gemma":0.026865948,"teacher_disagreement_score":0.60422575,"about_ca_system_score_codex":0.00031483377,"about_ca_system_score_gemma":0.000062670646,"threshold_uncertainty_score":0.9990612},"labels":[],"label_agreement":null},{"id":"W4225343237","doi":"10.1287/opre.2021.2209","title":"Learning Manipulation Through Information Dissemination","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Misinformation; Dissemination; Computer science; Social learning; Process (computing); Private information retrieval; Incentive; Control (management); Information Dissemination; Knowledge management; Perspective (graphical); Economics; Microeconomics; Artificial intelligence; World Wide Web; Computer security","score_opus":0.2914305467021117,"score_gpt":0.543846843305784,"score_spread":0.2524162966036723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225343237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82048875,0.00003254886,0.07040357,0.008014939,0.00019801689,0.00094184274,0.0000430898,0.000109905675,0.09976736],"genre_scores_gemma":[0.98113537,0.0000052884484,0.00083145354,0.00006250077,0.000045815676,0.0005071263,0.00020139938,0.000005797595,0.01720526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957181,0.0012159348,0.0004374782,0.00022739143,0.002179471,0.00022158593],"domain_scores_gemma":[0.9977551,0.00092071143,0.000043795084,0.00042538458,0.00080751796,0.00004748184],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007706259,0.00006176287,0.00008227221,0.00044738146,0.003898722,0.00066504645,0.0005758302,0.000028708904,0.0053423205],"category_scores_gemma":[0.0030665146,0.000056140147,0.000040425086,0.0024575463,0.00008306148,0.0017552596,0.00033872007,0.0005381715,0.0018355823],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025216154,0.00010178798,0.0006884249,0.000001990765,0.000005289329,7.3692104e-7,0.0109809395,0.37451583,0.0037433163,0.5307681,0.013432081,0.06573628],"study_design_scores_gemma":[0.00025714075,0.00023792949,0.0073026326,0.000004562668,0.0000039597767,0.000017278271,0.0396876,0.24910603,0.0013611569,0.08022515,0.6215952,0.00020136317],"about_ca_topic_score_codex":0.00007246679,"about_ca_topic_score_gemma":0.000026582054,"teacher_disagreement_score":0.6081631,"about_ca_system_score_codex":0.00014127042,"about_ca_system_score_gemma":0.00009551066,"threshold_uncertainty_score":0.9989416},"labels":[],"label_agreement":null},{"id":"W4226236569","doi":"10.1287/opre.2022.2267","title":"A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Polytechnique Montréal","funders":"","keywords":"Solver; Linearization; Computer science; Quadratic equation; Preprocessor; Mathematical optimization; Quadratic programming; Integer programming; Pascal (unit); Tardiness; Classifier (UML); Artificial intelligence; Machine learning; Algorithm; Mathematics; Job shop scheduling; Nonlinear system; Schedule","score_opus":0.3173609931698647,"score_gpt":0.4785776817810923,"score_spread":0.16121668861122757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226236569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27301964,0.00006907269,0.6737891,0.028304702,0.00023995263,0.009088207,0.00014637895,0.00011134695,0.015231593],"genre_scores_gemma":[0.9482036,0.000020020258,0.033081945,0.00017099013,0.00005553883,0.0030639428,0.00004851764,0.000064545486,0.015290864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588865,0.0013417044,0.0004910107,0.00032508143,0.0015432207,0.00041033418],"domain_scores_gemma":[0.9968954,0.0016304394,0.000030612475,0.00064661016,0.00070581393,0.000091177695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003482349,0.000111675625,0.000182287,0.0007871986,0.00070770946,0.00010211703,0.0005503006,0.00004523412,0.0019829285],"category_scores_gemma":[0.004532279,0.00008631199,0.000041472333,0.0030375123,0.0001160248,0.00012999345,0.0004106241,0.0008666046,0.00009619008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037402977,0.0004912832,0.00011715083,0.000026785556,0.00001310829,0.00000370088,0.0023280114,0.85452676,0.0020879828,0.13403429,0.005426917,0.0009066335],"study_design_scores_gemma":[0.0006410793,0.00058453385,0.0002750165,0.000077331766,0.0000037264733,0.000005416819,0.0063501005,0.9693799,0.0032803023,0.013736672,0.0054529076,0.0002130055],"about_ca_topic_score_codex":0.00012567294,"about_ca_topic_score_gemma":0.0009287185,"teacher_disagreement_score":0.675184,"about_ca_system_score_codex":0.00037001687,"about_ca_system_score_gemma":0.00038310626,"threshold_uncertainty_score":0.9989294},"labels":[],"label_agreement":null},{"id":"W4229615600","doi":"10.1007/978-3-642-10326-1_8","title":"Machine Scheduling","year":2010,"lang":"en","type":"book-chapter","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Audit; Computer science; Scheduling (production processes); Operations management; Business; Engineering; Accounting","score_opus":0.05163357037667106,"score_gpt":0.3245991249434952,"score_spread":0.27296555456682414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229615600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000499655,0.0017881414,0.026280668,0.000282706,0.000677385,0.00035093175,0.00007668653,0.00041223716,0.97008127],"genre_scores_gemma":[0.0019919295,0.0013180622,0.20164686,0.000028028502,0.0007888581,0.00005420735,0.00040199843,0.00019669757,0.7935734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986537,0.00001826745,0.00025317262,0.00025884496,0.00051426596,0.0003017637],"domain_scores_gemma":[0.99885815,0.00007092003,0.000006565424,0.00048745208,0.00042939952,0.0001475321],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005037034,0.00020614063,0.000190024,0.00046964578,0.00041292387,0.00026048947,0.00028659854,0.00046735592,0.0041891164],"category_scores_gemma":[0.00009502581,0.0002116296,0.000066177454,0.00010464081,0.000115424795,0.000092860515,0.00006830149,0.0022636391,0.0021371136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031412178,0.000015251071,0.0000013830934,0.000057630947,0.00009007579,0.000020273861,0.00017331023,0.86988586,0.0010032806,0.11578304,0.00068231224,0.012284438],"study_design_scores_gemma":[0.00014751797,0.000018443092,7.499913e-7,0.00006657029,0.000009202036,0.000009975214,0.000011964364,0.85566807,0.0005730293,0.0008340378,0.14236723,0.00029318116],"about_ca_topic_score_codex":0.000018330817,"about_ca_topic_score_gemma":0.00015457359,"teacher_disagreement_score":0.17650792,"about_ca_system_score_codex":0.00008247224,"about_ca_system_score_gemma":0.000118031356,"threshold_uncertainty_score":0.9986398},"labels":[],"label_agreement":null},{"id":"W4229823162","doi":"10.1287/opre.1100.0901","title":"Contributors","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Operations research; Computer science; Game theory; Influence diagram; Markov decision process; Management science; Artificial intelligence; Mathematical economics; Mathematics; Engineering; Markov process; Decision tree","score_opus":0.037358503014294726,"score_gpt":0.363619421975952,"score_spread":0.32626091896165726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229823162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96600044,0.000010991356,0.003899363,0.000706202,0.00032470567,0.00021339297,0.000034357727,0.00021024467,0.028600289],"genre_scores_gemma":[0.9973299,0.000007143251,0.0012396123,0.00001830613,0.00006384677,0.00008918794,0.000060220413,0.00000886771,0.0011829092],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949104,0.000012047513,0.00010770152,0.00006929748,0.0001621047,0.0001578305],"domain_scores_gemma":[0.99944127,0.000034642188,8.6424967e-7,0.0001799688,0.00029190362,0.00005134353],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032783393,0.00003661542,0.000038002687,0.00013870597,0.00019955951,0.00006949647,0.000087167566,0.000046255354,0.001027696],"category_scores_gemma":[0.00008261271,0.000036312427,0.000013280146,0.00045353107,0.00006216552,0.00010980555,0.0000041051085,0.00040990845,0.00034375035],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024106496,0.00008666239,0.0018798573,0.000015031895,0.000028719702,0.0000034243137,0.0006964403,0.03937979,0.6074509,0.3172384,0.026622472,0.0065958984],"study_design_scores_gemma":[0.0007422675,0.000043437365,0.06773357,0.000007825955,0.0000062782724,0.0000071997647,0.00047122443,0.13714015,0.0704998,0.0005324849,0.7224808,0.00033496966],"about_ca_topic_score_codex":0.00004031989,"about_ca_topic_score_gemma":0.0017234267,"teacher_disagreement_score":0.6958583,"about_ca_system_score_codex":0.000014037104,"about_ca_system_score_gemma":0.00004450039,"threshold_uncertainty_score":0.9998855},"labels":[],"label_agreement":null},{"id":"W4233276102","doi":"10.1287/opre.1120.1043","title":"Contributors","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.508454706314146,"score_gpt":0.5965897875985019,"score_spread":0.08813508128435588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233276102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733701,0.001016056,0.05137827,0.0059967334,0.0010793994,0.00073228014,0.00003784271,0.00007008898,0.20598833],"genre_scores_gemma":[0.9680684,0.00012768038,0.0017316838,0.000055287815,0.00028675294,0.000033306398,0.000013603989,0.000005568856,0.029677723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970845,0.0005361579,0.00027509488,0.00016388259,0.0015432783,0.00039706661],"domain_scores_gemma":[0.9976484,0.0005887214,0.000011343925,0.00043636013,0.0011240523,0.00019109753],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008960545,0.000047578967,0.00008753932,0.0003957329,0.00064473134,0.00047284254,0.00035538303,0.000052590378,0.0023003914],"category_scores_gemma":[0.005133777,0.000032938093,0.000033855766,0.0015349839,0.00009488463,0.00078482385,0.0000897335,0.00017332417,0.005719443],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030054915,0.00040898906,0.19208795,8.8316267e-7,0.000019669878,0.0000036676051,0.003838444,0.03109896,0.0020878573,0.28110504,0.36232954,0.12698896],"study_design_scores_gemma":[0.00023133286,0.000044498054,0.03158643,0.00000221747,0.0000020992113,0.000007056009,0.0010344437,0.029341005,0.001870977,0.0016813927,0.93408126,0.00011728196],"about_ca_topic_score_codex":0.000111162415,"about_ca_topic_score_gemma":0.00006645573,"teacher_disagreement_score":0.5717517,"about_ca_system_score_codex":0.000038157345,"about_ca_system_score_gemma":0.000109155735,"threshold_uncertainty_score":0.9986116},"labels":[],"label_agreement":null},{"id":"W4233980123","doi":"10.1287/opre.1110.0994","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematical economics; Mathematics","score_opus":0.16710939077760506,"score_gpt":0.38864849971291304,"score_spread":0.22153910893530798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233980123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2211336,0.0002540907,0.47741407,0.00017660802,0.0004107904,0.00057464937,0.000018193945,0.00082891673,0.29918906],"genre_scores_gemma":[0.90301085,0.000033856366,0.09522065,0.000009905697,0.00005212683,0.00005111956,0.000007123644,0.000021839734,0.001592538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992329,0.00014331703,0.0001139403,0.00009028673,0.0001835296,0.00023602169],"domain_scores_gemma":[0.99944407,0.00005502188,0.0000014425426,0.00020320453,0.0002273611,0.00006889688],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009278147,0.00004772683,0.000057548114,0.00014926259,0.00019103776,0.000053821375,0.00013626747,0.00004700602,0.0010172194],"category_scores_gemma":[0.00024221884,0.00004749859,0.000015355488,0.0004483343,0.000047042795,0.00012206935,0.000028004844,0.00021273307,0.0004056952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011639521,0.00012436928,0.0030514074,0.000039359715,0.00008011716,0.000019588153,0.0057802172,0.8653103,0.02127719,0.069765784,0.011243982,0.023296049],"study_design_scores_gemma":[0.00021644587,0.00003273486,0.00227152,0.000008573844,0.0000024600406,0.0000042108686,0.0001996698,0.9624001,0.028242474,0.00017555304,0.006313086,0.00013318929],"about_ca_topic_score_codex":0.000053823664,"about_ca_topic_score_gemma":0.000030945375,"teacher_disagreement_score":0.68187726,"about_ca_system_score_codex":0.00005240384,"about_ca_system_score_gemma":0.000030328121,"threshold_uncertainty_score":0.999896},"labels":[],"label_agreement":null},{"id":"W4238914673","doi":"10.1287/opre.1110.0981","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.24412513991963783,"score_gpt":0.33936823712945524,"score_spread":0.09524309720981741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238914673","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11844045,0.00005382363,0.0006483022,0.0014217066,0.00038686206,0.00053849886,0.0000018419046,0.00012320711,0.8783853],"genre_scores_gemma":[0.9871343,0.0000073202455,0.00022752101,0.0007832535,0.0006059031,0.000108569955,0.000024359053,0.000014056951,0.011094728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989947,0.000023727853,0.00013415716,0.00018501731,0.0003478223,0.000314545],"domain_scores_gemma":[0.9993389,0.000014059725,0.000008426581,0.00026074026,0.00036416552,0.000013667767],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00097287016,0.000068147994,0.000069492446,0.00038941213,0.0004878783,0.00031642488,0.00027594817,0.000031445536,0.007830489],"category_scores_gemma":[0.0001796155,0.00006012141,0.00003235382,0.0006122277,0.000090662754,0.0007671365,0.00021053266,0.00014664573,0.005377798],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017896136,0.00019541521,0.004702779,0.000026871747,0.000022103413,0.00001608972,0.0002101221,0.000059426515,0.00031157272,0.9004591,0.09060067,0.0033779566],"study_design_scores_gemma":[0.00048064764,0.00002331092,0.0077782287,0.000015356925,0.000009456931,6.018753e-7,0.0013080961,0.01581101,0.0004132864,0.0038010415,0.9701638,0.00019513065],"about_ca_topic_score_codex":0.0020161325,"about_ca_topic_score_gemma":0.00046113716,"teacher_disagreement_score":0.89665806,"about_ca_system_score_codex":0.00003554289,"about_ca_system_score_gemma":0.000021459575,"threshold_uncertainty_score":0.9953966},"labels":[],"label_agreement":null},{"id":"W4241914554","doi":"10.1287/opre.1100.0884","title":"Contributors","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.04175362454303325,"score_gpt":0.36313516985641486,"score_spread":0.3213815453133816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241914554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9126857,0.000013990109,0.0019239738,0.0042499257,0.00028528165,0.00025272358,0.0000027270821,0.00012932665,0.08045638],"genre_scores_gemma":[0.9930316,0.0000014446478,0.0005377335,0.00027029953,0.0010036837,0.000044885845,0.000027271644,0.000013027425,0.005070036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912083,0.000022153781,0.00011616778,0.00017821662,0.00029936002,0.00026329444],"domain_scores_gemma":[0.9989298,0.00008157121,0.0000097540815,0.00032330942,0.0006434786,0.000012108244],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014220767,0.000059000547,0.0000765092,0.00035926662,0.0007523,0.00048659925,0.00025882278,0.000044746706,0.0025439353],"category_scores_gemma":[0.0015488416,0.000052119136,0.000034973975,0.00093067274,0.00013316322,0.0008725942,0.00013923476,0.00044135016,0.003069844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092898745,0.000055047494,0.00094595744,0.000006771172,0.000012976139,0.0000056597705,0.000019193207,0.002708882,0.035980064,0.9539605,0.0032586947,0.0030369905],"study_design_scores_gemma":[0.00047655863,0.000009039966,0.001307997,0.00001032282,0.000021855738,0.0000023384853,0.00034083612,0.14718556,0.002171919,0.034527507,0.8136603,0.0002857326],"about_ca_topic_score_codex":0.0004048665,"about_ca_topic_score_gemma":0.0019903409,"teacher_disagreement_score":0.91943294,"about_ca_system_score_codex":0.000014446324,"about_ca_system_score_gemma":0.000028366254,"threshold_uncertainty_score":0.99836785},"labels":[],"label_agreement":null},{"id":"W4243541317","doi":"10.1287/opre.1120.1077","title":"In This Issue","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"demographic modeling and climate adaptation","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.48962323668600216,"score_gpt":0.5784450957497048,"score_spread":0.08882185906370266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243541317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79068303,0.0004801695,0.002655469,0.01040214,0.00046178972,0.00028279333,0.0000061434866,0.000022149181,0.19500631],"genre_scores_gemma":[0.9505125,0.00005285898,0.0012465098,0.0001422856,0.00015951817,0.000044325494,0.0000035597734,0.0000049796995,0.047833424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99718064,0.00052468135,0.00030686054,0.0001942476,0.0014296538,0.00036390193],"domain_scores_gemma":[0.9984474,0.0005479996,0.000008289149,0.00039322404,0.000495801,0.00010725412],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011418654,0.000045516732,0.00008409237,0.00073974935,0.00030310074,0.0002945125,0.0003393622,0.0000516002,0.00897737],"category_scores_gemma":[0.002620112,0.000033712673,0.00002786999,0.0020167339,0.000075007185,0.0008494332,0.00007373574,0.00023898212,0.008563987],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051352945,0.0011011579,0.07409752,0.000008551549,0.00001594194,0.000011146556,0.026929863,0.02476215,0.012707924,0.1882369,0.5472018,0.12487568],"study_design_scores_gemma":[0.00046314023,0.000081189784,0.018661521,0.000017028,0.0000022972808,0.000009410634,0.008032951,0.28679734,0.0010732563,0.011267784,0.6733605,0.00023356214],"about_ca_topic_score_codex":0.0007071013,"about_ca_topic_score_gemma":0.0006346761,"teacher_disagreement_score":0.2620352,"about_ca_system_score_codex":0.000030982523,"about_ca_system_score_gemma":0.00006216327,"threshold_uncertainty_score":0.99220794},"labels":[],"label_agreement":null},{"id":"W4247906728","doi":"10.1007/978-3-642-10326-1_5","title":"Network Models","year":2010,"lang":"en","type":"book-chapter","venue":"Operations Research","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Subject (documents); Euler's formula; Bridge (graph theory); Graph; Section (typography); Graph theory; Mathematics; Calculus (dental); Computer science; Combinatorics; Mathematical analysis; Library science","score_opus":0.11622483620308983,"score_gpt":0.34025102430846615,"score_spread":0.22402618810537633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247906728","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061953424,0.00030570137,0.24331598,0.0009194158,0.00039843787,0.0003099368,0.000010366405,0.000082986575,0.75465095],"genre_scores_gemma":[0.0018182155,0.00013363089,0.065260015,0.00015227722,0.00072068913,0.000056922123,0.000029215922,0.000033637407,0.9317954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803346,0.00009739967,0.00021014827,0.00051648397,0.0006960185,0.0004464754],"domain_scores_gemma":[0.997913,0.00014331829,0.0000144578435,0.0012307737,0.00054702925,0.00015139101],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014915419,0.0001730424,0.00017713617,0.00028541463,0.0010611421,0.00064845756,0.0015938753,0.00033535273,0.000471837],"category_scores_gemma":[0.000024595936,0.00015838094,0.00008486776,0.00017909393,0.00023738819,0.00046711313,0.00062726164,0.0017875115,0.0011086671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.832764e-7,0.000008775498,5.227095e-8,0.0000029416271,0.000010684738,0.000015268277,0.00010270076,0.008406851,0.000043690427,0.98289424,0.0021818513,0.00633195],"study_design_scores_gemma":[0.00005359155,0.000040774186,3.907725e-7,0.00003107718,0.000001861632,0.000009748335,0.0000017387106,0.110437214,0.000033645763,0.779596,0.10962856,0.00016542849],"about_ca_topic_score_codex":0.000015260726,"about_ca_topic_score_gemma":0.000091168324,"teacher_disagreement_score":0.20329827,"about_ca_system_score_codex":0.000029917093,"about_ca_system_score_gemma":0.00030627532,"threshold_uncertainty_score":0.9996691},"labels":[],"label_agreement":null},{"id":"W4248383067","doi":"10.1287/opre.1110.0955","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.12887956103084125,"score_gpt":0.3576260127367004,"score_spread":0.22874645170585917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248383067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4953853,0.00008218071,0.009583797,0.0013238747,0.00020461217,0.0004745504,0.0000038570693,0.00024287032,0.49269897],"genre_scores_gemma":[0.9939477,0.000003568095,0.00069414533,0.00023537278,0.00036167607,0.000047719557,0.000016262582,0.000012882275,0.0046807122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915504,0.000034945224,0.00012275668,0.00017241754,0.00025283708,0.000261989],"domain_scores_gemma":[0.9991172,0.000038633396,0.000010380834,0.00027273005,0.0005504694,0.000010609353],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001124257,0.000058874422,0.00007870575,0.00036855807,0.0005794767,0.00019444583,0.00024292585,0.000031270694,0.003464772],"category_scores_gemma":[0.0006549736,0.00005203291,0.000035370173,0.0009344266,0.00010869526,0.000924967,0.00014133363,0.00017452441,0.0035340276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023959312,0.00009450916,0.0014571551,0.0000094033885,0.000024642433,0.000012063378,0.00012235649,0.0010465673,0.0012055307,0.99114823,0.0024907032,0.0023648508],"study_design_scores_gemma":[0.0016678381,0.00006921789,0.008726587,0.000077395,0.00011532309,0.0000056306612,0.0038383915,0.20745479,0.006279219,0.20172067,0.5689761,0.0010688407],"about_ca_topic_score_codex":0.00090573204,"about_ca_topic_score_gemma":0.00048580652,"teacher_disagreement_score":0.7894276,"about_ca_system_score_codex":0.000028120814,"about_ca_system_score_gemma":0.000020805806,"threshold_uncertainty_score":0.9974462},"labels":[],"label_agreement":null},{"id":"W4254803445","doi":"10.1287/opre.1110.1021","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.24412513991963783,"score_gpt":0.33936823712945524,"score_spread":0.09524309720981741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254803445","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11844045,0.00005382363,0.0006483022,0.0014217066,0.00038686206,0.00053849886,0.0000018419046,0.00012320711,0.8783853],"genre_scores_gemma":[0.9871343,0.0000073202455,0.00022752101,0.0007832535,0.0006059031,0.000108569955,0.000024359053,0.000014056951,0.011094728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989947,0.000023727853,0.00013415716,0.00018501731,0.0003478223,0.000314545],"domain_scores_gemma":[0.9993389,0.000014059725,0.000008426581,0.00026074026,0.00036416552,0.000013667767],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00097287016,0.000068147994,0.000069492446,0.00038941213,0.0004878783,0.00031642488,0.00027594817,0.000031445536,0.007830489],"category_scores_gemma":[0.0001796155,0.00006012141,0.00003235382,0.0006122277,0.000090662754,0.0007671365,0.00021053266,0.00014664573,0.005377798],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017896136,0.00019541521,0.004702779,0.000026871747,0.000022103413,0.00001608972,0.0002101221,0.000059426515,0.00031157272,0.9004591,0.09060067,0.0033779566],"study_design_scores_gemma":[0.00048064764,0.00002331092,0.0077782287,0.000015356925,0.000009456931,6.018753e-7,0.0013080961,0.01581101,0.0004132864,0.0038010415,0.9701638,0.00019513065],"about_ca_topic_score_codex":0.0020161325,"about_ca_topic_score_gemma":0.00046113716,"teacher_disagreement_score":0.89665806,"about_ca_system_score_codex":0.00003554289,"about_ca_system_score_gemma":0.000021459575,"threshold_uncertainty_score":0.9953966},"labels":[],"label_agreement":null},{"id":"W4255812521","doi":"10.1007/978-3-642-10326-1_12","title":"Waiting Line Models","year":2010,"lang":"en","type":"book-chapter","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Erlang (programming language); Telephone line; Queueing theory; Computer science; Queue; Operations research; Front line; Line (geometry); Service (business); Workstation; Telecommunications; Operating system; Engineering; Computer network; History; Business; Telephony; Mathematics; Marketing; Programming language","score_opus":0.5032930426364935,"score_gpt":0.5701330654151782,"score_spread":0.06684002277868462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255812521","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005662738,0.00029709132,0.008330659,0.008125496,0.0007504513,0.0025563505,0.00019892481,0.00016074216,0.97901404],"genre_scores_gemma":[0.012689803,0.0010358072,0.019534301,0.0004756552,0.0021331948,0.00050192414,0.0011534856,0.00017109525,0.9623047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590814,0.000545667,0.0010558217,0.0006596294,0.0009820279,0.00084872753],"domain_scores_gemma":[0.99378645,0.00064005976,0.000074188916,0.00097311335,0.0041721333,0.00035407252],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0038434805,0.0003023097,0.00042465556,0.00068391,0.006684058,0.00014606885,0.00040061763,0.0015981831,0.009804659],"category_scores_gemma":[0.0007170898,0.00028168198,0.00009743865,0.00018811849,0.00020617602,0.0003231291,0.00028253734,0.0076254904,0.0039010455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013938805,0.00003144477,0.0000043537325,0.00014350991,0.000029564344,0.000010130582,0.0015967976,0.027836464,0.0004029153,0.9620904,0.004170102,0.003670406],"study_design_scores_gemma":[0.00043836317,0.00012871553,0.000002287131,0.0007348464,0.000019543357,0.000004139201,0.00045082596,0.57496417,0.00003233748,0.014401061,0.4083552,0.00046851885],"about_ca_topic_score_codex":0.0008078688,"about_ca_topic_score_gemma":0.0063486104,"teacher_disagreement_score":0.9476893,"about_ca_system_score_codex":0.00037471327,"about_ca_system_score_gemma":0.0036246753,"threshold_uncertainty_score":0.9999635},"labels":[],"label_agreement":null},{"id":"W4282920135","doi":"10.1287/opre.2022.2307","title":"Technical Note—Data-Driven Newsvendor Problem: Performance of the Sample Average Approximation","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Newsvendor model; Sample (material); Flatness (cosmology); Time horizon; Mathematical optimization; Computer science; Economic order quantity; Mathematics; Supply chain","score_opus":0.0958701819305228,"score_gpt":0.3265617765501134,"score_spread":0.23069159461959063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282920135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962324,0.00018161435,0.026351353,0.040844582,0.0017527349,0.012110668,0.00039454483,0.00045904648,0.22167307],"genre_scores_gemma":[0.9941674,0.000008843708,0.0023293977,0.00033095028,0.00025340426,0.00040640548,0.0003286318,0.000017294506,0.002157686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820703,0.0000925745,0.00026239824,0.00027893175,0.0009009423,0.00025812208],"domain_scores_gemma":[0.9988624,0.00005714067,0.000043673892,0.0008283947,0.00019923037,0.000009155351],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016723837,0.000081368424,0.000099658115,0.00027083314,0.0013964822,0.00020877777,0.0011973736,0.000023353488,0.0018333877],"category_scores_gemma":[0.00022779647,0.00006395637,0.00004027083,0.0012018773,0.00011532458,0.0007959808,0.0026420383,0.00037115288,0.0000869794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014888513,0.0013998993,0.01238656,0.00081103423,0.00004654115,0.0000045743177,0.000558881,0.5200027,0.013040825,0.24231684,0.17474517,0.034538064],"study_design_scores_gemma":[0.0002735594,0.000028125869,0.001157313,0.000014588321,0.000008570586,9.428469e-7,0.00023405654,0.7246294,0.00012536225,0.00032834927,0.27310959,0.0000901523],"about_ca_topic_score_codex":0.0010180614,"about_ca_topic_score_gemma":0.00039820225,"teacher_disagreement_score":0.297935,"about_ca_system_score_codex":0.000111035515,"about_ca_system_score_gemma":0.000083267834,"threshold_uncertainty_score":0.99990356},"labels":[],"label_agreement":null},{"id":"W4282977053","doi":"10.1287/opre.2022.2302","title":"Technical Note—Revenue Volatility Under Uncertain Network Effects","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Revenue; Volatility (finance); Network effect; Externality; Microeconomics; Marginal revenue; Business; Information good; Computer science; Economics; Econometrics; The Internet; Finance","score_opus":0.23637435339611923,"score_gpt":0.5311403837330244,"score_spread":0.2947660303369052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282977053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1537732,0.00047505734,0.7681044,0.040595304,0.0010757011,0.0035209653,0.00032239547,0.0002350285,0.03189796],"genre_scores_gemma":[0.96702194,0.000003272777,0.0031057354,0.00026228148,0.00021976657,0.0009471254,0.000020150701,0.000010568478,0.028409129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99421924,0.0026036152,0.00039031936,0.0005175123,0.001888365,0.0003809168],"domain_scores_gemma":[0.9954228,0.0029857145,0.000027728373,0.0009965504,0.00043533978,0.000131891],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011859732,0.00008298586,0.00014762854,0.0002205313,0.004271994,0.000296476,0.0009903057,0.00005571265,0.0042653214],"category_scores_gemma":[0.002562387,0.00007098039,0.00007726115,0.003354651,0.00030020915,0.00019165219,0.0006585121,0.0008421392,0.00084565126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051693012,0.0002737657,0.00056996226,0.0000032891644,0.0000065172276,0.000006739792,0.0002823483,0.3939999,0.004839633,0.42983934,0.15091848,0.0192083],"study_design_scores_gemma":[0.00035654125,0.00021786561,0.0067576864,0.0000071245317,0.0000063760767,0.000031489693,0.00083944993,0.13811892,0.0005098313,0.3397292,0.51319534,0.00023016652],"about_ca_topic_score_codex":0.00009878037,"about_ca_topic_score_gemma":0.00034195755,"teacher_disagreement_score":0.81324875,"about_ca_system_score_codex":0.00018816748,"about_ca_system_score_gemma":0.0003315421,"threshold_uncertainty_score":0.9999323},"labels":[],"label_agreement":null},{"id":"W4283256888","doi":"10.1287/opre.2022.2299","title":"Early Reservation for Follow-up Appointments in a Slotted-Service Queue","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Queue; Reservation; Computer science; Service (business); Set (abstract data type); Service system; Operations management; Medicine; Computer network; Business; Marketing; Engineering","score_opus":0.3660957263224958,"score_gpt":0.5561716423170994,"score_spread":0.19007591599460355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283256888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95461273,0.00005895759,0.006456174,0.029613504,0.00066695735,0.0055893534,0.00018948437,0.00007303453,0.0027398271],"genre_scores_gemma":[0.9473043,0.000036923426,0.010107622,0.0018101329,0.0002371881,0.017383419,0.0011533103,0.000060311053,0.0219068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945478,0.002730114,0.00074183295,0.00046026966,0.0007557815,0.00076421275],"domain_scores_gemma":[0.9968487,0.00064962765,0.000041999447,0.0004950743,0.0018215352,0.00014305736],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0063469983,0.00012340241,0.00020311064,0.000680611,0.006543686,0.000084273706,0.00035824633,0.00014168445,0.0012657745],"category_scores_gemma":[0.0012531772,0.00013035536,0.000041528285,0.0023903435,0.000028428327,0.00039783877,0.00028176504,0.0013282361,0.00019803812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018797356,0.0016545332,0.082354724,0.00085145055,0.000107458516,0.000019232666,0.10367513,0.51576126,0.009131977,0.20952559,0.0672277,0.007811209],"study_design_scores_gemma":[0.007276617,0.00095162424,0.026747879,0.00017526586,0.000011075509,0.000002236524,0.02797675,0.83089066,0.000073879266,0.0013590145,0.10405799,0.00047699138],"about_ca_topic_score_codex":0.013671155,"about_ca_topic_score_gemma":0.024852073,"teacher_disagreement_score":0.31512943,"about_ca_system_score_codex":0.000990738,"about_ca_system_score_gemma":0.0020290937,"threshold_uncertainty_score":0.9996472},"labels":[],"label_agreement":null},{"id":"W4283376152","doi":"10.1287/opre.2022.2312","title":"Every Choice Function Is Pro-Con Rationalizable","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research University Higher School of Economics; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; University of Bristol; University of Glasgow; York University; Bilkent Üniversitesi; Princeton University","keywords":"Mathematics; Generalization; Function (biology); Invariant (physics); Discrete mathematics; Mathematical economics; Combinatorics; Computer science","score_opus":0.5897146195245632,"score_gpt":0.57844701019602,"score_spread":0.011267609328543204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283376152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83384806,0.0008413528,0.067574516,0.026877385,0.0035636679,0.0036777444,0.00041103826,0.00021989059,0.06298634],"genre_scores_gemma":[0.8596457,0.0000063379616,0.002366735,0.00096242456,0.0002816036,0.0006937662,0.000053946394,0.000024021221,0.13596542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98965305,0.0019293493,0.0007253798,0.0008379943,0.0063899914,0.00046423552],"domain_scores_gemma":[0.9942588,0.0023166297,0.000049900824,0.001148045,0.0020802992,0.00014632076],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.012998881,0.00012459232,0.00019291545,0.0011927759,0.0039171977,0.0017292475,0.0012167208,0.000057050933,0.06544081],"category_scores_gemma":[0.0076661175,0.00010824181,0.0000932524,0.0036425726,0.000118312295,0.0010393758,0.0010042863,0.0006351316,0.0033211967],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018061778,0.00042079974,0.0047261,0.000005193654,0.000030510002,0.000016186637,0.001950206,0.07247999,0.027747018,0.019546244,0.8387635,0.034133647],"study_design_scores_gemma":[0.00043480928,0.00014943094,0.005130051,0.0000047047965,0.000002994938,0.000013220673,0.0015029481,0.1918355,0.00060090685,0.005991196,0.79418105,0.000153166],"about_ca_topic_score_codex":0.00034229696,"about_ca_topic_score_gemma":0.0002488885,"teacher_disagreement_score":0.1193555,"about_ca_system_score_codex":0.00028914763,"about_ca_system_score_gemma":0.0006370914,"threshold_uncertainty_score":0.99930704},"labels":[],"label_agreement":null},{"id":"W4284887612","doi":"10.1287/opre.2022.2301","title":"Data Aggregation and Demand Prediction","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Aggregate (composite); Cluster analysis; Data aggregator; Benchmark (surveying); Data set; Data mining; Stock (firearms); Flexibility (engineering); Econometrics; Artificial intelligence; Statistics; Economics; Mathematics","score_opus":0.6061308537931067,"score_gpt":0.5596009659608996,"score_spread":0.04652988783220713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284887612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85725456,0.00052044506,0.09500895,0.021420242,0.00022962876,0.001846791,0.0025864386,0.00023361493,0.02089931],"genre_scores_gemma":[0.9863148,0.000034010103,0.0073382305,0.00004100765,0.000064355765,0.00028896471,0.00024130884,0.00000628917,0.00567106],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974583,0.0004299573,0.00024659318,0.00042333524,0.0012964217,0.00014540779],"domain_scores_gemma":[0.9981375,0.00041885587,0.000016941241,0.0010357574,0.00033164123,0.00005930533],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008437305,0.000039906525,0.000059683352,0.00029704004,0.0023476342,0.00043377653,0.0008708832,0.000019976462,0.0008192401],"category_scores_gemma":[0.0018017882,0.000033827873,0.000009864391,0.0012443266,0.00011930455,0.00036481392,0.001437726,0.00028448022,0.00005678933],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026029333,0.00025890025,0.0072004977,0.000004195137,0.000013261705,0.000004428327,0.0010327902,0.01634517,0.0037892023,0.12453654,0.58387876,0.26291022],"study_design_scores_gemma":[0.00009344039,0.00009199684,0.0023974264,0.0000023414086,0.0000019140114,0.000023372038,0.00063695037,0.6326427,0.00018831152,0.014709481,0.3491615,0.000050569077],"about_ca_topic_score_codex":0.00013411486,"about_ca_topic_score_gemma":0.00019224428,"teacher_disagreement_score":0.61629754,"about_ca_system_score_codex":0.000042927877,"about_ca_system_score_gemma":0.00010914233,"threshold_uncertainty_score":0.9989512},"labels":[],"label_agreement":null},{"id":"W4292790985","doi":"10.1287/opre.2022.2354","title":"Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Revenue; Revenue management; Mathematical optimization; Approximation algorithm; Computer science; Revenue model; Flexibility (engineering); Product (mathematics); Set (abstract data type); Linear approximation; Mathematics; Nonlinear system; Economics; Finance","score_opus":0.08928123945198257,"score_gpt":0.3485242136304185,"score_spread":0.25924297417843595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292790985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019104559,0.0026793147,0.39676654,0.14048052,0.00954153,0.07664313,0.00035411085,0.0032857931,0.35114452],"genre_scores_gemma":[0.8071158,0.000039946808,0.09129698,0.005523237,0.008040135,0.032497987,0.0028187467,0.00024376603,0.052423414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748886,0.00008497357,0.00031466878,0.00055620173,0.0008615496,0.0006937349],"domain_scores_gemma":[0.99898577,0.000039800037,0.000036034082,0.0006343407,0.0002801089,0.000023920727],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034310496,0.00015634022,0.00016132239,0.00042663078,0.0022660086,0.00047662464,0.0006558802,0.00003166784,0.0006760727],"category_scores_gemma":[0.000097205615,0.00015961434,0.000104433086,0.0016271659,0.000110001696,0.00031529643,0.0008757455,0.00038115794,0.00017948843],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021680456,0.0011490604,0.00039371187,0.00064168853,0.0000423834,0.0000323815,0.000043997254,0.19221826,0.0003662011,0.23232324,0.5234426,0.049129616],"study_design_scores_gemma":[0.0005348903,0.00004881068,0.00006053164,0.000019732573,0.000018679526,5.681242e-7,0.00017916925,0.255169,0.000018796318,0.0011337447,0.74265337,0.00016268154],"about_ca_topic_score_codex":0.00017700913,"about_ca_topic_score_gemma":0.00019147192,"teacher_disagreement_score":0.78801125,"about_ca_system_score_codex":0.00018906876,"about_ca_system_score_gemma":0.00005162694,"threshold_uncertainty_score":0.9990329},"labels":[],"label_agreement":null},{"id":"W4293212500","doi":"10.1287/opre.2022.2342","title":"Dynamic Interday and Intraday Scheduling","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Operations research; Leverage (statistics); Health care; Job shop scheduling; Business process; Operations management; Quality of service; Artificial intelligence; Computer network; Work in process; Engineering","score_opus":0.1671733503047436,"score_gpt":0.5442154413974684,"score_spread":0.3770420910927248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293212500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94893163,0.00045651672,0.016607868,0.024987997,0.0005907323,0.0016567119,0.00006547338,0.00010670223,0.0065963687],"genre_scores_gemma":[0.9664602,0.00016380314,0.02138203,0.00053880597,0.000082768944,0.001166437,0.00014678971,0.000028228133,0.010030886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958621,0.0023757373,0.00041576748,0.00033532345,0.0004993646,0.00051168975],"domain_scores_gemma":[0.9985869,0.00038294034,0.00001931866,0.00032009158,0.0005297485,0.00016101486],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0041164476,0.00008948494,0.00013676073,0.00038585253,0.010156074,0.00007936816,0.00019317245,0.000077302066,0.0030887863],"category_scores_gemma":[0.00061931927,0.000087943765,0.000019933294,0.00080033106,0.00009134308,0.00020257442,0.0004555489,0.001841684,0.00015042949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018968852,0.00060455245,0.013304837,0.0003532975,0.000095910254,0.00004279068,0.065837115,0.6512817,0.012742002,0.20481291,0.009490517,0.041244686],"study_design_scores_gemma":[0.00052982516,0.0001976064,0.0013674997,0.000040498715,0.0000039335137,0.00000972454,0.022181977,0.942231,0.000013331207,0.00024602635,0.033020195,0.00015840713],"about_ca_topic_score_codex":0.0007681111,"about_ca_topic_score_gemma":0.0013101853,"teacher_disagreement_score":0.29094929,"about_ca_system_score_codex":0.0004485328,"about_ca_system_score_gemma":0.0009819628,"threshold_uncertainty_score":0.9978225},"labels":[],"label_agreement":null},{"id":"W4293227094","doi":"10.1287/opre.2021.2241","title":"A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis; Wilfrid Laurier University; Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Quadratic equation; Class (philosophy); Mathematical optimization; Quadratic programming; Regular polygon; Bilinear interpolation; Variable (mathematics); Mathematics; Quadratic unconstrained binary optimization; Convex optimization; Computer science; Applied mathematics; Artificial intelligence; Arithmetic; Mathematical analysis","score_opus":0.09093636409137897,"score_gpt":0.403254417085231,"score_spread":0.31231805299385207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293227094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72448224,0.00006703765,0.2729101,0.0002748189,0.000068719935,0.0016051228,0.000052168398,0.00012388467,0.00041593143],"genre_scores_gemma":[0.89992297,0.000005609213,0.09863162,0.00000928197,0.000030559684,0.00082927925,0.00028420426,0.000025181396,0.00026127335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998801,0.00031125505,0.0002341587,0.0001512184,0.00029485917,0.00020750865],"domain_scores_gemma":[0.9994092,0.000079066696,0.000012784787,0.00020620666,0.00024409615,0.00004864199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020430405,0.000064515145,0.00010737754,0.00023408099,0.0005487765,0.000078025274,0.00010032953,0.00003975497,0.0000547096],"category_scores_gemma":[0.00010363782,0.00006712572,0.00001956201,0.00046968122,0.000028476818,0.0002858846,0.00006626554,0.00018555211,0.0000013633096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031488875,0.0001924841,0.0005497558,0.00020581661,0.000023810675,6.7815546e-7,0.004574137,0.9447473,0.023460576,0.017189024,0.00014644225,0.008878471],"study_design_scores_gemma":[0.0004155722,0.00025628664,0.00027018832,0.0000070925043,0.0000041631797,0.0000026437197,0.001044872,0.9961606,0.0007119831,0.00012125656,0.000933461,0.00007183605],"about_ca_topic_score_codex":0.00001802441,"about_ca_topic_score_gemma":0.000032149317,"teacher_disagreement_score":0.17544076,"about_ca_system_score_codex":0.00009875712,"about_ca_system_score_gemma":0.000049831728,"threshold_uncertainty_score":0.42208004},"labels":[],"label_agreement":null},{"id":"W4297225278","doi":"10.1287/opre.2022.2300","title":"Individualized Dynamic Patient Monitoring Under Alarm Fatigue","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Technology and Patient Monitoring","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta; University of Calgary","funders":"","keywords":"ALARM; Computer science; Harm; Constant false alarm rate; False positive paradox; False alarm; Process (computing); Medical emergency; Medicine; Artificial intelligence; Psychology; Social psychology; Engineering","score_opus":0.23069797161117378,"score_gpt":0.4962284166904971,"score_spread":0.26553044507932333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297225278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900637,0.00034978718,0.00017495616,0.0065739485,0.00042250738,0.0007526811,0.000026256042,0.00011885522,0.0015172702],"genre_scores_gemma":[0.9952267,0.00006126697,0.0019197841,0.000078263234,0.000072580064,0.0007396489,0.000068175555,0.000022352979,0.0018112384],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977812,0.00040053882,0.00022045196,0.0002815748,0.0008896164,0.0004266297],"domain_scores_gemma":[0.9990618,0.000111727146,0.000013453155,0.00041719974,0.00026117623,0.00013461894],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00084818265,0.00008810812,0.00014513584,0.0005049979,0.0016795336,0.00003392946,0.00016007666,0.00008315198,0.0005500233],"category_scores_gemma":[0.00019937308,0.00008795892,0.000039350827,0.0008743891,0.00008748799,0.00007557015,0.00029580097,0.0012582744,0.000046388337],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008068062,0.0036946419,0.41887638,0.00039590805,0.0006474919,0.0007389892,0.023811867,0.049028493,0.10859743,0.01944055,0.008397329,0.3655641],"study_design_scores_gemma":[0.01691928,0.020571686,0.18206748,0.0010489927,0.00022755998,0.0011296077,0.16737963,0.06412048,0.15722859,0.002076175,0.38465455,0.0025759605],"about_ca_topic_score_codex":0.00027506825,"about_ca_topic_score_gemma":0.00003449599,"teacher_disagreement_score":0.3762572,"about_ca_system_score_codex":0.0005282479,"about_ca_system_score_gemma":0.00040720007,"threshold_uncertainty_score":0.99962014},"labels":[],"label_agreement":null},{"id":"W4306412277","doi":"10.1287/opre.2022.2389","title":"Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Queen's University","funders":"National University of Singapore; Natural Sciences and Engineering Research Council of Canada; University of Cambridge; McGill University; Northwestern University","keywords":"Dynamic pricing; Heuristic; Computer science; Joint (building); Operations research; Mathematical optimization; Value (mathematics); Simple (philosophy); Inventory control; Microeconomics; Economics; Mathematics","score_opus":0.07327413135538285,"score_gpt":0.3088496114662989,"score_spread":0.23557548011091606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306412277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845163,0.00078093586,0.0019364927,0.005613654,0.00012473253,0.0034737098,0.00001326092,0.000057214125,0.0034836743],"genre_scores_gemma":[0.9944092,0.000037914615,0.00287858,0.0004915371,0.00017395544,0.00073126575,0.000033254713,0.000035420995,0.0012088702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984143,0.00010667529,0.00033338516,0.00030158917,0.0004902699,0.00035382132],"domain_scores_gemma":[0.9993766,0.000085246684,0.000067404646,0.00025238024,0.00019860745,0.000019741106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002880002,0.00012055003,0.00020251599,0.00040427072,0.0021729919,0.00048103058,0.00023711407,0.000023177452,0.00007653185],"category_scores_gemma":[0.00019160692,0.00010174636,0.000047987847,0.000529378,0.00034792675,0.00034241047,0.0009484125,0.00026375044,0.0000029498124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005077674,0.0006331052,0.0031403224,0.0025908956,0.00033126556,0.000007549191,0.021790544,0.32327464,0.0053975857,0.6165981,0.0032609054,0.022467246],"study_design_scores_gemma":[0.0019086084,0.00007734788,0.0007208289,0.000056235796,0.000037267695,0.0000013915411,0.0067856465,0.96277136,0.000021972266,0.00069467747,0.026768059,0.00015660415],"about_ca_topic_score_codex":0.0038811704,"about_ca_topic_score_gemma":0.00032898303,"teacher_disagreement_score":0.6394967,"about_ca_system_score_codex":0.00016757935,"about_ca_system_score_gemma":0.00007027112,"threshold_uncertainty_score":0.999126},"labels":[],"label_agreement":null},{"id":"W4307640475","doi":"10.1287/opre.2022.2361","title":"An Approximate Analysis of Dynamic Pricing, Outsourcing, and Scheduling Policies for a Multiclass Make-to-Stock Queue in the Heavy Traffic Regime","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Outsourcing; Queue; Computer science; Dynamic pricing; Queueing theory; Workload; Scheduling (production processes); Mathematical optimization; Operations research; Economics; Microeconomics; Business; Mathematics","score_opus":0.06807434725239911,"score_gpt":0.3653375569868442,"score_spread":0.2972632097344451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307640475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99034715,0.000059226044,0.0019483856,0.005334801,0.000036944028,0.0014896615,0.000016793667,0.000025490717,0.00074153097],"genre_scores_gemma":[0.99691653,0.0000050337944,0.00067146466,0.00062016107,0.00006235479,0.0007901002,0.00012709112,0.000017546497,0.0007897177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984407,0.00013861847,0.0002777372,0.00031014712,0.0004907283,0.00034206838],"domain_scores_gemma":[0.9993163,0.00009520085,0.000035920533,0.00038391468,0.00015192032,0.000016764148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002965586,0.000102495316,0.00019385306,0.0018180727,0.0008891908,0.0004251903,0.0004309291,0.000022725922,0.00006384458],"category_scores_gemma":[0.00015251455,0.00008586959,0.00005748719,0.0027944546,0.00007241837,0.0002619186,0.00026262825,0.00020525056,0.0000030041908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007394746,0.0004780493,0.0020995005,0.00012564911,0.00011991058,0.0000024763633,0.0052516256,0.9652792,0.0006149423,0.021199692,0.0005720865,0.004182882],"study_design_scores_gemma":[0.00038636735,0.000063010055,0.0037888563,0.000009567859,0.000067978974,3.0965842e-7,0.0141150765,0.9740719,0.000005383533,0.000038056845,0.0073561124,0.00009737536],"about_ca_topic_score_codex":0.0027025067,"about_ca_topic_score_gemma":0.008960826,"teacher_disagreement_score":0.021161636,"about_ca_system_score_codex":0.000096309326,"about_ca_system_score_gemma":0.000028857094,"threshold_uncertainty_score":0.6839027},"labels":[],"label_agreement":null},{"id":"W4310251704","doi":"10.1287/opre.2022.2387","title":"Data-Driven Optimization with Distributionally Robust Second Order Stochastic Dominance Constraints","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Bounding overwatch; Exploit; Computer science; Ambiguity; Robust optimization; Stochastic programming; Stochastic dominance; Stochastic optimization; Optimization problem; Adaptability; Empirical distribution function; Mathematics","score_opus":0.21635385931483805,"score_gpt":0.4358256818899646,"score_spread":0.21947182257512657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310251704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012437824,0.0000838126,0.9770969,0.002302244,0.00015602939,0.0007460145,0.0029275478,0.0000306361,0.0042189467],"genre_scores_gemma":[0.89712703,0.000059994203,0.08316737,0.000106077,0.00012682642,0.00036666996,0.005119057,0.000029201376,0.0138978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947566,0.00080526306,0.00050249975,0.0007625478,0.002789434,0.0003836468],"domain_scores_gemma":[0.995526,0.0006604213,0.000069922484,0.0014153278,0.002192537,0.00013576816],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045656734,0.00012550398,0.00018809468,0.00044134376,0.0024955673,0.0007390688,0.0018089855,0.00004477503,0.01767002],"category_scores_gemma":[0.0030178137,0.0001004664,0.000023753155,0.0032696964,0.00046878716,0.00091255497,0.0010870286,0.0004826588,0.00016570321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053161813,0.0001028529,0.00017558753,6.9612895e-7,0.000012058916,0.00000946742,0.00013267019,0.9737263,0.000019830532,0.002686732,0.020321911,0.0027587754],"study_design_scores_gemma":[0.0004925899,0.0001316333,0.00035342108,0.00000418441,0.0000056509857,0.00004803925,0.0009765774,0.98198825,0.000006566771,0.00017134796,0.015682362,0.00013939505],"about_ca_topic_score_codex":0.00005391154,"about_ca_topic_score_gemma":0.00057480624,"teacher_disagreement_score":0.8939296,"about_ca_system_score_codex":0.00013701156,"about_ca_system_score_gemma":0.0013135915,"threshold_uncertainty_score":0.998803},"labels":[],"label_agreement":null},{"id":"W4318479566","doi":"10.1287/opre.2022.2429","title":"Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Regret; Minification; Mathematical optimization; Computer science; Stochastic programming; Mathematics; Machine learning","score_opus":0.247145376137846,"score_gpt":0.510228524390415,"score_spread":0.26308314825256895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318479566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31723922,0.00011597847,0.6568306,0.0058166157,0.00071168464,0.0050298846,0.0001738421,0.00063822506,0.01344393],"genre_scores_gemma":[0.9692381,0.00029622784,0.013680079,0.00001688124,0.00009207371,0.00029764563,0.0002605537,0.000024251884,0.016094167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952347,0.0008879166,0.0006626886,0.00059778325,0.0021149477,0.0005019139],"domain_scores_gemma":[0.99717087,0.0009677087,0.000048143895,0.00073332817,0.00093082373,0.0001491333],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00731458,0.000117126714,0.00019114121,0.0016540859,0.00062399573,0.0006955197,0.00060548633,0.00016971953,0.00047560595],"category_scores_gemma":[0.011468893,0.000094635834,0.00007126898,0.008063276,0.00022206189,0.00047390728,0.00021893988,0.0005175072,0.0032335347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004721192,0.00017430219,0.0069630984,0.0000019151835,0.0000026498585,0.000034986704,0.0013360132,0.8355046,0.00034828737,0.002330526,0.011873326,0.14138311],"study_design_scores_gemma":[0.00045423623,0.00009851023,0.010710402,0.000017388102,0.0000028307832,0.000004121966,0.000978209,0.97770566,0.000044232613,0.0009589501,0.00889371,0.00013175323],"about_ca_topic_score_codex":0.0005544746,"about_ca_topic_score_gemma":0.004669443,"teacher_disagreement_score":0.65199894,"about_ca_system_score_codex":0.00012368208,"about_ca_system_score_gemma":0.0002959628,"threshold_uncertainty_score":0.99754256},"labels":[],"label_agreement":null},{"id":"W4362584456","doi":"10.1287/opre.2022.2425","title":"Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and the Value of Dynamic Pricing","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dynamic pricing; Computer science; Server; Relocation; Randomness; Service (business); Queueing theory; Value (mathematics); Operations research; Microeconomics; Mathematical optimization; Economics; Computer network; Business; Marketing; Mathematics","score_opus":0.022540938760126552,"score_gpt":0.32545741681071,"score_spread":0.30291647805058347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362584456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99486774,0.000060906325,0.002964898,0.00095779024,0.000032105163,0.0004718627,0.000007125669,0.00008408372,0.0005535137],"genre_scores_gemma":[0.99766314,0.00033460432,0.0016151809,0.000008052928,0.000020139536,0.00007887389,0.000052108287,0.000016411363,0.00021148591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989786,0.000110304354,0.0003412229,0.00013878128,0.00019348788,0.00023760703],"domain_scores_gemma":[0.9993849,0.00026224277,0.0000125455745,0.0001646865,0.00014518177,0.000030461288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015335093,0.00007519784,0.00013638723,0.0002661347,0.0002960734,0.00010023467,0.00007683871,0.000046046156,0.000009837487],"category_scores_gemma":[0.00013269909,0.00006433483,0.0000160287,0.0012496929,0.00021764141,0.00015155194,0.000033506094,0.00022806102,0.0000067741225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020428226,0.000011801572,0.0024132705,0.00006426453,0.000019210574,0.0000011568882,0.007580754,0.96802175,0.012930563,0.006328058,0.00009750805,0.0025112634],"study_design_scores_gemma":[0.0003792256,0.000016610362,0.08263479,0.000061685074,0.0000042718984,0.0000014265556,0.0008504945,0.91567206,0.0002021852,0.000089836736,0.000032294454,0.000055111657],"about_ca_topic_score_codex":0.004464288,"about_ca_topic_score_gemma":0.003582427,"teacher_disagreement_score":0.08022152,"about_ca_system_score_codex":0.000052696494,"about_ca_system_score_gemma":0.0000748117,"threshold_uncertainty_score":0.6748697},"labels":[],"label_agreement":null},{"id":"W4367188984","doi":"10.1287/opre.2023.2454","title":"Does the Prohibition of Trade-Through Hurt Liquidity Demanders?","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Corporate Finance and Governance","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Market liquidity; Resilience (materials science); Order (exchange); Business; Stock (firearms); Monetary economics; Psychological resilience; Economics; High-frequency trading; International economics; Finance","score_opus":0.12316884540751417,"score_gpt":0.3496545482387698,"score_spread":0.22648570283125563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367188984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9600472,0.000027852997,0.00038504758,0.032664575,0.00019126841,0.0005458939,0.000014386725,0.00006671055,0.00605707],"genre_scores_gemma":[0.9958764,0.00011357437,0.000029617135,0.00023989416,0.0005269076,0.00010639444,0.000038338057,0.000010344279,0.0030585853],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989793,0.00003082201,0.0001631638,0.00017091236,0.00043082586,0.0002249812],"domain_scores_gemma":[0.99942356,0.000058858164,0.00003090243,0.00025911865,0.00022337404,0.000004201353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008762105,0.000061755905,0.00008092797,0.00010006319,0.00057137624,0.00018309025,0.00021978134,0.000036171223,0.00016208991],"category_scores_gemma":[0.00020566402,0.000033246826,0.000036747264,0.001486555,0.00014182851,0.0009166602,0.00010429434,0.00016799255,0.00046206248],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001621748,0.0004738818,0.024622854,0.0006508364,0.00006408545,0.000037862013,0.001763306,0.014630487,0.028061263,0.36485457,0.5543942,0.010284467],"study_design_scores_gemma":[0.001082461,0.00007694247,0.3029025,0.00023756482,0.000028997123,0.0000016245282,0.0027982073,0.057774156,0.007660108,0.017754175,0.6092771,0.00040613822],"about_ca_topic_score_codex":0.0011685145,"about_ca_topic_score_gemma":0.0017007954,"teacher_disagreement_score":0.3471004,"about_ca_system_score_codex":0.000017529452,"about_ca_system_score_gemma":0.00005663251,"threshold_uncertainty_score":0.59390324},"labels":[],"label_agreement":null},{"id":"W4367323522","doi":"10.1287/opre.2023.2452","title":"Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multidisciplinary approach; Queueing theory; Computer science; Management science; Service (business); Work (physics); Operations research; Strengths and weaknesses; Behavioral modeling; Behavioural sciences; Field (mathematics); Queue; Engineering ethics; Risk analysis (engineering); Psychology; Artificial intelligence; Sociology; Social science; Engineering; Mathematics; Psychotherapist; Medicine; Social psychology","score_opus":0.12114341980471321,"score_gpt":0.43202313807992077,"score_spread":0.31087971827520755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367323522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88771987,0.000011980589,0.003986389,0.06195984,0.0006248287,0.004519681,0.000019410048,0.00024490885,0.040913112],"genre_scores_gemma":[0.9663111,0.0000025544714,0.0011306329,0.0004183746,0.010306143,0.0012279691,0.000052457974,0.000037095717,0.020513697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.00006250318,0.00015957867,0.00037718256,0.0007279733,0.0004903314],"domain_scores_gemma":[0.9986846,0.0001986571,0.000017527687,0.00055649853,0.0005230382,0.000019687584],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004567243,0.000100393416,0.00009523574,0.00062164175,0.0050442927,0.0011064532,0.0009357405,0.0000293254,0.00013200915],"category_scores_gemma":[0.00089493964,0.000058384045,0.00005832009,0.004956004,0.0003365958,0.0006903468,0.00067656743,0.00027777167,0.0012549268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016256448,0.0002876077,0.00014376892,0.00003256941,0.000020499516,0.0000034539407,0.0035343885,0.77096826,0.0046836273,0.14997913,0.055216383,0.01496775],"study_design_scores_gemma":[0.00031263588,0.000067925284,0.0008072273,0.000026785741,0.000029332721,5.7014233e-7,0.017665252,0.7749594,0.00044693882,0.0022966934,0.20317301,0.00021427199],"about_ca_topic_score_codex":0.00033209656,"about_ca_topic_score_gemma":0.0005517699,"teacher_disagreement_score":0.14795662,"about_ca_system_score_codex":0.00008164277,"about_ca_system_score_gemma":0.0000847191,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W4376114348","doi":"10.1287/opre.2023.2467","title":"Bayesian Inventory Control: Accelerated Demand Learning via Exploration Boosts","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Newsvendor model; Bayesian probability; Computer science; Control (management); Inventory control; Bayesian inference; Artificial intelligence; Statistical learning; Mathematical optimization; Operations research; Machine learning; Mathematics; Supply chain; Business","score_opus":0.13215596565224358,"score_gpt":0.3481437544314479,"score_spread":0.21598778877920433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376114348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6083979,0.0003865804,0.081644684,0.041254457,0.002600173,0.006630607,0.000010145564,0.0034345046,0.25564095],"genre_scores_gemma":[0.98391426,0.000048928043,0.000032533822,0.00065139314,0.0009869938,0.00037394091,0.00031912036,0.000043742315,0.013629112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978626,0.00016077128,0.0003035461,0.00038594336,0.0007270185,0.00056013366],"domain_scores_gemma":[0.9990494,0.000056788555,0.00003203171,0.00029164724,0.0005350205,0.00003509723],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023723352,0.00015344736,0.0001555318,0.001163569,0.0014266212,0.0011862532,0.00030998135,0.000077910736,0.0013807565],"category_scores_gemma":[0.00038773555,0.00015093842,0.000056823235,0.0022522674,0.00009821877,0.0022947649,0.00024320252,0.00038778048,0.005687839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022392721,0.00054162584,0.032035396,0.00049263245,0.00028294077,0.00018286772,0.0017231972,0.4274406,0.022381678,0.0865795,0.39937103,0.028744606],"study_design_scores_gemma":[0.000760432,0.000027529886,0.0015492424,0.000028100812,0.000011772838,3.9752302e-7,0.0011679645,0.82858884,0.000121862926,0.0009807787,0.16657008,0.00019299088],"about_ca_topic_score_codex":0.0006053668,"about_ca_topic_score_gemma":0.0006079034,"teacher_disagreement_score":0.40114823,"about_ca_system_score_codex":0.00009039694,"about_ca_system_score_gemma":0.000048427464,"threshold_uncertainty_score":0.9998734},"labels":[],"label_agreement":null},{"id":"W4376873776","doi":"10.1287/opre.2023.2472","title":"The Generalized <i>c</i>/<i>μ</i> Rule for Queues with Heterogeneous Server Pools","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Queue; Computer science; Routing (electronic design automation); Computer network; Queueing theory; Priority queue; Mathematical optimization; Zhàng; Service (business); Distributed computing; Mathematics; Economics","score_opus":0.062394265294795824,"score_gpt":0.35386273909425237,"score_spread":0.29146847379945656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376873776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792194,0.0001642578,0.0027477706,0.011767116,0.00014436372,0.0013711756,0.000016498236,0.00039244996,0.0041770046],"genre_scores_gemma":[0.9636763,0.00009472024,0.001086623,0.0009413861,0.0011452954,0.0013987683,0.00023043375,0.00008521506,0.031341266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985224,0.00006773344,0.00017654402,0.0002782551,0.0004227946,0.0005322458],"domain_scores_gemma":[0.9984858,0.00028569315,0.00002262487,0.00045605653,0.00073430256,0.000015522097],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019230628,0.00010960417,0.000120973644,0.00024807814,0.002628778,0.0010324795,0.00039693568,0.000036076857,0.00008830942],"category_scores_gemma":[0.0004311934,0.000069724374,0.00006880358,0.0015744541,0.00015023764,0.0005859259,0.00020435566,0.00014611644,0.0007215109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025877715,0.000060099937,0.00027013,0.000063167696,0.0001648874,0.000018301756,0.0000856116,0.7202559,0.004041465,0.25035545,0.020857347,0.003568843],"study_design_scores_gemma":[0.0010271855,0.000043874996,0.00009155049,0.00003701158,0.000058216618,0.0000034049874,0.00066350715,0.5529384,0.002308194,0.027806919,0.4146689,0.00035286002],"about_ca_topic_score_codex":0.00031581413,"about_ca_topic_score_gemma":0.0024436086,"teacher_disagreement_score":0.39381155,"about_ca_system_score_codex":0.0000344572,"about_ca_system_score_gemma":0.0000456782,"threshold_uncertainty_score":0.9986697},"labels":[],"label_agreement":null},{"id":"W4377021812","doi":"10.1287/opre.2023.2474","title":"Is Separately Modeling Subpopulations Beneficial for Sequential Decision-Making?","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Precision medicine; Population; Plan (archaeology); Operations research; Data science; Machine learning; Medicine; Mathematics; Biology","score_opus":0.7686323651122939,"score_gpt":0.6201326544624339,"score_spread":0.14849971064986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377021812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81371933,0.0004158971,0.14358856,0.03484177,0.00087989,0.0022003292,0.0014603261,0.00016068856,0.002733217],"genre_scores_gemma":[0.9822744,0.00006606348,0.012163321,0.0012811765,0.000749331,0.0008095245,0.0002508937,0.000052695937,0.0023525774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956605,0.0002542906,0.0024544783,0.00067655434,0.0002606479,0.000693564],"domain_scores_gemma":[0.9970499,0.0015567446,0.00014704322,0.0005914186,0.0004990344,0.00015582686],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.019301455,0.00014493172,0.00047163753,0.0011793092,0.0017590479,0.00045937987,0.00038607084,0.00017908428,0.0009936157],"category_scores_gemma":[0.0071229367,0.00018937868,0.00015050746,0.0011170432,0.00006110784,0.00061044696,0.00012009802,0.000259951,0.008050773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035640744,0.00008379237,0.0023140735,0.00010464256,0.000050755465,0.0000011325536,0.002897308,0.5811239,0.000017940312,0.33591786,0.07698155,0.00047143348],"study_design_scores_gemma":[0.0003401981,0.000045194858,0.00059375144,0.00003951632,0.0000026100577,0.0000013345459,0.00075319054,0.92033535,0.000005540688,0.05835751,0.019335277,0.00019049816],"about_ca_topic_score_codex":0.000996323,"about_ca_topic_score_gemma":0.0013980743,"teacher_disagreement_score":0.33921152,"about_ca_system_score_codex":0.00049051247,"about_ca_system_score_gemma":0.00042486587,"threshold_uncertainty_score":0.9999196},"labels":[],"label_agreement":null},{"id":"W4377093594","doi":"10.1287/opre.2023.2468","title":"Optimal Subscription Planning for Digital Goods","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Revenue; Set (abstract data type); Operations research; Tier 2 network; Microeconomics; Business; Mathematical optimization; Economics; Computer network; Mathematics; Finance","score_opus":0.17248094584994011,"score_gpt":0.3662416084710237,"score_spread":0.1937606626210836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377093594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9478586,0.0000072081316,0.00087572314,0.0004399979,0.00016117595,0.0003049925,0.000014319152,0.000111296424,0.050226726],"genre_scores_gemma":[0.9920931,0.0000021332955,0.00019417785,0.00007852427,0.00072566496,0.00011437066,0.0006053182,0.00001993675,0.0061668023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920905,6.1192725e-7,0.00013853441,0.00017356883,0.00014611975,0.00033210666],"domain_scores_gemma":[0.99965394,0.000041412874,0.000009602529,0.00012456844,0.00015787258,0.000012604918],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005040743,0.00006320387,0.00007062781,0.0003621695,0.00051349716,0.0042706807,0.0001525659,0.000037306967,0.00006648341],"category_scores_gemma":[0.00021553965,0.000059636084,0.00004010969,0.00053417037,0.00003741834,0.006302149,0.0001365112,0.0000913527,0.002101998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011877354,0.00015995576,0.004822204,0.00018359073,0.000054880755,0.000014552051,0.00028005854,0.25010484,0.0010299654,0.55557793,0.15921974,0.0284335],"study_design_scores_gemma":[0.00048587564,0.000035067605,0.0020368055,0.000027635619,0.0000040601144,0.0000011989107,0.003255334,0.76701957,0.00005257778,0.0068540745,0.22000766,0.00022010978],"about_ca_topic_score_codex":0.0000594106,"about_ca_topic_score_gemma":0.000038224047,"teacher_disagreement_score":0.5487239,"about_ca_system_score_codex":0.000028420143,"about_ca_system_score_gemma":0.000026068994,"threshold_uncertainty_score":0.998675},"labels":[],"label_agreement":null},{"id":"W4384161718","doi":"10.1287/opre.2023.2487","title":"Behavior-Aware Queueing: The Finite-Buffer Setting with Many Strategic Servers","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Server; Queueing theory; Computer science; Workload; Operations research; Computer network; Operating system; Mathematics","score_opus":0.10267565543611647,"score_gpt":0.36112304210838303,"score_spread":0.2584473866722666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384161718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98099256,0.000017203423,0.00088565284,0.0058677136,0.000064503736,0.0005728857,0.000006334211,0.0002880223,0.011305151],"genre_scores_gemma":[0.9912817,0.000008174489,0.00010348612,0.00024904512,0.00037262856,0.00026584652,0.00011991642,0.000039181174,0.0075600375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825025,0.00011118772,0.0001918843,0.00033627995,0.00062036276,0.0004900268],"domain_scores_gemma":[0.99861944,0.00027185748,0.000029003008,0.00051258894,0.00054904184,0.000018060875],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019010825,0.00013752753,0.0001205663,0.0005114781,0.0019027075,0.0010539651,0.00047329374,0.000051307834,0.0006198672],"category_scores_gemma":[0.00023090543,0.00009226076,0.00005346675,0.003239163,0.00017779914,0.0009811075,0.00027578004,0.00047545182,0.0013878007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081479564,0.00015550706,0.014179606,0.00013445005,0.00013729381,0.0002515531,0.00055471796,0.7469436,0.0020315014,0.22912943,0.003972066,0.0024288208],"study_design_scores_gemma":[0.00063183816,0.00004382883,0.0053402414,0.00012380606,0.00013278481,0.0000047163153,0.019611033,0.95228595,0.00018040501,0.0070711975,0.014054316,0.00051986834],"about_ca_topic_score_codex":0.00070767885,"about_ca_topic_score_gemma":0.0017527983,"teacher_disagreement_score":0.22205824,"about_ca_system_score_codex":0.000052349304,"about_ca_system_score_gemma":0.00007603225,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W4385492612","doi":"10.1287/opre.2021.0694","title":"Inventory Control and Learning for One-Warehouse Multistore System with Censored Demand","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Inventory control; Computer science; Time horizon; Operations research; Control (management); Demand patterns; Focus (optics); Demand forecasting; A priori and a posteriori; Inventory theory; Dual (grammatical number); Operations management; Mathematical optimization; Economics; Artificial intelligence; Demand management; Mathematics","score_opus":0.07416867346984374,"score_gpt":0.3071751928193707,"score_spread":0.23300651934952699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385492612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94683766,0.0003023595,0.014364185,0.0060083526,0.0004451556,0.005928246,0.000019801095,0.001204246,0.024890006],"genre_scores_gemma":[0.98857296,0.000014404612,0.00027994177,0.00016144548,0.0004881097,0.0006507645,0.00008983893,0.000041536146,0.009701033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860615,0.000079875026,0.00017405686,0.0003174485,0.00042061464,0.00040185332],"domain_scores_gemma":[0.99924594,0.000107624575,0.00002416665,0.00019660297,0.00039721307,0.000028467843],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016832643,0.00011345598,0.00015348518,0.0005796569,0.0013007831,0.0005959239,0.00015686813,0.000046985235,0.00004293049],"category_scores_gemma":[0.0002779648,0.00009937853,0.00003020242,0.0006314936,0.000113052934,0.00051656435,0.0001218045,0.00021521343,0.00024497448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011809617,0.000579784,0.10639805,0.006965403,0.0007943469,0.00016574856,0.0032962237,0.21452193,0.0040768543,0.51338536,0.13352491,0.015110404],"study_design_scores_gemma":[0.0023218142,0.00007239343,0.005338967,0.00013295669,0.00003104865,0.0000010147154,0.0052423705,0.829176,0.000017139346,0.00003295414,0.15743157,0.00020174506],"about_ca_topic_score_codex":0.0005276186,"about_ca_topic_score_gemma":0.000697708,"teacher_disagreement_score":0.6146541,"about_ca_system_score_codex":0.000084034946,"about_ca_system_score_gemma":0.000030740033,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W4387341621","doi":"10.1287/opre.2023.0017","title":"Learning and Optimization with Seasonal Patterns","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regret; Computer science; Exploit; Mathematical optimization; Horizon; Time horizon; Upper and lower bounds; Operations research; Artificial intelligence; Machine learning; Mathematics","score_opus":0.21259826416806105,"score_gpt":0.5232147028851709,"score_spread":0.31061643871710987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387341621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44585532,0.000082204366,0.54417425,0.0060290154,0.00007543716,0.0007991742,0.000040409323,0.00019486906,0.0027493343],"genre_scores_gemma":[0.9430463,0.00026063583,0.010957213,0.000015407255,0.00012961253,0.00015257532,0.00006521819,0.00002823539,0.045344826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514866,0.00066317164,0.0002192392,0.0005069264,0.0029803182,0.00048170993],"domain_scores_gemma":[0.9966159,0.0014437842,0.000013417453,0.00029490687,0.0014508952,0.00018111346],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0050200345,0.00008481279,0.00012386679,0.000876897,0.0012727631,0.0010339114,0.00035317338,0.00005141902,0.0012872046],"category_scores_gemma":[0.004362111,0.00005862987,0.000018207613,0.0035529984,0.0002446575,0.00058491,0.00033480054,0.0005316315,0.000802046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021342825,0.000017053075,0.010570079,0.000003385716,0.0000066756115,0.000028324072,0.00042325645,0.95978165,0.000119197175,0.00019120469,0.0007707302,0.02806713],"study_design_scores_gemma":[0.00029090975,0.00020586504,0.007749316,0.000012411572,8.7039245e-7,0.000012381116,0.0029591396,0.98255503,0.00014688492,0.00023696315,0.005739568,0.00009067238],"about_ca_topic_score_codex":0.000057052734,"about_ca_topic_score_gemma":0.00019268574,"teacher_disagreement_score":0.533217,"about_ca_system_score_codex":0.000052640396,"about_ca_system_score_gemma":0.00020650687,"threshold_uncertainty_score":0.9999759},"labels":[],"label_agreement":null},{"id":"W4387367127","doi":"10.1287/opre.2022.0014","title":"Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Estimator; Data acquisition; Differential privacy; Scheme (mathematics); Mechanism design; Population; Bayesian probability; Machine learning; Payment; Artificial intelligence; Data mining; Statistics; Mathematics; World Wide Web","score_opus":0.11198192145472374,"score_gpt":0.37374323426416456,"score_spread":0.2617613128094408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387367127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09323623,0.00008670064,0.8725369,0.03311788,0.00010424372,0.00027534013,0.00010369644,0.00042996742,0.00010901887],"genre_scores_gemma":[0.66173905,0.00044854428,0.3372315,0.000045185912,0.000041682993,0.00004113207,0.0002564857,0.000011801576,0.00018465341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789697,0.00017106785,0.00015775781,0.0006985251,0.00053942413,0.0005362276],"domain_scores_gemma":[0.9938883,0.00015000811,0.000008893079,0.005726848,0.000104253806,0.00012165719],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010982824,0.00009986891,0.000106132524,0.00028001884,0.0006502871,0.0009704178,0.012443983,0.00009034454,0.000026670114],"category_scores_gemma":[0.002695001,0.000091774076,0.000008624062,0.0009167324,0.0003212391,0.0011728891,0.13558623,0.0003376057,0.000059902475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002765528,0.00017388182,0.0003343179,0.00009145782,0.00009419995,0.00024121115,0.0004658895,0.0013410008,0.027717037,0.63284856,0.20297693,0.13368785],"study_design_scores_gemma":[0.00020153775,0.00006665153,0.0029568733,0.000017446531,0.0000018811947,0.00002010354,0.000059762424,0.95796347,0.0017092067,0.03614635,0.0007479833,0.000108763124],"about_ca_topic_score_codex":0.0000658303,"about_ca_topic_score_gemma":0.00006201978,"teacher_disagreement_score":0.9566224,"about_ca_system_score_codex":0.000037261845,"about_ca_system_score_gemma":0.0000991439,"threshold_uncertainty_score":0.9928992},"labels":[],"label_agreement":null},{"id":"W4387374621","doi":"10.1287/opre.2021.0588","title":"Provably Good Region Partitioning for On-Time Last-Mile Delivery","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; McMaster University; University of Toronto","funders":"Tsinghua University","keywords":"Computer science; Routing (electronic design automation); Mathematical optimization; Mile; Last mile (transportation); Operations research; Distributed computing; Mathematics; Computer network","score_opus":0.08310806673690824,"score_gpt":0.3398063811429819,"score_spread":0.25669831440607366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387374621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107539386,0.00013476648,0.8437794,0.0016293445,0.00060824194,0.0028700226,0.00015186491,0.0027800174,0.040506944],"genre_scores_gemma":[0.96298724,0.00019063462,0.014774826,0.000023359391,0.00025447083,0.00085139676,0.00049295544,0.000062455314,0.02036268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992403,0.000031319476,0.00011249354,0.00015458596,0.00017325062,0.00028808153],"domain_scores_gemma":[0.9994085,0.00018867519,0.0000036820172,0.00017752149,0.00017302534,0.000048618735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002622798,0.00006922407,0.000067828085,0.00021404587,0.00044991466,0.00010343729,0.000085574946,0.000051177576,0.00003066351],"category_scores_gemma":[0.00022173993,0.00007083243,0.000023081877,0.00036233207,0.000032822823,0.00013531158,0.000023389943,0.00015734632,0.0005263475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059625854,0.000011767965,0.000004054418,0.000020244477,0.000007337271,0.0000023012308,0.00007922994,0.98531526,0.0009923249,0.0026093125,0.009317373,0.0016348485],"study_design_scores_gemma":[0.00019379632,0.00009018756,0.000082245315,0.000027251686,0.000002402787,0.0000011524509,0.00006789065,0.97632235,0.006123109,0.0005785555,0.016412431,0.00009865197],"about_ca_topic_score_codex":0.000007630597,"about_ca_topic_score_gemma":0.000028841976,"teacher_disagreement_score":0.8554478,"about_ca_system_score_codex":0.00007384948,"about_ca_system_score_gemma":0.000030356383,"threshold_uncertainty_score":0.6765308},"labels":[],"label_agreement":null},{"id":"W4387407470","doi":"10.1287/opre.2021.0597","title":"A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Monte Carlo method; Randomness; Stochastic simulation; Artificial neural network; Domain (mathematical analysis); Poisson distribution; Stochastic modelling; Simulation; Probability distribution; Mathematical optimization; Artificial intelligence; Statistics; Mathematics","score_opus":0.07964050041132835,"score_gpt":0.38404957933413486,"score_spread":0.3044090789228065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387407470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7646714,0.000019047251,0.23354729,0.0005953119,0.000007786777,0.00060065003,0.0000020047837,0.000111864174,0.00044464302],"genre_scores_gemma":[0.9987788,0.0000027287115,0.0003397928,0.0000372224,0.00014137145,0.00023799021,0.00005919347,0.000021213422,0.00038166132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989688,0.000029624434,0.00016847684,0.00027669503,0.00030318275,0.00025324695],"domain_scores_gemma":[0.9991159,0.00021738197,0.000014093836,0.00023769983,0.00040008323,0.000014828289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009004612,0.00008379153,0.00011015264,0.00091636245,0.0005525525,0.00031645034,0.00012331294,0.00003498024,0.000038027956],"category_scores_gemma":[0.00035228743,0.0000727455,0.000013571099,0.0029812069,0.00006516276,0.00082809373,0.00011711069,0.00017757788,0.00017998872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017007806,0.000019458108,0.00026476337,0.000016788905,0.0000068666504,0.0000013348888,0.000075773525,0.9776573,0.00016969703,0.021403257,0.0000051759475,0.00036258643],"study_design_scores_gemma":[0.00023605286,0.000003914763,0.00013032061,0.000023141783,0.000008873817,1.2600182e-7,0.0005494205,0.9931273,0.0000032405258,0.005567134,0.00026190374,0.000088584486],"about_ca_topic_score_codex":0.00023033663,"about_ca_topic_score_gemma":0.0008049682,"teacher_disagreement_score":0.23410742,"about_ca_system_score_codex":0.000036938305,"about_ca_system_score_gemma":0.00003182372,"threshold_uncertainty_score":0.4249843},"labels":[],"label_agreement":null},{"id":"W4387455050","doi":"10.1287/opre.2022.0144","title":"Customer Scheduling in Large Service Systems Under Model Uncertainty","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Exploit; Scheduling (production processes); Adversary; Operations research; Service quality; Realm; Quality of service; Distributed computing; Industrial engineering; Service (business); Mathematical optimization; Computer security; Computer network; Engineering","score_opus":0.10526151367641799,"score_gpt":0.3837351266633641,"score_spread":0.2784736129869461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387455050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621984,0.00007104651,0.012980102,0.005043718,0.00013958086,0.00058004854,0.000010879457,0.00029874535,0.018677488],"genre_scores_gemma":[0.99452406,0.000014721434,0.00018925974,0.00043009667,0.0002655266,0.00015296902,0.00011348267,0.000029205634,0.004280704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983498,0.00007828094,0.00024027088,0.00031487813,0.00048946874,0.0005272916],"domain_scores_gemma":[0.99886113,0.00010355932,0.000018076857,0.0003575998,0.00064335036,0.000016285225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028735574,0.00010301526,0.00015012696,0.0011792653,0.0006456459,0.00050341996,0.00031725803,0.000067231456,0.00019096448],"category_scores_gemma":[0.00033459044,0.00009814604,0.000034450448,0.0053045475,0.00003598461,0.0010636721,0.00032006268,0.000365718,0.004337652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007871605,0.000031159805,0.00018847159,0.000052109153,0.000009933008,0.0000049696337,0.00007068853,0.8334261,0.0005907008,0.16528557,0.0002678142,0.00006461882],"study_design_scores_gemma":[0.00023399583,0.0000010648263,0.00011556008,0.000038491995,0.0000063109337,2.1663787e-7,0.0025539654,0.99153984,0.000007767855,0.0032910022,0.0020975901,0.00011418338],"about_ca_topic_score_codex":0.0019164343,"about_ca_topic_score_gemma":0.005353702,"teacher_disagreement_score":0.16199458,"about_ca_system_score_codex":0.000117635034,"about_ca_system_score_gemma":0.00007330552,"threshold_uncertainty_score":0.9964376},"labels":[],"label_agreement":null},{"id":"W4387495437","doi":"10.1287/opre.2020.0685","title":"Distributionally Robust Optimization Under Distorted Expectations","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Ambiguity; Cumulative prospect theory; Robust optimization; Distortion (music); Expected utility hypothesis; Computer science; Mathematical optimization; Risk aversion (psychology); Prospect theory; Class (philosophy); Optimal decision; Convex optimization; Subjective expected utility; Economics; Econometrics; Regular polygon; Mathematical economics; Microeconomics; Mathematics; Artificial intelligence","score_opus":0.4007544570497615,"score_gpt":0.5133885084234063,"score_spread":0.11263405137364485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387495437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037399102,0.00008186531,0.9363899,0.009530981,0.00040569555,0.00065392634,0.00019985254,0.00025467816,0.015084001],"genre_scores_gemma":[0.9458433,0.00033544793,0.011656899,0.00005582984,0.00022140586,0.000283184,0.002317121,0.000028430393,0.039258424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953891,0.00060856104,0.00058080285,0.00052205665,0.0024711762,0.00042827506],"domain_scores_gemma":[0.99572915,0.00090131693,0.000037189227,0.0006483548,0.0025096487,0.00017432084],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033337146,0.00011323573,0.00014935494,0.0011449332,0.0017709282,0.0009679023,0.00057779497,0.00010340931,0.0018436785],"category_scores_gemma":[0.004070227,0.000094397,0.00007555421,0.0077835754,0.000203026,0.0007648517,0.00015526477,0.00025123058,0.004011167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070600545,0.00004629738,0.0005619682,3.9125388e-7,0.000007380585,0.0000030695674,0.0003070805,0.9352306,0.00007931993,0.021034312,0.041413795,0.0013086965],"study_design_scores_gemma":[0.00021217085,0.000033129876,0.007318534,0.000004339642,0.0000036833037,0.000003287957,0.0028371527,0.9775846,0.00006575769,0.0024479271,0.009360823,0.00012860732],"about_ca_topic_score_codex":0.00010487094,"about_ca_topic_score_gemma":0.00030416535,"teacher_disagreement_score":0.924733,"about_ca_system_score_codex":0.00015057434,"about_ca_system_score_gemma":0.00043094208,"threshold_uncertainty_score":0.99952865},"labels":[],"label_agreement":null},{"id":"W4390051679","doi":"10.1287/opre.2021.0351","title":"Endogenous Credit, Business Cycle, and Portfolio Selection","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Business cycle; Economics; Profitability index; Portfolio; Monetary economics; Investment (military); Credit crunch; Financial economics; Finance; Macroeconomics","score_opus":0.15681517692127947,"score_gpt":0.3184605202046245,"score_spread":0.16164534328334504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390051679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9175782,0.00048237297,0.001389781,0.0015732321,0.0002821108,0.0003261038,0.00012502758,0.00008948628,0.07815364],"genre_scores_gemma":[0.98603153,0.0011344291,0.00026657202,0.000032797696,0.00022568683,0.0000952832,0.000049513383,0.000020780346,0.012143419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990314,0.000023767665,0.0002658342,0.0003118185,0.0000365664,0.00033056183],"domain_scores_gemma":[0.9995305,0.00005323913,0.000018536766,0.00019269618,0.00012840108,0.000076610886],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011985167,0.00007007701,0.00014931372,0.000476087,0.0005560071,0.0002262535,0.000119626166,0.0000652133,0.0005913842],"category_scores_gemma":[0.00018016787,0.00008219787,0.000022760221,0.0008833323,0.00008473724,0.0002796352,0.000100132616,0.00015614215,0.001421855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009937903,0.000040779054,0.003482578,0.000017035374,0.000027523842,0.0000061748765,0.0005365602,0.010492058,0.00050942425,0.97743183,0.005890017,0.0015560887],"study_design_scores_gemma":[0.001696914,0.0002733023,0.067676686,0.000029738552,0.000007623008,0.0001236169,0.0013035447,0.35347217,0.00095952576,0.2285804,0.34498516,0.00089132966],"about_ca_topic_score_codex":0.0015705687,"about_ca_topic_score_gemma":0.00030076125,"teacher_disagreement_score":0.7488514,"about_ca_system_score_codex":0.000068717716,"about_ca_system_score_gemma":0.000054279044,"threshold_uncertainty_score":0.9993557},"labels":[],"label_agreement":null},{"id":"W4390669281","doi":"10.1287/opre.2021.0419","title":"A Dynamic Model for Managing Volunteer Engagement","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Nonprofit Sector and Volunteering","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Volunteer; Profit (economics); Business; Public relations; Economics; Microeconomics; Political science","score_opus":0.1934165152439167,"score_gpt":0.5074663113088873,"score_spread":0.31404979606497063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390669281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13921218,0.0015788923,0.719413,0.0171348,0.00088501204,0.0026227671,0.00006150375,0.00042874354,0.11866314],"genre_scores_gemma":[0.9120169,0.00012323371,0.0057717767,0.000025547515,0.00013143303,0.00039414957,0.000010332263,0.000016728529,0.08150989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986943,0.0001494173,0.00010223736,0.00022960031,0.00042959923,0.00039485536],"domain_scores_gemma":[0.9994175,0.00016650476,0.0000018003801,0.0001365736,0.00020505258,0.00007257894],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029583927,0.000051849624,0.00005505645,0.00022683856,0.0016071107,0.00064710045,0.00020102339,0.00004096388,0.00023209423],"category_scores_gemma":[0.00022017874,0.000050132625,0.00004546919,0.00044468313,0.00010707073,0.00028213084,0.000061448576,0.00024662755,0.00012242886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010397583,0.000048389764,0.00012978187,0.0001270773,0.000043141255,0.0000068788017,0.057280574,0.03763477,0.005258418,0.8726608,0.008468704,0.018331032],"study_design_scores_gemma":[0.00004812432,0.000014112152,0.000032186963,0.000030438041,0.0000032108373,1.4857022e-7,0.002686967,0.95540833,0.000027219197,0.0029971264,0.038690314,0.00006179911],"about_ca_topic_score_codex":0.0020284597,"about_ca_topic_score_gemma":0.014807066,"teacher_disagreement_score":0.9177736,"about_ca_system_score_codex":0.00029855812,"about_ca_system_score_gemma":0.00044301827,"threshold_uncertainty_score":0.9996927},"labels":[],"label_agreement":null},{"id":"W4392908164","doi":"10.1287/opre.2021.0141","title":"A Mutual Catastrophe Insurance Framework for Horizontal Collaboration in Prepositioning Strategic Reserves","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preparedness; Portfolio; Actuarial science; Business; Finance; Disaster preparedness; Scale (ratio); Emergency management; Economics; Geography; Economic growth","score_opus":0.10490586332465321,"score_gpt":0.37957132126477705,"score_spread":0.27466545794012387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392908164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.952704,0.0036465775,0.029207654,0.0018946076,0.0005110658,0.0012093547,0.0006650031,0.00004715571,0.010114572],"genre_scores_gemma":[0.9894792,0.00030540963,0.0078094294,0.000015901842,0.00025717405,0.00085583696,0.00012963652,0.000021858028,0.0011255449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986254,0.000045487224,0.00043664925,0.00043720682,0.000094815296,0.0003604607],"domain_scores_gemma":[0.9994351,0.00011831051,0.000019995969,0.00025093288,0.00013557027,0.000040045416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013550702,0.000094309835,0.00016779958,0.0005099946,0.00040867462,0.0008452305,0.0001907679,0.00010134273,0.00007668358],"category_scores_gemma":[0.0002716571,0.00010915468,0.00004759186,0.0013629289,0.000065465065,0.0006149268,0.000048126807,0.00035031608,0.00034022395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033887154,0.00006484755,0.003556476,0.00006436723,0.000013203918,0.000011167601,0.0011455137,0.0030515352,0.0000966345,0.9907892,0.0004758222,0.00069734966],"study_design_scores_gemma":[0.0014183081,0.0013678719,0.04749004,0.0007635081,0.0000067688743,0.000007503044,0.0056384825,0.2753289,0.0009086277,0.6069816,0.059179492,0.00090890063],"about_ca_topic_score_codex":0.0007507498,"about_ca_topic_score_gemma":0.0020890674,"teacher_disagreement_score":0.3838076,"about_ca_system_score_codex":0.00025646688,"about_ca_system_score_gemma":0.00014168302,"threshold_uncertainty_score":0.8150577},"labels":[],"label_agreement":null},{"id":"W4393042404","doi":"10.1287/opre.2022.0505","title":"Technical Note—An Unexpected Stochastic Dominance: Pareto Distributions, Dependence, and Diversification","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stochastic dominance; Diversification (marketing strategy); Pareto principle; Dominance (genetics); Economics; Econometrics; Mathematical economics; Mathematical optimization; Mathematics; Business; Biology; Marketing","score_opus":0.09976887181884544,"score_gpt":0.3629849148811493,"score_spread":0.26321604306230384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393042404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22823368,0.0034803401,0.7649714,0.0011141575,0.00016522648,0.0004250627,0.00042496595,0.00009297086,0.001092252],"genre_scores_gemma":[0.9948249,0.00031359852,0.003991652,0.0000069749,0.000099188816,0.00011981706,0.00014861661,0.000012811512,0.0004824494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987311,0.000045239143,0.000338004,0.00050485774,0.0000995794,0.0002812426],"domain_scores_gemma":[0.9993149,0.00010895424,0.000013199201,0.00031749468,0.00014732708,0.00009809315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011768129,0.000089701214,0.00015119341,0.00032331375,0.0006876572,0.0004336018,0.00018087258,0.00012549188,0.00009857947],"category_scores_gemma":[0.00060238084,0.00009886447,0.000035081568,0.00073278265,0.00016111591,0.0005389914,0.000093999566,0.00041248926,0.00033404437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001783853,0.00009203179,0.00082720554,0.000024792831,0.0000045438424,0.0000045859424,0.00058901345,0.0018324178,0.0012121169,0.98692083,0.000400302,0.008074306],"study_design_scores_gemma":[0.00015723823,0.00009049979,0.010444674,0.000041370728,0.0000041048593,0.0000061737846,0.00015355303,0.96377486,0.00007886749,0.020659,0.004415513,0.00017414254],"about_ca_topic_score_codex":0.0009131718,"about_ca_topic_score_gemma":0.00068467204,"teacher_disagreement_score":0.96626186,"about_ca_system_score_codex":0.00019717855,"about_ca_system_score_gemma":0.00010962805,"threshold_uncertainty_score":0.5288973},"labels":[],"label_agreement":null},{"id":"W4393259060","doi":"10.1287/opre.2020.0651","title":"Optimal Auction Design with Deferred Inspection and Reward","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Operations research; Microeconomics; Business; Economics; Mathematics","score_opus":0.4224387914570869,"score_gpt":0.5356215625411274,"score_spread":0.11318277108404046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393259060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17303154,0.0002504021,0.8173489,0.0045004324,0.0001293874,0.00050385273,0.000009091974,0.00018157653,0.0040448243],"genre_scores_gemma":[0.97496015,0.00005039638,0.010534692,0.000015731233,0.00015221736,0.00021453014,0.0000059839363,0.0000116068895,0.014054716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773425,0.00051445345,0.00022912609,0.00046893524,0.000866659,0.00018660341],"domain_scores_gemma":[0.9983255,0.0006903136,0.0000091359,0.00034835647,0.00052814354,0.00009850123],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043311412,0.00007368399,0.000089265704,0.0005488928,0.0012254294,0.0013931609,0.00019201766,0.000056541754,0.00044030603],"category_scores_gemma":[0.00060873176,0.000050258725,0.000022685295,0.002096431,0.00032634183,0.00069308514,0.000060874678,0.0003093179,0.0009720471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028914813,0.0001993941,0.00020498545,0.000016765254,0.0000767406,0.000032450953,0.0056384434,0.35704267,0.012728637,0.4749842,0.054165322,0.09462125],"study_design_scores_gemma":[0.0004901329,0.00080903806,0.0021940998,0.000077064506,0.000025595144,0.00054026215,0.010540117,0.7527468,0.010104477,0.046823144,0.17523338,0.000415859],"about_ca_topic_score_codex":0.000043770688,"about_ca_topic_score_gemma":0.00006940806,"teacher_disagreement_score":0.8068142,"about_ca_system_score_codex":0.0000645701,"about_ca_system_score_gemma":0.00019344345,"threshold_uncertainty_score":0.9998058},"labels":[],"label_agreement":null},{"id":"W4396216928","doi":"10.1287/opre.2022.0275","title":"Market Entry and Competition Under Network Effects","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competition (biology); Industrial organization; Business; Market competition; Computer science; Microeconomics; Economics; Market economy","score_opus":0.032763820532815215,"score_gpt":0.2882353388592316,"score_spread":0.25547151832641635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396216928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64948964,0.0003662037,0.0004875508,0.0011724468,0.00033307265,0.0002427512,0.0000015716763,0.000067998946,0.3478388],"genre_scores_gemma":[0.99282676,0.000059244485,0.00008944552,0.00032214602,0.0010324141,0.000026844456,0.000043415097,0.000011893833,0.0055878498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994612,0.0000026615864,0.00008192717,0.00015091218,0.000102903694,0.00020040154],"domain_scores_gemma":[0.9997659,0.000081215854,0.0000030654473,0.00008546974,0.000053360094,0.000011000839],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046359547,0.00005276,0.000055433473,0.00013390169,0.00029198977,0.0037379775,0.00006004831,0.00003064258,0.00049459975],"category_scores_gemma":[0.0000336774,0.000045714656,0.000016662869,0.00027848146,0.00004706909,0.0024880478,0.000120970435,0.00012918019,0.0008434603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059308186,0.000015974778,0.00024330005,0.00014574567,0.00001368686,0.000006660564,0.000008096709,0.0019640566,0.000044143573,0.958731,0.031770606,0.0070508],"study_design_scores_gemma":[0.00032009336,0.000026046882,0.008467711,0.00028745478,0.000014556732,0.000006633141,0.00041716502,0.51977885,0.000018141134,0.14556737,0.32483092,0.00026504268],"about_ca_topic_score_codex":0.0001578433,"about_ca_topic_score_gemma":0.0003806461,"teacher_disagreement_score":0.81316364,"about_ca_system_score_codex":0.000023546307,"about_ca_system_score_gemma":0.000019783445,"threshold_uncertainty_score":0.9999345},"labels":[],"label_agreement":null},{"id":"W4396713284","doi":"10.1287/opre.2024.0994","title":"Inventory Allocation Under the Greedy Fulfillment Policy: The (Potential) Perils of the Hindsight Approach","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Financial Reporting and Valuation Research","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Hindsight bias; Greedy algorithm; Operations research; Computer science; Economics; Mathematical optimization; Mathematics; Psychology; Cognitive psychology","score_opus":0.1230426602786143,"score_gpt":0.3823572378190235,"score_spread":0.2593145775404092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396713284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71021694,0.001626822,0.0052250084,0.19621322,0.0011126339,0.0033409565,0.00000844016,0.00012536881,0.08213062],"genre_scores_gemma":[0.9848463,0.000037301616,0.000029527517,0.00037609434,0.0011482425,0.00029069697,0.000020252077,0.00002011721,0.013231485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730515,0.00024194302,0.0003480232,0.00026651286,0.001504923,0.0003334288],"domain_scores_gemma":[0.9983325,0.00011442044,0.00004279337,0.00063815207,0.0008585033,0.000013612501],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005612265,0.0001011916,0.00009131742,0.00031851037,0.0017169265,0.0011781781,0.00071024644,0.000061042636,0.00020418201],"category_scores_gemma":[0.00089530344,0.000046732603,0.00010866582,0.0022619807,0.0004172373,0.0003859121,0.0004364079,0.0005375076,0.00017813397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017489689,0.00019490141,0.00066473766,0.00021544674,0.000090837464,0.0000023338214,0.0011674643,0.042122357,0.008194546,0.89966035,0.035672836,0.011996681],"study_design_scores_gemma":[0.00023616522,0.000024051782,0.024870023,0.00011472792,0.000047320107,0.000008247681,0.004711334,0.7921545,0.0007043223,0.00887031,0.16806951,0.00018948132],"about_ca_topic_score_codex":0.0049722046,"about_ca_topic_score_gemma":0.000584282,"teacher_disagreement_score":0.89079005,"about_ca_system_score_codex":0.00012475206,"about_ca_system_score_gemma":0.0007362087,"threshold_uncertainty_score":0.9998587},"labels":[],"label_agreement":null},{"id":"W4399391125","doi":"10.1287/opre.2021.0062","title":"Dynamic Relocations in Car-Sharing Networks","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Windsor","funders":"","keywords":"Computer science; Car sharing; Operations research; Computer network; Transport engineering; Mathematics; Engineering","score_opus":0.043911093766056744,"score_gpt":0.3757931439051127,"score_spread":0.331882050139056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399391125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7762242,0.0024798175,0.18402092,0.0030878684,0.0009313809,0.0011090005,0.000060354163,0.0012026012,0.030883858],"genre_scores_gemma":[0.9964779,0.00020463773,0.00080775353,0.000011463153,0.00002841535,0.00028248923,0.00015650233,0.000022791372,0.0020080225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991844,0.000021435613,0.00021978385,0.0001748097,0.00016566453,0.00023385766],"domain_scores_gemma":[0.9995503,0.000058582205,9.635946e-7,0.00022782564,0.0001207558,0.000041613253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045806484,0.00006295387,0.00005864551,0.0005079817,0.00015265813,0.00020593702,0.00012643787,0.00006066859,0.00021451422],"category_scores_gemma":[0.000030934698,0.000068107765,0.000020491458,0.00192304,0.000043019187,0.00023333805,0.000011995956,0.0004957886,0.00015943935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.78656e-7,0.000015413127,0.0002517248,0.000027806866,0.000010292195,0.000005775885,0.0005510338,0.9630116,0.0013870357,0.031423718,0.0009209917,0.002394099],"study_design_scores_gemma":[0.000053756336,0.0000054876837,0.0072848164,0.00004633309,0.0000018513797,0.0000016449015,0.00020085338,0.9863718,0.000055888002,0.00013432694,0.0057737203,0.00006952728],"about_ca_topic_score_codex":0.00016174048,"about_ca_topic_score_gemma":0.0069735968,"teacher_disagreement_score":0.22025372,"about_ca_system_score_codex":0.00018008777,"about_ca_system_score_gemma":0.00008042057,"threshold_uncertainty_score":0.38914305},"labels":[],"label_agreement":null},{"id":"W4400684999","doi":"10.1287/opre.2023.0569","title":"Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Operations research; Stage (stratigraphy); Mathematics; Computer network; Geology","score_opus":0.06734017771732487,"score_gpt":0.37508820165387585,"score_spread":0.307748023936551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400684999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082727194,0.0002531939,0.91463906,0.00014808758,0.00012084279,0.00095084397,0.00003127239,0.00027433387,0.00085518404],"genre_scores_gemma":[0.9115941,0.000005351127,0.08624484,0.0000036435724,0.0000846099,0.00026702386,0.000021402535,0.00007282716,0.001706199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855787,0.00012197381,0.00029287464,0.0002556448,0.00037433047,0.00039733812],"domain_scores_gemma":[0.99879277,0.00042918924,0.000009028441,0.0002560908,0.0004421,0.0000708173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017671208,0.00012178635,0.00017159944,0.00031865528,0.00030476486,0.0003223331,0.00018107143,0.000054745087,0.00003790584],"category_scores_gemma":[0.0003482333,0.00010717114,0.000036377263,0.0010320325,0.00007501848,0.00029427584,0.00005011325,0.0003362161,0.000014171841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006061767,0.000016496406,0.0000551466,0.00033077138,0.000040500876,0.0000011389363,0.0014976981,0.9646433,0.027562799,0.003623488,0.000060680955,0.0021619264],"study_design_scores_gemma":[0.00030276482,0.00007505472,0.00002898945,0.0003479152,0.000010991028,0.0000031729578,0.0003692647,0.989967,0.008550615,0.000019345609,0.00019991709,0.00012497061],"about_ca_topic_score_codex":0.000114394774,"about_ca_topic_score_gemma":0.00012912932,"teacher_disagreement_score":0.8288669,"about_ca_system_score_codex":0.00013470574,"about_ca_system_score_gemma":0.00018123677,"threshold_uncertainty_score":0.4370312},"labels":[],"label_agreement":null},{"id":"W4401369571","doi":"10.1287/opre.2022.0066","title":"Dynamic Control of Service Systems with Returns: Application to Design of Postdischarge Hospital Readmission Prevention Programs","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Psychological intervention; Queueing theory; Computer science; Control (management); Service (business); Operations management; Phone; Business; Operations research; Medicine; Economics; Computer network; Engineering; Nursing; Marketing","score_opus":0.02800667053225977,"score_gpt":0.3353523130211625,"score_spread":0.3073456424889027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401369571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15285704,0.00028993198,0.84068865,0.0025185652,0.00005883894,0.0030714131,0.0000096025815,0.000101251586,0.00040470334],"genre_scores_gemma":[0.99657536,0.0000060066855,0.0021073096,0.000019911797,0.0000706222,0.00047478697,0.000102881786,0.000024765977,0.00061837974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870014,0.00009349103,0.00028451378,0.00028037836,0.00045737767,0.00018408087],"domain_scores_gemma":[0.9984218,0.000069456386,0.00004721775,0.0003227458,0.0011200936,0.00001871874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014559927,0.000093297975,0.00016479373,0.0004585975,0.00016135442,0.00023544942,0.00021270124,0.000047011545,0.000030237454],"category_scores_gemma":[0.0001429569,0.00007239453,0.000033607805,0.0020206156,0.00004203371,0.00075832003,0.00006152195,0.00013846571,0.00008708523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051089644,0.000715952,0.00041358607,0.0023844936,0.00029217338,0.0000073570773,0.0007455765,0.6984659,0.16225415,0.11803613,0.0002042892,0.015969498],"study_design_scores_gemma":[0.00020507367,0.00015203007,0.000064373926,0.00058435294,0.00005987278,8.684689e-7,0.000747229,0.9961469,0.0004082511,0.0008718675,0.0006555443,0.00010360666],"about_ca_topic_score_codex":0.000472525,"about_ca_topic_score_gemma":0.00019773805,"teacher_disagreement_score":0.8437183,"about_ca_system_score_codex":0.000056879722,"about_ca_system_score_gemma":0.00007781216,"threshold_uncertainty_score":0.29521632},"labels":[],"label_agreement":null},{"id":"W4404578066","doi":"10.1287/opre.2024.0754","title":"Feature-Driven Priority Queuing","year":2024,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Feature (linguistics); Computer science; Queueing theory; Artificial intelligence; Computer network","score_opus":0.09063229164852378,"score_gpt":0.41722252697131945,"score_spread":0.3265902353227957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404578066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1751126,0.011716249,0.4520092,0.12911662,0.014367916,0.01056178,0.00014792202,0.0028679776,0.20409973],"genre_scores_gemma":[0.76483965,0.00013408679,0.21338406,0.00003887754,0.001222816,0.0006344983,0.0000780667,0.00006200073,0.019605929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952332,0.0009300443,0.00034375075,0.0013134104,0.0014944262,0.00068520964],"domain_scores_gemma":[0.9963229,0.00021482253,0.000027844986,0.0022218756,0.0009883471,0.00022423283],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032761872,0.00026858595,0.00033818863,0.0007795387,0.00065770175,0.005803164,0.0027543122,0.00044598186,0.00004714958],"category_scores_gemma":[0.00045830949,0.00024781429,0.0001568649,0.0011786114,0.00010752313,0.00041442734,0.008860954,0.0040580686,0.0016761778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008295284,0.00024092634,0.00023102365,0.001893942,0.00039258995,0.0005940954,0.010785415,0.25833583,0.025709182,0.5910538,0.084781036,0.025973892],"study_design_scores_gemma":[0.000085380765,0.00003594811,0.0001525837,0.00062718627,0.0000070740225,0.00003337283,0.0001018376,0.98430794,0.0012779459,0.004409424,0.008618534,0.00034279065],"about_ca_topic_score_codex":0.0014799301,"about_ca_topic_score_gemma":0.0006597569,"teacher_disagreement_score":0.7259721,"about_ca_system_score_codex":0.0005229618,"about_ca_system_score_gemma":0.0022448609,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W4404694489","doi":"10.1287/opre.2022.0024","title":"Revenue Maximization Under Unknown Private Values with Nonobligatory Inspection","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Revenue; Maximization; Business; Revenue management; Computer science; Operations research; Actuarial science; Economics; Finance; Microeconomics; Mathematics","score_opus":0.25033589539550566,"score_gpt":0.51488721092301,"score_spread":0.2645513155275044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404694489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41549984,0.0004186818,0.5477256,0.0141408285,0.00045671992,0.0009616176,0.00006300748,0.00037694504,0.020356728],"genre_scores_gemma":[0.95290405,0.000071147515,0.0021171311,0.00006943702,0.00026494145,0.0002081422,0.000025047657,0.000020524312,0.04431961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971382,0.0005439444,0.00032875084,0.0005301438,0.0012281397,0.00023080614],"domain_scores_gemma":[0.9979659,0.00052783743,0.000018098199,0.0006161745,0.00076634745,0.000105687475],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039998004,0.00009416525,0.000104668135,0.0006789187,0.001348642,0.001295426,0.00039118293,0.00007272134,0.0007973348],"category_scores_gemma":[0.0006276369,0.00006660177,0.000041888063,0.0034764356,0.00035967253,0.00082897226,0.000089429894,0.00038719887,0.002855526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002121628,0.00007883574,0.00017871505,0.0000072607845,0.000021785945,0.000004401962,0.00080909976,0.046100546,0.0031596923,0.91839755,0.021537418,0.009683494],"study_design_scores_gemma":[0.00034344138,0.00025597605,0.004867746,0.00012647528,0.000020940855,0.000070142596,0.0026312517,0.16144393,0.01099578,0.35712883,0.46173048,0.00038502243],"about_ca_topic_score_codex":0.000047382182,"about_ca_topic_score_gemma":0.00023454354,"teacher_disagreement_score":0.56126875,"about_ca_system_score_codex":0.0001318752,"about_ca_system_score_gemma":0.00031741132,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W4405706555","doi":"10.1287/opre.2023.0299","title":"Risk Budgeting Allocation for Dynamic Risk Measures","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Risk management; Actuarial science; Economics; Econometrics; Finance","score_opus":0.19552886579973786,"score_gpt":0.5204258886954735,"score_spread":0.32489702289573563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405706555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13931473,0.0020547437,0.84734756,0.0031138433,0.00066882756,0.0012002632,0.0002193043,0.0001341357,0.0059466194],"genre_scores_gemma":[0.964162,0.004415122,0.015833335,0.0000149375155,0.0001999143,0.0002750459,0.0000801438,0.00002435218,0.014995179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602026,0.0009284069,0.0005059503,0.00056831486,0.0016381067,0.00033893582],"domain_scores_gemma":[0.9951019,0.0023495432,0.000033168555,0.0005349202,0.0018758572,0.00010457689],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015870033,0.00009997766,0.00013104893,0.0008453644,0.0015106974,0.002166831,0.00047397372,0.00009556785,0.00018812527],"category_scores_gemma":[0.014035603,0.00007426285,0.00009962533,0.002064247,0.000109548135,0.00062537944,0.000075755896,0.00039724534,0.0009769375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002467238,0.00004348169,0.0018575101,0.000004452615,0.000032049244,0.0000019095971,0.001547852,0.3084355,0.0010313047,0.008112275,0.029168703,0.6497403],"study_design_scores_gemma":[0.000102278056,0.0000608763,0.0015531183,0.000011523995,0.0000112043,0.0000019937058,0.00058214675,0.85534126,0.00036281117,0.008715614,0.13316956,0.00008762485],"about_ca_topic_score_codex":0.00053067855,"about_ca_topic_score_gemma":0.0011958185,"teacher_disagreement_score":0.8315142,"about_ca_system_score_codex":0.00010369428,"about_ca_system_score_gemma":0.00038671226,"threshold_uncertainty_score":0.9998009},"labels":[],"label_agreement":null},{"id":"W4406033644","doi":"10.1287/opre.2021.0445","title":"Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback","year":2025,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regret; Monotone polygon; Computer science; Mathematical optimization; Online learning; Mathematical economics; Operations research; Mathematics; Multimedia; Machine learning","score_opus":0.13094003215085015,"score_gpt":0.4967886970957619,"score_spread":0.36584866494491175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406033644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91012293,0.00044719214,0.06828206,0.0066633765,0.00017546405,0.0016500375,0.00007939858,0.00009507373,0.0124844685],"genre_scores_gemma":[0.81883943,0.00010665399,0.01594081,0.00002873793,0.00015425742,0.0002399601,0.00007421832,0.00002960339,0.1645863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927244,0.0010853088,0.0007218516,0.0010152342,0.0034394325,0.0010137522],"domain_scores_gemma":[0.99380004,0.0020047375,0.00003740195,0.0009623161,0.0029828472,0.00021267991],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0056183697,0.00022310179,0.0004107132,0.0022192777,0.0009160912,0.0012450446,0.001413979,0.00014473584,0.0017187184],"category_scores_gemma":[0.0073364717,0.00015983664,0.00006585428,0.0057356814,0.00065440574,0.0010027295,0.0006266047,0.0019077084,0.0012087555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043190506,0.00036460036,0.008941095,0.000009515364,0.000030564035,0.00007209141,0.00048474423,0.953804,0.0008446257,0.00069471454,0.004533287,0.02978885],"study_design_scores_gemma":[0.0033351018,0.000913176,0.041373443,0.0001698528,0.0000050692133,0.000011995296,0.0063447854,0.88103634,0.0016140523,0.00045029007,0.06435054,0.0003953791],"about_ca_topic_score_codex":0.00059353234,"about_ca_topic_score_gemma":0.004296392,"teacher_disagreement_score":0.15210183,"about_ca_system_score_codex":0.00035317318,"about_ca_system_score_gemma":0.0011925889,"threshold_uncertainty_score":0.99979174},"labels":[],"label_agreement":null},{"id":"W4410590271","doi":"10.1287/opre.2021.0427","title":"Event-Triggered Bayesian Control Chart","year":2025,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control chart; Computer science; Event (particle physics); Bayesian probability; Chart; Operations research; Econometrics; Data mining; Statistics; Artificial intelligence; Mathematics; Process (computing)","score_opus":0.22923376447147034,"score_gpt":0.5923399555795753,"score_spread":0.36310619110810494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038520177,0.00022396413,0.9597728,0.007822795,0.00033992965,0.00047188,0.000038763585,0.00003782271,0.027440026],"genre_scores_gemma":[0.949126,0.000008909243,0.0047783926,0.00013805348,0.00010984486,0.00014555355,0.0000034513973,0.0000074224754,0.045682393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618673,0.00058628555,0.0005104126,0.00050210557,0.0017723046,0.00044214595],"domain_scores_gemma":[0.99449074,0.0029618142,0.000015814881,0.0006394596,0.0017453773,0.00014678594],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0042857653,0.0000910724,0.00019776929,0.0006178703,0.0010660582,0.00070260034,0.0007945173,0.00006512412,0.0009081497],"category_scores_gemma":[0.021152696,0.000070696144,0.000046346482,0.0023315789,0.00021937367,0.00041368697,0.00015576748,0.0004306369,0.0011031629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015701738,0.0003313369,0.005782467,0.000022801494,0.000059452806,0.000044157674,0.0005391654,0.036786053,0.012380283,0.53018135,0.05599329,0.3577226],"study_design_scores_gemma":[0.0021234697,0.00017583289,0.00839084,0.00009225081,0.000012049559,0.00000369852,0.0024152563,0.5235468,0.006263912,0.362747,0.09384838,0.00038047487],"about_ca_topic_score_codex":0.000061571016,"about_ca_topic_score_gemma":0.00016614837,"teacher_disagreement_score":0.9549944,"about_ca_system_score_codex":0.00011836735,"about_ca_system_score_gemma":0.0004196754,"threshold_uncertainty_score":0.9996746},"labels":[],"label_agreement":null},{"id":"W4410614719","doi":"10.1287/opre.2023.0123","title":"Dynamic Pricing with Fairness Constraints","year":2025,"lang":"en","type":"article","venue":"Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Dynamic pricing; Mathematical optimization; Operations research; Microeconomics; Mathematical economics; Economics; Mathematics","score_opus":0.038161468237825395,"score_gpt":0.34962099377329997,"score_spread":0.31145952553547457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410614719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72418135,0.00008873848,0.011872209,0.0032688426,0.00017928964,0.00068422843,0.0000024971466,0.00012413203,0.25959873],"genre_scores_gemma":[0.99295664,0.0000064040228,0.00043854152,0.00020858506,0.000044103366,0.00007754846,0.000021669035,0.000011911385,0.0062345895],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99892414,0.000032738983,0.00015290329,0.0002545379,0.0003167865,0.0003189174],"domain_scores_gemma":[0.99907696,0.00009012483,0.000010593527,0.00026964693,0.00054248166,0.000010180097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085707114,0.00009519156,0.000108987384,0.0006553902,0.0008184344,0.0007817922,0.00023190404,0.000041016552,0.0007520682],"category_scores_gemma":[0.00015836129,0.00007899451,0.000023251217,0.0015767918,0.0002228725,0.00058519444,0.00017916382,0.00029483295,0.0002008295],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020733225,0.00049675547,0.20017686,0.0006088722,0.00015573094,0.00011701605,0.0003786324,0.0029782283,0.015113755,0.26648346,0.005777769,0.5075056],"study_design_scores_gemma":[0.004892963,0.00007161431,0.51250815,0.0014762796,0.00028189208,0.00002692541,0.009226993,0.3130325,0.00096634397,0.0029025723,0.15304717,0.0015665805],"about_ca_topic_score_codex":0.0010772863,"about_ca_topic_score_gemma":0.0029391143,"teacher_disagreement_score":0.505939,"about_ca_system_score_codex":0.000048915295,"about_ca_system_score_gemma":0.00015952106,"threshold_uncertainty_score":0.82346195},"labels":[],"label_agreement":null},{"id":"W4412203834","doi":"10.1287/opre.2023.0453","title":"E-Commerce Order Fulfillment Problem with Limited Time Window","year":2025,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Window (computing); Order (exchange); Computer science; Mathematical optimization; Operations research; Mathematics; Business; World Wide Web","score_opus":0.020113699951659764,"score_gpt":0.30287106265636365,"score_spread":0.28275736270470386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412203834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010392736,0.00015834933,0.8499329,0.0016602499,0.00006832411,0.00087534543,0.000014994981,0.00041598835,0.13648109],"genre_scores_gemma":[0.80260074,0.00016550408,0.14727838,0.00008574938,0.00005531379,0.00034589192,0.00018133824,0.00004629957,0.049240764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992486,0.00004433785,0.00011617525,0.0001519439,0.00019339059,0.0002455057],"domain_scores_gemma":[0.99934995,0.00007139799,0.0000027807544,0.00024614175,0.00028629194,0.000043412812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018734683,0.00008654859,0.00008370315,0.00022287406,0.00028787146,0.0001184465,0.000121170684,0.000048314687,0.00015392464],"category_scores_gemma":[0.000061045255,0.00007299925,0.000009600203,0.0006454394,0.00005793846,0.000111859605,0.000038943075,0.00026183706,0.00013366473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007967132,0.000027831204,0.0000167946,0.000021569364,0.000022491286,0.0000014650287,0.00007582317,0.9913298,0.0009114163,0.0026960196,0.0026232025,0.0022656233],"study_design_scores_gemma":[0.0006142599,0.000098523386,0.00043351203,0.00008757989,0.000011005392,0.0000025575816,0.00011612271,0.9573055,0.009963289,0.00036357943,0.030787518,0.00021658119],"about_ca_topic_score_codex":0.000027362757,"about_ca_topic_score_gemma":0.000061390936,"teacher_disagreement_score":0.792208,"about_ca_system_score_codex":0.00010515091,"about_ca_system_score_gemma":0.00006373129,"threshold_uncertainty_score":0.29768232},"labels":[],"label_agreement":null},{"id":"W4412448250","doi":"10.1287/opre.2021.0417","title":"Performance of the Offer-Everything Policy","year":2025,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Operations research; Mathematics","score_opus":0.05541690913381681,"score_gpt":0.33919947392709204,"score_spread":0.28378256479327524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412448250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67607147,0.000028443204,0.000040482264,0.011211599,0.00021409112,0.0003401417,7.1333636e-7,0.000019419998,0.31207365],"genre_scores_gemma":[0.96861494,0.000015548268,0.00003784038,0.0011379913,0.00029306518,0.000044078406,0.0000038851713,0.0000057996663,0.029846862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991266,0.00003078141,0.00015515529,0.00013078128,0.00035136545,0.00020527506],"domain_scores_gemma":[0.99930304,0.000026876674,0.000013625345,0.0003556925,0.0002963368,0.0000044038948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080782385,0.00005719815,0.000069213726,0.0005173916,0.00064171513,0.00021792763,0.0004436953,0.000026396492,0.00024449616],"category_scores_gemma":[0.000292818,0.000040557064,0.0000398661,0.0017508668,0.00012129103,0.00047357162,0.0005153551,0.00016565582,0.00012772996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021101141,0.00014891247,0.03707145,0.00039283567,0.00004035549,5.9034784e-7,0.00016018032,0.0073047327,0.0028526527,0.87806743,0.062436745,0.011502991],"study_design_scores_gemma":[0.00060111715,0.000017756163,0.07077438,0.00027058207,0.000018780313,2.9293827e-7,0.0010617711,0.3055772,0.0023996818,0.0016480405,0.6174556,0.00017483489],"about_ca_topic_score_codex":0.0015342247,"about_ca_topic_score_gemma":0.0002148471,"teacher_disagreement_score":0.8764194,"about_ca_system_score_codex":0.000060874798,"about_ca_system_score_gemma":0.00011816684,"threshold_uncertainty_score":0.4935619},"labels":[],"label_agreement":null},{"id":"W4415051132","doi":"10.1287/opre.2022.0268","title":"Dynamic Pricing for a Multiproduct Consumer Electronics Trade-in Program","year":2025,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dynamic pricing; Profitability index; Profit (economics); Pricing strategies; Electronics; Boosting (machine learning); Product (mathematics)","score_opus":0.051938023499839225,"score_gpt":0.3855987455584361,"score_spread":0.33366072205859687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415051132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72114235,0.0042650946,0.011752684,0.09033327,0.0017254718,0.027543206,0.000015199025,0.00083638215,0.14238636],"genre_scores_gemma":[0.98744416,0.00006690305,0.0020249037,0.00060693664,0.00012948307,0.0019653684,0.00008863023,0.000021421609,0.0076522054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986436,0.000030732837,0.00023193199,0.00035066326,0.00024055356,0.00050252344],"domain_scores_gemma":[0.9994547,0.000062238454,0.000012510407,0.00028142496,0.00018082837,0.0000083398145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294502,0.000102610844,0.00012400831,0.000827914,0.00044270555,0.0005185435,0.0002607281,0.000045750116,0.000083870545],"category_scores_gemma":[0.00037783608,0.000098411256,0.000046390927,0.0013750392,0.00007283515,0.00044096485,0.00012412104,0.00023698168,0.00006232424],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019335371,0.0022138164,0.006895559,0.001406663,0.000164793,0.000011793879,0.00034773423,0.01128829,0.00530627,0.5085071,0.07645357,0.38721108],"study_design_scores_gemma":[0.00073475635,0.000022785183,0.0014050485,0.000051571835,0.000010082031,1.2823912e-7,0.0004418557,0.47758716,0.00010941289,0.0007976576,0.5187293,0.00011024415],"about_ca_topic_score_codex":0.00030519883,"about_ca_topic_score_gemma":0.0028468058,"teacher_disagreement_score":0.5077094,"about_ca_system_score_codex":0.0001780109,"about_ca_system_score_gemma":0.00010815721,"threshold_uncertainty_score":0.50003266},"labels":[],"label_agreement":null},{"id":"W617407927","doi":"10.1287/opre.2013.1171","title":"Joint Optimization of Sampling and Control of Partially Observable Failing Systems","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Partially observable Markov decision process; Schedule; Computer science; Sampling (signal processing); Markov decision process; Mathematical optimization; Operations research; Joint (building); Optimization problem; Reliability (semiconductor); Control (management); Markov process; Observable; Engineering; Mathematics; Statistics; Artificial intelligence","score_opus":0.06817649623033104,"score_gpt":0.2949681273271667,"score_spread":0.22679163109683567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W617407927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13345642,0.00038174147,0.8646334,0.00013250527,0.00006441896,0.00069068244,0.0000088576,0.000029813174,0.0006021871],"genre_scores_gemma":[0.97869235,0.00032245464,0.020730961,0.0000020272746,0.000019576239,0.000107759886,0.000012671004,0.0000117584195,0.00010044583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991637,0.000076155775,0.0003101507,0.000101131285,0.0001873167,0.00016158218],"domain_scores_gemma":[0.99898183,0.00008720493,0.000013116053,0.00016735152,0.0007072779,0.000043236305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006201127,0.000055112752,0.0001477439,0.00010913804,0.000089980706,0.00008277992,0.00006131392,0.00005555023,0.00006403767],"category_scores_gemma":[0.00027212242,0.00005108206,0.000017162502,0.00022807656,0.00007246515,0.0003111617,0.000018989764,0.00010409007,0.0000048130623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022161087,0.000013036898,0.00021403008,0.00013293701,0.000011109057,4.6132012e-8,0.0001415513,0.9624436,0.035519276,0.0012303028,0.000025645213,0.00026625613],"study_design_scores_gemma":[0.00019393882,0.000034652883,0.00038714704,0.00006703421,0.0000035502906,5.834637e-7,0.0002738876,0.9949369,0.0039896546,0.000029398538,0.00003831344,0.000044930708],"about_ca_topic_score_codex":0.0006163001,"about_ca_topic_score_gemma":0.00003101533,"teacher_disagreement_score":0.84523594,"about_ca_system_score_codex":0.00003169899,"about_ca_system_score_gemma":0.00003866204,"threshold_uncertainty_score":0.2083066},"labels":[],"label_agreement":null}]}