{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026963006,0.00014706244,0.9941696,0.00012972832,0.000022155771,0.000043433865,0.00006860648,0.00015266314,0.0025705362],"genre_scores_gemma":[0.24901779,0.0005439715,0.74328345,0.00015295041,0.000051188992,0.00058679876,0.00039561238,0.00018441267,0.005783802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989256,0.00052467384,0.00005503369,0.00017114464,0.00022019084,0.00010333274],"domain_scores_gemma":[0.9976539,0.0016780084,0.00016153076,0.00013700547,0.00026388682,0.0001056967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017004173,0.0009579887,0.0014932035,0.0006661802,0.000661689,0.0018117807,0.001697488,0.0013658974,0.005895298],"category_scores_gemma":[0.006255133,0.00069156726,0.0010754408,0.0009387415,0.0010133277,0.0016445866,0.001876531,0.0026121296,0.00096858805],"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.000055798417,0.00003620102,0.0003411888,0.00010262696,0.000041635663,0.000060778773,0.000083866944,0.81701744,0.00030081032,0.14968063,0.0014350009,0.030843982],"study_design_scores_gemma":[0.000012601043,0.0000085108,0.000017142534,0.0000107854,0.0000035984174,0.000010440228,0.0000072911644,0.9430995,0.00013476795,0.055754468,0.00093561725,0.0000053295703],"about_ca_topic_score_codex":0.00486265,"about_ca_topic_score_gemma":0.004613339,"teacher_disagreement_score":0.005895298,"about_ca_system_score_codex":0.0016084112,"about_ca_system_score_gemma":0.0026753447,"threshold_uncertainty_score":0.019721687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022758755,0.00027585262,0.99582666,0.00031712378,0.000026492626,0.000016610013,0.00005467169,0.000057682784,0.001148991],"genre_scores_gemma":[0.2668117,0.002038422,0.7250057,0.00047765244,0.0003413983,0.00036274848,0.00062030373,0.0002159366,0.0041261027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970758,0.0014880837,0.0001442514,0.0005192518,0.0006576922,0.00011487504],"domain_scores_gemma":[0.9897619,0.008220059,0.0006987836,0.0007488747,0.00046917782,0.000101298974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040157842,0.001352056,0.0020896927,0.001358863,0.0006482636,0.0026917513,0.001624131,0.0025566625,0.0021071467],"category_scores_gemma":[0.017363204,0.0010626409,0.0011989247,0.0022187456,0.0035717427,0.003492258,0.0030422849,0.0036362058,0.0005305826],"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.00008087531,0.00005113576,0.0005722094,0.00033249773,0.00008457944,0.00012242966,0.000116348325,0.7630704,0.0013747078,0.19177468,0.001827145,0.040593],"study_design_scores_gemma":[0.00001429698,0.00002104719,0.00011110564,0.000041047075,0.00000890078,0.000041016752,0.00002500968,0.8681128,0.000904529,0.12867646,0.0020303747,0.000013349807],"about_ca_topic_score_codex":0.0021445102,"about_ca_topic_score_gemma":0.0015445946,"teacher_disagreement_score":0.0040157842,"about_ca_system_score_codex":0.0012053513,"about_ca_system_score_gemma":0.0017220179,"threshold_uncertainty_score":0.02123779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82822096,0.00031790155,0.15823421,0.0008791641,0.000043038643,0.000095928255,0.00011087555,0.0000998684,0.011998011],"genre_scores_gemma":[0.99224347,0.00007926054,0.0052118003,0.000016951999,0.000009437396,0.000014795234,0.000023213901,0.000008834276,0.0023922166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.00026175275,0.000034490542,0.00015173768,0.00012322994,0.00018683358],"domain_scores_gemma":[0.9968555,0.0021952747,0.00026650532,0.00012522734,0.00027784012,0.00027954802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161668,0.00039952435,0.000885948,0.0009096339,0.0012719351,0.003127962,0.0015049808,0.0014971258,0.006202459],"category_scores_gemma":[0.005124215,0.000771566,0.0004405414,0.0016531802,0.0012209546,0.0035983215,0.001625083,0.00071535754,0.00032693503],"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.0012764387,0.00022889682,0.0052524055,0.00008523699,0.00007724727,0.00079585507,0.00051435083,0.8977881,0.0061028246,0.053625792,0.000979194,0.033273578],"study_design_scores_gemma":[0.00003465021,0.00009662592,0.00089378253,0.00000828777,0.00003515937,0.000052607396,0.0003009801,0.9788304,0.00070845254,0.018590277,0.00043024318,0.000018523871],"about_ca_topic_score_codex":0.0056874603,"about_ca_topic_score_gemma":0.004189863,"teacher_disagreement_score":0.006202459,"about_ca_system_score_codex":0.0019704106,"about_ca_system_score_gemma":0.001027403,"threshold_uncertainty_score":0.02074927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05058173,0.00037617853,0.9435392,0.0005414846,0.000039123508,0.000070194335,0.00032657318,0.0004634457,0.004062045],"genre_scores_gemma":[0.9322125,0.00046270964,0.061693937,0.00007687646,0.000039320334,0.00016141814,0.00029991192,0.00006919037,0.0049840775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986939,0.00038332248,0.000054173586,0.00032363355,0.00031356394,0.00023140121],"domain_scores_gemma":[0.9961404,0.0021547503,0.0006781141,0.00019287989,0.00056861545,0.00026538316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029545692,0.0010639598,0.0016498717,0.0009436768,0.0006731495,0.0021127407,0.0013776985,0.0014929703,0.004100531],"category_scores_gemma":[0.0060080816,0.0005754034,0.00063025934,0.0009367815,0.0015201719,0.0024295417,0.0011242459,0.0013179429,0.00035375124],"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.000088646215,0.00002575013,0.00032226657,0.000037585927,0.000018251327,0.000041342948,0.000036247762,0.9560368,0.00054249493,0.03515094,0.00033775344,0.007361895],"study_design_scores_gemma":[0.000008892458,0.000019606263,0.00006933122,0.0000048251786,0.0000044881344,0.000003528732,0.0000030364213,0.9936499,0.00015692979,0.0059024654,0.00017154602,0.000005462525],"about_ca_topic_score_codex":0.016752109,"about_ca_topic_score_gemma":0.007687309,"teacher_disagreement_score":0.016752109,"about_ca_system_score_codex":0.00309636,"about_ca_system_score_gemma":0.0024030085,"threshold_uncertainty_score":0.03330922},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09046711,0.00058385654,0.89561915,0.0012854978,0.000068896916,0.000108323504,0.00030145212,0.00036982796,0.011195943],"genre_scores_gemma":[0.7028693,0.00100142,0.2884731,0.0002819138,0.0001844879,0.0004153025,0.0008621516,0.00016346842,0.0057487763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984805,0.0006962162,0.00006260653,0.00024750928,0.00027267702,0.00024048315],"domain_scores_gemma":[0.9913488,0.007370472,0.00052647165,0.00039491776,0.00021447628,0.00014488476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019162903,0.0014097616,0.0010533645,0.00147828,0.0007360627,0.002914877,0.0015140394,0.00095122156,0.0047643483],"category_scores_gemma":[0.012552354,0.0004643916,0.0011067758,0.0017865374,0.0024726526,0.0051497906,0.0013762396,0.0024329976,0.00063245354],"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.00006723315,0.00008142221,0.00054470776,0.00009109163,0.000021808599,0.000069475675,0.00014937537,0.18470272,0.0003904114,0.7875135,0.0014319859,0.024936311],"study_design_scores_gemma":[0.000016350301,0.000019231766,0.00005863778,0.000013426707,0.0000064546202,0.000024850187,0.000037743313,0.37760296,0.00033117237,0.6209815,0.00089781237,0.000009867261],"about_ca_topic_score_codex":0.0018737261,"about_ca_topic_score_gemma":0.0015099483,"teacher_disagreement_score":0.0047643483,"about_ca_system_score_codex":0.001963294,"about_ca_system_score_gemma":0.0009852678,"threshold_uncertainty_score":0.015938342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032634616,0.0001787597,0.9946991,0.00009679037,0.000035707842,0.000016197011,0.000016390515,0.00003760438,0.0016558943],"genre_scores_gemma":[0.19139206,0.000628509,0.80181885,0.0001725344,0.00014025302,0.00014814858,0.00009236731,0.00013754422,0.0054698167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928206,0.0003058782,0.000027389122,0.00008314144,0.00025896195,0.000042597734],"domain_scores_gemma":[0.9993718,0.00025971612,0.000058306785,0.000084151514,0.00017555231,0.000050522773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840281,0.0009741798,0.00072844845,0.00086228404,0.0004938241,0.00090137543,0.0013177583,0.0012503195,0.0019283098],"category_scores_gemma":[0.002114039,0.00035735796,0.00082923315,0.0010986102,0.0012210138,0.0019973246,0.0014279765,0.0015794309,0.00054055155],"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.00009980133,0.00008866842,0.00047927708,0.00017452316,0.00003716075,0.00008065364,0.00012609188,0.6712062,0.008356286,0.19789298,0.0036784108,0.11777998],"study_design_scores_gemma":[0.0000067127376,0.000057965757,0.0000861615,0.000010666706,0.0000039900933,0.000031867443,0.000013392194,0.96532947,0.0014642508,0.0300445,0.0029404194,0.0000105786],"about_ca_topic_score_codex":0.0018250445,"about_ca_topic_score_gemma":0.0018320306,"teacher_disagreement_score":0.0019283098,"about_ca_system_score_codex":0.0007304689,"about_ca_system_score_gemma":0.0011925009,"threshold_uncertainty_score":0.008377194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44982737,0.0035612185,0.4773839,0.014749696,0.00022583513,0.00019046264,0.00078474,0.0003150493,0.05296175],"genre_scores_gemma":[0.9818226,0.0010852346,0.010438885,0.00021388948,0.0000969175,0.00007697319,0.00013687045,0.00002567206,0.00610297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992465,0.00031583133,0.000042460473,0.00016333816,0.000086259446,0.00014573305],"domain_scores_gemma":[0.9987785,0.00053400244,0.00035695347,0.000085379455,0.00011019909,0.00013494023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015869251,0.0008843998,0.0014161553,0.000589156,0.00046363904,0.003141923,0.00090189604,0.002064413,0.0042324355],"category_scores_gemma":[0.007875224,0.00053542544,0.00055515365,0.00089003117,0.0010219282,0.0029861531,0.0010185844,0.0016547384,0.00042034674],"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.00018388324,0.00019889252,0.002595821,0.0001611664,0.00008456697,0.00024932154,0.00011611669,0.44740018,0.001775079,0.519932,0.003645741,0.02365729],"study_design_scores_gemma":[0.00018497132,0.00009675914,0.0013564797,0.00009141928,0.000039297538,0.00010094931,0.000098100456,0.6084289,0.0008079789,0.3860205,0.0027484766,0.00002607679],"about_ca_topic_score_codex":0.0029227491,"about_ca_topic_score_gemma":0.0012076976,"teacher_disagreement_score":0.0042324355,"about_ca_system_score_codex":0.0023450213,"about_ca_system_score_gemma":0.0021459402,"threshold_uncertainty_score":0.017014444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004332566,0.00019244934,0.99190944,0.00013693896,0.000024644394,0.00005166758,0.0001333462,0.000115186675,0.003103741],"genre_scores_gemma":[0.21345407,0.0014176664,0.76965624,0.00020861233,0.00014994519,0.00066927006,0.0012082764,0.00033192415,0.012904024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.00042941872,0.00004976242,0.00016400166,0.00026320302,0.00013123223],"domain_scores_gemma":[0.99909055,0.00058188406,0.0001016009,0.00006427872,0.000116789015,0.000044814293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265793,0.0019309305,0.0013567182,0.0011750925,0.0006082637,0.0013761406,0.00089322944,0.001395614,0.006392753],"category_scores_gemma":[0.0030098453,0.0011693035,0.0018616369,0.0014792377,0.00081382476,0.0016965889,0.0010270013,0.0025498462,0.000892357],"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.000027961049,0.000019428473,0.00010089308,0.00004176153,0.00001923682,0.000030705225,0.000023554458,0.9556358,0.0006164527,0.033056363,0.00065751286,0.009770336],"study_design_scores_gemma":[0.000008468112,0.000011034278,0.000037100315,0.00000743698,0.0000057112193,0.0000069394623,0.0000071821005,0.96709687,0.00018259448,0.03168423,0.0009482674,0.000004232855],"about_ca_topic_score_codex":0.0060313065,"about_ca_topic_score_gemma":0.004931083,"teacher_disagreement_score":0.006392753,"about_ca_system_score_codex":0.0020259966,"about_ca_system_score_gemma":0.0019753783,"threshold_uncertainty_score":0.021385849},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16068484,0.0005918086,0.8203609,0.00060541404,0.00022792036,0.0001904771,0.00023376412,0.0005407461,0.016564155],"genre_scores_gemma":[0.83653355,0.00021337255,0.15671158,0.00031474448,0.00020881042,0.000108476095,0.0001523598,0.000092580616,0.0056645833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00018046403,0.00005754115,0.00014237607,0.00057289086,0.00046585605],"domain_scores_gemma":[0.9974976,0.0010100707,0.0004688068,0.00025889798,0.0005350747,0.00022939235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018078156,0.0007942149,0.0008903764,0.0009496128,0.0014374405,0.0020674858,0.002168809,0.0011680875,0.0026113444],"category_scores_gemma":[0.0062834616,0.00040773867,0.0008157596,0.0010389958,0.001294572,0.0018077502,0.0012452613,0.0019360901,0.00030662373],"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.0004970736,0.0003185296,0.0044651544,0.00022799328,0.000062316765,0.0008308077,0.0002657619,0.641833,0.015726771,0.2963467,0.00404238,0.035383493],"study_design_scores_gemma":[0.000021519727,0.00003238857,0.0003644079,0.0000053107165,0.000008621731,0.00006483613,0.000018130659,0.9887029,0.0011330799,0.008944639,0.0006905671,0.0000136885465],"about_ca_topic_score_codex":0.015165229,"about_ca_topic_score_gemma":0.010658804,"teacher_disagreement_score":0.015165229,"about_ca_system_score_codex":0.0033963735,"about_ca_system_score_gemma":0.003581863,"threshold_uncertainty_score":0.03015393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20436366,0.00065870304,0.785286,0.000735205,0.000063341504,0.00025692556,0.00050992495,0.0003944794,0.0077317418],"genre_scores_gemma":[0.93676627,0.00046885922,0.060172554,0.00006291381,0.00003139075,0.00021609833,0.00021108719,0.000095440446,0.0019753466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989699,0.00037270665,0.0000468473,0.0001663349,0.00013589939,0.0003084344],"domain_scores_gemma":[0.9952833,0.003143674,0.0007109953,0.00017590733,0.00031634796,0.00036971725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024035824,0.0013923635,0.0017249542,0.00076608616,0.0005868711,0.0019525654,0.0012740459,0.0011529257,0.002753047],"category_scores_gemma":[0.0056651034,0.0011862698,0.00068404357,0.000920996,0.0014087041,0.0015378103,0.0009012934,0.0013395816,0.000342789],"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.00005833674,0.000027701004,0.00012869165,0.000024330528,0.000012242211,0.000017444883,0.000017918079,0.9898784,0.00034783187,0.007290557,0.00020506723,0.0019913753],"study_design_scores_gemma":[0.000026172922,0.000027644825,0.00007800939,0.000005522162,0.0000062846943,0.0000047591348,0.000010766862,0.9905406,0.00030327364,0.008889501,0.00010166778,0.000005849299],"about_ca_topic_score_codex":0.0073066955,"about_ca_topic_score_gemma":0.0044315998,"teacher_disagreement_score":0.0073066955,"about_ca_system_score_codex":0.0029714054,"about_ca_system_score_gemma":0.0033654624,"threshold_uncertainty_score":0.021559179},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028622735,0.00035724853,0.957352,0.0006211454,0.0001308959,0.00006798903,0.00012869548,0.00012640323,0.012592934],"genre_scores_gemma":[0.93001026,0.0007176969,0.06047794,0.00016187414,0.0001697925,0.00007372226,0.00011734811,0.000079354606,0.008191999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.00024877753,0.00004423363,0.0001858239,0.00037885958,0.00013496215],"domain_scores_gemma":[0.99903536,0.00059757294,0.000109948065,0.0000597877,0.00014854735,0.000048833055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134932,0.0010564824,0.0010795734,0.0003664222,0.00043532797,0.00258492,0.0017442054,0.00087215647,0.0054611727],"category_scores_gemma":[0.0031187818,0.0006466601,0.0008452555,0.0006314098,0.0011088088,0.0020830245,0.0014443734,0.0014915314,0.00040440398],"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.00012785949,0.00011769424,0.00037801557,0.00022869802,0.00005803274,0.0002238929,0.000083074876,0.8642386,0.0070908344,0.10428977,0.0025465328,0.020616893],"study_design_scores_gemma":[0.000012231351,0.00006198284,0.00009276188,0.000010388337,0.000016222059,0.00003991138,0.000014847888,0.9827011,0.00086755154,0.015319161,0.00084934226,0.000014558261],"about_ca_topic_score_codex":0.0025446473,"about_ca_topic_score_gemma":0.0016811474,"teacher_disagreement_score":0.0054611727,"about_ca_system_score_codex":0.0011933037,"about_ca_system_score_gemma":0.0014883789,"threshold_uncertainty_score":0.01826948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056233434,0.0004130898,0.9923947,0.00060593925,0.000018180543,0.000016824406,0.000033082546,0.00008666218,0.0008080569],"genre_scores_gemma":[0.67200184,0.0015913835,0.32293642,0.00033506774,0.0002965415,0.0003302046,0.0002200769,0.00022167695,0.0020668437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956103,0.0025789016,0.00020178541,0.0004744993,0.00089887955,0.00023567854],"domain_scores_gemma":[0.97738886,0.01889718,0.0016089723,0.0007892285,0.00094638974,0.00036933026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009064875,0.0015921526,0.0027067028,0.0016809913,0.00069197465,0.002409838,0.0020733066,0.00262993,0.0011857903],"category_scores_gemma":[0.031499844,0.0012199008,0.0017944247,0.0018060283,0.0025993611,0.003180353,0.0034037787,0.0034877637,0.00017111654],"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.00001830613,0.00001728541,0.00017848903,0.000039629766,0.000033842996,0.000047949547,0.000031691812,0.93362474,0.00022147915,0.061225563,0.00021225854,0.004348765],"study_design_scores_gemma":[0.0000039073398,0.000006947614,0.000026107838,0.0000050524,0.0000025680079,0.000006732298,0.0000032817545,0.96459055,0.00008571769,0.03511286,0.00015081257,0.000005440736],"about_ca_topic_score_codex":0.0037457354,"about_ca_topic_score_gemma":0.0020514482,"teacher_disagreement_score":0.009064875,"about_ca_system_score_codex":0.002464308,"about_ca_system_score_gemma":0.00200705,"threshold_uncertainty_score":0.047940195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0211184,0.0013389394,0.9578114,0.00073009555,0.00026104407,0.00029050087,0.0007497905,0.0005278437,0.017171916],"genre_scores_gemma":[0.20168608,0.0026543287,0.7758955,0.00053860375,0.00067552185,0.0007555528,0.0036246825,0.000506233,0.013663536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987583,0.0003869453,0.00006636889,0.00026777698,0.0003565855,0.00016400756],"domain_scores_gemma":[0.99843687,0.0010488238,0.00016291796,0.00013089366,0.00013502252,0.00008552845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064354,0.002259715,0.0014040192,0.0012230346,0.0006925275,0.0019781468,0.0015943295,0.0015201675,0.008370208],"category_scores_gemma":[0.004393619,0.00095173233,0.0015016348,0.002223644,0.0011555051,0.0024217626,0.0011238358,0.0036551426,0.001361046],"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.00032783792,0.00025434312,0.0007323216,0.00063166354,0.00013649595,0.0002578811,0.00023437924,0.70143867,0.0040702405,0.15209474,0.01922137,0.120600045],"study_design_scores_gemma":[0.00010649021,0.00020869843,0.0005270154,0.00007610504,0.0000611221,0.00019825422,0.000094369665,0.80694497,0.002100391,0.16944946,0.020201711,0.000031370768],"about_ca_topic_score_codex":0.0021614826,"about_ca_topic_score_gemma":0.0017863163,"teacher_disagreement_score":0.008370208,"about_ca_system_score_codex":0.0012883561,"about_ca_system_score_gemma":0.0010218424,"threshold_uncertainty_score":0.02800119},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003893927,0.4954194,0.2618449,0.028544134,0.04001889,0.00021398635,0.0007592695,0.0006445776,0.16866094],"genre_scores_gemma":[0.07265001,0.44515884,0.14353256,0.016411858,0.12837213,0.0006394152,0.0024971622,0.0012439617,0.18949406],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988445,0.00031618122,0.00006350773,0.0003020097,0.00038912884,0.000084670864],"domain_scores_gemma":[0.997733,0.0012228944,0.000099299126,0.00020939691,0.00055359624,0.00018180767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509967,0.00142912,0.0011266099,0.002352679,0.00107036,0.0027948644,0.0010916751,0.0015617581,0.026897386],"category_scores_gemma":[0.0048066746,0.00055405515,0.0012202587,0.005919798,0.0015417741,0.004201859,0.0015158952,0.0036165835,0.0110715395],"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.000064409236,0.00011583229,0.00040987195,0.0012029884,0.000056746758,0.00012306201,0.00014369353,0.004471062,0.0009091105,0.28368744,0.34765497,0.36116084],"study_design_scores_gemma":[0.000023177261,0.000107678294,0.0005784791,0.0006156043,0.000036149253,0.00047420632,0.000092205824,0.007838759,0.0010069025,0.25066108,0.7385133,0.00005244889],"about_ca_topic_score_codex":0.0009160536,"about_ca_topic_score_gemma":0.0008245014,"teacher_disagreement_score":0.026897386,"about_ca_system_score_codex":0.0016229477,"about_ca_system_score_gemma":0.00095359754,"threshold_uncertainty_score":0.08998078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06921074,0.0021151786,0.82486874,0.002956018,0.00048056585,0.00047444916,0.0016991002,0.0005831446,0.09761205],"genre_scores_gemma":[0.6153796,0.0039059946,0.30558008,0.0010283312,0.00033768622,0.0005611684,0.0025399951,0.00028182927,0.07038533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993325,0.0002179219,0.000025229729,0.00015180849,0.00013207021,0.00014039133],"domain_scores_gemma":[0.9996112,0.00019975744,0.000049969945,0.00002763342,0.000054693464,0.000056807912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073204,0.0008155361,0.0008066007,0.00043669285,0.0009542315,0.0020921952,0.0010951082,0.0013675543,0.0080903275],"category_scores_gemma":[0.0016262756,0.00040610286,0.000511111,0.0010418498,0.0008142526,0.0022018335,0.0009466729,0.0010689379,0.0011395823],"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.0003193396,0.00023280001,0.0008779889,0.00042258506,0.00009652114,0.0006523772,0.0002623839,0.34214756,0.0032621913,0.4484654,0.037194446,0.16606636],"study_design_scores_gemma":[0.00009783702,0.00012743098,0.0003671498,0.00006232859,0.000050306066,0.00029487812,0.0002948552,0.6764389,0.0021598057,0.2630191,0.057048928,0.000038422677],"about_ca_topic_score_codex":0.0050527467,"about_ca_topic_score_gemma":0.003636536,"teacher_disagreement_score":0.0080903275,"about_ca_system_score_codex":0.00086194224,"about_ca_system_score_gemma":0.0023684562,"threshold_uncertainty_score":0.0270648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034631053,0.0010149291,0.9778541,0.0018191602,0.00021831265,0.000057744073,0.00015810525,0.00024556927,0.015169076],"genre_scores_gemma":[0.39656815,0.0049207434,0.5725009,0.0017371761,0.0017014443,0.0005864012,0.0006393902,0.0008496304,0.020496188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987613,0.00050813064,0.000045870922,0.00014972604,0.00039193316,0.00014310086],"domain_scores_gemma":[0.9935361,0.004950458,0.00046226743,0.00040760965,0.00054863945,0.00009501837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031597759,0.001129861,0.0012040897,0.001317988,0.0007892493,0.0029142795,0.0013999036,0.0011966025,0.021962252],"category_scores_gemma":[0.015230717,0.0005877208,0.0013706929,0.0017608686,0.0021469572,0.005071643,0.0015498365,0.0038118095,0.003515669],"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.000054622196,0.00010835471,0.00076775847,0.00024266266,0.000043547196,0.00016214486,0.00008706952,0.25014937,0.0012933451,0.67339516,0.022775037,0.050920915],"study_design_scores_gemma":[0.000014110051,0.000020175952,0.00025262465,0.000058579877,0.000011636691,0.000086018445,0.000024933111,0.67764246,0.00069320656,0.31377286,0.0073968624,0.000026572003],"about_ca_topic_score_codex":0.0040985453,"about_ca_topic_score_gemma":0.0031201595,"teacher_disagreement_score":0.021962252,"about_ca_system_score_codex":0.0015491166,"about_ca_system_score_gemma":0.0017819215,"threshold_uncertainty_score":0.07347107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08775553,0.0007657864,0.8850331,0.0010674434,0.00011180782,0.00016165499,0.0003919486,0.0003178872,0.024394939],"genre_scores_gemma":[0.7375478,0.001470445,0.2417666,0.00012408459,0.0001214116,0.00021585435,0.00071502005,0.0001919321,0.017846767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986419,0.0005746117,0.0000468589,0.00035607177,0.00018069464,0.0001997452],"domain_scores_gemma":[0.99809414,0.0010985542,0.00021031722,0.0001628392,0.0002445061,0.00018962906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072029,0.001364486,0.0014075655,0.0012262972,0.0015791812,0.002320888,0.0018017663,0.0027263619,0.009287236],"category_scores_gemma":[0.006791588,0.0008144777,0.0010591923,0.0019021337,0.0018781582,0.002764861,0.0028662195,0.00096864015,0.0016591067],"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.00018571889,0.00003733463,0.0005709864,0.00017546993,0.00003841879,0.00041271377,0.00020203285,0.892707,0.0016689582,0.08301468,0.0025431833,0.018443493],"study_design_scores_gemma":[0.000051813793,0.00013027203,0.0002921008,0.00003104918,0.000028398792,0.00018993119,0.00036535467,0.94656795,0.0014890288,0.044384178,0.0064242394,0.000045646608],"about_ca_topic_score_codex":0.015139506,"about_ca_topic_score_gemma":0.00561509,"teacher_disagreement_score":0.015139506,"about_ca_system_score_codex":0.001867333,"about_ca_system_score_gemma":0.001154308,"threshold_uncertainty_score":0.031068921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08625535,0.0014395847,0.7386123,0.0032680363,0.00024345989,0.00038694343,0.009242308,0.0018166938,0.15873533],"genre_scores_gemma":[0.6819526,0.0013314197,0.2573416,0.00038141882,0.000098536526,0.0010794459,0.0054057324,0.00031540592,0.05209385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995733,0.0001421383,0.000022362316,0.000086260676,0.000113943825,0.00006204798],"domain_scores_gemma":[0.99968314,0.00011826486,0.000057367117,0.000030788335,0.00007374336,0.000036731697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083735125,0.0007367683,0.0005377495,0.00061381725,0.00041802807,0.0017087441,0.0010713128,0.00096718455,0.008472912],"category_scores_gemma":[0.0019187204,0.0004643164,0.0007298114,0.00063914875,0.00037088143,0.001145682,0.001111189,0.0010511907,0.0012359769],"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.000023078705,0.000012473081,0.0003088503,0.000024133165,0.000008486715,0.00006619191,0.00002152526,0.95906866,0.00013334039,0.030732907,0.0022125382,0.007387859],"study_design_scores_gemma":[0.000021769662,0.000015189298,0.00014647252,0.000015743075,0.0000072668686,0.00003922192,0.000011898284,0.9748573,0.00017554274,0.014378965,0.010320354,0.000010246853],"about_ca_topic_score_codex":0.016098168,"about_ca_topic_score_gemma":0.009083431,"teacher_disagreement_score":0.016098168,"about_ca_system_score_codex":0.0019911656,"about_ca_system_score_gemma":0.002589772,"threshold_uncertainty_score":0.032008946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14315388,0.00064998557,0.817173,0.0019897232,0.0001695807,0.0005556714,0.0016144927,0.0003358561,0.034357794],"genre_scores_gemma":[0.9063926,0.00054182886,0.05173492,0.00019899344,0.000107595704,0.00067973824,0.00042797555,0.00005454703,0.039861895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834394,0.00057573576,0.0000678401,0.0004198849,0.00021266051,0.00037994917],"domain_scores_gemma":[0.99754035,0.0011177754,0.00041850275,0.00015381709,0.00040026463,0.00036938337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019786826,0.0012376887,0.0018808453,0.00068480935,0.001276705,0.0026848963,0.0038862,0.0033808625,0.01764906],"category_scores_gemma":[0.0031235714,0.0010053857,0.0014673881,0.001194573,0.0017583693,0.0029752618,0.0018119911,0.0021710207,0.001775521],"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.00037803935,0.00017561493,0.0010928358,0.00013939157,0.00007640025,0.00060622644,0.00020207815,0.84511185,0.0020543393,0.14352076,0.0018416402,0.0048008277],"study_design_scores_gemma":[0.00023644864,0.00013425239,0.00031041785,0.000013397822,0.000040566138,0.00008989302,0.00006506593,0.96288425,0.00024387805,0.034017693,0.0019253411,0.000038662438],"about_ca_topic_score_codex":0.010722297,"about_ca_topic_score_gemma":0.008625504,"teacher_disagreement_score":0.01764906,"about_ca_system_score_codex":0.0028724256,"about_ca_system_score_gemma":0.0020767823,"threshold_uncertainty_score":0.059041977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4771971,0.0002646303,0.50664735,0.0015875433,0.0002290821,0.00025390703,0.0002447052,0.0006472412,0.012928395],"genre_scores_gemma":[0.9922281,0.00006527912,0.0047612726,0.000043035005,0.00002250895,0.00004489778,0.00003507989,0.0000122233005,0.0027875719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896073,0.00024293605,0.00004282951,0.00020552655,0.00025898957,0.0002888626],"domain_scores_gemma":[0.997983,0.00095946284,0.00033066256,0.00009661265,0.000263225,0.00036704337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016692367,0.00089252717,0.0010886203,0.0003904756,0.0014147661,0.0020544063,0.0014235853,0.0010891883,0.00290591],"category_scores_gemma":[0.0034209802,0.000395336,0.00042180103,0.0005155735,0.0015464188,0.000974976,0.001493842,0.0013039713,0.00024107254],"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.00023621615,0.00013284916,0.0005066231,0.000032988606,0.000015590607,0.00019449038,0.000085687614,0.9793873,0.003172349,0.011852767,0.00052499864,0.0038580834],"study_design_scores_gemma":[0.000029659059,0.00004196226,0.00013043243,0.0000012489335,0.000004588472,0.00000921291,0.000018746254,0.9974239,0.0002444475,0.001936291,0.0001515226,0.000007975056],"about_ca_topic_score_codex":0.02400151,"about_ca_topic_score_gemma":0.00880794,"teacher_disagreement_score":0.02400151,"about_ca_system_score_codex":0.0018610408,"about_ca_system_score_gemma":0.0028099727,"threshold_uncertainty_score":0.04772359},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3942204,0.00036303198,0.59909487,0.00063646596,0.00003060361,0.00009621256,0.00013262375,0.00038238044,0.005043484],"genre_scores_gemma":[0.9753318,0.00008715527,0.023757722,0.000041572614,0.0000129757655,0.00003442782,0.00002839235,0.00003538293,0.0006704775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755496,0.00081748364,0.000083511455,0.00034470114,0.0005573266,0.0006420825],"domain_scores_gemma":[0.9943023,0.003064314,0.0010718777,0.0005856441,0.00046244217,0.00051357155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053193583,0.0006863791,0.0011325862,0.0007581417,0.00072326534,0.0018932546,0.0018238132,0.0010079411,0.0021101646],"category_scores_gemma":[0.01743295,0.00052594644,0.0005802499,0.0010505434,0.0013370088,0.0024749518,0.0013124495,0.0012972944,0.00024730666],"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.00027693028,0.00006710238,0.0023516738,0.000052133102,0.00003302812,0.000095525094,0.00020475485,0.9405212,0.002293219,0.037853945,0.0007447481,0.01550575],"study_design_scores_gemma":[0.000013293869,0.000044183605,0.0004803324,0.000005111508,0.0000066912235,0.000026707576,0.000047892016,0.9843407,0.0005802322,0.0142585905,0.00018648991,0.000009625314],"about_ca_topic_score_codex":0.004705656,"about_ca_topic_score_gemma":0.0027292091,"teacher_disagreement_score":0.0053193583,"about_ca_system_score_codex":0.0034076695,"about_ca_system_score_gemma":0.0026599132,"threshold_uncertainty_score":0.028131783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12841018,0.003242018,0.7618955,0.0048332284,0.000402824,0.001164853,0.0059010913,0.0005430337,0.093607344],"genre_scores_gemma":[0.5945313,0.0038578822,0.33809376,0.000570217,0.00030771963,0.0011802956,0.004407149,0.0002092542,0.05684237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989267,0.00045187384,0.00005233808,0.00028134006,0.0001437468,0.00014399653],"domain_scores_gemma":[0.9990526,0.00067964586,0.000078796445,0.00002797078,0.000083876934,0.00007711395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012830715,0.0022047637,0.0012212442,0.0009311639,0.0008572568,0.002053553,0.0012447383,0.003414445,0.014645078],"category_scores_gemma":[0.0028398903,0.0009251138,0.001243904,0.0014210065,0.0010548512,0.0026093943,0.0015373146,0.0016216045,0.001296744],"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.00026197205,0.00032463032,0.0014838683,0.0010509962,0.00014893712,0.0009488464,0.00020588949,0.80260944,0.0016705605,0.12100463,0.013717205,0.05657309],"study_design_scores_gemma":[0.00029599393,0.0004599881,0.000567912,0.000157991,0.00013420101,0.000436967,0.00041040775,0.80129206,0.0017331135,0.14206527,0.052394696,0.000051356776],"about_ca_topic_score_codex":0.0045245816,"about_ca_topic_score_gemma":0.004577324,"teacher_disagreement_score":0.014645078,"about_ca_system_score_codex":0.0013893183,"about_ca_system_score_gemma":0.0019123182,"threshold_uncertainty_score":0.048992634},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052379775,0.00029812695,0.97580373,0.0012959063,0.00019490077,0.00015215266,0.000101234,0.00022263017,0.016693419],"genre_scores_gemma":[0.54093015,0.0012094289,0.44330344,0.000788948,0.0006497128,0.0004589367,0.00020219028,0.00038402283,0.0120731145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697566,0.0012048532,0.00012760462,0.000620613,0.0007235792,0.0003477043],"domain_scores_gemma":[0.99496824,0.0034788507,0.00034854675,0.0003516877,0.00057350943,0.00027919502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039315214,0.00097125134,0.0016657399,0.00078260794,0.0011682749,0.003139281,0.001657635,0.0018781831,0.01657212],"category_scores_gemma":[0.016142275,0.0007770038,0.000964816,0.0011377421,0.0025166962,0.0047738627,0.0025348184,0.003327902,0.0017332069],"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.00030984456,0.00024671768,0.00049839105,0.00031185863,0.000051926403,0.00028164277,0.00021200534,0.3875391,0.0063360534,0.53973407,0.014881731,0.04959664],"study_design_scores_gemma":[0.000056850076,0.00007421234,0.00015265682,0.000054125794,0.000022950413,0.00016356348,0.000049762406,0.81038725,0.0024487178,0.17983228,0.0067196744,0.000037811853],"about_ca_topic_score_codex":0.0022344568,"about_ca_topic_score_gemma":0.0013970215,"teacher_disagreement_score":0.01657212,"about_ca_system_score_codex":0.0022964824,"about_ca_system_score_gemma":0.0047273706,"threshold_uncertainty_score":0.055439234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10289349,0.0002169827,0.8872809,0.0003307867,0.00003459237,0.00011339287,0.00012392482,0.00022981937,0.008776071],"genre_scores_gemma":[0.7397861,0.00036710038,0.25531942,0.00012693627,0.000027037426,0.00033523864,0.00019242446,0.00007900834,0.0037667404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941826,0.00030948082,0.0000155337,0.000059101516,0.00009930127,0.00009844022],"domain_scores_gemma":[0.9994863,0.00032291666,0.000077704026,0.000027614427,0.00004685355,0.000038633632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760744,0.0006911363,0.00050382107,0.00061769615,0.00039817684,0.0011468797,0.0009309195,0.001034448,0.002914317],"category_scores_gemma":[0.0018350597,0.00057928916,0.0007092124,0.00063215464,0.00080835813,0.0012871069,0.0008544099,0.00064035517,0.0002824105],"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.00001984986,0.000020017911,0.00015087641,0.00003853019,0.000007264707,0.000038339553,0.000017191816,0.97501165,0.0008798315,0.018195495,0.00019219659,0.0054287366],"study_design_scores_gemma":[0.000017908906,0.000050518174,0.00006237138,0.000006705344,0.000005847864,0.00001960057,0.000020558467,0.9865215,0.0005366609,0.011912112,0.00084107637,0.0000051178854],"about_ca_topic_score_codex":0.0011824133,"about_ca_topic_score_gemma":0.0013496206,"teacher_disagreement_score":0.002914317,"about_ca_system_score_codex":0.0011209272,"about_ca_system_score_gemma":0.0009141946,"threshold_uncertainty_score":0.009749353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11649441,0.00064550183,0.87538165,0.00060446444,0.00012881406,0.00003128797,0.000046027762,0.00017086831,0.006497006],"genre_scores_gemma":[0.94406015,0.0006472743,0.048615593,0.0001713335,0.00011567901,0.00009072151,0.000092294744,0.000049352846,0.0061575533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992059,0.00031550872,0.000026359163,0.00009933605,0.00021774306,0.00013521199],"domain_scores_gemma":[0.9976673,0.0012662129,0.00042868248,0.00013949412,0.00025339564,0.00024489872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023803625,0.0007887934,0.0007168367,0.00095557445,0.0005224745,0.0012619429,0.0017216793,0.0014430068,0.0015197564],"category_scores_gemma":[0.0106527265,0.00048737164,0.00067147583,0.0005673389,0.0021456217,0.002169955,0.0014190368,0.0017307559,0.00026593145],"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.000028755969,0.00002635421,0.00042549483,0.000027969336,0.000015444262,0.00009790638,0.00012480273,0.5865816,0.0009857505,0.4083205,0.00041063497,0.002954872],"study_design_scores_gemma":[0.000004620992,0.0000068156874,0.00003255678,0.0000031382,0.0000016092932,0.000008058808,0.0000074690456,0.96806705,0.00006467876,0.03163041,0.00017048387,0.0000030861868],"about_ca_topic_score_codex":0.0035123911,"about_ca_topic_score_gemma":0.0015744781,"teacher_disagreement_score":0.0035123911,"about_ca_system_score_codex":0.0015519836,"about_ca_system_score_gemma":0.00072681304,"threshold_uncertainty_score":0.01258868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027823048,0.00023947618,0.9900568,0.000112880436,0.000067669665,0.000113325375,0.00012495262,0.000980805,0.0055217263],"genre_scores_gemma":[0.03285536,0.00028080845,0.9631874,0.00007668893,0.00004275128,0.00024708037,0.00043768983,0.00023885102,0.0026332904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886703,0.0001701984,0.000063368076,0.0002444988,0.00045574564,0.00019930342],"domain_scores_gemma":[0.99886286,0.00054176163,0.000098956414,0.00024262979,0.0002028762,0.000050934654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693463,0.0016137571,0.0016338362,0.0013297562,0.0010985667,0.001943482,0.002289491,0.0019315521,0.0158427],"category_scores_gemma":[0.003620997,0.0008431576,0.0012136098,0.0024977396,0.00071779714,0.002710652,0.0021250348,0.0021760913,0.004105035],"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.00015033365,0.00029283267,0.0004421981,0.0004313394,0.000056491852,0.0001693711,0.00016491613,0.40069962,0.0037302393,0.04997978,0.0151272565,0.5287556],"study_design_scores_gemma":[0.00009701132,0.00007266803,0.0001605619,0.00003852453,0.000018734592,0.00017181349,0.000059285827,0.952698,0.0012655323,0.03561534,0.009780212,0.000022203687],"about_ca_topic_score_codex":0.0052551934,"about_ca_topic_score_gemma":0.006629647,"teacher_disagreement_score":0.0158427,"about_ca_system_score_codex":0.0014167238,"about_ca_system_score_gemma":0.003009665,"threshold_uncertainty_score":0.05299914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009019711,0.00024522873,0.9894872,0.00014823534,0.000014230679,0.00002832706,0.000024465093,0.000055415854,0.0009772356],"genre_scores_gemma":[0.6803689,0.0009144778,0.30989775,0.00019886674,0.00013381593,0.00062750845,0.0003560287,0.00015831015,0.0073444517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970873,0.0015712831,0.00011712222,0.0005062493,0.00055165356,0.00016645456],"domain_scores_gemma":[0.9890164,0.008609098,0.0009380831,0.00051123026,0.0006734192,0.0002516007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070512984,0.0019904787,0.0029217282,0.0015354472,0.0006492275,0.0021632449,0.001808808,0.0020339205,0.0016333767],"category_scores_gemma":[0.019596277,0.0011175568,0.0014793568,0.0012682363,0.0029593105,0.0025548197,0.0035132207,0.0027474484,0.00034987828],"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.00004009953,0.000018849252,0.00020052232,0.000053161762,0.00003502066,0.000035785397,0.00003281517,0.9581731,0.0002886613,0.035136156,0.00021783127,0.0057679676],"study_design_scores_gemma":[0.000006957201,0.000027542806,0.000042264757,0.000008347407,0.000004850836,0.0000049429445,0.000005507017,0.9759487,0.00014166597,0.023608824,0.00019520524,0.000005135655],"about_ca_topic_score_codex":0.0020771034,"about_ca_topic_score_gemma":0.0012559509,"teacher_disagreement_score":0.0070512984,"about_ca_system_score_codex":0.0017026131,"about_ca_system_score_gemma":0.0013432782,"threshold_uncertainty_score":0.03729129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17322835,0.0020580154,0.7937638,0.004590768,0.00015641472,0.0001318982,0.00033645393,0.00052351697,0.02521068],"genre_scores_gemma":[0.9322737,0.0016927747,0.054594915,0.00073609885,0.00022627784,0.00018629944,0.00024122486,0.00019399125,0.009854756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705243,0.0012445379,0.00009756438,0.0003169269,0.00063917035,0.00064923964],"domain_scores_gemma":[0.9693433,0.02310694,0.0026276216,0.0021307375,0.0015320336,0.0012593947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071293865,0.0010968596,0.0015746984,0.001513813,0.0018687521,0.002511564,0.0036283128,0.0018672299,0.005405146],"category_scores_gemma":[0.0617547,0.0009285812,0.0016577526,0.0019206883,0.0043376694,0.0071146614,0.00494696,0.004586722,0.0005174054],"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.00019156303,0.00011888828,0.0045892578,0.00010637094,0.000052636395,0.00032013425,0.00056083145,0.5221867,0.00068600115,0.45686573,0.003940905,0.010380945],"study_design_scores_gemma":[0.000018521781,0.00001958958,0.0004158645,0.000025378253,0.000020862644,0.00006197394,0.00014004589,0.8626637,0.00033869632,0.13504389,0.0012332919,0.000018227985],"about_ca_topic_score_codex":0.017313832,"about_ca_topic_score_gemma":0.009175568,"teacher_disagreement_score":0.017313832,"about_ca_system_score_codex":0.006296885,"about_ca_system_score_gemma":0.0028365825,"threshold_uncertainty_score":0.045687318},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32504737,0.0025064442,0.6451411,0.0061848513,0.00016612269,0.000109623456,0.00031502786,0.0004149688,0.020114476],"genre_scores_gemma":[0.98013926,0.0010719497,0.015430461,0.00021264853,0.00009763103,0.000052047646,0.000071060276,0.000057895748,0.0028670481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516195,0.0027085843,0.0002009109,0.00052139687,0.00053707405,0.00087003637],"domain_scores_gemma":[0.9431377,0.045881655,0.005107364,0.0028014192,0.0017321439,0.001339716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009832664,0.0008202036,0.0019190812,0.0009595475,0.0009801291,0.0033918796,0.0014615274,0.0027109305,0.004681787],"category_scores_gemma":[0.052118495,0.0011925373,0.0008208902,0.0008739321,0.0037781927,0.0066109886,0.0017040279,0.0031597968,0.00058830704],"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.00091375556,0.00023232236,0.0032869892,0.0002593538,0.00017278138,0.0006629682,0.0005664171,0.44454393,0.0023024317,0.5151597,0.0027303542,0.029169025],"study_design_scores_gemma":[0.0001480029,0.0001848457,0.0017705109,0.00007840819,0.000055380704,0.00017501214,0.00023013022,0.5468787,0.0016886431,0.44695848,0.0017415478,0.00009028223],"about_ca_topic_score_codex":0.0023635298,"about_ca_topic_score_gemma":0.0013924331,"teacher_disagreement_score":0.009832664,"about_ca_system_score_codex":0.0025283776,"about_ca_system_score_gemma":0.0018832424,"threshold_uncertainty_score":0.0520007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41332877,0.0005934291,0.57262737,0.00085085846,0.00006986544,0.00016063328,0.0004199519,0.0003440856,0.011604984],"genre_scores_gemma":[0.9656393,0.00020629316,0.029845787,0.00004801515,0.000029494006,0.000086711436,0.00017596492,0.0000653019,0.003903182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991991,0.00033345658,0.000025046334,0.00014468573,0.00014276778,0.00015494769],"domain_scores_gemma":[0.99830425,0.0011567367,0.00019043947,0.00007693225,0.00013428423,0.00013743278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562667,0.0011601091,0.0011638104,0.00053413154,0.0005976141,0.0018380247,0.0014427986,0.0018563742,0.0038440847],"category_scores_gemma":[0.0049898895,0.000829241,0.0006488715,0.0010018736,0.0010267044,0.0028531323,0.0008924319,0.0012267418,0.00027184808],"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.00003727976,0.000014996407,0.00018366038,0.000016111813,0.000007714918,0.000056526915,0.000019817282,0.9943328,0.00028047417,0.0030950205,0.0001516104,0.0018041107],"study_design_scores_gemma":[0.000004905236,0.000018360259,0.000083918785,0.0000019875995,0.0000025773459,0.000010260341,0.000014524438,0.9972031,0.0001612934,0.0023648406,0.00012982641,0.0000044143276],"about_ca_topic_score_codex":0.012203372,"about_ca_topic_score_gemma":0.006619458,"teacher_disagreement_score":0.012203372,"about_ca_system_score_codex":0.0018978104,"about_ca_system_score_gemma":0.0013778041,"threshold_uncertainty_score":0.024264693},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114459924,0.0014124895,0.77885115,0.004298761,0.00030331008,0.0003337346,0.0028015461,0.0005986183,0.09694049],"genre_scores_gemma":[0.8988128,0.0008456912,0.040718842,0.00033928466,0.00012426535,0.0005008811,0.0007794328,0.00007584867,0.05780293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998976,0.0003045047,0.000039250204,0.0002580658,0.00017894473,0.00024311706],"domain_scores_gemma":[0.99840206,0.00082779815,0.00019386131,0.00011742729,0.00022529048,0.00023349242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010408191,0.0010041404,0.0015495392,0.00090235163,0.0011142503,0.0041893334,0.0048912205,0.0055062785,0.022356156],"category_scores_gemma":[0.002995364,0.0010452176,0.0013077828,0.0019242503,0.0019836796,0.0038914424,0.0017191825,0.0033016643,0.003003833],"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.00009695252,0.00014440856,0.00091069785,0.00010001888,0.000040885374,0.0004945927,0.00014478336,0.7683744,0.00078690896,0.22122112,0.0026955619,0.004989644],"study_design_scores_gemma":[0.000056749846,0.00006063136,0.00021848605,0.00001297726,0.000013465688,0.00008719557,0.00008118473,0.959663,0.00009099537,0.036377072,0.0033141535,0.000024083447],"about_ca_topic_score_codex":0.01682157,"about_ca_topic_score_gemma":0.011975003,"teacher_disagreement_score":0.022356156,"about_ca_system_score_codex":0.003271424,"about_ca_system_score_gemma":0.0018090663,"threshold_uncertainty_score":0.07478881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124225855,0.00013877294,0.87173814,0.00011517043,0.000021927206,0.00010671837,0.00008337576,0.00033858442,0.0032313948],"genre_scores_gemma":[0.863282,0.00009849365,0.13383567,0.00002559524,0.00001709594,0.0001950297,0.00010158103,0.000058707777,0.0023859255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994918,0.00017338563,0.000020258127,0.000114250295,0.00009401236,0.000106309926],"domain_scores_gemma":[0.99933726,0.0003141378,0.00011924235,0.0000742606,0.00007417694,0.0000808703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093719584,0.0005400901,0.001034555,0.00031894015,0.00057351333,0.0008043193,0.0012729435,0.00050625845,0.001664684],"category_scores_gemma":[0.0013186585,0.0005496699,0.00045645752,0.00071485597,0.0005614512,0.00074372586,0.00078760966,0.0005590016,0.00025871806],"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.00012960729,0.00004915844,0.00034438432,0.00004657109,0.000016241665,0.000073829775,0.000042301595,0.98001385,0.0033180225,0.004259822,0.00034840478,0.011357857],"study_design_scores_gemma":[0.000014444115,0.000045312903,0.00013508879,0.0000014684629,0.0000048076686,0.00000581368,0.000007958569,0.99678385,0.0008763581,0.0019520646,0.00016981218,0.0000029969844],"about_ca_topic_score_codex":0.004275589,"about_ca_topic_score_gemma":0.0054346956,"teacher_disagreement_score":0.004275589,"about_ca_system_score_codex":0.0008650499,"about_ca_system_score_gemma":0.0010583416,"threshold_uncertainty_score":0.0085014105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12502506,0.00223199,0.824735,0.009606341,0.00027024176,0.00040687737,0.0012505305,0.00020859792,0.036265433],"genre_scores_gemma":[0.88062274,0.0030109393,0.09699218,0.00078792026,0.00040199488,0.0008456214,0.0004751674,0.00011194989,0.016751459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981493,0.0012002826,0.000034701265,0.00019402157,0.00016729343,0.00025440933],"domain_scores_gemma":[0.99504197,0.003981775,0.0003908136,0.00007169765,0.00024590557,0.00026782858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034285872,0.0020040837,0.0021793926,0.0013148197,0.00086053566,0.0028136575,0.0019519904,0.0030756402,0.006746358],"category_scores_gemma":[0.007806465,0.0013141538,0.0015927455,0.0012811584,0.0014851474,0.0022702785,0.0016220857,0.002700055,0.0003481267],"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.00002781336,0.000041951724,0.00018914705,0.00003380058,0.000032571515,0.000033646946,0.000017440563,0.98067975,0.000079780635,0.016401537,0.0005715528,0.0018910603],"study_design_scores_gemma":[0.000023153409,0.000050841914,0.00016867458,0.000022387441,0.00002819623,0.000010408833,0.000048232014,0.97018754,0.0000671048,0.02873802,0.0006417769,0.000013699453],"about_ca_topic_score_codex":0.0156018725,"about_ca_topic_score_gemma":0.0115698185,"teacher_disagreement_score":0.0156018725,"about_ca_system_score_codex":0.0041929972,"about_ca_system_score_gemma":0.004997125,"threshold_uncertainty_score":0.031022131},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07381941,0.0030720318,0.8904259,0.0034924669,0.0003741414,0.00020841589,0.001084199,0.0003132234,0.027210213],"genre_scores_gemma":[0.91965115,0.0021639685,0.056393586,0.00043353435,0.00050303165,0.0002489825,0.000490238,0.00013775939,0.01997781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984937,0.0005499245,0.00007372744,0.00025089437,0.00034352735,0.0002883525],"domain_scores_gemma":[0.9984097,0.00083041977,0.00026243422,0.00015760677,0.00020609131,0.00013372993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013307154,0.0016293515,0.0017361168,0.00084044435,0.0007069713,0.0025963366,0.003036992,0.0022788665,0.0071862047],"category_scores_gemma":[0.0037670347,0.0008918509,0.0014957159,0.0022583394,0.0016504107,0.004337227,0.0019433015,0.002483883,0.00063087593],"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.000036224563,0.000030452342,0.00031856325,0.000104404804,0.000031549735,0.00022098263,0.000041170828,0.8489316,0.00055359263,0.14380251,0.0020651063,0.0038638331],"study_design_scores_gemma":[0.000019202778,0.00003377938,0.00017866002,0.000017585233,0.000015841046,0.000083892526,0.000020290476,0.9478977,0.000100376536,0.049257725,0.0023541306,0.000020958694],"about_ca_topic_score_codex":0.009357778,"about_ca_topic_score_gemma":0.005337848,"teacher_disagreement_score":0.009357778,"about_ca_system_score_codex":0.0026242214,"about_ca_system_score_gemma":0.0017571611,"threshold_uncertainty_score":0.024040222},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17684127,0.0015330487,0.76897806,0.0027093191,0.00019533772,0.00025183006,0.0015937614,0.00046165087,0.047435716],"genre_scores_gemma":[0.9681091,0.00069369015,0.014191905,0.00010740922,0.0000610984,0.00020720025,0.00028820013,0.000022942686,0.016318543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943954,0.00015481656,0.000019885012,0.00015194091,0.00009496276,0.0001388263],"domain_scores_gemma":[0.99951565,0.00018085429,0.00010460108,0.00001915115,0.00010127016,0.000078404024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080611435,0.0010106417,0.0010816137,0.00056919403,0.000576501,0.0023297854,0.0015359487,0.002077142,0.006127127],"category_scores_gemma":[0.0015262055,0.00063775264,0.00050426216,0.0008364592,0.0012004811,0.0013328341,0.0008603229,0.0011669414,0.00060854905],"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.00004876068,0.00003366533,0.00025598277,0.000028786311,0.000012180652,0.000073320014,0.000028929835,0.9691637,0.0003288665,0.027327027,0.00050384615,0.0021950542],"study_design_scores_gemma":[0.000021072125,0.000025224315,0.0000905212,0.0000037768964,0.000006976226,0.0000071107406,0.0000125698,0.9940712,0.000059479502,0.005284803,0.000410361,0.0000069519583],"about_ca_topic_score_codex":0.033873744,"about_ca_topic_score_gemma":0.010839763,"teacher_disagreement_score":0.033873744,"about_ca_system_score_codex":0.0024493448,"about_ca_system_score_gemma":0.0016754175,"threshold_uncertainty_score":0.06735313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61615986,0.005734659,0.23850937,0.07240208,0.0003310617,0.00019786487,0.0010582246,0.0004048622,0.06520201],"genre_scores_gemma":[0.99346185,0.0007530565,0.0042040027,0.00055909937,0.00012991791,0.00002957104,0.000034599492,0.00002728377,0.000800606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953164,0.0022471321,0.00017003423,0.00061008544,0.0007032348,0.00095308403],"domain_scores_gemma":[0.8449605,0.13881718,0.008374035,0.002818508,0.002379405,0.0026504442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010924249,0.0005776057,0.0017957815,0.0016487028,0.0028458245,0.006892761,0.0017170192,0.005874869,0.008679756],"category_scores_gemma":[0.13662042,0.00076145603,0.0011568122,0.0019013778,0.0068528587,0.015819266,0.003928098,0.0038195292,0.00032996424],"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.00080988946,0.00019914753,0.018487977,0.00045034857,0.00023150895,0.0022763084,0.0018078618,0.26708877,0.0014180222,0.6678997,0.0059480015,0.033382438],"study_design_scores_gemma":[0.00006208193,0.000072214025,0.0025259834,0.000052570103,0.000050028066,0.00023943701,0.000987746,0.114530265,0.0003991951,0.8797475,0.0012688125,0.00006416371],"about_ca_topic_score_codex":0.00580721,"about_ca_topic_score_gemma":0.00484463,"teacher_disagreement_score":0.010924249,"about_ca_system_score_codex":0.0027796202,"about_ca_system_score_gemma":0.0023938606,"threshold_uncertainty_score":0.05777365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21244025,0.0020287654,0.69235986,0.0058683925,0.00034913345,0.00035555346,0.0014987288,0.00035480422,0.084744506],"genre_scores_gemma":[0.94350123,0.0009797221,0.025581706,0.00038751814,0.00028963573,0.00018462446,0.00026398076,0.000046713903,0.028764952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991437,0.0002708132,0.00003672084,0.00018617212,0.00018016426,0.0001824299],"domain_scores_gemma":[0.99856985,0.0006653472,0.0003708067,0.00013137997,0.000101901074,0.00016074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014194909,0.0006842395,0.0013836123,0.0005265185,0.00075903995,0.0022031004,0.0019986122,0.0022253012,0.0102768345],"category_scores_gemma":[0.0031527786,0.00079572987,0.0010921056,0.0010017802,0.0010441542,0.0037754744,0.001284513,0.0016694011,0.00091606233],"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.0002632298,0.00015186376,0.002147282,0.00019634327,0.000096492746,0.0012643889,0.00028685553,0.4638799,0.0042666537,0.512809,0.004459159,0.010178788],"study_design_scores_gemma":[0.00012457813,0.0001966918,0.00077993685,0.000031021627,0.00005848595,0.00053918053,0.00012344937,0.846996,0.0005012573,0.14381301,0.0067730215,0.000063408384],"about_ca_topic_score_codex":0.0034079866,"about_ca_topic_score_gemma":0.0028518506,"teacher_disagreement_score":0.0102768345,"about_ca_system_score_codex":0.0013832888,"about_ca_system_score_gemma":0.0012932873,"threshold_uncertainty_score":0.034379423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003590093,0.00087059493,0.98349947,0.00045389755,0.00010315677,0.00009450069,0.00017276726,0.00015696052,0.011058476],"genre_scores_gemma":[0.08194564,0.0025766864,0.90744543,0.00043595606,0.00033044993,0.00042323433,0.0011443752,0.0003393049,0.005358898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980363,0.0005242898,0.00013462847,0.00038457086,0.00072380836,0.00019632801],"domain_scores_gemma":[0.997468,0.0015383138,0.00027115617,0.000320712,0.00029963857,0.00010220847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018729201,0.0016260403,0.0015202289,0.0019307717,0.0009982279,0.0038463,0.0031338956,0.0015525963,0.005736401],"category_scores_gemma":[0.00556503,0.0010077487,0.0015203006,0.003583286,0.0019450012,0.005721294,0.00217376,0.004956875,0.001553108],"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.00027905995,0.00040041938,0.00071579556,0.00053604064,0.00006121715,0.00014937037,0.00019091011,0.35159296,0.00305961,0.36474553,0.016107338,0.2621618],"study_design_scores_gemma":[0.00007729314,0.00008961656,0.00022840001,0.000122772,0.00003030439,0.00013638621,0.00006501483,0.66361415,0.0021432422,0.32042757,0.013033392,0.000031808377],"about_ca_topic_score_codex":0.0030869613,"about_ca_topic_score_gemma":0.003643803,"teacher_disagreement_score":0.005736401,"about_ca_system_score_codex":0.0020909212,"about_ca_system_score_gemma":0.0015330374,"threshold_uncertainty_score":0.019190192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1556595,0.00057609915,0.83269596,0.0005830234,0.000075694414,0.00019204228,0.00019672398,0.0004077693,0.009613128],"genre_scores_gemma":[0.81414753,0.0002446173,0.18109608,0.0001378836,0.000045246245,0.00019821769,0.00023891267,0.00016380486,0.003727705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847966,0.00067034265,0.00005598201,0.0002930924,0.00023328041,0.00026764156],"domain_scores_gemma":[0.99764997,0.0014728876,0.00024136162,0.00019662423,0.00019908223,0.00024011658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016237948,0.00074351014,0.0009827431,0.0005567818,0.0008148367,0.0014493543,0.0027535788,0.0009477093,0.0052853483],"category_scores_gemma":[0.0040119584,0.0008439348,0.0006531635,0.0017769701,0.00094067276,0.0019000139,0.0010940117,0.001697366,0.00045309134],"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.00042009517,0.00016915592,0.00083172024,0.00015911307,0.00006297675,0.0002246256,0.00025297882,0.9292693,0.0039696675,0.02760984,0.0020198748,0.03501067],"study_design_scores_gemma":[0.000039704642,0.00006231882,0.00020996446,0.0000069151133,0.000013710466,0.000062024796,0.00005431579,0.98663425,0.001148737,0.010508717,0.001249799,0.000009495802],"about_ca_topic_score_codex":0.0037074273,"about_ca_topic_score_gemma":0.0031427343,"teacher_disagreement_score":0.0052853483,"about_ca_system_score_codex":0.0013473174,"about_ca_system_score_gemma":0.0010529362,"threshold_uncertainty_score":0.017681241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60977435,0.0028412493,0.20881633,0.008501849,0.00020279996,0.000536684,0.0009363841,0.000110031324,0.16828029],"genre_scores_gemma":[0.9806748,0.0012901819,0.00625432,0.000119754135,0.00008083675,0.00016822842,0.00013924936,0.000021115295,0.01125161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989436,0.0004937502,0.000021503585,0.000091865455,0.00015270757,0.00029651792],"domain_scores_gemma":[0.9975943,0.0014814435,0.0003558336,0.000074335956,0.00021512325,0.000278948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020409536,0.0006777608,0.0005782163,0.0014243354,0.0014691841,0.003025733,0.0011234676,0.0018311344,0.008864289],"category_scores_gemma":[0.007598872,0.000616025,0.0008621398,0.0014985078,0.0020147804,0.0052931006,0.0013815917,0.0017290538,0.00035904182],"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.0001476419,0.00011856258,0.002462567,0.00007986985,0.00004480891,0.00027186103,0.00012612125,0.36810777,0.0006991694,0.6128392,0.0045185382,0.010583802],"study_design_scores_gemma":[0.00006416072,0.000112769136,0.002662941,0.00005186092,0.000050270024,0.000120290926,0.0004065904,0.77642643,0.00024075732,0.21442251,0.005397738,0.000043677435],"about_ca_topic_score_codex":0.010087211,"about_ca_topic_score_gemma":0.0069857715,"teacher_disagreement_score":0.010087211,"about_ca_system_score_codex":0.007254013,"about_ca_system_score_gemma":0.002384683,"threshold_uncertainty_score":0.052631855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9227902,0.0016482932,0.030890692,0.005882655,0.0003778861,0.00009218779,0.0004259073,0.00035728028,0.037534837],"genre_scores_gemma":[0.9983188,0.00016715247,0.0006209621,0.0000824738,0.000039968196,0.0000056130925,0.000024424937,0.000014270056,0.00072627806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449027,0.0023209688,0.0002150189,0.0006195649,0.001011532,0.0013426455],"domain_scores_gemma":[0.8466384,0.12685068,0.0123803085,0.004199157,0.005886294,0.0040452126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075709512,0.0007404601,0.00083265925,0.0008186034,0.0012720077,0.0038030937,0.0015330629,0.0031239544,0.010064343],"category_scores_gemma":[0.08496747,0.0006523525,0.00054026436,0.00065497216,0.0016724421,0.004334572,0.001854283,0.004049808,0.00066713226],"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.0065901075,0.0016463496,0.035137136,0.00052102987,0.0002661301,0.0034580128,0.0010843718,0.6723939,0.022415265,0.16754816,0.009911243,0.07902831],"study_design_scores_gemma":[0.0008991055,0.0038022974,0.03377133,0.00017847533,0.0006289507,0.0016483931,0.0034789967,0.8096583,0.01937824,0.116098106,0.0100346245,0.00042321664],"about_ca_topic_score_codex":0.012093183,"about_ca_topic_score_gemma":0.004976604,"teacher_disagreement_score":0.012093183,"about_ca_system_score_codex":0.0039068195,"about_ca_system_score_gemma":0.002312138,"threshold_uncertainty_score":0.04003948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030636012,0.00030628036,0.9945338,0.0001875489,0.000029741093,0.00002206489,0.0000145062395,0.000055498167,0.0017869589],"genre_scores_gemma":[0.25446102,0.00087554456,0.7386757,0.0002883351,0.00009133054,0.00032653712,0.00008241323,0.00018855835,0.0050105187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992518,0.0003587947,0.00002377853,0.00007439984,0.00025528955,0.000035891706],"domain_scores_gemma":[0.9989826,0.00064425415,0.00009064871,0.00010852665,0.00014178186,0.000032086966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001566624,0.0011613136,0.0011121676,0.0009282097,0.00044780498,0.00070127565,0.0007771434,0.0009783012,0.0015725797],"category_scores_gemma":[0.0030253716,0.0004792835,0.0014416545,0.0009878903,0.0012003495,0.000691619,0.001547595,0.0016928973,0.00025128067],"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.000010458291,0.000017834369,0.00016982129,0.00006787448,0.00003007807,0.000030351264,0.000030395957,0.9493763,0.0012808794,0.027121829,0.00044255835,0.021421645],"study_design_scores_gemma":[0.0000044223816,0.000012818389,0.00004980891,0.0000069793605,0.000004404586,0.000014545833,0.0000047980247,0.98275226,0.00031012105,0.015603565,0.0012306059,0.000005637389],"about_ca_topic_score_codex":0.0035848082,"about_ca_topic_score_gemma":0.003272724,"teacher_disagreement_score":0.0035848082,"about_ca_system_score_codex":0.0008705661,"about_ca_system_score_gemma":0.0010602803,"threshold_uncertainty_score":0.008285165},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002040745,0.0021432757,0.9929972,0.0002942324,0.000047865306,0.00007516946,0.00006547149,0.000046500416,0.0022895643],"genre_scores_gemma":[0.24646947,0.0077528004,0.74121636,0.00026474765,0.0002989351,0.0009775329,0.00032817342,0.00015286652,0.0025390906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96730274,0.021553377,0.0020023757,0.0026842814,0.005773913,0.0006833839],"domain_scores_gemma":[0.9721737,0.022567192,0.0014950368,0.0017126891,0.0018738036,0.00017758038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02899996,0.0024530923,0.0028389532,0.004841358,0.0011005062,0.005323265,0.0019998585,0.0023414376,0.0019883153],"category_scores_gemma":[0.055454087,0.0013282729,0.0027829623,0.010360102,0.0035309233,0.0051223924,0.0038912965,0.004904852,0.00063076743],"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.00004168823,0.00005975357,0.0013181138,0.00043966403,0.00024338232,0.00016672921,0.00028021523,0.33887187,0.00057940703,0.5883673,0.0012577529,0.06837406],"study_design_scores_gemma":[0.000015265834,0.00005148923,0.0005724317,0.000170522,0.00004713769,0.00007814218,0.00008907332,0.5524374,0.0011774523,0.4347669,0.010513666,0.00008053476],"about_ca_topic_score_codex":0.0048541776,"about_ca_topic_score_gemma":0.0023907265,"teacher_disagreement_score":0.02899996,"about_ca_system_score_codex":0.004169864,"about_ca_system_score_gemma":0.0034747797,"threshold_uncertainty_score":0.15336823},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013470863,0.00048574278,0.9775238,0.00032408434,0.000056596527,0.00015213754,0.00025341325,0.00018042931,0.0075529716],"genre_scores_gemma":[0.54936904,0.00077084644,0.44494158,0.00020252523,0.00010674249,0.0006685733,0.0006067677,0.00015204697,0.0031818952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893412,0.0067966725,0.0004060478,0.001615423,0.0013151764,0.0005254944],"domain_scores_gemma":[0.9829464,0.011959751,0.0016515856,0.0015415684,0.0016388579,0.00026184664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013088204,0.0016741403,0.0020243071,0.0015458342,0.00085505174,0.0035852,0.0029655714,0.0017280846,0.0058061862],"category_scores_gemma":[0.029087324,0.001177874,0.0020001964,0.00251789,0.0016783647,0.004350244,0.0038244494,0.0044320477,0.000827805],"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.00013688594,0.000072943265,0.0017887489,0.00016023763,0.00009973395,0.00012301226,0.00017086968,0.7709829,0.0006025705,0.1930163,0.001278115,0.031567637],"study_design_scores_gemma":[0.00001826904,0.000061561135,0.00043694407,0.000036159254,0.00002395231,0.000053888278,0.000047431047,0.9458249,0.0005409283,0.048050437,0.0048714685,0.000034116092],"about_ca_topic_score_codex":0.007665229,"about_ca_topic_score_gemma":0.0070342645,"teacher_disagreement_score":0.013088204,"about_ca_system_score_codex":0.002835508,"about_ca_system_score_gemma":0.0032935964,"threshold_uncertainty_score":0.06921792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10387748,0.00073019764,0.87714326,0.0014246531,0.00009014859,0.0009609625,0.00061892695,0.00024870512,0.01490561],"genre_scores_gemma":[0.44255528,0.00060039427,0.55440646,0.00015992741,0.000057426685,0.0007934741,0.00057065574,0.000038597973,0.0008178204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.983042,0.0095547205,0.0017490429,0.0009354964,0.004140756,0.0005780369],"domain_scores_gemma":[0.95252126,0.031946626,0.0047821007,0.0025139053,0.0069998456,0.001236231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023393901,0.0010047159,0.0010624967,0.0067132525,0.000885116,0.0048638615,0.0011578089,0.0012596876,0.0017314581],"category_scores_gemma":[0.05349406,0.00035924022,0.0007961676,0.0046656653,0.0019635602,0.0055603483,0.002011346,0.0015939244,0.0005179711],"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.0006495922,0.0008217185,0.069676474,0.001220802,0.00033366674,0.00031207883,0.0019299458,0.08180372,0.00804502,0.4645421,0.007830446,0.36283448],"study_design_scores_gemma":[0.00032532477,0.0015505399,0.027071718,0.0011556171,0.00037579416,0.00047740043,0.004815294,0.2555742,0.02279208,0.6426617,0.042725522,0.00047481098],"about_ca_topic_score_codex":0.0010220367,"about_ca_topic_score_gemma":0.0011722137,"teacher_disagreement_score":0.023393901,"about_ca_system_score_codex":0.0015715931,"about_ca_system_score_gemma":0.0022015802,"threshold_uncertainty_score":0.12372023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061519453,0.00010502218,0.98893505,0.000215243,0.000042951207,0.00009754793,0.000066285,0.00058108545,0.0038048578],"genre_scores_gemma":[0.07859681,0.000114488095,0.9174724,0.0002364251,0.000025660727,0.00034240386,0.00029820795,0.00018124162,0.0027323884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999275,0.0002462699,0.00003656128,0.00016030866,0.00015477765,0.00012704117],"domain_scores_gemma":[0.9992048,0.00039793193,0.00012004838,0.000088281144,0.00012885072,0.000060077706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012280535,0.0012727203,0.0008162195,0.00095639005,0.0006975752,0.0011230417,0.0019312918,0.0015312968,0.00559072],"category_scores_gemma":[0.0032297678,0.00057340536,0.00095416966,0.001226386,0.00079197926,0.0012282109,0.0014059833,0.0015013096,0.0013031084],"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.0004009783,0.00027145186,0.00077310565,0.00016901622,0.000053724125,0.00013405227,0.00022086671,0.5975805,0.0043251873,0.044512223,0.0103545105,0.3412044],"study_design_scores_gemma":[0.0000774475,0.00010163335,0.00007252665,0.000019919795,0.000010383252,0.00005507012,0.000036032885,0.98394704,0.0012203442,0.010909127,0.003536226,0.0000143653515],"about_ca_topic_score_codex":0.0034874785,"about_ca_topic_score_gemma":0.004505265,"teacher_disagreement_score":0.00559072,"about_ca_system_score_codex":0.0015108522,"about_ca_system_score_gemma":0.0022729435,"threshold_uncertainty_score":0.018702805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21327265,0.00061804045,0.761179,0.0012472942,0.0000890089,0.00036333452,0.00017085901,0.00035394475,0.022705875],"genre_scores_gemma":[0.95425177,0.00024322276,0.037854157,0.00018481139,0.00004141008,0.0001325067,0.000045604902,0.00003882212,0.007207666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.0001822816,0.0000308358,0.00014081494,0.00015120656,0.00018987323],"domain_scores_gemma":[0.99878544,0.00049151294,0.0002912909,0.0000655348,0.00016138243,0.00020492433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014344313,0.0009266395,0.0011502337,0.00064034533,0.000897728,0.002255835,0.0021752953,0.0013317626,0.004518353],"category_scores_gemma":[0.0025746564,0.0005358485,0.0007760837,0.00058482797,0.0010183753,0.001426393,0.0017091646,0.0010635331,0.00048907864],"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.00029425407,0.00024319711,0.0013403418,0.0001665828,0.00007079262,0.0003514064,0.00032234212,0.8599731,0.006419954,0.094764024,0.003307023,0.03274709],"study_design_scores_gemma":[0.00003326984,0.0001009914,0.0002584184,0.000011597403,0.000017738517,0.000037220358,0.000066526576,0.9829556,0.00061233237,0.015286945,0.00060200144,0.000017298298],"about_ca_topic_score_codex":0.00849046,"about_ca_topic_score_gemma":0.0056890594,"teacher_disagreement_score":0.00849046,"about_ca_system_score_codex":0.002946405,"about_ca_system_score_gemma":0.0017883222,"threshold_uncertainty_score":0.021377802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10888236,0.00096670113,0.88098556,0.000479432,0.00014505323,0.00019592824,0.00020047951,0.000471937,0.0076725576],"genre_scores_gemma":[0.94136804,0.00039114885,0.05417078,0.00008934623,0.000056237543,0.00011084156,0.00013908588,0.00014594421,0.0035285628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988789,0.00033451658,0.000046122823,0.00018457134,0.0002465437,0.00030944514],"domain_scores_gemma":[0.99842596,0.0009797006,0.00018704243,0.00007175669,0.00015601386,0.00017960269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025333816,0.0016773056,0.0023714572,0.0010156686,0.0005875822,0.0019900147,0.0019222484,0.00134098,0.0031697673],"category_scores_gemma":[0.006092816,0.0014700888,0.0010645685,0.0015089795,0.00095257285,0.0024226983,0.0009551124,0.0019253121,0.0003599651],"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.000065959524,0.00003948831,0.00022066207,0.00004192155,0.000019173767,0.000033281933,0.00002859273,0.9840248,0.00049046724,0.00576256,0.00043311497,0.008839957],"study_design_scores_gemma":[0.000008468946,0.000017661996,0.00004054122,0.0000031030645,0.00000517639,0.000007103703,0.000006663836,0.99697614,0.0001271619,0.0026050915,0.00019829295,0.00000466755],"about_ca_topic_score_codex":0.008300386,"about_ca_topic_score_gemma":0.006556235,"teacher_disagreement_score":0.008300386,"about_ca_system_score_codex":0.0035181937,"about_ca_system_score_gemma":0.0018125353,"threshold_uncertainty_score":0.025526404},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24861562,0.008689317,0.70655215,0.0005164364,0.00035511152,0.00044273038,0.0003791143,0.0026242768,0.031825256],"genre_scores_gemma":[0.5191023,0.00268885,0.47430888,0.00015715149,0.000076785596,0.00018005037,0.00043726442,0.00018116459,0.0028676323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881953,0.00045665458,0.00006813435,0.00014224816,0.0003321428,0.00018122625],"domain_scores_gemma":[0.9970289,0.0020278685,0.00021034757,0.0002876084,0.00034277915,0.00010248901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016738231,0.001092511,0.0009839714,0.0014168837,0.00059017097,0.00095450744,0.0022393481,0.0011876278,0.0025491065],"category_scores_gemma":[0.0058040232,0.0004894809,0.0007681425,0.0023518766,0.00065174664,0.0015849952,0.00074409845,0.00075727777,0.0004721813],"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.00040447444,0.00028705064,0.0013746133,0.0002956844,0.00008746184,0.0001053454,0.00012844503,0.8108758,0.0013139731,0.010903734,0.0023639349,0.17185944],"study_design_scores_gemma":[0.00014439804,0.0002600598,0.0008288608,0.00004874938,0.000051499726,0.00011756004,0.00013673106,0.98680484,0.001848674,0.006749557,0.0029825717,0.000026399814],"about_ca_topic_score_codex":0.0064890315,"about_ca_topic_score_gemma":0.0077458736,"teacher_disagreement_score":0.0064890315,"about_ca_system_score_codex":0.0014409388,"about_ca_system_score_gemma":0.001625193,"threshold_uncertainty_score":0.012902558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031006955,0.0011636354,0.94598806,0.0019024789,0.00020143519,0.000094273746,0.00015769404,0.00026462862,0.01922079],"genre_scores_gemma":[0.9189481,0.0011489835,0.0674514,0.00022881546,0.00036879745,0.00016335653,0.00016734208,0.00010392657,0.011419202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972217,0.0009925496,0.00010188284,0.00044671167,0.0007370395,0.0005000939],"domain_scores_gemma":[0.9967675,0.001957336,0.00043454044,0.00030104304,0.00030261523,0.00023696318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028951024,0.0011909867,0.0012759921,0.00062516134,0.00078321074,0.004119623,0.0029952317,0.0027068031,0.005280222],"category_scores_gemma":[0.008280079,0.00087375136,0.0009937272,0.0011169506,0.0027399801,0.007213472,0.0016674481,0.0032604872,0.0007251636],"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.00008255532,0.000077144,0.00029229364,0.00006272642,0.000021862259,0.00013362228,0.000085104046,0.5503264,0.00067981187,0.43264997,0.0018989707,0.013689509],"study_design_scores_gemma":[0.000037944013,0.000049445203,0.00008405508,0.00001260543,0.000010337743,0.000048845526,0.000020563999,0.8398106,0.00025129656,0.15693025,0.0027265057,0.000017487677],"about_ca_topic_score_codex":0.0040616803,"about_ca_topic_score_gemma":0.002078344,"teacher_disagreement_score":0.005280222,"about_ca_system_score_codex":0.0029134771,"about_ca_system_score_gemma":0.0021774834,"threshold_uncertainty_score":0.021138847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40603238,0.0008362895,0.5682554,0.0028847381,0.0002101309,0.0002454665,0.0008489502,0.00028366657,0.020403016],"genre_scores_gemma":[0.9800765,0.00024472844,0.01606954,0.00008434873,0.00007363808,0.000078021134,0.000168095,0.00002344488,0.0031817085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710387,0.0011668629,0.00011487959,0.0006461336,0.00034182295,0.00062643905],"domain_scores_gemma":[0.9953145,0.0035158184,0.0005918618,0.00023197476,0.00012795869,0.00021798664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035482545,0.00084105483,0.0014682994,0.00065592764,0.0009299501,0.002726686,0.0016667459,0.0026014922,0.0052087777],"category_scores_gemma":[0.009509348,0.0017659083,0.0014293649,0.0018384325,0.0013855749,0.0037537264,0.0008888121,0.0020963277,0.0003898366],"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.0002739932,0.00013850517,0.0031905673,0.000096381664,0.00009259718,0.0006162335,0.00018457083,0.8961658,0.0013156767,0.08213414,0.001261649,0.014529858],"study_design_scores_gemma":[0.000042480606,0.00004349153,0.001386846,0.000007174026,0.000037380585,0.00009739983,0.000099175864,0.9620068,0.0004228278,0.034898456,0.00092765386,0.00003037626],"about_ca_topic_score_codex":0.007359448,"about_ca_topic_score_gemma":0.0073535177,"teacher_disagreement_score":0.007359448,"about_ca_system_score_codex":0.002384667,"about_ca_system_score_gemma":0.0015865805,"threshold_uncertainty_score":0.018765152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009042104,0.00015999326,0.9901805,0.00008154482,0.000014894854,0.00002484407,0.000025500653,0.00012878976,0.00034181133],"genre_scores_gemma":[0.8015152,0.0006108119,0.19512881,0.00013545608,0.0000858526,0.0002859399,0.00019702408,0.000079663405,0.0019611472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780506,0.0010624885,0.0001167409,0.00040319673,0.0004569532,0.00015562997],"domain_scores_gemma":[0.9870047,0.009781703,0.0011342507,0.00076725025,0.0010964761,0.0002156182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006527887,0.00087746244,0.0018985213,0.0009646918,0.00036429995,0.0012891736,0.0019733892,0.0011041594,0.0015385412],"category_scores_gemma":[0.02019422,0.0006518162,0.0008668855,0.0008988827,0.0015826268,0.0019790262,0.0013358168,0.0020647144,0.00027605655],"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.00009142322,0.000047522648,0.0012051357,0.00007996555,0.00008212274,0.000050557548,0.000091326154,0.9247921,0.0011417049,0.046905078,0.00048823454,0.025024848],"study_design_scores_gemma":[0.000014244659,0.000025820103,0.0001230037,0.0000059630497,0.000007815001,0.000010454186,0.0000042204706,0.9895991,0.0002696651,0.009727813,0.00020069108,0.000011154274],"about_ca_topic_score_codex":0.003062447,"about_ca_topic_score_gemma":0.0016021462,"teacher_disagreement_score":0.006527887,"about_ca_system_score_codex":0.0011955258,"about_ca_system_score_gemma":0.0014794933,"threshold_uncertainty_score":0.03452319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6304387,0.000632398,0.35961312,0.00044313958,0.00012874616,0.0002049458,0.00045023477,0.00021639037,0.0078724],"genre_scores_gemma":[0.9636305,0.00028497996,0.033148702,0.000022272448,0.00004002821,0.00007404895,0.00018876143,0.000028518316,0.002582164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996032,0.00010699677,0.00001812703,0.00008371629,0.000058829235,0.00012916459],"domain_scores_gemma":[0.9994542,0.00025061893,0.00009418597,0.00006155344,0.000033406235,0.00010605277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146198,0.0009602165,0.000990514,0.00044025632,0.0009933113,0.00091793644,0.001227235,0.0009532733,0.0034364525],"category_scores_gemma":[0.0010534544,0.0005497686,0.00076061767,0.0009976028,0.00090362376,0.0010889978,0.00067970075,0.00061001943,0.00027249576],"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.0005800719,0.00009266282,0.0009758198,0.000117629,0.00003381892,0.0005902156,0.00009097002,0.9610624,0.009606237,0.009842323,0.00079807977,0.016209738],"study_design_scores_gemma":[0.000045182696,0.00017770955,0.00081974897,0.0000044655217,0.000014574245,0.000054355292,0.00005303057,0.99011266,0.002121829,0.005670773,0.0009091946,0.000016470147],"about_ca_topic_score_codex":0.009952024,"about_ca_topic_score_gemma":0.005140662,"teacher_disagreement_score":0.009952024,"about_ca_system_score_codex":0.00096721173,"about_ca_system_score_gemma":0.0007117732,"threshold_uncertainty_score":0.019788146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030101614,0.00010216454,0.9645921,0.00023917314,0.000011366466,0.00008063879,0.00016612225,0.000081554026,0.0046251956],"genre_scores_gemma":[0.6694793,0.00034294385,0.32579756,0.00017851926,0.000080960024,0.00054996903,0.00033098905,0.000079591984,0.0031601966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886779,0.0058808583,0.000658824,0.0012387317,0.0028516992,0.0006919169],"domain_scores_gemma":[0.9750401,0.017613783,0.0018378135,0.0028875307,0.0020442936,0.00057656533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012187989,0.0010972725,0.0017002051,0.0018871354,0.00078669534,0.0026725803,0.0014053984,0.0013276455,0.002420003],"category_scores_gemma":[0.031447228,0.00070319965,0.0020933233,0.0026259392,0.0021942945,0.005500738,0.002713452,0.0033275636,0.0007511342],"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.00009572793,0.00014101199,0.0030791012,0.0001316435,0.000118677446,0.00032407793,0.0005650872,0.13013531,0.002522456,0.8003528,0.0013231928,0.061210953],"study_design_scores_gemma":[0.000022908738,0.00009611415,0.0017972044,0.000040616138,0.000022338229,0.00028489553,0.000079361926,0.40868354,0.0014329355,0.585233,0.002264057,0.000043106298],"about_ca_topic_score_codex":0.0007838267,"about_ca_topic_score_gemma":0.0005364441,"teacher_disagreement_score":0.012187989,"about_ca_system_score_codex":0.0015158426,"about_ca_system_score_gemma":0.0012933864,"threshold_uncertainty_score":0.064457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58354694,0.0004996362,0.4076715,0.00027351972,0.000050641534,0.00015581117,0.00012542054,0.0004690574,0.0072074085],"genre_scores_gemma":[0.8803535,0.000390401,0.11539817,0.00006142118,0.000020485846,0.0001469253,0.00013185178,0.00013538064,0.0033618275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999683,0.000067358495,0.000008935681,0.000050230068,0.00006486822,0.0001256784],"domain_scores_gemma":[0.9994123,0.00032248558,0.00008000658,0.000033961733,0.000052409585,0.0000987859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834854,0.0009266523,0.00076147343,0.00071495544,0.00075016456,0.0006973197,0.0008900516,0.00077534624,0.0017655393],"category_scores_gemma":[0.0019265421,0.00051929074,0.00033887572,0.0006663885,0.0007428366,0.0007791192,0.0006102848,0.00041016,0.0002052453],"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.00009564478,0.00004519112,0.0002872296,0.000056519886,0.000012994156,0.00005537433,0.000048274313,0.9787692,0.004752141,0.0057416623,0.00033540573,0.009800323],"study_design_scores_gemma":[0.00002946005,0.0001011413,0.00017383494,0.00000805092,0.00001469759,0.000029944333,0.000028143515,0.9884192,0.0025066969,0.008149774,0.0005298111,0.000009260077],"about_ca_topic_score_codex":0.007072453,"about_ca_topic_score_gemma":0.0046059396,"teacher_disagreement_score":0.007072453,"about_ca_system_score_codex":0.0010557108,"about_ca_system_score_gemma":0.001652336,"threshold_uncertainty_score":0.014062583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041889377,0.0009806256,0.9269715,0.0016151048,0.00018462191,0.00029415853,0.0012584695,0.00050122465,0.026304934],"genre_scores_gemma":[0.6781659,0.0016573553,0.28930914,0.00044916663,0.0002957098,0.00072086346,0.0017488742,0.00023650206,0.027416453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966774,0.0013790653,0.00014710336,0.00059900974,0.00051535096,0.0006821622],"domain_scores_gemma":[0.9976611,0.0013770616,0.00026391086,0.00024517506,0.00023984142,0.00021287835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017582707,0.0012841278,0.0019488065,0.0009917638,0.0011618802,0.003035065,0.004058279,0.0032241724,0.010099808],"category_scores_gemma":[0.0056078555,0.00091612205,0.0010036286,0.004411194,0.0012976087,0.0035891386,0.0023873625,0.0017994401,0.0014157338],"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.00024225347,0.00015602875,0.0004969533,0.00031019797,0.000076626035,0.0004675034,0.000085674146,0.8429959,0.0006708675,0.09364753,0.010781499,0.050068986],"study_design_scores_gemma":[0.00006051109,0.000048270755,0.00018534821,0.000025769508,0.000024406154,0.00021049987,0.0000889945,0.91568804,0.00047664702,0.07728333,0.0058873356,0.000020846126],"about_ca_topic_score_codex":0.0070491983,"about_ca_topic_score_gemma":0.0052894237,"teacher_disagreement_score":0.010099808,"about_ca_system_score_codex":0.0021972477,"about_ca_system_score_gemma":0.0025123525,"threshold_uncertainty_score":0.03378719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5129147,0.00039506605,0.47633997,0.00027608266,0.00003837796,0.00010216199,0.00012923394,0.00055510283,0.00924927],"genre_scores_gemma":[0.9846081,0.00006939239,0.013793136,0.000015614949,0.000010844532,0.000029161245,0.000051859763,0.000027874245,0.001394044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956125,0.0001291769,0.000015917412,0.00009528895,0.00006711247,0.00013121025],"domain_scores_gemma":[0.9993987,0.00029112003,0.00014004264,0.000036244517,0.000069771595,0.000064063206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061732804,0.0006584941,0.00082724355,0.00045784152,0.0005149051,0.0011331711,0.0006889376,0.00068602955,0.0013966059],"category_scores_gemma":[0.0016280937,0.0003793822,0.0003120566,0.0005713655,0.0007407544,0.00058861385,0.00052070984,0.00047553625,0.00016452395],"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.00009176569,0.000029929219,0.0002457858,0.00002160302,0.000009495584,0.000021623713,0.000026901089,0.98980635,0.0018758705,0.0018704479,0.00016582568,0.0058343513],"study_design_scores_gemma":[0.000017560833,0.000043367836,0.00018935952,0.0000016111844,0.0000035348312,0.0000037456443,0.000013391351,0.997988,0.0005203488,0.0010162762,0.0001988961,0.000003964559],"about_ca_topic_score_codex":0.01811061,"about_ca_topic_score_gemma":0.011598329,"teacher_disagreement_score":0.01811061,"about_ca_system_score_codex":0.0012980074,"about_ca_system_score_gemma":0.0012359557,"threshold_uncertainty_score":0.036010385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6630585,0.00062119204,0.31619576,0.0021866357,0.00013920087,0.000118056705,0.000577034,0.00040418407,0.0166994],"genre_scores_gemma":[0.9886258,0.00025608076,0.005067977,0.00007727833,0.000045738463,0.000046263496,0.00007750307,0.000035950106,0.0057673506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823296,0.0005841033,0.00008176356,0.00034871564,0.00026242732,0.0004900081],"domain_scores_gemma":[0.9894069,0.0061348677,0.0026132772,0.00050199474,0.00073649385,0.0006065491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029771253,0.001520672,0.0025473733,0.0008070763,0.00087945745,0.002622724,0.002242981,0.0028766256,0.0052868077],"category_scores_gemma":[0.008686273,0.0012746255,0.001493037,0.0007876592,0.002679929,0.004302676,0.0013384778,0.0023545732,0.0006155701],"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.00048793235,0.00014441366,0.001264424,0.00010835492,0.00009113424,0.0007084325,0.00019500297,0.9075161,0.0038347186,0.08049746,0.00097651867,0.0041754767],"study_design_scores_gemma":[0.00011407264,0.0001237575,0.00051614037,0.000009800855,0.000050276925,0.00007943998,0.0000844464,0.968328,0.00047797637,0.029828824,0.0003366228,0.000050630577],"about_ca_topic_score_codex":0.006415646,"about_ca_topic_score_gemma":0.0035565828,"teacher_disagreement_score":0.006415646,"about_ca_system_score_codex":0.0025930307,"about_ca_system_score_gemma":0.001299672,"threshold_uncertainty_score":0.018813789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014723284,0.0001428628,0.9809441,0.00009682626,0.00003055456,0.000044529606,0.000049636023,0.000099697034,0.0038685796],"genre_scores_gemma":[0.60090464,0.00054322963,0.39060658,0.00007806896,0.000040099516,0.00023174193,0.0002836763,0.000101917394,0.007210053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997557,0.00008525857,0.0000084083185,0.00004295861,0.00007124864,0.000036335037],"domain_scores_gemma":[0.99984,0.00007130223,0.000023518385,0.000010061734,0.00003865379,0.000016548733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042363428,0.00072071166,0.00037712508,0.00049907266,0.00036096975,0.00071125577,0.0007899537,0.0005722814,0.0033488588],"category_scores_gemma":[0.00096094137,0.0002635291,0.00060402794,0.0006069625,0.00042835478,0.0007510891,0.00061369734,0.00065772794,0.00029382715],"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.00002103739,0.000013172171,0.00014420412,0.000038293758,0.000008773553,0.000036007157,0.000025035084,0.9620664,0.0013495649,0.018067384,0.0005416985,0.017688435],"study_design_scores_gemma":[0.0000035338926,0.000014457902,0.000025192172,0.0000037583236,0.0000027500103,0.000008791283,0.000009538454,0.993638,0.0002932501,0.0049886596,0.0010102753,0.0000018290947],"about_ca_topic_score_codex":0.0072548124,"about_ca_topic_score_gemma":0.009026633,"teacher_disagreement_score":0.0072548124,"about_ca_system_score_codex":0.001268939,"about_ca_system_score_gemma":0.00131074,"threshold_uncertainty_score":0.0144251585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010685488,0.0001509713,0.99525744,0.00024164704,0.000024611192,0.00004661906,0.00003212863,0.000053541815,0.003124522],"genre_scores_gemma":[0.2904593,0.0014967732,0.69497216,0.00041017274,0.00029703917,0.0008205947,0.00023707247,0.00013951758,0.011167215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975171,0.0010123639,0.00013694957,0.00039238099,0.00070996495,0.00023126989],"domain_scores_gemma":[0.9983797,0.0006756514,0.00017520419,0.00028011517,0.00037266943,0.00011664204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045108483,0.001424085,0.0013142658,0.0008390353,0.0006788051,0.003289316,0.002974119,0.0018359876,0.00700053],"category_scores_gemma":[0.0053158877,0.00082058244,0.0013810378,0.0010620838,0.002135337,0.003970348,0.002304076,0.0031894054,0.000908704],"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.000022007554,0.000041362546,0.0001051168,0.00006292274,0.000022605293,0.00006350982,0.000049070735,0.1715633,0.000795726,0.8086826,0.0015069246,0.01708479],"study_design_scores_gemma":[0.000029125522,0.000054809665,0.000044991655,0.0000238186,0.000013214573,0.000045582296,0.000018411592,0.65563196,0.00037693273,0.33771497,0.0060294834,0.000016790264],"about_ca_topic_score_codex":0.0016916436,"about_ca_topic_score_gemma":0.0018754944,"teacher_disagreement_score":0.00700053,"about_ca_system_score_codex":0.0020439823,"about_ca_system_score_gemma":0.0032148932,"threshold_uncertainty_score":0.023855925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06726084,0.00030115867,0.9123007,0.0016133174,0.000082151884,0.00018986559,0.000145957,0.00012346226,0.017982531],"genre_scores_gemma":[0.94719374,0.0003417329,0.048303116,0.00018925335,0.0001722708,0.00018438352,0.00009152043,0.000029701256,0.0034942157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596596,0.0015811396,0.00017470862,0.0005656568,0.001240197,0.0004723106],"domain_scores_gemma":[0.9920202,0.003816491,0.0015925221,0.0015548785,0.0007346425,0.00028130438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003875831,0.00058063824,0.0011881662,0.00061200286,0.0010929862,0.002025717,0.0020706297,0.0014153159,0.004401471],"category_scores_gemma":[0.010128614,0.0005171016,0.0008521626,0.0012220732,0.002031952,0.004275987,0.00290864,0.001471102,0.00045463844],"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.00022350598,0.0001378866,0.0015772214,0.0002249524,0.000079158366,0.0005638557,0.00035388966,0.28610185,0.008288399,0.67953306,0.003273085,0.019643098],"study_design_scores_gemma":[0.000090552334,0.00010892384,0.0004799684,0.000029540726,0.000033628443,0.00035451356,0.00010287428,0.67542195,0.0026623646,0.31639922,0.004278838,0.000037659698],"about_ca_topic_score_codex":0.0011202482,"about_ca_topic_score_gemma":0.00049873174,"teacher_disagreement_score":0.004401471,"about_ca_system_score_codex":0.0015679977,"about_ca_system_score_gemma":0.0021319299,"threshold_uncertainty_score":0.02049762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8614541,0.0006324946,0.11726945,0.002137342,0.000074284064,0.00010383362,0.0003988289,0.0002931008,0.017636592],"genre_scores_gemma":[0.991743,0.00018900928,0.0026313693,0.00008322085,0.000025382016,0.00005354931,0.00010114411,0.00003473319,0.00513857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918133,0.00022015354,0.00003216333,0.00015013797,0.00017307872,0.0002431661],"domain_scores_gemma":[0.99287695,0.0040512225,0.0014537702,0.00027797997,0.0005585468,0.0007814661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014366672,0.0005683378,0.0010916636,0.0008885289,0.000956679,0.0022492486,0.0015596212,0.0019983144,0.008619271],"category_scores_gemma":[0.013255015,0.0006456649,0.0007382773,0.00058886776,0.0020959268,0.0037027048,0.0021010274,0.0018803128,0.0006277316],"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.00048025814,0.0003639617,0.01407258,0.00015882267,0.00010508886,0.0015734958,0.0014677054,0.6642446,0.012033088,0.28475943,0.0052516884,0.015489323],"study_design_scores_gemma":[0.000033887427,0.0000661831,0.0020234345,0.000015440417,0.000013104874,0.00013090017,0.00027934343,0.9739688,0.00037753663,0.022159701,0.0009002009,0.00003146536],"about_ca_topic_score_codex":0.00944441,"about_ca_topic_score_gemma":0.004486725,"teacher_disagreement_score":0.00944441,"about_ca_system_score_codex":0.0021215857,"about_ca_system_score_gemma":0.00082006096,"threshold_uncertainty_score":0.028834343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06774749,0.0057746423,0.8828891,0.0009682736,0.0005433288,0.0008681667,0.0018143065,0.0052070734,0.03418778],"genre_scores_gemma":[0.253492,0.0019713345,0.72833765,0.0005527455,0.00015337583,0.0012448496,0.0027536824,0.00076376187,0.0107306205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918646,0.00041542554,0.000024257613,0.000095830896,0.00015272723,0.00012526712],"domain_scores_gemma":[0.9988387,0.000716011,0.00010294861,0.000101008256,0.00018727472,0.00005403809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987519,0.0011793385,0.0013332347,0.0021299801,0.001307837,0.0015410152,0.0018223086,0.0019077674,0.009327731],"category_scores_gemma":[0.0038479099,0.0006399369,0.0009967126,0.004459372,0.0008457687,0.0013748201,0.0009246195,0.0012855203,0.0024091501],"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.00016972715,0.00023541192,0.00054166716,0.00022599586,0.00008014071,0.00011862862,0.000104729734,0.718159,0.0013045435,0.013714249,0.019701617,0.24564418],"study_design_scores_gemma":[0.00007605346,0.00013148632,0.0002704266,0.000053265547,0.000036290083,0.00008471513,0.000056424964,0.9834442,0.00094381545,0.00830187,0.0065739215,0.000027475344],"about_ca_topic_score_codex":0.008599272,"about_ca_topic_score_gemma":0.007976663,"teacher_disagreement_score":0.009327731,"about_ca_system_score_codex":0.0014337949,"about_ca_system_score_gemma":0.0019521604,"threshold_uncertainty_score":0.031204402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06357832,0.0021471255,0.9209985,0.0010196035,0.000075733245,0.00008710511,0.00021236594,0.00017682822,0.011704441],"genre_scores_gemma":[0.95153135,0.002322484,0.039240543,0.00013978295,0.00012904135,0.00014012943,0.0001570591,0.00008550915,0.006254146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991893,0.00024168078,0.000034159428,0.00010792668,0.0002472597,0.00017961134],"domain_scores_gemma":[0.99661726,0.0022461028,0.00046773377,0.00015251053,0.00027758544,0.00023885722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026919383,0.0009765341,0.0012687136,0.0012032533,0.00058506493,0.0017766105,0.002400253,0.0011466809,0.0033732285],"category_scores_gemma":[0.009086389,0.000914077,0.001672575,0.0010701204,0.0017148147,0.0031415678,0.0013976502,0.0019215965,0.00025137296],"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.00003142783,0.00003481266,0.00044863808,0.000101319456,0.000039409708,0.000107353735,0.00007176799,0.7932047,0.00057886244,0.2009919,0.0007186507,0.0036710547],"study_design_scores_gemma":[0.000003911757,0.000009998895,0.0000992193,0.000011424968,0.0000117874,0.000014977546,0.0000107959395,0.9692387,0.00008149502,0.030189533,0.00032071973,0.0000073555802],"about_ca_topic_score_codex":0.012263406,"about_ca_topic_score_gemma":0.005303902,"teacher_disagreement_score":0.012263406,"about_ca_system_score_codex":0.00372039,"about_ca_system_score_gemma":0.0021293305,"threshold_uncertainty_score":0.026993454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21338168,0.000942919,0.7610326,0.002018139,0.0002182124,0.000103373444,0.00017186938,0.00070568523,0.021425564],"genre_scores_gemma":[0.987248,0.00022634045,0.008771917,0.000101195015,0.00003211078,0.000042089923,0.00002569617,0.000025339416,0.003527295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984977,0.00058766326,0.000054707518,0.00030647469,0.00022358747,0.00032979326],"domain_scores_gemma":[0.9964144,0.002304162,0.0006383159,0.00015258991,0.00028679616,0.00020373038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022997546,0.0010136889,0.0013816436,0.0005957212,0.00050013297,0.002176984,0.0011344688,0.0014556512,0.0030920543],"category_scores_gemma":[0.0067007747,0.00074109156,0.0006739194,0.0004905276,0.00208388,0.0011703405,0.0011078311,0.0017656416,0.00037686506],"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.00020517038,0.00010371789,0.0005167766,0.0000874449,0.000058375095,0.00011557134,0.000071073286,0.94960946,0.0029386457,0.038748223,0.00078882667,0.0067566256],"study_design_scores_gemma":[0.000042444284,0.00009965798,0.00031609324,0.000010270812,0.000017856959,0.000015649814,0.000023060102,0.983267,0.00049708155,0.015387489,0.00030427973,0.000018982113],"about_ca_topic_score_codex":0.008239175,"about_ca_topic_score_gemma":0.003733614,"teacher_disagreement_score":0.008239175,"about_ca_system_score_codex":0.0021417923,"about_ca_system_score_gemma":0.0018559836,"threshold_uncertainty_score":0.016382456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049234712,0.0003663048,0.98946416,0.0003037144,0.00007065165,0.0002735541,0.00018501864,0.0005354437,0.0038775841],"genre_scores_gemma":[0.035713285,0.00035051245,0.9599584,0.00012918709,0.00004856103,0.0004847005,0.0006215429,0.00020642324,0.0024874182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874794,0.0004076315,0.00006786813,0.00026594845,0.0003327074,0.00017792245],"domain_scores_gemma":[0.99831855,0.0011477546,0.00011835295,0.000085878404,0.00023255534,0.00009701683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017505093,0.001962798,0.002078095,0.0016015482,0.0014731628,0.0021342786,0.002151936,0.0021561075,0.009167028],"category_scores_gemma":[0.004261853,0.0010701785,0.0011478071,0.002727111,0.000716779,0.0023954362,0.0017155559,0.0032649485,0.0017297091],"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.0002518666,0.00052340294,0.00065862236,0.00035352484,0.00010735459,0.0002298158,0.00016438392,0.5081094,0.0022038608,0.0439832,0.017905885,0.4255087],"study_design_scores_gemma":[0.00010861925,0.00009192489,0.00011544708,0.000029760622,0.000030014355,0.00008673776,0.000049447848,0.96541667,0.00088600005,0.027644899,0.005524298,0.000016145303],"about_ca_topic_score_codex":0.006243069,"about_ca_topic_score_gemma":0.0055550043,"teacher_disagreement_score":0.009167028,"about_ca_system_score_codex":0.0015542352,"about_ca_system_score_gemma":0.0031796498,"threshold_uncertainty_score":0.030666709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041714348,0.00016690201,0.95037174,0.0003133845,0.000026373253,0.000089028494,0.00007658424,0.000108508095,0.007133125],"genre_scores_gemma":[0.7769843,0.0005408227,0.21332924,0.000074780575,0.000044244713,0.0002707991,0.00011921535,0.00006627745,0.008570415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983108,0.00082165987,0.00004894996,0.0003348059,0.0002801036,0.00020367128],"domain_scores_gemma":[0.9989722,0.00056620885,0.00012675776,0.00011053774,0.000125254,0.00009905383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018481832,0.00072664575,0.0010556189,0.0005930614,0.00049695594,0.0020984006,0.0011275988,0.0013094479,0.00410034],"category_scores_gemma":[0.003942694,0.0006451175,0.00066613324,0.0011111266,0.0010293429,0.0024798927,0.0014104559,0.0010185902,0.0003999271],"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.00009238576,0.00005782869,0.0004219581,0.000055437344,0.000028819439,0.00007310016,0.00005483738,0.9049093,0.0013333581,0.06940748,0.0005056341,0.023059784],"study_design_scores_gemma":[0.000012858065,0.000036059893,0.00006715303,0.00000460869,0.000009854635,0.000016771868,0.000013904805,0.96525407,0.0003556622,0.033135626,0.0010884535,0.0000049892587],"about_ca_topic_score_codex":0.0021274663,"about_ca_topic_score_gemma":0.0022410164,"teacher_disagreement_score":0.00410034,"about_ca_system_score_codex":0.0018102195,"about_ca_system_score_gemma":0.0014315213,"threshold_uncertainty_score":0.013717055},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010538728,0.00044617755,0.98632216,0.00024333465,0.00002906412,0.0001172632,0.00025894784,0.00007550855,0.0019687624],"genre_scores_gemma":[0.4244497,0.0029169898,0.56680775,0.00020204743,0.000098557524,0.0009879905,0.00074792746,0.0000794385,0.0037096243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992409,0.004354734,0.0006276064,0.00093917985,0.0013386703,0.00033089033],"domain_scores_gemma":[0.9920134,0.005562138,0.0007890836,0.00088595605,0.0006740403,0.000075334916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008763173,0.0016667974,0.0026706897,0.0027149003,0.00086064235,0.0033873066,0.0017269094,0.0017209288,0.0019478737],"category_scores_gemma":[0.019589907,0.00090187934,0.002986987,0.0078062615,0.0014388621,0.002892498,0.0027873788,0.002763782,0.00049524906],"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.000052352716,0.000041745592,0.0007636277,0.00020295402,0.00014524887,0.00015574193,0.00013577862,0.89340293,0.000572655,0.082689255,0.00044234635,0.02139533],"study_design_scores_gemma":[0.000010918109,0.00002357174,0.00026572967,0.000034270684,0.000017565273,0.000015248156,0.000049411756,0.9526421,0.0006258664,0.04412322,0.002175166,0.000016988015],"about_ca_topic_score_codex":0.010392864,"about_ca_topic_score_gemma":0.004810643,"teacher_disagreement_score":0.010392864,"about_ca_system_score_codex":0.003295774,"about_ca_system_score_gemma":0.0028969834,"threshold_uncertainty_score":0.046344697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036434012,0.00007545689,0.995376,0.00012501716,0.000020659852,0.000066122186,0.000035112436,0.00013037371,0.00052789395],"genre_scores_gemma":[0.2794229,0.00023788045,0.7167969,0.00023656426,0.0001238731,0.000697977,0.00023766008,0.00018588464,0.0020604075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877113,0.0005663567,0.00004298824,0.00014655801,0.0003781528,0.000094773175],"domain_scores_gemma":[0.9946779,0.0038768952,0.00031626894,0.00023090652,0.0006994712,0.00019864443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004530386,0.0010478038,0.0013494003,0.0010314623,0.0006071719,0.0012274781,0.0025482445,0.001595881,0.00332542],"category_scores_gemma":[0.010233706,0.00085698644,0.0007729878,0.0012248608,0.0011350266,0.0014337478,0.0016053529,0.0021646896,0.00046223993],"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.000055095432,0.00005672651,0.00021041831,0.00005334357,0.000015237738,0.00003843238,0.000040447612,0.97009003,0.0007155979,0.011099174,0.00044361944,0.017181804],"study_design_scores_gemma":[0.000010351697,0.000009140247,0.000014362414,0.000003662829,0.0000015421799,0.0000037375198,0.000002845007,0.9969674,0.000116124225,0.0026688103,0.0001986478,0.0000034772756],"about_ca_topic_score_codex":0.0060287686,"about_ca_topic_score_gemma":0.0045218826,"teacher_disagreement_score":0.0060287686,"about_ca_system_score_codex":0.0021294237,"about_ca_system_score_gemma":0.0028098687,"threshold_uncertainty_score":0.023959279},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039579272,0.00062131154,0.91559,0.0021902958,0.00016861662,0.00008920087,0.00039794057,0.00015473265,0.04120861],"genre_scores_gemma":[0.89783,0.0016599005,0.0641633,0.0003960795,0.00029410646,0.00024605804,0.00037345308,0.00007757002,0.034959547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945825,0.00026259336,0.000016867254,0.00007484467,0.000074995216,0.00011250495],"domain_scores_gemma":[0.9995509,0.00023234532,0.000052042633,0.00003101437,0.00005238417,0.000081206184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095408555,0.00090656144,0.0007494707,0.00093033916,0.00082367955,0.0023201748,0.0021682768,0.002229797,0.0066079325],"category_scores_gemma":[0.0017949749,0.000570917,0.0008116497,0.0018030145,0.0016561262,0.003188699,0.0011053181,0.0015763689,0.0010233953],"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.000022460401,0.000030458414,0.0001718002,0.000025246529,0.000011255372,0.00009643057,0.000074595686,0.34672496,0.0004412007,0.6475143,0.0015589294,0.003328367],"study_design_scores_gemma":[0.000012384249,0.000023424536,0.000058936355,0.000007115895,0.0000066031307,0.000032003227,0.000040535426,0.78310746,0.00006565221,0.21430862,0.0023269036,0.000010305996],"about_ca_topic_score_codex":0.0069529032,"about_ca_topic_score_gemma":0.0071117287,"teacher_disagreement_score":0.0069529032,"about_ca_system_score_codex":0.002263735,"about_ca_system_score_gemma":0.0018144266,"threshold_uncertainty_score":0.022105694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01564002,0.00021488495,0.9805088,0.00007266363,0.000026776794,0.000059269172,0.000034491644,0.00016231385,0.0032807617],"genre_scores_gemma":[0.42225456,0.0003431719,0.57278407,0.00007701434,0.000037264082,0.00046247157,0.00016474206,0.0001326978,0.003744102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996815,0.00012851853,0.000013679101,0.000037238835,0.00011245895,0.000026614462],"domain_scores_gemma":[0.99943966,0.0002923191,0.000059682894,0.00006785201,0.00010636613,0.000034039513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080129446,0.0005254483,0.0006896888,0.0009561581,0.0004807899,0.0006420001,0.0012301158,0.0008965625,0.0021940167],"category_scores_gemma":[0.0025313615,0.0003732809,0.00063393667,0.0008619164,0.00069539814,0.0011163603,0.00087120704,0.0006646386,0.00041913975],"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.000038998416,0.000027906259,0.000259016,0.00003931122,0.000015634627,0.000021817023,0.000051737825,0.9095024,0.000924183,0.034124915,0.0006414199,0.054352604],"study_design_scores_gemma":[0.000012873758,0.00004479486,0.000054915745,0.00000780238,0.000005114336,0.000013825969,0.00000861226,0.9833734,0.0004245159,0.014409053,0.0016373713,0.000007680105],"about_ca_topic_score_codex":0.002043109,"about_ca_topic_score_gemma":0.0024235246,"teacher_disagreement_score":0.0021940167,"about_ca_system_score_codex":0.0007765261,"about_ca_system_score_gemma":0.0006553324,"threshold_uncertainty_score":0.007339716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00388297,0.00041935337,0.99081355,0.0001653818,0.00007854126,0.0000750523,0.000096691736,0.00019403255,0.0042743688],"genre_scores_gemma":[0.27544641,0.0013033106,0.71465725,0.0005024251,0.00025273638,0.0006732384,0.00074393523,0.00027356108,0.006147207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985232,0.00055725017,0.000070228336,0.00018327958,0.00050761295,0.00015857686],"domain_scores_gemma":[0.9973573,0.001668117,0.0002988787,0.00023249147,0.00036424585,0.000078908044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022044845,0.0015554886,0.00092545897,0.0014072835,0.00065948104,0.0017204062,0.001236717,0.0012820789,0.0074485424],"category_scores_gemma":[0.007457399,0.0005962896,0.0010516834,0.0017975201,0.0012919386,0.0015238798,0.001639073,0.0035909058,0.0013616807],"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.00025600925,0.0001634272,0.0003651936,0.00036303897,0.000044502758,0.0001948855,0.00013327185,0.6420811,0.009603149,0.2358144,0.008233805,0.10274719],"study_design_scores_gemma":[0.000034213856,0.000037057453,0.00006009354,0.000034722234,0.000010193608,0.000037405844,0.000009991033,0.95514816,0.0031614506,0.038481344,0.0029741991,0.000011198522],"about_ca_topic_score_codex":0.0012622115,"about_ca_topic_score_gemma":0.0011967248,"teacher_disagreement_score":0.0074485424,"about_ca_system_score_codex":0.0011890499,"about_ca_system_score_gemma":0.0011253121,"threshold_uncertainty_score":0.0249179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057179113,0.00019359443,0.9895499,0.00030491207,0.000030131303,0.000030766903,0.000046934554,0.000038101633,0.0040877755],"genre_scores_gemma":[0.42687547,0.00071652274,0.56049937,0.00028706086,0.00011432505,0.00054893456,0.00022306234,0.00017652265,0.010558758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.0005558583,0.000026858834,0.000085792344,0.00021487527,0.00010605566],"domain_scores_gemma":[0.99808455,0.0013287202,0.00011494719,0.00017496124,0.00019872289,0.000098191354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029024207,0.0009993869,0.0012233328,0.0005518968,0.0005090051,0.0011597151,0.0013592559,0.0013230824,0.0032578458],"category_scores_gemma":[0.0067287264,0.0006367259,0.0013365772,0.0007549213,0.0011723159,0.0014668397,0.0021448908,0.0027190917,0.00034966986],"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.000025409889,0.000026190395,0.00027756186,0.000037779326,0.000021002228,0.000053967597,0.000052555548,0.85346615,0.00028034585,0.13765655,0.000999154,0.0071032867],"study_design_scores_gemma":[0.000003100072,0.0000040516516,0.000019079736,0.0000041075896,0.0000017683768,0.00000471914,0.0000051085767,0.9793234,0.00004688589,0.020095356,0.00049058336,0.0000018150581],"about_ca_topic_score_codex":0.008717106,"about_ca_topic_score_gemma":0.007260925,"teacher_disagreement_score":0.008717106,"about_ca_system_score_codex":0.0019333306,"about_ca_system_score_gemma":0.0019789105,"threshold_uncertainty_score":0.017332733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34312168,0.0014073687,0.629556,0.0017244634,0.0001246081,0.0006826049,0.00049172936,0.00034989088,0.022541657],"genre_scores_gemma":[0.94448733,0.0006329112,0.048917107,0.000059934802,0.00004396531,0.00023845499,0.00011490402,0.000033576925,0.0054718354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984086,0.00069032307,0.00007638705,0.00036370146,0.00020299465,0.0002579209],"domain_scores_gemma":[0.9942696,0.003841063,0.0010987354,0.00017855031,0.00025009617,0.000361961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018393402,0.0010816633,0.0015372414,0.0008071031,0.0008101063,0.0028907617,0.0017171861,0.0035556436,0.007841375],"category_scores_gemma":[0.008139382,0.0010933814,0.0009344554,0.0012556434,0.0011189657,0.004748953,0.0014774125,0.0013065054,0.0006345483],"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.0005003173,0.00044912507,0.0031417527,0.00055643055,0.00007870285,0.00046205634,0.00021121332,0.89144444,0.005856315,0.03546684,0.001558827,0.06027401],"study_design_scores_gemma":[0.00011189993,0.00042691283,0.0015802082,0.000036805326,0.00009966005,0.00017499644,0.00024363646,0.9761548,0.0017558481,0.0172317,0.0021364011,0.00004705812],"about_ca_topic_score_codex":0.006704114,"about_ca_topic_score_gemma":0.006214715,"teacher_disagreement_score":0.007841375,"about_ca_system_score_codex":0.0018720245,"about_ca_system_score_gemma":0.002378057,"threshold_uncertainty_score":0.026232004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006001553,0.00025498486,0.9922057,0.00013654683,0.000045603792,0.0000332683,0.00000590451,0.000063115585,0.001253296],"genre_scores_gemma":[0.3414166,0.0011004397,0.6517525,0.00021566972,0.00019262795,0.00045861906,0.000053112355,0.00013644408,0.004674017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987244,0.00066957145,0.0000560521,0.00014271369,0.0003073507,0.00009981072],"domain_scores_gemma":[0.99562114,0.0035197218,0.00021016979,0.00020057352,0.00032205618,0.00012638376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036529468,0.0011358557,0.0010590042,0.00057971803,0.0004692837,0.0009886138,0.0012348372,0.0012116688,0.002225137],"category_scores_gemma":[0.011098422,0.0004779153,0.0010047241,0.0007437366,0.002026681,0.0020432041,0.0018788207,0.0027753266,0.00044971093],"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.00013541894,0.000105528765,0.00054429757,0.00022124853,0.000054009397,0.00009641162,0.0002727772,0.44605622,0.0032086617,0.46303567,0.0013759681,0.08489369],"study_design_scores_gemma":[0.000017222292,0.00006335796,0.000032698685,0.000016619206,0.0000063434113,0.000023460363,0.000008085284,0.9199017,0.00076254044,0.07810619,0.0010529794,0.000008685378],"about_ca_topic_score_codex":0.0011182661,"about_ca_topic_score_gemma":0.00064889254,"teacher_disagreement_score":0.0036529468,"about_ca_system_score_codex":0.0007192646,"about_ca_system_score_gemma":0.0014081595,"threshold_uncertainty_score":0.019318879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022413533,0.0008657391,0.97188944,0.0002862863,0.000048641265,0.00017800042,0.00014976937,0.00018387966,0.003984689],"genre_scores_gemma":[0.2778203,0.0017389894,0.7134788,0.00010647105,0.000108313296,0.00063143735,0.00057681405,0.00019915537,0.0053397706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920136,0.00036029075,0.000029492478,0.000117582735,0.00016453756,0.00012680377],"domain_scores_gemma":[0.9988845,0.0008645213,0.00009080957,0.00003823581,0.00006337256,0.000058596124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016299302,0.0013103512,0.0016004712,0.0008571257,0.0007167944,0.0015012065,0.0010530896,0.0010943224,0.0053845653],"category_scores_gemma":[0.00277793,0.00083878305,0.00085884694,0.0015599368,0.0009063286,0.001882659,0.0009345631,0.0016630786,0.0005877124],"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.00018954434,0.0001064538,0.00038478442,0.000205244,0.00004946286,0.000116724106,0.00008110852,0.9014239,0.0013127669,0.03302133,0.002249912,0.0608588],"study_design_scores_gemma":[0.00003859464,0.000055791403,0.00008130959,0.000011887435,0.000013603054,0.000026842888,0.000021384287,0.9783447,0.00046673714,0.019599734,0.0013329457,0.000006571962],"about_ca_topic_score_codex":0.005377891,"about_ca_topic_score_gemma":0.0046243356,"teacher_disagreement_score":0.0053845653,"about_ca_system_score_codex":0.0013219896,"about_ca_system_score_gemma":0.001829508,"threshold_uncertainty_score":0.01801318},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05877373,0.00199941,0.8875924,0.005099958,0.00029090873,0.00008428354,0.0003847354,0.00017141073,0.045603283],"genre_scores_gemma":[0.925362,0.0027828317,0.04628375,0.000508339,0.00066478644,0.0001444483,0.00020864888,0.00007533498,0.023969807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990362,0.00037688267,0.000054171076,0.00018881667,0.0002279635,0.00011601339],"domain_scores_gemma":[0.99767596,0.0013811751,0.00040919645,0.00012922956,0.0002540635,0.00015037454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020390654,0.0009213998,0.0018420455,0.0006660053,0.0007131715,0.0027164489,0.0013390777,0.0023830826,0.006101505],"category_scores_gemma":[0.00504737,0.00061749894,0.0014360682,0.00081403606,0.0019342805,0.003299258,0.0013753474,0.0022024247,0.0006843924],"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.000057756424,0.00004645526,0.00042113112,0.00010931641,0.000045290668,0.00045105044,0.00012378953,0.14885958,0.0018200238,0.8385723,0.003279508,0.0062137637],"study_design_scores_gemma":[0.000035762616,0.000074001866,0.00021929479,0.00002960632,0.00003804341,0.00020024931,0.00005490013,0.6522607,0.0003875169,0.34372625,0.002934665,0.00003891818],"about_ca_topic_score_codex":0.0015176884,"about_ca_topic_score_gemma":0.00072532566,"teacher_disagreement_score":0.006101505,"about_ca_system_score_codex":0.0010197909,"about_ca_system_score_gemma":0.00088353525,"threshold_uncertainty_score":0.02041161},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034745075,0.0011836283,0.9420017,0.002325923,0.0003625585,0.00015514073,0.00020894215,0.00024164181,0.018775424],"genre_scores_gemma":[0.8920286,0.0021785437,0.09057303,0.0007265944,0.001442338,0.0003021408,0.00021956382,0.00010177738,0.012427288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745923,0.0008110998,0.000103188926,0.00054499006,0.0005146817,0.0005669176],"domain_scores_gemma":[0.99625814,0.0020065065,0.00053352275,0.00039239603,0.0003996476,0.00040985682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525731,0.0017079667,0.0013935103,0.0007294491,0.001862876,0.0031809108,0.0029895497,0.00240043,0.008908781],"category_scores_gemma":[0.006750199,0.0009938821,0.001296197,0.0018886259,0.0032822965,0.00586923,0.0036026393,0.0032203742,0.0014756698],"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.00015800186,0.0001793642,0.0013799606,0.00020853044,0.000072984425,0.0006509034,0.00025035208,0.4509733,0.0036499489,0.5264809,0.0056980657,0.010297692],"study_design_scores_gemma":[0.00005099028,0.000090536036,0.00029447052,0.00003747677,0.000039429786,0.00022019705,0.000111361114,0.77730596,0.0008102528,0.21429491,0.006704807,0.000039629438],"about_ca_topic_score_codex":0.0036136655,"about_ca_topic_score_gemma":0.0021090505,"teacher_disagreement_score":0.008908781,"about_ca_system_score_codex":0.0022609504,"about_ca_system_score_gemma":0.0027695205,"threshold_uncertainty_score":0.029802859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20406216,0.0010156385,0.78936076,0.00039396092,0.0001244264,0.000055355707,0.000051997904,0.0010731951,0.003862449],"genre_scores_gemma":[0.9362708,0.00044344336,0.059683837,0.00011661036,0.00009813491,0.000041845542,0.000045281304,0.00007306614,0.0032270576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.0002941868,0.000040133313,0.00013151528,0.0004668686,0.00022764232],"domain_scores_gemma":[0.9972218,0.0016155638,0.0003201064,0.00028753374,0.00038875313,0.00016617421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015715873,0.0007095017,0.00069191033,0.0006202065,0.00063722156,0.00096338254,0.0018319356,0.0007268753,0.001317198],"category_scores_gemma":[0.0076000625,0.0003983676,0.0003568017,0.00062724785,0.0007410559,0.0017493757,0.0009071978,0.0007921246,0.00034754223],"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.00094734656,0.00031817952,0.0018302732,0.00013928406,0.000052328847,0.00023115295,0.00040701372,0.78705347,0.026717806,0.07638511,0.002141182,0.10377679],"study_design_scores_gemma":[0.00005978248,0.00021066886,0.00014495113,0.0000060519287,0.000023190543,0.00006398359,0.000028688844,0.97115535,0.005073712,0.021896865,0.0013224932,0.0000143237185],"about_ca_topic_score_codex":0.00375968,"about_ca_topic_score_gemma":0.0024858862,"teacher_disagreement_score":0.00375968,"about_ca_system_score_codex":0.0015944579,"about_ca_system_score_gemma":0.0017387286,"threshold_uncertainty_score":0.011568606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5016475,0.0007967155,0.48503935,0.00094401627,0.00009525805,0.00031993716,0.0005034708,0.001115735,0.0095380675],"genre_scores_gemma":[0.9538154,0.00023642638,0.039985098,0.00008532561,0.000036527035,0.0001213006,0.00021986917,0.000100022866,0.0054001375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964444,0.0011752441,0.00019091857,0.00059023855,0.00097194006,0.00062734983],"domain_scores_gemma":[0.98728114,0.0067327423,0.002624081,0.002076501,0.00077182427,0.00051368197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040436103,0.0012263398,0.0016106417,0.001050997,0.00082148844,0.0015648871,0.002207893,0.0017396128,0.0050728745],"category_scores_gemma":[0.019150019,0.0013712399,0.0011468333,0.0017167617,0.0020638392,0.002391607,0.0011721172,0.0014843867,0.0009098211],"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.0005046563,0.0001725215,0.0029015841,0.000087428634,0.000042100615,0.000724971,0.00009003684,0.9457909,0.002049189,0.032133553,0.0011516833,0.014351456],"study_design_scores_gemma":[0.00008950584,0.00029335494,0.0018786457,0.000012414934,0.00003091847,0.00025250146,0.000059951875,0.96707404,0.0013887727,0.028196963,0.0006783575,0.00004462423],"about_ca_topic_score_codex":0.0037562486,"about_ca_topic_score_gemma":0.004563873,"teacher_disagreement_score":0.0050728745,"about_ca_system_score_codex":0.0023615595,"about_ca_system_score_gemma":0.0011966736,"threshold_uncertainty_score":0.021384895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30800927,0.00046295056,0.682161,0.00051048363,0.000088860565,0.00007355315,0.00010446246,0.00040550975,0.008183846],"genre_scores_gemma":[0.9821983,0.00011715138,0.016613208,0.00004881729,0.000024910138,0.000047112717,0.00004428676,0.000020664922,0.00088553043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998461,0.00028684307,0.0000854917,0.0003029161,0.0005137345,0.0003500813],"domain_scores_gemma":[0.99391043,0.0031997084,0.0010683127,0.00027061297,0.0012834077,0.00026746155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021371422,0.00053901295,0.00060930813,0.00071528356,0.00094716414,0.0012822737,0.000811323,0.0007054019,0.001767825],"category_scores_gemma":[0.01230355,0.00019695633,0.00033663123,0.00039126838,0.0012535959,0.0020960057,0.001269486,0.0010234017,0.00020471915],"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.0006100515,0.00013447231,0.00436798,0.0003184455,0.00006725273,0.00066334713,0.0008124136,0.64496726,0.073550485,0.22459954,0.0013245496,0.048584238],"study_design_scores_gemma":[0.000031578013,0.00008553403,0.0004074281,0.000015072691,0.0000106382395,0.00008077597,0.00009395176,0.95274544,0.0073602195,0.038421817,0.0007323129,0.000015256925],"about_ca_topic_score_codex":0.005059847,"about_ca_topic_score_gemma":0.0020112463,"teacher_disagreement_score":0.005059847,"about_ca_system_score_codex":0.0012904782,"about_ca_system_score_gemma":0.002158152,"threshold_uncertainty_score":0.011302412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045903184,0.0019249801,0.94091076,0.0013191175,0.00013130384,0.00029136392,0.0004258937,0.0006181032,0.008475302],"genre_scores_gemma":[0.3810336,0.0019870459,0.60933757,0.000421165,0.00026410003,0.0007932687,0.0013348565,0.00030604444,0.0045223464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803466,0.0008687814,0.0000892919,0.0002835129,0.00039594655,0.0003277132],"domain_scores_gemma":[0.9941339,0.004618687,0.00041652055,0.00030572043,0.00031006994,0.00021508826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036804546,0.0024783185,0.0027227353,0.0017202507,0.0011093535,0.0021101185,0.0032894162,0.0028956144,0.0052952147],"category_scores_gemma":[0.012218815,0.0010551855,0.0013900376,0.00428945,0.0012126715,0.0034383931,0.0018425628,0.0026119608,0.0009487609],"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.0002021558,0.00019448125,0.00054306176,0.00015537608,0.000070546215,0.000039013274,0.00009790124,0.94598573,0.00033908625,0.016030703,0.004025071,0.032316856],"study_design_scores_gemma":[0.00005951014,0.00003155091,0.000072231414,0.000010426446,0.000014158884,0.00001747092,0.000020563093,0.9870711,0.00012265952,0.012088766,0.0004860472,0.0000054958864],"about_ca_topic_score_codex":0.008268837,"about_ca_topic_score_gemma":0.007233651,"teacher_disagreement_score":0.008268837,"about_ca_system_score_codex":0.0036658936,"about_ca_system_score_gemma":0.0033339665,"threshold_uncertainty_score":0.026598036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77578455,0.00022820279,0.21417251,0.00075772847,0.00002598587,0.00020755563,0.00018609852,0.00008909455,0.0085482625],"genre_scores_gemma":[0.98897904,0.00014737934,0.008576671,0.000025957346,0.000014507498,0.00006226096,0.00004879784,0.000010514656,0.002134895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996051,0.0017556343,0.00019473738,0.0005641096,0.0004570574,0.000977463],"domain_scores_gemma":[0.98359317,0.012826599,0.0016847155,0.000389404,0.00062515127,0.00088093354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005539009,0.0010024628,0.0019124746,0.0013078481,0.001107147,0.0035778605,0.0016887102,0.002598622,0.004195471],"category_scores_gemma":[0.017410193,0.0018195707,0.0011172956,0.0016032411,0.0033757605,0.0049225013,0.0019357575,0.0013172677,0.0004504081],"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.000713955,0.00017754923,0.004333521,0.00010208063,0.00010135726,0.0007216265,0.00040152582,0.8996738,0.0024137876,0.07995875,0.0005090445,0.010893016],"study_design_scores_gemma":[0.00009077562,0.00012121383,0.001256007,0.000016845437,0.000043860986,0.00009719225,0.00021165101,0.9455715,0.0008015112,0.05142943,0.00031492452,0.00004514216],"about_ca_topic_score_codex":0.005759875,"about_ca_topic_score_gemma":0.0045598177,"teacher_disagreement_score":0.005759875,"about_ca_system_score_codex":0.0031787509,"about_ca_system_score_gemma":0.0016907331,"threshold_uncertainty_score":0.029293478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24412018,0.00064568536,0.74456203,0.00069861684,0.00011064091,0.00028241752,0.00019081098,0.00039543968,0.008994169],"genre_scores_gemma":[0.9766684,0.00017818462,0.020353608,0.000054756973,0.000065439715,0.00009197455,0.000052913292,0.000031012692,0.0025037006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813783,0.00063767534,0.0000982603,0.00034658815,0.00039060484,0.00038899336],"domain_scores_gemma":[0.9960418,0.0021931836,0.00090428203,0.00020601944,0.00038858558,0.000266056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002669679,0.0012139406,0.0018450893,0.00057137967,0.00048909197,0.0020601284,0.0017911,0.0014383525,0.00195801],"category_scores_gemma":[0.006721684,0.0009083646,0.0005691512,0.00088556734,0.0012138897,0.0026381086,0.0009870266,0.00096846756,0.00024423093],"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.00021857393,0.00008259052,0.0004466151,0.000055537716,0.000038393177,0.00014797237,0.00005589985,0.97535354,0.0017772535,0.012570944,0.0003546981,0.00889806],"study_design_scores_gemma":[0.000022172022,0.00006601641,0.0001854657,0.0000025997163,0.000008630982,0.000012600882,0.000015716501,0.99455065,0.00033421174,0.0046750093,0.00011742732,0.000009475791],"about_ca_topic_score_codex":0.0077309054,"about_ca_topic_score_gemma":0.00412167,"teacher_disagreement_score":0.0077309054,"about_ca_system_score_codex":0.002143227,"about_ca_system_score_gemma":0.0019745512,"threshold_uncertainty_score":0.015550315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010625103,0.00026991393,0.9842944,0.0002837365,0.00003068097,0.00013198798,0.0001601545,0.000389215,0.0038147892],"genre_scores_gemma":[0.08070508,0.00035177442,0.9162166,0.0000970578,0.00003305499,0.00029922347,0.0005147416,0.000114817405,0.001667625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.00014703134,0.000020221334,0.000085580024,0.00013719514,0.000095538904],"domain_scores_gemma":[0.99930286,0.0004921682,0.00004735982,0.000038080678,0.000072688475,0.00004680592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082378165,0.0011112251,0.001057956,0.0009686604,0.0007776579,0.0011210963,0.0011526956,0.001271358,0.0053719133],"category_scores_gemma":[0.0024828648,0.0006296166,0.00066956616,0.0015378842,0.0005002963,0.0012702438,0.0011725103,0.0017359374,0.0007645871],"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.00016389106,0.00021388025,0.00054290425,0.00016856591,0.00005721852,0.00012461613,0.00011528383,0.69006485,0.0021213186,0.040962864,0.007370028,0.25809458],"study_design_scores_gemma":[0.000065131535,0.00005186933,0.0001022447,0.000014035961,0.000015958582,0.000034430224,0.000024888199,0.97692204,0.00064694544,0.019594232,0.0025215615,0.0000066556363],"about_ca_topic_score_codex":0.0058117164,"about_ca_topic_score_gemma":0.005082166,"teacher_disagreement_score":0.0058117164,"about_ca_system_score_codex":0.0010508962,"about_ca_system_score_gemma":0.0020828666,"threshold_uncertainty_score":0.0179708},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003845356,0.00030947523,0.9919774,0.00045682918,0.00010852594,0.000027636466,0.000092349816,0.00021525097,0.0029672584],"genre_scores_gemma":[0.38829952,0.0035350046,0.5890695,0.00062364526,0.0011987146,0.00034537158,0.0009752105,0.0007074099,0.015245674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979911,0.00081258937,0.000092441245,0.0002085929,0.0007418133,0.0001535683],"domain_scores_gemma":[0.98803014,0.008564504,0.0006147336,0.0013047233,0.0013272631,0.00015860055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045408946,0.00095303176,0.00081183424,0.0009536362,0.0008982941,0.0018231259,0.00224431,0.0010037438,0.008967317],"category_scores_gemma":[0.030269047,0.00069413445,0.0011904559,0.0018650619,0.0009146289,0.0037665053,0.0016815236,0.0028557898,0.002519572],"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.00009257233,0.00006981419,0.0032649776,0.00012462128,0.00006005035,0.00035008977,0.00015554337,0.74273115,0.002133994,0.18371432,0.013727078,0.053575788],"study_design_scores_gemma":[0.0000047187777,0.000014214228,0.00032012057,0.000017813594,0.000012983963,0.00015070001,0.000020943613,0.96087766,0.0007643149,0.03330578,0.0044967015,0.000013990947],"about_ca_topic_score_codex":0.010136213,"about_ca_topic_score_gemma":0.005470901,"teacher_disagreement_score":0.010136213,"about_ca_system_score_codex":0.0013371387,"about_ca_system_score_gemma":0.0018547642,"threshold_uncertainty_score":0.02999866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0552664,0.0005970369,0.9362845,0.0003775371,0.0000825978,0.00014860446,0.00007498172,0.000972681,0.006195604],"genre_scores_gemma":[0.534696,0.0006091903,0.45929727,0.00041555535,0.00019198589,0.00044705922,0.00039681638,0.0005729148,0.0033732303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682826,0.0013521514,0.00011438787,0.00048378186,0.0007521099,0.0004692654],"domain_scores_gemma":[0.9805204,0.015603869,0.0011527115,0.0012235453,0.0010176165,0.00048177183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059247613,0.0018357333,0.0019596536,0.0012587478,0.0008911917,0.0019356875,0.0022883695,0.002029593,0.0034492791],"category_scores_gemma":[0.024587628,0.0007496318,0.00095891656,0.0011727621,0.0019833795,0.0027941482,0.002155139,0.0021700829,0.0010141834],"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.0005026592,0.0002594257,0.0008498037,0.00013656767,0.0000612776,0.000060943657,0.00008040452,0.9278755,0.0024722714,0.016606001,0.0016992046,0.049395878],"study_design_scores_gemma":[0.00004273694,0.000050229417,0.00007840918,0.000008784314,0.000006988967,0.000015015805,0.0000075747403,0.99363834,0.00034001484,0.005661634,0.00014583406,0.000004455233],"about_ca_topic_score_codex":0.004374731,"about_ca_topic_score_gemma":0.0036422662,"teacher_disagreement_score":0.0059247613,"about_ca_system_score_codex":0.0021261333,"about_ca_system_score_gemma":0.0036419928,"threshold_uncertainty_score":0.031333506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1545997,0.0034342534,0.7920361,0.0017432721,0.000198807,0.00019052211,0.0004931624,0.00078537065,0.046518788],"genre_scores_gemma":[0.8710626,0.0013993201,0.12010561,0.00039062402,0.00016973639,0.0002509106,0.0004988987,0.00044519795,0.005677048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952893,0.0014856512,0.00014946017,0.0008968967,0.0010755676,0.0011030982],"domain_scores_gemma":[0.96504754,0.025330082,0.002351109,0.0027112865,0.0031977398,0.0013622621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059747538,0.0018657607,0.0022660657,0.0026599776,0.0017020028,0.0034963475,0.004060099,0.0019785403,0.012008035],"category_scores_gemma":[0.034510493,0.0007182731,0.0015771217,0.0019220327,0.0044158767,0.007764517,0.004205797,0.004865076,0.0017136786],"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.001179828,0.00024324941,0.0028997718,0.00051204953,0.00015965781,0.0002494286,0.00048626063,0.4586823,0.01473109,0.4705866,0.006129738,0.044140045],"study_design_scores_gemma":[0.000053611486,0.00017505874,0.0005677504,0.000115974224,0.000042025757,0.000120843346,0.00022746029,0.7730532,0.0071820673,0.21613768,0.0022519056,0.00007241752],"about_ca_topic_score_codex":0.0022194034,"about_ca_topic_score_gemma":0.002053082,"teacher_disagreement_score":0.012008035,"about_ca_system_score_codex":0.003520321,"about_ca_system_score_gemma":0.0019665435,"threshold_uncertainty_score":0.040170908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017812086,0.000727304,0.97711253,0.0005367962,0.000029963103,0.0000504388,0.000038190406,0.00008981335,0.003602738],"genre_scores_gemma":[0.8136426,0.002269662,0.17775865,0.00017601464,0.00021064063,0.00027037613,0.00010015745,0.00010402776,0.0054678693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.00077707827,0.00006121789,0.00015098233,0.000410105,0.00014637772],"domain_scores_gemma":[0.98910785,0.0094977515,0.00062632276,0.00013029529,0.0004768308,0.00016096931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00586436,0.00096719735,0.0013992045,0.0017408644,0.00074426585,0.0017362292,0.0014606953,0.0013980897,0.0025079085],"category_scores_gemma":[0.013934487,0.0009408054,0.0016438453,0.0019878699,0.0017259569,0.002036902,0.0014345202,0.0019504776,0.00013733473],"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.000016333273,0.000017300175,0.00032517262,0.000051054118,0.00002582901,0.000054367818,0.000056749337,0.8792462,0.00021513349,0.114046395,0.00022259663,0.0057229702],"study_design_scores_gemma":[0.0000033326407,0.000009918619,0.00007345303,0.0000064720984,0.0000055666114,0.0000131531115,0.000008487591,0.9709396,0.000057177956,0.028624598,0.0002520881,0.000006176397],"about_ca_topic_score_codex":0.0065008346,"about_ca_topic_score_gemma":0.0039699837,"teacher_disagreement_score":0.0065008346,"about_ca_system_score_codex":0.0024387422,"about_ca_system_score_gemma":0.0019418419,"threshold_uncertainty_score":0.031014085},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17885345,0.0010724952,0.78327245,0.0025169495,0.00013174511,0.00017252455,0.0008702287,0.00030670853,0.032803476],"genre_scores_gemma":[0.9461633,0.00092096557,0.043116346,0.00025679552,0.00013312457,0.00016793092,0.0003702706,0.00007331952,0.008797911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960953,0.00009481628,0.000020005118,0.00007426539,0.00014793203,0.00005352064],"domain_scores_gemma":[0.997815,0.0010691563,0.00046342885,0.00018453308,0.0003863314,0.000081459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012589697,0.00044143113,0.0004168351,0.0007191895,0.000538261,0.0011392479,0.00077003706,0.00075443403,0.0088818725],"category_scores_gemma":[0.0050563295,0.00027773052,0.0006356176,0.0011058932,0.0015304724,0.0024789728,0.00097458734,0.0012710817,0.00054486026],"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.00014175929,0.00012485623,0.0045148665,0.00025852773,0.00005971622,0.0005319965,0.00030515468,0.36464867,0.00819271,0.58490837,0.008013656,0.028299684],"study_design_scores_gemma":[0.00002156774,0.00008594633,0.0012685274,0.000034886212,0.00001585792,0.00020724854,0.000074122596,0.75141823,0.002827262,0.2394885,0.0045299223,0.000027943835],"about_ca_topic_score_codex":0.004036525,"about_ca_topic_score_gemma":0.0024621987,"teacher_disagreement_score":0.0088818725,"about_ca_system_score_codex":0.0011177533,"about_ca_system_score_gemma":0.0010360728,"threshold_uncertainty_score":0.029712796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13509537,0.00019062753,0.8609056,0.00043276043,0.000031808697,0.000051158368,0.000030966745,0.00014604299,0.003115609],"genre_scores_gemma":[0.90776056,0.00016386251,0.090259805,0.00008546369,0.000045839533,0.000060455113,0.000046429082,0.000027683913,0.0015498302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988274,0.00067949336,0.000044085435,0.0001530461,0.00017228027,0.00012376547],"domain_scores_gemma":[0.9913458,0.007053809,0.0005153167,0.00048654227,0.0004296565,0.00016877645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034837339,0.00072892895,0.0012985546,0.0005918623,0.0005998379,0.0010099723,0.0016388724,0.0012985665,0.0015174429],"category_scores_gemma":[0.010694363,0.0004896158,0.0006934528,0.0010922467,0.0012227183,0.0019149636,0.0012926605,0.0014911253,0.00013138098],"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.00005419472,0.000079987745,0.0014785376,0.000020785194,0.000032807842,0.00007407886,0.00006677301,0.9519957,0.00029121115,0.029081417,0.00024084211,0.016583672],"study_design_scores_gemma":[0.000003816447,0.000010488471,0.000045339613,0.0000010026029,0.0000025850254,0.000006370498,0.0000030533176,0.99425924,0.00005084439,0.00556717,0.000048024096,0.0000021038911],"about_ca_topic_score_codex":0.0052875997,"about_ca_topic_score_gemma":0.0032434699,"teacher_disagreement_score":0.0052875997,"about_ca_system_score_codex":0.0009880447,"about_ca_system_score_gemma":0.0009974497,"threshold_uncertainty_score":0.018423915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49921694,0.0007756989,0.4896122,0.00075278204,0.00017151925,0.00013574444,0.00034925947,0.00026886846,0.008717011],"genre_scores_gemma":[0.97463346,0.00037591357,0.020077117,0.00007977242,0.000054390883,0.0000730204,0.000106642285,0.00002542221,0.004574342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990916,0.00022849592,0.0000503474,0.00019051717,0.00017936835,0.00025957177],"domain_scores_gemma":[0.9968144,0.0014807861,0.00071734906,0.00019616281,0.0003597428,0.00043152098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018209422,0.0008316403,0.00085466646,0.00091367296,0.00065378466,0.0020458456,0.0022270563,0.0015428815,0.002191887],"category_scores_gemma":[0.0048207804,0.00063262327,0.0008185113,0.0012026449,0.0014686855,0.0023796763,0.0012342441,0.0013709611,0.00031141227],"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.00012290035,0.00007421476,0.0024882457,0.000028207698,0.00002804341,0.00028763813,0.00012963271,0.9537294,0.0015038317,0.03825975,0.00041308845,0.0029350016],"study_design_scores_gemma":[0.000009350678,0.000027169588,0.0001769741,0.000003299489,0.0000074356262,0.000028120563,0.000019207326,0.994709,0.00011042454,0.0046898974,0.00021147887,0.000007579996],"about_ca_topic_score_codex":0.012062367,"about_ca_topic_score_gemma":0.006078919,"teacher_disagreement_score":0.012062367,"about_ca_system_score_codex":0.0026264589,"about_ca_system_score_gemma":0.0014608394,"threshold_uncertainty_score":0.023984313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028050153,0.00083408406,0.9631866,0.0025190494,0.000060217557,0.000049398503,0.000065619744,0.00009681041,0.0051380694],"genre_scores_gemma":[0.8195227,0.0014705552,0.17432791,0.00046559918,0.00028735877,0.00026628276,0.00012568869,0.00014065516,0.0033933553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911821,0.0064665424,0.00019018383,0.00062003837,0.0011077863,0.00043332824],"domain_scores_gemma":[0.94927025,0.04579017,0.0022374261,0.001300549,0.00089131837,0.00051035546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015336143,0.0021416722,0.0026829792,0.0012288586,0.0011421894,0.003984385,0.0021346807,0.00296687,0.0017723561],"category_scores_gemma":[0.040288366,0.001558697,0.0019774796,0.0016382165,0.0038943954,0.0062895683,0.002892326,0.005549954,0.0001872892],"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.000038815517,0.0000310064,0.00022949903,0.0000380123,0.000027964168,0.000038711747,0.000033459022,0.9161967,0.00011585499,0.07901013,0.0002319493,0.004007857],"study_design_scores_gemma":[0.000008441181,0.000024636996,0.00005106798,0.000016301057,0.000010626457,0.000008002497,0.000011284007,0.93423843,0.000088487584,0.06528389,0.00024779732,0.00001096179],"about_ca_topic_score_codex":0.0054459088,"about_ca_topic_score_gemma":0.0038283188,"teacher_disagreement_score":0.015336143,"about_ca_system_score_codex":0.0041700443,"about_ca_system_score_gemma":0.0035572674,"threshold_uncertainty_score":0.081106246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720115,0.00032551133,0.9743518,0.00024771556,0.00004719977,0.000056767447,0.00019339228,0.0000986246,0.0074778018],"genre_scores_gemma":[0.58755827,0.0015280244,0.39302024,0.0002839635,0.00017350611,0.0005060855,0.0004943734,0.00034227493,0.016093275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988938,0.0005345884,0.000026249625,0.0002002068,0.00023620967,0.00010899286],"domain_scores_gemma":[0.99881244,0.0007870282,0.00014242239,0.000086620385,0.00010060951,0.00007095288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00229372,0.0014485512,0.0013240308,0.0007362605,0.00040815966,0.001529404,0.0020086064,0.0012703545,0.0055072415],"category_scores_gemma":[0.0024430428,0.0005692369,0.0009541684,0.0013712451,0.0011138985,0.002363223,0.0011613606,0.0015391419,0.00061573443],"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.000049893788,0.00004866958,0.00017578917,0.00014390358,0.00003107486,0.00009025986,0.000055441687,0.88995713,0.0022312778,0.08741738,0.0021524453,0.017646752],"study_design_scores_gemma":[0.000007926537,0.00005480385,0.00008768144,0.000011930105,0.0000084543,0.000041471052,0.000020743746,0.96196985,0.00056799175,0.03545422,0.0017667752,0.0000081172575],"about_ca_topic_score_codex":0.001212052,"about_ca_topic_score_gemma":0.0016123434,"teacher_disagreement_score":0.0055072415,"about_ca_system_score_codex":0.0019277489,"about_ca_system_score_gemma":0.0012686937,"threshold_uncertainty_score":0.018423498},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077751465,0.00060678076,0.9156034,0.00068672735,0.00019189111,0.00012884053,0.00013085663,0.0005709399,0.0043291138],"genre_scores_gemma":[0.7550328,0.000506239,0.23640575,0.00018490461,0.00019849688,0.0001734712,0.00017288837,0.00024777587,0.007077692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940347,0.003351178,0.0002426169,0.0007962904,0.0009184461,0.00065678335],"domain_scores_gemma":[0.99211884,0.0047258986,0.0010986713,0.0010089745,0.0005709333,0.00047666222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070077893,0.0013747455,0.002153044,0.00075757696,0.0011181872,0.002387006,0.0024698914,0.0012857635,0.0031164275],"category_scores_gemma":[0.015307475,0.001065793,0.0008467097,0.0017706772,0.002012398,0.004049423,0.0014105828,0.00217637,0.0006431981],"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.00045366588,0.000078150675,0.0003797221,0.0001285655,0.000034281762,0.00018482756,0.00022818867,0.90063083,0.002214363,0.07405176,0.0012603801,0.020355372],"study_design_scores_gemma":[0.000048076283,0.0001135632,0.00014347603,0.000012769989,0.000016075044,0.00006345761,0.000046280566,0.94318235,0.0010136616,0.053501647,0.0018324151,0.000026260352],"about_ca_topic_score_codex":0.003939516,"about_ca_topic_score_gemma":0.0032248516,"teacher_disagreement_score":0.0070077893,"about_ca_system_score_codex":0.002846662,"about_ca_system_score_gemma":0.002302371,"threshold_uncertainty_score":0.037061214},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09120855,0.00068583695,0.9011776,0.00045616998,0.000056743283,0.00009479577,0.0001766477,0.0006754746,0.0054682116],"genre_scores_gemma":[0.92882603,0.00035214116,0.0687109,0.00012964648,0.00005734764,0.000094694755,0.000113820795,0.000097569675,0.0016178191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731404,0.0008588479,0.00015937089,0.0004047122,0.00067707355,0.0005858245],"domain_scores_gemma":[0.99050283,0.0056145587,0.0017169394,0.0008442658,0.0007709486,0.0005504194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037722117,0.0014434597,0.0013943765,0.00076620036,0.0006389374,0.00188235,0.0016500707,0.0011929668,0.0025819307],"category_scores_gemma":[0.01506347,0.00065827725,0.0007111158,0.00093897176,0.0016580818,0.0019472917,0.0019619733,0.001845864,0.00036858523],"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.00019102135,0.00007027658,0.0006189971,0.00009106894,0.000027463235,0.000056043536,0.0000676205,0.9570039,0.0022435628,0.03068787,0.0006118136,0.008330495],"study_design_scores_gemma":[0.000012157182,0.000042187286,0.00009821249,0.000008866741,0.00000432438,0.000013817786,0.000006781349,0.9896365,0.00069393084,0.009324351,0.0001517262,0.00000713603],"about_ca_topic_score_codex":0.0036074936,"about_ca_topic_score_gemma":0.0017108414,"teacher_disagreement_score":0.0037722117,"about_ca_system_score_codex":0.0025885038,"about_ca_system_score_gemma":0.002431498,"threshold_uncertainty_score":0.019949615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02404339,0.0012018434,0.9549042,0.0014525396,0.00015350604,0.00014299838,0.00018055187,0.00039612464,0.01752489],"genre_scores_gemma":[0.67634547,0.002257982,0.30722675,0.0011811471,0.00039834285,0.0005503772,0.00026847245,0.00044938127,0.0113220895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968606,0.0011443774,0.00018688728,0.00067717204,0.00057181565,0.0005590686],"domain_scores_gemma":[0.98908025,0.00810623,0.0008136265,0.0010060143,0.00048722493,0.00050668506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040125377,0.0015970118,0.0021290977,0.00092473,0.0011410128,0.002809981,0.0022973402,0.002329195,0.00782445],"category_scores_gemma":[0.02231405,0.0010564931,0.0015687331,0.001125734,0.0034861749,0.005189856,0.004148136,0.003519642,0.0011648013],"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.0003481194,0.0001537271,0.0019071569,0.00032394635,0.00011013677,0.00028110694,0.00023299771,0.68829226,0.0037005646,0.26597127,0.005659178,0.0330195],"study_design_scores_gemma":[0.00007364025,0.00015474459,0.00024242271,0.00007071224,0.000036476304,0.00009790616,0.000050896335,0.8039132,0.0011042962,0.19160554,0.0026156208,0.00003457907],"about_ca_topic_score_codex":0.004493981,"about_ca_topic_score_gemma":0.0028175535,"teacher_disagreement_score":0.00782445,"about_ca_system_score_codex":0.0015050647,"about_ca_system_score_gemma":0.0029511282,"threshold_uncertainty_score":0.02617538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014694402,0.00037725212,0.9712478,0.00034831802,0.00009813234,0.00024018581,0.00035897733,0.0017947343,0.010840317],"genre_scores_gemma":[0.13829431,0.00031993332,0.85546625,0.0001730048,0.00006816189,0.00039181896,0.0009878563,0.00037105713,0.0039276737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990772,0.00016443523,0.00004376156,0.00025956923,0.00026198704,0.00019310568],"domain_scores_gemma":[0.9983773,0.0009601015,0.00012201927,0.0002751271,0.0001963784,0.000069072776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097038044,0.0015825342,0.0014525024,0.0012913075,0.00082997745,0.0019165111,0.002353395,0.0016057113,0.012906785],"category_scores_gemma":[0.003898052,0.00076847966,0.0010792691,0.0023482733,0.0007182005,0.0024154799,0.0014130392,0.0016965759,0.0018171482],"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.00013399287,0.0002446973,0.0004978155,0.00025701115,0.000042052456,0.00010231879,0.00009786473,0.71377945,0.0017010801,0.03400228,0.009115466,0.24002595],"study_design_scores_gemma":[0.00006761406,0.000046530557,0.00009263092,0.000013617751,0.000012380223,0.000051293653,0.000033445798,0.97077405,0.0005076939,0.026173852,0.0022176448,0.000009138638],"about_ca_topic_score_codex":0.008888902,"about_ca_topic_score_gemma":0.011267917,"teacher_disagreement_score":0.012906785,"about_ca_system_score_codex":0.0020971429,"about_ca_system_score_gemma":0.003813878,"threshold_uncertainty_score":0.043177485},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006819979,0.00014967809,0.9851525,0.00026316967,0.00002533446,0.00014323796,0.00013902946,0.000068508416,0.0072385576],"genre_scores_gemma":[0.33564168,0.0005774197,0.6604364,0.00007747098,0.00004389429,0.000645181,0.00034109605,0.00004967011,0.002187224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98721075,0.0072512394,0.0006453237,0.0011819528,0.0032794238,0.00043138504],"domain_scores_gemma":[0.9884129,0.0074692103,0.0012003434,0.0008104949,0.0019477985,0.00015931124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014658041,0.0017460802,0.0013955223,0.0038204216,0.00090241444,0.005330577,0.0017704708,0.0010902766,0.0022922321],"category_scores_gemma":[0.020696644,0.0006409877,0.0015410872,0.0049060644,0.0014681555,0.0032265824,0.002696348,0.0031940585,0.0004343114],"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.000024984422,0.00010413244,0.0017346141,0.00010982918,0.00009637273,0.000049720493,0.00012435667,0.60904664,0.00043575623,0.3382387,0.00061627664,0.049418524],"study_design_scores_gemma":[0.00001826787,0.000057607223,0.0008597949,0.000064725646,0.000026576326,0.000020926247,0.000100543744,0.8311129,0.00091155,0.15932864,0.0074609932,0.000037474696],"about_ca_topic_score_codex":0.011573315,"about_ca_topic_score_gemma":0.013271745,"teacher_disagreement_score":0.014658041,"about_ca_system_score_codex":0.0053742067,"about_ca_system_score_gemma":0.006876769,"threshold_uncertainty_score":0.07752007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028997748,0.00013015255,0.9927355,0.00028973309,0.000028506807,0.000054833465,0.00006983886,0.000096078365,0.0036956102],"genre_scores_gemma":[0.39913535,0.00094805437,0.5927395,0.00017444472,0.00012997228,0.00065301085,0.00027904275,0.00014576263,0.0057948395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983936,0.001098294,0.000054985394,0.00015440078,0.00020953834,0.00008908683],"domain_scores_gemma":[0.99757856,0.0018312177,0.00017337686,0.00007286018,0.0002493983,0.000094627336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021467307,0.0010240166,0.00092260336,0.000916939,0.0007699229,0.0012055737,0.0015274792,0.0008835631,0.0035652183],"category_scores_gemma":[0.004270973,0.0006217779,0.001076875,0.0014222689,0.0008438222,0.0010257468,0.00097242626,0.0017844985,0.00031097615],"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.0000071257023,0.000009775722,0.00012317576,0.000015232829,0.000017381495,0.000013950796,0.000018162571,0.9810658,0.000066064735,0.015076262,0.00022454417,0.0033624996],"study_design_scores_gemma":[0.000005053939,0.000009072778,0.00003256967,0.000005385305,0.000005025136,0.0000055243927,0.000009065133,0.9900359,0.000061341176,0.009029762,0.0007967901,0.0000044740887],"about_ca_topic_score_codex":0.015866656,"about_ca_topic_score_gemma":0.01277352,"teacher_disagreement_score":0.015866656,"about_ca_system_score_codex":0.0022924806,"about_ca_system_score_gemma":0.0033554095,"threshold_uncertainty_score":0.03154862},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015432352,0.00004026059,0.9975719,0.000049554303,0.000009891692,0.000028955339,0.000013458551,0.00016213248,0.0005806267],"genre_scores_gemma":[0.08161401,0.000087043576,0.91639966,0.00009838763,0.000021174435,0.00031367442,0.00014746931,0.0001411226,0.001177398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.00039883447,0.0000407115,0.00010527683,0.00025690836,0.00005870473],"domain_scores_gemma":[0.9974247,0.0017485631,0.00018213723,0.00015171997,0.00040709105,0.00008569798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018125364,0.0009795135,0.0010243581,0.00066105736,0.0004767283,0.0008501521,0.001488279,0.0012308136,0.0043217223],"category_scores_gemma":[0.0054796073,0.0006685373,0.00086747296,0.0008697971,0.0010110134,0.0008868441,0.0016421659,0.002057298,0.0008585598],"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.000074046045,0.00005401899,0.000283893,0.00008794938,0.00002243339,0.000076431505,0.00007103771,0.91401815,0.0012318667,0.015576162,0.0019542181,0.066549785],"study_design_scores_gemma":[0.000012185969,0.000011301414,0.00001572148,0.0000045400525,0.0000017816291,0.000010705362,0.0000031991917,0.9964419,0.00028240605,0.002754765,0.0004582008,0.0000033025838],"about_ca_topic_score_codex":0.004178121,"about_ca_topic_score_gemma":0.0029793635,"teacher_disagreement_score":0.0043217223,"about_ca_system_score_codex":0.00080633024,"about_ca_system_score_gemma":0.0017783544,"threshold_uncertainty_score":0.014457583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41745308,0.00014364751,0.5738594,0.0005479181,0.000017852919,0.00023653463,0.00008594658,0.00009176956,0.007563855],"genre_scores_gemma":[0.9759745,0.00007112258,0.02258181,0.000030855655,0.000006232142,0.00010194701,0.000018139484,0.000011856206,0.0012035026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845254,0.00068026455,0.00004552028,0.00015601295,0.00022956202,0.00043613353],"domain_scores_gemma":[0.99708134,0.0019211886,0.00030544103,0.00016166932,0.0002915356,0.00023880079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030346666,0.00082917785,0.0010738836,0.0010707573,0.0007173554,0.0019116283,0.0018272167,0.0013895638,0.003015183],"category_scores_gemma":[0.0064738416,0.00051829236,0.00072541897,0.001143558,0.0015158124,0.0024297556,0.001798781,0.0007647408,0.00016974822],"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.00009616111,0.000054699896,0.0005024032,0.000027268261,0.000028257164,0.00007856079,0.00009749544,0.97672653,0.00083403685,0.016588552,0.00012700557,0.0048390487],"study_design_scores_gemma":[0.000020748059,0.00005432988,0.00017843072,0.000004731969,0.000015491827,0.000017075483,0.000068297304,0.99094546,0.00033742542,0.008192111,0.00015808748,0.000007840326],"about_ca_topic_score_codex":0.008908638,"about_ca_topic_score_gemma":0.004998631,"teacher_disagreement_score":0.008908638,"about_ca_system_score_codex":0.0038528333,"about_ca_system_score_gemma":0.0021216404,"threshold_uncertainty_score":0.02795434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01078951,0.0002390252,0.98692,0.0001414334,0.00002085655,0.000033830514,0.000095242285,0.0001409172,0.0016191335],"genre_scores_gemma":[0.8023133,0.0008025572,0.1884688,0.00014809455,0.00012445658,0.00035114237,0.0006243885,0.0003250509,0.0068421434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867177,0.00054011313,0.000050465813,0.00024619047,0.0002931734,0.00019829917],"domain_scores_gemma":[0.9964263,0.0024919386,0.00044346187,0.00019476021,0.00028790726,0.00015568208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028209584,0.0013397607,0.0014414961,0.0011563634,0.0005068185,0.0012102218,0.0014794568,0.0010449487,0.002567696],"category_scores_gemma":[0.008312853,0.00084156985,0.0010832223,0.0009369981,0.0013072224,0.0013436383,0.001711093,0.0013481888,0.00036037853],"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.000030100811,0.00000754013,0.00017714762,0.0000235881,0.00001859843,0.000019624718,0.000021958342,0.97868675,0.0003936657,0.0166745,0.00029550816,0.003651014],"study_design_scores_gemma":[0.0000030619399,0.0000070068327,0.000058892387,0.0000035033343,0.0000028252523,0.0000055308956,0.0000057474654,0.98872197,0.00010427836,0.010845614,0.00023835365,0.0000032337755],"about_ca_topic_score_codex":0.006016161,"about_ca_topic_score_gemma":0.0034474651,"teacher_disagreement_score":0.006016161,"about_ca_system_score_codex":0.0024360558,"about_ca_system_score_gemma":0.001162153,"threshold_uncertainty_score":0.017674923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047335144,0.0011994039,0.942142,0.0009970512,0.00017612205,0.000063114065,0.0003015909,0.00027319972,0.0075124446],"genre_scores_gemma":[0.9116751,0.002196971,0.07028566,0.0003883806,0.00044253748,0.00015303146,0.00040932262,0.00025037,0.014198571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988938,0.00031958346,0.000055003187,0.00015868126,0.0003775077,0.00019552406],"domain_scores_gemma":[0.9954722,0.0026133603,0.0007040811,0.0003382128,0.00063599146,0.00023621104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029931478,0.0007931296,0.0015451264,0.0013040743,0.0005922548,0.0015503074,0.0027254869,0.0011780148,0.00806444],"category_scores_gemma":[0.011255073,0.0007702216,0.0018826473,0.0014562593,0.0018226166,0.0032534173,0.0018553106,0.002202978,0.00080792035],"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.00008860165,0.00007965731,0.0022501252,0.00029793594,0.00008239953,0.00085671165,0.00032686978,0.746884,0.0032183467,0.22755854,0.0032741686,0.015082664],"study_design_scores_gemma":[0.0000059074805,0.000022835166,0.00023635142,0.000018152175,0.000013402342,0.00010897623,0.0000423036,0.94791424,0.00031663588,0.050508264,0.0007946709,0.00001826186],"about_ca_topic_score_codex":0.0066952007,"about_ca_topic_score_gemma":0.0036484317,"teacher_disagreement_score":0.00806444,"about_ca_system_score_codex":0.0015015268,"about_ca_system_score_gemma":0.0020993883,"threshold_uncertainty_score":0.026978254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13036823,0.0011788224,0.83998716,0.0018590031,0.00015125,0.00019088475,0.0009459894,0.00069190795,0.024626788],"genre_scores_gemma":[0.963003,0.00063727587,0.030796818,0.00008306837,0.000043805696,0.00009212755,0.00032508024,0.00006611322,0.004952738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995449,0.00010764144,0.000017306253,0.0001357866,0.0000914465,0.000102933314],"domain_scores_gemma":[0.99910396,0.00046455974,0.00014380935,0.00005822432,0.00013579546,0.00009366897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009367852,0.00069399027,0.0005777855,0.0005853519,0.00060382247,0.0014636242,0.0016695323,0.0010221141,0.0059037353],"category_scores_gemma":[0.0032213249,0.00034388812,0.00031858947,0.0009587722,0.0005821496,0.0023602108,0.0009842799,0.00078499125,0.00030125387],"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.000023887396,0.000015391037,0.00042240872,0.000027594937,0.0000120425575,0.000041169496,0.00002197613,0.97620165,0.00036183084,0.009686873,0.0009175721,0.012267704],"study_design_scores_gemma":[0.0000043434447,0.0000129534,0.00016593987,0.000006578533,0.0000069953094,0.000016582493,0.000027406582,0.9897278,0.0003332211,0.008507984,0.0011834361,0.0000067041065],"about_ca_topic_score_codex":0.015265371,"about_ca_topic_score_gemma":0.009945392,"teacher_disagreement_score":0.015265371,"about_ca_system_score_codex":0.002130789,"about_ca_system_score_gemma":0.001342461,"threshold_uncertainty_score":0.03035307},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084025075,0.00019860077,0.99695,0.00026605264,0.000076862176,0.00007847702,0.000049285238,0.00006905439,0.0014714192],"genre_scores_gemma":[0.17769451,0.0017643102,0.8115542,0.000690786,0.0012811844,0.000690248,0.00042630231,0.00019864511,0.005699838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99401206,0.0030959228,0.000207899,0.0007280608,0.0016676177,0.00028850048],"domain_scores_gemma":[0.9903442,0.0072723166,0.00051622395,0.0007438929,0.0007801711,0.0003431383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007187024,0.0011703928,0.001503565,0.0014080865,0.0011165289,0.001975023,0.0039793453,0.0013980471,0.007457529],"category_scores_gemma":[0.020711947,0.00093513407,0.0018682104,0.0022231042,0.0016223005,0.0025853147,0.0028899424,0.0038264352,0.0012527818],"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.00019950574,0.00022755562,0.0016471731,0.0003183477,0.00012546348,0.00026968936,0.00018185657,0.67141247,0.0026517874,0.23467599,0.00832606,0.079964064],"study_design_scores_gemma":[0.00002566573,0.000059528415,0.00019115934,0.000022053659,0.00001753562,0.00008600702,0.000018767887,0.94813323,0.00039412634,0.047035817,0.0040007895,0.000015284806],"about_ca_topic_score_codex":0.0047103195,"about_ca_topic_score_gemma":0.0043119276,"teacher_disagreement_score":0.007457529,"about_ca_system_score_codex":0.0017369756,"about_ca_system_score_gemma":0.0024820913,"threshold_uncertainty_score":0.038009048},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040425774,0.0016724968,0.92094743,0.0038723606,0.00031075702,0.000084978805,0.00015537466,0.00017791381,0.03235295],"genre_scores_gemma":[0.9430657,0.0015040869,0.033087835,0.0002960326,0.00046706304,0.00013239056,0.00009803543,0.00007774198,0.021271046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757606,0.0008943509,0.00008366955,0.0004216667,0.0006178482,0.0004064545],"domain_scores_gemma":[0.99729437,0.0015613395,0.0004685779,0.00017541558,0.00028359023,0.00021678604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024727338,0.0012359846,0.0010722894,0.0007030345,0.00069426803,0.004020616,0.002339034,0.0030459303,0.0044189696],"category_scores_gemma":[0.008037688,0.0007025633,0.0010537128,0.00093836535,0.0029510974,0.0049210554,0.0013288979,0.0030403736,0.00066950935],"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.00003315168,0.000055511515,0.0003128104,0.000039933675,0.000016790955,0.00015327017,0.00008817553,0.4208879,0.00058142596,0.5677876,0.0012217357,0.008821772],"study_design_scores_gemma":[0.000027201193,0.000050440263,0.00021292907,0.0000196944,0.000013654199,0.000089905174,0.000035358455,0.70832103,0.00022720698,0.2876247,0.003347657,0.00003017961],"about_ca_topic_score_codex":0.003791785,"about_ca_topic_score_gemma":0.0018493473,"teacher_disagreement_score":0.0044189696,"about_ca_system_score_codex":0.0031965144,"about_ca_system_score_gemma":0.0018586692,"threshold_uncertainty_score":0.023192406},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5703729,0.00050573185,0.4140071,0.0014991228,0.00009592149,0.00019251752,0.0009198575,0.0005975179,0.011809363],"genre_scores_gemma":[0.99103105,0.000091730486,0.006519779,0.000034391487,0.00002284278,0.00004236903,0.00012658794,0.000020046606,0.0021112836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998106,0.0006240122,0.000089027024,0.00029453164,0.0002877206,0.0005986868],"domain_scores_gemma":[0.99436176,0.0032979362,0.00089032936,0.0003665338,0.00048782493,0.0005956749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026312848,0.0008843935,0.0014064199,0.0006776562,0.000751711,0.002172543,0.002316316,0.0013549448,0.004619836],"category_scores_gemma":[0.0052225827,0.0011808082,0.0008918895,0.0007500426,0.0011931253,0.0025234637,0.0014181128,0.0016058589,0.00058926246],"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.0002813038,0.00008284257,0.0012405429,0.000036889498,0.00004024297,0.00021595541,0.00007073903,0.96616817,0.0008779786,0.025212413,0.0007522048,0.005020707],"study_design_scores_gemma":[0.000026471547,0.00002163747,0.00024057941,0.0000028452237,0.000007086778,0.000024441215,0.000017975512,0.99137247,0.00014895026,0.007965284,0.00016335273,0.000009025553],"about_ca_topic_score_codex":0.0101928,"about_ca_topic_score_gemma":0.0076083457,"teacher_disagreement_score":0.0101928,"about_ca_system_score_codex":0.002867483,"about_ca_system_score_gemma":0.0015403961,"threshold_uncertainty_score":0.02080518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017545557,0.00029588747,0.97751063,0.000117430754,0.00004588867,0.000059559326,0.000035907757,0.0003245699,0.0040646233],"genre_scores_gemma":[0.2815878,0.00034466223,0.7133792,0.00014367606,0.000053801195,0.00032233464,0.00018077594,0.000087746695,0.0039000676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971205,0.000081620405,0.000009580685,0.000045935874,0.000115661875,0.0000351042],"domain_scores_gemma":[0.9998093,0.00009963055,0.000022041619,0.000021375148,0.000034399985,0.000013211427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106041,0.00067302916,0.00068555964,0.000745024,0.0003546001,0.0006270249,0.0013903639,0.0011693259,0.0015978668],"category_scores_gemma":[0.0008821351,0.0002939891,0.0005936496,0.0009120122,0.00044065205,0.0006613195,0.00071956415,0.0007064245,0.00030442458],"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.000026619458,0.000048739617,0.000356686,0.000038924227,0.000044465964,0.000060687176,0.00003701315,0.8929232,0.0017279919,0.016466228,0.0010799522,0.087189406],"study_design_scores_gemma":[0.000017493943,0.000029908653,0.000066825494,0.0000048988986,0.000008230686,0.000025461915,0.0000065615745,0.99490756,0.000289667,0.0032015133,0.0014378768,0.000003859448],"about_ca_topic_score_codex":0.003076952,"about_ca_topic_score_gemma":0.0035507847,"teacher_disagreement_score":0.003076952,"about_ca_system_score_codex":0.00053995365,"about_ca_system_score_gemma":0.0009768668,"threshold_uncertainty_score":0.006118059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049817212,0.00042992836,0.922901,0.0018155257,0.00022038145,0.0000899737,0.00053185504,0.0002569767,0.023937216],"genre_scores_gemma":[0.92416066,0.0008558004,0.042093776,0.0005410045,0.0003575825,0.0003622215,0.00062085333,0.00014020155,0.03086794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880993,0.0003154908,0.000049897804,0.00022860606,0.0003658958,0.00023015593],"domain_scores_gemma":[0.99834216,0.0008028845,0.00033632547,0.00016539528,0.0002080031,0.00014514435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014883397,0.0008644357,0.0010370826,0.00072466925,0.00084242556,0.0016982477,0.002462801,0.0016203206,0.0066692345],"category_scores_gemma":[0.0043382896,0.00043999494,0.0012642504,0.0006056114,0.002058731,0.0021217403,0.0019057066,0.0018265323,0.0010938024],"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.000049961043,0.000024966532,0.0010523825,0.00003965613,0.000041137107,0.00015564222,0.00012828593,0.58687174,0.0011165857,0.40382385,0.0021192469,0.0045764777],"study_design_scores_gemma":[0.000016577129,0.000024712974,0.0002762352,0.0000073029614,0.000013990355,0.00007468453,0.000028444974,0.92054045,0.00012969485,0.07607992,0.0027857104,0.000022310178],"about_ca_topic_score_codex":0.006292391,"about_ca_topic_score_gemma":0.003233634,"teacher_disagreement_score":0.0066692345,"about_ca_system_score_codex":0.0013004589,"about_ca_system_score_gemma":0.0011324665,"threshold_uncertainty_score":0.022310793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04942725,0.000372424,0.92767274,0.00040929898,0.00024754053,0.0006917603,0.0010564727,0.0033356012,0.016786907],"genre_scores_gemma":[0.72463423,0.0011154687,0.25277346,0.00016995877,0.00006568536,0.0024127017,0.0016146136,0.00028748857,0.01692641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986315,0.000046771147,0.000009482247,0.000019290928,0.00004703492,0.00001417588],"domain_scores_gemma":[0.99971205,0.00014962177,0.000019479023,0.000030190078,0.00004823772,0.000040436367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026557443,0.000785399,0.0006673809,0.00037339336,0.0003399489,0.0005766774,0.0011546649,0.00095045875,0.0068727774],"category_scores_gemma":[0.00077431666,0.00025194758,0.00053061976,0.00025944057,0.0003522925,0.0004448913,0.0009031679,0.0006125511,0.0006835692],"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.00029630726,0.00022273639,0.001541391,0.0003022563,0.000066220346,0.00031791083,0.00019246819,0.9189228,0.019551782,0.010174069,0.0037060687,0.044705983],"study_design_scores_gemma":[0.00007034044,0.00021322277,0.0004390278,0.000025359097,0.000028225306,0.00012877713,0.000028049491,0.98073936,0.002778537,0.0023040976,0.0132207945,0.000024208277],"about_ca_topic_score_codex":0.0027952322,"about_ca_topic_score_gemma":0.0017455402,"teacher_disagreement_score":0.0068727774,"about_ca_system_score_codex":0.00036542938,"about_ca_system_score_gemma":0.00093799137,"threshold_uncertainty_score":0.022991717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42660353,0.00035383066,0.5671524,0.0010541528,0.00007428221,0.00008111624,0.00011343841,0.0004031452,0.004164048],"genre_scores_gemma":[0.9878984,0.000117083444,0.011161435,0.00003840448,0.0000181171,0.000039180024,0.000022620365,0.000023943645,0.00068083993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887043,0.00040067962,0.000052596617,0.00016664191,0.00016462179,0.00034495434],"domain_scores_gemma":[0.9967303,0.0018203916,0.000541061,0.00032392668,0.00021371956,0.00037053117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029823042,0.0009811751,0.0009267936,0.0004777575,0.00087816926,0.0012797286,0.0016297075,0.0012419358,0.001736931],"category_scores_gemma":[0.009139747,0.00040308712,0.0005068161,0.0008950428,0.0015290006,0.002268087,0.0016229035,0.0011040043,0.00019800176],"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.000079869424,0.000017881459,0.00035276744,0.0000177614,0.000012876389,0.00009004496,0.000064324864,0.9828992,0.0013348858,0.010785767,0.00020588373,0.004138738],"study_design_scores_gemma":[0.00002656774,0.0000580357,0.00027732895,0.0000070726837,0.000010085843,0.000028898146,0.000076025746,0.9755704,0.0008021302,0.022825373,0.0003026694,0.000015495702],"about_ca_topic_score_codex":0.005845392,"about_ca_topic_score_gemma":0.0031446426,"teacher_disagreement_score":0.005845392,"about_ca_system_score_codex":0.0013558142,"about_ca_system_score_gemma":0.0014292601,"threshold_uncertainty_score":0.015772104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01791177,0.0017047233,0.9504341,0.010205511,0.0003451609,0.00014231284,0.00014344993,0.00009261214,0.019020429],"genre_scores_gemma":[0.6657058,0.006910932,0.30673364,0.0027954355,0.0019422995,0.0004829706,0.00024604617,0.00010475418,0.015078047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982041,0.00088963815,0.00007205485,0.0003899803,0.00026882353,0.00017535873],"domain_scores_gemma":[0.9985852,0.00076749607,0.00016437338,0.00012613887,0.00019619278,0.00016055311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024712933,0.0011850242,0.0013309307,0.00059756514,0.0008592268,0.003936366,0.0016450838,0.0029866034,0.007579221],"category_scores_gemma":[0.004196228,0.00052525656,0.0009784456,0.00086156087,0.0018518171,0.004112184,0.0017208706,0.0026626075,0.00061768823],"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.00012047911,0.00016984946,0.00095485366,0.00042517236,0.00010111589,0.00031627735,0.0002729252,0.6054883,0.0030476812,0.35613957,0.0031234173,0.029840367],"study_design_scores_gemma":[0.00007926491,0.00024772022,0.00042532844,0.00011646222,0.00006277346,0.00013517946,0.00034808094,0.7100683,0.000993591,0.2731486,0.014324733,0.00005007678],"about_ca_topic_score_codex":0.0032283713,"about_ca_topic_score_gemma":0.0022894028,"teacher_disagreement_score":0.007579221,"about_ca_system_score_codex":0.0018474619,"about_ca_system_score_gemma":0.0028206273,"threshold_uncertainty_score":0.025354981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348171,0.0007543993,0.35607126,0.00069065084,0.00005781067,0.00018123773,0.00030107543,0.0007313541,0.00639519],"genre_scores_gemma":[0.9950433,0.00010632773,0.004068764,0.000029865672,0.000008497522,0.000028330991,0.00004099608,0.000024011431,0.00064988906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984018,0.0005008083,0.00009418105,0.0002365265,0.0003362309,0.0004304217],"domain_scores_gemma":[0.98688775,0.008177907,0.002736769,0.0007775501,0.0008441546,0.0005759075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004758288,0.0012143442,0.0015151037,0.0010580225,0.00063124165,0.0018065168,0.0016887385,0.0012980272,0.0017459148],"category_scores_gemma":[0.022705654,0.0005896771,0.0008181889,0.0005032845,0.0015360826,0.001606053,0.0014642809,0.0014571734,0.00023187736],"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.00027357208,0.000051820996,0.0012442337,0.00005639522,0.00007272557,0.00013739064,0.00009938018,0.9799447,0.0028155786,0.011073167,0.000262164,0.003968965],"study_design_scores_gemma":[0.000028267903,0.00008732324,0.0004770746,0.0000105656745,0.000017558637,0.000021081862,0.00003331072,0.9900629,0.0010409327,0.008083054,0.0001233472,0.000014576153],"about_ca_topic_score_codex":0.008022688,"about_ca_topic_score_gemma":0.0021714524,"teacher_disagreement_score":0.008022688,"about_ca_system_score_codex":0.0024972528,"about_ca_system_score_gemma":0.0014530213,"threshold_uncertainty_score":0.025164485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101917535,0.000630844,0.8914302,0.00045632877,0.00003413368,0.000092954135,0.00020498382,0.00018650788,0.0050464794],"genre_scores_gemma":[0.8121746,0.0008176749,0.18361884,0.00012566375,0.00004771159,0.00019739314,0.00032616835,0.00009810484,0.0025939129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867105,0.0007622893,0.000040920342,0.00015319094,0.00020775912,0.00016476844],"domain_scores_gemma":[0.99662966,0.0026142977,0.00032678936,0.00022836497,0.000116106035,0.00008479008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002043032,0.0011663368,0.0011377373,0.00055434677,0.0005218101,0.0014322045,0.000865891,0.00074742193,0.0024962574],"category_scores_gemma":[0.0074086017,0.00057808484,0.00071271526,0.0022271136,0.00085240253,0.0022628747,0.0013389176,0.0019388775,0.00018227499],"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.00004311862,0.000025749638,0.00025226502,0.000050787643,0.00001940286,0.0000332683,0.000058418213,0.9724071,0.00042856598,0.016701981,0.0003428493,0.009636566],"study_design_scores_gemma":[0.000011357873,0.00003662494,0.00013208583,0.000009546063,0.000010672736,0.000018658191,0.000030992964,0.9829108,0.000347425,0.01566386,0.00082379294,0.0000041375883],"about_ca_topic_score_codex":0.0031874082,"about_ca_topic_score_gemma":0.002993458,"teacher_disagreement_score":0.0031874082,"about_ca_system_score_codex":0.0012946874,"about_ca_system_score_gemma":0.00083036424,"threshold_uncertainty_score":0.010804772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7334732,0.00070854224,0.20658746,0.0022116809,0.00012510826,0.00023001869,0.0019447689,0.00040381012,0.05431538],"genre_scores_gemma":[0.98627704,0.00020709944,0.0035983373,0.00007332771,0.000019952364,0.00009796437,0.00028409067,0.000033242733,0.009408926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.00010070259,0.000011485739,0.00006987589,0.00006107484,0.00012808277],"domain_scores_gemma":[0.99910563,0.00044451994,0.00019039922,0.000036967893,0.00014349094,0.0000788464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419958,0.0009019798,0.0008741706,0.00067975547,0.0007395596,0.0015979557,0.0014187443,0.002067533,0.004218776],"category_scores_gemma":[0.0020073508,0.0005164354,0.0006639479,0.00046461524,0.00092035835,0.0014164095,0.001124398,0.0011119933,0.000760783],"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.000021953214,0.000018727718,0.0009458805,0.000008672233,0.000008519872,0.000034505847,0.000022296354,0.9942866,0.00020620118,0.0034881239,0.00022771362,0.0007308215],"study_design_scores_gemma":[0.000008349742,0.00002080062,0.00043606356,0.000002709325,0.0000034558866,0.000009910506,0.000021470383,0.99803585,0.000043725955,0.0011822407,0.00022922215,0.0000062503946],"about_ca_topic_score_codex":0.042605024,"about_ca_topic_score_gemma":0.018032243,"teacher_disagreement_score":0.042605024,"about_ca_system_score_codex":0.0020989897,"about_ca_system_score_gemma":0.0013710206,"threshold_uncertainty_score":0.084714055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004589624,0.0018782145,0.9824572,0.0008063253,0.00009033287,0.00006266282,0.00023254612,0.00016534979,0.009717652],"genre_scores_gemma":[0.52592844,0.008556061,0.4233894,0.0007189661,0.00047770303,0.0014914438,0.0007707402,0.00020963972,0.03845761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993704,0.00031525025,0.000018520615,0.0000876013,0.00011954954,0.00008879991],"domain_scores_gemma":[0.9987381,0.0008052726,0.00016174163,0.000045992685,0.00018054925,0.000068290894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011571054,0.0012372426,0.0012313179,0.0009882055,0.00061427284,0.0018956576,0.002917998,0.0029027495,0.0074877464],"category_scores_gemma":[0.0033777216,0.00074229675,0.0012177774,0.0022257587,0.0013649501,0.0017683922,0.0016886612,0.0016379022,0.0014612582],"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.000013219435,0.000030277457,0.000110752764,0.00008296794,0.000016643098,0.000027637592,0.00003541583,0.92511916,0.00009534673,0.06646273,0.001913004,0.006092858],"study_design_scores_gemma":[0.000009733514,0.0000101554815,0.000022267195,0.000015381023,0.0000038203166,0.000009387162,0.000017565884,0.96952045,0.000036597386,0.028573753,0.0017735129,0.0000072945027],"about_ca_topic_score_codex":0.011599904,"about_ca_topic_score_gemma":0.005952666,"teacher_disagreement_score":0.011599904,"about_ca_system_score_codex":0.0017268602,"about_ca_system_score_gemma":0.0014669688,"threshold_uncertainty_score":0.025048971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034058116,0.0004273881,0.9310339,0.00024170418,0.00005354723,0.00015866398,0.00014000351,0.00028611993,0.033600662],"genre_scores_gemma":[0.569508,0.00070781197,0.41035235,0.00013347143,0.0000433625,0.00027280595,0.00024198258,0.000057877653,0.018682262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00009247185,0.0000080571235,0.000059767088,0.000097065786,0.000039727973],"domain_scores_gemma":[0.99983716,0.000050254108,0.000029901572,0.000021066591,0.00004992574,0.000011585813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031112056,0.00054193026,0.00019379953,0.00040908926,0.00034382046,0.0005745312,0.0006267984,0.00052119966,0.0051860902],"category_scores_gemma":[0.00044966917,0.00013993065,0.00022598122,0.00053201045,0.00031676076,0.0006219918,0.00043312978,0.000310713,0.00055126776],"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.00011408687,0.0000572659,0.00087408524,0.00015820387,0.000032216187,0.00014211684,0.00007013816,0.7524039,0.013735444,0.061577383,0.0033738185,0.16746125],"study_design_scores_gemma":[0.000018366365,0.00011364021,0.00020100042,0.000012195297,0.00001626712,0.00014450455,0.000036284033,0.96556574,0.0047049453,0.013060016,0.016117873,0.000009255018],"about_ca_topic_score_codex":0.0028105353,"about_ca_topic_score_gemma":0.0054942463,"teacher_disagreement_score":0.0051860902,"about_ca_system_score_codex":0.0007193359,"about_ca_system_score_gemma":0.0005973442,"threshold_uncertainty_score":0.017349184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108477995,0.0014449407,0.8621807,0.0010480286,0.000100814206,0.00012551318,0.00051925326,0.00020001955,0.025902716],"genre_scores_gemma":[0.55618536,0.0018564163,0.43343535,0.00018148059,0.00010860104,0.00020746044,0.0009400461,0.00011315791,0.006972129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996239,0.00016804368,0.000014385037,0.000054331187,0.00008418703,0.000055146265],"domain_scores_gemma":[0.9989623,0.000662905,0.00014888794,0.000085232685,0.000058733734,0.000082027764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081994105,0.00089179777,0.00038050086,0.0008711133,0.0005480664,0.0009487885,0.00052334723,0.0006289165,0.004053968],"category_scores_gemma":[0.0030660175,0.00041307567,0.00046144438,0.002186917,0.000874067,0.0017711543,0.00070172653,0.000980414,0.0002784485],"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.00011324407,0.00009537533,0.00079522183,0.00014019522,0.000024559884,0.00016671504,0.000102457256,0.7012072,0.0015241591,0.24459629,0.0041147037,0.047119807],"study_design_scores_gemma":[0.000021922697,0.000034029097,0.0005475999,0.00003060877,0.000013666953,0.00015625672,0.00009022581,0.72897,0.00076382415,0.26293054,0.0064304317,0.00001095405],"about_ca_topic_score_codex":0.0035421231,"about_ca_topic_score_gemma":0.004075176,"teacher_disagreement_score":0.004053968,"about_ca_system_score_codex":0.00096570305,"about_ca_system_score_gemma":0.0011530004,"threshold_uncertainty_score":0.013561904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91802436,0.00026596177,0.077107884,0.00046053054,0.0000355038,0.000104706654,0.00006940655,0.00013040502,0.0038012743],"genre_scores_gemma":[0.99387956,0.00008751369,0.004553361,0.00006975251,0.000027072138,0.000022085396,0.000032583182,0.000011724881,0.0013163278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978204,0.00062035915,0.00005522434,0.0004909106,0.00018712018,0.000826097],"domain_scores_gemma":[0.99572766,0.0020624644,0.00067148724,0.00021177235,0.0003009008,0.0010257317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032545603,0.0011256379,0.0014497242,0.00091178494,0.0021213626,0.0032852965,0.0020487644,0.002210526,0.00320707],"category_scores_gemma":[0.004213819,0.00088023883,0.00078972563,0.001202469,0.0019671977,0.003117903,0.0021623878,0.0015596456,0.0003441679],"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.0022787165,0.0010925521,0.01623124,0.00006814083,0.00028241923,0.0024987098,0.00050257606,0.9117384,0.011687658,0.027343452,0.0018229445,0.024453204],"study_design_scores_gemma":[0.000104068,0.0005582042,0.0062391334,0.000010148508,0.00009074921,0.00038743543,0.00072317536,0.98246723,0.0013854239,0.0074895737,0.0004851587,0.000059729602],"about_ca_topic_score_codex":0.013310749,"about_ca_topic_score_gemma":0.009312828,"teacher_disagreement_score":0.013310749,"about_ca_system_score_codex":0.0028198604,"about_ca_system_score_gemma":0.0014727693,"threshold_uncertainty_score":0.026466548},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35333198,0.0008040617,0.63184553,0.0011946199,0.00016948032,0.00012621401,0.00021559061,0.00056521513,0.011747304],"genre_scores_gemma":[0.9784759,0.00014184655,0.019438133,0.000056493787,0.000023945902,0.000029143366,0.00003721668,0.000047265752,0.0017500785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986765,0.00047407273,0.0000501627,0.00017808391,0.0002144982,0.0004067011],"domain_scores_gemma":[0.99520504,0.0029724848,0.00058893714,0.00030024137,0.00047460414,0.00045876403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022751433,0.00096068316,0.0014140818,0.00050836627,0.00085647416,0.0020883926,0.0013135086,0.0010658735,0.0024127236],"category_scores_gemma":[0.009932638,0.0007643372,0.00037751428,0.0008457711,0.0013951275,0.0018556964,0.0010925797,0.001234194,0.00041386],"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.0001805648,0.00004671845,0.00029767974,0.000028600387,0.000009310352,0.000050204293,0.00004899573,0.97761166,0.000928881,0.015764585,0.000543353,0.004489409],"study_design_scores_gemma":[0.000024323419,0.00002901758,0.00008589503,0.0000028870193,0.000004754958,0.000010196352,0.000024533416,0.9899234,0.00045737237,0.009278385,0.00015064355,0.000008537021],"about_ca_topic_score_codex":0.0075584357,"about_ca_topic_score_gemma":0.0049040555,"teacher_disagreement_score":0.0075584357,"about_ca_system_score_codex":0.002922809,"about_ca_system_score_gemma":0.002954555,"threshold_uncertainty_score":0.021206498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027514694,0.000111406516,0.9946668,0.000145266,0.000013674481,0.000020125908,0.0000103383645,0.000113898335,0.0021670144],"genre_scores_gemma":[0.7456462,0.0006368164,0.24419242,0.0002981475,0.00022710327,0.0005096638,0.000087043096,0.0002095768,0.008193042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989674,0.0005001562,0.000025078647,0.00015943672,0.00023980277,0.000108067994],"domain_scores_gemma":[0.9976978,0.0015492542,0.00018978781,0.00006670342,0.00038910506,0.00010724659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033802283,0.0010423547,0.0011875315,0.0006312284,0.00054016936,0.0013302129,0.0014719554,0.0014056212,0.0037409659],"category_scores_gemma":[0.005971422,0.0006004096,0.00065484917,0.00048153882,0.0013659786,0.0010848561,0.0015570229,0.0018812258,0.0005044499],"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.000037219717,0.000033609795,0.00015774685,0.0000756025,0.000018876322,0.00004011368,0.000043671407,0.96072215,0.0013118938,0.025003819,0.0007930342,0.011762264],"study_design_scores_gemma":[0.000004099691,0.0000098321625,0.000012755571,0.0000030158703,0.0000029132163,0.000002973835,0.0000035165776,0.99761707,0.00008695545,0.0020815087,0.00017301585,0.0000023319335],"about_ca_topic_score_codex":0.0054754824,"about_ca_topic_score_gemma":0.0026547648,"teacher_disagreement_score":0.0054754824,"about_ca_system_score_codex":0.0017246691,"about_ca_system_score_gemma":0.0018583932,"threshold_uncertainty_score":0.017876565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06067975,0.0009206661,0.93408656,0.0002740256,0.00004705875,0.00007210217,0.00003711243,0.00029158132,0.0035911563],"genre_scores_gemma":[0.92970467,0.0005409468,0.067826316,0.0000927671,0.000051017694,0.00015894187,0.00004353433,0.000066487606,0.0015153869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976878,0.0011410333,0.000075397365,0.0002735144,0.0004244995,0.00039773004],"domain_scores_gemma":[0.99742115,0.0017343573,0.00029170755,0.00021553725,0.00018633832,0.00015096743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027098504,0.0009319813,0.0011422314,0.0007989016,0.000970612,0.0017415306,0.0014043507,0.001086279,0.0014350394],"category_scores_gemma":[0.0084026335,0.0007103392,0.0005185137,0.0012741558,0.001919843,0.00248046,0.0015104646,0.0010082052,0.0002748008],"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.00005113342,0.000022847395,0.00011314494,0.00003208933,0.00001415589,0.000031708038,0.000055037206,0.9520967,0.0013262589,0.037672043,0.0002905294,0.008294322],"study_design_scores_gemma":[0.000009074705,0.000015361244,0.000029170762,0.0000041831377,0.0000045358274,0.000009414951,0.000010857687,0.97918093,0.00030909604,0.020074336,0.0003468102,0.000006231472],"about_ca_topic_score_codex":0.0036266223,"about_ca_topic_score_gemma":0.0027114323,"teacher_disagreement_score":0.0036266223,"about_ca_system_score_codex":0.0027724907,"about_ca_system_score_gemma":0.0017948629,"threshold_uncertainty_score":0.020115972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13969731,0.0009988575,0.85145104,0.0011938142,0.000063843014,0.000058629124,0.00012075387,0.00015522414,0.006260514],"genre_scores_gemma":[0.96663564,0.0006217406,0.029774021,0.00009490426,0.00008252757,0.000073421696,0.000050898874,0.0000610649,0.002605913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986721,0.0006897477,0.000035479698,0.00018249237,0.00014010094,0.00028001852],"domain_scores_gemma":[0.99404514,0.004078498,0.0010274962,0.00023493561,0.00036799192,0.0002459574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033949406,0.00092980516,0.0016293064,0.0008008154,0.0011804203,0.0015930414,0.0017512519,0.001995307,0.0032193367],"category_scores_gemma":[0.00836969,0.00091347937,0.0011859501,0.001485489,0.002262582,0.0027541223,0.0017108952,0.0014554954,0.00022178846],"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.00008436816,0.000029348064,0.00068154314,0.00006763403,0.000028902628,0.00011041262,0.000057766152,0.9508403,0.0006618701,0.04035675,0.0007366628,0.006344441],"study_design_scores_gemma":[0.000028268396,0.00009960122,0.00046769466,0.00002129046,0.000031010273,0.0001542386,0.00016085747,0.92782533,0.0007054615,0.06968556,0.0007994281,0.000021172415],"about_ca_topic_score_codex":0.004109711,"about_ca_topic_score_gemma":0.0031219071,"teacher_disagreement_score":0.004109711,"about_ca_system_score_codex":0.0020462049,"about_ca_system_score_gemma":0.0009834995,"threshold_uncertainty_score":0.01795441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043326095,0.0011509771,0.8843722,0.0013901036,0.00019635682,0.0002298884,0.0018027883,0.00042888438,0.06710272],"genre_scores_gemma":[0.81104314,0.0017340616,0.10080366,0.00020144615,0.0001585793,0.00062939443,0.00094521965,0.00015491793,0.08432959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990576,0.00030484193,0.00003951377,0.00019509008,0.00028859568,0.0001143432],"domain_scores_gemma":[0.9991003,0.0004923196,0.00014665989,0.00006982969,0.00014168557,0.000049164184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013634637,0.0013105446,0.0011383209,0.001180945,0.00062977266,0.0026687193,0.0025861582,0.0019122162,0.007130193],"category_scores_gemma":[0.0025541538,0.0007414536,0.0011807419,0.002037591,0.0012292484,0.0033113179,0.0010357349,0.0014129766,0.001121286],"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.00001976488,0.000014618336,0.00012742977,0.000025769636,0.000010399489,0.00006777342,0.000012989794,0.965416,0.000324046,0.030641414,0.00035671113,0.002983103],"study_design_scores_gemma":[0.000007296672,0.000015402557,0.00006292323,0.000005232979,0.0000063075927,0.000022638456,0.0000055489245,0.9814689,0.000095538235,0.017421464,0.0008808063,0.000007975826],"about_ca_topic_score_codex":0.010429238,"about_ca_topic_score_gemma":0.005415099,"teacher_disagreement_score":0.010429238,"about_ca_system_score_codex":0.0026530267,"about_ca_system_score_gemma":0.0016426188,"threshold_uncertainty_score":0.023852885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042660315,0.03382986,0.6767648,0.007867329,0.0007314211,0.00018298332,0.00051743793,0.00020095387,0.23724495],"genre_scores_gemma":[0.85105443,0.04176373,0.073148295,0.0019056204,0.0023199618,0.0005288639,0.0003889544,0.0001337893,0.028756429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983303,0.00076378114,0.00009974108,0.00023447708,0.00033485235,0.00023687794],"domain_scores_gemma":[0.99293643,0.0056761503,0.0005475454,0.0002534947,0.0004100699,0.0001763512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00307348,0.000977499,0.0011454795,0.0015191805,0.001444271,0.0028272108,0.0012735534,0.0021085136,0.009199412],"category_scores_gemma":[0.007424334,0.00061576435,0.0014241298,0.002386478,0.0036946519,0.0056545865,0.0016399192,0.002783334,0.0008614738],"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.000007881041,0.000012414957,0.00012852055,0.000068150795,0.000009210392,0.00006337504,0.00008248811,0.011770776,0.00012087489,0.98362976,0.0008613466,0.0032452906],"study_design_scores_gemma":[0.000009923558,0.000021817958,0.00013267017,0.00008175171,0.000007684855,0.00005640983,0.000034692228,0.0279025,0.00008375459,0.96620566,0.005442982,0.000020231744],"about_ca_topic_score_codex":0.0034974439,"about_ca_topic_score_gemma":0.0026645127,"teacher_disagreement_score":0.009199412,"about_ca_system_score_codex":0.0036925317,"about_ca_system_score_gemma":0.0017030921,"threshold_uncertainty_score":0.03077507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068983953,0.0003057108,0.99064726,0.00022857648,0.000067038585,0.000021088432,0.000026516538,0.00007655083,0.0017288424],"genre_scores_gemma":[0.50065017,0.0017243733,0.48791474,0.00028533593,0.00034962228,0.00021927033,0.00017601451,0.00015853252,0.0085219825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994087,0.0002778349,0.000035435838,0.00005671219,0.00019315409,0.000028228997],"domain_scores_gemma":[0.9987896,0.0008760397,0.000081825776,0.00007997595,0.0001316579,0.000040872583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017002343,0.00064454356,0.00093041756,0.00072688016,0.00047355334,0.0013717238,0.0010180784,0.001885061,0.0020484584],"category_scores_gemma":[0.004386572,0.00040392007,0.0011078133,0.0008125211,0.0011652274,0.0019219138,0.0010871994,0.0016099971,0.0004224696],"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.000021801561,0.00003664826,0.00049879163,0.00008918212,0.000037989863,0.00016902403,0.000074774,0.739549,0.0027198181,0.23558186,0.0005162223,0.020704811],"study_design_scores_gemma":[0.000006190805,0.00000433601,0.00002931795,0.0000037744403,0.0000017302942,0.000017112558,0.0000027612869,0.9800511,0.00015527352,0.019385487,0.00033902083,0.000003989764],"about_ca_topic_score_codex":0.0024922974,"about_ca_topic_score_gemma":0.0011334514,"teacher_disagreement_score":0.0024922974,"about_ca_system_score_codex":0.00060641,"about_ca_system_score_gemma":0.00089922966,"threshold_uncertainty_score":0.0089918375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22380249,0.00061355584,0.7659483,0.00020738211,0.000020485531,0.000058614143,0.00007056554,0.00009456853,0.009184128],"genre_scores_gemma":[0.9291202,0.0004875772,0.06804447,0.000065418906,0.00005033802,0.0000823849,0.000068780166,0.000034602457,0.0020462468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988508,0.000495192,0.0000442019,0.0001808326,0.00027218772,0.00015673012],"domain_scores_gemma":[0.9909445,0.006845476,0.0009686711,0.0006494859,0.0004197417,0.00017217346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002966104,0.0006570613,0.0005331445,0.00074835954,0.00023685218,0.0008253279,0.00048060683,0.00085889694,0.003612656],"category_scores_gemma":[0.011729075,0.00037032814,0.00048578982,0.00060947833,0.0011932033,0.0022194244,0.0008806889,0.00076290464,0.00033370036],"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.00015260071,0.00006210192,0.0011255232,0.00009343386,0.000022230573,0.00004177477,0.0000978343,0.88751173,0.006681478,0.07008379,0.00021937984,0.033908088],"study_design_scores_gemma":[0.0000199932,0.00037522876,0.0007706856,0.000022295966,0.00001533293,0.00005219103,0.0000318165,0.9392076,0.0028932248,0.055936806,0.0006570637,0.00001764345],"about_ca_topic_score_codex":0.00072434306,"about_ca_topic_score_gemma":0.00052848266,"teacher_disagreement_score":0.003612656,"about_ca_system_score_codex":0.0008398276,"about_ca_system_score_gemma":0.00061105925,"threshold_uncertainty_score":0.015686452},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2566065,0.00028270762,0.7340383,0.0002702764,0.00008422052,0.00015804966,0.00046922357,0.0004995998,0.007591168],"genre_scores_gemma":[0.8492605,0.00029579774,0.13776729,0.00005998285,0.00003554734,0.00010844444,0.00084578805,0.00011529371,0.011511381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914277,0.00023070011,0.000030089497,0.00027931147,0.00015669089,0.00016031832],"domain_scores_gemma":[0.99943763,0.00019855725,0.000094617346,0.00010333564,0.00008993526,0.000075902564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079612056,0.000788554,0.0007066423,0.0007058669,0.00074693176,0.0014653745,0.0010504619,0.0010708485,0.006208387],"category_scores_gemma":[0.0028809495,0.00070281245,0.0007554726,0.0021036742,0.00055094814,0.0020089813,0.0010113535,0.00079236814,0.00076295086],"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.00030663164,0.00015168136,0.0053800363,0.00013447531,0.00006236156,0.000266121,0.00016674517,0.8651518,0.0073957937,0.017382888,0.0021449693,0.10145652],"study_design_scores_gemma":[0.000053934225,0.00013222882,0.0030796195,0.000015045381,0.000054292635,0.00015485246,0.00017037736,0.96621656,0.0036283792,0.017457685,0.009011613,0.000025396794],"about_ca_topic_score_codex":0.013297692,"about_ca_topic_score_gemma":0.022569874,"teacher_disagreement_score":0.013297692,"about_ca_system_score_codex":0.00087471306,"about_ca_system_score_gemma":0.0015763066,"threshold_uncertainty_score":0.02644056},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23917004,0.00031180546,0.75158066,0.0015306725,0.000096589,0.00016188885,0.0001308363,0.0002475647,0.0067699784],"genre_scores_gemma":[0.9821039,0.00012368888,0.015451411,0.00006672094,0.000033474225,0.00004505343,0.00003304404,0.000048037913,0.002094615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997572,0.00095331465,0.000085897045,0.00029567422,0.0004466157,0.00064650824],"domain_scores_gemma":[0.9921692,0.005126003,0.0009296335,0.00033103256,0.00068533147,0.0007587918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004839899,0.0010316407,0.0019941793,0.0009350107,0.0010790259,0.0031168896,0.0022985942,0.0014856127,0.0027008667],"category_scores_gemma":[0.013120834,0.00087650435,0.0006852298,0.0008650446,0.002458773,0.0027419992,0.0020014131,0.0019222238,0.00027077098],"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.00018801646,0.00006235544,0.0003743175,0.000027435986,0.000021925503,0.00005613084,0.000084635736,0.96024585,0.0011825126,0.03329974,0.00053957774,0.003917531],"study_design_scores_gemma":[0.000010255445,0.00001641872,0.000075587515,0.000002700452,0.0000039971605,0.000006162595,0.000017675397,0.9900682,0.00017911717,0.0095340945,0.00007857145,0.000007275515],"about_ca_topic_score_codex":0.012564652,"about_ca_topic_score_gemma":0.0050861645,"teacher_disagreement_score":0.012564652,"about_ca_system_score_codex":0.0057941484,"about_ca_system_score_gemma":0.003771126,"threshold_uncertainty_score":0.042039692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018877346,0.00047711056,0.966421,0.001231988,0.00014172275,0.00011588736,0.000248305,0.00019289422,0.012293842],"genre_scores_gemma":[0.9098498,0.0009961188,0.07219186,0.00047142836,0.00049804087,0.00019217188,0.00029636137,0.0001195375,0.015384699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752206,0.0006324857,0.00012961047,0.0005473911,0.00071996177,0.00044851276],"domain_scores_gemma":[0.99771994,0.0012694029,0.0003390161,0.00021729301,0.00032670354,0.00012768773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027891358,0.00129327,0.0016444323,0.0006851654,0.0006935387,0.0028689096,0.0023088218,0.0017827675,0.0072908686],"category_scores_gemma":[0.006009469,0.0010507582,0.0019066853,0.0011847855,0.0015215195,0.0041086553,0.0021832574,0.0021501898,0.000742302],"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.00014394056,0.00018614756,0.0012842343,0.0002772628,0.00012718748,0.0004245449,0.00014765166,0.72661847,0.0033124837,0.23882653,0.004537897,0.024113692],"study_design_scores_gemma":[0.000020246482,0.00006473427,0.00031569746,0.000013788124,0.00003143268,0.00007431042,0.000029922703,0.9551153,0.0005824968,0.0417324,0.0019958736,0.00002379157],"about_ca_topic_score_codex":0.0084626665,"about_ca_topic_score_gemma":0.004681047,"teacher_disagreement_score":0.0084626665,"about_ca_system_score_codex":0.0020059529,"about_ca_system_score_gemma":0.003074377,"threshold_uncertainty_score":0.0243904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23437442,0.00088432734,0.746879,0.0012590282,0.000052314124,0.00009242242,0.000126386,0.00018797403,0.016144168],"genre_scores_gemma":[0.9713686,0.0003820284,0.02425905,0.00008932601,0.000030714637,0.00009342735,0.000062277715,0.000030380137,0.003684189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986772,0.00055425917,0.00008529422,0.00026062893,0.0002514172,0.00017123674],"domain_scores_gemma":[0.9963426,0.0023636143,0.00060464226,0.00021592475,0.00024815512,0.00022510103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020783185,0.0009317039,0.0012116532,0.0005900543,0.00035220096,0.0025724666,0.0010210644,0.001497814,0.0020446125],"category_scores_gemma":[0.010526077,0.0006522108,0.0006971642,0.00053202664,0.0013793317,0.0030083875,0.0014996263,0.0012144858,0.000290575],"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.00013442813,0.00009492837,0.0010019862,0.00006777467,0.000067695924,0.00021108617,0.00012749362,0.7860749,0.0020629086,0.18938304,0.0007980794,0.019975761],"study_design_scores_gemma":[0.000030663716,0.00009626427,0.00023536675,0.00001625191,0.000015238209,0.000045900044,0.000030063627,0.88573366,0.00039624164,0.11281966,0.0005628164,0.000017826724],"about_ca_topic_score_codex":0.000910331,"about_ca_topic_score_gemma":0.00050999364,"teacher_disagreement_score":0.0025724666,"about_ca_system_score_codex":0.0010604454,"about_ca_system_score_gemma":0.00092782197,"threshold_uncertainty_score":0.010991335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12533292,0.00014300804,0.8658581,0.00045958863,0.000023283634,0.000121924,0.0001252667,0.00020188882,0.0077340323],"genre_scores_gemma":[0.7714437,0.0001241983,0.22489564,0.000057703728,0.000018714176,0.00019473505,0.00017062307,0.00006240362,0.0030322736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997032,0.00012452723,0.000013641203,0.00004460957,0.000059637696,0.000054399166],"domain_scores_gemma":[0.9990145,0.0007093601,0.00009202842,0.000038871523,0.00008751232,0.000057662673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157299,0.0006153009,0.00095664704,0.00052966777,0.0005198155,0.0014382525,0.0011639827,0.0014932717,0.0036628349],"category_scores_gemma":[0.004269728,0.00066804717,0.0005362028,0.00052577246,0.0009425136,0.0016568556,0.0010161932,0.0009382626,0.00031667532],"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.000038709764,0.000020050787,0.0004089383,0.000018055598,0.000009498439,0.00006092899,0.000050187213,0.9703001,0.0002676068,0.01894357,0.00030076108,0.009581692],"study_design_scores_gemma":[0.000012008363,0.00000867514,0.000032753625,0.000002715411,0.0000014901703,0.0000067140827,0.000010139113,0.99254096,0.00011719897,0.0071047293,0.00016036336,0.0000022628901],"about_ca_topic_score_codex":0.00531555,"about_ca_topic_score_gemma":0.004288385,"teacher_disagreement_score":0.00531555,"about_ca_system_score_codex":0.0014382813,"about_ca_system_score_gemma":0.0014408024,"threshold_uncertainty_score":0.012253344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004374844,0.0002426129,0.98045063,0.00023682378,0.0000797486,0.00006517034,0.00018303744,0.0014152755,0.012951813],"genre_scores_gemma":[0.06158285,0.00051907194,0.93050474,0.00007721426,0.00003146198,0.00019709511,0.00038007624,0.0011603703,0.005547227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899095,0.00045801577,0.000054943157,0.00015073497,0.00027843425,0.00006695301],"domain_scores_gemma":[0.99869233,0.00068561087,0.000060263224,0.00024958627,0.00023969628,0.000072593924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011416635,0.0010287748,0.00066878967,0.0018228188,0.001374377,0.0023307276,0.0013689459,0.0011776267,0.016642785],"category_scores_gemma":[0.0047744517,0.0006885388,0.0011680012,0.001647343,0.0015154076,0.0029673297,0.00233271,0.0015845079,0.0034188237],"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.00010836176,0.000042273667,0.00081798056,0.0003808093,0.000031994914,0.00027399414,0.0017428813,0.06139506,0.0049360823,0.70067656,0.022151127,0.20744282],"study_design_scores_gemma":[0.000044153756,0.000050670733,0.0002924134,0.00019270557,0.000024887204,0.0003960054,0.0004606136,0.25407976,0.009169804,0.5223037,0.21289483,0.000090466645],"about_ca_topic_score_codex":0.0035209067,"about_ca_topic_score_gemma":0.0041774963,"teacher_disagreement_score":0.016642785,"about_ca_system_score_codex":0.0008470337,"about_ca_system_score_gemma":0.00092244067,"threshold_uncertainty_score":0.055675626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01158186,0.00050179905,0.97432977,0.0010659472,0.000055623732,0.00007056233,0.00018412103,0.00017256828,0.012037746],"genre_scores_gemma":[0.75923806,0.0017348311,0.23054934,0.0007647976,0.00035219814,0.00077335146,0.0004963414,0.00040541933,0.0056856107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954919,0.0014040391,0.00024581928,0.0007585945,0.0016403801,0.00045927454],"domain_scores_gemma":[0.971943,0.021790957,0.0018618203,0.0018670345,0.0018235795,0.0007135637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006305123,0.0014741599,0.0017480479,0.0016608561,0.0010690856,0.0022668152,0.002684369,0.0016304129,0.007790913],"category_scores_gemma":[0.03567569,0.0015952757,0.0019550705,0.0011693003,0.0033319928,0.0075087436,0.0042382292,0.005633146,0.0007649835],"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.000110715664,0.00008255529,0.00043452997,0.00026911285,0.000042875305,0.00009601684,0.00034789857,0.2843559,0.0018170221,0.69266534,0.001779272,0.017998772],"study_design_scores_gemma":[0.00003487602,0.00008162056,0.00023452613,0.000110982575,0.000016157504,0.000045689896,0.000052911968,0.52606267,0.0012171767,0.4692478,0.0028666873,0.000028942975],"about_ca_topic_score_codex":0.0017763883,"about_ca_topic_score_gemma":0.001648782,"teacher_disagreement_score":0.007790913,"about_ca_system_score_codex":0.0024528997,"about_ca_system_score_gemma":0.0030492218,"threshold_uncertainty_score":0.033345103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29173303,0.0016223491,0.6819119,0.0023681682,0.000100566875,0.00026796872,0.00042990886,0.00034401697,0.021222064],"genre_scores_gemma":[0.97475237,0.0004707693,0.021066517,0.00007909367,0.000026460815,0.0000946806,0.00013359111,0.000047063437,0.0033293932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999046,0.00035902165,0.00003877951,0.00020679105,0.00011082955,0.00023848923],"domain_scores_gemma":[0.99777657,0.0015422142,0.00028641964,0.00010260912,0.00013624258,0.00015601366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015879424,0.0010392482,0.0018921592,0.0007153899,0.00053046405,0.0020819253,0.0012666254,0.0017117278,0.003523343],"category_scores_gemma":[0.0058154697,0.0012832363,0.0006965791,0.0006775387,0.001318285,0.0022462383,0.001061402,0.0011182671,0.00035759786],"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.000108169945,0.000053866537,0.00044255456,0.00004636386,0.000023097908,0.00008076837,0.00003196482,0.9787405,0.00071539864,0.014156722,0.0005079878,0.00509247],"study_design_scores_gemma":[0.000028637567,0.00003743912,0.00035350185,0.000010689204,0.000010217819,0.000018761499,0.00002995884,0.97874063,0.00023213329,0.020215113,0.000310469,0.0000123789],"about_ca_topic_score_codex":0.00729793,"about_ca_topic_score_gemma":0.0039244746,"teacher_disagreement_score":0.00729793,"about_ca_system_score_codex":0.002330537,"about_ca_system_score_gemma":0.002164392,"threshold_uncertainty_score":0.01690936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5921113,0.0017827655,0.38959244,0.0010921654,0.000073017996,0.0002040518,0.0002642113,0.0004752532,0.014404812],"genre_scores_gemma":[0.9782615,0.0007198502,0.020187829,0.00005692374,0.000024523188,0.00004217396,0.000057656624,0.000030985822,0.0006186691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887234,0.0005846655,0.00004320402,0.00008667243,0.00018694627,0.0002261528],"domain_scores_gemma":[0.9868118,0.010869302,0.0012835888,0.00041426677,0.00026029313,0.00036079928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036554066,0.0011531607,0.0011052212,0.0008224142,0.00051751855,0.0016172158,0.0010440229,0.00096513965,0.0016654624],"category_scores_gemma":[0.013390865,0.00047017678,0.0005860807,0.0007648264,0.0014640382,0.0022216486,0.00075111416,0.0012933353,0.00012355906],"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.00017870095,0.0000658886,0.0005216104,0.000050206017,0.000020013567,0.000017026388,0.00001854037,0.9738003,0.00048676986,0.01721288,0.00020907747,0.0074190064],"study_design_scores_gemma":[0.000048146107,0.00012903012,0.00020205381,0.000012732021,0.000015721003,0.000012389235,0.000025684829,0.9887783,0.00047686155,0.010069569,0.00022135848,0.0000082886145],"about_ca_topic_score_codex":0.0049790014,"about_ca_topic_score_gemma":0.0029472513,"teacher_disagreement_score":0.0049790014,"about_ca_system_score_codex":0.0021636167,"about_ca_system_score_gemma":0.002200465,"threshold_uncertainty_score":0.019331872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700217,0.00081820233,0.94842255,0.00038190032,0.00004880831,0.00005362047,0.000071901995,0.0003740215,0.0028267582],"genre_scores_gemma":[0.9109131,0.0012260976,0.08477959,0.0002117205,0.00010243378,0.00018860285,0.00015184033,0.00008899661,0.002337684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985917,0.0006049017,0.00004962304,0.0001984596,0.0004320431,0.00012320085],"domain_scores_gemma":[0.9865878,0.010482908,0.0012908524,0.000580525,0.00084567576,0.00021224478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026813387,0.00085793744,0.0006829743,0.0017309404,0.0006276356,0.0013310196,0.001272433,0.0015607026,0.001788311],"category_scores_gemma":[0.019225078,0.00049505936,0.0008941682,0.0016841767,0.0020048497,0.0027927242,0.0009252795,0.0017061831,0.0002830442],"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.00005393077,0.00005544207,0.0019178732,0.000055944674,0.000036355254,0.00015752684,0.0001045943,0.7858595,0.0011137908,0.19457243,0.0006647711,0.015407796],"study_design_scores_gemma":[0.0000042769216,0.0000119627775,0.00024065675,0.000008359748,0.0000049814375,0.000031925178,0.000011348619,0.9671734,0.000217637,0.031961977,0.00032388352,0.000009659357],"about_ca_topic_score_codex":0.0055113123,"about_ca_topic_score_gemma":0.002920595,"teacher_disagreement_score":0.0055113123,"about_ca_system_score_codex":0.0017762935,"about_ca_system_score_gemma":0.0011119155,"threshold_uncertainty_score":0.014180481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010301496,0.00035539022,0.978434,0.0001375762,0.000041877018,0.00009055413,0.00009379635,0.0001618708,0.010383405],"genre_scores_gemma":[0.13560082,0.0009026351,0.8575357,0.00009635354,0.00006640527,0.00037466077,0.00041936178,0.00021474637,0.0047893645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990113,0.0003203586,0.000036723046,0.00010977432,0.00040679864,0.000115048104],"domain_scores_gemma":[0.9992749,0.00041727122,0.000054272397,0.00009424175,0.000106615575,0.00005264462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977729,0.0009865481,0.0010818787,0.0011252922,0.0006112948,0.0014079979,0.0011582705,0.00083436124,0.005306846],"category_scores_gemma":[0.003106903,0.0004838442,0.0011082613,0.0019342271,0.0009668345,0.001634651,0.0017024485,0.0026393523,0.0012862441],"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.00015519797,0.00016466157,0.00046956865,0.0003230713,0.000059629652,0.00013287934,0.00019755441,0.51834625,0.006098879,0.2997125,0.005973475,0.16836628],"study_design_scores_gemma":[0.000026539394,0.00005271087,0.00011313655,0.000033303317,0.000016926931,0.00010398017,0.000035611374,0.8835615,0.0020342045,0.10654139,0.0074661914,0.00001451152],"about_ca_topic_score_codex":0.0018573154,"about_ca_topic_score_gemma":0.001974197,"teacher_disagreement_score":0.005306846,"about_ca_system_score_codex":0.0009621786,"about_ca_system_score_gemma":0.0011894725,"threshold_uncertainty_score":0.017753124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016353404,0.00025086757,0.94480956,0.00062428525,0.00004291376,0.0001321794,0.000116754425,0.000082749604,0.03758728],"genre_scores_gemma":[0.73197395,0.00084980036,0.23905572,0.0003175799,0.000053719046,0.0007742137,0.00020875451,0.00010861796,0.02665761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982333,0.000935236,0.000051943756,0.00026242164,0.00027986025,0.0002370981],"domain_scores_gemma":[0.99852633,0.0009022089,0.00014787521,0.000085631116,0.00022628628,0.000111650166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026705996,0.0013569865,0.001348006,0.0010205567,0.0010923352,0.0026882398,0.0021351003,0.0018108996,0.008747381],"category_scores_gemma":[0.0049951267,0.0005203114,0.0011310359,0.0011229647,0.0022805918,0.0028918653,0.0025077404,0.0025454971,0.0012628392],"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.00004328059,0.00006228566,0.00037715925,0.00006372297,0.000034127544,0.00009480543,0.00009551383,0.40476733,0.00045526488,0.58289975,0.0014655158,0.00964129],"study_design_scores_gemma":[0.000020624822,0.000035437086,0.00011492714,0.000020414593,0.000008926091,0.000036923564,0.00004546161,0.8039071,0.00019042572,0.19334428,0.0022580407,0.00001740691],"about_ca_topic_score_codex":0.007609171,"about_ca_topic_score_gemma":0.0042772964,"teacher_disagreement_score":0.008747381,"about_ca_system_score_codex":0.003266822,"about_ca_system_score_gemma":0.002647437,"threshold_uncertainty_score":0.02926284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.456033,0.00040990545,0.5387919,0.00039404174,0.00005114764,0.000053767893,0.000026460046,0.0004858824,0.0037538563],"genre_scores_gemma":[0.9893755,0.00007527509,0.010283814,0.000024082137,0.000005277496,0.00000996433,0.0000070571073,0.000011400065,0.00020753221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990927,0.00037363652,0.000057586953,0.000116858784,0.00017416557,0.00018506407],"domain_scores_gemma":[0.99743265,0.0015481197,0.00033901786,0.00021374515,0.000243031,0.00022340585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019646718,0.0005513839,0.00061434344,0.0004806045,0.0005383467,0.0013757397,0.0010601539,0.00042568182,0.001034052],"category_scores_gemma":[0.008360743,0.00027938455,0.00026375233,0.00062965025,0.0009150543,0.0018808579,0.0013184306,0.0006832523,0.00012499343],"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.0005063759,0.00036867236,0.0077571035,0.00013442959,0.000071990464,0.00016693107,0.00049605273,0.8227532,0.014124127,0.03984239,0.0007116617,0.11306707],"study_design_scores_gemma":[0.00002006895,0.0003024756,0.0009201296,0.0000092200635,0.000033035576,0.00005521449,0.00015446465,0.9713495,0.003525341,0.023178084,0.00043042345,0.00002206549],"about_ca_topic_score_codex":0.0024956318,"about_ca_topic_score_gemma":0.0023744104,"teacher_disagreement_score":0.0024956318,"about_ca_system_score_codex":0.0012660011,"about_ca_system_score_gemma":0.0016161174,"threshold_uncertainty_score":0.010390282},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006121069,0.00009749547,0.8818346,0.000115176445,0.00016228949,0.00031377055,0.0033573282,0.109506406,0.0040007746],"genre_scores_gemma":[0.017651161,0.0005104912,0.88263,0.000483993,0.00027935018,0.0035052132,0.012325714,0.0621554,0.02045873],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982162,0.00041782725,0.00023655695,0.00021922053,0.0007573993,0.00015277928],"domain_scores_gemma":[0.99406826,0.0028978265,0.00042887894,0.0012352526,0.0011529896,0.00021681075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045020645,0.0018646013,0.0018004546,0.0021159651,0.0007020931,0.0021878122,0.0036406212,0.0016147862,0.08680658],"category_scores_gemma":[0.01483436,0.001629837,0.0015320341,0.0020740998,0.0006272362,0.0025541345,0.0021673641,0.0026404823,0.04573571],"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.00077896984,0.00042786976,0.0032657841,0.0015341042,0.00030405592,0.0007871981,0.0003304045,0.04739293,0.010631701,0.09541203,0.4232705,0.41586447],"study_design_scores_gemma":[0.0010157302,0.00024636724,0.0016286406,0.0002822707,0.00016425533,0.0010799237,0.000032080097,0.29634058,0.018148517,0.090340905,0.5904532,0.00026756752],"about_ca_topic_score_codex":0.0009585771,"about_ca_topic_score_gemma":0.0013430767,"teacher_disagreement_score":0.08680658,"about_ca_system_score_codex":0.0006206817,"about_ca_system_score_gemma":0.0014533673,"threshold_uncertainty_score":0.29039693},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3833423,0.0005243276,0.6083776,0.00097006216,0.0001898595,0.00012739393,0.00014624004,0.0005271997,0.005795084],"genre_scores_gemma":[0.9830898,0.00013579166,0.013774177,0.00006114828,0.000038858794,0.000038155056,0.00003498745,0.000015692829,0.0028114114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988254,0.00028043296,0.00005406118,0.0002515859,0.00029931043,0.0002891917],"domain_scores_gemma":[0.99781066,0.0010034298,0.00040152902,0.00011033049,0.0002982778,0.00037570845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018391125,0.00071841443,0.0010769818,0.00046981368,0.00095197675,0.0025243005,0.0019786572,0.0010282574,0.0020021058],"category_scores_gemma":[0.0034768544,0.00047015972,0.00046721334,0.00062801444,0.0012685723,0.001263253,0.0012259621,0.0014350134,0.00020714707],"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.00028552898,0.00016883186,0.00075562514,0.000047412406,0.000025914276,0.00022717555,0.0001598349,0.9517894,0.008130343,0.029552562,0.0005299023,0.008327436],"study_design_scores_gemma":[0.000015352045,0.000023830971,0.000053922955,0.0000013385663,0.000003796214,0.0000066481234,0.000006239976,0.9981108,0.000249672,0.0014343346,0.00008929412,0.0000048423085],"about_ca_topic_score_codex":0.01608725,"about_ca_topic_score_gemma":0.0069609834,"teacher_disagreement_score":0.01608725,"about_ca_system_score_codex":0.0024214862,"about_ca_system_score_gemma":0.0021582937,"threshold_uncertainty_score":0.03198725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029866535,0.00015739241,0.96499133,0.00071129634,0.00006502488,0.00016843152,0.00008549332,0.00026242863,0.0036920328],"genre_scores_gemma":[0.730115,0.00018270384,0.26590037,0.00015974283,0.00009608186,0.00024686952,0.00009915074,0.000054271502,0.0031458216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988971,0.00048490218,0.000029810903,0.00017529295,0.00028364672,0.00012925564],"domain_scores_gemma":[0.9986885,0.0007555838,0.00017331421,0.00011263711,0.00008627033,0.00018358881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487324,0.00053729455,0.00058207527,0.0005533158,0.0006842454,0.0008726706,0.001545267,0.0008262474,0.004071787],"category_scores_gemma":[0.003187375,0.00049910124,0.00058025675,0.00065540645,0.0004936596,0.0008321092,0.0010201582,0.0011675773,0.00037520798],"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.00024558153,0.0003324401,0.0015392993,0.00008351237,0.000041769705,0.00016242928,0.0001499663,0.87038463,0.0032744927,0.03856794,0.0033746555,0.081843205],"study_design_scores_gemma":[0.0000551907,0.00006752851,0.00021022225,0.0000058685823,0.000011150001,0.00007715066,0.000014478964,0.99041134,0.00065140834,0.0065576155,0.0019247342,0.00001325417],"about_ca_topic_score_codex":0.004775798,"about_ca_topic_score_gemma":0.005721145,"teacher_disagreement_score":0.004775798,"about_ca_system_score_codex":0.0015468303,"about_ca_system_score_gemma":0.0025938288,"threshold_uncertainty_score":0.013621509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52822435,0.0011012756,0.42481893,0.018847883,0.00023922471,0.00014260571,0.00016482602,0.0003063218,0.02615458],"genre_scores_gemma":[0.9901932,0.00019847261,0.0077548823,0.00038476643,0.00006947716,0.000038461505,0.000021351738,0.000021615895,0.0013176586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99293184,0.0044559287,0.00018444807,0.00055592705,0.0009943345,0.0008775876],"domain_scores_gemma":[0.96441364,0.02762635,0.004185326,0.0012399604,0.0014704351,0.0010641728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0108583495,0.0007265682,0.0011591475,0.0006752274,0.001931336,0.006032607,0.0022530893,0.004316608,0.003471474],"category_scores_gemma":[0.045953862,0.0009256349,0.0009602897,0.00086350297,0.004300405,0.0095997825,0.0033432136,0.0049115494,0.00043412801],"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.0012668179,0.00032737455,0.0055255895,0.0002556347,0.00017827586,0.0012013045,0.0058131693,0.29935828,0.0030401018,0.6461906,0.003963543,0.032879397],"study_design_scores_gemma":[0.00009361335,0.00018058943,0.0013671633,0.000054162407,0.00008251231,0.00014129857,0.0015534679,0.65846205,0.0010881426,0.3348894,0.0019559239,0.00013162251],"about_ca_topic_score_codex":0.006456328,"about_ca_topic_score_gemma":0.0036425325,"teacher_disagreement_score":0.0108583495,"about_ca_system_score_codex":0.0039942507,"about_ca_system_score_gemma":0.0028707914,"threshold_uncertainty_score":0.05742508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34202215,0.0015038431,0.6343257,0.0022678853,0.00019144472,0.00012374447,0.00015786685,0.00016852375,0.019238932],"genre_scores_gemma":[0.98672533,0.00023684575,0.011400496,0.00008099861,0.000093016315,0.000025922187,0.000033135413,0.000019877505,0.001384212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969002,0.001029866,0.00017586105,0.0006292063,0.0007525768,0.0005122038],"domain_scores_gemma":[0.97549564,0.018671554,0.002679202,0.0011192779,0.0011508762,0.0008835104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005415045,0.00094187487,0.0011459439,0.000810141,0.0007320445,0.003828859,0.0017600022,0.001783594,0.0025546034],"category_scores_gemma":[0.038727496,0.0009848849,0.00091821456,0.0007015638,0.0035259675,0.0072852173,0.0014884335,0.0036824606,0.00016585556],"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.00037493778,0.00018322183,0.003155738,0.00017461804,0.0000708182,0.00052880374,0.0005518228,0.2800574,0.0046587065,0.6882428,0.00052474014,0.021476379],"study_design_scores_gemma":[0.00006551369,0.00014272802,0.0019133512,0.00003376243,0.00005437469,0.00020258116,0.00013790205,0.596591,0.0009921396,0.39884478,0.00094460085,0.000077280245],"about_ca_topic_score_codex":0.003159758,"about_ca_topic_score_gemma":0.0013722046,"teacher_disagreement_score":0.005415045,"about_ca_system_score_codex":0.0028140738,"about_ca_system_score_gemma":0.00087415235,"threshold_uncertainty_score":0.028637886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02367207,0.00073874526,0.96885026,0.00040588522,0.00006134259,0.00011884825,0.0002495029,0.00016946589,0.005733903],"genre_scores_gemma":[0.37763852,0.0015337339,0.61095065,0.00034710782,0.00015804727,0.000635255,0.00067874265,0.00026787928,0.0077900724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865615,0.0006491729,0.00004541183,0.00020379187,0.00020840611,0.00023708206],"domain_scores_gemma":[0.99752265,0.0019534035,0.00021118115,0.000057746045,0.00016169537,0.00009329962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021114966,0.0020208124,0.001710204,0.0010586194,0.00074127415,0.0020714288,0.0025355755,0.0017563652,0.004334814],"category_scores_gemma":[0.003920642,0.0013362317,0.0013130696,0.0019696092,0.0010065804,0.0021917461,0.0009935886,0.0018352169,0.0004280107],"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.00006254713,0.000051459338,0.00013270797,0.000087816145,0.000030558745,0.000036587182,0.00003746072,0.974037,0.00033503005,0.014404271,0.00064677006,0.010137769],"study_design_scores_gemma":[0.000012718225,0.000027203176,0.00003353632,0.0000066517996,0.000007322878,0.0000056364543,0.000012264672,0.9919708,0.00013288725,0.0073098764,0.00047608526,0.0000049096525],"about_ca_topic_score_codex":0.008203476,"about_ca_topic_score_gemma":0.009286719,"teacher_disagreement_score":0.008203476,"about_ca_system_score_codex":0.0023227856,"about_ca_system_score_gemma":0.002294307,"threshold_uncertainty_score":0.016853034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87289006,0.012575299,0.0018013739,0.017233547,0.00047103182,0.00018304349,0.001818036,0.000038847527,0.092988685],"genre_scores_gemma":[0.986374,0.0038053424,0.0011071961,0.0011116074,0.0002749657,0.000087563065,0.001256048,0.000011235189,0.0059721568],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9805946,0.0039064763,0.0017349804,0.0011554573,0.010355748,0.0022528002],"domain_scores_gemma":[0.6575642,0.16289675,0.1044732,0.0070601623,0.056638237,0.011367455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0253583,0.00022340316,0.00034748492,0.007935925,0.0020144708,0.004085624,0.0009566032,0.0013138027,0.0048478013],"category_scores_gemma":[0.12584642,0.00037024345,0.00034599326,0.015016433,0.0019377576,0.002853922,0.0023275665,0.002265569,0.00058607676],"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.0011542954,0.00046035097,0.5884137,0.0011568024,0.00013439436,0.00082736905,0.009697832,0.0016509889,0.0007291959,0.0639529,0.059714828,0.27210733],"study_design_scores_gemma":[0.000022254086,0.0002108242,0.93948764,0.0003746681,0.000014473499,0.00021589868,0.0031678975,0.0004311425,0.00032809415,0.0026863453,0.05302209,0.00003873313],"about_ca_topic_score_codex":0.018430904,"about_ca_topic_score_gemma":0.030850917,"teacher_disagreement_score":0.0253583,"about_ca_system_score_codex":0.0059377165,"about_ca_system_score_gemma":0.0066150078,"threshold_uncertainty_score":0.13410914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041547764,0.000073445306,0.99806696,0.000047931582,0.000022195245,0.000013769413,0.000027006035,0.000033479097,0.0012998147],"genre_scores_gemma":[0.044517253,0.00042768594,0.94995713,0.00008854614,0.000070039016,0.00025677445,0.00018216252,0.00017801012,0.0043222876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915814,0.00040339842,0.000044822707,0.00011071004,0.00022095737,0.00006206363],"domain_scores_gemma":[0.9993862,0.00024907224,0.00006662255,0.000097129196,0.00014848307,0.00005248945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060501,0.0011603676,0.0009885719,0.001067737,0.0006076718,0.0011946976,0.0014780345,0.0009816651,0.0039047252],"category_scores_gemma":[0.0032668342,0.00067779503,0.001597329,0.001243198,0.0008970294,0.0023869732,0.0019776395,0.002368711,0.0011106605],"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.000023944836,0.000046156816,0.0003545452,0.00014108612,0.00007452726,0.00010617845,0.0001586404,0.40970108,0.0021131316,0.513189,0.0046059377,0.06948581],"study_design_scores_gemma":[0.000011257212,0.000010983244,0.0000463926,0.000023838473,0.0000122327165,0.000044441604,0.00001856673,0.8688293,0.00034441598,0.117777795,0.012869175,0.000011576977],"about_ca_topic_score_codex":0.003856351,"about_ca_topic_score_gemma":0.0041740797,"teacher_disagreement_score":0.0039047252,"about_ca_system_score_codex":0.001258157,"about_ca_system_score_gemma":0.0017294424,"threshold_uncertainty_score":0.013062596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833083,0.000263094,0.15735376,0.0011519716,0.00004978575,0.00004668129,0.00007920017,0.00010797499,0.0078646885],"genre_scores_gemma":[0.9956182,0.000100681624,0.003158112,0.000045408076,0.000019172772,0.000011489339,0.00001340192,0.000006171221,0.0010272842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948514,0.00018118764,0.000017477376,0.00010413159,0.00007513103,0.00013678965],"domain_scores_gemma":[0.99521834,0.0023675256,0.0013547854,0.00051187753,0.00027224686,0.00027524543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019966406,0.0006199867,0.0008383276,0.0004583653,0.00040459604,0.0023846612,0.0019125374,0.0017278297,0.0030085493],"category_scores_gemma":[0.010923476,0.00046783817,0.00085423695,0.0005311612,0.0017603239,0.0037867618,0.0011393722,0.0023718602,0.000262911],"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.00082286284,0.00083635765,0.014752574,0.00015886582,0.00021879599,0.0009912103,0.00079730875,0.48994854,0.0074598757,0.45127755,0.0020806154,0.030655455],"study_design_scores_gemma":[0.00008412436,0.00019946435,0.002450394,0.000013100961,0.00004985154,0.00014064378,0.00016224118,0.8884559,0.0007581236,0.10720699,0.00042711772,0.000051983985],"about_ca_topic_score_codex":0.0030006233,"about_ca_topic_score_gemma":0.0017042283,"teacher_disagreement_score":0.0030085493,"about_ca_system_score_codex":0.0011194407,"about_ca_system_score_gemma":0.0005750577,"threshold_uncertainty_score":0.01055932},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1255557,0.00047960147,0.85016966,0.0007756599,0.00009954552,0.00033412728,0.00073273364,0.00017212215,0.021680862],"genre_scores_gemma":[0.7607854,0.00096312235,0.22641304,0.00015115901,0.00010770125,0.00041960637,0.0011901155,0.00009665056,0.009873101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00021042764,0.000028501296,0.00013287892,0.00022073962,0.00013966861],"domain_scores_gemma":[0.9993981,0.00026716266,0.000067407585,0.00006836158,0.00010503137,0.00009381269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448434,0.0007220649,0.0008860506,0.00037743346,0.0008257893,0.002349089,0.0011584813,0.0011055702,0.0062486157],"category_scores_gemma":[0.0022860623,0.00035909284,0.0010248569,0.0010975035,0.0011521187,0.0025987567,0.0012879971,0.0015097132,0.00049825414],"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.00030571912,0.00025906164,0.002657754,0.0004128944,0.000067727815,0.0008989784,0.00036500668,0.44517574,0.004855097,0.4551166,0.007512758,0.08237268],"study_design_scores_gemma":[0.000065453314,0.00013223384,0.00093251455,0.000056527915,0.000022143175,0.00047225773,0.00035117214,0.6948493,0.0028061331,0.29207093,0.008206148,0.000035158144],"about_ca_topic_score_codex":0.004767458,"about_ca_topic_score_gemma":0.0026766593,"teacher_disagreement_score":0.0062486157,"about_ca_system_score_codex":0.00095241173,"about_ca_system_score_gemma":0.0015997979,"threshold_uncertainty_score":0.020903707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49399498,0.00096688746,0.4775114,0.0030090623,0.00011234124,0.0002470573,0.0005986132,0.00023133465,0.023328237],"genre_scores_gemma":[0.98124367,0.00044320492,0.0115880035,0.00015737243,0.000064715554,0.00009671276,0.00011126476,0.000025007452,0.006269961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937496,0.0028150056,0.00029825466,0.0008456856,0.0011024047,0.0011890209],"domain_scores_gemma":[0.9733217,0.016264897,0.006153198,0.0014743976,0.0015893311,0.0011964549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009042578,0.0011046444,0.0020943894,0.001028762,0.0014671624,0.0030601928,0.0026610151,0.003568825,0.00555202],"category_scores_gemma":[0.020455355,0.0014758412,0.0010777059,0.001751236,0.0026087787,0.0058647823,0.002491374,0.002748286,0.0004978053],"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.00035344795,0.00014844959,0.0025615261,0.00008471173,0.00007114271,0.0009009931,0.00025834946,0.855953,0.001176639,0.13080087,0.00089966744,0.006791328],"study_design_scores_gemma":[0.000106247404,0.00011831241,0.0007554233,0.000021444243,0.000029922932,0.00015820794,0.00014691241,0.9164378,0.00035804612,0.08096929,0.00085218647,0.000046234036],"about_ca_topic_score_codex":0.0066890228,"about_ca_topic_score_gemma":0.0035577996,"teacher_disagreement_score":0.009042578,"about_ca_system_score_codex":0.0033030563,"about_ca_system_score_gemma":0.0030374727,"threshold_uncertainty_score":0.047822297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015123036,0.00072340877,0.96877384,0.00067668885,0.00010380546,0.000066811954,0.00010336094,0.000117331554,0.014311724],"genre_scores_gemma":[0.8313523,0.0010948827,0.15884916,0.00020558469,0.00022499703,0.00019733026,0.00015353505,0.00015950357,0.007762723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810493,0.00090677146,0.00007996779,0.00026176605,0.0004206869,0.00022578819],"domain_scores_gemma":[0.99798703,0.001246468,0.00019605187,0.00017178766,0.000316429,0.00008214776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033621679,0.0008696007,0.00085384183,0.0005717613,0.0005359082,0.0032385527,0.0016454456,0.0012518627,0.006309687],"category_scores_gemma":[0.008483102,0.0006445328,0.0007417865,0.00097264216,0.0018795334,0.0049563837,0.0012440864,0.0025444878,0.0008561682],"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.00003503894,0.000049778344,0.00020036047,0.00007474225,0.0000128211805,0.000057105724,0.00008859616,0.4812556,0.0006087569,0.49481875,0.0013683642,0.021430058],"study_design_scores_gemma":[0.000016481583,0.000035307345,0.00009224813,0.00002020506,0.000006934556,0.000023836867,0.00002625684,0.8134352,0.0005493177,0.1829381,0.0028432831,0.000012874708],"about_ca_topic_score_codex":0.0037287876,"about_ca_topic_score_gemma":0.002141072,"teacher_disagreement_score":0.006309687,"about_ca_system_score_codex":0.0025892807,"about_ca_system_score_gemma":0.0022214951,"threshold_uncertainty_score":0.021108031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61784077,0.00045223424,0.3760146,0.00037405232,0.000036432786,0.000041702457,0.000075790136,0.00011194329,0.0050524864],"genre_scores_gemma":[0.9922287,0.00008089363,0.006371555,0.000019768031,0.0000084499225,0.000013006767,0.00002541584,0.000009144547,0.0012431211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996245,0.00010125782,0.000032606236,0.000061236125,0.000105258245,0.00007514787],"domain_scores_gemma":[0.9983419,0.00095481816,0.00028236606,0.00018904264,0.00012502763,0.00010665489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014232364,0.00053568045,0.0008980275,0.0004219281,0.00025580538,0.0014301002,0.00067006465,0.0008307825,0.0021934572],"category_scores_gemma":[0.0042703366,0.0002989142,0.00049790164,0.0003964478,0.00084199785,0.0023187504,0.0010435609,0.00082601636,0.0001143422],"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.00025203635,0.00007749156,0.0020605745,0.0000543434,0.00006692223,0.0003779567,0.000070660644,0.87637717,0.00852507,0.091603555,0.00029167748,0.020242535],"study_design_scores_gemma":[0.000034144305,0.000061590064,0.0005301341,0.0000039600513,0.0000143037205,0.000051717197,0.00001399315,0.9696274,0.0011440587,0.028318627,0.00018785243,0.000012320163],"about_ca_topic_score_codex":0.0009474015,"about_ca_topic_score_gemma":0.00051212293,"teacher_disagreement_score":0.0021934572,"about_ca_system_score_codex":0.00056716293,"about_ca_system_score_gemma":0.00045081528,"threshold_uncertainty_score":0.0075268745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10516458,0.0010689195,0.89140505,0.000573962,0.00016494373,0.000048995505,0.00018859562,0.0007195657,0.0006653752],"genre_scores_gemma":[0.9031256,0.0007781089,0.09320115,0.0001116009,0.00018331254,0.000109645836,0.0003451471,0.00006476957,0.0020807036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.00020195424,0.000050170238,0.00012588414,0.00029205644,0.00014897963],"domain_scores_gemma":[0.98993534,0.0069039445,0.0009982785,0.00036781566,0.0014234805,0.0003712781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029122962,0.0010160587,0.0010088034,0.0010015215,0.00046538113,0.0010981843,0.0011883044,0.00068254065,0.0010748872],"category_scores_gemma":[0.013025217,0.0005632975,0.0005356429,0.0010137584,0.00068402203,0.001537177,0.00082787365,0.0027966364,0.00029022008],"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.00010985928,0.000070536,0.0036500324,0.000043527223,0.000023506384,0.00003429467,0.000041325944,0.9673632,0.0007548336,0.004149687,0.0005609263,0.023198236],"study_design_scores_gemma":[0.000003616796,0.000019724837,0.0001836061,0.0000022867805,0.000003826548,0.0000029473804,0.0000024219785,0.9986254,0.00032692237,0.0007280554,0.00009616947,0.0000050418994],"about_ca_topic_score_codex":0.009763695,"about_ca_topic_score_gemma":0.008201618,"teacher_disagreement_score":0.009763695,"about_ca_system_score_codex":0.0010227467,"about_ca_system_score_gemma":0.0026316226,"threshold_uncertainty_score":0.01941371},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031931,0.0015448788,0.45538825,0.0095227165,0.0002546205,0.0004928788,0.0023085845,0.00038579394,0.02690911],"genre_scores_gemma":[0.96049887,0.0010598137,0.03264236,0.00024231919,0.00009441594,0.00018006122,0.0004620218,0.0000462379,0.0047738305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985671,0.00063461787,0.000067768786,0.00016370039,0.00015444586,0.00041241414],"domain_scores_gemma":[0.9884333,0.009003258,0.001041557,0.00022048647,0.0005214213,0.00078008417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034978879,0.00068862183,0.0012080934,0.00088196114,0.0007410675,0.0021460238,0.000932497,0.0014851339,0.007343695],"category_scores_gemma":[0.017630393,0.000692956,0.00057147717,0.00057603087,0.0012821442,0.0032056402,0.001120118,0.002066521,0.00045015357],"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.0010382206,0.00030120366,0.005607803,0.0002680782,0.00011541692,0.00033034483,0.00029125265,0.5289598,0.0022590244,0.43119574,0.0042902716,0.025342837],"study_design_scores_gemma":[0.0002039982,0.0004094298,0.0025829338,0.00012492394,0.000056282617,0.00013765362,0.00040471306,0.6844068,0.0016051924,0.30720317,0.0027995931,0.00006531551],"about_ca_topic_score_codex":0.0063015274,"about_ca_topic_score_gemma":0.0044020307,"teacher_disagreement_score":0.007343695,"about_ca_system_score_codex":0.0026648056,"about_ca_system_score_gemma":0.0035656062,"threshold_uncertainty_score":0.024567127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00460643,0.00013713186,0.99183196,0.00009065852,0.000024880002,0.000055955134,0.00007258963,0.00028632322,0.002894117],"genre_scores_gemma":[0.117578074,0.00034079453,0.87641484,0.00006270266,0.000051312378,0.0003186561,0.00046029536,0.00025202028,0.00452132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947006,0.00019822577,0.00001889613,0.00008277058,0.0001719627,0.00005808302],"domain_scores_gemma":[0.9994697,0.000326948,0.000053761705,0.00006431102,0.00006097306,0.00002436766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097441784,0.0013033665,0.0009531085,0.0007526155,0.0005448179,0.0008629271,0.0010307339,0.00085280795,0.0054547405],"category_scores_gemma":[0.0021737786,0.0007350396,0.00085545424,0.0009974655,0.00063637714,0.0010530936,0.0009800782,0.001675806,0.0010909998],"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.000050945826,0.000040432584,0.00013529362,0.00010915081,0.000023458344,0.000059075708,0.000036403297,0.9081748,0.001414805,0.030641617,0.0022303243,0.057083767],"study_design_scores_gemma":[0.000015565629,0.000016191729,0.000046372545,0.0000095174655,0.0000046852883,0.000017771996,0.000011923603,0.9762891,0.0005731061,0.021206815,0.0018038065,0.000005201997],"about_ca_topic_score_codex":0.00260539,"about_ca_topic_score_gemma":0.0035635503,"teacher_disagreement_score":0.0054547405,"about_ca_system_score_codex":0.0009059009,"about_ca_system_score_gemma":0.0013638345,"threshold_uncertainty_score":0.018247962},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062134494,0.00018106464,0.9888493,0.00015621183,0.000026814378,0.00017878835,0.00012109625,0.00044227252,0.0038310008],"genre_scores_gemma":[0.042646132,0.00023960153,0.95384943,0.00009280677,0.000025777481,0.0003378311,0.00058245804,0.00018025462,0.0020457446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922764,0.00024860442,0.000040771076,0.00015539014,0.00021378211,0.00011383818],"domain_scores_gemma":[0.9989938,0.000689729,0.0000707988,0.00006200468,0.00014280081,0.000040785606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010273345,0.0012744095,0.001256006,0.0011516222,0.0010069382,0.0011986946,0.0014338932,0.0014129215,0.006909369],"category_scores_gemma":[0.002994783,0.0006457016,0.000764469,0.00201012,0.00053441414,0.0018072702,0.0012818463,0.0018906342,0.0011893994],"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.00017854746,0.0003365034,0.00070039957,0.00030132572,0.00009033507,0.00023485596,0.00018442706,0.41287044,0.0034308487,0.04547686,0.0137105975,0.5224849],"study_design_scores_gemma":[0.00008575123,0.000094962495,0.00015164273,0.00002330523,0.000031793774,0.00010339075,0.000051093175,0.9675001,0.0013134071,0.024606178,0.006023452,0.000014949268],"about_ca_topic_score_codex":0.0055248905,"about_ca_topic_score_gemma":0.005769484,"teacher_disagreement_score":0.006909369,"about_ca_system_score_codex":0.0010233681,"about_ca_system_score_gemma":0.0018559607,"threshold_uncertainty_score":0.023114145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032075293,0.00037240918,0.96325564,0.0002798656,0.000040378378,0.00007560707,0.00006807275,0.00009029439,0.0037424865],"genre_scores_gemma":[0.8486763,0.00054808997,0.14630547,0.000051124473,0.000073503135,0.00017733838,0.00010328589,0.000083601604,0.0039812173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903935,0.00051907694,0.000033641012,0.00012916437,0.00018536329,0.000093472845],"domain_scores_gemma":[0.9986792,0.0008410836,0.00019881855,0.000052636122,0.00015090276,0.00007723732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027834359,0.0010168517,0.0017640768,0.00073447486,0.00054073834,0.0021093416,0.0013543688,0.0011121904,0.0017149249],"category_scores_gemma":[0.0047174087,0.0010339214,0.000733812,0.0006487809,0.0010915041,0.002082517,0.0011765328,0.001378476,0.0001743996],"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.000012694783,0.00000772149,0.00006165065,0.000010500355,0.000009067034,0.000012413097,0.000013830429,0.9877309,0.00015988966,0.008665809,0.00008439353,0.0032310954],"study_design_scores_gemma":[0.000003177859,0.000004901929,0.000020417481,0.0000015774568,0.0000014206628,0.0000017099275,0.0000041759463,0.9959655,0.000059367136,0.0038403706,0.000095251344,0.0000021002922],"about_ca_topic_score_codex":0.0045567583,"about_ca_topic_score_gemma":0.0042783506,"teacher_disagreement_score":0.0045567583,"about_ca_system_score_codex":0.0021175807,"about_ca_system_score_gemma":0.0021714743,"threshold_uncertainty_score":0.01536417},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084537186,0.0000986218,0.9976532,0.000040232895,0.000031524036,0.000023492206,0.000025305864,0.00006725744,0.0012150124],"genre_scores_gemma":[0.13819873,0.0012011084,0.8538969,0.00030981365,0.0006198357,0.0004733104,0.00030530192,0.00030030316,0.0046947375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998279,0.00055297377,0.00015253264,0.000247169,0.00063678005,0.00013151254],"domain_scores_gemma":[0.9976254,0.0013229887,0.00022235002,0.00041614243,0.00034984873,0.000063229214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037823427,0.0010577257,0.00086433435,0.0028817854,0.000672028,0.0014246412,0.0022189948,0.00094491336,0.0026723654],"category_scores_gemma":[0.009574997,0.00062956475,0.0019351222,0.00205702,0.0015456547,0.0030766889,0.0017290786,0.0025518446,0.001189897],"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.000012013104,0.00007629257,0.0006715203,0.000075298965,0.00003999647,0.00015912174,0.00016716546,0.07202837,0.0042073657,0.8730221,0.0017033308,0.047837418],"study_design_scores_gemma":[0.000015145288,0.000045642264,0.0003991877,0.000026788668,0.000028478045,0.00015236449,0.000022970757,0.6482987,0.0018678477,0.34178156,0.0073141996,0.000047148398],"about_ca_topic_score_codex":0.0020890068,"about_ca_topic_score_gemma":0.0014199561,"teacher_disagreement_score":0.0037823427,"about_ca_system_score_codex":0.0014902608,"about_ca_system_score_gemma":0.0017557291,"threshold_uncertainty_score":0.0200032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037408777,0.00025820817,0.9570859,0.00016127127,0.0000748904,0.00024185411,0.00020192908,0.0006824157,0.0038846864],"genre_scores_gemma":[0.28084108,0.00022949785,0.71542263,0.000135847,0.00006703469,0.00034823758,0.00066775776,0.00017692191,0.0021108608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990694,0.00033092216,0.000051137362,0.00012700654,0.00029240202,0.00012918218],"domain_scores_gemma":[0.9974579,0.0014480442,0.00020323061,0.00038250012,0.00042624178,0.0000821194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011270338,0.00089046557,0.0011781742,0.0011026232,0.0007911824,0.0009419431,0.0009579198,0.00054422725,0.0040829303],"category_scores_gemma":[0.0042246054,0.00053328834,0.0008168226,0.0022188586,0.00060498784,0.0012568556,0.00124717,0.0011700541,0.0005580947],"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.00015634944,0.0002345328,0.0012714316,0.00021191091,0.00006025371,0.00017024647,0.00020985775,0.69884217,0.011844311,0.021108769,0.006829986,0.2590601],"study_design_scores_gemma":[0.000042951546,0.000090321024,0.00026639114,0.000017114853,0.00002160213,0.000059159564,0.00004709995,0.9765772,0.0057224967,0.012589129,0.004546012,0.000020504083],"about_ca_topic_score_codex":0.0045874724,"about_ca_topic_score_gemma":0.0063311406,"teacher_disagreement_score":0.0045874724,"about_ca_system_score_codex":0.0006667795,"about_ca_system_score_gemma":0.0012917651,"threshold_uncertainty_score":0.013658702},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017189112,0.005422217,0.93546015,0.003908418,0.00062949734,0.00022445226,0.0004428383,0.0002306798,0.03649271],"genre_scores_gemma":[0.683235,0.017786002,0.27336344,0.002298029,0.0036575673,0.00055015634,0.000764492,0.0005805126,0.017764812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706775,0.0015877057,0.00012994243,0.000351718,0.0005460763,0.00031685652],"domain_scores_gemma":[0.98615974,0.011450282,0.0007842475,0.00047456726,0.000783309,0.00034791563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062863594,0.0017468483,0.0020354174,0.0012192699,0.0013659851,0.0029652116,0.002345065,0.0020675373,0.010562872],"category_scores_gemma":[0.020473741,0.0010782635,0.0016941,0.002532889,0.002946863,0.007384299,0.0028625273,0.0034775594,0.0009200217],"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.00022954079,0.0001876642,0.00076451566,0.00050925754,0.00009863778,0.00020380998,0.00019181402,0.51481485,0.0021657145,0.44467264,0.011746647,0.02441499],"study_design_scores_gemma":[0.000058451926,0.00015373077,0.00031050947,0.00014153322,0.000049134087,0.00009516846,0.000070923394,0.68581945,0.0009324652,0.30368266,0.0086448295,0.000041178424],"about_ca_topic_score_codex":0.00428673,"about_ca_topic_score_gemma":0.002113336,"teacher_disagreement_score":0.010562872,"about_ca_system_score_codex":0.00248086,"about_ca_system_score_gemma":0.003378269,"threshold_uncertainty_score":0.035336316},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071514007,0.00049968145,0.9779423,0.0007017118,0.0002257449,0.00004259725,0.000086204214,0.00012962203,0.013220734],"genre_scores_gemma":[0.4869716,0.002475399,0.49202633,0.00085078017,0.0014394844,0.00021914084,0.00027730304,0.00033032653,0.015409714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890745,0.0003201137,0.000064879736,0.00011796097,0.0004989723,0.000090596775],"domain_scores_gemma":[0.99587834,0.0025562954,0.00023979512,0.0004222592,0.00078963337,0.00011371908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032451954,0.000987727,0.0010005201,0.001140927,0.00059258996,0.0019952965,0.001377343,0.0010984563,0.0054680505],"category_scores_gemma":[0.014346178,0.0005446873,0.0014103652,0.0009880771,0.0015301359,0.0048070396,0.0012358968,0.0033945097,0.00079626765],"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.000044508448,0.000040205163,0.00037176444,0.000095298805,0.000022955537,0.00021790016,0.00014493977,0.105523646,0.0018151724,0.8456449,0.0049440796,0.04113459],"study_design_scores_gemma":[0.000013804971,0.000049366598,0.00015711626,0.000040647068,0.000014287172,0.00016492247,0.000023389375,0.6109733,0.00093991833,0.38097855,0.0066157,0.000028986165],"about_ca_topic_score_codex":0.0011631564,"about_ca_topic_score_gemma":0.0010536375,"teacher_disagreement_score":0.0054680505,"about_ca_system_score_codex":0.0010278058,"about_ca_system_score_gemma":0.00144891,"threshold_uncertainty_score":0.018292427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12644435,0.0006425599,0.86402804,0.0006384192,0.00003125332,0.00009521926,0.00031242246,0.00011359923,0.007694181],"genre_scores_gemma":[0.8791025,0.0009601578,0.11711522,0.000049617065,0.00009465163,0.00015016114,0.00056724565,0.0000657772,0.0018947159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.0005508894,0.00006165989,0.00020628194,0.00046057694,0.00018010222],"domain_scores_gemma":[0.97975916,0.016815145,0.001354765,0.00054167706,0.0010340025,0.0004952614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018176836,0.0005771456,0.00079662213,0.001333671,0.00078332826,0.0023613013,0.0016396715,0.0010257439,0.0029787775],"category_scores_gemma":[0.020119622,0.0007879831,0.00072687847,0.0017235744,0.0016480248,0.004271557,0.0014262818,0.0015485922,0.00030945096],"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.00011277068,0.000082192535,0.0033927406,0.00015158985,0.00002876435,0.00012990649,0.00032485838,0.5742476,0.0017720393,0.39521694,0.00088860607,0.023652017],"study_design_scores_gemma":[0.00002426377,0.000047402566,0.00054934714,0.000022310707,0.000011631397,0.00008982576,0.00011650654,0.7988813,0.00081815413,0.19819783,0.0012262777,0.000015170925],"about_ca_topic_score_codex":0.0025226513,"about_ca_topic_score_gemma":0.0028143453,"teacher_disagreement_score":0.0029787775,"about_ca_system_score_codex":0.0017534931,"about_ca_system_score_gemma":0.0012746127,"threshold_uncertainty_score":0.012722552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016447668,0.0003079804,0.9958902,0.0003283115,0.00005222837,0.000034004323,0.000084088664,0.00018955042,0.0014688587],"genre_scores_gemma":[0.09499459,0.0009385675,0.89881366,0.0003768214,0.00032655743,0.0005953587,0.0006566748,0.0002908589,0.0030068378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606115,0.0021925506,0.00021847559,0.0006251088,0.0006956701,0.00020697403],"domain_scores_gemma":[0.99274904,0.005630966,0.0006063614,0.0004330316,0.00045528944,0.00012534068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005159746,0.001915054,0.0020073901,0.0019152864,0.0006910675,0.0034274976,0.0013107881,0.0012057389,0.004927121],"category_scores_gemma":[0.01604348,0.00069057074,0.0015656956,0.0028379585,0.0015786595,0.0027515695,0.0020115545,0.0030002608,0.0016731365],"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.00012836754,0.00009543295,0.0012300897,0.0002674632,0.00010467864,0.000094944466,0.00008256853,0.6717206,0.0010096569,0.15240966,0.006091412,0.16676506],"study_design_scores_gemma":[0.000010062675,0.000015327923,0.00008249745,0.00001681213,0.0000073117367,0.000016865153,0.00000971638,0.9378298,0.00027199724,0.05974868,0.001984278,0.000006704651],"about_ca_topic_score_codex":0.0018475922,"about_ca_topic_score_gemma":0.0015095774,"teacher_disagreement_score":0.005159746,"about_ca_system_score_codex":0.0011701081,"about_ca_system_score_gemma":0.0016472992,"threshold_uncertainty_score":0.027287722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02780702,0.0010710505,0.9662752,0.00053032377,0.000043561195,0.000062968225,0.00014400916,0.00018980136,0.0038759985],"genre_scores_gemma":[0.85191077,0.0020826696,0.13872997,0.00018735108,0.00013635581,0.00040746428,0.00043938187,0.00014323543,0.005962742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649847,0.0020532943,0.00015326319,0.0003292563,0.00052055216,0.0004452219],"domain_scores_gemma":[0.98680216,0.011158246,0.0008317214,0.0003323768,0.00047380137,0.00040167267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006993933,0.0015769461,0.0024853554,0.0013458859,0.00087654655,0.0025925287,0.0011666651,0.0016910118,0.003782567],"category_scores_gemma":[0.02178892,0.0008654148,0.0011235939,0.001547827,0.0020901305,0.0030513622,0.0022257164,0.002370783,0.00037512643],"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.00007485536,0.000024176246,0.0004199674,0.000066660774,0.000030859377,0.00005775846,0.00005546414,0.8864178,0.00018937403,0.10272755,0.000651727,0.00928375],"study_design_scores_gemma":[0.00000878478,0.000021153026,0.000097959215,0.000014824608,0.000005395881,0.000010258858,0.000014194796,0.9088791,0.00010756622,0.09044347,0.00038722105,0.000009940942],"about_ca_topic_score_codex":0.0033533832,"about_ca_topic_score_gemma":0.0022559157,"teacher_disagreement_score":0.006993933,"about_ca_system_score_codex":0.0025897818,"about_ca_system_score_gemma":0.0020397322,"threshold_uncertainty_score":0.0369879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015431223,0.00012447385,0.9972869,0.0000869547,0.000033435004,0.000048270907,0.00003499484,0.00017400288,0.0006679093],"genre_scores_gemma":[0.12082498,0.0003690879,0.8748409,0.00016518931,0.00010603842,0.00069099123,0.00021006924,0.0002632226,0.002529506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962614,0.0024595733,0.00009606623,0.0003117091,0.0006813607,0.00018986446],"domain_scores_gemma":[0.98885125,0.008128266,0.0006526984,0.0012163017,0.00086128333,0.00029026938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054462417,0.000893309,0.0014397955,0.00092582713,0.0007772371,0.0013766682,0.0031748312,0.0015249077,0.006291681],"category_scores_gemma":[0.0138872145,0.0008706146,0.001299084,0.0008921271,0.0020704158,0.0020694141,0.0016273963,0.0025366237,0.0013092185],"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.00012362459,0.00006581426,0.0005205907,0.00012919743,0.0000744213,0.000069757094,0.000052562755,0.79427,0.0015627659,0.18785125,0.0010450276,0.014235036],"study_design_scores_gemma":[0.000017529326,0.000019390027,0.00002954405,0.000009263145,0.0000061575697,0.000014537313,0.0000020246532,0.9842911,0.00021108834,0.014610888,0.0007808773,0.000007646605],"about_ca_topic_score_codex":0.0048558614,"about_ca_topic_score_gemma":0.0039657494,"teacher_disagreement_score":0.006291681,"about_ca_system_score_codex":0.0017425524,"about_ca_system_score_gemma":0.0029341914,"threshold_uncertainty_score":0.028802812},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46607712,0.0015163966,0.4790029,0.008131601,0.00020495176,0.00021319254,0.0001290512,0.00032727222,0.044397637],"genre_scores_gemma":[0.9839272,0.00023056657,0.014587537,0.000106983585,0.00005620615,0.000021971322,0.000023176373,0.000019368332,0.0010270227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998403,0.00059779134,0.00005630694,0.00021549732,0.00039236763,0.00033502592],"domain_scores_gemma":[0.99039793,0.0064969654,0.0014474979,0.00059391913,0.0005742813,0.00048941467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002736264,0.00063259463,0.0009229928,0.00048690382,0.000685973,0.0027998844,0.0015047401,0.0017098782,0.003973887],"category_scores_gemma":[0.011620648,0.00057365734,0.0005099188,0.00064291956,0.002188269,0.006111055,0.0009805061,0.0025807102,0.00029923866],"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.0008916354,0.0006720031,0.009395994,0.00034310942,0.00016622499,0.0009487636,0.0006749109,0.51936305,0.007805809,0.31534478,0.003892981,0.14050071],"study_design_scores_gemma":[0.00010498859,0.0003386387,0.0033564165,0.00008726459,0.00007446049,0.00030809862,0.0006356134,0.858999,0.004801213,0.12785862,0.0033521396,0.00008357578],"about_ca_topic_score_codex":0.0024395334,"about_ca_topic_score_gemma":0.0024540666,"teacher_disagreement_score":0.003973887,"about_ca_system_score_codex":0.0012094951,"about_ca_system_score_gemma":0.0019023663,"threshold_uncertainty_score":0.014470935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61314124,0.00059077836,0.38146317,0.00057458907,0.00001817442,0.00018845379,0.00038531155,0.0005273405,0.0031109753],"genre_scores_gemma":[0.95267767,0.00023826603,0.046272628,0.000021311527,0.0000052002047,0.000041149113,0.00020713788,0.000015839,0.0005207907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990055,0.00043656983,0.00007004549,0.00017791506,0.00020073011,0.00010918067],"domain_scores_gemma":[0.99812204,0.0009333071,0.00038375496,0.000224574,0.000243074,0.00009323841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023390062,0.00046115948,0.00051021244,0.0009315512,0.00045637853,0.0017359129,0.0007218878,0.00041610518,0.0007858138],"category_scores_gemma":[0.0042812848,0.0005600792,0.0002996246,0.001460112,0.0005049808,0.0022929148,0.0007397333,0.0004881446,0.00013797607],"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.0001001054,0.00006669641,0.0031659966,0.00003120523,0.000025572965,0.00004380327,0.00009436221,0.94530934,0.0018870572,0.005692246,0.00040584023,0.04317786],"study_design_scores_gemma":[0.000018944665,0.00005074291,0.00092206226,0.0000066234297,0.000014730697,0.00001663876,0.00005197791,0.99229276,0.001373982,0.004667549,0.00057480007,0.000009071944],"about_ca_topic_score_codex":0.01573121,"about_ca_topic_score_gemma":0.01278852,"teacher_disagreement_score":0.01573121,"about_ca_system_score_codex":0.0023027116,"about_ca_system_score_gemma":0.00291421,"threshold_uncertainty_score":0.031279325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12034108,0.0086359205,0.72868544,0.02013099,0.0005394695,0.0003438255,0.0012869667,0.00037894532,0.11965737],"genre_scores_gemma":[0.9195957,0.0036349457,0.036559276,0.00069279835,0.00069804955,0.00040261928,0.0005062034,0.00012714889,0.037783135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978848,0.0011197653,0.000068249865,0.0002229751,0.00041035732,0.00029374188],"domain_scores_gemma":[0.98627895,0.010702484,0.0010898864,0.0004542636,0.0007028476,0.0007715848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005196993,0.0019639472,0.001613559,0.0020232112,0.0012514705,0.004893872,0.0023849527,0.003902717,0.02338934],"category_scores_gemma":[0.020208225,0.00095238636,0.001947391,0.0015792722,0.0028756682,0.008816112,0.0022451198,0.0067558754,0.0012624345],"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.0001332627,0.00018256868,0.0016987576,0.00014163544,0.00008497336,0.0003729503,0.00018250741,0.15054667,0.0002964103,0.82469606,0.0065823835,0.0150817735],"study_design_scores_gemma":[0.000036585032,0.00005386429,0.00064474245,0.00008013489,0.00003565744,0.000083375904,0.00013844547,0.5189078,0.000104978695,0.47594792,0.0039293496,0.000037181195],"about_ca_topic_score_codex":0.005350346,"about_ca_topic_score_gemma":0.0037657805,"teacher_disagreement_score":0.02338934,"about_ca_system_score_codex":0.0031525837,"about_ca_system_score_gemma":0.001834507,"threshold_uncertainty_score":0.07824516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28620207,0.0006944153,0.7063865,0.001021972,0.00010719745,0.00013942529,0.00020009976,0.00046672238,0.0047816806],"genre_scores_gemma":[0.94999945,0.00025108134,0.047808524,0.00014011534,0.00019579726,0.00022356612,0.00024062835,0.000107974745,0.0010327784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990617,0.0066404515,0.00028221283,0.0009103433,0.0012220783,0.00032783626],"domain_scores_gemma":[0.71164435,0.26283222,0.011082299,0.0076189754,0.0042744935,0.0025477135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020057425,0.00065360963,0.0014148518,0.004540351,0.0010065895,0.0020749578,0.002524711,0.0016711815,0.0029237515],"category_scores_gemma":[0.19459344,0.000446343,0.0009867554,0.002566553,0.009868946,0.005023752,0.002752509,0.0021057262,0.000314218],"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.00025897133,0.00006742283,0.0140683735,0.0001297833,0.00013473428,0.00054448657,0.0004543537,0.20244496,0.0011939403,0.75742674,0.0007607752,0.022515511],"study_design_scores_gemma":[0.0000566914,0.00019530862,0.0024547505,0.000036790403,0.000021444042,0.00029477646,0.00012028841,0.65695864,0.0018756139,0.33734918,0.0005753358,0.00006108466],"about_ca_topic_score_codex":0.0009762932,"about_ca_topic_score_gemma":0.00042222382,"teacher_disagreement_score":0.020057425,"about_ca_system_score_codex":0.0012364802,"about_ca_system_score_gemma":0.00070903834,"threshold_uncertainty_score":0.10607505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56087804,0.0015497439,0.42134407,0.0032333739,0.00010113544,0.0001932352,0.00054927234,0.00019976236,0.01195138],"genre_scores_gemma":[0.99028265,0.0003662709,0.00590516,0.00007171862,0.00003216252,0.00006521013,0.00008356433,0.000019244188,0.0031740032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852633,0.0005052132,0.0000568443,0.00031563774,0.00015887617,0.0004370022],"domain_scores_gemma":[0.9951565,0.003198321,0.00093617523,0.00011534639,0.0002693174,0.00032442165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023879851,0.0014991215,0.0018673463,0.00095661834,0.0007277067,0.0018735674,0.0015901983,0.0026050294,0.0031404183],"category_scores_gemma":[0.0066186776,0.0011339508,0.0012252826,0.0011510645,0.0021909268,0.0028384984,0.0015245301,0.0024608898,0.00018584916],"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.00008026594,0.00003676273,0.00048472363,0.000038231417,0.000025641719,0.00016751881,0.0000292339,0.98514754,0.00064974383,0.011390014,0.00020161504,0.0017487035],"study_design_scores_gemma":[0.000024436955,0.000046798363,0.00035995923,0.000009413741,0.000018872739,0.000035602756,0.000042376083,0.9919544,0.0002775742,0.007027163,0.00018269972,0.000020787176],"about_ca_topic_score_codex":0.019621693,"about_ca_topic_score_gemma":0.0073727765,"teacher_disagreement_score":0.019621693,"about_ca_system_score_codex":0.003591619,"about_ca_system_score_gemma":0.001984416,"threshold_uncertainty_score":0.039014995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068313995,0.0016663477,0.91422355,0.00087116624,0.00047657374,0.00064378453,0.0056007705,0.024340494,0.05149412],"genre_scores_gemma":[0.0047780564,0.0018526737,0.9422097,0.0007964361,0.00021540237,0.0013454101,0.0034105016,0.0069371294,0.038454667],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993174,0.00015892957,0.000095390256,0.0000807343,0.00029879913,0.00004871398],"domain_scores_gemma":[0.9956772,0.0028415816,0.00008698714,0.0002997651,0.000937764,0.00015665153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013943102,0.0025093297,0.0021916002,0.0029454387,0.0007475894,0.0013244515,0.0029077178,0.0018806877,0.23584984],"category_scores_gemma":[0.007165882,0.0015355123,0.0017657821,0.0026266812,0.00075930037,0.0024394917,0.0020489623,0.0037636254,0.09952157],"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.00011784409,0.00033449952,0.00044845924,0.0014205665,0.00007634519,0.0008551133,0.0002480822,0.012186803,0.0058921287,0.05252446,0.58052355,0.3453721],"study_design_scores_gemma":[0.00019828539,0.00008203459,0.0006641808,0.00041935066,0.000022791719,0.0010581965,0.00010729511,0.052370943,0.0027479967,0.104980975,0.83723783,0.00011018135],"about_ca_topic_score_codex":0.002859574,"about_ca_topic_score_gemma":0.0055743847,"teacher_disagreement_score":0.23584984,"about_ca_system_score_codex":0.00060586806,"about_ca_system_score_gemma":0.0017024453,"threshold_uncertainty_score":0.78899634},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027697816,0.000103258295,0.9650275,0.00060247094,0.000024367808,0.00007141077,0.00008853139,0.0000555609,0.0063290456],"genre_scores_gemma":[0.7936144,0.00050344,0.19041258,0.00024477745,0.0001349148,0.00032054746,0.00016238252,0.00005567205,0.014551365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885213,0.000448521,0.000040085004,0.0002068578,0.000313016,0.00013934715],"domain_scores_gemma":[0.99809045,0.0010733061,0.0003457711,0.00015854742,0.0001616022,0.0001703797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019696709,0.00039998695,0.0010152255,0.0004681752,0.0005655295,0.0013060812,0.001736392,0.0013139603,0.011145979],"category_scores_gemma":[0.0052529206,0.0006375494,0.0018038661,0.0007126901,0.0013791347,0.0030022473,0.0024414407,0.0019827518,0.00059120014],"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.000038256116,0.00010595752,0.0012074441,0.00009277261,0.000034697452,0.00022705838,0.00020211042,0.28092012,0.0015819457,0.70147365,0.001452152,0.012663877],"study_design_scores_gemma":[0.000022485654,0.000051442643,0.00028891515,0.000012730738,0.0000132701925,0.00007904051,0.00003924879,0.742733,0.00028561606,0.2546715,0.0017846137,0.000018090317],"about_ca_topic_score_codex":0.004382445,"about_ca_topic_score_gemma":0.0039029876,"teacher_disagreement_score":0.011145979,"about_ca_system_score_codex":0.0012002026,"about_ca_system_score_gemma":0.0023378846,"threshold_uncertainty_score":0.037286997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016438413,0.0008654132,0.97209644,0.00035486429,0.00006777762,0.00012551244,0.00024111522,0.00046300815,0.009347377],"genre_scores_gemma":[0.32579622,0.0013328437,0.6627383,0.00021466904,0.00012508643,0.0005674377,0.0008572017,0.00032656585,0.008041683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990934,0.00033827554,0.000048188474,0.0002030661,0.00015677372,0.0001602957],"domain_scores_gemma":[0.99659663,0.0027780388,0.00023172489,0.000173592,0.00014189747,0.000078238816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017165461,0.001702917,0.0012379327,0.0010045498,0.00063359266,0.001776187,0.0017059962,0.0014726992,0.0069318996],"category_scores_gemma":[0.005571,0.0007595844,0.00092650397,0.0017931423,0.0009268474,0.0021831922,0.0012534437,0.001901501,0.00088300765],"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.00006431559,0.00008664617,0.0003172388,0.00014499671,0.000027385708,0.00003458423,0.000060963666,0.9129764,0.00030651398,0.03903162,0.0016850402,0.04526438],"study_design_scores_gemma":[0.000027706148,0.00002083133,0.000055962566,0.000015081786,0.000008108484,0.000013030033,0.000023740875,0.95857316,0.00018661254,0.040158097,0.0009128227,0.000004882634],"about_ca_topic_score_codex":0.00818225,"about_ca_topic_score_gemma":0.01037874,"teacher_disagreement_score":0.00818225,"about_ca_system_score_codex":0.0020753627,"about_ca_system_score_gemma":0.0025324672,"threshold_uncertainty_score":0.023189545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03737381,0.00096033135,0.9319377,0.00260403,0.0001351146,0.00019623658,0.00051409676,0.00014359796,0.026135022],"genre_scores_gemma":[0.87177366,0.002855742,0.101428516,0.00068335346,0.00053243584,0.00041656275,0.0005559162,0.000107767366,0.021646123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988701,0.0004138448,0.00004168303,0.00022596084,0.00026469977,0.00018372449],"domain_scores_gemma":[0.9975867,0.001378581,0.00040731096,0.00025166583,0.00023702362,0.00013872496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022731654,0.001266076,0.0011658802,0.00082546205,0.0012853998,0.002443725,0.0018882046,0.0019278565,0.012671217],"category_scores_gemma":[0.0053366,0.00082748086,0.0019285309,0.0021618581,0.0022951541,0.0051822783,0.0020439676,0.002288891,0.0010490628],"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.000048916747,0.000110201334,0.0011848471,0.00016038098,0.000040352334,0.00026686914,0.00014005617,0.5541684,0.0012625798,0.43190733,0.0033137607,0.0073963306],"study_design_scores_gemma":[0.00002364862,0.000058648184,0.000245966,0.000027566266,0.000021055415,0.00011391486,0.000055047498,0.7348335,0.00031433377,0.2598106,0.004473811,0.000021963891],"about_ca_topic_score_codex":0.0086286105,"about_ca_topic_score_gemma":0.0074620103,"teacher_disagreement_score":0.012671217,"about_ca_system_score_codex":0.002347182,"about_ca_system_score_gemma":0.002532254,"threshold_uncertainty_score":0.042389393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3165266,0.00059755985,0.6490372,0.0042450856,0.0001883597,0.00019766,0.00041045606,0.0003143286,0.0284828],"genre_scores_gemma":[0.96377057,0.0003871809,0.033128522,0.0004511317,0.00008163678,0.000104360784,0.00009165768,0.000056438188,0.0019283856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689084,0.0015499785,0.0001234785,0.00044772442,0.00060585083,0.00038212462],"domain_scores_gemma":[0.97368413,0.020382967,0.0017433518,0.0023556286,0.0010440089,0.0007898887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043545747,0.0008548407,0.0012075952,0.000932043,0.001055918,0.0028544364,0.002389984,0.0019390566,0.00509315],"category_scores_gemma":[0.02812645,0.0005387587,0.00095325237,0.0011305016,0.003143834,0.008011201,0.0025446136,0.0034983233,0.00032592018],"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.0004746022,0.00022472863,0.002304214,0.00032278054,0.00013844628,0.00080775755,0.0005190569,0.28688356,0.0075715897,0.6629638,0.0048663868,0.032923084],"study_design_scores_gemma":[0.00007227123,0.00011915261,0.0004754521,0.000035511912,0.000044076925,0.00030788986,0.00016970925,0.5632066,0.0032596404,0.4303223,0.0019442274,0.00004316212],"about_ca_topic_score_codex":0.0012558725,"about_ca_topic_score_gemma":0.0010152004,"teacher_disagreement_score":0.00509315,"about_ca_system_score_codex":0.0018104798,"about_ca_system_score_gemma":0.0016957192,"threshold_uncertainty_score":0.023029506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35823885,0.009068794,0.37667412,0.15535237,0.0005402076,0.00043489793,0.0023014492,0.00021158415,0.0971777],"genre_scores_gemma":[0.9816838,0.001620182,0.012389961,0.0017577285,0.00035195495,0.00014715441,0.00023770444,0.000028578293,0.0017830579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.957413,0.032979738,0.0012831831,0.003318799,0.003847828,0.001157313],"domain_scores_gemma":[0.46532476,0.4823341,0.025131881,0.019625392,0.0055754217,0.0020084002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03805703,0.0008281616,0.0018907315,0.0026395733,0.0022566563,0.006510879,0.0034367826,0.0051189037,0.012198504],"category_scores_gemma":[0.29057327,0.00085386867,0.0017750037,0.0042500463,0.018220238,0.022253849,0.0050121746,0.009183206,0.00046859466],"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.00017995661,0.00016797462,0.013480057,0.00020964473,0.0001554147,0.00038849414,0.0006623218,0.008760196,0.00012179169,0.9582159,0.0016626857,0.015995504],"study_design_scores_gemma":[0.000034058165,0.000027726508,0.0017102167,0.000051870582,0.000023237462,0.00009878893,0.00026531648,0.010033645,0.00012632742,0.9862807,0.0013316056,0.00001654038],"about_ca_topic_score_codex":0.0024160452,"about_ca_topic_score_gemma":0.001379756,"teacher_disagreement_score":0.03805703,"about_ca_system_score_codex":0.00364363,"about_ca_system_score_gemma":0.0018970555,"threshold_uncertainty_score":0.20126724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3201539,0.002894268,0.3830876,0.006185005,0.00025236298,0.00057977845,0.0013862106,0.0003873758,0.28507346],"genre_scores_gemma":[0.9635358,0.0011331715,0.0137129845,0.00045172,0.000110853834,0.00027904238,0.0003590202,0.000029603552,0.020387882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851555,0.0005283446,0.000039319908,0.00018121689,0.00024235998,0.00049322244],"domain_scores_gemma":[0.9987619,0.00052796165,0.00027617833,0.00008464748,0.00018002673,0.00016924935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096080184,0.00097345054,0.0011299461,0.0013520232,0.0013953275,0.0028387061,0.002037182,0.0031131448,0.01743344],"category_scores_gemma":[0.0029479042,0.0004896316,0.0018434244,0.0020484165,0.0021142059,0.0030487261,0.0015797137,0.0016309749,0.0015503909],"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.000051869898,0.00012967741,0.002263105,0.000119600874,0.000040593313,0.00035076385,0.00021760707,0.16970651,0.0007373855,0.8168504,0.0034059829,0.006126459],"study_design_scores_gemma":[0.00012843953,0.00016028261,0.0019463298,0.00006193557,0.00004273507,0.0002676062,0.00037742482,0.52051836,0.00031951573,0.4554437,0.020680841,0.00005280269],"about_ca_topic_score_codex":0.019261425,"about_ca_topic_score_gemma":0.012559419,"teacher_disagreement_score":0.019261425,"about_ca_system_score_codex":0.0037609588,"about_ca_system_score_gemma":0.002480937,"threshold_uncertainty_score":0.05832064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009143284,0.00088672707,0.9873425,0.00024082245,0.000028122351,0.000018822637,0.000043417567,0.00013221918,0.0021640921],"genre_scores_gemma":[0.67691386,0.0028652058,0.3141374,0.00016919835,0.00014750987,0.0001978246,0.00019218119,0.00026162874,0.005115293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866486,0.00068944803,0.00006169334,0.00019501153,0.0002930735,0.00009591323],"domain_scores_gemma":[0.9969894,0.0022708634,0.00031677363,0.00015351604,0.00018490021,0.00008449484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029310682,0.0016203384,0.0016144741,0.0007547116,0.00036858593,0.0013312958,0.000977464,0.0012081969,0.0019449244],"category_scores_gemma":[0.0064638876,0.0007523169,0.0013276949,0.0013296258,0.0014791137,0.0017656552,0.0016911099,0.0024642586,0.00022662162],"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.000019674306,0.000011588484,0.00008651041,0.00005591752,0.000018514478,0.000025138443,0.000024727335,0.969235,0.0005935335,0.023384828,0.000231426,0.006313082],"study_design_scores_gemma":[0.0000025811846,0.000017090462,0.000023147622,0.0000066434127,0.0000041268145,0.000008313782,0.0000066122643,0.9901175,0.0002563999,0.009237357,0.0003160354,0.000004177647],"about_ca_topic_score_codex":0.0025946887,"about_ca_topic_score_gemma":0.0011233883,"teacher_disagreement_score":0.0029310682,"about_ca_system_score_codex":0.0014964852,"about_ca_system_score_gemma":0.0007521377,"threshold_uncertainty_score":0.015501201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07865973,0.0006464748,0.9143824,0.0007883189,0.00013143793,0.00019127791,0.0004885818,0.00081454404,0.0038973216],"genre_scores_gemma":[0.7399296,0.0012044732,0.25011715,0.0003316178,0.0002795673,0.00060362177,0.0013049425,0.0004738969,0.0057550888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951814,0.0023693554,0.00020244466,0.00063819153,0.0011322631,0.00047645127],"domain_scores_gemma":[0.98002934,0.012457303,0.002430392,0.0016905519,0.0026953064,0.00069706317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010326886,0.0014602572,0.001976625,0.0017073643,0.0007981353,0.002698027,0.0065561943,0.0022253997,0.003293873],"category_scores_gemma":[0.025896965,0.0009940085,0.0023925502,0.0024436438,0.00096744805,0.0033376112,0.0019112407,0.0033966012,0.0008927249],"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.000051595754,0.0000677147,0.0018159644,0.000027475067,0.000062898376,0.000046290243,0.00012282393,0.9638604,0.0003503262,0.026324915,0.0006548591,0.0066147326],"study_design_scores_gemma":[0.000007381019,0.000018399927,0.0002557184,0.0000040426403,0.000008450122,0.00001891084,0.000011932992,0.9926553,0.000083877094,0.00644381,0.00047491677,0.000017245662],"about_ca_topic_score_codex":0.014589309,"about_ca_topic_score_gemma":0.006753745,"teacher_disagreement_score":0.014589309,"about_ca_system_score_codex":0.003317524,"about_ca_system_score_gemma":0.002082834,"threshold_uncertainty_score":0.054614484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03134048,0.000287363,0.96248597,0.00062010146,0.000050226154,0.000044512763,0.00012202145,0.00034718536,0.004702193],"genre_scores_gemma":[0.9815537,0.00018805367,0.016082425,0.00006473704,0.000035134475,0.00007878764,0.0000700814,0.000032455584,0.0018947195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791783,0.0007516829,0.00008533786,0.00048742743,0.00043725496,0.00032049115],"domain_scores_gemma":[0.99440825,0.0035349517,0.0011363657,0.0002996619,0.00046263743,0.0001581636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030262894,0.0015732956,0.0013819003,0.00063654664,0.00041071972,0.0019407073,0.0016923767,0.0014390964,0.0018818384],"category_scores_gemma":[0.01074265,0.00053526857,0.0007777113,0.0005095816,0.0020321028,0.001287847,0.0017022874,0.0017127204,0.00022127606],"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.000075712385,0.000021603932,0.00025682172,0.00006632419,0.000036622456,0.00007939072,0.000061759776,0.95303226,0.00169085,0.03811163,0.00034131034,0.0062257852],"study_design_scores_gemma":[0.000010667942,0.000037107162,0.00010755032,0.000006593611,0.000006450884,0.000008839524,0.000006681776,0.98781127,0.00031250002,0.011485971,0.00020027885,0.0000061111746],"about_ca_topic_score_codex":0.006246567,"about_ca_topic_score_gemma":0.0025033536,"teacher_disagreement_score":0.006246567,"about_ca_system_score_codex":0.0017350742,"about_ca_system_score_gemma":0.0012613408,"threshold_uncertainty_score":0.016004741},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16205993,0.0004337242,0.80779415,0.0005126096,0.000036490008,0.00017895972,0.00020970491,0.00008356837,0.028690765],"genre_scores_gemma":[0.91233385,0.00041676906,0.079566285,0.0001303589,0.000061927814,0.00034594286,0.0001662419,0.000041663137,0.0069369795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974847,0.001185032,0.00010962205,0.00034453868,0.00046594368,0.00041018063],"domain_scores_gemma":[0.9960337,0.0024807428,0.00054021797,0.0002580018,0.0003748075,0.00031242645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031061263,0.00087341806,0.0013685869,0.0012962347,0.0012378212,0.002863329,0.0019012602,0.0015359786,0.0060535413],"category_scores_gemma":[0.010294217,0.00048555646,0.0012916753,0.0016949938,0.002878671,0.004959077,0.0022089006,0.0017745018,0.0006437816],"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.000044925837,0.00004047525,0.00025006078,0.000036871275,0.000019901147,0.00007825326,0.00009774645,0.038771972,0.000510197,0.9560418,0.00035224413,0.0037555243],"study_design_scores_gemma":[0.000033234843,0.000028706158,0.00011535024,0.0000109209695,0.000007760866,0.00005654251,0.000053300777,0.21875465,0.00027031012,0.77978027,0.0008739676,0.000014973019],"about_ca_topic_score_codex":0.0013155275,"about_ca_topic_score_gemma":0.0009929319,"teacher_disagreement_score":0.0060535413,"about_ca_system_score_codex":0.0020226894,"about_ca_system_score_gemma":0.00094679644,"threshold_uncertainty_score":0.020251095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6216279,0.00029821577,0.3737305,0.0005235996,0.00007400029,0.000118955555,0.00011105815,0.00029070012,0.0032249026],"genre_scores_gemma":[0.98358613,0.00013135663,0.014797642,0.000042182728,0.000025394438,0.000047359965,0.000027476899,0.000022045275,0.0013203649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985668,0.0005892861,0.00007519526,0.00023113226,0.00023615555,0.00030138373],"domain_scores_gemma":[0.9933252,0.0046021007,0.0009890755,0.00041275178,0.0004206131,0.0002502344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038716448,0.0008746827,0.0007030851,0.0008625141,0.0007913701,0.0017649417,0.0018200012,0.0015966365,0.00091644377],"category_scores_gemma":[0.01263855,0.00083065504,0.0007260169,0.00079538237,0.0020594404,0.0025440883,0.0014947634,0.0017035577,0.00015820071],"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.00003956933,0.000044650642,0.001587564,0.00000960479,0.000010658018,0.00004711777,0.00010945121,0.9846052,0.00073070504,0.0112575255,0.00006876246,0.0014892316],"study_design_scores_gemma":[0.0000058366127,0.000013359185,0.00019004685,0.000001619899,0.000004500891,0.0000041838366,0.00001087487,0.9969304,0.00013103313,0.0026563935,0.000046562327,0.000005207301],"about_ca_topic_score_codex":0.018153897,"about_ca_topic_score_gemma":0.009368008,"teacher_disagreement_score":0.018153897,"about_ca_system_score_codex":0.0029761333,"about_ca_system_score_gemma":0.0016793981,"threshold_uncertainty_score":0.036096454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060049584,0.00044263896,0.99566674,0.00019339952,0.00005418453,0.000052165986,0.000042700212,0.00018011301,0.0027675268],"genre_scores_gemma":[0.09322836,0.0022453081,0.8928521,0.0002897252,0.00035498283,0.0011344273,0.00049318356,0.0002801469,0.00912168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988482,0.00048359693,0.00005037893,0.00013668527,0.000379937,0.00010114108],"domain_scores_gemma":[0.9990959,0.00053635385,0.00008418301,0.00007703879,0.00015295956,0.00005355276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015705535,0.002148527,0.0012276453,0.0008952266,0.0005767645,0.0019754085,0.0013690112,0.0010765679,0.00787724],"category_scores_gemma":[0.0036764562,0.00061374943,0.0011563275,0.001848967,0.0013016156,0.0015801227,0.002108269,0.0037506998,0.0025342035],"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.000032408072,0.00008467145,0.00025311662,0.00033140572,0.000055393277,0.00007105363,0.000091370064,0.55420345,0.0010480413,0.36858016,0.0075127906,0.06773611],"study_design_scores_gemma":[0.000016176708,0.00003171302,0.000044678363,0.00003471311,0.0000066785906,0.000016408654,0.000023867713,0.8724223,0.00020033422,0.119385995,0.007808407,0.000008770373],"about_ca_topic_score_codex":0.0036114308,"about_ca_topic_score_gemma":0.003963714,"teacher_disagreement_score":0.00787724,"about_ca_system_score_codex":0.0012189971,"about_ca_system_score_gemma":0.0019344111,"threshold_uncertainty_score":0.026351988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4729641,0.0009985423,0.4778255,0.0012167436,0.00011248528,0.0002642473,0.0019288263,0.00070089014,0.043988746],"genre_scores_gemma":[0.7427567,0.0007225521,0.23389669,0.00030610073,0.00013289685,0.00030467976,0.002004391,0.0002802471,0.019595707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987575,0.0002056102,0.000084667445,0.00027905096,0.00037510466,0.00029806298],"domain_scores_gemma":[0.9959694,0.002541712,0.0005270124,0.00051796215,0.00022201333,0.00022184952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180785,0.00080977246,0.00079571776,0.00057049457,0.0008090112,0.0029436762,0.00090845337,0.00079590175,0.0069499407],"category_scores_gemma":[0.005594359,0.00064588187,0.0013390031,0.00084371376,0.0018090379,0.0024141439,0.001925903,0.002959896,0.0008195271],"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.00067459623,0.000265183,0.0033322342,0.0005782986,0.000108729015,0.00041885398,0.00040033704,0.57733107,0.013666727,0.33826628,0.00799856,0.056959074],"study_design_scores_gemma":[0.00009398104,0.00034515583,0.0025468026,0.000089375775,0.000039346553,0.00046075956,0.00026952123,0.6067069,0.010458294,0.36838776,0.0105297,0.00007237685],"about_ca_topic_score_codex":0.0024435518,"about_ca_topic_score_gemma":0.0028838261,"teacher_disagreement_score":0.0069499407,"about_ca_system_score_codex":0.0012261717,"about_ca_system_score_gemma":0.0009280041,"threshold_uncertainty_score":0.023249865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117805436,0.0005049675,0.874709,0.0006126743,0.00009708949,0.00014699611,0.00051013386,0.0008051869,0.004808608],"genre_scores_gemma":[0.91722363,0.00013259042,0.0805,0.00015395814,0.000027876158,0.00010525309,0.0003613553,0.000070409915,0.0014249926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995486,0.00017007107,0.000018921004,0.00009005262,0.00008147082,0.00009078271],"domain_scores_gemma":[0.99702954,0.0021421157,0.00032886644,0.00012472532,0.0002776786,0.00009709377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097353675,0.0012097071,0.0011294252,0.0004508196,0.00038744713,0.00090256316,0.0010294155,0.0010271745,0.0023372888],"category_scores_gemma":[0.0036277387,0.0007693186,0.0008497236,0.00058508833,0.00081062014,0.0007064362,0.0009725582,0.0012217073,0.00025063276],"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.000014066466,0.0000056098993,0.0001935299,0.000007657657,0.0000051582333,0.000016825035,0.0000053249278,0.9973779,0.00010767349,0.0004739939,0.000121759214,0.0016705267],"study_design_scores_gemma":[0.0000041691233,0.000008825647,0.000043232598,0.0000017114306,0.0000018082224,0.00000328137,0.0000034610907,0.9993253,0.000064363085,0.0004907743,0.00005153532,0.0000015844729],"about_ca_topic_score_codex":0.014412717,"about_ca_topic_score_gemma":0.010871642,"teacher_disagreement_score":0.014412717,"about_ca_system_score_codex":0.0009917273,"about_ca_system_score_gemma":0.001048289,"threshold_uncertainty_score":0.028657675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23626077,0.0005164571,0.7488803,0.0011962091,0.00004186878,0.00030632224,0.00034962417,0.0003850922,0.012063363],"genre_scores_gemma":[0.88600016,0.00044580185,0.10597074,0.0001237561,0.000057692167,0.00020987215,0.00030630073,0.00013494538,0.006750748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977857,0.0013153679,0.00006253028,0.00022818854,0.00024211516,0.00036593547],"domain_scores_gemma":[0.99338716,0.004760492,0.00073590537,0.000292032,0.00044218855,0.00038225958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004192263,0.001147401,0.0015103135,0.0014201516,0.00074230024,0.0025219338,0.0013781249,0.0014189706,0.004264764],"category_scores_gemma":[0.014856983,0.0008706079,0.00100674,0.0012990495,0.0015583794,0.0029911732,0.001589172,0.001383688,0.0006268791],"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.00018010149,0.00014606694,0.0012188968,0.00009621319,0.000047029887,0.00012867148,0.00009904321,0.877497,0.0013160363,0.099214144,0.0018135462,0.01824331],"study_design_scores_gemma":[0.000032869168,0.00006753783,0.00031757774,0.000010514858,0.000010451286,0.000023518847,0.00004784083,0.94826543,0.0003656741,0.0504565,0.00038458125,0.000017532664],"about_ca_topic_score_codex":0.00498669,"about_ca_topic_score_gemma":0.0055984743,"teacher_disagreement_score":0.00498669,"about_ca_system_score_codex":0.0029870078,"about_ca_system_score_gemma":0.0021841635,"threshold_uncertainty_score":0.02217108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93393576,0.00021354159,0.056783117,0.0011290349,0.000029247736,0.00006299059,0.00025812179,0.00011300879,0.0074751624],"genre_scores_gemma":[0.9963406,0.000079512865,0.0027088118,0.000034242606,0.00000772503,0.000018011746,0.000034399647,0.000011505331,0.00076529954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998197,0.00065679994,0.000044994915,0.00016265779,0.0001607548,0.00077775755],"domain_scores_gemma":[0.98838276,0.008887999,0.0010526452,0.00042860807,0.0005722259,0.0006756885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029531424,0.00062614883,0.0011077384,0.0007580428,0.0007958891,0.0026856062,0.0015736275,0.001620589,0.004109092],"category_scores_gemma":[0.013843662,0.00042644705,0.0008910656,0.00069781987,0.0017266037,0.0033909127,0.0013821134,0.001551502,0.00020244054],"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.00083258864,0.00052483677,0.0067112474,0.00008085707,0.000052820622,0.00028954938,0.00015283775,0.84852004,0.0033711917,0.13209753,0.0011824558,0.0061840354],"study_design_scores_gemma":[0.00007290435,0.0001427176,0.0016277668,0.0000132288915,0.000029801766,0.000040646093,0.00014117669,0.96442145,0.0007057078,0.032639552,0.000134776,0.000030304838],"about_ca_topic_score_codex":0.0100493515,"about_ca_topic_score_gemma":0.0057496116,"teacher_disagreement_score":0.0100493515,"about_ca_system_score_codex":0.0042965924,"about_ca_system_score_gemma":0.0028269137,"threshold_uncertainty_score":0.031174064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8792477,0.0008877478,0.099286176,0.004745995,0.00026276082,0.0004353268,0.0006193679,0.00020275576,0.014312248],"genre_scores_gemma":[0.9807357,0.00045672007,0.015623894,0.00013010118,0.0000917401,0.000104143786,0.00021054261,0.000028920182,0.0026182819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837303,0.000720646,0.00006099864,0.00020810893,0.00017245664,0.00046467606],"domain_scores_gemma":[0.99669075,0.0018363117,0.0004795928,0.0000756417,0.00020155373,0.00071621354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017700942,0.00083404576,0.0010663824,0.0006915478,0.0013773246,0.0021236937,0.0014711539,0.0018577,0.0043675276],"category_scores_gemma":[0.006576469,0.0006122613,0.00063718547,0.001103363,0.0007383385,0.0013639878,0.0015033731,0.0014120351,0.00032470352],"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.00023809791,0.00036182647,0.0057602613,0.00007888337,0.000053783835,0.0005532269,0.00012435557,0.97482514,0.00060047803,0.004712069,0.0020485267,0.0106433015],"study_design_scores_gemma":[0.00008388726,0.00018668709,0.0021087292,0.000022386934,0.000024295223,0.0001428645,0.00053000555,0.9888777,0.00042155205,0.006347306,0.0012295875,0.000024830319],"about_ca_topic_score_codex":0.0168721,"about_ca_topic_score_gemma":0.012781363,"teacher_disagreement_score":0.0168721,"about_ca_system_score_codex":0.0027900736,"about_ca_system_score_gemma":0.0038967342,"threshold_uncertainty_score":0.03354782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042522117,0.0038002718,0.9166638,0.0040058005,0.00022147401,0.00008693284,0.00058200624,0.00020820343,0.0319094],"genre_scores_gemma":[0.9116858,0.0063767764,0.06351464,0.0007274466,0.0004974242,0.0002926135,0.0004954833,0.00022598245,0.016183835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966557,0.0014309684,0.00014854371,0.0006083962,0.00058144465,0.000574948],"domain_scores_gemma":[0.9746859,0.02144954,0.0017438461,0.0005497052,0.0009685068,0.00060258433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005558321,0.0018864233,0.002486155,0.0015713905,0.0011963095,0.0035311852,0.0014599735,0.002682932,0.010566101],"category_scores_gemma":[0.02449715,0.0011848808,0.001672165,0.0018410637,0.0038947281,0.005389831,0.0027246678,0.0044877436,0.00061471824],"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.00007632924,0.000059994523,0.00065558706,0.00016180413,0.000042622894,0.00013667204,0.00012163621,0.4838588,0.00042682918,0.5050534,0.001972617,0.007433658],"study_design_scores_gemma":[0.000022760722,0.000029755049,0.00023526646,0.00006122015,0.000018366743,0.000037811536,0.000047704583,0.6832612,0.00014095326,0.31459054,0.0015313748,0.000023035853],"about_ca_topic_score_codex":0.007567114,"about_ca_topic_score_gemma":0.0046069366,"teacher_disagreement_score":0.010566101,"about_ca_system_score_codex":0.0046340423,"about_ca_system_score_gemma":0.0029869075,"threshold_uncertainty_score":0.035347164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30236152,0.0019267476,0.6770869,0.001072145,0.00006779952,0.00027867852,0.00024193301,0.00031099393,0.016653331],"genre_scores_gemma":[0.9392009,0.00061970286,0.055794645,0.000046591143,0.00002805726,0.000092727125,0.00010206504,0.0000341166,0.0040810946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915445,0.00031139905,0.000044827415,0.00020159116,0.00018148856,0.00010629442],"domain_scores_gemma":[0.9988519,0.0006413874,0.00023811453,0.00009383119,0.000064172295,0.00011057461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018362943,0.0010143584,0.0009702348,0.000707045,0.0005179328,0.0025210225,0.00097316026,0.0011376521,0.00370505],"category_scores_gemma":[0.0042426665,0.0009158184,0.00076139765,0.0014798027,0.0008795379,0.0024085005,0.0014609318,0.0011466275,0.0002950727],"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.00006410367,0.000048675407,0.0013110563,0.00005186844,0.000041885458,0.00018091162,0.00004489781,0.9566179,0.00079847226,0.014851874,0.00035892156,0.02562947],"study_design_scores_gemma":[0.00003438199,0.00013524118,0.0008090656,0.000019678384,0.00003251759,0.00007460207,0.00004946207,0.96147084,0.00060403964,0.034816206,0.0019337437,0.000020260279],"about_ca_topic_score_codex":0.0038405515,"about_ca_topic_score_gemma":0.0041451394,"teacher_disagreement_score":0.0038405515,"about_ca_system_score_codex":0.0018328662,"about_ca_system_score_gemma":0.00162181,"threshold_uncertainty_score":0.0132985115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056018446,0.005061272,0.883102,0.023954326,0.0007670535,0.00010342472,0.0003086112,0.00015535028,0.030529505],"genre_scores_gemma":[0.9342637,0.0047778143,0.043283988,0.0019385917,0.000975264,0.00021845012,0.00016217695,0.000066927416,0.014313043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981186,0.0009551432,0.000062881176,0.00036744034,0.000271667,0.00022431956],"domain_scores_gemma":[0.9959888,0.0026577318,0.0006141206,0.00016880775,0.0002825243,0.0002879796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023149862,0.0013243417,0.0017171198,0.0006639542,0.00055652315,0.002367125,0.0014107575,0.0022002188,0.0034455522],"category_scores_gemma":[0.010854759,0.0005965337,0.0008356869,0.0005174695,0.002625602,0.0029781489,0.0016757781,0.0024694991,0.000239116],"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.00009890809,0.000095399504,0.0011136396,0.00019203743,0.0001493704,0.00015986699,0.00010265216,0.53632206,0.0013571638,0.4383177,0.0063899374,0.01570129],"study_design_scores_gemma":[0.000055147226,0.00008019123,0.00044860574,0.000042369025,0.000029556015,0.000058396083,0.00005297558,0.7540516,0.00025952206,0.24128418,0.0036092924,0.000028122562],"about_ca_topic_score_codex":0.006528979,"about_ca_topic_score_gemma":0.0027726053,"teacher_disagreement_score":0.006528979,"about_ca_system_score_codex":0.002311633,"about_ca_system_score_gemma":0.0020097797,"threshold_uncertainty_score":0.016772151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055564396,0.00052512117,0.93082905,0.0003798216,0.00013073345,0.00012112912,0.0001948967,0.00037978776,0.0118750315],"genre_scores_gemma":[0.83967656,0.0009870325,0.1390707,0.0003887604,0.00037789458,0.00023322408,0.00025850636,0.00007838118,0.018928908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970228,0.00057748164,0.00025783127,0.0005864968,0.0010125183,0.0005429185],"domain_scores_gemma":[0.9946196,0.0018980309,0.00093097804,0.00069284777,0.0014840018,0.00037455943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025502415,0.0009569023,0.0010113264,0.001178361,0.0011090682,0.0036574253,0.0029583191,0.0012735904,0.00476694],"category_scores_gemma":[0.012240917,0.0005494873,0.00096095103,0.0016102584,0.0017334396,0.0048685144,0.0025672256,0.002147078,0.0009670381],"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.00023063841,0.00012125113,0.001479466,0.00016165993,0.000042408657,0.00042752508,0.00039836892,0.1599046,0.005621842,0.8006275,0.0012145953,0.029770173],"study_design_scores_gemma":[0.000051391886,0.00009150792,0.00037371123,0.000015844305,0.000036976387,0.00020356536,0.000056323683,0.8094014,0.0018129244,0.18399292,0.003917965,0.00004555953],"about_ca_topic_score_codex":0.0046172054,"about_ca_topic_score_gemma":0.0023139932,"teacher_disagreement_score":0.00476694,"about_ca_system_score_codex":0.0028383809,"about_ca_system_score_gemma":0.002210731,"threshold_uncertainty_score":0.02059406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81588125,0.0024384893,0.117634244,0.02901866,0.00024489168,0.0007994678,0.0017441495,0.0005148898,0.031724013],"genre_scores_gemma":[0.9849311,0.00051896594,0.011212584,0.00048469278,0.000031692376,0.00008496386,0.00022571647,0.000016660177,0.0024936665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917054,0.00039592985,0.000024916897,0.000088242174,0.00008517862,0.00023527273],"domain_scores_gemma":[0.9973181,0.0017295965,0.00036380175,0.0000684083,0.00015011115,0.00036992785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011888082,0.0006069578,0.00089031796,0.0008536441,0.00067969714,0.0016326708,0.0011516205,0.001426565,0.011660807],"category_scores_gemma":[0.0077014533,0.00041003374,0.0008211022,0.0007128219,0.00044674656,0.0014542007,0.0006617996,0.0011330611,0.00048530547],"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.0008867335,0.0010831826,0.037609197,0.0003028432,0.00015921245,0.0008940515,0.00031692596,0.8076902,0.001645253,0.04679044,0.017128633,0.08549336],"study_design_scores_gemma":[0.0004184513,0.00045209442,0.008859915,0.00013027535,0.000121538775,0.00031015536,0.0006912887,0.9464792,0.00067057094,0.03862746,0.0031854066,0.000053768883],"about_ca_topic_score_codex":0.01696809,"about_ca_topic_score_gemma":0.017152416,"teacher_disagreement_score":0.01696809,"about_ca_system_score_codex":0.0023924978,"about_ca_system_score_gemma":0.0034429072,"threshold_uncertainty_score":0.039009333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055186775,0.0015854378,0.9178835,0.001608075,0.00021106192,0.0002727692,0.001200492,0.0004882432,0.021563655],"genre_scores_gemma":[0.64811707,0.00082347135,0.33326772,0.0006542972,0.00014850308,0.00037010334,0.0014531425,0.00021840929,0.014947279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997865,0.0009597228,0.000079070815,0.0004203472,0.00041980436,0.0002560822],"domain_scores_gemma":[0.9944923,0.004492013,0.00027409827,0.00028279045,0.00030222785,0.00015663682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030339342,0.0016571175,0.002913066,0.0007542842,0.0005273123,0.002072979,0.0016752356,0.0020549176,0.0118067255],"category_scores_gemma":[0.009179996,0.0011252081,0.001378677,0.0017537745,0.0012008689,0.0027208482,0.0011616234,0.0021059366,0.0011081838],"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.00016031336,0.00012117938,0.00062239787,0.00016520961,0.00006649016,0.00007786019,0.000052025982,0.946831,0.00034704883,0.020353006,0.004275877,0.026927631],"study_design_scores_gemma":[0.000028140834,0.00003114853,0.00012333154,0.000009754155,0.000008303023,0.000016830732,0.000019985368,0.9817286,0.00012160961,0.017233567,0.0006713095,0.000007443101],"about_ca_topic_score_codex":0.0064155217,"about_ca_topic_score_gemma":0.0056669246,"teacher_disagreement_score":0.0118067255,"about_ca_system_score_codex":0.0018206589,"about_ca_system_score_gemma":0.0016081562,"threshold_uncertainty_score":0.039497435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038290076,0.00047079107,0.954656,0.0016120268,0.00009970113,0.00005594204,0.00028286435,0.0005542146,0.0039783833],"genre_scores_gemma":[0.87970674,0.0007910778,0.11326051,0.00044426296,0.00023341014,0.00025400202,0.00089403085,0.0004303941,0.003985509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251115,0.0048300526,0.00031188197,0.0011062883,0.0009198974,0.00032068725],"domain_scores_gemma":[0.9646011,0.023595344,0.0043390654,0.0048164753,0.0020565824,0.00059150625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012987606,0.0016362274,0.0019507757,0.0017009717,0.00048408043,0.003861595,0.0031658136,0.004229611,0.004140524],"category_scores_gemma":[0.092441134,0.0014055817,0.001469086,0.0014868822,0.0022633302,0.0049387747,0.004046538,0.004618481,0.0008788702],"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.000053254782,0.000050025043,0.0007564557,0.000051282852,0.0000737056,0.000035861307,0.00004158481,0.90378815,0.0003647022,0.084599145,0.0010307089,0.009155228],"study_design_scores_gemma":[0.000011129654,0.000011307799,0.00017770684,0.000015139966,0.0000071841932,0.000012912225,0.000006428781,0.9485295,0.00019121062,0.050718565,0.00030797158,0.0000109244675],"about_ca_topic_score_codex":0.001880354,"about_ca_topic_score_gemma":0.0008790126,"teacher_disagreement_score":0.012987606,"about_ca_system_score_codex":0.0020078775,"about_ca_system_score_gemma":0.0015922679,"threshold_uncertainty_score":0.06868583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029228989,0.00040749242,0.9915496,0.00041112967,0.00004284911,0.00003895106,0.0001223037,0.00019117536,0.0043134512],"genre_scores_gemma":[0.44221422,0.0016482822,0.54093003,0.000485862,0.0001956122,0.0008336455,0.00090566644,0.0004829956,0.012303592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989452,0.000459385,0.00003770236,0.00016500364,0.00029175152,0.00010090377],"domain_scores_gemma":[0.99547535,0.0038786568,0.00018867194,0.0001458571,0.00023914325,0.00007238431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017736185,0.0015968592,0.0013908115,0.0008698074,0.00056039845,0.0017481195,0.0013502133,0.0013355553,0.0060639507],"category_scores_gemma":[0.008087454,0.0007701937,0.0009658548,0.0019883127,0.0013467522,0.0019774165,0.0015580828,0.003269663,0.00078252255],"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.00001741806,0.000022766279,0.00013746278,0.00005956832,0.00001479174,0.000016907541,0.000021099224,0.9513547,0.00009481572,0.038235765,0.0010620467,0.008962712],"study_design_scores_gemma":[0.0000023303312,0.0000024202143,0.000010064934,0.0000037293496,0.0000012413507,0.0000019201934,0.0000031845777,0.9856515,0.000033756787,0.0139736775,0.0003152337,0.0000010032815],"about_ca_topic_score_codex":0.011989261,"about_ca_topic_score_gemma":0.013058151,"teacher_disagreement_score":0.011989261,"about_ca_system_score_codex":0.0028571167,"about_ca_system_score_gemma":0.0019097788,"threshold_uncertainty_score":0.023838937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94816625,0.0018849225,0.033028644,0.0014518941,0.000056152392,0.000076706805,0.0008967541,0.00011578747,0.0143230185],"genre_scores_gemma":[0.98960423,0.0007562205,0.008172882,0.000046860743,0.000010757443,0.000030097834,0.00024332987,0.00002478783,0.0011107568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995982,0.00020803869,0.000014461818,0.000041359643,0.000024774792,0.00011320461],"domain_scores_gemma":[0.99908566,0.00056238903,0.00010788646,0.000033447493,0.00014358731,0.000066919776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081818766,0.00059456466,0.0005218937,0.0007792895,0.0004517064,0.0011504124,0.00033077496,0.00034914055,0.0021519638],"category_scores_gemma":[0.002393766,0.00024752488,0.00030322422,0.00172255,0.00027735028,0.00056789647,0.0003413909,0.0004823108,0.00015367578],"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.00038227296,0.00012925167,0.009288874,0.00010429464,0.000062455365,0.00012388366,0.000065096094,0.95371413,0.0010760248,0.004486226,0.0030101836,0.027557306],"study_design_scores_gemma":[0.000058482405,0.00016768686,0.013578104,0.00004066751,0.00006943792,0.00004287769,0.00080342294,0.97699124,0.002720185,0.002984986,0.0025242579,0.000018613864],"about_ca_topic_score_codex":0.03983736,"about_ca_topic_score_gemma":0.024894005,"teacher_disagreement_score":0.03983736,"about_ca_system_score_codex":0.0013393201,"about_ca_system_score_gemma":0.0018854089,"threshold_uncertainty_score":0.07921094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0476668,0.00039299813,0.93988144,0.0008383568,0.00004159171,0.00011941372,0.000100244484,0.00009201942,0.010867135],"genre_scores_gemma":[0.80039465,0.00039706624,0.19431642,0.00012210345,0.00008071907,0.00022880886,0.000098154334,0.000076980374,0.0042851246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902046,0.00047573537,0.000031070398,0.00013165655,0.00022489791,0.000116176525],"domain_scores_gemma":[0.9979886,0.001395292,0.0001927384,0.00014264284,0.00021157053,0.00006917295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032006542,0.0012466414,0.0008659402,0.00058251905,0.0005078744,0.0013202607,0.0010891851,0.0022167314,0.0028328975],"category_scores_gemma":[0.005419425,0.0003724415,0.0010851439,0.00060107035,0.0013089104,0.0014103854,0.0013755019,0.002079463,0.00017211703],"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.000037853504,0.000037976915,0.000150125,0.000054185526,0.000015100757,0.00022870445,0.000052851483,0.9430445,0.0008424498,0.04777333,0.00067167875,0.007091166],"study_design_scores_gemma":[0.000010944463,0.00003413808,0.000040712886,0.000006681047,0.000005042806,0.000029337401,0.000016772125,0.9906618,0.00027839994,0.008365522,0.0005448685,0.000005833412],"about_ca_topic_score_codex":0.0034697999,"about_ca_topic_score_gemma":0.0020820918,"teacher_disagreement_score":0.0034697999,"about_ca_system_score_codex":0.0012418092,"about_ca_system_score_gemma":0.00121121,"threshold_uncertainty_score":0.016926885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020269345,0.0006129083,0.9737135,0.0008437719,0.000049756985,0.00006229976,0.00019309572,0.00005531652,0.004199892],"genre_scores_gemma":[0.8804737,0.0016652036,0.10898805,0.00027860556,0.00023751348,0.00035086568,0.0003823862,0.00006241242,0.0075613004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466455,0.002638216,0.00028225043,0.0008662129,0.0011115072,0.00043734483],"domain_scores_gemma":[0.9862206,0.009252428,0.0023389787,0.0009923968,0.000799473,0.00039613977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0091452375,0.0025712703,0.0021747001,0.0013427639,0.0005669489,0.0034426327,0.0033503135,0.0027253143,0.0032409378],"category_scores_gemma":[0.021369904,0.0008546436,0.0015179687,0.0016244913,0.0028802003,0.007348577,0.0023846999,0.0038044797,0.00036291376],"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.00006745414,0.000075185024,0.00067986397,0.0001473976,0.00011418934,0.00027681142,0.00019608857,0.6028644,0.0007245273,0.38118318,0.0008582033,0.012812668],"study_design_scores_gemma":[0.000013346484,0.000065182154,0.00028965413,0.00004572377,0.000030155663,0.0000611613,0.000042538548,0.64951706,0.00032135838,0.34878486,0.0007999476,0.000028918805],"about_ca_topic_score_codex":0.0014912388,"about_ca_topic_score_gemma":0.0012820917,"teacher_disagreement_score":0.0091452375,"about_ca_system_score_codex":0.002105027,"about_ca_system_score_gemma":0.0012115666,"threshold_uncertainty_score":0.048365235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30316293,0.009694661,0.5472858,0.009304327,0.00030925902,0.00025642192,0.001334235,0.00027533167,0.12837712],"genre_scores_gemma":[0.9796203,0.002056277,0.010046896,0.00006445266,0.00008686388,0.000048642374,0.000096426964,0.00002988818,0.007950102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977563,0.0008509152,0.00010821826,0.00029168426,0.00071139494,0.0002815072],"domain_scores_gemma":[0.9897349,0.0073791794,0.0012681223,0.00036858598,0.0010258922,0.00022335305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038691503,0.00081435655,0.001322921,0.0014920813,0.0005030996,0.0042580045,0.0011708434,0.0014420679,0.011300566],"category_scores_gemma":[0.016633874,0.0003924789,0.0008825567,0.002695461,0.0016927795,0.003231145,0.0016719582,0.001889803,0.00043345668],"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.00019795634,0.00018058009,0.013425755,0.00076628674,0.00019861376,0.0002607244,0.0002109072,0.5195408,0.0028098952,0.33085725,0.0023230256,0.12922834],"study_design_scores_gemma":[0.000027529642,0.00037355514,0.02401504,0.00040644893,0.00014326996,0.00022339997,0.0013556478,0.5511506,0.00632406,0.4013656,0.0145013835,0.00011346447],"about_ca_topic_score_codex":0.003868399,"about_ca_topic_score_gemma":0.003729487,"teacher_disagreement_score":0.011300566,"about_ca_system_score_codex":0.002600771,"about_ca_system_score_gemma":0.0024879125,"threshold_uncertainty_score":0.037804127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047934704,0.0008512651,0.8885822,0.004906374,0.00017517313,0.00028824728,0.00053446164,0.00023398809,0.056493513],"genre_scores_gemma":[0.7552592,0.0013570421,0.22559577,0.0015111485,0.00043252768,0.0009888711,0.00046738586,0.00025589392,0.014132186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99139965,0.0035291938,0.0006067877,0.0014429964,0.0018982369,0.0011232073],"domain_scores_gemma":[0.9624084,0.026439482,0.0039045492,0.0027680467,0.00326814,0.0012113205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011401349,0.0014656843,0.0021801766,0.0012796267,0.0012097872,0.0035994484,0.0020893596,0.0037488954,0.011941919],"category_scores_gemma":[0.055563897,0.0013527387,0.0022176893,0.00087243743,0.0044798255,0.009776737,0.0027324113,0.0074925995,0.0016624541],"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.000051516254,0.00008116828,0.0003993684,0.00020121495,0.000025616253,0.00017235118,0.00019558056,0.018701946,0.0015463207,0.9685119,0.0015871575,0.008525831],"study_design_scores_gemma":[0.00006139181,0.00009742342,0.0003680219,0.0001069134,0.000013555687,0.00021048375,0.0000642287,0.13540426,0.0010704416,0.8585126,0.004053265,0.00003735264],"about_ca_topic_score_codex":0.0012270508,"about_ca_topic_score_gemma":0.0009554128,"teacher_disagreement_score":0.011941919,"about_ca_system_score_codex":0.0028632937,"about_ca_system_score_gemma":0.004835129,"threshold_uncertainty_score":0.060296834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017530322,0.00011601856,0.978848,0.00035020136,0.000017369346,0.00007054869,0.00010954674,0.000088745466,0.0028691983],"genre_scores_gemma":[0.64954376,0.00086123165,0.34267327,0.00040000165,0.0001631161,0.00048604747,0.00036676772,0.0002093322,0.005296506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861145,0.0007702226,0.000044675904,0.00023725985,0.00022062071,0.00011579089],"domain_scores_gemma":[0.9904186,0.0064426805,0.0015463745,0.0007258211,0.0005600415,0.00030661447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033205764,0.0009529083,0.00080931885,0.002274456,0.0006331438,0.001147177,0.0021837074,0.0010853735,0.005752872],"category_scores_gemma":[0.016917245,0.0005621055,0.0009653893,0.0015265768,0.002214956,0.003117398,0.0014067214,0.0019519569,0.0005676202],"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.000040848387,0.00011236987,0.0018461507,0.00011315468,0.000044740937,0.00020677022,0.00012163761,0.524822,0.0034532256,0.44901192,0.0019130927,0.018314121],"study_design_scores_gemma":[0.0000098208675,0.00005437786,0.0004987407,0.000015331063,0.00000953893,0.00012304279,0.000049408638,0.80687135,0.00059135637,0.19035244,0.0014053676,0.000019343901],"about_ca_topic_score_codex":0.0015046627,"about_ca_topic_score_gemma":0.0009270197,"teacher_disagreement_score":0.005752872,"about_ca_system_score_codex":0.0015053407,"about_ca_system_score_gemma":0.001340515,"threshold_uncertainty_score":0.019245267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03473582,0.0006580013,0.94638455,0.000710138,0.00012981042,0.00007617361,0.0002525131,0.00021520871,0.016837789],"genre_scores_gemma":[0.72035134,0.00088092143,0.26553133,0.00031844035,0.000102340964,0.00026678108,0.0007494786,0.00017834405,0.011621029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992719,0.00021727847,0.00003275169,0.00014399945,0.00017163456,0.00016235939],"domain_scores_gemma":[0.99833834,0.001156163,0.00012736954,0.000109564666,0.00019456515,0.00007403851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997878,0.0010731744,0.0015585345,0.00058572745,0.00048959197,0.001641994,0.0012196783,0.001669576,0.005709111],"category_scores_gemma":[0.0055231173,0.0006210766,0.0007948315,0.00074427045,0.0010621368,0.001972377,0.0016800395,0.0016854928,0.0004832934],"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.00006837394,0.000057689143,0.00035650682,0.00013147712,0.000022735057,0.0000869019,0.00006350607,0.9107017,0.0006075447,0.065403394,0.00266573,0.019834457],"study_design_scores_gemma":[0.00001769546,0.000016688487,0.00005062623,0.000011336904,0.000003950082,0.000013458735,0.000027742262,0.9675341,0.00018469381,0.031401053,0.00073316833,0.0000054845746],"about_ca_topic_score_codex":0.0058613666,"about_ca_topic_score_gemma":0.0038933114,"teacher_disagreement_score":0.0058613666,"about_ca_system_score_codex":0.00089432247,"about_ca_system_score_gemma":0.001638232,"threshold_uncertainty_score":0.019098878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013202218,0.0005938099,0.9908552,0.0005084438,0.00012707672,0.000037486403,0.00007917751,0.00008149564,0.006397069],"genre_scores_gemma":[0.23940793,0.0050845174,0.7320404,0.0014269077,0.0012295167,0.0007194841,0.0006285928,0.00073945936,0.018723188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997621,0.0008267858,0.00013516769,0.00040522846,0.0008444067,0.00016734432],"domain_scores_gemma":[0.99030274,0.006644628,0.0006529897,0.00077638874,0.0014454519,0.00017780895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059322813,0.002313959,0.0013967243,0.0018511834,0.00074182247,0.0031257146,0.0015966494,0.0022710466,0.01253758],"category_scores_gemma":[0.033393525,0.00067682326,0.0021732685,0.0018434067,0.0021390296,0.004749859,0.0029445523,0.0052354457,0.0026013264],"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.000037129874,0.00010391467,0.00041911352,0.0003041189,0.00006810881,0.00029058303,0.00018771885,0.1155768,0.0038814507,0.8152484,0.012784294,0.05109841],"study_design_scores_gemma":[0.000013572393,0.000045199093,0.00018449208,0.00011559354,0.000023548033,0.00032350246,0.00005339221,0.4785986,0.0014632181,0.5099252,0.00921212,0.000041531563],"about_ca_topic_score_codex":0.0009817105,"about_ca_topic_score_gemma":0.0010219349,"teacher_disagreement_score":0.01253758,"about_ca_system_score_codex":0.0012940377,"about_ca_system_score_gemma":0.0016076879,"threshold_uncertainty_score":0.041942358},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.265302,0.0036518683,0.56157064,0.008482074,0.00023416408,0.00020847612,0.0004152366,0.00018897525,0.15994655],"genre_scores_gemma":[0.97539943,0.0016129207,0.012675803,0.0004368519,0.00034755937,0.000121505065,0.000099563185,0.00006469413,0.009241621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998086,0.0010333026,0.0000796979,0.0002588008,0.00024085969,0.00030138373],"domain_scores_gemma":[0.9705061,0.024998145,0.0022448185,0.0006335967,0.00067861937,0.0009387225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035786612,0.0011301786,0.0013803021,0.0011013226,0.001458659,0.0036203247,0.0013988774,0.0018440621,0.008897505],"category_scores_gemma":[0.022379002,0.00081722264,0.0010037983,0.0016322838,0.005899796,0.008214882,0.0022136064,0.0043056267,0.00045224986],"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.000047476045,0.000051036957,0.00046148058,0.000040437833,0.000015804557,0.00008214767,0.00019880997,0.024160493,0.00025701118,0.9712142,0.0008073953,0.00266371],"study_design_scores_gemma":[0.000024457993,0.000029997896,0.00040248534,0.000016823846,0.000010880901,0.000036568745,0.000051443076,0.07141389,0.00006491452,0.9270757,0.0008533696,0.000019542953],"about_ca_topic_score_codex":0.004772821,"about_ca_topic_score_gemma":0.0026604293,"teacher_disagreement_score":0.008897505,"about_ca_system_score_codex":0.0027197408,"about_ca_system_score_gemma":0.0014678913,"threshold_uncertainty_score":0.02976513},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028062027,0.005406356,0.053380325,0.48712325,0.41022933,0.00011428551,0.0025970067,0.0015968978,0.036746394],"genre_scores_gemma":[0.20803301,0.017544283,0.07011082,0.24764119,0.18450783,0.00043713255,0.0037497717,0.002668934,0.26530698],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9881087,0.0017768805,0.0016419538,0.001852381,0.006015433,0.00060476817],"domain_scores_gemma":[0.961132,0.010515948,0.0026979682,0.0028860269,0.022174992,0.0005931136],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0062533463,0.0014981142,0.0013371578,0.001487846,0.0022981502,0.0032398275,0.0028284946,0.003989312,0.022026166],"category_scores_gemma":[0.06504001,0.0006762533,0.0011131273,0.0021558446,0.0028384419,0.005230124,0.0030608375,0.0057370802,0.017604364],"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.00007489704,0.000036947607,0.00034200505,0.00016585967,0.00002541666,0.00035058087,0.00030014955,0.0006557388,0.00041932316,0.058598593,0.9136428,0.025387617],"study_design_scores_gemma":[0.000043832795,0.000035027497,0.00095132564,0.0001891769,0.000042996595,0.0009298222,0.00016274741,0.0043362575,0.002341964,0.051158804,0.93970823,0.000099896024],"about_ca_topic_score_codex":0.008348626,"about_ca_topic_score_gemma":0.0053384327,"teacher_disagreement_score":0.99374664,"about_ca_system_score_codex":0.004593314,"about_ca_system_score_gemma":0.0033834344,"threshold_uncertainty_score":0.07368481},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28219405,0.00079683657,0.66159225,0.010074342,0.00039151352,0.00030472616,0.00067145756,0.00040846108,0.04356637],"genre_scores_gemma":[0.9697788,0.00023526918,0.017611055,0.00040728558,0.0001552,0.000085015825,0.0000659173,0.000042736414,0.0116187865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953348,0.0019151566,0.0001969329,0.0010141114,0.00071138004,0.00082770357],"domain_scores_gemma":[0.9789764,0.011759422,0.003957578,0.0020428316,0.0017361277,0.0015276306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008209333,0.0008420123,0.0018868868,0.0010917875,0.0019138666,0.005581817,0.003914431,0.0045687454,0.014228209],"category_scores_gemma":[0.024050884,0.0011868626,0.0012894068,0.0016195833,0.004602292,0.0060450085,0.0036707493,0.0029688468,0.0016760763],"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.00048592803,0.00019200753,0.006415208,0.00021952702,0.00011513065,0.00072546134,0.0006121157,0.22761682,0.0011018366,0.73847264,0.0066696606,0.017373787],"study_design_scores_gemma":[0.00028506477,0.0002987288,0.0015732034,0.00004296121,0.000081162216,0.00045244177,0.0005127617,0.62906003,0.00061273365,0.3611068,0.00583,0.00014410561],"about_ca_topic_score_codex":0.0077160946,"about_ca_topic_score_gemma":0.009904285,"teacher_disagreement_score":0.014228209,"about_ca_system_score_codex":0.0033033704,"about_ca_system_score_gemma":0.0030002252,"threshold_uncertainty_score":0.047598064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17962047,0.0021068864,0.71484005,0.011158877,0.00048098725,0.00020057971,0.00014597135,0.00036174228,0.09108439],"genre_scores_gemma":[0.96674037,0.00049334957,0.027556168,0.00037662784,0.00018177828,0.00013171785,0.000020897874,0.00005080816,0.00444836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417734,0.0026424723,0.00025581024,0.00079760293,0.0014061059,0.000720743],"domain_scores_gemma":[0.981939,0.011069623,0.0021403902,0.0031109115,0.00092969247,0.00081044424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060718474,0.0007086074,0.0008467251,0.0007539608,0.0019012486,0.00807226,0.0012138926,0.0028288055,0.008848095],"category_scores_gemma":[0.018885115,0.0005802153,0.0010019481,0.00061374326,0.008840429,0.013261946,0.004694173,0.0035354511,0.00059702375],"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.000083242056,0.000032899283,0.00026550313,0.00005698593,0.000015861982,0.000059514525,0.00019219605,0.013654685,0.0012709171,0.9724673,0.0006665616,0.011234389],"study_design_scores_gemma":[0.000043876575,0.00006612326,0.0002545925,0.000059538674,0.00001904786,0.000043965836,0.00009931259,0.040593382,0.0013075892,0.952455,0.0050266744,0.000031024825],"about_ca_topic_score_codex":0.00084003643,"about_ca_topic_score_gemma":0.0005974928,"teacher_disagreement_score":0.008848095,"about_ca_system_score_codex":0.0024013207,"about_ca_system_score_gemma":0.001678737,"threshold_uncertainty_score":0.032111406},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001402539,0.00058176724,0.99048156,0.00036649613,0.00017362447,0.00003591448,0.000050612867,0.000105507206,0.0068018916],"genre_scores_gemma":[0.30709404,0.0023073808,0.66641283,0.0010328598,0.00064153137,0.0004276374,0.0004013324,0.00033890465,0.021343503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902236,0.00036444428,0.000035438323,0.00023850838,0.0002485081,0.00009064393],"domain_scores_gemma":[0.99923813,0.00040190408,0.000073757714,0.00008799384,0.00015527297,0.00004294506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014523255,0.0011913696,0.0010349344,0.00070919713,0.00044986937,0.0017548283,0.001289822,0.0013725046,0.0051473556],"category_scores_gemma":[0.0028006407,0.00059319346,0.0009380915,0.00097282376,0.00088667683,0.0014758306,0.0017062991,0.0029175668,0.0012694763],"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.00012055758,0.000098883516,0.00023800276,0.00026716405,0.00011190426,0.00009855992,0.000055227505,0.48708144,0.002536097,0.35917294,0.011599863,0.13861935],"study_design_scores_gemma":[0.0000184141,0.000050858962,0.00005152565,0.00003151809,0.000015947599,0.000061075065,0.000009078517,0.91212994,0.0015908561,0.069530934,0.016493352,0.000016583226],"about_ca_topic_score_codex":0.0009117502,"about_ca_topic_score_gemma":0.0006384407,"teacher_disagreement_score":0.0051473556,"about_ca_system_score_codex":0.0011958925,"about_ca_system_score_gemma":0.0010140452,"threshold_uncertainty_score":0.017219663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04167682,0.0045765587,0.8970648,0.0022198043,0.0002996513,0.00008620949,0.00023948406,0.00012397674,0.053712863],"genre_scores_gemma":[0.9008183,0.0070922133,0.06711799,0.00038113858,0.0004677777,0.00007188718,0.00026879332,0.000065706256,0.02371623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.00018769858,0.00004348052,0.00019058913,0.00015365367,0.00013180917],"domain_scores_gemma":[0.9987111,0.0006889985,0.00015450468,0.00011835489,0.0002636138,0.00006342819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071007194,0.0006410797,0.001049941,0.00082795287,0.0012052733,0.003847548,0.0016366941,0.0015979694,0.008082273],"category_scores_gemma":[0.0027702898,0.000613307,0.0008335627,0.0012957946,0.001825392,0.006369015,0.001515103,0.0021667567,0.00075190194],"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.000016434708,0.000039587194,0.00045660694,0.00012348656,0.000013306922,0.00013478972,0.00022416553,0.22940066,0.000763315,0.7529287,0.0020299875,0.013868971],"study_design_scores_gemma":[0.0000060245775,0.000028807786,0.00042108295,0.000056936264,0.000013632163,0.00012458234,0.00027720645,0.5031648,0.0004227109,0.4862669,0.009186941,0.000030313058],"about_ca_topic_score_codex":0.008975354,"about_ca_topic_score_gemma":0.004989177,"teacher_disagreement_score":0.008975354,"about_ca_system_score_codex":0.0022166565,"about_ca_system_score_gemma":0.0013913991,"threshold_uncertainty_score":0.027037919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041400376,0.00027135355,0.9914392,0.00023168058,0.00004204588,0.000054748758,0.00007591513,0.00008146105,0.0036634845],"genre_scores_gemma":[0.48962656,0.0012279223,0.49708885,0.0004034481,0.0003308183,0.00071054185,0.00048359646,0.00033242992,0.009795928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954509,0.00223726,0.00022184527,0.0006634089,0.0010443368,0.00038230408],"domain_scores_gemma":[0.9925982,0.0049477424,0.0007248731,0.0006965491,0.0008024283,0.00023025788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006962375,0.002121295,0.0016480458,0.0007649747,0.00043149554,0.0025775686,0.0020716784,0.0016090093,0.005909007],"category_scores_gemma":[0.014350378,0.00067485747,0.0018504938,0.001073785,0.0015406499,0.0022720874,0.002242725,0.0048173317,0.00090947706],"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.00007889798,0.00006421638,0.00020121555,0.00011363271,0.000041120238,0.000060567418,0.00006102964,0.88114333,0.0008528291,0.099698916,0.0015607565,0.016123425],"study_design_scores_gemma":[0.0000133151725,0.000033175915,0.000050165418,0.000009796705,0.0000060988395,0.000010075099,0.000005334428,0.9777615,0.00037477433,0.021073462,0.0006550337,0.000007226924],"about_ca_topic_score_codex":0.002054068,"about_ca_topic_score_gemma":0.0014042932,"teacher_disagreement_score":0.006962375,"about_ca_system_score_codex":0.0017191751,"about_ca_system_score_gemma":0.0015779563,"threshold_uncertainty_score":0.036821008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014427582,0.00044205252,0.9804827,0.0012047398,0.00014057198,0.00010368984,0.00017577884,0.0004406316,0.0025822779],"genre_scores_gemma":[0.6454049,0.00054250995,0.34654257,0.0007234069,0.00026909425,0.00030312364,0.00058846566,0.000117149124,0.0055087884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975339,0.00076281314,0.00014575117,0.00076460704,0.00045477078,0.00033814216],"domain_scores_gemma":[0.9936334,0.0045935954,0.0005221277,0.00035776306,0.00063630013,0.0002567265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032811223,0.0012646297,0.002530087,0.0011011679,0.0009009805,0.0015294024,0.0016393828,0.0022207808,0.0037582493],"category_scores_gemma":[0.013963796,0.00092373014,0.00095407246,0.0011824883,0.0017343417,0.002241557,0.0022940638,0.002596802,0.00053387677],"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.00045152998,0.00018320349,0.0026596887,0.00023529044,0.00011462987,0.00020877492,0.00018549904,0.7448432,0.0015554813,0.07993202,0.008492883,0.16113774],"study_design_scores_gemma":[0.000026070693,0.00004431992,0.00014979902,0.000014665338,0.000011536529,0.00003398489,0.000017240749,0.94935167,0.0006669535,0.04888726,0.0007853062,0.000011164624],"about_ca_topic_score_codex":0.0064938474,"about_ca_topic_score_gemma":0.0048091956,"teacher_disagreement_score":0.0064938474,"about_ca_system_score_codex":0.0019647747,"about_ca_system_score_gemma":0.003899815,"threshold_uncertainty_score":0.017352402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025779582,0.00034071135,0.99222106,0.0001948753,0.000049356,0.00005536758,0.00006206134,0.000047236073,0.004451255],"genre_scores_gemma":[0.3364059,0.0016655341,0.6491748,0.00048062298,0.00019850029,0.00078395644,0.00046123177,0.00024187141,0.010587595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971807,0.0014910374,0.000114572016,0.00030260993,0.00068677944,0.00022432026],"domain_scores_gemma":[0.99529946,0.003413331,0.0003091769,0.00024584655,0.00055883196,0.00017334952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007005925,0.0013575016,0.0014706055,0.0010146709,0.0005328963,0.002713265,0.0016757214,0.0010714632,0.004043332],"category_scores_gemma":[0.010993536,0.00092114526,0.0014928964,0.0011882003,0.0017781113,0.0020636888,0.0021081804,0.004880929,0.00090581115],"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.000049059498,0.000058634443,0.00025974461,0.00010054229,0.000032717497,0.00006525699,0.00007758258,0.6446445,0.00059821503,0.33336893,0.0020411236,0.018703673],"study_design_scores_gemma":[0.000012186449,0.0000148321715,0.000028994933,0.000023797027,0.0000062524045,0.000010335395,0.00000601651,0.9310449,0.00026274662,0.067231745,0.0013505786,0.000007689767],"about_ca_topic_score_codex":0.0025269003,"about_ca_topic_score_gemma":0.002236149,"teacher_disagreement_score":0.007005925,"about_ca_system_score_codex":0.0021425132,"about_ca_system_score_gemma":0.0020135017,"threshold_uncertainty_score":0.03705132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493969,0.0003380306,0.99002075,0.00015240884,0.000108995046,0.00008525139,0.00007292397,0.00015040528,0.008221947],"genre_scores_gemma":[0.081451446,0.0018677785,0.89717954,0.00039841357,0.00025783342,0.0005403769,0.00047921768,0.0002637832,0.0175616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.00049256,0.000064606174,0.00018001956,0.0004459884,0.00011182552],"domain_scores_gemma":[0.99936205,0.0002765739,0.000050281174,0.000077840996,0.00019379954,0.00003940928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017860392,0.001613562,0.0011586435,0.0011969843,0.0005970499,0.0017497828,0.0013479039,0.0013433754,0.010858186],"category_scores_gemma":[0.002574943,0.00074301753,0.0013729432,0.0010688824,0.00080249336,0.0014043307,0.0016544226,0.003027245,0.0027163685],"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.00011737569,0.00011257303,0.00048251322,0.00043512086,0.00014794283,0.00012201055,0.00011582571,0.46112996,0.004025216,0.27601779,0.017590066,0.23970358],"study_design_scores_gemma":[0.000044825665,0.000050911254,0.00010451423,0.00006292021,0.0000309049,0.00009727018,0.0000259558,0.91781443,0.0023030725,0.04938286,0.030058816,0.00002349489],"about_ca_topic_score_codex":0.0019333893,"about_ca_topic_score_gemma":0.0013240466,"teacher_disagreement_score":0.010858186,"about_ca_system_score_codex":0.0008209375,"about_ca_system_score_gemma":0.0018937476,"threshold_uncertainty_score":0.036324203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014135088,0.00082257367,0.9794159,0.00083254144,0.00019596638,0.00007583481,0.000032225704,0.0000952438,0.004394647],"genre_scores_gemma":[0.9022818,0.0013563795,0.0899405,0.000388848,0.00033206274,0.00014962646,0.000059146896,0.000093299845,0.0053983703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981559,0.000762125,0.000067216795,0.00024914692,0.00046650987,0.00029903074],"domain_scores_gemma":[0.9973265,0.0018388784,0.00024669705,0.00012685962,0.00033977022,0.00012129272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032039448,0.0017182367,0.0015126106,0.00072008825,0.0006126912,0.0022301832,0.0020506147,0.0018217649,0.0030610033],"category_scores_gemma":[0.0064498135,0.0009418609,0.0011985353,0.0010858378,0.0017606608,0.0035176473,0.0011971188,0.0028232718,0.0002667374],"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.00012469568,0.00013817765,0.00023650107,0.00011941743,0.00006618933,0.000108234526,0.000084034036,0.84637916,0.0017759486,0.1340842,0.0021276749,0.014755721],"study_design_scores_gemma":[0.000012074993,0.000027548436,0.000040692597,0.0000053106746,0.0000069434222,0.000010069934,0.00000948373,0.9864178,0.00021289212,0.012794016,0.0004536666,0.000009501546],"about_ca_topic_score_codex":0.005450836,"about_ca_topic_score_gemma":0.004170676,"teacher_disagreement_score":0.005450836,"about_ca_system_score_codex":0.003036146,"about_ca_system_score_gemma":0.0020724926,"threshold_uncertainty_score":0.022028863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038005977,0.0005505654,0.9903515,0.00035889825,0.000077534256,0.00007995915,0.00008517973,0.00009053736,0.0046051354],"genre_scores_gemma":[0.16363558,0.0014757981,0.8284003,0.00036603608,0.00021046984,0.00034493953,0.00052405725,0.00018236635,0.004860277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803704,0.00082385726,0.000093296374,0.0002366431,0.0005555879,0.00025363418],"domain_scores_gemma":[0.9976757,0.0016232729,0.00016332357,0.0002126741,0.00022916566,0.000095893556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418407,0.0019655863,0.0011642,0.0010009253,0.00067328167,0.0019357244,0.0030661996,0.0018052299,0.0040572695],"category_scores_gemma":[0.0047609173,0.0009568667,0.0011807987,0.0022501564,0.0011595456,0.0031622583,0.0019780602,0.004638934,0.000649619],"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.0002427709,0.0002683152,0.0005653872,0.0003623762,0.000103361104,0.0001855924,0.00014241865,0.5206536,0.0027242608,0.28951338,0.009878224,0.1753604],"study_design_scores_gemma":[0.000040833398,0.000043484088,0.000094772775,0.000045639958,0.000023829043,0.00004077553,0.00002760292,0.89458907,0.001268737,0.09839493,0.0054179104,0.000012472095],"about_ca_topic_score_codex":0.0028988253,"about_ca_topic_score_gemma":0.0034729608,"teacher_disagreement_score":0.0040572695,"about_ca_system_score_codex":0.0017401155,"about_ca_system_score_gemma":0.0017590291,"threshold_uncertainty_score":0.013572872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12420047,0.001256685,0.82199293,0.011553026,0.0002511192,0.00011883612,0.00019739184,0.000089066976,0.04034061],"genre_scores_gemma":[0.93803596,0.00040718078,0.057030153,0.00075993,0.0001852494,0.00017216268,0.00005900723,0.000039576047,0.0033107004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98433566,0.0098457355,0.0005463638,0.002132552,0.0016178848,0.0015217578],"domain_scores_gemma":[0.962269,0.029046062,0.0033187733,0.0028919263,0.0014171541,0.0010570426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01744631,0.00067829195,0.00179853,0.0007916164,0.0022388347,0.005278627,0.0019270246,0.0032001566,0.004160013],"category_scores_gemma":[0.048682634,0.0005925049,0.00096582907,0.0011804816,0.006513184,0.013818511,0.004255785,0.004338094,0.00036829725],"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.0003041959,0.000089378096,0.00095644675,0.000059706388,0.00005749348,0.00008798872,0.00036093287,0.02724046,0.00034381828,0.95554245,0.0011240806,0.013833054],"study_design_scores_gemma":[0.000043723932,0.00003890382,0.00023606769,0.000020460891,0.000014854274,0.000048960683,0.0001027859,0.056020144,0.0003606898,0.9417758,0.0013222664,0.000015398538],"about_ca_topic_score_codex":0.0014690015,"about_ca_topic_score_gemma":0.0013875504,"teacher_disagreement_score":0.01744631,"about_ca_system_score_codex":0.002776752,"about_ca_system_score_gemma":0.0028481581,"threshold_uncertainty_score":0.09226602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8891647,0.0018319834,0.06201192,0.006958354,0.00011689096,0.00022109186,0.00046154944,0.0001534473,0.03908],"genre_scores_gemma":[0.9952538,0.00037599434,0.0019122487,0.00010425484,0.000037966587,0.000018995146,0.00004503152,0.00000786129,0.002243946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969458,0.0015102096,0.00016491982,0.0004065969,0.00042787596,0.00054459396],"domain_scores_gemma":[0.9395556,0.04469754,0.011158375,0.002546453,0.0012715216,0.0007705518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005744655,0.00057644304,0.00064541085,0.00078877195,0.0009410093,0.0034182812,0.0012369386,0.0024142265,0.005614704],"category_scores_gemma":[0.040698603,0.0005873537,0.0009453178,0.0007865386,0.0023850356,0.005509901,0.0011522383,0.003737243,0.00032024606],"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.0016301159,0.0008228651,0.023630891,0.00030191726,0.00021072176,0.0004799867,0.0009847438,0.1873665,0.004239333,0.73150724,0.0044313096,0.044394385],"study_design_scores_gemma":[0.00032386652,0.0005087459,0.023532026,0.000099235025,0.00022094477,0.00033045237,0.000772023,0.6430934,0.006938102,0.31914663,0.0048541934,0.00018036978],"about_ca_topic_score_codex":0.003113929,"about_ca_topic_score_gemma":0.0021753304,"teacher_disagreement_score":0.005744655,"about_ca_system_score_codex":0.004013296,"about_ca_system_score_gemma":0.0014965087,"threshold_uncertainty_score":0.030380964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5830163,0.0019977,0.17003447,0.0058584563,0.00032012924,0.00019059713,0.00021940378,0.00039361248,0.23796949],"genre_scores_gemma":[0.978127,0.00060799666,0.007725329,0.00035927247,0.00007439642,0.000021965108,0.000102485494,0.000026949328,0.012954536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996007,0.00012392769,0.000013462381,0.00008632328,0.00008302753,0.00009252475],"domain_scores_gemma":[0.9989944,0.00039374782,0.000164882,0.00015448898,0.00013171391,0.00016075314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895638,0.0003962823,0.00044957292,0.00033430185,0.00091247424,0.0020717601,0.0005772782,0.0010637712,0.013154966],"category_scores_gemma":[0.0032989415,0.00038867682,0.000503155,0.0004916492,0.0008725496,0.0026994466,0.0010585968,0.0013372004,0.0013737136],"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.00063408253,0.00052859215,0.0168654,0.00026790134,0.0001648857,0.0020914779,0.0018250654,0.046662144,0.007720439,0.6821167,0.027993495,0.21312977],"study_design_scores_gemma":[0.00014139211,0.0009668581,0.018494347,0.00017561794,0.00014742538,0.0038800742,0.0052615744,0.2571225,0.008029112,0.61833656,0.087299116,0.00014536681],"about_ca_topic_score_codex":0.0026658133,"about_ca_topic_score_gemma":0.0038613547,"teacher_disagreement_score":0.013154966,"about_ca_system_score_codex":0.0008678867,"about_ca_system_score_gemma":0.0008868864,"threshold_uncertainty_score":0.04400772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072453674,0.0015828537,0.9801025,0.0019227436,0.00030778686,0.000020871443,0.00006735688,0.00017815207,0.008572218],"genre_scores_gemma":[0.60677344,0.0056566205,0.3707822,0.002756638,0.0025951695,0.000211691,0.00029668224,0.0006380358,0.010289562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952436,0.0020059568,0.00024419362,0.0005906843,0.0015142608,0.00040131094],"domain_scores_gemma":[0.9806082,0.013328824,0.0010656767,0.0025987914,0.001900903,0.00049766887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008370886,0.0011865715,0.0011842817,0.0018756185,0.00073466805,0.0036920055,0.0014974638,0.001793675,0.0046184766],"category_scores_gemma":[0.044723433,0.0005904858,0.001715832,0.0022970648,0.0035594553,0.0072974325,0.004343316,0.005813758,0.00069357204],"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.00004893175,0.000020919597,0.00047427975,0.000054524095,0.000041116382,0.000045302142,0.00010717624,0.04012412,0.0008450891,0.92550355,0.0037243387,0.0290105],"study_design_scores_gemma":[0.000009859591,0.00002313135,0.00042479954,0.00006451194,0.000023551902,0.000043825945,0.00002141027,0.3413043,0.0010377015,0.65090144,0.0061216685,0.000023775272],"about_ca_topic_score_codex":0.0022903658,"about_ca_topic_score_gemma":0.0013576535,"teacher_disagreement_score":0.008370886,"about_ca_system_score_codex":0.0031647452,"about_ca_system_score_gemma":0.0013880671,"threshold_uncertainty_score":0.04427004},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032677256,0.0006486856,0.94966346,0.0056657065,0.00023471822,0.00065998704,0.0008217965,0.00028234685,0.009346103],"genre_scores_gemma":[0.71554923,0.00079118,0.27256986,0.0015178679,0.00025653772,0.0009444361,0.00080037874,0.000094765564,0.0074757626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524164,0.0027855649,0.00018788653,0.0008060476,0.0005082108,0.00047054063],"domain_scores_gemma":[0.9879644,0.009367458,0.001032551,0.00047403201,0.00064201024,0.0005196354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075733485,0.0013179001,0.0022004,0.0008630172,0.0005238818,0.0016746647,0.0024869768,0.0029189887,0.009392142],"category_scores_gemma":[0.020069556,0.0013001907,0.0013735329,0.0008960975,0.0012061232,0.0024800296,0.0012690224,0.0033366105,0.0006949804],"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.0006247346,0.0003110581,0.003931378,0.00015544542,0.00020283458,0.00024060525,0.00023633029,0.82401973,0.00048810302,0.106825225,0.0072457106,0.05571892],"study_design_scores_gemma":[0.00020502401,0.00011335055,0.00038892715,0.00004207259,0.00005505893,0.0000810015,0.00004783753,0.9022387,0.00021171078,0.09432761,0.0022568735,0.00003166527],"about_ca_topic_score_codex":0.005147556,"about_ca_topic_score_gemma":0.0057455185,"teacher_disagreement_score":0.009392142,"about_ca_system_score_codex":0.002204106,"about_ca_system_score_gemma":0.0032390824,"threshold_uncertainty_score":0.040052176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1279592,0.00057843846,0.8674878,0.0011985295,0.00007373472,0.000105855564,0.00018301963,0.0010011357,0.0014122236],"genre_scores_gemma":[0.8640694,0.00027063847,0.13283399,0.00025133346,0.00016837403,0.0001192942,0.00052318384,0.000101490776,0.0016622207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636024,0.0015510737,0.00027515003,0.0007629485,0.0007469373,0.00030357068],"domain_scores_gemma":[0.9738962,0.016480358,0.0035690984,0.0029876898,0.0025133116,0.000553477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008534339,0.0012997722,0.0024354823,0.001787569,0.00074722397,0.0029759014,0.0018551968,0.002123634,0.0010774225],"category_scores_gemma":[0.04612711,0.00079576665,0.00065795146,0.0013094317,0.0022182802,0.003746716,0.0021041506,0.002674659,0.00079745153],"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.0005078291,0.00027599058,0.009083519,0.00015506477,0.00015016684,0.00017153713,0.00014805107,0.843614,0.0031383971,0.016550293,0.0028478187,0.12335733],"study_design_scores_gemma":[0.000008155116,0.000033040793,0.00027416152,0.0000047153108,0.0000050832027,0.00001635931,0.000010138236,0.9930326,0.00055791845,0.0059169857,0.00013421319,0.0000066109064],"about_ca_topic_score_codex":0.0019611286,"about_ca_topic_score_gemma":0.0012785711,"teacher_disagreement_score":0.008534339,"about_ca_system_score_codex":0.0010825295,"about_ca_system_score_gemma":0.0017202048,"threshold_uncertainty_score":0.045134425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024603479,0.00044896003,0.9692578,0.0007772284,0.00006743491,0.000048418133,0.00022476717,0.0001207248,0.0044512986],"genre_scores_gemma":[0.81612843,0.0010903539,0.17124775,0.00034036656,0.00031429803,0.00024359142,0.00062929094,0.0001862197,0.009819614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853563,0.0005650731,0.000064649335,0.0003329013,0.0002966547,0.00020510942],"domain_scores_gemma":[0.9950151,0.003655852,0.0004970678,0.00032749004,0.00028286548,0.00022151331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002152997,0.0015325885,0.002071085,0.00080480345,0.0005769763,0.002189244,0.0013996449,0.002352775,0.0036793463],"category_scores_gemma":[0.009199994,0.0008251848,0.0011904456,0.0012909262,0.0023801653,0.003279641,0.001622821,0.0022877392,0.00054203335],"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.00014912453,0.00006402186,0.00049347384,0.00012720797,0.00005114651,0.00021750924,0.000053717504,0.8422614,0.001631926,0.13454515,0.0022876875,0.018117718],"study_design_scores_gemma":[0.00003749959,0.0000720327,0.0001701764,0.000016170896,0.000012063476,0.0000989969,0.000026057629,0.91462576,0.00069811294,0.083109766,0.0011135266,0.000019763667],"about_ca_topic_score_codex":0.0012962278,"about_ca_topic_score_gemma":0.0007108255,"teacher_disagreement_score":0.0036793463,"about_ca_system_score_codex":0.0013297633,"about_ca_system_score_gemma":0.00085275393,"threshold_uncertainty_score":0.012308598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17621665,0.0005839124,0.79727125,0.0005733368,0.00008237261,0.00032110512,0.00066210126,0.0009226294,0.023366746],"genre_scores_gemma":[0.75871426,0.00054994045,0.23335922,0.00007462664,0.000028933751,0.00018394156,0.000660964,0.00013600991,0.0062920004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993344,0.00020005362,0.00003159008,0.00014196115,0.00012955094,0.00016248152],"domain_scores_gemma":[0.9996252,0.00012823388,0.000059693066,0.000040931594,0.00006868324,0.00007731003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408179,0.0011822382,0.0008982328,0.0008516472,0.0007223688,0.0020009866,0.0012114969,0.0010358182,0.0062128697],"category_scores_gemma":[0.0010260664,0.00086949795,0.0010288699,0.0019990315,0.00063921337,0.0018253538,0.0013097285,0.001142368,0.00042109835],"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.00005493266,0.00007072366,0.0006604917,0.00004467003,0.000034379816,0.00014344035,0.00005101925,0.97090316,0.0011808504,0.005002058,0.0009294399,0.020924881],"study_design_scores_gemma":[0.00001829937,0.00007122453,0.00040352097,0.000011442676,0.000019802626,0.00003975748,0.0000876268,0.9925538,0.000752168,0.004246565,0.0017864866,0.000009296116],"about_ca_topic_score_codex":0.019676019,"about_ca_topic_score_gemma":0.026304957,"teacher_disagreement_score":0.019676019,"about_ca_system_score_codex":0.0013828961,"about_ca_system_score_gemma":0.0020769294,"threshold_uncertainty_score":0.039123},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06790119,0.0006770691,0.908058,0.0014691553,0.00006748891,0.00006838396,0.00038097487,0.00034030742,0.021037512],"genre_scores_gemma":[0.963648,0.0005977607,0.02501927,0.00023685499,0.00010216738,0.00011375334,0.00023127646,0.0001195732,0.009931512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992812,0.00025218347,0.00002934932,0.00019490442,0.00013549946,0.000107010055],"domain_scores_gemma":[0.9985983,0.0006180214,0.00033587657,0.00014626878,0.00019475265,0.00010682746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014455946,0.0011504063,0.001334132,0.00093606213,0.00069680647,0.0017559312,0.001528751,0.0015554405,0.004979883],"category_scores_gemma":[0.0037617127,0.00047092943,0.0021510883,0.00073366164,0.0018524386,0.0019140089,0.0020693385,0.0014835749,0.0007233288],"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.000057525398,0.000037808808,0.00082968734,0.00010007276,0.00010049892,0.00042282784,0.00015094518,0.7114776,0.0042771613,0.27530196,0.0023491387,0.004894803],"study_design_scores_gemma":[0.000009493649,0.000027860495,0.00017313987,0.00000901085,0.000014064208,0.000057301004,0.00002168555,0.91564494,0.00019409005,0.08291947,0.00091371476,0.000015195538],"about_ca_topic_score_codex":0.0060647205,"about_ca_topic_score_gemma":0.002551763,"teacher_disagreement_score":0.0060647205,"about_ca_system_score_codex":0.001352038,"about_ca_system_score_gemma":0.0008828002,"threshold_uncertainty_score":0.016659379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025330797,0.00011440984,0.9714035,0.00037860355,0.000019506411,0.000054882035,0.00007952261,0.000102738486,0.0025159644],"genre_scores_gemma":[0.62523264,0.00042283427,0.36844346,0.0001669129,0.00009010409,0.00030509592,0.00032769245,0.0002108277,0.0048003844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991068,0.00047357508,0.000030411227,0.00011803785,0.00021398265,0.00005715275],"domain_scores_gemma":[0.9960824,0.0029361893,0.0003802602,0.00026973695,0.00025185157,0.0000794981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038788696,0.00089283846,0.0011633609,0.0007574802,0.00041738997,0.0010603155,0.0010476474,0.00088797463,0.0028378414],"category_scores_gemma":[0.014248683,0.000573991,0.0009985613,0.0008873183,0.0018965582,0.0014751435,0.0016267783,0.002075576,0.00023722871],"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.00004590249,0.000044624798,0.00088232564,0.000051199775,0.000045824287,0.0000996688,0.00007522837,0.90769583,0.0007513008,0.07132424,0.0006244953,0.018359317],"study_design_scores_gemma":[0.0000058315964,0.0000091875045,0.00014190118,0.0000036769457,0.000002068927,0.000008786767,0.000006875646,0.9872792,0.0001555292,0.012177696,0.00020171207,0.000007512796],"about_ca_topic_score_codex":0.0051234644,"about_ca_topic_score_gemma":0.003543091,"teacher_disagreement_score":0.0051234644,"about_ca_system_score_codex":0.0008685734,"about_ca_system_score_gemma":0.0019155153,"threshold_uncertainty_score":0.020513713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021978209,0.001373644,0.9534076,0.00082255783,0.0000926872,0.00012941644,0.00011241804,0.0001993666,0.021884143],"genre_scores_gemma":[0.8911858,0.0016747629,0.09664911,0.00034724656,0.0004962802,0.00029204023,0.00018188666,0.00032612053,0.008846688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955101,0.0020358653,0.00010687373,0.0005303594,0.0012042639,0.00061242393],"domain_scores_gemma":[0.98762894,0.008281093,0.0015375782,0.0007400078,0.001256016,0.0005563291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064266715,0.002140471,0.002312985,0.0018524668,0.001039006,0.004029868,0.003718773,0.001987465,0.007360813],"category_scores_gemma":[0.02453666,0.00089304004,0.0012817426,0.0016506355,0.003125545,0.0070966906,0.0025473877,0.0036719108,0.0008741057],"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.00009857709,0.00014340761,0.000407767,0.00016022965,0.000053041094,0.00008543862,0.00009129864,0.578777,0.0010063488,0.39510286,0.0025277922,0.02154616],"study_design_scores_gemma":[0.000008191227,0.00003382368,0.000086135384,0.000014455939,0.0000072329044,0.000017145714,0.000018169374,0.9229424,0.00024247603,0.0759251,0.00069356227,0.000011306156],"about_ca_topic_score_codex":0.0033306757,"about_ca_topic_score_gemma":0.0013968094,"teacher_disagreement_score":0.007360813,"about_ca_system_score_codex":0.0043640747,"about_ca_system_score_gemma":0.0020469003,"threshold_uncertainty_score":0.03398794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9383535,0.00016130964,0.054763086,0.0013372898,0.000028299262,0.00008072935,0.00012961146,0.00010093152,0.005045284],"genre_scores_gemma":[0.99496245,0.000044033946,0.0044971392,0.000046643883,0.0000048462916,0.000017527223,0.000029388317,0.0000058944474,0.00039205916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982503,0.00087974244,0.000095302574,0.00027543335,0.00028299523,0.00021613589],"domain_scores_gemma":[0.97697383,0.015886927,0.0045188055,0.0013827154,0.000745224,0.00049239816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057850135,0.00040567332,0.00051905075,0.00045968787,0.00048599174,0.0022470923,0.0011359336,0.0014647208,0.0031295489],"category_scores_gemma":[0.034275208,0.0004474182,0.0007087941,0.0006042764,0.0014248583,0.003323306,0.0007498176,0.0022275564,0.00017481732],"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.0018842665,0.0015863423,0.21642359,0.00021119605,0.00032677912,0.0007769664,0.0019012132,0.37779164,0.010586223,0.31699288,0.0023814046,0.069137484],"study_design_scores_gemma":[0.000095045856,0.00027455602,0.04745765,0.000021480804,0.00009377224,0.00014980031,0.00071767136,0.7784632,0.0023483697,0.16952038,0.0007367944,0.00012129891],"about_ca_topic_score_codex":0.006249001,"about_ca_topic_score_gemma":0.0066313716,"teacher_disagreement_score":0.006249001,"about_ca_system_score_codex":0.0028782578,"about_ca_system_score_gemma":0.0011268439,"threshold_uncertainty_score":0.030594468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018560741,0.0006638006,0.96876746,0.000860046,0.00007721138,0.000053716773,0.000117987765,0.00009273984,0.010806231],"genre_scores_gemma":[0.91329974,0.0010507968,0.07716795,0.0002754816,0.00020697142,0.00014660468,0.00012944927,0.00007221543,0.007650833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612707,0.0017275853,0.0001740475,0.00075758394,0.000731999,0.00048170032],"domain_scores_gemma":[0.9953164,0.0023209925,0.0008278169,0.000819311,0.00044900915,0.0002665312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005412488,0.0010858207,0.0017605528,0.00078193145,0.00067995826,0.0032379956,0.002686195,0.0019374258,0.0068667526],"category_scores_gemma":[0.011559152,0.00046761657,0.0011457823,0.0011700931,0.0014710804,0.0038316662,0.0028742657,0.002047022,0.0006890554],"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.00006774437,0.00008065169,0.0009868302,0.00010210975,0.00009458823,0.00012703244,0.00015867731,0.31307977,0.0012812605,0.64288634,0.0020252236,0.03910976],"study_design_scores_gemma":[0.000018389717,0.00006279026,0.00035906205,0.000030747007,0.000027531647,0.00010110305,0.00005472795,0.55241954,0.00055778096,0.4429377,0.0034049288,0.000025693807],"about_ca_topic_score_codex":0.0010359302,"about_ca_topic_score_gemma":0.0005528068,"teacher_disagreement_score":0.0068667526,"about_ca_system_score_codex":0.0017474707,"about_ca_system_score_gemma":0.0010755607,"threshold_uncertainty_score":0.028624296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6661854,0.00047778746,0.32902,0.00053544116,0.00003289187,0.00013541532,0.00032839482,0.00026485955,0.0030197746],"genre_scores_gemma":[0.98946637,0.0001062928,0.009261346,0.000021012733,0.0000063999346,0.000035125096,0.00006397472,0.000017779937,0.0010217275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902713,0.00031202286,0.000064816384,0.00022843106,0.00009824313,0.00026934606],"domain_scores_gemma":[0.9970294,0.0016934713,0.0006674089,0.00012312643,0.0001884119,0.0002981594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020574126,0.00083821936,0.0014586694,0.0006513666,0.00054439896,0.0018092428,0.0013076526,0.0011446151,0.0015200995],"category_scores_gemma":[0.004031494,0.0010037931,0.0007185551,0.0007143452,0.0012056901,0.0016369115,0.0009128137,0.0011119053,0.00017904042],"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.00016604428,0.00004067775,0.00069185585,0.00003323991,0.00002817316,0.000078595054,0.000049674007,0.9909883,0.0007774235,0.003613327,0.00013400525,0.0033986496],"study_design_scores_gemma":[0.000018657576,0.00005866073,0.00030479446,0.000004701125,0.000009013399,0.000012998606,0.000028506765,0.99668306,0.000287027,0.002511014,0.0000726278,0.00000891854],"about_ca_topic_score_codex":0.010636401,"about_ca_topic_score_gemma":0.0052412525,"teacher_disagreement_score":0.010636401,"about_ca_system_score_codex":0.0020982549,"about_ca_system_score_gemma":0.001770653,"threshold_uncertainty_score":0.02114898},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36433843,0.0006499752,0.57843286,0.0014705538,0.00010666151,0.00022837296,0.00074961595,0.00016227561,0.0538612],"genre_scores_gemma":[0.9703169,0.00027437156,0.01973964,0.00008295349,0.0000633826,0.00009329105,0.00014120259,0.000019395971,0.009268983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822015,0.0006546933,0.000054762084,0.00040235207,0.00037347258,0.0002945019],"domain_scores_gemma":[0.9985676,0.00058879564,0.00035823663,0.00014623569,0.00015055489,0.00018859605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011946589,0.0012571262,0.0013586016,0.0007350742,0.00073221093,0.0020047973,0.0025712484,0.0019310685,0.0054353196],"category_scores_gemma":[0.0031839558,0.00050005387,0.0013707614,0.001377707,0.0022211887,0.0033461193,0.0014342313,0.0013335071,0.0005846207],"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.00013395313,0.00016047388,0.0009612056,0.00011166434,0.000060074373,0.00053792965,0.00012838583,0.40372613,0.0021411385,0.5852527,0.0011246508,0.005661818],"study_design_scores_gemma":[0.000066683264,0.00016164682,0.0005887654,0.000010656722,0.00002836507,0.00021883247,0.00006609218,0.80777466,0.0005137356,0.18806279,0.0024727022,0.000035125806],"about_ca_topic_score_codex":0.0047349147,"about_ca_topic_score_gemma":0.0032129576,"teacher_disagreement_score":0.0054353196,"about_ca_system_score_codex":0.002187607,"about_ca_system_score_gemma":0.0009701559,"threshold_uncertainty_score":0.018182933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6048268,0.00028106783,0.39110547,0.00041469545,0.000041965657,0.00011899793,0.00029715104,0.00017040058,0.0027434595],"genre_scores_gemma":[0.98162293,0.00008107881,0.017605318,0.000026539059,0.000012945729,0.000043246815,0.00016768005,0.000017063025,0.00042318233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814963,0.0011489731,0.00009243777,0.00019473609,0.00026455682,0.00014971914],"domain_scores_gemma":[0.9832597,0.01303008,0.0014016766,0.0007101709,0.0010164742,0.0005819309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005912131,0.0008041775,0.0007404626,0.00195676,0.00034988695,0.0018135787,0.0010665964,0.0015002227,0.0013690875],"category_scores_gemma":[0.031061493,0.00034607603,0.0008413262,0.0012794032,0.0009854664,0.0031875477,0.0012859735,0.0013492614,0.00023705485],"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.0012488823,0.0004964509,0.09077085,0.00011094836,0.00030144857,0.00021745391,0.0006252864,0.74824905,0.002276506,0.048390564,0.0008816607,0.10643099],"study_design_scores_gemma":[0.000014924593,0.000121464196,0.009871505,0.000024279105,0.000023532406,0.000031882915,0.0000976753,0.9601466,0.00047637292,0.029042223,0.00012278937,0.000026756907],"about_ca_topic_score_codex":0.0065635964,"about_ca_topic_score_gemma":0.004098664,"teacher_disagreement_score":0.0065635964,"about_ca_system_score_codex":0.0010858316,"about_ca_system_score_gemma":0.00086825475,"threshold_uncertainty_score":0.03126669},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18742402,0.0013627642,0.80336994,0.0016896703,0.00042956872,0.00020046711,0.00023192377,0.0002978301,0.004993801],"genre_scores_gemma":[0.90341526,0.0013059956,0.084652826,0.00019718836,0.00042092052,0.00019941936,0.00018517155,0.00015224564,0.009471088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826765,0.0007429089,0.00005783438,0.00027656258,0.0002583367,0.0003966328],"domain_scores_gemma":[0.993075,0.005000187,0.0005911804,0.00021433955,0.00051947124,0.00059971865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037537888,0.0011437475,0.0024055268,0.00089537335,0.0015163227,0.0025500548,0.002807913,0.0019027874,0.004155121],"category_scores_gemma":[0.012186698,0.0010928811,0.0011817709,0.0022763081,0.0015256673,0.0022000242,0.0019457252,0.0022311436,0.0003081929],"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.00021231364,0.00018251858,0.00091710134,0.000116067655,0.000045899233,0.00012903684,0.00018681375,0.9553533,0.001022096,0.021980185,0.0016229429,0.018231688],"study_design_scores_gemma":[0.000020814321,0.00004559461,0.00018426201,0.0000059433155,0.000014277601,0.000013809742,0.00005935083,0.9932706,0.00013539237,0.005975304,0.000263959,0.0000107206315],"about_ca_topic_score_codex":0.01800559,"about_ca_topic_score_gemma":0.012660109,"teacher_disagreement_score":0.01800559,"about_ca_system_score_codex":0.0024454019,"about_ca_system_score_gemma":0.0031152985,"threshold_uncertainty_score":0.03580153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32385647,0.00038548117,0.61058044,0.0026148763,0.0001443693,0.00016166222,0.00036427478,0.00024975202,0.061642725],"genre_scores_gemma":[0.9666903,0.00019759613,0.02399324,0.00021237033,0.000092750044,0.00012590592,0.00021602123,0.0000771623,0.008394582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954625,0.0016571454,0.00027367345,0.0010675738,0.00078167557,0.00075749523],"domain_scores_gemma":[0.9835917,0.007913271,0.00386286,0.0022044266,0.0011491232,0.0012786087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988012,0.0006519091,0.0011000355,0.001016395,0.0018384972,0.0034683757,0.0014714011,0.0013927666,0.011058907],"category_scores_gemma":[0.025143566,0.0005392385,0.0016929335,0.0013206953,0.004990408,0.0055833794,0.0044534146,0.002146412,0.0011313118],"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.000118789554,0.00007480847,0.0021186133,0.000034744673,0.000055652876,0.00026556783,0.00063203083,0.029776573,0.0014640692,0.95400697,0.0014132726,0.010038874],"study_design_scores_gemma":[0.000056398803,0.00007256157,0.0014055399,0.000014435483,0.000019424475,0.00012842388,0.00033124525,0.106324024,0.0005621811,0.8879416,0.0031033873,0.000040757106],"about_ca_topic_score_codex":0.0029820958,"about_ca_topic_score_gemma":0.0017830406,"teacher_disagreement_score":0.011058907,"about_ca_system_score_codex":0.0020049356,"about_ca_system_score_gemma":0.0011504276,"threshold_uncertainty_score":0.03699571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024000825,0.00044243148,0.9889486,0.0006332648,0.000055487308,0.000055707766,0.00007513384,0.00004795285,0.007341402],"genre_scores_gemma":[0.29660493,0.0030505066,0.68108255,0.00088132767,0.00047192117,0.0009443825,0.0003064944,0.0002681836,0.016389685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987155,0.00058349624,0.000049757902,0.00019913224,0.00026809872,0.00018394078],"domain_scores_gemma":[0.99721754,0.0019567432,0.00027008553,0.00015466075,0.00022732443,0.00017360608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025907243,0.001547052,0.0010682559,0.0012479668,0.0007663721,0.0018786248,0.0023249525,0.0016482908,0.013707015],"category_scores_gemma":[0.0055790176,0.00079219707,0.0020174128,0.0013020496,0.0014602497,0.0032585987,0.0025438464,0.0052227313,0.00099426],"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.000036077752,0.00007804642,0.00040106467,0.0002601111,0.00008299873,0.00008107452,0.00015643299,0.29178774,0.00060239993,0.68262494,0.004005909,0.019883176],"study_design_scores_gemma":[0.000018192062,0.000041897267,0.00010777706,0.000055169432,0.000019934678,0.00002949939,0.000058682268,0.6380224,0.00022221686,0.35546786,0.0059411153,0.000015242222],"about_ca_topic_score_codex":0.0030216863,"about_ca_topic_score_gemma":0.0037747533,"teacher_disagreement_score":0.013707015,"about_ca_system_score_codex":0.0021155302,"about_ca_system_score_gemma":0.0021521184,"threshold_uncertainty_score":0.04585451},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24555838,0.0017841678,0.67437553,0.002364142,0.00020829814,0.00017202116,0.00059160567,0.00046032175,0.074485436],"genre_scores_gemma":[0.94834524,0.0008760292,0.029790122,0.00027050488,0.00020379947,0.00025421422,0.00061396346,0.00017309042,0.019473007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873847,0.00048597367,0.00005306045,0.0002234086,0.00024992076,0.0002491699],"domain_scores_gemma":[0.99445516,0.0029014242,0.001139733,0.00040519293,0.00059907115,0.000499456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019463901,0.00094779965,0.0011889633,0.0018900064,0.0021512245,0.0022811107,0.0017872067,0.0018187031,0.008548642],"category_scores_gemma":[0.011975859,0.0006581493,0.0013981389,0.0011090148,0.00255811,0.0033973434,0.0027635677,0.001433455,0.0011933947],"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.000060284034,0.000051752744,0.0023195655,0.00006552787,0.0000911013,0.00030318645,0.00045735735,0.34056213,0.0007080839,0.6468126,0.0026873015,0.0058810697],"study_design_scores_gemma":[0.000028638808,0.00003552216,0.00042060786,0.000020563844,0.000017563341,0.00007743672,0.00014888078,0.7045493,0.00017104804,0.29029182,0.004221993,0.000016527845],"about_ca_topic_score_codex":0.0073103076,"about_ca_topic_score_gemma":0.0037084154,"teacher_disagreement_score":0.008548642,"about_ca_system_score_codex":0.0020087108,"about_ca_system_score_gemma":0.0010776755,"threshold_uncertainty_score":0.02859807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00963515,0.00043217774,0.9741669,0.0008688414,0.00039947382,0.0003670406,0.00023061132,0.0005627519,0.0133369565],"genre_scores_gemma":[0.42060444,0.0009867682,0.56766564,0.0006064953,0.0007085464,0.00036255762,0.0003987887,0.00030199206,0.008364803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838305,0.00061258295,0.00007644062,0.00021602244,0.00054047623,0.0001714999],"domain_scores_gemma":[0.9973175,0.0017407528,0.00015215164,0.00029651867,0.00036093633,0.00013212093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252817,0.00102657,0.0011839849,0.0007501156,0.000882738,0.0027118165,0.0016988728,0.0014554393,0.014532329],"category_scores_gemma":[0.006385131,0.00066995935,0.0009126738,0.0014081944,0.0010670375,0.002385797,0.0012296495,0.001951509,0.00142019],"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.0002649872,0.00030495215,0.000581691,0.00037989172,0.00007084946,0.00023071458,0.00006688269,0.81892806,0.0068503385,0.07991462,0.013007787,0.07939919],"study_design_scores_gemma":[0.000049671347,0.00007494695,0.00017176563,0.000025274785,0.000020858071,0.00008487743,0.000020390524,0.9674192,0.0013694833,0.025731659,0.005008079,0.000023864506],"about_ca_topic_score_codex":0.00362712,"about_ca_topic_score_gemma":0.0038603751,"teacher_disagreement_score":0.014532329,"about_ca_system_score_codex":0.0015278923,"about_ca_system_score_gemma":0.0030373167,"threshold_uncertainty_score":0.048615456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03223761,0.0001378692,0.96341264,0.00035867712,0.00003804105,0.00013311318,0.00006327958,0.00019479031,0.0034239886],"genre_scores_gemma":[0.80446565,0.00029474936,0.19163872,0.0002338068,0.000064897205,0.00022995552,0.000108601744,0.0001017025,0.0028619082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762446,0.0011977538,0.00009370007,0.00031795088,0.0003917877,0.000374385],"domain_scores_gemma":[0.9964653,0.0024657962,0.0002180398,0.0001688233,0.0004233489,0.0002585413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037095414,0.00075426046,0.001363204,0.0010628242,0.0010491722,0.002158537,0.0016622238,0.0020289847,0.0033733712],"category_scores_gemma":[0.010743116,0.0009816797,0.00062088075,0.0011760248,0.0014886354,0.0018639518,0.002128514,0.001155137,0.00044120225],"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.0001438556,0.00006944193,0.00032865722,0.00007913278,0.000029209961,0.000037497037,0.00008683596,0.9248482,0.0035193271,0.056171663,0.000721981,0.013964216],"study_design_scores_gemma":[0.00001815469,0.000024849805,0.000037853613,0.0000055383252,0.0000067413143,0.000005658724,0.000012440049,0.98317873,0.00028355521,0.016209997,0.00021082166,0.0000056371628],"about_ca_topic_score_codex":0.005927781,"about_ca_topic_score_gemma":0.0049770577,"teacher_disagreement_score":0.005927781,"about_ca_system_score_codex":0.0028862692,"about_ca_system_score_gemma":0.0036920235,"threshold_uncertainty_score":0.020941436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04954733,0.00087622146,0.9222995,0.0029806604,0.00043374288,0.00019838416,0.0010205453,0.00049468473,0.022149004],"genre_scores_gemma":[0.8672542,0.001319146,0.06002034,0.0008455692,0.00033689363,0.0006164358,0.00069883047,0.000183059,0.068725444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982693,0.00058870675,0.000061918356,0.00032533682,0.00026181617,0.00049289974],"domain_scores_gemma":[0.99638295,0.0020782913,0.0004049713,0.00013923882,0.00053225824,0.0004623892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026740383,0.0013845388,0.0022833277,0.001427294,0.001558547,0.004097656,0.003607281,0.0040535717,0.010732287],"category_scores_gemma":[0.008326835,0.0011658081,0.0013507471,0.0016810818,0.002941161,0.0034231304,0.0024760163,0.0026388878,0.0013845921],"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.00010778799,0.00007933142,0.00056633167,0.00006288291,0.000034765544,0.00016958594,0.00012425432,0.7393114,0.0007960642,0.25271004,0.0025806653,0.0034569777],"study_design_scores_gemma":[0.000017886334,0.000014985151,0.00006289142,0.000007191381,0.000007661832,0.00001166315,0.000018584255,0.97636867,0.000034848865,0.022850256,0.0005934268,0.0000120601],"about_ca_topic_score_codex":0.023840226,"about_ca_topic_score_gemma":0.012556822,"teacher_disagreement_score":0.023840226,"about_ca_system_score_codex":0.005279476,"about_ca_system_score_gemma":0.0038196885,"threshold_uncertainty_score":0.04740292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20092385,0.0054964195,0.67220354,0.009190359,0.0007417195,0.0005023976,0.0030301716,0.00029458874,0.10761701],"genre_scores_gemma":[0.935125,0.002476419,0.023306573,0.0005188788,0.00034242208,0.00049083884,0.000626517,0.000054242453,0.03705905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961356,0.002483257,0.00010409664,0.00048182046,0.00027116452,0.0005240506],"domain_scores_gemma":[0.9836129,0.013554555,0.0011407153,0.0003217566,0.00046464903,0.0009053729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055132047,0.0013737228,0.0030224249,0.0016262153,0.0013971339,0.0048232446,0.002526144,0.0035301014,0.016675405],"category_scores_gemma":[0.013360666,0.0013147038,0.0014350559,0.0019568764,0.0036063604,0.0043045697,0.002503694,0.004247916,0.0014506496],"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.00015001431,0.00017522032,0.0022658713,0.0001301294,0.000114422386,0.00041636004,0.00026667863,0.26105464,0.00016815843,0.7281466,0.0030508083,0.004061002],"study_design_scores_gemma":[0.00013183295,0.00006799925,0.00057468563,0.000040584273,0.00003242824,0.000066217486,0.00013494563,0.6817108,0.00004745927,0.31406397,0.0030855255,0.000043541484],"about_ca_topic_score_codex":0.018401138,"about_ca_topic_score_gemma":0.015394477,"teacher_disagreement_score":0.018401138,"about_ca_system_score_codex":0.0037981148,"about_ca_system_score_gemma":0.0016595498,"threshold_uncertainty_score":0.05578482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01072089,0.00049907615,0.9857883,0.0004420575,0.000083270956,0.00011192046,0.00013312005,0.00027154494,0.0019497556],"genre_scores_gemma":[0.20030941,0.0009338919,0.790784,0.00020029864,0.00021224622,0.00060764956,0.00071487814,0.00041391456,0.0058238422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986197,0.0006838398,0.00006540101,0.00019203604,0.0002687193,0.0001704083],"domain_scores_gemma":[0.9901008,0.008440965,0.00038373165,0.00026342698,0.0005389836,0.00027202605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048170984,0.001840934,0.0026234328,0.0018310229,0.0012895653,0.0022390892,0.0028614276,0.0034278298,0.0057198834],"category_scores_gemma":[0.012167762,0.0018626464,0.0013814857,0.0032313708,0.0011660934,0.0036888148,0.0016008202,0.004595754,0.0007391889],"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.00007038885,0.00010883735,0.00032511863,0.000057068446,0.000039342824,0.000028680906,0.000032558204,0.9497936,0.00014615417,0.014519282,0.001859162,0.033019945],"study_design_scores_gemma":[0.000012430287,0.000009806681,0.000031388474,0.000004537468,0.0000049969785,0.0000032399232,0.0000037345883,0.9903106,0.00004081713,0.009427901,0.0001484967,0.0000021119129],"about_ca_topic_score_codex":0.014338593,"about_ca_topic_score_gemma":0.015421201,"teacher_disagreement_score":0.014338593,"about_ca_system_score_codex":0.0024883896,"about_ca_system_score_gemma":0.004291049,"threshold_uncertainty_score":0.028510273},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065730065,0.0008993235,0.92672735,0.0017085979,0.00013810761,0.00009684344,0.0007526192,0.0010365489,0.002910531],"genre_scores_gemma":[0.9485369,0.00083952345,0.042829294,0.00037859526,0.00036811043,0.00014240037,0.0012389924,0.00011653666,0.005549671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973781,0.0012284742,0.0001075116,0.0005167664,0.0004418995,0.00032721198],"domain_scores_gemma":[0.9866468,0.00950267,0.0010669414,0.001738115,0.00077211915,0.00027337464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047721844,0.0012788512,0.002079369,0.000868137,0.0005640147,0.002427557,0.0019938792,0.0018465855,0.0035653557],"category_scores_gemma":[0.025545828,0.001036137,0.0009625138,0.001896468,0.0013465745,0.0037054673,0.0021045613,0.0040606274,0.00082148996],"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.00028408354,0.0001873944,0.0073432624,0.00008582618,0.00013060175,0.00018195118,0.00008926792,0.8682928,0.0005490754,0.06847806,0.0045286464,0.049849126],"study_design_scores_gemma":[0.000007934572,0.000013531187,0.00039493176,0.0000035993442,0.0000049653236,0.000013762214,0.0000065604054,0.9761494,0.00005310097,0.023064949,0.00028227258,0.0000050654576],"about_ca_topic_score_codex":0.0076964116,"about_ca_topic_score_gemma":0.005498839,"teacher_disagreement_score":0.0076964116,"about_ca_system_score_codex":0.0011875248,"about_ca_system_score_gemma":0.0015516416,"threshold_uncertainty_score":0.025238037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110882595,0.00042823984,0.98456305,0.00043207177,0.00003709164,0.00006146588,0.000032650383,0.000046480673,0.003310706],"genre_scores_gemma":[0.8258232,0.0021798443,0.16564143,0.00037199925,0.00015812094,0.00046115497,0.00011593932,0.000106762265,0.005141647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994042,0.00027549412,0.00002034316,0.000062866886,0.0001508829,0.00008620307],"domain_scores_gemma":[0.9951324,0.0040905047,0.00026147277,0.00009290649,0.00033972666,0.00008294951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031234806,0.0010955308,0.0009479477,0.00084989646,0.0003763843,0.000979913,0.0010293087,0.0012735509,0.0042512165],"category_scores_gemma":[0.007419416,0.0006905056,0.0013012207,0.00067471596,0.0014251474,0.0019858642,0.0010717558,0.0016823411,0.00017293394],"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.00004656011,0.000059797476,0.00036532435,0.00013425172,0.000046053843,0.00005293208,0.000075785625,0.8395661,0.0010705083,0.1493604,0.00079189596,0.008430408],"study_design_scores_gemma":[0.0000051379598,0.000026825595,0.000053166732,0.000009316739,0.0000056011622,0.000005708291,0.000007908311,0.9837977,0.0001371632,0.015725449,0.00022241587,0.0000036150268],"about_ca_topic_score_codex":0.0041974937,"about_ca_topic_score_gemma":0.0021660444,"teacher_disagreement_score":0.0042512165,"about_ca_system_score_codex":0.0011110499,"about_ca_system_score_gemma":0.0017279456,"threshold_uncertainty_score":0.016518712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015944088,0.0016637865,0.9616278,0.0016522579,0.00024890134,0.0001312991,0.00062678166,0.00034368553,0.017761443],"genre_scores_gemma":[0.39221868,0.0022591164,0.58257467,0.0018280579,0.0008069367,0.0006208678,0.0024661594,0.0003776201,0.016847892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978155,0.00093535736,0.00012913674,0.00036669697,0.0004763253,0.00027695374],"domain_scores_gemma":[0.9957639,0.0027199583,0.00032164622,0.00034933016,0.00067340996,0.00017174188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003091565,0.0010796763,0.0014275693,0.0009772065,0.0006884148,0.0019149538,0.0012719599,0.0016558392,0.008100512],"category_scores_gemma":[0.010376903,0.00063290645,0.0012456172,0.0013175568,0.0011072329,0.0025669704,0.001864477,0.0027829567,0.0017988228],"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.00018689616,0.00016193383,0.0012894704,0.00040763168,0.00008452582,0.0001750568,0.00013538208,0.3926856,0.0013208872,0.3819152,0.030867137,0.19077025],"study_design_scores_gemma":[0.000036591136,0.00005557862,0.00020052037,0.0000716816,0.000017412469,0.000047811347,0.00002902334,0.73781836,0.0003559451,0.25405744,0.00729985,0.000009811407],"about_ca_topic_score_codex":0.00096882985,"about_ca_topic_score_gemma":0.0017991731,"teacher_disagreement_score":0.008100512,"about_ca_system_score_codex":0.000978133,"about_ca_system_score_gemma":0.0017093981,"threshold_uncertainty_score":0.027098894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7962573,0.008550593,0.04256292,0.04790987,0.00041875237,0.00017691414,0.00033611874,0.00005187,0.10373561],"genre_scores_gemma":[0.99502987,0.0011520705,0.0014962772,0.00057696935,0.00010563507,0.000030479498,0.00002152042,0.0000032481682,0.001583866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99329454,0.004901615,0.0002497213,0.00028537842,0.00045231776,0.00081641244],"domain_scores_gemma":[0.9621145,0.027016452,0.0076690866,0.0011260379,0.00090062886,0.001173308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047408445,0.0005531581,0.0005054869,0.00074190524,0.0012261127,0.0022909062,0.0008556813,0.0021809214,0.008967689],"category_scores_gemma":[0.026823001,0.00029502405,0.0005116496,0.00067115953,0.0040401975,0.002497766,0.0020234308,0.001933039,0.00018557011],"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.0011344819,0.0013678585,0.06208144,0.0005829062,0.00051529397,0.0014150382,0.0029301492,0.034875493,0.0017473808,0.79412097,0.006423711,0.09280527],"study_design_scores_gemma":[0.00026715721,0.0011023111,0.04498317,0.0005896424,0.00021239488,0.001046871,0.0066990284,0.051360797,0.0011197437,0.8771148,0.0153852925,0.00011892613],"about_ca_topic_score_codex":0.010797868,"about_ca_topic_score_gemma":0.007027271,"teacher_disagreement_score":0.010797868,"about_ca_system_score_codex":0.0025406494,"about_ca_system_score_gemma":0.0024124954,"threshold_uncertainty_score":0.029999912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4170808,0.0034191625,0.5087447,0.0045022145,0.00026402425,0.00028015906,0.0007414381,0.00018771931,0.06477979],"genre_scores_gemma":[0.96037316,0.0013555188,0.023055283,0.00019503728,0.00017039641,0.00008223237,0.00019014187,0.000060115228,0.01451813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988167,0.00046371625,0.00006877989,0.00024171143,0.00014913936,0.00025990105],"domain_scores_gemma":[0.99435246,0.0040694596,0.00066104456,0.00024234543,0.00022416581,0.00045050483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025465616,0.000734666,0.0018127743,0.0005407448,0.00078195485,0.0025614726,0.0016634134,0.002877136,0.0068058423],"category_scores_gemma":[0.008097249,0.0010190712,0.0010138042,0.00071403076,0.0017466141,0.0036927145,0.0015032594,0.0023854147,0.00047765076],"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.00026778286,0.00023949968,0.0019995172,0.0002579507,0.00008278037,0.0011039134,0.000223481,0.59744173,0.0020884636,0.370744,0.0032192266,0.022331636],"study_design_scores_gemma":[0.00009501128,0.000087311484,0.0009394187,0.000045791006,0.000027654078,0.00028059754,0.00011029598,0.7720476,0.00065895607,0.2231597,0.0025096561,0.000038023092],"about_ca_topic_score_codex":0.0055151735,"about_ca_topic_score_gemma":0.0027337228,"teacher_disagreement_score":0.0068058423,"about_ca_system_score_codex":0.0024088945,"about_ca_system_score_gemma":0.0014920961,"threshold_uncertainty_score":0.022767782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01384605,0.00017234654,0.98368454,0.00038360714,0.000021289252,0.000035634024,0.000098572964,0.00019805132,0.0015598286],"genre_scores_gemma":[0.8538731,0.00045638948,0.13723184,0.0003201631,0.00008858667,0.00024379684,0.00043696762,0.000228682,0.007120512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759585,0.0010018034,0.00010792075,0.00057916273,0.00048615938,0.00022911737],"domain_scores_gemma":[0.9951845,0.0026371647,0.001023628,0.0005227164,0.00042866782,0.00020343621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051212865,0.0015179666,0.0020506887,0.0009022381,0.00041345894,0.0025593792,0.0022351258,0.0020123406,0.0028416463],"category_scores_gemma":[0.013688113,0.0012738027,0.0014891479,0.0009706185,0.002005871,0.003660488,0.003154747,0.0025927026,0.00047773065],"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.000055409742,0.000027272758,0.00044912295,0.00002975658,0.000045105317,0.0000707245,0.000035832138,0.93655545,0.00069649407,0.050317794,0.00051845773,0.011198617],"study_design_scores_gemma":[0.0000066732487,0.000018095727,0.00005544997,0.0000044224107,0.000005530977,0.000008414035,0.0000025592387,0.98161685,0.00022977851,0.01784122,0.00020329795,0.000007750485],"about_ca_topic_score_codex":0.002781343,"about_ca_topic_score_gemma":0.0017604798,"teacher_disagreement_score":0.0051212865,"about_ca_system_score_codex":0.0018470918,"about_ca_system_score_gemma":0.0019016023,"threshold_uncertainty_score":0.027084291},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046941973,0.00031922577,0.99057966,0.00022293183,0.00006235733,0.00008177758,0.00012752863,0.00058953546,0.0033227392],"genre_scores_gemma":[0.66595364,0.0011354799,0.31950265,0.00027302632,0.0003629859,0.0006309503,0.0005999495,0.00031341755,0.011227816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957949,0.001050005,0.00018902666,0.00089210167,0.0017072113,0.00036677794],"domain_scores_gemma":[0.9939666,0.0023024944,0.0010396348,0.00050106115,0.0018956473,0.00029456345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052142977,0.0014617529,0.0017606542,0.0015222353,0.001087229,0.00283014,0.0019530198,0.0016283233,0.0064233746],"category_scores_gemma":[0.013888612,0.0005160253,0.00084998156,0.0014993773,0.0017201287,0.0023693542,0.0017109824,0.0021376824,0.0011433843],"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.00032470873,0.0000928885,0.0010316698,0.0001212928,0.00006199196,0.00016651425,0.000119006574,0.6929357,0.004293388,0.17245595,0.0047200667,0.12367687],"study_design_scores_gemma":[0.000024599854,0.000057056954,0.0002198214,0.000014322336,0.0000158906,0.000033360884,0.0000059841186,0.97616833,0.0013728911,0.019467438,0.0025955432,0.000024700726],"about_ca_topic_score_codex":0.009299138,"about_ca_topic_score_gemma":0.0040563005,"teacher_disagreement_score":0.009299138,"about_ca_system_score_codex":0.0021383527,"about_ca_system_score_gemma":0.0032655492,"threshold_uncertainty_score":0.027576208},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030499501,0.0031121615,0.92685217,0.0020883088,0.00032942276,0.00007080774,0.00029067908,0.000135876,0.036621142],"genre_scores_gemma":[0.7505456,0.0046784985,0.21632843,0.0015176653,0.0009431135,0.00023675832,0.00064892444,0.00023997719,0.02486103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936255,0.0021294605,0.00040754257,0.0014246993,0.0019638587,0.00044879218],"domain_scores_gemma":[0.98758197,0.005251311,0.0016979981,0.0014717459,0.0029734238,0.0010235128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059950766,0.0013509137,0.0011303374,0.002371339,0.0009962494,0.0046579586,0.0014962322,0.0017949586,0.00569877],"category_scores_gemma":[0.022487598,0.0006038864,0.001423111,0.0017612275,0.004905715,0.008012043,0.0035622127,0.0036153416,0.001429591],"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.000015483642,0.0000069460366,0.00023181482,0.00003300535,0.000016304557,0.000030760522,0.000099660385,0.0033444269,0.00032093393,0.98961455,0.00086642656,0.0054196534],"study_design_scores_gemma":[0.0000078470175,0.000047134356,0.00025795828,0.000038600065,0.000010876585,0.000116301286,0.000071667135,0.029698046,0.0004732321,0.9601216,0.009134071,0.000022627693],"about_ca_topic_score_codex":0.0007113198,"about_ca_topic_score_gemma":0.00038297474,"teacher_disagreement_score":0.0059950766,"about_ca_system_score_codex":0.0020648795,"about_ca_system_score_gemma":0.0009120782,"threshold_uncertainty_score":0.03170538},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012132482,0.0004904461,0.9905155,0.003232647,0.0004745979,0.00009538273,0.00014097246,0.00077228853,0.003064908],"genre_scores_gemma":[0.095082946,0.0013534485,0.881825,0.0061600143,0.0018805831,0.0006813525,0.0011293278,0.0018567364,0.010030599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98496175,0.0060364585,0.000848476,0.0027068628,0.0048367535,0.00060976646],"domain_scores_gemma":[0.9682786,0.018817836,0.0013237441,0.005255184,0.005321754,0.0010028633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0150641855,0.0025789177,0.0021553463,0.0015908744,0.001475513,0.0052824966,0.0037939043,0.0028729718,0.0112218615],"category_scores_gemma":[0.057654843,0.0016484617,0.0030427447,0.0020474575,0.0030165652,0.0068885256,0.0065431166,0.012131114,0.0053576496],"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.0004989358,0.00045793244,0.003177725,0.00054737524,0.00039405175,0.00041858733,0.0003357798,0.32947582,0.006986746,0.32482752,0.07029519,0.26258427],"study_design_scores_gemma":[0.000052175234,0.00013821536,0.00027101932,0.00009377625,0.000037816906,0.00017461713,0.00005369589,0.7962546,0.0034904685,0.17888646,0.020477641,0.0000696142],"about_ca_topic_score_codex":0.0037037986,"about_ca_topic_score_gemma":0.0038120833,"teacher_disagreement_score":0.0150641855,"about_ca_system_score_codex":0.002453484,"about_ca_system_score_gemma":0.0051816516,"threshold_uncertainty_score":0.079667926},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03299172,0.6408125,0.0037370096,0.084145494,0.041190002,0.00011481625,0.08027045,0.0013985222,0.11533951],"genre_scores_gemma":[0.16667266,0.6492462,0.011257893,0.020135766,0.03258336,0.00020440866,0.07108033,0.0009801295,0.04783916],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99775034,0.00021000791,0.0003947255,0.0002476363,0.0011243032,0.00027288563],"domain_scores_gemma":[0.98216885,0.0059483405,0.00407285,0.00043004326,0.006388077,0.0009917953],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002460198,0.0011325527,0.0006213647,0.03305075,0.00082707097,0.006601009,0.000551494,0.0011572642,0.022321789],"category_scores_gemma":[0.014155613,0.000309654,0.00094749266,0.054946788,0.0008772112,0.005513508,0.0014947754,0.0014641184,0.008841507],"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.00019842827,0.000046459085,0.015584096,0.0033222307,0.00011858528,0.000099396486,0.00044366185,0.0004518001,0.00051220023,0.00948363,0.74095005,0.22878952],"study_design_scores_gemma":[0.000012122659,0.00007007582,0.037689775,0.0036164839,0.000095810785,0.00032747278,0.0011724824,0.0003065752,0.00063351984,0.0037889674,0.952229,0.000057685138],"about_ca_topic_score_codex":0.00726088,"about_ca_topic_score_gemma":0.014248541,"teacher_disagreement_score":0.9975398,"about_ca_system_score_codex":0.0027909055,"about_ca_system_score_gemma":0.0029772683,"threshold_uncertainty_score":0.07467383},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07687218,0.00026315675,0.9075569,0.0002990871,0.000058812202,0.00012008506,0.000223059,0.00013867996,0.014467966],"genre_scores_gemma":[0.88687617,0.00029547905,0.10534427,0.00007785894,0.0000445911,0.00016540985,0.00015987793,0.000053990643,0.0069823693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987382,0.00042495027,0.000041068022,0.00035787336,0.00018394778,0.0002539053],"domain_scores_gemma":[0.9987336,0.00060454325,0.00019717336,0.00024387326,0.000118035176,0.00010284397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011422554,0.0010113737,0.0012753474,0.00063204323,0.0005381646,0.0018881498,0.001978045,0.0014063128,0.004901999],"category_scores_gemma":[0.0032700128,0.00073196884,0.0010165336,0.0015502224,0.0010424401,0.0025911864,0.0017267113,0.0014889005,0.0003964599],"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.000052926127,0.000039458046,0.00033973547,0.000059665446,0.00003192309,0.00013883723,0.000022258722,0.91897714,0.0009033704,0.06727109,0.0009903414,0.011173197],"study_design_scores_gemma":[0.00001870761,0.000044553683,0.0002915707,0.000009568918,0.000017347907,0.00005275921,0.000033137192,0.9671053,0.00057308323,0.030220864,0.0016212683,0.000011713221],"about_ca_topic_score_codex":0.0028638968,"about_ca_topic_score_gemma":0.0026180209,"teacher_disagreement_score":0.004901999,"about_ca_system_score_codex":0.0016199766,"about_ca_system_score_gemma":0.0008469481,"threshold_uncertainty_score":0.016398847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047068577,0.0027975016,0.93863255,0.0008835464,0.00011197804,0.00010925834,0.00006305166,0.000086106396,0.010247441],"genre_scores_gemma":[0.9056084,0.0015880306,0.08752968,0.00015414995,0.00013446558,0.0001249414,0.000052319596,0.00005185603,0.004756109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847585,0.00069503806,0.000083887295,0.00024734245,0.00035919814,0.00013861191],"domain_scores_gemma":[0.9962174,0.002541826,0.00040958216,0.0003253441,0.0002937709,0.00021200487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039609643,0.0017070392,0.0015207967,0.0009333347,0.00048985664,0.0027113343,0.0011556608,0.0022606011,0.004787548],"category_scores_gemma":[0.008484862,0.0009802328,0.0013448616,0.00068126916,0.002077727,0.0034313758,0.0024141439,0.002173552,0.00020203734],"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.00034382383,0.0003614965,0.0017397322,0.0002976578,0.00023164242,0.00021779787,0.00022606645,0.5847145,0.0049072695,0.33998764,0.0020639251,0.064908504],"study_design_scores_gemma":[0.000067237794,0.00033968745,0.0005055879,0.000062883126,0.00008844733,0.000091661226,0.000056753965,0.7747767,0.0015294313,0.22022963,0.0022040347,0.000047928377],"about_ca_topic_score_codex":0.0006650206,"about_ca_topic_score_gemma":0.0005583663,"teacher_disagreement_score":0.004787548,"about_ca_system_score_codex":0.0014953855,"about_ca_system_score_gemma":0.0010006011,"threshold_uncertainty_score":0.020947874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92469436,0.0051444243,0.031881697,0.025212392,0.0006342388,0.00029488403,0.0012201844,0.00012921632,0.010788694],"genre_scores_gemma":[0.9911849,0.0010879127,0.0046993326,0.0011518577,0.0001582103,0.000053309202,0.00022535078,0.000012427896,0.0014266296],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974687,0.0012594503,0.00005339003,0.0002982996,0.0002837115,0.00063640333],"domain_scores_gemma":[0.9826234,0.01296199,0.0020875277,0.00037219527,0.00084975915,0.0011051097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047710296,0.00078813895,0.00080304645,0.0011314922,0.0010000565,0.0022135423,0.0013806551,0.001577673,0.0035368118],"category_scores_gemma":[0.02130177,0.00034858217,0.0011551518,0.0016262664,0.0017662386,0.0015780667,0.0011970213,0.0024381739,0.00016160958],"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.002373263,0.0021271317,0.62776077,0.00058146886,0.0016993213,0.0011612847,0.0034985426,0.17650002,0.0019974017,0.073936425,0.044838607,0.063525744],"study_design_scores_gemma":[0.0006924539,0.001403899,0.22866346,0.0002213532,0.0013357635,0.00056062127,0.009332467,0.68573606,0.0011934199,0.05946747,0.011137145,0.0002559033],"about_ca_topic_score_codex":0.29392615,"about_ca_topic_score_gemma":0.29915443,"teacher_disagreement_score":0.29392615,"about_ca_system_score_codex":0.009322349,"about_ca_system_score_gemma":0.010911299,"threshold_uncertainty_score":0.5844306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074559525,0.0011588343,0.916756,0.0016992219,0.00010386787,0.00023714881,0.0003555267,0.00033496172,0.004794905],"genre_scores_gemma":[0.8023592,0.0017866449,0.177527,0.0004251674,0.00025871166,0.00043943117,0.0006901655,0.00012559131,0.016388012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578494,0.0020333496,0.00018228088,0.00074720546,0.0006846791,0.000567417],"domain_scores_gemma":[0.98871636,0.009023539,0.0007492589,0.00051575754,0.0005912252,0.00040384478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054899254,0.0016472507,0.0042089256,0.0010773117,0.0009093553,0.0021729893,0.0033748092,0.0023705144,0.006637078],"category_scores_gemma":[0.014010529,0.0018075617,0.0022963656,0.0029675798,0.0013794742,0.004350948,0.0014492928,0.0032916022,0.00085549336],"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.0002774466,0.0002352006,0.0016619094,0.00010495934,0.00012821853,0.00016002786,0.00008693423,0.9431117,0.00035967559,0.026779788,0.001816158,0.0252779],"study_design_scores_gemma":[0.000020104391,0.00003000907,0.00014775984,0.0000040352993,0.000010640239,0.000015693344,0.0000084985395,0.9901112,0.00006318649,0.009384062,0.00019669592,0.00000814615],"about_ca_topic_score_codex":0.020759474,"about_ca_topic_score_gemma":0.014111199,"teacher_disagreement_score":0.020759474,"about_ca_system_score_codex":0.003163945,"about_ca_system_score_gemma":0.0019830689,"threshold_uncertainty_score":0.04127723},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006334383,0.8876783,0.086739145,0.0033233531,0.0011866711,0.00003331391,0.00011406343,0.00009104481,0.020200666],"genre_scores_gemma":[0.018485513,0.9397588,0.032015134,0.0012955151,0.0029608137,0.00007038815,0.00018019178,0.00007074604,0.005163007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870074,0.00037711958,0.00012487257,0.0001961657,0.000533346,0.00006766794],"domain_scores_gemma":[0.9984926,0.0009461117,0.00009820901,0.000079650046,0.00033936035,0.000044049604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013933112,0.001419176,0.0019151671,0.0027415976,0.00065925234,0.0028346516,0.0013971493,0.0025245936,0.007613298],"category_scores_gemma":[0.0031563954,0.00083107944,0.0013984498,0.0046040835,0.0021598542,0.0028390505,0.0015894853,0.0028963513,0.0029193328],"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.00004867603,0.00010489825,0.0007118623,0.00859701,0.00015996431,0.0002164612,0.00016203214,0.0369969,0.00150225,0.28475302,0.063311085,0.60343575],"study_design_scores_gemma":[0.000016899705,0.00009130729,0.0011037298,0.003178989,0.000076631426,0.0010426476,0.00014739319,0.024399411,0.0008238913,0.2725263,0.69649,0.000102853664],"about_ca_topic_score_codex":0.0027586347,"about_ca_topic_score_gemma":0.001910297,"teacher_disagreement_score":0.007613298,"about_ca_system_score_codex":0.0015346257,"about_ca_system_score_gemma":0.0019198158,"threshold_uncertainty_score":0.025469005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032091755,0.00041652043,0.9621274,0.0014334233,0.00006366566,0.00005197583,0.0001998102,0.00019687346,0.003418555],"genre_scores_gemma":[0.9229555,0.00074807275,0.06738313,0.00049687416,0.0002160173,0.00014468124,0.00031623055,0.00012587878,0.007613613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947221,0.0025882956,0.00019262012,0.00096577586,0.0008458411,0.00068535964],"domain_scores_gemma":[0.9819758,0.01413112,0.0010270245,0.0019009925,0.0005985116,0.00036654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074178753,0.00096010504,0.0021380985,0.00080488273,0.00088568125,0.0033203268,0.0029747302,0.002446095,0.0029900088],"category_scores_gemma":[0.028238006,0.0010714072,0.0014459505,0.0017070246,0.0029832134,0.0062245685,0.0029033194,0.004323485,0.0005151964],"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.00024963563,0.00010553919,0.0017663883,0.000119028016,0.0000750381,0.00025869723,0.00018872424,0.63175297,0.0008955924,0.33765525,0.0023459767,0.02458725],"study_design_scores_gemma":[0.000017298184,0.000018845836,0.00013246627,0.00000696278,0.0000077349205,0.00005009837,0.00001746469,0.8838484,0.00020687477,0.11515727,0.0005248207,0.000011839288],"about_ca_topic_score_codex":0.0028217537,"about_ca_topic_score_gemma":0.0017265577,"teacher_disagreement_score":0.0074178753,"about_ca_system_score_codex":0.0028726112,"about_ca_system_score_gemma":0.0019338349,"threshold_uncertainty_score":0.03922993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030909471,0.00078571256,0.951404,0.0011893626,0.00013010374,0.00016457292,0.00029203497,0.0006222057,0.0145026045],"genre_scores_gemma":[0.8048969,0.0007901447,0.17691918,0.00048600035,0.000113168804,0.00040262804,0.0004884775,0.0002621575,0.015641442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992805,0.00025270425,0.00002826454,0.00010501731,0.00013773126,0.00019579404],"domain_scores_gemma":[0.9954894,0.0034290098,0.0003798284,0.00016174572,0.00027696422,0.0002630307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019684546,0.0014322979,0.0017975647,0.0008113609,0.0007841666,0.0022026522,0.0017645395,0.0015998282,0.006746197],"category_scores_gemma":[0.0069255996,0.0011165326,0.0006901569,0.0008205394,0.0016307941,0.002094552,0.0021119246,0.0022459135,0.00087392045],"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.000057970396,0.000053257136,0.00018575808,0.00008299047,0.000018111119,0.000043918262,0.000047581212,0.96899945,0.00023852216,0.02072049,0.0024014753,0.0071504368],"study_design_scores_gemma":[0.000023433906,0.000014315027,0.00003580175,0.0000080270165,0.0000027848935,0.000007116149,0.000014047484,0.9884693,0.00005373711,0.011056571,0.00031152795,0.0000034160137],"about_ca_topic_score_codex":0.008978608,"about_ca_topic_score_gemma":0.007952554,"teacher_disagreement_score":0.008978608,"about_ca_system_score_codex":0.0027978586,"about_ca_system_score_gemma":0.0031548368,"threshold_uncertainty_score":0.022568285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031562503,0.002706834,0.9143804,0.0070211506,0.00032967087,0.00018079659,0.00028396133,0.0002222975,0.043312456],"genre_scores_gemma":[0.8640098,0.0055251545,0.10601159,0.0012326187,0.0012373079,0.0003207795,0.00034029767,0.0001339306,0.021188583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686974,0.0014181304,0.00010243299,0.00046182913,0.0007909956,0.0003568586],"domain_scores_gemma":[0.99078333,0.007168156,0.00054418214,0.00063195836,0.0005841976,0.00028817283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004077222,0.0010602782,0.002337402,0.0009961264,0.0008916023,0.0031199255,0.0028509437,0.002042861,0.008589976],"category_scores_gemma":[0.019550323,0.00082439923,0.0018709841,0.0019499005,0.0032619627,0.006195021,0.0025498217,0.0036858455,0.000879305],"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.000096043834,0.0001700275,0.0012044201,0.0002654297,0.00008016616,0.00046777728,0.00020843474,0.10625864,0.0010412285,0.8616905,0.008899722,0.019617692],"study_design_scores_gemma":[0.000042716634,0.00005133677,0.00043055674,0.000040939238,0.00002637897,0.0002928369,0.0000788773,0.49073732,0.000411544,0.5037333,0.0041204807,0.00003369067],"about_ca_topic_score_codex":0.0035096454,"about_ca_topic_score_gemma":0.002139672,"teacher_disagreement_score":0.008589976,"about_ca_system_score_codex":0.0028682756,"about_ca_system_score_gemma":0.0022391148,"threshold_uncertainty_score":0.028736353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008108772,0.00019185802,0.98734075,0.00015319481,0.000043969394,0.00007573885,0.000055191274,0.0004469656,0.003583517],"genre_scores_gemma":[0.20051038,0.00024874468,0.793543,0.00017971358,0.000050175193,0.00035576045,0.00030366099,0.0005121973,0.0042963275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987676,0.000507836,0.000051732964,0.00017442666,0.00029856813,0.00019974825],"domain_scores_gemma":[0.99480915,0.0042135823,0.00020947373,0.00023301144,0.0003361171,0.00019867273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028597098,0.0026625332,0.002172275,0.0018246224,0.0011201244,0.0024132438,0.0024314749,0.0021435726,0.0064927526],"category_scores_gemma":[0.0130458595,0.0012065868,0.0011451244,0.0012352107,0.0019709817,0.0028968882,0.0025794106,0.0031961834,0.0014454514],"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.00021663806,0.000120114484,0.00085205614,0.00012822215,0.00006457372,0.00008276419,0.00015774259,0.8840891,0.0008446819,0.0540196,0.0031982958,0.05622615],"study_design_scores_gemma":[0.000017952798,0.000013670942,0.00002555106,0.000012767608,0.0000051477286,0.000007887635,0.000015103231,0.9802051,0.0002164888,0.01898586,0.0004901125,0.0000042510646],"about_ca_topic_score_codex":0.0102840485,"about_ca_topic_score_gemma":0.009293043,"teacher_disagreement_score":0.0102840485,"about_ca_system_score_codex":0.001839842,"about_ca_system_score_gemma":0.002951646,"threshold_uncertainty_score":0.021720469},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033528146,0.00031303134,0.98555803,0.00049809675,0.00008612599,0.00006429927,0.00012434345,0.00006825887,0.009935036],"genre_scores_gemma":[0.54989374,0.0025326982,0.41616404,0.0008159958,0.0009224825,0.00040178664,0.00095857936,0.0003743617,0.027936392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897397,0.000298756,0.00005792014,0.00017875982,0.00034822084,0.00014246594],"domain_scores_gemma":[0.99834585,0.00088453124,0.0001524085,0.00019771073,0.00031083386,0.000108615226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016393086,0.0014579208,0.00089152256,0.0012267085,0.0010022159,0.0021823705,0.0018787384,0.0012380807,0.011676423],"category_scores_gemma":[0.0038686062,0.00094940886,0.0023725384,0.001802661,0.0012144981,0.00363791,0.0022829464,0.0043611913,0.0013758241],"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.00008672113,0.00016119386,0.00082509103,0.0002475051,0.00011185652,0.0003327875,0.00013499899,0.6650301,0.0042810873,0.27364066,0.007677653,0.047470454],"study_design_scores_gemma":[0.000008151437,0.0000344976,0.0001754046,0.000019660529,0.000013385417,0.00007508858,0.000022806003,0.90803325,0.0008580846,0.08513586,0.0056045786,0.000019156509],"about_ca_topic_score_codex":0.0048486823,"about_ca_topic_score_gemma":0.0037546235,"teacher_disagreement_score":0.011676423,"about_ca_system_score_codex":0.0018651285,"about_ca_system_score_gemma":0.002042688,"threshold_uncertainty_score":0.039061546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018353395,0.00034848804,0.9699886,0.00093169877,0.00009142315,0.00010159131,0.000117261196,0.000058794067,0.0100087365],"genre_scores_gemma":[0.6915923,0.001281119,0.28660083,0.0005721721,0.00045403218,0.0005721729,0.00039378216,0.00016060688,0.018372985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851817,0.0008109719,0.000060126033,0.00025952348,0.00024354877,0.00010771768],"domain_scores_gemma":[0.99465936,0.0033478346,0.0005783105,0.0004307766,0.0005925119,0.00039121826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004200498,0.001278984,0.0013496798,0.0011885512,0.0012790187,0.0019252716,0.0029750282,0.002461467,0.006473587],"category_scores_gemma":[0.0111668315,0.00076908444,0.0016179534,0.00097494863,0.0024921494,0.0048694545,0.0021480436,0.0033048496,0.00066105515],"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.000040392177,0.00005008823,0.00055806653,0.0001031111,0.00004644737,0.00015955667,0.00017914495,0.2054356,0.001302209,0.78418726,0.0020596974,0.0058783954],"study_design_scores_gemma":[0.000016650782,0.00005386741,0.00012017043,0.00001984383,0.000010889025,0.000092627015,0.000051351395,0.67054176,0.00033015257,0.325743,0.002996005,0.00002370506],"about_ca_topic_score_codex":0.0023768842,"about_ca_topic_score_gemma":0.001526622,"teacher_disagreement_score":0.006473587,"about_ca_system_score_codex":0.0016133523,"about_ca_system_score_gemma":0.0017017283,"threshold_uncertainty_score":0.022214651},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2758676,0.0019035593,0.7096536,0.0026867678,0.00013846548,0.0002172567,0.00029455443,0.0005409473,0.00869732],"genre_scores_gemma":[0.9264994,0.0005903625,0.06986321,0.00030146845,0.0000902527,0.000103197126,0.00043883797,0.00004662811,0.0020666409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978885,0.0012012038,0.000089633555,0.00022724409,0.00042162117,0.00017191099],"domain_scores_gemma":[0.9938414,0.0035246848,0.00065682345,0.0006129483,0.0010800742,0.000284126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066780536,0.00071274996,0.0010738586,0.0009012698,0.00019267837,0.0016697804,0.0006477096,0.0008178712,0.0016662794],"category_scores_gemma":[0.021633001,0.00033151053,0.00043758252,0.00084572117,0.00046801634,0.0016888357,0.0008292347,0.0009009046,0.00048770162],"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.00027136976,0.00019574878,0.034512166,0.00013670448,0.00039082073,0.0002190971,0.000132565,0.635318,0.0026761391,0.040696904,0.0058223284,0.27962822],"study_design_scores_gemma":[0.00006971943,0.0002957961,0.006309237,0.00004429376,0.000045259087,0.0001096417,0.000049874383,0.9189294,0.0013253374,0.070219375,0.0025721537,0.000029814606],"about_ca_topic_score_codex":0.00058776955,"about_ca_topic_score_gemma":0.00046174912,"teacher_disagreement_score":0.0066780536,"about_ca_system_score_codex":0.0005183361,"about_ca_system_score_gemma":0.0007935839,"threshold_uncertainty_score":0.03531736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028709836,0.00030741855,0.96788377,0.00034914791,0.000028987672,0.00006506844,0.0001345109,0.00023307903,0.002288229],"genre_scores_gemma":[0.8280324,0.00042834628,0.16704482,0.0003124049,0.00008396677,0.00024872104,0.0005869528,0.00007256496,0.0031899035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973705,0.0011971543,0.00010006591,0.00067193026,0.00045212047,0.00020810467],"domain_scores_gemma":[0.98830265,0.00892207,0.000838941,0.00094025064,0.00080898404,0.00018701746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045280405,0.0011040322,0.0016962668,0.0008468686,0.00036757294,0.0014106225,0.0020769532,0.0015227123,0.0024981224],"category_scores_gemma":[0.02380436,0.0007411477,0.0011116877,0.0011281917,0.0013031381,0.0023556275,0.0016292554,0.0026640592,0.00054802746],"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.00027940117,0.00011723733,0.0019308772,0.000104269166,0.00014058099,0.00006710688,0.00009419574,0.8765654,0.0010706212,0.024597226,0.0019046783,0.093128465],"study_design_scores_gemma":[0.000016773487,0.000030283518,0.00023854953,0.0000059861404,0.000007322925,0.000011861775,0.0000084594285,0.98304445,0.00034714595,0.016053153,0.00022721349,0.000008785447],"about_ca_topic_score_codex":0.0041808262,"about_ca_topic_score_gemma":0.0025959935,"teacher_disagreement_score":0.0045280405,"about_ca_system_score_codex":0.0016127464,"about_ca_system_score_gemma":0.0010528859,"threshold_uncertainty_score":0.023946881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002434457,0.0001825667,0.9954733,0.00021853684,0.000044257173,0.00002739408,0.000019719084,0.00006721693,0.0015325175],"genre_scores_gemma":[0.28532907,0.0010317875,0.7019763,0.0003177976,0.00025654517,0.00055569265,0.00015394413,0.0001330022,0.010245927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836665,0.0008027446,0.00007369191,0.00021808033,0.0004051289,0.00013371918],"domain_scores_gemma":[0.9971433,0.0019075674,0.00018955432,0.00023960265,0.00040728797,0.000112592366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034113082,0.0013062299,0.0013681888,0.0011626014,0.00065662124,0.0017438551,0.0017122021,0.0016311582,0.00438986],"category_scores_gemma":[0.008998771,0.0006735611,0.0009747387,0.0015752211,0.0018877111,0.0031824308,0.0017576655,0.0035400838,0.0007330893],"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.000096777476,0.000092422364,0.0004126088,0.00009418916,0.00008264201,0.000041557712,0.00008368287,0.5438125,0.00092873554,0.34177762,0.0023553334,0.110221945],"study_design_scores_gemma":[0.000018062685,0.000018948911,0.00003861768,0.000013467041,0.000007502595,0.000009384043,0.0000051999746,0.92161053,0.00024434953,0.07702385,0.0010016315,0.000008368489],"about_ca_topic_score_codex":0.0039414437,"about_ca_topic_score_gemma":0.003369156,"teacher_disagreement_score":0.00438986,"about_ca_system_score_codex":0.0015846322,"about_ca_system_score_gemma":0.00204176,"threshold_uncertainty_score":0.018040955},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016163334,0.007945746,0.0065460633,0.03268883,0.083410785,0.00044292604,0.0061315,0.0020896222,0.8591282],"genre_scores_gemma":[0.0057161176,0.003869054,0.0021461973,0.004591011,0.005878545,0.00015594176,0.0037771433,0.0005667031,0.9732992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984267,0.00018749085,0.000086452106,0.00031597787,0.00076619245,0.00021729789],"domain_scores_gemma":[0.99408275,0.00044840324,0.00012458867,0.0005181124,0.0036980766,0.0011281196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001476068,0.00088775414,0.000769135,0.0021226814,0.0021193933,0.004788054,0.0018377062,0.0021931317,0.5248372],"category_scores_gemma":[0.008136242,0.0003220236,0.0006329438,0.00202847,0.0005028769,0.003632718,0.002782834,0.0018875595,0.3461895],"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.00002643202,0.000014921579,0.00015284607,0.00007184618,0.000002554912,0.000040471452,0.00004929193,0.00007935291,0.00012025147,0.00684778,0.93171436,0.060879838],"study_design_scores_gemma":[0.0000034900675,0.0000062424965,0.00013027979,0.000056397355,0.0000014460431,0.00004368228,0.000064460466,0.000047679034,0.00006809584,0.0013615623,0.99821305,0.0000035130959],"about_ca_topic_score_codex":0.0025428375,"about_ca_topic_score_gemma":0.0031293924,"teacher_disagreement_score":0.4751628,"about_ca_system_score_codex":0.0023508363,"about_ca_system_score_gemma":0.0027657328,"threshold_uncertainty_score":0.67776203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43983886,0.001498153,0.53930455,0.0017730504,0.00013258356,0.00008713828,0.00040763748,0.00021204198,0.016745906],"genre_scores_gemma":[0.98455054,0.00038854402,0.012137955,0.00006828632,0.000049839604,0.00003020072,0.0001009783,0.000025142319,0.0026483657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984841,0.0005145706,0.00007601406,0.00033347833,0.0003074066,0.00028443887],"domain_scores_gemma":[0.9946532,0.0028103923,0.0014543515,0.00025250702,0.00056482584,0.00026463665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002405583,0.0007879869,0.0010865135,0.0012767075,0.0006989424,0.0030849106,0.0017235425,0.0011625224,0.0027795394],"category_scores_gemma":[0.010674253,0.0011247353,0.0015105639,0.002376511,0.0021660898,0.005737423,0.0017984923,0.0018153017,0.0001665538],"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.00007527976,0.000044750905,0.0032587887,0.000031968368,0.00008752949,0.0002210088,0.00008023774,0.87703645,0.0003783213,0.113816805,0.00046511507,0.004503785],"study_design_scores_gemma":[0.0000049286114,0.000011487562,0.0005262131,0.0000029863959,0.000009312968,0.000021698075,0.00003787161,0.9714357,0.00008712045,0.02757029,0.000282133,0.000010220563],"about_ca_topic_score_codex":0.020183414,"about_ca_topic_score_gemma":0.01119786,"teacher_disagreement_score":0.020183414,"about_ca_system_score_codex":0.002941776,"about_ca_system_score_gemma":0.0013665004,"threshold_uncertainty_score":0.040131867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25980636,0.0038691345,0.62014264,0.011103682,0.00029209896,0.00083411945,0.00017737456,0.00044177021,0.10333284],"genre_scores_gemma":[0.9770344,0.000713643,0.017145997,0.0003807159,0.00016710407,0.00017669649,0.000023418404,0.000020838872,0.0043371366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928343,0.00405929,0.0003174404,0.0010786207,0.0011190202,0.00059127784],"domain_scores_gemma":[0.9447865,0.041912407,0.0065646716,0.004153131,0.0019990858,0.0005841404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069322996,0.00090829324,0.0008779838,0.001228322,0.00078837894,0.0028872658,0.001137631,0.0025626754,0.0049407557],"category_scores_gemma":[0.042384375,0.00037987423,0.00071416545,0.00087423075,0.003034006,0.005333513,0.002127619,0.002137551,0.0004270953],"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.0004227348,0.00072542165,0.0047253906,0.0008981997,0.00025550165,0.0004403691,0.0014281723,0.069021724,0.008603228,0.75838137,0.0029175337,0.1521804],"study_design_scores_gemma":[0.00028981114,0.00062494574,0.0026716418,0.00017267083,0.0001586357,0.00028098887,0.00033163585,0.18914905,0.0077686217,0.7851719,0.013296896,0.00008317319],"about_ca_topic_score_codex":0.0008742415,"about_ca_topic_score_gemma":0.0004894984,"teacher_disagreement_score":0.0069322996,"about_ca_system_score_codex":0.0018826034,"about_ca_system_score_gemma":0.0016603012,"threshold_uncertainty_score":0.036661983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024982292,0.000633254,0.91528857,0.0055488427,0.0008415499,0.0008341624,0.0019821343,0.026381968,0.023507264],"genre_scores_gemma":[0.19038379,0.00042259778,0.7850584,0.0031257581,0.0004750103,0.0010783896,0.005974476,0.0034625002,0.010019162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962668,0.0011268501,0.00029300648,0.00070367137,0.0011790831,0.00043066245],"domain_scores_gemma":[0.98842245,0.0068274545,0.00068718084,0.001021128,0.0025206138,0.00052112405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00568856,0.0015678686,0.0013226653,0.0015382862,0.00095095875,0.004354548,0.002212082,0.002264752,0.015782649],"category_scores_gemma":[0.036300056,0.00061466906,0.0009877064,0.0011867298,0.00086422643,0.0029991143,0.0016819079,0.005625934,0.012095183],"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.0012587155,0.00087018806,0.0068330145,0.0006051447,0.00010535171,0.0002837525,0.00033479524,0.1368656,0.005358001,0.05991534,0.21709462,0.57047546],"study_design_scores_gemma":[0.00011639058,0.00009367412,0.00037197987,0.000114215174,0.000015477226,0.00006379613,0.00009574722,0.94467825,0.0045807306,0.029410047,0.020436082,0.000023571207],"about_ca_topic_score_codex":0.0027943675,"about_ca_topic_score_gemma":0.0030836263,"teacher_disagreement_score":0.015782649,"about_ca_system_score_codex":0.0015479967,"about_ca_system_score_gemma":0.0045485506,"threshold_uncertainty_score":0.05279821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020075066,0.011086358,0.24090461,0.0014903215,0.003190769,0.00011242233,0.0006085422,0.0020925214,0.73850685],"genre_scores_gemma":[0.036735836,0.011942257,0.107471175,0.0006981069,0.0015852408,0.00014049197,0.0016230436,0.0006964615,0.83910733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997154,0.000035218294,0.000009717458,0.00006670192,0.00014610181,0.000026825901],"domain_scores_gemma":[0.9998211,0.000036058453,0.000008539408,0.00005683632,0.000057377936,0.000020090654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003001321,0.0009668735,0.00058836146,0.00088535517,0.00062217476,0.0012520774,0.0008309278,0.00063547434,0.043000367],"category_scores_gemma":[0.0005674966,0.00040427622,0.00037019543,0.0015600073,0.00051027787,0.0012677376,0.00068837486,0.0012585405,0.026003001],"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.00004643719,0.000076029086,0.000093202354,0.0002226389,0.00001935384,0.000051250623,0.00007494493,0.012430719,0.0033640692,0.19427878,0.24809304,0.5412495],"study_design_scores_gemma":[0.000007355059,0.000032170465,0.00023622619,0.0000694731,0.000008014347,0.00012308032,0.000019855517,0.011397869,0.002047207,0.103076145,0.88297147,0.000011134325],"about_ca_topic_score_codex":0.0012093552,"about_ca_topic_score_gemma":0.002335088,"teacher_disagreement_score":0.043000367,"about_ca_system_score_codex":0.0011132663,"about_ca_system_score_gemma":0.001083694,"threshold_uncertainty_score":0.14385056},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013874716,0.0063281613,0.0051274803,0.029692052,0.051269755,0.00045339248,0.0070359823,0.0021656244,0.89654005],"genre_scores_gemma":[0.00460433,0.0034129685,0.0019823154,0.004691485,0.004701899,0.00017351561,0.004909812,0.00071391097,0.9748097],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977004,0.00030827287,0.00013208408,0.00045736737,0.0010914139,0.00031032172],"domain_scores_gemma":[0.99286073,0.0005622286,0.000174438,0.0007217282,0.0039817765,0.0016989812],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019324677,0.0010446238,0.00084499177,0.0025835312,0.0023635747,0.0068509504,0.00252123,0.0029421148,0.6531896],"category_scores_gemma":[0.00973604,0.00036246082,0.00072943413,0.0028059524,0.0006265509,0.0052746874,0.003876063,0.002069301,0.4887409],"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.000027534217,0.00001902627,0.00016697777,0.00009887814,0.0000029041203,0.0000463654,0.00006897377,0.00006948286,0.000117290416,0.007538209,0.927865,0.063979134],"study_design_scores_gemma":[0.0000032043993,0.000006098071,0.00011915335,0.000057588037,0.0000012797792,0.000040682608,0.00007342695,0.00003336922,0.000044353015,0.0011710263,0.99844664,0.0000032811529],"about_ca_topic_score_codex":0.0022419484,"about_ca_topic_score_gemma":0.003009462,"teacher_disagreement_score":0.6531896,"about_ca_system_score_codex":0.0025228576,"about_ca_system_score_gemma":0.0036707907,"threshold_uncertainty_score":0.4946829},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018710553,0.01079071,0.004856125,0.040726863,0.061257493,0.0003565656,0.0072119683,0.0019752071,0.870954],"genre_scores_gemma":[0.005235811,0.004644869,0.001436844,0.004733031,0.0053580482,0.00012816628,0.0037831,0.00057821954,0.9741019],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837995,0.0002037256,0.00009653567,0.00036027344,0.0007497967,0.00020975279],"domain_scores_gemma":[0.9948612,0.00047860722,0.00014207303,0.0004627021,0.002957589,0.0010978674],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013000123,0.0010016684,0.0008727026,0.002166968,0.0024021843,0.0055660647,0.0018289891,0.002300814,0.58068323],"category_scores_gemma":[0.008001484,0.000351936,0.00062713906,0.0022479692,0.0005817764,0.0047843363,0.0033983174,0.0019427635,0.40511563],"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.00001868734,0.000013592659,0.00013774958,0.00006863772,0.0000023349676,0.000040969077,0.00007720399,0.000051435516,0.0000975641,0.0070386543,0.9403719,0.052081186],"study_design_scores_gemma":[0.0000024760777,0.000004635713,0.00012949375,0.00005080095,0.0000011075468,0.000046667483,0.000076548786,0.00002783811,0.0000415443,0.0013561766,0.99825984,0.0000030061688],"about_ca_topic_score_codex":0.0019383988,"about_ca_topic_score_gemma":0.002680704,"teacher_disagreement_score":0.41931677,"about_ca_system_score_codex":0.002075098,"about_ca_system_score_gemma":0.0027232287,"threshold_uncertainty_score":0.5981045},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017051586,0.0074040885,0.010424847,0.03046728,0.057806425,0.00049206894,0.008930324,0.0028132985,0.8799566],"genre_scores_gemma":[0.006845827,0.004098723,0.003979408,0.0044206623,0.0050505362,0.00018116184,0.0068379254,0.0008555468,0.9677302],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985669,0.00019087202,0.000089039786,0.00028860668,0.00069186214,0.00017270773],"domain_scores_gemma":[0.9936318,0.0006161541,0.00014354983,0.00060107093,0.00394342,0.0010640188],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014520759,0.000948277,0.00078636024,0.0025385646,0.0020252678,0.005289351,0.0018787017,0.0020939738,0.5699813],"category_scores_gemma":[0.009105851,0.00036671155,0.0005989179,0.0024947266,0.00048778296,0.0039829058,0.0029478173,0.0017748871,0.37769523],"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.000024331857,0.000016257616,0.00016916756,0.0000720525,0.0000027364908,0.000045066045,0.000053475876,0.00011427306,0.00010954208,0.0058069853,0.9225567,0.071029425],"study_design_scores_gemma":[0.0000037845994,0.0000058579185,0.00013449116,0.000062692605,0.0000017682913,0.000048086564,0.00007218517,0.000080534286,0.00006510214,0.0016572011,0.9978642,0.0000040337864],"about_ca_topic_score_codex":0.0029447875,"about_ca_topic_score_gemma":0.0038085608,"teacher_disagreement_score":0.43001872,"about_ca_system_score_codex":0.0021596642,"about_ca_system_score_gemma":0.0027411073,"threshold_uncertainty_score":0.61336946},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014041977,0.0052107153,0.0030417047,0.030028956,0.05431469,0.00043566083,0.007282849,0.001858294,0.8964229],"genre_scores_gemma":[0.003518785,0.0025702668,0.0010973079,0.00455008,0.004593781,0.0001650934,0.0037630887,0.0005032833,0.97923833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983352,0.00019945546,0.00009394208,0.0003315075,0.0007982712,0.00024167624],"domain_scores_gemma":[0.9943092,0.0004473842,0.00013843135,0.0005302789,0.003200862,0.0013739179],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001367835,0.0009148181,0.0007178461,0.0022760862,0.0024883032,0.006488217,0.0019210083,0.0024368856,0.6663519],"category_scores_gemma":[0.009001782,0.00033090965,0.00055977737,0.0025690163,0.0005786298,0.004499185,0.0035584879,0.0019889476,0.5107176],"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.000017789771,0.0000133700005,0.00013067243,0.000058877904,0.0000014885777,0.000032177802,0.00006572898,0.000026877333,0.00007620297,0.0039196517,0.9495325,0.046124604],"study_design_scores_gemma":[0.0000027661906,0.000004800004,0.00014710182,0.00004883022,9.833777e-7,0.000032279975,0.00009475902,0.000018216388,0.00003177861,0.0008196695,0.99879634,0.0000025842567],"about_ca_topic_score_codex":0.0023208074,"about_ca_topic_score_gemma":0.0031884126,"teacher_disagreement_score":0.3336481,"about_ca_system_score_codex":0.0021482254,"about_ca_system_score_gemma":0.003500836,"threshold_uncertainty_score":0.47590846},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015611087,0.011002092,0.0077000456,0.045550335,0.11949436,0.0005152951,0.007737267,0.0021537435,0.8042858],"genre_scores_gemma":[0.0053147655,0.005223418,0.0022180902,0.0062438706,0.009041984,0.00018370323,0.0042884136,0.0006663193,0.96681935],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832934,0.00022341251,0.00011197082,0.0003565991,0.0007850063,0.00019371377],"domain_scores_gemma":[0.9933559,0.00065862783,0.0001578709,0.0006647647,0.0040942053,0.0010687016],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016080614,0.0009877961,0.00084452407,0.0021397257,0.0020802428,0.004710679,0.0019987195,0.0022595946,0.53066087],"category_scores_gemma":[0.010962963,0.0003466326,0.00064898096,0.0023188475,0.0005806299,0.0041802945,0.0026832956,0.0020518114,0.3601553],"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.000020429174,0.000013502794,0.00012551689,0.00007119393,0.0000021783285,0.000037093527,0.00004830955,0.000068367684,0.000084750005,0.006770845,0.9379273,0.054830484],"study_design_scores_gemma":[0.000003374627,0.0000054398133,0.00012652921,0.00006390595,0.0000013972234,0.00004430361,0.000054588832,0.000046327303,0.000049581744,0.0016030067,0.9979977,0.0000037026073],"about_ca_topic_score_codex":0.0027191085,"about_ca_topic_score_gemma":0.0031152512,"teacher_disagreement_score":0.46933913,"about_ca_system_score_codex":0.0024161865,"about_ca_system_score_gemma":0.0028719802,"threshold_uncertainty_score":0.6694553},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005265909,0.008201552,0.0013223446,0.070936486,0.19590586,0.00023609046,0.002532845,0.0017083713,0.7186298],"genre_scores_gemma":[0.0028604255,0.0046141795,0.00072123,0.03001874,0.037408285,0.00011704,0.0018149185,0.00054013974,0.921905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819475,0.0002469613,0.000120170196,0.0003482148,0.0008664781,0.00022338281],"domain_scores_gemma":[0.99597675,0.0005217335,0.00019298065,0.00053938036,0.0016049761,0.001164253],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015038971,0.0009415824,0.00088019186,0.0012604551,0.0021036272,0.00791469,0.0022585134,0.005078955,0.65780073],"category_scores_gemma":[0.010799238,0.0003755476,0.00082603993,0.0011554544,0.000917164,0.0047926395,0.0035783434,0.004645712,0.51302713],"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.000011341622,0.000020322108,0.00011896425,0.00006639056,0.0000024852916,0.000036263853,0.000031970005,0.000009635024,0.000056038785,0.0019625376,0.95760924,0.04007489],"study_design_scores_gemma":[0.0000029010134,0.0000044386543,0.000112909096,0.000046920737,0.0000011753156,0.000032088778,0.000042397114,0.000008960609,0.000019609079,0.00050851365,0.9992181,0.0000018761208],"about_ca_topic_score_codex":0.0016723776,"about_ca_topic_score_gemma":0.002879439,"teacher_disagreement_score":0.34219927,"about_ca_system_score_codex":0.0010988661,"about_ca_system_score_gemma":0.0030697274,"threshold_uncertainty_score":0.4881057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005278439,0.002686126,0.14621967,0.005787056,0.00095584005,0.00015197786,0.0016724255,0.00042604795,0.8368224],"genre_scores_gemma":[0.24785234,0.011115483,0.037373576,0.0023825723,0.0015538923,0.00070588157,0.0034505671,0.00034468932,0.6952211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00014450146,0.000015755999,0.00011846722,0.00016387158,0.000067214096],"domain_scores_gemma":[0.9993698,0.00020754572,0.000053920277,0.00015707783,0.00014865519,0.00006297892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048810296,0.0013654045,0.0006136575,0.001404809,0.00104282,0.002965054,0.001808814,0.0015971328,0.055005718],"category_scores_gemma":[0.002539293,0.00033925957,0.0005375512,0.0018005908,0.001250606,0.0052285763,0.0014219439,0.0019771303,0.012847633],"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.000004892338,0.000013296356,0.000050365994,0.0000308095,0.0000046510377,0.000034070952,0.000036919355,0.003361924,0.00006171866,0.96051854,0.024781972,0.011100785],"study_design_scores_gemma":[0.0000048408847,0.0000053876965,0.000047678277,0.00002620614,0.0000060906495,0.000067469606,0.000055525295,0.010143835,0.00006305915,0.90209883,0.08747595,0.00000515605],"about_ca_topic_score_codex":0.0032858176,"about_ca_topic_score_gemma":0.0029659052,"teacher_disagreement_score":0.055005718,"about_ca_system_score_codex":0.0017755707,"about_ca_system_score_gemma":0.0008938573,"threshold_uncertainty_score":0.18401247},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014780228,0.010454103,0.0043289894,0.049645882,0.097677976,0.00033561423,0.00467068,0.0013425171,0.83006614],"genre_scores_gemma":[0.005860773,0.0057341605,0.0015987135,0.007408167,0.009168477,0.00013108611,0.0032954807,0.00040605696,0.9663971],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859387,0.00018876136,0.00007513923,0.0003003569,0.0006713124,0.00017066686],"domain_scores_gemma":[0.9944766,0.0005096057,0.00012673087,0.00043138865,0.003499015,0.00095661805],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012735424,0.0007852157,0.00064434053,0.0016976908,0.0020732642,0.0043818625,0.0015532419,0.0018713109,0.46529263],"category_scores_gemma":[0.008274912,0.00027331253,0.00049654377,0.0018131221,0.00046217494,0.0037687852,0.00280684,0.0019074415,0.29641065],"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.0000134700085,0.00000953272,0.00011728472,0.00005214036,0.0000017563872,0.000028933378,0.00004610129,0.00003248268,0.00007098043,0.005062995,0.94741964,0.04714479],"study_design_scores_gemma":[0.0000024331391,0.000003965354,0.00012858638,0.000047807247,0.0000012311033,0.00003920302,0.000063799154,0.00002574643,0.0000383508,0.0011905438,0.99845576,0.0000025888212],"about_ca_topic_score_codex":0.0019837448,"about_ca_topic_score_gemma":0.002423542,"teacher_disagreement_score":0.46529263,"about_ca_system_score_codex":0.0018412408,"about_ca_system_score_gemma":0.0026337286,"threshold_uncertainty_score":0.76269513},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016796875,0.0063219564,0.0032199356,0.03705167,0.0759318,0.0005073564,0.007178644,0.0015880812,0.8665208],"genre_scores_gemma":[0.005626712,0.0034706402,0.0014945049,0.006946389,0.005525936,0.00021386745,0.004711871,0.0005862696,0.9714238],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784434,0.00027823882,0.0001246695,0.00040208478,0.0010496913,0.0003010709],"domain_scores_gemma":[0.99264824,0.0005325353,0.00016544883,0.00063398224,0.0042832885,0.0017365525],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017697135,0.0008641491,0.000686192,0.002412275,0.0026469547,0.006947087,0.0019779124,0.0025084731,0.5955912],"category_scores_gemma":[0.01081047,0.00031738894,0.00060781173,0.0023367796,0.0005976207,0.004171494,0.003772149,0.0021358645,0.38257363],"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.000021815344,0.000015117923,0.00017574626,0.00008422455,0.0000022568977,0.000044783486,0.00008286186,0.000034957,0.00008337433,0.0044535226,0.9386956,0.05630574],"study_design_scores_gemma":[0.0000027601097,0.0000047413923,0.00016926363,0.00006556805,0.0000011966905,0.00004029507,0.0001076252,0.000017493392,0.00003220886,0.00076116796,0.9987948,0.0000028009988],"about_ca_topic_score_codex":0.0030417626,"about_ca_topic_score_gemma":0.0042929137,"teacher_disagreement_score":0.4044088,"about_ca_system_score_codex":0.0027082532,"about_ca_system_score_gemma":0.004356713,"threshold_uncertainty_score":0.57684004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006844456,0.0036006058,0.7698535,0.0036489214,0.0012531809,0.0001059807,0.0013598079,0.0010196706,0.21231395],"genre_scores_gemma":[0.299495,0.0065515586,0.08793291,0.001498628,0.0012096509,0.00042925437,0.0027088164,0.0010623808,0.5991118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991493,0.00024092621,0.000029681423,0.00017612203,0.00024813536,0.00015582863],"domain_scores_gemma":[0.9988238,0.0005932987,0.00008519203,0.00015846855,0.00023276982,0.000106456326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013463368,0.0018955374,0.0013130846,0.0009964092,0.0008326918,0.0032203698,0.0034460612,0.002307,0.057593048],"category_scores_gemma":[0.0047955653,0.00088961923,0.00133649,0.0021786783,0.0011769247,0.004584871,0.0011425175,0.003885853,0.0118983],"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.00005523042,0.00012587965,0.00018388907,0.000101559875,0.0000306388,0.00007611969,0.00007187169,0.16688207,0.0002954806,0.7311584,0.060470283,0.04054863],"study_design_scores_gemma":[0.000024395114,0.000033432145,0.00011600814,0.000041899642,0.000025176145,0.000076054464,0.000043689397,0.5471336,0.00020924392,0.41775504,0.034517128,0.000024422465],"about_ca_topic_score_codex":0.005843547,"about_ca_topic_score_gemma":0.004284215,"teacher_disagreement_score":0.057593048,"about_ca_system_score_codex":0.0027197227,"about_ca_system_score_gemma":0.0021844276,"threshold_uncertainty_score":0.19266796},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027721677,0.005933583,0.95188195,0.0042647813,0.0006234291,0.00014273313,0.00047652176,0.0008386032,0.008116804],"genre_scores_gemma":[0.7274397,0.0047476,0.25786653,0.0017247715,0.001018287,0.00027588053,0.0015548619,0.00060194323,0.0047703763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927529,0.0036238816,0.0003197526,0.0010674135,0.0014793291,0.00075678254],"domain_scores_gemma":[0.9277855,0.06044181,0.0020754747,0.00367876,0.0049619023,0.0010566312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013951675,0.0027839986,0.004049956,0.0013709905,0.0013313479,0.0040968093,0.003062955,0.0034513122,0.006167048],"category_scores_gemma":[0.065344624,0.0009901833,0.0018209725,0.0022785466,0.0025560423,0.0075016436,0.0038934224,0.0060476055,0.0009427534],"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.0010030064,0.00023585919,0.0015331557,0.00044747515,0.00027935955,0.00020355127,0.00013197999,0.8714408,0.001597684,0.06085439,0.0135748945,0.04869782],"study_design_scores_gemma":[0.000016871587,0.000056233097,0.00010097266,0.000023663088,0.000014946712,0.000038959406,0.000026902006,0.98025435,0.00051891705,0.018430147,0.0005041185,0.000013990398],"about_ca_topic_score_codex":0.005475789,"about_ca_topic_score_gemma":0.002382983,"teacher_disagreement_score":0.013951675,"about_ca_system_score_codex":0.0025004677,"about_ca_system_score_gemma":0.0030977759,"threshold_uncertainty_score":0.07378441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066219725,0.006303824,0.84122735,0.040509928,0.0016307172,0.00019163659,0.0024599107,0.00058489776,0.040872067],"genre_scores_gemma":[0.942962,0.006777034,0.031311274,0.0055746417,0.005283703,0.00017974022,0.0007713829,0.00020078893,0.0069394377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99402124,0.0019323999,0.0002547921,0.0015460533,0.0014560857,0.0007894901],"domain_scores_gemma":[0.93091375,0.05567379,0.005248618,0.003909792,0.0033612913,0.00089274463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00866026,0.0015804471,0.002618489,0.0013659924,0.0014303466,0.0039126617,0.00286899,0.0031078472,0.008205338],"category_scores_gemma":[0.06356528,0.0009391933,0.0019908492,0.0021036991,0.00397899,0.014956622,0.0037776094,0.0076153665,0.0009972602],"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.00038697213,0.00022898345,0.006965741,0.00047384299,0.00028464868,0.0010130055,0.0002857869,0.22531536,0.0027317947,0.68506825,0.038175832,0.03906978],"study_design_scores_gemma":[0.000045558958,0.00008052412,0.0015330963,0.0000794651,0.00009880343,0.00043400275,0.00010711906,0.31599995,0.0012141116,0.67487234,0.005419401,0.00011559942],"about_ca_topic_score_codex":0.0035963457,"about_ca_topic_score_gemma":0.0018553981,"teacher_disagreement_score":0.00866026,"about_ca_system_score_codex":0.0029642633,"about_ca_system_score_gemma":0.0017972694,"threshold_uncertainty_score":0.045800388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4338396,0.0012484767,0.5517668,0.0027729021,0.00059761084,0.0003388627,0.0010968174,0.0006953433,0.0076436214],"genre_scores_gemma":[0.9777182,0.00023116214,0.01701212,0.00016482234,0.000101117934,0.00006458896,0.0001791438,0.000034503795,0.0044942466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780184,0.0005225839,0.000109286906,0.00044437186,0.00029361947,0.0008283059],"domain_scores_gemma":[0.99280447,0.0037204572,0.001053437,0.00034291507,0.0006979487,0.0013808147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004087103,0.0009089131,0.0017778365,0.00074767944,0.0013345261,0.0035613026,0.0029118878,0.0017404103,0.0072583887],"category_scores_gemma":[0.008225549,0.0007941845,0.0009877905,0.0012239226,0.0011656814,0.002928551,0.0012001701,0.0015959692,0.0009112757],"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.0028299154,0.0007921309,0.010154041,0.00031214432,0.00015742559,0.0010883779,0.0007694873,0.85109943,0.007920826,0.08134367,0.009972137,0.03356042],"study_design_scores_gemma":[0.00011172368,0.00022114307,0.0006032797,0.000012367633,0.000030423258,0.00010533944,0.00011093398,0.9898587,0.00031511445,0.0077569955,0.0008466898,0.000027295377],"about_ca_topic_score_codex":0.013356914,"about_ca_topic_score_gemma":0.0118466215,"teacher_disagreement_score":0.013356914,"about_ca_system_score_codex":0.0024632611,"about_ca_system_score_gemma":0.0034748325,"threshold_uncertainty_score":0.02655834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083148494,0.00054262247,0.83188957,0.005828653,0.00013823637,0.00025394445,0.00041902278,0.00031898156,0.07746054],"genre_scores_gemma":[0.88848305,0.00055226794,0.096602775,0.00083043246,0.0001639035,0.0005862841,0.00025984237,0.000075993,0.012445504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932412,0.0027003132,0.00034469567,0.0014525487,0.0015138842,0.0007474414],"domain_scores_gemma":[0.9922489,0.0046730367,0.00087936246,0.0010979469,0.0008104567,0.00029033853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051211896,0.001037779,0.0012303635,0.0014239977,0.0011311667,0.003553085,0.0009984762,0.0018718551,0.005742583],"category_scores_gemma":[0.012848062,0.0005154052,0.0015824437,0.0013518487,0.0071606357,0.0059758644,0.0017545744,0.0024171888,0.000817874],"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.000019545569,0.000026632415,0.00027089316,0.000025413823,0.000031120744,0.000041862007,0.000082881554,0.0043719,0.00024234792,0.9889475,0.00046422204,0.005475656],"study_design_scores_gemma":[0.000026759491,0.000030392916,0.00020606918,0.000013828465,0.000011786269,0.00004850631,0.00004723851,0.025962405,0.00023038367,0.9704434,0.002963591,0.000015616311],"about_ca_topic_score_codex":0.0020467483,"about_ca_topic_score_gemma":0.0014497056,"teacher_disagreement_score":0.005742583,"about_ca_system_score_codex":0.0028454144,"about_ca_system_score_gemma":0.0017211459,"threshold_uncertainty_score":0.027083755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066206135,0.0033713984,0.9094673,0.0037779915,0.0005803924,0.0002751326,0.0028667217,0.0019370543,0.011517851],"genre_scores_gemma":[0.7382302,0.002045238,0.25231257,0.00060353515,0.00051405386,0.0002952108,0.004033891,0.00013931737,0.0018259734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945412,0.0020734312,0.0004890853,0.0010960489,0.0015320209,0.00026822792],"domain_scores_gemma":[0.9847645,0.008050845,0.0011037239,0.0034039035,0.0024601528,0.00021685165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053582415,0.0012771831,0.0012754938,0.0025728864,0.0009007166,0.0027690083,0.0011331566,0.0011064679,0.0014555578],"category_scores_gemma":[0.024914362,0.0006570309,0.00091155694,0.005110089,0.0006782984,0.0032067483,0.0020047228,0.0020116465,0.0007851921],"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.00043474924,0.0002994061,0.038981713,0.00056199037,0.00046019288,0.00033672538,0.0005644286,0.4377213,0.0044987584,0.041823678,0.022698963,0.45161813],"study_design_scores_gemma":[0.00003296231,0.00011225344,0.0071256,0.00011123221,0.00008848809,0.00016613287,0.00027797118,0.9001901,0.004914734,0.06947814,0.01743306,0.000069272784],"about_ca_topic_score_codex":0.0076118647,"about_ca_topic_score_gemma":0.004926097,"teacher_disagreement_score":0.0076118647,"about_ca_system_score_codex":0.0011314502,"about_ca_system_score_gemma":0.0013725641,"threshold_uncertainty_score":0.02833736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025888851,0.00024866333,0.9929102,0.00041296,0.000077061035,0.00003995972,0.000091818045,0.00011433088,0.0035160466],"genre_scores_gemma":[0.35165048,0.0021990486,0.6325915,0.0006909844,0.0004732677,0.00043401725,0.0006856663,0.0003053841,0.010969729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988398,0.00042271495,0.000042926258,0.00017334262,0.00040613502,0.00011499138],"domain_scores_gemma":[0.99787116,0.0013932445,0.00011413163,0.00024361529,0.00031402352,0.00006389237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197065,0.0012616202,0.0009941122,0.0006837503,0.0004921896,0.001798917,0.0017493239,0.0010860028,0.008205509],"category_scores_gemma":[0.008679202,0.00052664574,0.0012710987,0.0016847333,0.00095963577,0.0033767761,0.0015331709,0.0034005772,0.0012680932],"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.00010647087,0.00011148298,0.00056290254,0.0001908944,0.00005467297,0.0000958273,0.00008944797,0.7524242,0.0020917489,0.17200051,0.008635062,0.06363681],"study_design_scores_gemma":[0.00000515524,0.000017456725,0.00002773901,0.000009917587,0.000004547991,0.000020200489,0.000006453171,0.9815586,0.00029524547,0.016121285,0.0019295121,0.000003944093],"about_ca_topic_score_codex":0.0038664462,"about_ca_topic_score_gemma":0.0025357155,"teacher_disagreement_score":0.008205509,"about_ca_system_score_codex":0.0012729403,"about_ca_system_score_gemma":0.0015427726,"threshold_uncertainty_score":0.027450144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05095988,0.0011419136,0.9278388,0.001532122,0.00051125477,0.00011861522,0.0006873678,0.00031532632,0.016894707],"genre_scores_gemma":[0.9226159,0.0007589089,0.06569291,0.00016496808,0.00029950877,0.00013782429,0.0003980164,0.000096450945,0.009835549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821943,0.00061272323,0.00009374406,0.00049267843,0.00029946736,0.00028191414],"domain_scores_gemma":[0.9984976,0.00064508955,0.0002299519,0.00016946925,0.00026648343,0.00019137785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018339544,0.00075704436,0.0012337309,0.0005422772,0.0007477728,0.0020089974,0.0020215558,0.0010664526,0.0057167173],"category_scores_gemma":[0.004077311,0.00053080416,0.0008635745,0.0008193861,0.00058415445,0.0017157985,0.0014858899,0.0014768878,0.0006786127],"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.00040744554,0.00017521941,0.0022137836,0.00018397176,0.000115197094,0.00015465463,0.00017973079,0.79941714,0.0032190233,0.11994587,0.0072144764,0.066773556],"study_design_scores_gemma":[0.000021908672,0.000082620514,0.00090830884,0.000010999597,0.000021676238,0.000058915946,0.000065516215,0.9655358,0.0005776693,0.026706338,0.005985869,0.000024283137],"about_ca_topic_score_codex":0.004083134,"about_ca_topic_score_gemma":0.0025529175,"teacher_disagreement_score":0.0057167173,"about_ca_system_score_codex":0.0012238019,"about_ca_system_score_gemma":0.001816012,"threshold_uncertainty_score":0.01912433},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042804168,0.0001949762,0.99117297,0.00023850353,0.00003684886,0.000049778115,0.0000528814,0.000081140475,0.0038923994],"genre_scores_gemma":[0.1958263,0.0008144313,0.792295,0.00032670976,0.00024201968,0.00041397798,0.0005976111,0.0003610062,0.009122955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984584,0.00061293365,0.000046213412,0.00021147462,0.0005131171,0.00015792578],"domain_scores_gemma":[0.9978542,0.0013530591,0.00016911892,0.00017832135,0.0003512558,0.000093950206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002644241,0.0015306692,0.0014511379,0.00078735565,0.0005134473,0.0016694154,0.0012158436,0.0011921285,0.0049762595],"category_scores_gemma":[0.0071382187,0.00068134314,0.0012379799,0.0009575822,0.0012261402,0.0020651764,0.0017085489,0.005147046,0.00090169796],"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.00013372998,0.00017711578,0.00032267228,0.00023175476,0.000032660926,0.00011624779,0.0001587495,0.7306251,0.004188716,0.1851322,0.0076271524,0.07125392],"study_design_scores_gemma":[0.000012235802,0.000032383286,0.000056194476,0.000015027432,0.0000043155815,0.000023701316,0.0000122484935,0.9794018,0.0005379129,0.01791534,0.0019840433,0.000004748439],"about_ca_topic_score_codex":0.0029050508,"about_ca_topic_score_gemma":0.0017945973,"teacher_disagreement_score":0.0049762595,"about_ca_system_score_codex":0.0011778573,"about_ca_system_score_gemma":0.001213344,"threshold_uncertainty_score":0.01664728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26667693,0.0009463053,0.7211124,0.0035674472,0.000176842,0.00017687456,0.00014340728,0.00076445634,0.006435382],"genre_scores_gemma":[0.98081344,0.00015180343,0.01821753,0.00018168891,0.000045641118,0.00003185434,0.000032890654,0.000013371033,0.00051190244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973889,0.001282904,0.00009169765,0.00053125696,0.0004182469,0.00028704817],"domain_scores_gemma":[0.9916298,0.0057262504,0.0011542308,0.00070725,0.00042589364,0.00035654486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002403762,0.00064357795,0.0008303148,0.00040535035,0.00034695497,0.0010169167,0.0011174658,0.0010907869,0.0013629171],"category_scores_gemma":[0.016535068,0.00041345798,0.00040913257,0.00038118343,0.0007208927,0.0014146651,0.001414649,0.0015752307,0.0001765639],"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.0005791874,0.00033693423,0.010139511,0.00013021028,0.00011542837,0.00027894412,0.00041041017,0.8140888,0.0036312072,0.01739929,0.003246926,0.14964318],"study_design_scores_gemma":[0.00007689715,0.00039218558,0.0034675372,0.000026258525,0.000040354924,0.00017697472,0.00010934074,0.9768927,0.0013314015,0.01588345,0.0015717149,0.000031146068],"about_ca_topic_score_codex":0.0023445932,"about_ca_topic_score_gemma":0.0016458592,"teacher_disagreement_score":0.002403762,"about_ca_system_score_codex":0.001051452,"about_ca_system_score_gemma":0.0010328995,"threshold_uncertainty_score":0.012712479},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19043483,0.0021403302,0.7960579,0.0026710622,0.00017781813,0.0002817757,0.00018767336,0.0002973021,0.007751308],"genre_scores_gemma":[0.87758446,0.0010309458,0.11878461,0.00028647587,0.000094611714,0.00013416319,0.00015504744,0.00007956885,0.0018501343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986873,0.0006684103,0.000054689415,0.00015032213,0.00015918542,0.00028010344],"domain_scores_gemma":[0.98630106,0.011650179,0.0006733349,0.00033137994,0.0005046579,0.0005393606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046788324,0.0014246656,0.0022915658,0.0009960206,0.0009899201,0.002292401,0.0016757279,0.002156559,0.0027771536],"category_scores_gemma":[0.013806184,0.0011113933,0.0010984548,0.0012458675,0.0015017027,0.0040749186,0.0013265788,0.0023143177,0.00019029662],"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.0002875159,0.00020305887,0.0011713348,0.000110972585,0.000072565876,0.00007446674,0.00008463284,0.94724303,0.0006603856,0.030701991,0.0019206188,0.017469494],"study_design_scores_gemma":[0.00003363202,0.00006607293,0.00011990521,0.000011949283,0.000013130719,0.000020542553,0.000041904572,0.9827017,0.0002495215,0.016518272,0.00021413856,0.00000920207],"about_ca_topic_score_codex":0.0052219387,"about_ca_topic_score_gemma":0.0023530032,"teacher_disagreement_score":0.0052219387,"about_ca_system_score_codex":0.0019573867,"about_ca_system_score_gemma":0.0020967915,"threshold_uncertainty_score":0.024744332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1395053,0.0014064648,0.84753984,0.0016549478,0.00018371637,0.00010639545,0.000108918764,0.00022806773,0.009266326],"genre_scores_gemma":[0.9708769,0.000771835,0.022309113,0.00017850974,0.00011710628,0.000058323945,0.000067081935,0.00006262034,0.0055585788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894696,0.00029315575,0.000031342017,0.00013139751,0.00023501381,0.0003620655],"domain_scores_gemma":[0.9956885,0.0029425349,0.00044092292,0.00016358348,0.00047255427,0.00029184803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030846759,0.0010719069,0.0017422057,0.0008248971,0.0007447405,0.0021069741,0.001972973,0.001538681,0.0036687457],"category_scores_gemma":[0.008204322,0.000740149,0.0012038695,0.0007232943,0.0015165609,0.0024521053,0.0013590604,0.0021884847,0.00023148836],"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.00010526556,0.000072623225,0.0006103152,0.000067284556,0.000043797554,0.000067764566,0.00007550691,0.95307446,0.0012875703,0.03892066,0.00087894395,0.0047958083],"study_design_scores_gemma":[0.0000040318982,0.000010527495,0.000059318707,0.0000018140256,0.0000044826975,0.0000043285254,0.000007741175,0.9980337,0.000062718806,0.0017390193,0.00006928085,0.000002972604],"about_ca_topic_score_codex":0.014595315,"about_ca_topic_score_gemma":0.005820145,"teacher_disagreement_score":0.014595315,"about_ca_system_score_codex":0.0032332388,"about_ca_system_score_gemma":0.0031490687,"threshold_uncertainty_score":0.029020727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005786747,0.00009896186,0.9928139,0.00017475379,0.000020053045,0.000035341305,0.00007028303,0.000064294094,0.00093560823],"genre_scores_gemma":[0.6605099,0.00038258993,0.33364403,0.0003611773,0.00011878601,0.00044955502,0.0006817363,0.00023104591,0.0036211712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959407,0.002195496,0.00017174895,0.00056157337,0.00084578193,0.0002846993],"domain_scores_gemma":[0.98844635,0.008801288,0.00078072073,0.0007192049,0.0009340735,0.00031836182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065394077,0.0016778838,0.001847871,0.00067916553,0.00042055093,0.002206091,0.002189115,0.0017357531,0.0024786063],"category_scores_gemma":[0.021913508,0.0009983601,0.0011172242,0.0010587913,0.0015941369,0.0032806885,0.002692526,0.003261118,0.0004196477],"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.000037585676,0.000030721796,0.00023289687,0.00006680866,0.000029540584,0.000050971114,0.000024997662,0.9545172,0.00053581124,0.03629489,0.0005289553,0.007649675],"study_design_scores_gemma":[0.0000052469168,0.00002197654,0.000040695824,0.000004850736,0.0000022592762,0.000009642553,0.000004560231,0.9860313,0.000273596,0.013377337,0.00022295059,0.0000056302047],"about_ca_topic_score_codex":0.0022159733,"about_ca_topic_score_gemma":0.0014563196,"teacher_disagreement_score":0.0065394077,"about_ca_system_score_codex":0.0014436411,"about_ca_system_score_gemma":0.0020622234,"threshold_uncertainty_score":0.034584105},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054337834,0.0010903807,0.9803167,0.0016591363,0.00019119019,0.000070741255,0.00012409179,0.00008659393,0.01102742],"genre_scores_gemma":[0.62701887,0.006031479,0.34330866,0.002003563,0.001513645,0.0006484707,0.00044929434,0.00038920357,0.018636938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692196,0.001393436,0.00011223924,0.0003986626,0.00090908026,0.00026465635],"domain_scores_gemma":[0.99219805,0.005810132,0.0005415313,0.00044199254,0.0007288803,0.00027950658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005268381,0.0014749427,0.0013475489,0.0008144695,0.00087080663,0.0022332964,0.001753322,0.0014763486,0.0078475755],"category_scores_gemma":[0.015461717,0.0006455139,0.002182541,0.0014026245,0.0017049165,0.0036387844,0.0028935529,0.0052007386,0.00092511857],"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.00010653911,0.00012787875,0.001004793,0.00034526308,0.00011009244,0.00023736284,0.00018453744,0.3339498,0.0028951429,0.6190948,0.009916407,0.032027453],"study_design_scores_gemma":[0.000018625093,0.00010139193,0.00037217053,0.000101581914,0.000032406773,0.00013918382,0.0000419831,0.7252827,0.0010603962,0.26592594,0.0068929647,0.000030607447],"about_ca_topic_score_codex":0.0019584424,"about_ca_topic_score_gemma":0.0014127748,"teacher_disagreement_score":0.0078475755,"about_ca_system_score_codex":0.0016519302,"about_ca_system_score_gemma":0.0019425905,"threshold_uncertainty_score":0.027862191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17920847,0.0018378552,0.80617815,0.0025060968,0.00018667027,0.00013916414,0.00011856334,0.00018476578,0.0096402215],"genre_scores_gemma":[0.96404105,0.00087013555,0.032757,0.00015937698,0.000087361026,0.000048039474,0.000051908788,0.000047355526,0.0019378039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982564,0.0008954128,0.000055157234,0.00024025932,0.00020570586,0.00034700538],"domain_scores_gemma":[0.9866175,0.010679578,0.00083148247,0.00050848763,0.00092477916,0.00043802196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037451873,0.0013364264,0.0019427089,0.0010480962,0.0011481226,0.0029634417,0.0026337297,0.002369397,0.003112757],"category_scores_gemma":[0.019923918,0.0009895217,0.0008419822,0.0015990379,0.002034636,0.0050120056,0.0016801106,0.0024767264,0.00022090547],"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.00016725021,0.000117184936,0.0006410353,0.000056755034,0.00005102444,0.00007708436,0.000065765074,0.9395516,0.0006688675,0.048437886,0.0009415687,0.009223931],"study_design_scores_gemma":[0.0000115896755,0.000035802084,0.00010727272,0.000006565919,0.000010574925,0.000021075923,0.00004143588,0.9795783,0.00021841037,0.019704983,0.00025152095,0.000012520209],"about_ca_topic_score_codex":0.006396789,"about_ca_topic_score_gemma":0.003482456,"teacher_disagreement_score":0.006396789,"about_ca_system_score_codex":0.0031193618,"about_ca_system_score_gemma":0.0017304817,"threshold_uncertainty_score":0.022632658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91988367,0.00061423285,0.0014972499,0.0066360845,0.00009962906,0.000048861722,0.00016336104,0.000026897218,0.07103003],"genre_scores_gemma":[0.9970426,0.00016237085,0.00017314528,0.0009495721,0.000055171135,0.000009707259,0.000027245382,0.0000047568997,0.0015754822],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967709,0.00087724905,0.00022814219,0.00029182725,0.0009289671,0.0009029113],"domain_scores_gemma":[0.96556884,0.015988378,0.013991128,0.001879455,0.0013019287,0.0012702434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004320229,0.00016249467,0.00029893126,0.00053043547,0.0011431887,0.003457111,0.0006303729,0.001953428,0.005765454],"category_scores_gemma":[0.022430412,0.00016274555,0.00054377696,0.0005100974,0.0029615122,0.00294566,0.001599679,0.0023908424,0.0005907543],"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.001970988,0.0012718732,0.57246375,0.00048288063,0.00039628713,0.0024020057,0.006801446,0.013039398,0.010109207,0.24934165,0.013132955,0.12858754],"study_design_scores_gemma":[0.00041269502,0.0021383562,0.7404838,0.0006242436,0.0005931136,0.0010896842,0.015418935,0.011200047,0.019099332,0.11559978,0.09302912,0.00031094288],"about_ca_topic_score_codex":0.009510098,"about_ca_topic_score_gemma":0.013221185,"teacher_disagreement_score":0.009510098,"about_ca_system_score_codex":0.0017451472,"about_ca_system_score_gemma":0.002436654,"threshold_uncertainty_score":0.022847831},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001877753,0.014138599,0.002742906,0.08954703,0.8803313,0.0000582047,0.00031365623,0.00016059389,0.012519912],"genre_scores_gemma":[0.0023501199,0.01254598,0.0011820272,0.023557046,0.91580087,0.0001020479,0.00053822465,0.00030162037,0.04362209],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961559,0.0006398204,0.0003936552,0.0006396392,0.0018466885,0.00032432683],"domain_scores_gemma":[0.967229,0.010767931,0.00148589,0.0014709071,0.015435673,0.0036105528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057106568,0.0022119894,0.002485806,0.003788966,0.0029911604,0.009267938,0.0022596496,0.006188376,0.06302288],"category_scores_gemma":[0.026855946,0.0008115422,0.0024223076,0.0028999078,0.0019179354,0.0061994563,0.0027098143,0.013615507,0.033086818],"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.000010680572,0.0000135729,0.000050190407,0.000069761474,0.0000063724137,0.000019508943,0.000012350066,0.00006424914,0.000039116072,0.001858009,0.99127054,0.0065856124],"study_design_scores_gemma":[0.000015544687,0.00003205178,0.0006898687,0.00035993507,0.000017228766,0.00009339995,0.000062193154,0.0004014895,0.00007697362,0.0116783185,0.98654455,0.000028487495],"about_ca_topic_score_codex":0.0026401193,"about_ca_topic_score_gemma":0.0025845068,"teacher_disagreement_score":0.06302288,"about_ca_system_score_codex":0.0044519203,"about_ca_system_score_gemma":0.004142711,"threshold_uncertainty_score":0.21083254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035919525,0.00083938567,0.95469433,0.0010457472,0.000100163736,0.00008792077,0.000096774944,0.0005232096,0.006692929],"genre_scores_gemma":[0.92859566,0.00048643275,0.06618653,0.0004405859,0.00017667466,0.000159397,0.00012068069,0.000099524994,0.0037346457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844104,0.0006315759,0.000070352005,0.00028963338,0.0003736042,0.00019382247],"domain_scores_gemma":[0.9939089,0.0042112228,0.000438728,0.0004904394,0.00069764483,0.0002530436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039463066,0.0013804665,0.0020435357,0.0006389463,0.0004802757,0.0015254703,0.0019650636,0.0017235702,0.004987899],"category_scores_gemma":[0.0180021,0.00093402725,0.0006123722,0.00082947855,0.0015676612,0.00389748,0.0024784058,0.0027703661,0.00059346994],"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.0005005281,0.00022696352,0.0010879899,0.00017860364,0.00008938732,0.00011723148,0.0001640897,0.8378182,0.0025696505,0.07560093,0.0027505115,0.07889591],"study_design_scores_gemma":[0.000032202857,0.00004446402,0.00008579594,0.0000108626145,0.000008575827,0.000012286741,0.0000058374626,0.9696548,0.00027746585,0.029550413,0.00030910512,0.000008225659],"about_ca_topic_score_codex":0.0019146658,"about_ca_topic_score_gemma":0.0015292277,"teacher_disagreement_score":0.004987899,"about_ca_system_score_codex":0.001043997,"about_ca_system_score_gemma":0.0015512133,"threshold_uncertainty_score":0.020870328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06463223,0.00072423095,0.9207986,0.0009776105,0.00033105808,0.00009687874,0.00014120773,0.00033320833,0.011965074],"genre_scores_gemma":[0.834539,0.0006111072,0.15724844,0.0008867558,0.00023859678,0.00014006504,0.00011619443,0.00010104345,0.006118834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858886,0.00033014215,0.00010146024,0.00029983514,0.00044052675,0.00023915681],"domain_scores_gemma":[0.997787,0.0008312365,0.00021049024,0.00038488235,0.00057988224,0.00020649597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018747306,0.00044043182,0.00073287485,0.00045557224,0.00052016735,0.0014234843,0.0019293405,0.0007689507,0.0013249883],"category_scores_gemma":[0.0045837094,0.00025054984,0.0006442696,0.00066032034,0.0012947028,0.0014827846,0.00074916333,0.0017972351,0.00027101944],"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.00017650542,0.000101421,0.0016417094,0.00014098568,0.00006979058,0.00045345738,0.00021896775,0.27989808,0.011048952,0.62749296,0.009439279,0.06931779],"study_design_scores_gemma":[0.00005968415,0.00008150251,0.00051115226,0.000029010409,0.000029212468,0.00018788253,0.0000466813,0.80956155,0.0042376034,0.17774531,0.007448742,0.0000617319],"about_ca_topic_score_codex":0.0058881426,"about_ca_topic_score_gemma":0.0037662368,"teacher_disagreement_score":0.0058881426,"about_ca_system_score_codex":0.0015311759,"about_ca_system_score_gemma":0.0018444994,"threshold_uncertainty_score":0.011707723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024191007,0.002330044,0.9430922,0.023087922,0.00047071502,0.00044722957,0.00043501842,0.00024629716,0.0056996085],"genre_scores_gemma":[0.5007344,0.0042524617,0.48452115,0.005285949,0.0012472704,0.0010548875,0.00060240336,0.00013995789,0.0021615308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96577203,0.027632961,0.001216346,0.0027617984,0.0018313965,0.0007855328],"domain_scores_gemma":[0.86244196,0.11601935,0.008172314,0.008842389,0.0030289716,0.0014949477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04528281,0.00217165,0.0042864676,0.0016895544,0.001207437,0.0040124594,0.00246345,0.004634568,0.006221879],"category_scores_gemma":[0.11860178,0.0016445662,0.0030912799,0.0021269205,0.0029319408,0.014236539,0.003179227,0.0069649136,0.0010216673],"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.001159167,0.0006417339,0.024903977,0.0010196619,0.0017320759,0.00035443917,0.002171808,0.35380393,0.00073726336,0.36663717,0.010445311,0.23639332],"study_design_scores_gemma":[0.00023300141,0.00032805646,0.0013057824,0.0003626606,0.0002997472,0.00011497472,0.00034448187,0.24379268,0.00042003658,0.7455894,0.007123893,0.0000852824],"about_ca_topic_score_codex":0.0052736667,"about_ca_topic_score_gemma":0.006106437,"teacher_disagreement_score":0.04528281,"about_ca_system_score_codex":0.0022189908,"about_ca_system_score_gemma":0.006577226,"threshold_uncertainty_score":0.23948127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15926236,0.005531975,0.7314705,0.003915279,0.0003807664,0.00087870547,0.0012347625,0.0008609885,0.096464634],"genre_scores_gemma":[0.8737565,0.0016668086,0.10321448,0.0003549959,0.00010540297,0.00022571304,0.00045032427,0.00016518921,0.020060522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.00038499723,0.00004258575,0.00018196373,0.00010917839,0.0002184148],"domain_scores_gemma":[0.9966462,0.0026542007,0.00013080704,0.00013073804,0.00019081343,0.0002471809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014761426,0.0009967914,0.0015933659,0.0009572387,0.00068764604,0.002445511,0.0012228435,0.0021308458,0.018807635],"category_scores_gemma":[0.006058794,0.0009721729,0.00093609013,0.0018626056,0.0010075988,0.0031515905,0.0012296782,0.0017919922,0.0009841467],"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.00063887885,0.00041509728,0.0012708975,0.00047513362,0.00016695708,0.00035933443,0.0002861197,0.68429536,0.002108253,0.2108947,0.013565434,0.0855238],"study_design_scores_gemma":[0.000102672544,0.00011218472,0.00053617096,0.000045699788,0.000048751575,0.00007361753,0.00017259062,0.8676136,0.00060878973,0.124303415,0.006351556,0.000030946096],"about_ca_topic_score_codex":0.006551854,"about_ca_topic_score_gemma":0.006040481,"teacher_disagreement_score":0.018807635,"about_ca_system_score_codex":0.0027810545,"about_ca_system_score_gemma":0.0016055186,"threshold_uncertainty_score":0.06291777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049096785,0.0016773262,0.9263982,0.004385035,0.0004672627,0.00010838398,0.00019409407,0.00023746183,0.017435335],"genre_scores_gemma":[0.908064,0.0016126592,0.07953491,0.0012014144,0.0005272853,0.00016712493,0.00010097832,0.00010992824,0.008681618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962747,0.0017674855,0.000094420684,0.00064377615,0.0005165147,0.00070310076],"domain_scores_gemma":[0.9926341,0.0046705105,0.00065784843,0.0006498653,0.0005626143,0.00082504534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00418009,0.0021936074,0.0021458473,0.00096960505,0.0020967259,0.0053674895,0.0057553193,0.004010394,0.0053405045],"category_scores_gemma":[0.011798896,0.0015563774,0.001827401,0.0011837854,0.0058142873,0.009504602,0.0033553168,0.0053806086,0.0005376603],"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.00011747414,0.000122018944,0.0006576778,0.00005930745,0.00005834601,0.00021887694,0.00021771903,0.14192659,0.0010848455,0.85029244,0.001935619,0.0033090953],"study_design_scores_gemma":[0.000032784374,0.00003561953,0.00012490276,0.000017328757,0.000022018512,0.000052900174,0.00006767971,0.6601503,0.00024429528,0.33806977,0.0011409494,0.000041484574],"about_ca_topic_score_codex":0.008833679,"about_ca_topic_score_gemma":0.006655126,"teacher_disagreement_score":0.008833679,"about_ca_system_score_codex":0.0047129663,"about_ca_system_score_gemma":0.003657453,"threshold_uncertainty_score":0.034195125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115864284,0.0012338911,0.877931,0.0010279455,0.000077555334,0.00006856444,0.00014524661,0.00034042893,0.0033110527],"genre_scores_gemma":[0.9747833,0.00033420027,0.022518307,0.00010677165,0.000045029323,0.00005419507,0.00010292394,0.000025815587,0.0020293426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995185,0.00012012834,0.000026749605,0.0001266883,0.0000783021,0.00012957025],"domain_scores_gemma":[0.9971106,0.0020772768,0.00031861282,0.000103353144,0.0002794479,0.0001107733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018509219,0.00092439924,0.0015998511,0.0004612296,0.00044609845,0.0015117134,0.0013261486,0.0011579246,0.0020494391],"category_scores_gemma":[0.0045217536,0.00063983415,0.00060773955,0.00064804085,0.0010141463,0.0013086132,0.0011997976,0.0019708176,0.00020652996],"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.00006695618,0.000033174358,0.00033604825,0.00003615061,0.000015568154,0.000020784233,0.000023473049,0.98858625,0.00020771958,0.0024177989,0.00030229363,0.007953807],"study_design_scores_gemma":[0.0000028252937,0.000006935136,0.00003757625,0.0000012947529,0.0000015091127,0.0000017822659,0.0000029109583,0.9992519,0.00003989244,0.00063183083,0.000020358302,0.0000012448714],"about_ca_topic_score_codex":0.0133494325,"about_ca_topic_score_gemma":0.0071988204,"teacher_disagreement_score":0.0133494325,"about_ca_system_score_codex":0.001494076,"about_ca_system_score_gemma":0.0015934281,"threshold_uncertainty_score":0.026543498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09547903,0.0012380374,0.8960846,0.0016791397,0.00011755287,0.00003942811,0.00012342354,0.00017919287,0.0050596725],"genre_scores_gemma":[0.9383769,0.0005904706,0.056123763,0.00030902517,0.0001129442,0.00008114827,0.00013810277,0.000051244624,0.004216299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991768,0.00037042273,0.000036965273,0.00018559824,0.00011121349,0.000118949734],"domain_scores_gemma":[0.99622726,0.0028506774,0.00035445447,0.0002063146,0.00023558721,0.00012562015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021553002,0.0005922763,0.0009802254,0.0003086501,0.00034457416,0.0010174051,0.000670786,0.001034017,0.0020053869],"category_scores_gemma":[0.008713786,0.00048153655,0.0005818398,0.0004521611,0.0009536303,0.001085085,0.00078613026,0.0014558717,0.00021171207],"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.00007819688,0.000036071193,0.0012133461,0.000048079128,0.000058085,0.000046820838,0.000042333406,0.94509304,0.00042668686,0.035893075,0.0010064162,0.016057923],"study_design_scores_gemma":[0.000005749483,0.000009696846,0.00014061594,0.0000037269588,0.000003601268,0.000004169245,0.0000045240117,0.98784083,0.000068282825,0.011736549,0.00018025146,0.0000020737518],"about_ca_topic_score_codex":0.0042346707,"about_ca_topic_score_gemma":0.0026622089,"teacher_disagreement_score":0.0042346707,"about_ca_system_score_codex":0.000866097,"about_ca_system_score_gemma":0.00084697275,"threshold_uncertainty_score":0.011398494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020247387,0.0007496268,0.97367394,0.001770792,0.0000718068,0.00022278073,0.00010740401,0.00029360226,0.002862769],"genre_scores_gemma":[0.8016264,0.0008363153,0.18976218,0.0007203808,0.0003214355,0.0007474233,0.00013168999,0.00012371718,0.0057304422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9823987,0.010483415,0.0007138549,0.0027730127,0.0021973983,0.0014336046],"domain_scores_gemma":[0.9344121,0.041380804,0.006493999,0.012835686,0.0033922587,0.001485167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019385027,0.0014885922,0.004056181,0.0012945099,0.0018439743,0.0059450474,0.005171464,0.004849384,0.0045225355],"category_scores_gemma":[0.04924948,0.0018045667,0.0017736016,0.0023150844,0.005688871,0.013708291,0.007252666,0.005523295,0.0009411963],"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.0013878092,0.0006241622,0.0019696022,0.00033245183,0.00025847327,0.0002751717,0.0005778401,0.16904502,0.0049592634,0.7283691,0.0052145235,0.0869867],"study_design_scores_gemma":[0.00033773607,0.00035110334,0.00050297263,0.00009018968,0.000082713304,0.0003082537,0.000114899914,0.50063974,0.0040815566,0.48999265,0.0034064052,0.00009181094],"about_ca_topic_score_codex":0.0006864609,"about_ca_topic_score_gemma":0.0005765785,"teacher_disagreement_score":0.019385027,"about_ca_system_score_codex":0.0035590103,"about_ca_system_score_gemma":0.0041239196,"threshold_uncertainty_score":0.102519035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021927703,0.00031731397,0.97347826,0.00029966424,0.00004660636,0.00006772828,0.00008254839,0.0003579957,0.003422218],"genre_scores_gemma":[0.6799977,0.00044335445,0.31556866,0.0002611761,0.00008614916,0.000119160184,0.0003522674,0.00036412108,0.002807439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982811,0.0006623816,0.000060787344,0.00029578622,0.00040250717,0.0002974036],"domain_scores_gemma":[0.99260557,0.0050615394,0.0005843582,0.00084206177,0.0005682406,0.00033833217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027292364,0.0013956086,0.001167917,0.00057539187,0.00086307473,0.0015832636,0.0014809424,0.0012237378,0.0028497917],"category_scores_gemma":[0.010658165,0.0006838565,0.00078025967,0.00080496137,0.0014204037,0.0027070234,0.0020270515,0.0023010143,0.00060890755],"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.00025320167,0.0000687033,0.00040473032,0.00008987679,0.000037296315,0.00006953623,0.00012767296,0.90958107,0.0041109957,0.053816598,0.0028900949,0.02855015],"study_design_scores_gemma":[0.000020552625,0.000095030024,0.00016071033,0.000015195698,0.000009470852,0.00006074142,0.000047634814,0.9329506,0.0024276723,0.062459674,0.0017394439,0.000013146407],"about_ca_topic_score_codex":0.0018998464,"about_ca_topic_score_gemma":0.001948596,"teacher_disagreement_score":0.0028497917,"about_ca_system_score_codex":0.0017090394,"about_ca_system_score_gemma":0.0013099805,"threshold_uncertainty_score":0.014433742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099497475,0.00011044941,0.9871999,0.0003424438,0.000066203924,0.000037304006,0.00007523144,0.0002309259,0.001987769],"genre_scores_gemma":[0.6505077,0.0005659202,0.34354693,0.00034450463,0.0001719819,0.0002735077,0.00039467265,0.000119392585,0.0040754587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900573,0.00042401793,0.00005977208,0.00010712124,0.00033591717,0.000067467416],"domain_scores_gemma":[0.99558973,0.003074368,0.00026880714,0.0003443073,0.00053416484,0.00018856842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018054603,0.00055546773,0.0007498776,0.0007766074,0.000574075,0.00087160984,0.0014312194,0.0013368572,0.0022122576],"category_scores_gemma":[0.008428816,0.0004178187,0.00087767735,0.0008921335,0.0009561081,0.0010673271,0.0017943933,0.00163229,0.00035892715],"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.000033744145,0.00003717918,0.0007519001,0.00002105863,0.000021744885,0.000068670066,0.00003559585,0.90829,0.0008562032,0.07880462,0.000689252,0.010390001],"study_design_scores_gemma":[0.000002162082,0.000004326257,0.00001756504,0.0000011343001,0.0000014917034,0.000008564585,0.0000010820233,0.995363,0.000086421154,0.0042774603,0.00023424256,0.000002494348],"about_ca_topic_score_codex":0.0073524807,"about_ca_topic_score_gemma":0.0040632375,"teacher_disagreement_score":0.0073524807,"about_ca_system_score_codex":0.0008595535,"about_ca_system_score_gemma":0.0015606047,"threshold_uncertainty_score":0.01461935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43071193,0.0005492452,0.56099147,0.0017367717,0.00007902831,0.00009754599,0.00027378774,0.00035383794,0.005206416],"genre_scores_gemma":[0.9914527,0.00012240493,0.007805554,0.00005180944,0.000024834793,0.00002453989,0.00007226072,0.000016038308,0.00042983476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772805,0.0010057254,0.00007326705,0.00037490894,0.0004359567,0.0003821371],"domain_scores_gemma":[0.98648083,0.010919654,0.0012852477,0.00046025633,0.0005149927,0.0003390856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004022874,0.000834444,0.0010427133,0.00045774487,0.0008863625,0.00171763,0.0010672682,0.0011644263,0.0007747421],"category_scores_gemma":[0.016096454,0.00063777965,0.00060729694,0.0007575647,0.0016627176,0.0020706316,0.0012899142,0.0018550891,0.00008066823],"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.000023050801,0.000008157451,0.00033274564,0.000006817437,0.000007464782,0.00002355995,0.00001993652,0.995481,0.00008592472,0.0032605731,0.000077583296,0.00067315507],"study_design_scores_gemma":[0.0000035380567,0.0000076014894,0.00015063769,9.4741245e-7,0.0000018284823,0.000004307986,0.000013245898,0.99590045,0.000049335675,0.003815694,0.00004877978,0.0000036288707],"about_ca_topic_score_codex":0.027988153,"about_ca_topic_score_gemma":0.011727406,"teacher_disagreement_score":0.027988153,"about_ca_system_score_codex":0.0029618684,"about_ca_system_score_gemma":0.0018756444,"threshold_uncertainty_score":0.055650532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0800954,0.00053683814,0.9090735,0.0015847884,0.00006188472,0.000050172013,0.00014253773,0.00013981867,0.008315072],"genre_scores_gemma":[0.93871987,0.0005244698,0.057176165,0.00021666157,0.000057649853,0.00008862989,0.00015844512,0.000069603484,0.002988547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968574,0.0015112369,0.000166174,0.00050706347,0.00060496794,0.00035310732],"domain_scores_gemma":[0.9925317,0.004880927,0.0010082545,0.0006516817,0.0006609334,0.00026656888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044221324,0.0011887404,0.0016110267,0.0005233183,0.0003565713,0.0026307942,0.001098662,0.001535214,0.0017565599],"category_scores_gemma":[0.019935677,0.00076217187,0.0010820745,0.0006957319,0.0019707454,0.0032580814,0.001923201,0.0020692488,0.00030801518],"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.000108069915,0.000030310908,0.00038542575,0.000059176775,0.00007618868,0.00011247035,0.00007449072,0.89405686,0.0009400561,0.09613176,0.00063398806,0.0073912167],"study_design_scores_gemma":[0.000014048783,0.000032444837,0.00015813507,0.00000884057,0.000007990797,0.000016245867,0.00001785628,0.9122947,0.00037180688,0.08685204,0.00021355532,0.000012416111],"about_ca_topic_score_codex":0.0027580264,"about_ca_topic_score_gemma":0.0009528093,"teacher_disagreement_score":0.0044221324,"about_ca_system_score_codex":0.0022121912,"about_ca_system_score_gemma":0.0014834476,"threshold_uncertainty_score":0.023386717},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09836782,0.04662407,0.067367,0.69441634,0.008886904,0.000040554798,0.0017348905,0.0006014826,0.081960894],"genre_scores_gemma":[0.8817358,0.045334026,0.0055049756,0.027934825,0.010290216,0.000047830086,0.0008289173,0.00017848446,0.028144952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996798,0.00012530232,0.00001282133,0.000054915483,0.000080031205,0.00004699097],"domain_scores_gemma":[0.9979729,0.0012132813,0.00024433443,0.00016781206,0.00017700787,0.00022463339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012299833,0.00027686864,0.0003328793,0.00032447203,0.0003887967,0.0024920164,0.000434418,0.0013457463,0.0041185045],"category_scores_gemma":[0.006956318,0.0002657672,0.0004168311,0.0006678047,0.0015675833,0.0024110407,0.0005218934,0.004835932,0.00079323986],"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.00016219687,0.000085471904,0.009718651,0.00011552135,0.00009722539,0.00017259986,0.00014112174,0.028901849,0.0005568028,0.45882082,0.3974778,0.103749976],"study_design_scores_gemma":[0.00011093592,0.000044762273,0.01102101,0.0001554376,0.000039794093,0.00012503099,0.00014584184,0.10762417,0.0007587025,0.6940605,0.18581954,0.000094269584],"about_ca_topic_score_codex":0.0050963596,"about_ca_topic_score_gemma":0.0040901317,"teacher_disagreement_score":0.0050963596,"about_ca_system_score_codex":0.0015719755,"about_ca_system_score_gemma":0.00093718246,"threshold_uncertainty_score":0.013777733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03872505,0.0005580418,0.8903977,0.0040678224,0.00028017376,0.00019591727,0.0010429661,0.00038373665,0.06434853],"genre_scores_gemma":[0.902979,0.0009999999,0.037682265,0.0004234375,0.00016165181,0.0006946576,0.0006547954,0.00012109586,0.056283083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917954,0.00023704077,0.000031117692,0.00020580225,0.00014554385,0.00020094782],"domain_scores_gemma":[0.9990972,0.0004410378,0.00012166602,0.00004132973,0.00016247162,0.0001361975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010325885,0.00095294276,0.0009012222,0.00057425007,0.0007376819,0.002833078,0.0021740298,0.0029972086,0.009359678],"category_scores_gemma":[0.0027774242,0.0005219496,0.00074316404,0.0007749345,0.0010542013,0.002328046,0.0016213716,0.0019102569,0.0011508606],"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.00005370893,0.00005573289,0.00037167256,0.00005565194,0.000018394046,0.00012573309,0.00013071319,0.899809,0.00061845814,0.090109915,0.00317498,0.005476015],"study_design_scores_gemma":[0.000019520074,0.000022749486,0.000094913994,0.000010134379,0.0000070356427,0.000019373747,0.0000466354,0.97876865,0.000071259296,0.01807468,0.0028534739,0.000011652857],"about_ca_topic_score_codex":0.015586623,"about_ca_topic_score_gemma":0.008284567,"teacher_disagreement_score":0.015586623,"about_ca_system_score_codex":0.0021256518,"about_ca_system_score_gemma":0.0023393298,"threshold_uncertainty_score":0.031311274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11604227,0.0005946879,0.8643381,0.0021747747,0.000078543504,0.00016960366,0.00011495072,0.00009391699,0.016393108],"genre_scores_gemma":[0.9383309,0.00033433785,0.05768875,0.00007406896,0.000049252463,0.00016385328,0.00004921481,0.000017831342,0.0032918786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875474,0.0006505844,0.000032935644,0.00015371632,0.00015071756,0.00025720795],"domain_scores_gemma":[0.99877065,0.0006025548,0.00022583494,0.00008085899,0.00010690032,0.00021318444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024121339,0.0005988072,0.00068166497,0.0007126694,0.0009323202,0.0017692146,0.0014241413,0.0015252896,0.005060474],"category_scores_gemma":[0.0026840703,0.00047330942,0.0012165102,0.00052029605,0.001399887,0.0023482956,0.0025014887,0.0018003911,0.00020127303],"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.000061221916,0.00016820402,0.0012257398,0.000060491,0.000046622547,0.00019683168,0.00024194056,0.60100913,0.0012291432,0.38353994,0.0013458004,0.01087492],"study_design_scores_gemma":[0.000031277978,0.00011320481,0.00046443724,0.000020982105,0.000025696683,0.0000429684,0.00015758746,0.9106585,0.00029739577,0.0861557,0.0020083426,0.000023981382],"about_ca_topic_score_codex":0.005271706,"about_ca_topic_score_gemma":0.004889471,"teacher_disagreement_score":0.005271706,"about_ca_system_score_codex":0.0020466216,"about_ca_system_score_gemma":0.0030078741,"threshold_uncertainty_score":0.016928911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033615135,0.00361484,0.8889209,0.010998838,0.00078647287,0.00007446779,0.0004602791,0.00015214074,0.06137692],"genre_scores_gemma":[0.8321939,0.00765799,0.12277676,0.006376466,0.0046941126,0.00023631171,0.0007365158,0.0002459173,0.025081933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719393,0.00084419496,0.00017815527,0.0005313226,0.0009997052,0.00025260696],"domain_scores_gemma":[0.9861659,0.008625427,0.0012167799,0.0011431744,0.0021338845,0.00071488513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044892603,0.0011829209,0.0009714696,0.0016240629,0.0014853368,0.0026317565,0.0012277873,0.0015650681,0.0059940675],"category_scores_gemma":[0.016372826,0.00062765717,0.0019757187,0.0020654348,0.0038351202,0.0062814313,0.0038163373,0.0052605825,0.0011349277],"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.00004130205,0.00006202667,0.001628986,0.00010403971,0.000054495624,0.00038828838,0.00013046764,0.008327051,0.0018269337,0.9657478,0.008480262,0.013208208],"study_design_scores_gemma":[0.000013488548,0.000031410844,0.0006057893,0.00003935071,0.000019898198,0.00057036185,0.000035898833,0.03725814,0.000701328,0.9517613,0.008931364,0.000031712167],"about_ca_topic_score_codex":0.001500795,"about_ca_topic_score_gemma":0.0009584479,"teacher_disagreement_score":0.0059940675,"about_ca_system_score_codex":0.0014873615,"about_ca_system_score_gemma":0.0016366044,"threshold_uncertainty_score":0.023741722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011551375,0.00049136544,0.98418254,0.00026108386,0.000052664815,0.00012623491,0.000059330672,0.00020155033,0.0030738327],"genre_scores_gemma":[0.75316304,0.00084277673,0.23528291,0.00022367468,0.00012863213,0.00034438848,0.00014206418,0.00013806479,0.009734507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936836,0.0032018346,0.00031962286,0.0010358611,0.0010584298,0.00070075196],"domain_scores_gemma":[0.9882152,0.007622186,0.0012077142,0.001156484,0.0012269446,0.0005714293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083347615,0.0019519876,0.003944899,0.0010891323,0.0006075277,0.003957104,0.0030777243,0.0024109466,0.0041504353],"category_scores_gemma":[0.019509599,0.001994797,0.0014082198,0.0012852619,0.0028136107,0.004511951,0.0022482204,0.0027264238,0.00090625003],"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.00057099387,0.00022548993,0.00059352623,0.00041569417,0.00014318599,0.00021060588,0.00014728021,0.73487073,0.0024200238,0.22516151,0.0020156377,0.03322542],"study_design_scores_gemma":[0.00017894122,0.00022542504,0.00015575666,0.000024656014,0.000039629427,0.00007363692,0.00001955107,0.85830104,0.00047513365,0.13937698,0.0010908175,0.00003845139],"about_ca_topic_score_codex":0.0020464815,"about_ca_topic_score_gemma":0.0015876415,"teacher_disagreement_score":0.0083347615,"about_ca_system_score_codex":0.0025183607,"about_ca_system_score_gemma":0.0030132085,"threshold_uncertainty_score":0.044078946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7952076,0.0016957948,0.026443189,0.0038092213,0.0000865014,0.00009908604,0.00020634178,0.000081178056,0.172371],"genre_scores_gemma":[0.99447906,0.00036795353,0.0003426598,0.00014919532,0.00007644659,0.000018974893,0.000018566972,0.000005613875,0.00454151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858886,0.0004881454,0.000035798148,0.00022841601,0.00025579892,0.00040290243],"domain_scores_gemma":[0.99250364,0.0045286887,0.0015715597,0.00033954997,0.00048267236,0.0005738106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015746519,0.0004959922,0.0007084909,0.00096292334,0.00096299127,0.002896606,0.000595023,0.0013060743,0.01405288],"category_scores_gemma":[0.007384382,0.00026054066,0.00072292075,0.0006541593,0.0035294306,0.004834941,0.002105479,0.0013532134,0.00047478708],"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.00062867557,0.00026259737,0.0135844,0.0001652541,0.000093560564,0.0010666122,0.0006786288,0.042881604,0.003165353,0.9102818,0.003903662,0.02328789],"study_design_scores_gemma":[0.00029404435,0.00050319283,0.021152727,0.00008056287,0.00013567224,0.0005488415,0.00094439083,0.1646135,0.001583605,0.80391747,0.0061159334,0.000110025074],"about_ca_topic_score_codex":0.0037956326,"about_ca_topic_score_gemma":0.003548253,"teacher_disagreement_score":0.01405288,"about_ca_system_score_codex":0.0018700868,"about_ca_system_score_gemma":0.00069515593,"threshold_uncertainty_score":0.047011554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08369024,0.0010859978,0.86857885,0.01123914,0.00035198277,0.00032409787,0.00029838452,0.00077151565,0.033659663],"genre_scores_gemma":[0.88156205,0.0006405006,0.10633674,0.0019653805,0.0004910153,0.0001509286,0.00011036931,0.00018986067,0.008553228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99004036,0.0066518504,0.00023993444,0.00076794793,0.0013147204,0.0009851046],"domain_scores_gemma":[0.9809123,0.013954469,0.0011847704,0.002141074,0.0010021011,0.00080522476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018308852,0.0011509089,0.0023766954,0.00094767683,0.0010338688,0.003972904,0.0026725587,0.0023451096,0.004837897],"category_scores_gemma":[0.03798411,0.00083462056,0.0007697792,0.0015721695,0.003138453,0.0052448087,0.002001957,0.0034032997,0.00063752895],"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.0022002584,0.00037784045,0.0017875065,0.00028403255,0.00016320699,0.0001801581,0.0003051898,0.42821577,0.001878991,0.4254943,0.015708407,0.12340432],"study_design_scores_gemma":[0.00018874831,0.00020572843,0.00041717078,0.000051759962,0.000029104236,0.00010521067,0.000101370664,0.52744216,0.000594372,0.4683356,0.0024893426,0.00003948129],"about_ca_topic_score_codex":0.005110307,"about_ca_topic_score_gemma":0.0048571243,"teacher_disagreement_score":0.018308852,"about_ca_system_score_codex":0.003401977,"about_ca_system_score_gemma":0.0075989193,"threshold_uncertainty_score":0.096827626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18692403,0.00065770163,0.8034473,0.00080807274,0.00015260975,0.0000716657,0.000108136155,0.00027784682,0.0075525623],"genre_scores_gemma":[0.9806732,0.00023688727,0.016079025,0.00007430227,0.000018900504,0.00003543534,0.00004929511,0.000031699696,0.002801114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929225,0.00024736323,0.000016886548,0.00015617826,0.000093126146,0.00019413097],"domain_scores_gemma":[0.9993124,0.00036400658,0.00009458916,0.000049442846,0.00009586492,0.00008368029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007391432,0.0006737364,0.00076814723,0.0003554864,0.0007518543,0.00092829246,0.0012006412,0.0007088198,0.0027092013],"category_scores_gemma":[0.0021125146,0.00040595207,0.00063613575,0.0006038328,0.0011902982,0.0020906567,0.0015742201,0.000856806,0.000172129],"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.000057005902,0.000024623801,0.00036377172,0.000029480418,0.000015429505,0.00005643195,0.00005424989,0.9698374,0.0008202965,0.019664634,0.00055610004,0.008520621],"study_design_scores_gemma":[0.0000070719802,0.000038872528,0.00011480758,0.00000460359,0.0000070334872,0.00002827484,0.000080886224,0.984539,0.0004959926,0.013402483,0.0012700446,0.000010880295],"about_ca_topic_score_codex":0.0077882856,"about_ca_topic_score_gemma":0.0056551364,"teacher_disagreement_score":0.0077882856,"about_ca_system_score_codex":0.0014097838,"about_ca_system_score_gemma":0.0009850599,"threshold_uncertainty_score":0.015485942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1322932,0.0025005033,0.8330431,0.0060854782,0.00019044607,0.00028537135,0.0011279867,0.00026864064,0.024205271],"genre_scores_gemma":[0.78402054,0.004251527,0.19835083,0.00085986545,0.0005984931,0.00059299293,0.0015366522,0.00034330174,0.00944578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787354,0.0010480762,0.00010119475,0.00041278225,0.00029270197,0.0002715721],"domain_scores_gemma":[0.9811715,0.016977495,0.000598685,0.00047865944,0.0004162502,0.00035730438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328137,0.0013959197,0.002247334,0.0011482489,0.00096017995,0.0028774752,0.002333116,0.0025722538,0.006367669],"category_scores_gemma":[0.01679499,0.0011374658,0.0026446322,0.0016002136,0.002359361,0.006504821,0.002067838,0.004990039,0.00042795055],"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.00015129037,0.00017653526,0.0011211045,0.00039087515,0.00011045937,0.00018230698,0.00022457034,0.7539611,0.0006322296,0.21700403,0.0060671885,0.019978367],"study_design_scores_gemma":[0.00004612632,0.00004997834,0.0004232555,0.00004439717,0.000018958712,0.00007481559,0.000094997995,0.7236496,0.00027470512,0.27331197,0.0019864428,0.000024739347],"about_ca_topic_score_codex":0.0031440267,"about_ca_topic_score_gemma":0.0017865245,"teacher_disagreement_score":0.006367669,"about_ca_system_score_codex":0.0019171668,"about_ca_system_score_gemma":0.00159042,"threshold_uncertainty_score":0.021302044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074682176,0.00042387735,0.91893035,0.0012255306,0.00008476464,0.00012507047,0.000037592235,0.00018553626,0.00430522],"genre_scores_gemma":[0.9775203,0.0003113546,0.020459987,0.00009382296,0.000043418993,0.00009193659,0.000018372315,0.000021528607,0.001439258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889296,0.00040788358,0.00004436264,0.00017796492,0.00021109928,0.00026563092],"domain_scores_gemma":[0.99588495,0.002845756,0.00043087342,0.000091673304,0.00052277854,0.00022396192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023228277,0.0010061312,0.0010598031,0.0005729232,0.00059049705,0.0011969643,0.0011297787,0.0013442066,0.001952652],"category_scores_gemma":[0.006588392,0.00056823,0.0008945598,0.0004601596,0.0013490256,0.000832196,0.0013761229,0.0014796582,0.000100292506],"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.00004699228,0.000045044366,0.00028855802,0.000028698314,0.000014075532,0.000040818493,0.000038922724,0.9832274,0.00066889165,0.0108678695,0.00017668662,0.004556095],"study_design_scores_gemma":[0.000012787762,0.00003577753,0.00006403559,0.0000023187101,0.0000050430567,0.0000031199927,0.000011769273,0.99623555,0.00013713633,0.0033824712,0.000106420215,0.00000362941],"about_ca_topic_score_codex":0.013649003,"about_ca_topic_score_gemma":0.0048904642,"teacher_disagreement_score":0.013649003,"about_ca_system_score_codex":0.0021166399,"about_ca_system_score_gemma":0.0021802639,"threshold_uncertainty_score":0.027139127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056620367,0.00030686543,0.9312581,0.00037860926,0.00030631426,0.00018820287,0.00024047836,0.0021089306,0.008592189],"genre_scores_gemma":[0.8607236,0.00015799257,0.13186258,0.00013629114,0.00016617545,0.00009225711,0.0002864586,0.00014271942,0.0064318874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989617,0.000173484,0.0000425269,0.0001704621,0.00041248783,0.0002392753],"domain_scores_gemma":[0.9978461,0.0006329024,0.00017869903,0.0005192363,0.00061948365,0.00020359317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434092,0.0004534169,0.0006419326,0.0005512572,0.00068598415,0.0015762451,0.0020810666,0.00064396294,0.0050394544],"category_scores_gemma":[0.004389095,0.000355233,0.0004415544,0.0009969415,0.00040285892,0.0013607776,0.00086501363,0.0011635466,0.0008892878],"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.0023785299,0.0007538856,0.005079169,0.00029178552,0.00015599575,0.00037841717,0.00027159194,0.28858414,0.05110255,0.20319536,0.019502897,0.42830575],"study_design_scores_gemma":[0.000090257796,0.00023873242,0.0006939177,0.000008418196,0.000026658101,0.000116316834,0.000021326785,0.94070935,0.0065781465,0.04685688,0.0046350756,0.000024898512],"about_ca_topic_score_codex":0.0019392789,"about_ca_topic_score_gemma":0.002722167,"teacher_disagreement_score":0.0050394544,"about_ca_system_score_codex":0.0010167869,"about_ca_system_score_gemma":0.0015023499,"threshold_uncertainty_score":0.016858637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06391659,0.0013120605,0.9083289,0.0029993954,0.00009514466,0.00024427002,0.0005105832,0.0004670183,0.022126164],"genre_scores_gemma":[0.8788764,0.001185751,0.10793587,0.0004091641,0.0002503069,0.00033947156,0.00026138197,0.00019368283,0.010547939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99104357,0.0048450916,0.0003357371,0.0014823965,0.001040207,0.0012529234],"domain_scores_gemma":[0.94174886,0.045759015,0.0040452587,0.005261524,0.001972191,0.0012131594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014269339,0.0021415886,0.004186132,0.0014317613,0.00094587094,0.004551283,0.0038958052,0.0038626865,0.0043067713],"category_scores_gemma":[0.04936709,0.0022914577,0.0024205798,0.001978385,0.0066961925,0.009204681,0.004439597,0.0068430486,0.0010089418],"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.00073630334,0.00030755528,0.0013214316,0.00056890736,0.00018464716,0.0005677502,0.00039426493,0.3192709,0.0023486987,0.6452332,0.004495604,0.024570845],"study_design_scores_gemma":[0.00014494384,0.00009989242,0.00049466797,0.0000811166,0.000037256832,0.00017734012,0.000051045852,0.39763448,0.0007409336,0.59944814,0.0010335096,0.000056520556],"about_ca_topic_score_codex":0.0021259966,"about_ca_topic_score_gemma":0.0011697927,"teacher_disagreement_score":0.014269339,"about_ca_system_score_codex":0.004758408,"about_ca_system_score_gemma":0.0033895818,"threshold_uncertainty_score":0.07546437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027861016,0.00034159442,0.9660832,0.00034158106,0.000036143156,0.000071642724,0.00005032016,0.00012627068,0.0050881626],"genre_scores_gemma":[0.83267224,0.0003427044,0.16229995,0.00014563804,0.000027154967,0.0002029323,0.0001139707,0.00007910377,0.0041162944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987226,0.00052087684,0.00006930309,0.00027801297,0.00025547962,0.00015364394],"domain_scores_gemma":[0.9979132,0.0012522859,0.00028508558,0.00014127801,0.00027482194,0.0001334011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002706488,0.0011141304,0.0010699324,0.00064291584,0.00033923727,0.00162759,0.0011237272,0.0011906509,0.0034079512],"category_scores_gemma":[0.009157911,0.00062351726,0.000588464,0.0004808948,0.0008224424,0.002006502,0.0013119958,0.0015747157,0.00031542667],"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.00005303078,0.000040049363,0.000435656,0.00003785449,0.00002974834,0.000045131543,0.000057504945,0.937184,0.00089575263,0.03962602,0.00059238734,0.021002956],"study_design_scores_gemma":[0.000010807474,0.000027106942,0.00010311153,0.000014615904,0.0000074109294,0.000014935281,0.000009264607,0.9815169,0.0003331736,0.017353995,0.0006020695,0.0000065961017],"about_ca_topic_score_codex":0.0028463358,"about_ca_topic_score_gemma":0.0016317276,"teacher_disagreement_score":0.0034079512,"about_ca_system_score_codex":0.001670445,"about_ca_system_score_gemma":0.0015156745,"threshold_uncertainty_score":0.0143134},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053512458,0.0005748554,0.93956405,0.0008383371,0.000086688524,0.00011870089,0.00006948454,0.00033060947,0.0049048224],"genre_scores_gemma":[0.9262775,0.0003335255,0.06901416,0.00040158333,0.00008652087,0.00026940648,0.00011222791,0.00009001621,0.0034150828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974148,0.0013189595,0.00012328013,0.00040201715,0.00036336403,0.0003774621],"domain_scores_gemma":[0.9848999,0.012211841,0.00092129846,0.00062476133,0.00081758894,0.0005245902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004613654,0.002018967,0.002519536,0.00067944324,0.00083763327,0.0018178619,0.0021030207,0.0021203917,0.001951915],"category_scores_gemma":[0.022417178,0.00089300657,0.0007585363,0.0005797692,0.0024613172,0.0028252418,0.0022289387,0.0028406708,0.0003863854],"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.0002587279,0.00016613884,0.0008531098,0.00011633743,0.00007123667,0.00008970367,0.00008987767,0.9365904,0.0005468879,0.043875933,0.0009715773,0.016370112],"study_design_scores_gemma":[0.000013540649,0.000028538227,0.00004839188,0.0000072546613,0.0000049704786,0.000007422247,0.000006374155,0.98789716,0.00015459742,0.011739009,0.000087490436,0.000005192352],"about_ca_topic_score_codex":0.004260211,"about_ca_topic_score_gemma":0.0032371047,"teacher_disagreement_score":0.004613654,"about_ca_system_score_codex":0.0018408666,"about_ca_system_score_gemma":0.0022836416,"threshold_uncertainty_score":0.024399638},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00914151,0.0003833669,0.98361754,0.00023081692,0.00011224503,0.00021168208,0.00026705177,0.0013328048,0.0047028624],"genre_scores_gemma":[0.9027455,0.00047413196,0.090665124,0.00022568107,0.00012002588,0.0004208285,0.00049879606,0.00016103892,0.004688954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651504,0.0007602701,0.00018490621,0.0010021363,0.0011523116,0.0003852898],"domain_scores_gemma":[0.9941302,0.0029032947,0.00077628205,0.0004113824,0.0015297873,0.00024906316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031849155,0.0019603746,0.0013772125,0.0009829851,0.0006781061,0.0030448313,0.0020467872,0.0013372564,0.0058989823],"category_scores_gemma":[0.0109432405,0.00046416768,0.0006165501,0.0008504219,0.0012584716,0.0015147879,0.0011118932,0.0019385407,0.0008271036],"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.0006113989,0.00012240474,0.0010297683,0.00017993122,0.0000579718,0.00022147434,0.000103014885,0.8455741,0.0046826196,0.049327478,0.0043589934,0.09373083],"study_design_scores_gemma":[0.000042424734,0.00007139207,0.0001829906,0.000014670378,0.000014886985,0.000024751507,0.0000065886065,0.9878347,0.0019469059,0.008416399,0.0014240046,0.000020287604],"about_ca_topic_score_codex":0.008368502,"about_ca_topic_score_gemma":0.0033295727,"teacher_disagreement_score":0.008368502,"about_ca_system_score_codex":0.001528919,"about_ca_system_score_gemma":0.0024307577,"threshold_uncertainty_score":0.019734085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022503065,0.0005167106,0.9589459,0.0017447751,0.00027924203,0.00011467099,0.00013358652,0.0002504401,0.015511574],"genre_scores_gemma":[0.8881082,0.0004812132,0.0999378,0.0007222144,0.00045205108,0.00014166706,0.00014064948,0.0001331908,0.009883016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946569,0.0021100063,0.00022592784,0.00113632,0.0011872776,0.00068368274],"domain_scores_gemma":[0.9873527,0.008528164,0.0007862861,0.0018797709,0.0009322084,0.0005209071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005592908,0.0011805648,0.0015130817,0.0005495245,0.0010944366,0.0035776328,0.0026940037,0.0021037362,0.0073530064],"category_scores_gemma":[0.032827985,0.0006598397,0.00074836414,0.00096958474,0.0018448585,0.005527223,0.0026739785,0.0033475556,0.0009131043],"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.00028257456,0.00022222269,0.001649342,0.00012481288,0.000074578595,0.00015029903,0.00014189506,0.38234615,0.0018181666,0.5233078,0.0066713556,0.0832108],"study_design_scores_gemma":[0.000040001003,0.000053688294,0.0001957828,0.000016382422,0.000015030849,0.00007404238,0.00001739563,0.776841,0.00053576514,0.21861814,0.0035760058,0.000016746166],"about_ca_topic_score_codex":0.0016592023,"about_ca_topic_score_gemma":0.001408694,"teacher_disagreement_score":0.0073530064,"about_ca_system_score_codex":0.0021866236,"about_ca_system_score_gemma":0.0021091748,"threshold_uncertainty_score":0.029578507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29305694,0.002366924,0.68078965,0.0036376135,0.00033021055,0.0008626805,0.0013988111,0.0004898642,0.017067274],"genre_scores_gemma":[0.884664,0.0010438083,0.10354182,0.00030515358,0.00016366265,0.00038073727,0.0009175948,0.00010830282,0.008874871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868137,0.0004768662,0.00009558572,0.00028716752,0.00014265352,0.00031636909],"domain_scores_gemma":[0.9961015,0.0028524306,0.00029505882,0.00015189759,0.0002222256,0.00037692697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019511479,0.0016398872,0.0029333043,0.00088421453,0.0010557208,0.0028525125,0.0021316144,0.0028364598,0.006674692],"category_scores_gemma":[0.005340725,0.0011043303,0.0015049694,0.0018004932,0.0010217363,0.0039480557,0.001239806,0.0023696846,0.000547437],"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.0007586295,0.0003995244,0.0011276866,0.00036098962,0.00012980563,0.0005311879,0.00015140226,0.93029815,0.0019065287,0.030688537,0.0047764718,0.028871212],"study_design_scores_gemma":[0.00009173381,0.00012880907,0.00026441884,0.000020947244,0.000027595855,0.00006430956,0.000074633914,0.9867466,0.0006658046,0.010980387,0.00091509207,0.000019764931],"about_ca_topic_score_codex":0.0074711796,"about_ca_topic_score_gemma":0.0042038783,"teacher_disagreement_score":0.0074711796,"about_ca_system_score_codex":0.001751132,"about_ca_system_score_gemma":0.001660057,"threshold_uncertainty_score":0.022329032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5902145,0.0012724914,0.15870808,0.028038085,0.0010028575,0.0006763744,0.0010346742,0.0021586563,0.21689437],"genre_scores_gemma":[0.9880701,0.00012809006,0.00706798,0.0006990563,0.0001455065,0.00004560211,0.00009928286,0.00007287808,0.0036716973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9658558,0.015101292,0.0013794736,0.0035664958,0.0074197734,0.006677219],"domain_scores_gemma":[0.910922,0.052454565,0.011846475,0.013325818,0.0063573555,0.005093828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03237875,0.0012197166,0.001496042,0.00090319157,0.001924623,0.00787452,0.0021822222,0.0040343455,0.009072892],"category_scores_gemma":[0.10662276,0.00054161524,0.00080681214,0.0010963592,0.0029295997,0.010408756,0.0033091293,0.0046509956,0.0018865959],"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.006881913,0.0015110871,0.029314773,0.000470223,0.00035655563,0.00082518044,0.0014842196,0.28326985,0.0109183835,0.49621496,0.027873132,0.14087977],"study_design_scores_gemma":[0.00042368632,0.0035698845,0.016062204,0.00026569297,0.00019703073,0.0009254693,0.002890002,0.50991607,0.023850728,0.41354635,0.028017204,0.00033562692],"about_ca_topic_score_codex":0.0031554878,"about_ca_topic_score_gemma":0.0014507385,"teacher_disagreement_score":0.03237875,"about_ca_system_score_codex":0.0041069873,"about_ca_system_score_gemma":0.007625214,"threshold_uncertainty_score":0.17123723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4449232,0.00033363426,0.52844656,0.0013099735,0.0001736875,0.0002443126,0.00011210729,0.00068337156,0.023773126],"genre_scores_gemma":[0.9758917,0.00007720541,0.021516677,0.000050769188,0.000023234874,0.000018466655,0.000020872107,0.00002557855,0.002375442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959666,0.0001459018,0.000012655734,0.000067773864,0.0000949134,0.00008212753],"domain_scores_gemma":[0.9992537,0.00038583943,0.00010400506,0.000084111074,0.00007231554,0.00010004873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068505283,0.00039565982,0.00037027447,0.000375573,0.0004666572,0.0011440227,0.0011238267,0.00075219397,0.004551814],"category_scores_gemma":[0.0019323492,0.0002405025,0.00038612855,0.00045367176,0.00038931705,0.0014075689,0.00070586253,0.0009957406,0.00026106634],"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.00078859134,0.0014100907,0.004236538,0.00017008737,0.00007543645,0.00036359814,0.00021160107,0.6877516,0.018011348,0.05610893,0.005683701,0.22518852],"study_design_scores_gemma":[0.000021433174,0.00020723,0.00083481043,0.000005130743,0.000019790372,0.00004723244,0.00004333404,0.9856667,0.0025001657,0.008900892,0.0017356626,0.000017680995],"about_ca_topic_score_codex":0.0017588749,"about_ca_topic_score_gemma":0.0021980603,"teacher_disagreement_score":0.004551814,"about_ca_system_score_codex":0.0010289086,"about_ca_system_score_gemma":0.0006863016,"threshold_uncertainty_score":0.015227377},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21682705,0.00049888226,0.77615964,0.0007798831,0.000048558777,0.000106532076,0.00020621101,0.00027444723,0.005098783],"genre_scores_gemma":[0.98707354,0.00013065079,0.011386185,0.000031479725,0.000012848211,0.00006284604,0.00006211386,0.000019737889,0.0012205881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985079,0.000619872,0.00006305815,0.00022920636,0.00025342827,0.00032643467],"domain_scores_gemma":[0.99367464,0.0047925655,0.00072784134,0.0001813284,0.00036556373,0.00025818704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028929366,0.0008990587,0.0011462338,0.0005683703,0.0003281732,0.0013697983,0.0008180747,0.0009813523,0.0016067061],"category_scores_gemma":[0.009159399,0.0005294371,0.0005504387,0.00053782895,0.0017975654,0.0010933101,0.0010185,0.0010234041,0.00013049364],"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.00011028913,0.000029192457,0.0005549249,0.000031159758,0.00001756823,0.000045882756,0.00003084594,0.97984844,0.000764374,0.0146761555,0.00017489237,0.0037162802],"study_design_scores_gemma":[0.0000101766855,0.000023807475,0.00019584569,0.0000034703833,0.0000039271226,0.000004259316,0.000005771269,0.99405515,0.00027065494,0.005372716,0.000050333703,0.000003887342],"about_ca_topic_score_codex":0.008055039,"about_ca_topic_score_gemma":0.0034669654,"teacher_disagreement_score":0.008055039,"about_ca_system_score_codex":0.001733028,"about_ca_system_score_gemma":0.0016565346,"threshold_uncertainty_score":0.016016304},"labels":[],"label_agreement":null}]}