{"meta":{"query_hash":"a689e6b5b14a","filters":{"venue":"Mathematics of Operations Research"},"cohort_total":141,"direct_labels_cover":0,"predictions_cover":141,"exported":141,"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/a689e6b5b14a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematics+of+Operations+Research"},"results":[{"id":"W1614173561","doi":"10.1287/moor.2014.0706","title":"Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Mathematics; Euclidean minimum spanning tree; Spanning tree; Minimum spanning tree; Combinatorics; Euclidean geometry; Minimum weight; Discrete mathematics; Shortest path problem; Subadditivity; Euclidean shortest path; Limit (mathematics); Shortest-path tree; Minimum degree spanning tree; Graph; Longest path problem; Geometry; Mathematical analysis","score_opus":0.1421796790829535,"score_gpt":0.36571574975285154,"score_spread":0.22353607066989803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614173561","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.08884427,0.0022833275,0.88781625,0.0016000506,0.0001160784,0.00006488182,0.00034819142,0.00023674012,0.018690279],"genre_scores_gemma":[0.80825716,0.0036286837,0.16495684,0.00076518394,0.0004688138,0.0005064066,0.0007240517,0.00029798993,0.020394795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882334,0.00041804832,0.00006358346,0.00029498094,0.00023284274,0.00016709857],"domain_scores_gemma":[0.9922855,0.004836227,0.0009901305,0.00045900993,0.0007723067,0.0006568737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277894,0.00081001635,0.0012192944,0.0024216035,0.0012644497,0.0024375904,0.0028280886,0.0019009318,0.0057673897],"category_scores_gemma":[0.016322525,0.00063334964,0.0013925477,0.001478383,0.002546804,0.008438969,0.0026756653,0.0026669113,0.0007898126],"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.000037373964,0.00002118768,0.00046771776,0.00008330082,0.000024546702,0.000090682894,0.000113888804,0.0405123,0.0007611255,0.9492763,0.0014860064,0.0071256305],"study_design_scores_gemma":[0.000019729527,0.000057204543,0.00040846257,0.00004611803,0.000020052514,0.00016102103,0.000073802046,0.26152116,0.00041126474,0.73436415,0.002891238,0.00002576513],"about_ca_topic_score_codex":0.0016371679,"about_ca_topic_score_gemma":0.0015959366,"teacher_disagreement_score":0.0057673897,"about_ca_system_score_codex":0.0021215363,"about_ca_system_score_gemma":0.0006552525,"threshold_uncertainty_score":0.019293785},"labels":[],"label_agreement":null},{"id":"W1683881076","doi":"10.1287/moor.2016.0815","title":"Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Mathematics; Convexity; Combinatorics; Finite set; Monotone polygon; Discrete mathematics; Regular polygon; Mathematical analysis","score_opus":0.11030769931766725,"score_gpt":0.4258984505532524,"score_spread":0.3155907512355851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683881076","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.4087948,0.0027231965,0.5034471,0.0024898953,0.00026080853,0.00010965213,0.00065369083,0.00016915808,0.08135164],"genre_scores_gemma":[0.8998335,0.0011439907,0.08955784,0.00022133016,0.00036099038,0.0001750774,0.00036081416,0.000087948,0.0082585085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850637,0.0004320313,0.00009296172,0.00038197832,0.00039605438,0.0001906574],"domain_scores_gemma":[0.9922053,0.0050959717,0.0009408,0.0005863456,0.00063093024,0.0005406735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024645692,0.0005872418,0.00079109264,0.0032155334,0.0015541398,0.0037297388,0.0009008921,0.0007174945,0.007034268],"category_scores_gemma":[0.010419311,0.00038603524,0.001213426,0.0016878543,0.0054913466,0.008328147,0.0018730805,0.0031187704,0.000735324],"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.000015900736,0.000009226868,0.00035854772,0.000022060727,0.0000045870606,0.000019350908,0.00009812237,0.0014392764,0.00039486034,0.9926577,0.00034564317,0.0046346523],"study_design_scores_gemma":[0.0000069811886,0.000024064128,0.0005857209,0.000016684671,0.000006355882,0.00008520441,0.000097755365,0.014529437,0.00094256445,0.98085314,0.0028318265,0.00002023699],"about_ca_topic_score_codex":0.00068779016,"about_ca_topic_score_gemma":0.00058132515,"teacher_disagreement_score":0.007034268,"about_ca_system_score_codex":0.0025568472,"about_ca_system_score_gemma":0.00074290636,"threshold_uncertainty_score":0.023531973},"labels":[],"label_agreement":null},{"id":"W1822084430","doi":"10.1287/moor.2014.0709","title":"Analogy in Decision Making","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Decision-Making and Behavioral Economics","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":"Université de Montréal","funders":"","keywords":"Analogy; Generality; Mathematics; Preference; Mathematical economics; Operator (biology); Artificial intelligence; Computer science; Epistemology","score_opus":0.6559170799496467,"score_gpt":0.6101930257580186,"score_spread":0.04572405419162806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822084430","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.013640777,0.014665251,0.84522784,0.008678013,0.0008825476,0.0001733152,0.00020662736,0.00012362734,0.11640206],"genre_scores_gemma":[0.6655249,0.011150461,0.3024205,0.0030245744,0.0020894527,0.0007833714,0.0002841199,0.00009907017,0.014623485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991478,0.004968941,0.0005036624,0.00115986,0.0015538073,0.0003357368],"domain_scores_gemma":[0.99123925,0.0067259613,0.0005152868,0.0007069566,0.0005506259,0.00026190595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006910658,0.0014896656,0.001499146,0.0025282346,0.0019342888,0.005130975,0.0017055414,0.003056227,0.009079025],"category_scores_gemma":[0.012976347,0.0005427294,0.0021964083,0.0034775266,0.010106187,0.009156812,0.0036569836,0.0049597593,0.0011482801],"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.000004626353,0.0000080977115,0.000050747767,0.000055551376,0.000011722497,0.0000194844,0.00009368383,0.0022398534,0.00004141272,0.9935108,0.00038019434,0.0035838066],"study_design_scores_gemma":[0.0000043093805,0.000008723721,0.00002868864,0.000021952212,0.0000033679962,0.000017606159,0.000026738944,0.0035373452,0.000028725412,0.99240816,0.0039101667,0.0000040960786],"about_ca_topic_score_codex":0.0013197786,"about_ca_topic_score_gemma":0.00086214475,"teacher_disagreement_score":0.009079025,"about_ca_system_score_codex":0.003962673,"about_ca_system_score_gemma":0.0016011709,"threshold_uncertainty_score":0.036547482},"labels":[],"label_agreement":null},{"id":"W1933568734","doi":"10.1287/moor.2015.0759","title":"On the Range of the Douglas–Rachford Operator","year":2016,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Operator (biology); Subderivative; Range (aeronautics); Monotonic function; Simple (philosophy); Set (abstract data type); Regular polygon; Variational analysis; Pure mathematics; Displacement (psychology); Applied mathematics; Mathematical analysis; Convex optimization; Computer science; Geometry","score_opus":0.12008832773670826,"score_gpt":0.3791236926928256,"score_spread":0.25903536495611734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933568734","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.3377586,0.0076357666,0.5432878,0.003071491,0.0001802566,0.00004391558,0.00017279864,0.00022157417,0.107627876],"genre_scores_gemma":[0.9463241,0.0018424446,0.043204278,0.0003392719,0.00021588276,0.000065035485,0.000088766574,0.00010882091,0.007811333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988631,0.00040327973,0.000047059093,0.00018573542,0.0003692096,0.00013161512],"domain_scores_gemma":[0.9968245,0.0022159554,0.00020841883,0.00014982867,0.00037676716,0.00022451188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029572798,0.0005066485,0.0006569871,0.0013676612,0.00089064165,0.0018000853,0.0007735537,0.00093549944,0.002549394],"category_scores_gemma":[0.0068471846,0.00033403933,0.00057178986,0.0005835284,0.0032763118,0.00313611,0.0022229902,0.0020251116,0.00040986686],"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.00003405897,0.000010776606,0.0003201145,0.000047263566,0.0000061866604,0.00009679254,0.0001797338,0.0056062303,0.0031962828,0.98349553,0.0004918752,0.0065151546],"study_design_scores_gemma":[0.000014451111,0.000054114334,0.00042893147,0.00005225071,0.000007850522,0.00019958089,0.00015351202,0.055942163,0.002121355,0.93756044,0.0034386113,0.000026790045],"about_ca_topic_score_codex":0.0006593566,"about_ca_topic_score_gemma":0.00032938216,"teacher_disagreement_score":0.0029572798,"about_ca_system_score_codex":0.0008157778,"about_ca_system_score_gemma":0.00053401216,"threshold_uncertainty_score":0.015639782},"labels":[],"label_agreement":null},{"id":"W1964265873","doi":"10.1287/moor.1110.0509","title":"An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"Simon Fraser University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quadratic assignment problem; Linearization; Mathematical optimization; Matrix (chemical analysis); Assignment problem; Function (biology); Combinatorics; Algorithm; Optimization problem; Nonlinear system","score_opus":0.08683230206189134,"score_gpt":0.3337473374116076,"score_spread":0.24691503534971626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964265873","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.013359512,0.0002329358,0.9679976,0.0010385645,0.00008879727,0.0006853334,0.0003589993,0.0050218087,0.011216546],"genre_scores_gemma":[0.12533662,0.00016371012,0.8658933,0.00040620862,0.00007506154,0.0009321866,0.0012809812,0.00059768965,0.0053142514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987184,0.00024743724,0.00010032726,0.0003802474,0.00026046348,0.00029306408],"domain_scores_gemma":[0.998201,0.00087503676,0.0002399522,0.0003820952,0.00020009161,0.00010178963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012514049,0.0015306175,0.0010967562,0.0009514445,0.00092794275,0.0016572396,0.0026626736,0.0017884567,0.018195935],"category_scores_gemma":[0.004396682,0.0007064043,0.0016040518,0.0011358124,0.0010579625,0.0026493424,0.0027315551,0.0030347477,0.0051039355],"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.0014489936,0.0013156378,0.0020279088,0.0010650846,0.00019253157,0.00039326286,0.0004995008,0.21057296,0.024954263,0.050939336,0.055786952,0.6508035],"study_design_scores_gemma":[0.00079603266,0.00043622652,0.0010028479,0.0001108959,0.00010840141,0.00045298217,0.00033273784,0.8793027,0.01652019,0.084567204,0.016296118,0.0000736834],"about_ca_topic_score_codex":0.0031035997,"about_ca_topic_score_gemma":0.0051522,"teacher_disagreement_score":0.018195935,"about_ca_system_score_codex":0.0017023667,"about_ca_system_score_gemma":0.0032891722,"threshold_uncertainty_score":0.060871422},"labels":[],"label_agreement":null},{"id":"W1970058257","doi":"10.1287/moor.1040.0096","title":"Arbitrage in a Discrete Version of the Wick-Fractional Black-Scholes Market","year":2004,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":28,"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":"Mathematics; Arbitrage; Fractional Brownian motion; Black–Scholes model; Hurst exponent; Mathematical economics; Class (philosophy); Applied mathematics; Brownian motion; Econometrics; Finance; Economics; Volatility (finance); Computer science; Statistics","score_opus":0.05043644441289889,"score_gpt":0.3133080381157297,"score_spread":0.2628715937028308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970058257","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.44090557,0.0011854778,0.5411923,0.0013431418,0.00031145924,0.00005337798,0.00015226171,0.0002083107,0.014648243],"genre_scores_gemma":[0.97818106,0.00032267766,0.016684275,0.00012336801,0.00018050155,0.000035559475,0.00006160726,0.000028011082,0.0043829894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870086,0.00045224026,0.00007948786,0.00022921874,0.00030958714,0.00022854011],"domain_scores_gemma":[0.9972996,0.0009987486,0.0007350508,0.000245965,0.00024030115,0.00048035826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00271246,0.0007171934,0.0012903141,0.0009260675,0.00061830843,0.0027037326,0.0013078693,0.0015759959,0.0026473287],"category_scores_gemma":[0.007424868,0.00041582045,0.0011748335,0.00055781973,0.0030451412,0.0052383966,0.0013933191,0.001802425,0.00027874095],"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.000076094606,0.00005286364,0.0005273776,0.000045281053,0.000034223867,0.00023016152,0.00007487809,0.040611517,0.002011013,0.9537962,0.00040947075,0.0021309594],"study_design_scores_gemma":[0.000050267205,0.000049982493,0.00025996898,0.000010488666,0.000021448199,0.000106421765,0.000022068298,0.66359496,0.0006179712,0.33459547,0.0006367182,0.000034220135],"about_ca_topic_score_codex":0.0017658646,"about_ca_topic_score_gemma":0.0008129997,"teacher_disagreement_score":0.00271246,"about_ca_system_score_codex":0.0009382009,"about_ca_system_score_gemma":0.00078724796,"threshold_uncertainty_score":0.01434505},"labels":[],"label_agreement":null},{"id":"W1971938577","doi":"10.1287/moor.2013.0597","title":"An Approximation Algorithm for the Bipartite Traveling Tournament Problem","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Timetabling Solutions","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":"Quest University Canada","funders":"","keywords":"Tournament; Bipartite graph; Travelling salesman problem; Mathematics; Schedule; Approximation algorithm; Scheduling (production processes); Mathematical optimization; Combinatorics; League; Sequence (biology); Computer science; Graph","score_opus":0.3518717323001682,"score_gpt":0.5090074774307536,"score_spread":0.15713574513058537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971938577","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.03592926,0.0006044573,0.9411748,0.0012403765,0.00019587761,0.0003459706,0.00075773936,0.0032577969,0.016493691],"genre_scores_gemma":[0.27954185,0.000499461,0.70986885,0.00039608518,0.00014898663,0.0005641536,0.0026237157,0.00044352308,0.00591337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804074,0.00043587797,0.0001031546,0.00048748555,0.00047466822,0.00045805037],"domain_scores_gemma":[0.99808073,0.00095278886,0.00017071392,0.0004219317,0.00021621319,0.00015763045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013648928,0.00167081,0.001447752,0.0009680257,0.0012630546,0.0021656177,0.0026608456,0.0017971395,0.010325068],"category_scores_gemma":[0.0061506946,0.0006519262,0.001499183,0.0023937433,0.00067360187,0.002764468,0.0017460171,0.002189919,0.0023597495],"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.00079583004,0.00065601006,0.0017768405,0.00045733093,0.00015148308,0.00023176138,0.00034525906,0.60520047,0.0055193976,0.061316777,0.034880392,0.2886684],"study_design_scores_gemma":[0.00017980378,0.00011549506,0.0002752999,0.00002298093,0.000033282788,0.00015552368,0.00007705643,0.9588092,0.0008230326,0.034232315,0.005259041,0.00001702893],"about_ca_topic_score_codex":0.008182343,"about_ca_topic_score_gemma":0.009087175,"teacher_disagreement_score":0.010325068,"about_ca_system_score_codex":0.0028811123,"about_ca_system_score_gemma":0.0037440243,"threshold_uncertainty_score":0.034540832},"labels":[],"label_agreement":null},{"id":"W1982112521","doi":"10.1287/moor.1110.0515","title":"A Polynomial Time <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","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":"Western University","funders":"","keywords":"Mathematics; Bin packing problem; Bin; Constant (computer programming); Time complexity; Combinatorics; Cutting stock problem; Object (grammar); Integer (computer science); Mathematical optimization; Algorithm; Discrete mathematics; Optimization problem; Computer science; Artificial intelligence","score_opus":0.06488040621657191,"score_gpt":0.32069476667941305,"score_spread":0.2558143604628411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982112521","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.03861296,0.0009258963,0.9137922,0.002473542,0.00030031402,0.0008888613,0.0011993375,0.009262518,0.032544408],"genre_scores_gemma":[0.10469173,0.00031491253,0.88295335,0.0005816348,0.00013119116,0.0005543914,0.0015297767,0.00094462367,0.008298407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978211,0.0003220219,0.00014789822,0.0007393116,0.00048493865,0.00048478742],"domain_scores_gemma":[0.9980135,0.0010095865,0.00026171163,0.00041860662,0.00016512054,0.00013137415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017664109,0.0022154662,0.0017938253,0.0011253796,0.0015057864,0.0034300897,0.0043990538,0.003233837,0.015737073],"category_scores_gemma":[0.0044365698,0.0011651175,0.0018095676,0.0028454007,0.0013059668,0.0054807765,0.0021762922,0.003459499,0.0056284796],"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.0014228137,0.0012044717,0.0015374765,0.0012517221,0.00016834142,0.00022833161,0.0003693711,0.14839722,0.023521641,0.05210627,0.06312743,0.7066649],"study_design_scores_gemma":[0.0018379306,0.0008075308,0.0018089815,0.0001649739,0.00022072223,0.0010464547,0.00028872024,0.8026857,0.018606056,0.14141591,0.030970583,0.00014653477],"about_ca_topic_score_codex":0.005962049,"about_ca_topic_score_gemma":0.00787857,"teacher_disagreement_score":0.015737073,"about_ca_system_score_codex":0.0044607352,"about_ca_system_score_gemma":0.0056785815,"threshold_uncertainty_score":0.052645802},"labels":[],"label_agreement":null},{"id":"W1987292194","doi":"10.1287/moor.2014.0663","title":"Partial Monitoring—Classification, Regret Bounds, and Algorithms","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":123,"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":"Regret; Hindsight bias; Logarithm; Minimax; Mathematics; Outcome (game theory); Action (physics); Mathematical optimization; Mathematical economics; Statistics; Psychology","score_opus":0.43992274550270394,"score_gpt":0.5509132329952277,"score_spread":0.11099048749252372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987292194","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.02582207,0.0050172564,0.95231384,0.0037233755,0.00018449254,0.00016414443,0.00045066964,0.0006333352,0.011690786],"genre_scores_gemma":[0.6856772,0.0050268555,0.29094887,0.0017172091,0.0014989409,0.0011403108,0.0012065856,0.00048356465,0.012300485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913235,0.003989917,0.00037192105,0.0016241622,0.001770831,0.00091973646],"domain_scores_gemma":[0.9554811,0.035094652,0.003069885,0.0037954864,0.0014880032,0.0010708388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011444367,0.002626846,0.0034250356,0.0015939882,0.0014332017,0.0048514213,0.004305751,0.0032178222,0.0049651326],"category_scores_gemma":[0.05788539,0.001160502,0.0016546038,0.0026800628,0.0040021366,0.009273909,0.004386414,0.006341457,0.00094651594],"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.0005835444,0.0003523251,0.003884411,0.00045774542,0.00019851797,0.000099326695,0.00022145119,0.55419147,0.0010015725,0.322349,0.010395774,0.10626486],"study_design_scores_gemma":[0.000032909404,0.00006994815,0.00039501814,0.000053720796,0.000024690915,0.00005182118,0.000018350971,0.75265044,0.0003491156,0.245223,0.0011146622,0.000016382886],"about_ca_topic_score_codex":0.0022412476,"about_ca_topic_score_gemma":0.0016677076,"teacher_disagreement_score":0.011444367,"about_ca_system_score_codex":0.0044873473,"about_ca_system_score_gemma":0.0025551247,"threshold_uncertainty_score":0.060524285},"labels":[],"label_agreement":null},{"id":"W1998039896","doi":"10.1287/moor.1080.0371","title":"Partially Observed Markov Decision Process Multiarmed Bandits—Structural Results","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Markov decision process; Mathematics; Monotone polygon; Mathematical optimization; Partially observable Markov decision process; Markov process; Exploit; Monotonic function; Markov chain; Scheduling (production processes); Computer science; Statistics","score_opus":0.083850938900528,"score_gpt":0.3832298800101856,"score_spread":0.29937894110965757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998039896","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.028009519,0.00052623986,0.9628481,0.0007686306,0.000045324712,0.00004065028,0.000094448944,0.000100544225,0.0075665456],"genre_scores_gemma":[0.8557331,0.0011426018,0.13586888,0.000251946,0.00013083684,0.0003022398,0.0002507965,0.00009251461,0.006227074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983494,0.0007455974,0.00005923864,0.00024502623,0.0003607933,0.00023988607],"domain_scores_gemma":[0.9912509,0.0066569676,0.00088266423,0.00048065037,0.0004504632,0.00027840718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031756882,0.0010444293,0.0015165312,0.0008318096,0.00095379207,0.0024216855,0.0015446395,0.0018373069,0.004188333],"category_scores_gemma":[0.014176084,0.0008345696,0.0009576748,0.0010722787,0.0024636034,0.0036330617,0.0018495093,0.00308052,0.00070801674],"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.00007855062,0.000051896117,0.00055594667,0.00007147601,0.000028237853,0.00006929662,0.00008689754,0.53233314,0.0005898037,0.4546331,0.0006988066,0.010802869],"study_design_scores_gemma":[0.000009657303,0.000016377631,0.000068682144,0.000011230652,0.000004531837,0.000011606393,0.0000107920205,0.8808936,0.00019063569,0.11846593,0.00031019177,0.000006702004],"about_ca_topic_score_codex":0.0019388692,"about_ca_topic_score_gemma":0.0015014532,"teacher_disagreement_score":0.004188333,"about_ca_system_score_codex":0.001875415,"about_ca_system_score_gemma":0.0014654401,"threshold_uncertainty_score":0.01679486},"labels":[],"label_agreement":null},{"id":"W2006228567","doi":"10.1287/moor.25.1.76.15208","title":"Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Mathematics; Minimum-cost flow problem; Flow (mathematics); Algorithm; Mathematical optimization; Flow network; Geometry","score_opus":0.08106170843672988,"score_gpt":0.37544963839231127,"score_spread":0.2943879299555814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006228567","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.0118742855,0.00029564876,0.98104894,0.0002055983,0.00006784556,0.00011944459,0.00007319014,0.000980634,0.005334442],"genre_scores_gemma":[0.12671989,0.00032463722,0.8671579,0.0002474188,0.0001408938,0.0003136535,0.00044991198,0.000591935,0.0040538637],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774206,0.0006238528,0.00016131903,0.0003602356,0.0009014066,0.00021115347],"domain_scores_gemma":[0.99664176,0.0015064979,0.00029103295,0.000828404,0.00056833925,0.00016393492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021754839,0.0013948339,0.0011578089,0.001555556,0.001004837,0.001366647,0.0023369784,0.000899371,0.007226764],"category_scores_gemma":[0.007932363,0.0005398351,0.0012307069,0.0019215561,0.0012157607,0.003481379,0.0020314008,0.0022845003,0.0011001811],"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.00037151,0.00022695464,0.0010841179,0.00028597153,0.00005905533,0.00006592228,0.00023259867,0.15966298,0.0084449025,0.18113646,0.010773248,0.63765633],"study_design_scores_gemma":[0.00012682217,0.00017329262,0.0005259626,0.000041312916,0.000047901292,0.0001757589,0.00006984769,0.79136944,0.009946956,0.1791188,0.018351587,0.000052260588],"about_ca_topic_score_codex":0.0022365437,"about_ca_topic_score_gemma":0.0023861092,"teacher_disagreement_score":0.007226764,"about_ca_system_score_codex":0.0013900237,"about_ca_system_score_gemma":0.0015370563,"threshold_uncertainty_score":0.024175942},"labels":[],"label_agreement":null},{"id":"W2008297046","doi":"10.1287/moor.1090.0409","title":"Fluid Limits for Shortest Remaining Processing Time Queues","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":72,"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":"Mathematics; Queue; Mathematical optimization; Infimum and supremum; Logarithm; Uniqueness; Applied mathematics; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.09283470670110919,"score_gpt":0.38428325283488635,"score_spread":0.29144854613377713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008297046","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.20215535,0.0023396318,0.77941084,0.0014799823,0.00015875795,0.000066503264,0.00012401775,0.00023962454,0.014025314],"genre_scores_gemma":[0.97042644,0.0010346886,0.022829501,0.00020748794,0.000121871235,0.00013423452,0.000105623054,0.000062512656,0.005077721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998938,0.00023823297,0.000050469975,0.00015592814,0.00040032633,0.00021692786],"domain_scores_gemma":[0.99516124,0.0026027472,0.0008563118,0.00017850024,0.000761945,0.00043929086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015117179,0.00075457856,0.00096606096,0.0015608037,0.000923335,0.0028087266,0.0015558314,0.0012604101,0.0014840375],"category_scores_gemma":[0.01215985,0.00048941304,0.0011103309,0.00075538293,0.0024829535,0.0028086905,0.0021172634,0.0014171745,0.00015466305],"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.00007220207,0.000050107537,0.00079941185,0.00008771908,0.000032652708,0.00024955452,0.00029931695,0.3100672,0.0038788775,0.67938805,0.0005315763,0.0045433603],"study_design_scores_gemma":[0.000011538694,0.000023728011,0.00012601918,0.000013968293,0.000007811732,0.000039930528,0.00003178688,0.8902331,0.0005190747,0.108348735,0.00062753854,0.000016749233],"about_ca_topic_score_codex":0.0063769594,"about_ca_topic_score_gemma":0.0017385854,"teacher_disagreement_score":0.0063769594,"about_ca_system_score_codex":0.0024673971,"about_ca_system_score_gemma":0.0013063865,"threshold_uncertainty_score":0.017902255},"labels":[],"label_agreement":null},{"id":"W2012045703","doi":"10.1287/moor.27.3.545.316","title":"Achieving Target State-Action Frequencies in Multichain Average-Reward Markov Decision Processes","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","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 Toronto","funders":"","keywords":"Markov decision process; Stochastic game; Construct (python library); Mathematics; Action (physics); Mathematical optimization; Markov process; State space; Markov chain; State (computer science); Space (punctuation); Decision problem; Mathematical economics; Computer science; Algorithm; Statistics","score_opus":0.12878878589770923,"score_gpt":0.37332200477531274,"score_spread":0.24453321887760351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012045703","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.2087307,0.00017489302,0.7884183,0.000301561,0.000014141667,0.00006841552,0.000072181225,0.00018416395,0.0020357107],"genre_scores_gemma":[0.89820534,0.0001504529,0.10024232,0.00006252663,0.000013875549,0.00013725519,0.000090234345,0.00003925787,0.0010586558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985216,0.00058386417,0.000078744946,0.00037739964,0.0002367002,0.00020154881],"domain_scores_gemma":[0.99592304,0.0028954926,0.00060643844,0.00015940717,0.00018643642,0.00022916833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030989072,0.0007964407,0.001164758,0.0006363628,0.0007850661,0.0010541255,0.0010127053,0.0012232076,0.0013417241],"category_scores_gemma":[0.007434989,0.0005727917,0.00055462815,0.0007543579,0.0019887555,0.0023764838,0.0014877078,0.0012782217,0.00019101796],"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.0001010164,0.0000684611,0.00069272757,0.000046748253,0.000024719322,0.00007264789,0.00011412214,0.91979825,0.00087418867,0.06785767,0.00013140889,0.010218093],"study_design_scores_gemma":[0.000026203872,0.000046859353,0.00015650681,0.000008673303,0.000006543357,0.000012655363,0.00001698696,0.9389081,0.00054753793,0.060093634,0.00016734634,0.000008917876],"about_ca_topic_score_codex":0.004738723,"about_ca_topic_score_gemma":0.004171516,"teacher_disagreement_score":0.004738723,"about_ca_system_score_codex":0.0017105337,"about_ca_system_score_gemma":0.0016304293,"threshold_uncertainty_score":0.016388774},"labels":[],"label_agreement":null},{"id":"W2014294736","doi":"10.1287/moor.1080.0337","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"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":"Travelling salesman problem; Mathematics; Conjecture; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Graph; Relaxation (psychology); Combinatorial optimization; Metric (unit); Discrete mathematics; Mathematical optimization","score_opus":0.38378126360936615,"score_gpt":0.4339300606441794,"score_spread":0.05014879703481323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014294736","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.5655209,0.0040274607,0.34999338,0.0056743915,0.000295096,0.00019024668,0.0005399194,0.00078986987,0.07296878],"genre_scores_gemma":[0.93391097,0.0011016448,0.059763014,0.00057838194,0.00022036597,0.00021338364,0.00048295074,0.00024599594,0.0034833457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798155,0.00056334166,0.000087002656,0.0004654783,0.00043899543,0.00046361276],"domain_scores_gemma":[0.9777876,0.018462695,0.0010907826,0.0010324382,0.00055300735,0.0010734814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00347508,0.0010951057,0.0016756441,0.0018624726,0.0014308569,0.00304957,0.00283243,0.0016485881,0.0073512495],"category_scores_gemma":[0.028632443,0.00086871575,0.0009512319,0.0014117708,0.003396806,0.009632628,0.0028080747,0.0052268654,0.00055088196],"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.00079827115,0.0005432645,0.0026572368,0.0006288911,0.00011513486,0.00027743864,0.0006921478,0.15526852,0.0055342684,0.7895217,0.006044392,0.0379187],"study_design_scores_gemma":[0.000049993276,0.00008010439,0.0005701035,0.000051568182,0.000027983922,0.0001385855,0.00015906888,0.24883094,0.0015695449,0.74682045,0.0016802625,0.000021311147],"about_ca_topic_score_codex":0.0009313293,"about_ca_topic_score_gemma":0.00073676725,"teacher_disagreement_score":0.0073512495,"about_ca_system_score_codex":0.0023989917,"about_ca_system_score_gemma":0.001433021,"threshold_uncertainty_score":0.0245924},"labels":[],"label_agreement":null},{"id":"W2019408419","doi":"10.1287/moor.1070.0294","title":"Truncation Strategies in Matching Markets","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":78,"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":"Truncation (statistics); Ranking (information retrieval); Matching (statistics); Linear programming; Mathematical economics; Mathematics; Advice (programming); Complete information; Mathematical optimization; Computer science; Statistics; Artificial intelligence","score_opus":0.18420648595213587,"score_gpt":0.3546812017191083,"score_spread":0.1704747157669724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019408419","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.14226773,0.0030547779,0.79764503,0.0038859616,0.00022809983,0.00044358743,0.00027228132,0.0002984542,0.05190401],"genre_scores_gemma":[0.8845861,0.001613106,0.091300204,0.00085741753,0.00023971264,0.00045421987,0.00021327559,0.00008570603,0.02065039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366814,0.0032427937,0.00038927683,0.00070955994,0.0012616311,0.00072857836],"domain_scores_gemma":[0.9856359,0.009596459,0.0012036043,0.0014185555,0.0011999338,0.00094553863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007868844,0.00073029,0.0017714242,0.0014255187,0.0016215723,0.004042612,0.0021548346,0.0033850246,0.0075874245],"category_scores_gemma":[0.029637894,0.00069197925,0.001666549,0.00147583,0.0040623248,0.008803925,0.0031942134,0.002980643,0.0011140301],"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.00005616712,0.000036137033,0.00026923243,0.000045606837,0.00001867833,0.00006677609,0.0002644829,0.007633539,0.00047341795,0.9794292,0.0011983764,0.010508371],"study_design_scores_gemma":[0.000056886143,0.000045918496,0.00010403344,0.00002062873,0.000010759875,0.000056984805,0.00006677165,0.047772266,0.00021151354,0.9496541,0.0019812789,0.000018882114],"about_ca_topic_score_codex":0.001687749,"about_ca_topic_score_gemma":0.00092801655,"teacher_disagreement_score":0.007868844,"about_ca_system_score_codex":0.0025231072,"about_ca_system_score_gemma":0.0017045683,"threshold_uncertainty_score":0.04161489},"labels":[],"label_agreement":null},{"id":"W2031021882","doi":"10.1287/moor.1090.0413","title":"Players' Effects Under Limited Independence","year":2009,"lang":"en","type":"article","venue":"Mathematics of 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":"Kellogg's (Canada)","funders":"","keywords":"Mathematics; Pairwise comparison; Existential quantification; Independence (probability theory); Upper and lower bounds; Set (abstract data type); Function (biology); Pairwise independence; Combinatorics; Mathematical economics; Mathematical optimization; Statistics; Probability distribution; Computer science","score_opus":0.2695529545883986,"score_gpt":0.522169944594265,"score_spread":0.2526169900058664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031021882","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.47291088,0.00060479593,0.4810815,0.0017635539,0.00005533222,0.00025359972,0.0007491945,0.00031855312,0.042262595],"genre_scores_gemma":[0.9770445,0.00027774167,0.015869403,0.00029104357,0.00006880629,0.00024268207,0.0001416454,0.000034093984,0.0060300166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900035,0.0043977224,0.0004960801,0.0019097233,0.0019312857,0.0012617151],"domain_scores_gemma":[0.93595815,0.050339554,0.0043044933,0.0061880983,0.001485689,0.0017240441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011336686,0.0010815009,0.0020978623,0.0008712574,0.0009221033,0.0022095374,0.0022241105,0.0015840431,0.005642612],"category_scores_gemma":[0.032460712,0.0008861514,0.002024281,0.0005697678,0.004899999,0.0046270117,0.004408709,0.0030991812,0.00065815495],"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.00185831,0.0004905,0.011697992,0.0003731435,0.00044209126,0.0009208013,0.00046792615,0.2510378,0.012305936,0.68864584,0.0016557914,0.030103784],"study_design_scores_gemma":[0.0005925432,0.000836591,0.008819169,0.000099797406,0.00062048115,0.0008175727,0.00018927206,0.38079503,0.012777353,0.5904423,0.0038688774,0.00014096337],"about_ca_topic_score_codex":0.0015882272,"about_ca_topic_score_gemma":0.0012868238,"teacher_disagreement_score":0.011336686,"about_ca_system_score_codex":0.0022684282,"about_ca_system_score_gemma":0.001440973,"threshold_uncertainty_score":0.059954822},"labels":[],"label_agreement":null},{"id":"W2036785419","doi":"10.1287/moor.28.1.154.14259","title":"A Generalized Stochastic Differential Utility","year":2003,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of British Columbia","funders":"","keywords":"Isoelastic utility; Stochastic differential equation; Mathematics; Risk aversion (psychology); Expected utility hypothesis; Mathematical economics; Mathematical optimization; Quadratic variation; Monotonic function; Generalization; Portfolio; Econometrics; Brownian motion; Applied mathematics; Economics","score_opus":0.14075063607943772,"score_gpt":0.3447168680473967,"score_spread":0.203966231967959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036785419","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.0319555,0.0013862932,0.91292596,0.003486823,0.00023388358,0.000116839394,0.00046585925,0.00018490899,0.049243983],"genre_scores_gemma":[0.8014544,0.0025406287,0.15594439,0.0010707281,0.00048444906,0.00029191692,0.00043668147,0.000097296026,0.037679423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988469,0.00051264564,0.000057001103,0.00023102121,0.00026481433,0.00008755281],"domain_scores_gemma":[0.99939895,0.00026267747,0.000056896577,0.00008971104,0.00012576891,0.00006591476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015014962,0.00085634895,0.00088430254,0.00067918265,0.0004353645,0.0018523663,0.0011330659,0.0016002846,0.0050875326],"category_scores_gemma":[0.0027717748,0.00029725875,0.001090473,0.0010108318,0.0015294404,0.002470528,0.0015342816,0.0015491061,0.0005581399],"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.0000067657265,0.000013899538,0.00018039571,0.00003519299,0.000017085216,0.00007695914,0.000058201993,0.024117831,0.0005429274,0.96523905,0.0013333571,0.008378294],"study_design_scores_gemma":[0.000014354795,0.00004264578,0.00039928168,0.000030042564,0.000017647608,0.00015432521,0.000034812416,0.19814873,0.000195122,0.78651094,0.014428791,0.000023331886],"about_ca_topic_score_codex":0.0024440077,"about_ca_topic_score_gemma":0.0014382038,"teacher_disagreement_score":0.0050875326,"about_ca_system_score_codex":0.0013882986,"about_ca_system_score_gemma":0.0013437062,"threshold_uncertainty_score":0.01701945},"labels":[],"label_agreement":null},{"id":"W2037284017","doi":"10.1287/moor.1040.0116","title":"An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities","year":2005,"lang":"en","type":"article","venue":"Mathematics of 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":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cutting-plane method; Mathematics; Interior point method; Ball (mathematics); Regular polygon; Dual cone and polar cone; Cone (formal languages); Convex set; Second-order cone programming; Center (category theory); Plane (geometry); Convex optimization; Feasible region; Point (geometry); Mathematical optimization; Mathematical analysis; Algorithm; Geometry; Integer programming","score_opus":0.19860811453338056,"score_gpt":0.49848181023595955,"score_spread":0.299873695702579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037284017","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.0009650841,0.000046925095,0.9982994,0.000030044093,0.000010878137,0.000023084778,0.000011559877,0.00005671346,0.000556409],"genre_scores_gemma":[0.045282498,0.00017454378,0.95274425,0.000045951987,0.0000501021,0.000213881,0.00009725225,0.0000942105,0.0012973746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999228,0.00023460422,0.000024299303,0.00009580418,0.00034284266,0.00007451083],"domain_scores_gemma":[0.99922264,0.00045214177,0.00007709127,0.00006541846,0.00014853921,0.000034189867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015380688,0.0013207091,0.0013127058,0.0010689186,0.0005643823,0.0010604217,0.0015011679,0.0011535117,0.003922391],"category_scores_gemma":[0.0026069244,0.00065161,0.0012148716,0.0012184097,0.0009071062,0.0011847403,0.0013145587,0.0033110594,0.0008476752],"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.0001595391,0.00018270937,0.0004244293,0.00027636465,0.00006668514,0.00018311686,0.00016935669,0.5610737,0.008509182,0.15512002,0.0064583183,0.26737657],"study_design_scores_gemma":[0.00002625534,0.000039862793,0.000048794824,0.00001254446,0.0000081218195,0.00004613386,0.000011242916,0.9821845,0.0010389052,0.014154323,0.002422747,0.0000065022978],"about_ca_topic_score_codex":0.0029508083,"about_ca_topic_score_gemma":0.00187553,"teacher_disagreement_score":0.003922391,"about_ca_system_score_codex":0.00079977757,"about_ca_system_score_gemma":0.0017359285,"threshold_uncertainty_score":0.013121724},"labels":[],"label_agreement":null},{"id":"W2042028954","doi":"10.1287/moor.1110.0513","title":"Penalized Sample Average Approximation Methods for Stochastic Mathematical Programs with Complementarity Constraints","year":2011,"lang":"en","type":"article","venue":"Mathematics of 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 Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Estimator; Mathematical optimization; Rate of convergence; Constraint (computer-aided design); Applied mathematics; Convergence (economics); Sample size determination; Statistics; Computer science","score_opus":0.5520442039151218,"score_gpt":0.5557295844772944,"score_spread":0.003685380562172602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042028954","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.0021671427,0.00021259286,0.99707496,0.000054824864,0.000014197363,0.000010859708,0.000008163728,0.00004548228,0.0004116968],"genre_scores_gemma":[0.4098202,0.0013044365,0.583128,0.00020629581,0.00015793554,0.00038379745,0.00021396654,0.00018101925,0.0046043065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985506,0.0008377082,0.00005677828,0.00013529533,0.00033562805,0.00008388934],"domain_scores_gemma":[0.99413645,0.0046679177,0.00042697595,0.00021824296,0.00046252468,0.00008781157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030467254,0.0010409163,0.0013986037,0.0009505602,0.00040746416,0.0011666879,0.0011787652,0.0011165013,0.0014925188],"category_scores_gemma":[0.009733199,0.0006162769,0.000908923,0.0010382215,0.0012198031,0.0012979382,0.0011098317,0.0019062563,0.00028999022],"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.00005458717,0.00003698674,0.00034705413,0.00011416004,0.000069921996,0.000040830673,0.000056607823,0.91668975,0.0010386497,0.052117236,0.00045315397,0.02898096],"study_design_scores_gemma":[0.0000024364217,0.000008730871,0.000020886488,0.000004303159,0.0000031797451,0.000003861755,0.0000017048411,0.99515295,0.000120034216,0.004483508,0.00019621199,0.0000020632199],"about_ca_topic_score_codex":0.0033760187,"about_ca_topic_score_gemma":0.0024473136,"teacher_disagreement_score":0.0033760187,"about_ca_system_score_codex":0.0009812121,"about_ca_system_score_gemma":0.0010996845,"threshold_uncertainty_score":0.016112804},"labels":[],"label_agreement":null},{"id":"W2046405851","doi":"10.1287/moor.2013.0590","title":"Exploiting Known Structures to Approximate Normal Cones","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Oracle; Mathematics; Simplex; Constraint (computer-aided design); Set (abstract data type); Independence (probability theory); Cone (formal languages); Mathematical optimization; Degeneracy (biology); Function (biology); Key (lock); Applied mathematics; Algorithm; Combinatorics; Computer science; Geometry","score_opus":0.17404089945024007,"score_gpt":0.45197394940292895,"score_spread":0.27793304995268886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046405851","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.013383184,0.0000916038,0.9847141,0.0000694072,0.000016496699,0.000022475917,0.000036607937,0.00013672077,0.0015293867],"genre_scores_gemma":[0.40635115,0.00041845668,0.58961654,0.00008809085,0.000045120105,0.00013153354,0.00037865064,0.00019836138,0.0027720607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808216,0.0005550198,0.000093777395,0.000204187,0.0009280732,0.00013688127],"domain_scores_gemma":[0.9952519,0.0023912764,0.0003758583,0.0009230853,0.00083954143,0.00021830994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024830538,0.0009221833,0.0010284524,0.0012702268,0.0005440742,0.002170991,0.0017561393,0.00086879067,0.0019192648],"category_scores_gemma":[0.014711415,0.0005611281,0.0008681907,0.0012094617,0.0017005629,0.003803157,0.0027099214,0.0032232255,0.00050671416],"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.000098824996,0.00006745798,0.0013439928,0.00008398325,0.000028070755,0.000109580986,0.00017956093,0.7371037,0.0030849457,0.20117612,0.001109051,0.055614714],"study_design_scores_gemma":[0.0000021747778,0.000013502391,0.00005271342,0.0000076053225,0.0000014924469,0.000018053674,0.000012162917,0.97469556,0.00076679984,0.023981152,0.00044371164,0.000005009845],"about_ca_topic_score_codex":0.005125382,"about_ca_topic_score_gemma":0.004541421,"teacher_disagreement_score":0.005125382,"about_ca_system_score_codex":0.0015528277,"about_ca_system_score_gemma":0.0013741808,"threshold_uncertainty_score":0.013131797},"labels":[],"label_agreement":null},{"id":"W2050482714","doi":"10.1287/moor.1050.0167","title":"Monotonic Assignment Rules and Common Pricing","year":2006,"lang":"en","type":"article","venue":"Mathematics of 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":"Queen's University","funders":"","keywords":"Mathematics; Monotonic function; Mathematical optimization; Mathematical economics","score_opus":0.23052314799558266,"score_gpt":0.4969393601013563,"score_spread":0.26641621210577365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050482714","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.07101712,0.00083558116,0.8580298,0.0018258907,0.00020016066,0.00028984997,0.00023112689,0.00020978399,0.06736061],"genre_scores_gemma":[0.6463717,0.0012634335,0.3280469,0.0006718186,0.00041190058,0.0005825028,0.00031918124,0.0001439449,0.02218849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994144,0.0025698105,0.00036793572,0.0011064457,0.0013068741,0.0005049382],"domain_scores_gemma":[0.98956513,0.0055190893,0.0014058579,0.0018754061,0.0010752747,0.0005592266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006428794,0.0008893378,0.0012423967,0.0013215842,0.0017324754,0.00454848,0.0023601805,0.0019622664,0.007158341],"category_scores_gemma":[0.017218133,0.000539736,0.0011296021,0.002114854,0.0047488427,0.008492508,0.002183374,0.002969242,0.0012084524],"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.000021050322,0.00004750146,0.00012644356,0.00004293995,0.000018063321,0.000053980424,0.000086883156,0.01113987,0.000224802,0.974812,0.0008101842,0.01261617],"study_design_scores_gemma":[0.000025091178,0.000024675875,0.000064115055,0.000019848434,0.000008374114,0.000065493055,0.000029783132,0.035752885,0.0002490562,0.9603924,0.0033558821,0.0000123322625],"about_ca_topic_score_codex":0.0012707514,"about_ca_topic_score_gemma":0.0012379044,"teacher_disagreement_score":0.007158341,"about_ca_system_score_codex":0.0015534941,"about_ca_system_score_gemma":0.002098111,"threshold_uncertainty_score":0.033999085},"labels":[],"label_agreement":null},{"id":"W2061220204","doi":"10.1287/moor.1060.0219","title":"Constraint Qualifications and KKT Conditions for Bilevel Programming Problems","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Mathematics; Bilevel optimization; Mathematical optimization; Constraint programming; Constraint logic programming; Constraint satisfaction; Binary constraint; Set (abstract data type); Nonlinear programming; Sequence (biology); Optimization problem; Nonlinear system; Computer science; Stochastic programming","score_opus":0.12425927530381481,"score_gpt":0.40282507766078063,"score_spread":0.2785658023569658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061220204","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.00910328,0.00066403736,0.9565957,0.002001996,0.0001844083,0.0001143049,0.0004626612,0.00009062938,0.03078299],"genre_scores_gemma":[0.5322267,0.0044500125,0.43631148,0.0015094428,0.00066148135,0.001490723,0.0019942222,0.00025589802,0.021100093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580586,0.0017817039,0.0003182229,0.0006517646,0.0010263765,0.00041600864],"domain_scores_gemma":[0.9945781,0.0031560468,0.00061428425,0.00035298834,0.0010607627,0.00023777252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048035095,0.0012423812,0.0015265608,0.0009829946,0.0013746585,0.0026922454,0.0012399779,0.0020367012,0.009382006],"category_scores_gemma":[0.015725194,0.00074248697,0.0010955699,0.0020010704,0.004182826,0.0046223714,0.0029440178,0.0040732855,0.0020887244],"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.000017735087,0.000021510514,0.00016775564,0.00015506135,0.000016053702,0.00014566608,0.00013861828,0.049425352,0.0004510759,0.9377631,0.0024929899,0.009205077],"study_design_scores_gemma":[0.000025026296,0.00003342373,0.00015344213,0.00008631097,0.000007929737,0.00007087853,0.00009351693,0.1221141,0.00042524972,0.86845934,0.008504531,0.000026202832],"about_ca_topic_score_codex":0.0030631355,"about_ca_topic_score_gemma":0.0020491155,"teacher_disagreement_score":0.009382006,"about_ca_system_score_codex":0.0016863542,"about_ca_system_score_gemma":0.0030217536,"threshold_uncertainty_score":0.03138596},"labels":[],"label_agreement":null},{"id":"W2062059813","doi":"10.1287/moor.26.2.248.10558","title":"A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":418,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College","funders":"","keywords":"Mathematics; Hilbert space; Monotone polygon; Simple (philosophy); Convergence (economics); Applied mathematics; Class (philosophy); Weak convergence; Mathematical optimization; Pure mathematics; Computer science","score_opus":0.1493640761500596,"score_gpt":0.4924049965811565,"score_spread":0.3430409204310969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062059813","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.006988614,0.00068539585,0.983225,0.00077330717,0.00015804912,0.00007898053,0.000032314525,0.00007931385,0.00797895],"genre_scores_gemma":[0.2830981,0.002951618,0.6866438,0.0008214581,0.0007739906,0.00091086735,0.0001371971,0.00027877095,0.024384178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990445,0.00038422356,0.000039409006,0.0001304372,0.0003396049,0.00006176654],"domain_scores_gemma":[0.9981888,0.000923291,0.00013875561,0.00016167687,0.0004170109,0.00017050542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019287,0.0015480416,0.0010986724,0.0010661472,0.001311689,0.0014270011,0.0016729524,0.0019989307,0.0025804155],"category_scores_gemma":[0.005553576,0.0005530503,0.0012889373,0.0005489063,0.0040154047,0.0027738146,0.003853714,0.0038166908,0.0010225923],"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.000046462028,0.00005697094,0.00019066295,0.00027670062,0.000045751818,0.00018305074,0.00027937736,0.040303487,0.0114423195,0.91750383,0.0021506343,0.027520774],"study_design_scores_gemma":[0.000028982115,0.00018139821,0.0002086393,0.00007136024,0.000021745054,0.00020138267,0.000048150894,0.3826382,0.004461796,0.60149616,0.010602755,0.00003939106],"about_ca_topic_score_codex":0.00043472848,"about_ca_topic_score_gemma":0.00045177096,"teacher_disagreement_score":0.004019287,"about_ca_system_score_codex":0.0006546448,"about_ca_system_score_gemma":0.0012094761,"threshold_uncertainty_score":0.021256268},"labels":[],"label_agreement":null},{"id":"W2066590823","doi":"10.1287/moor.1110.0484","title":"Buy-at-Bulk Network Design with Protection","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"McGill University","funders":"","keywords":"Disjoint sets; Approximation algorithm; Provisioning; Node (physics); Constraint (computer-aided design); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Network planning and design; Mathematics; Network topology; Computer science; Topology (electrical circuits); Computer network; Discrete mathematics; Telecommunications; Combinatorics","score_opus":0.15900985655438077,"score_gpt":0.31353065129219826,"score_spread":0.1545207947378175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066590823","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.027932577,0.00062754296,0.9620836,0.0008306774,0.00010528959,0.00015416538,0.0001998415,0.00043224383,0.0076341094],"genre_scores_gemma":[0.52018464,0.00088625593,0.46873307,0.0006256032,0.00019286895,0.00028659034,0.0005756971,0.00028344954,0.008231846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883026,0.00044279994,0.00003829252,0.00024509584,0.0002325827,0.00021093308],"domain_scores_gemma":[0.9965162,0.0022253864,0.00038048677,0.00050097966,0.00017642767,0.0002004854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019374496,0.0018414985,0.0019093306,0.000636874,0.00058355706,0.001667299,0.0022952873,0.0019033599,0.009622189],"category_scores_gemma":[0.007890129,0.00079541834,0.0010438493,0.0014856431,0.0010745417,0.0043979594,0.0015734739,0.0020923265,0.0012707012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047403757,0.0002679383,0.0009437614,0.0003956814,0.00010243222,0.0001683247,0.00016707771,0.7993545,0.0028249933,0.07973418,0.010871343,0.10469583],"study_design_scores_gemma":[0.00004244936,0.00009807217,0.000055244775,0.00001352728,0.000017654818,0.00007095052,0.00002658889,0.95209056,0.0006321694,0.045280922,0.00166367,0.000008149234],"about_ca_topic_score_codex":0.0014888466,"about_ca_topic_score_gemma":0.0021660023,"teacher_disagreement_score":0.009622189,"about_ca_system_score_codex":0.0019406234,"about_ca_system_score_gemma":0.0014220055,"threshold_uncertainty_score":0.03218943},"labels":[],"label_agreement":null},{"id":"W2071870255","doi":"10.1287/moor.1110.0489","title":"Appointment Scheduling with Discrete Random Durations","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":151,"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":"Submodular set function; Mathematical optimization; Schedule; Scheduling (production processes); Overtime; Discrete time and continuous time; Mathematics; Sequence (biology); Integer programming; Probability distribution; Regular polygon; Job shop scheduling; Computer science; Statistics","score_opus":0.33064390627795626,"score_gpt":0.509146559540775,"score_spread":0.17850265326281878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071870255","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.16440077,0.0023189443,0.8122236,0.0026053702,0.0005321216,0.00026298402,0.0019741228,0.0007404846,0.014941556],"genre_scores_gemma":[0.93754524,0.0010084597,0.046185702,0.00023889825,0.00031660893,0.00023460398,0.00065542234,0.00009342801,0.013721587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728215,0.0010761543,0.00012926247,0.0005713933,0.00043936455,0.00050171366],"domain_scores_gemma":[0.9954609,0.0027604445,0.00081319734,0.00028335274,0.0002073747,0.00047464922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026943383,0.00088586356,0.0019076148,0.00069569837,0.0005949096,0.0016213445,0.002411317,0.0018454802,0.007808918],"category_scores_gemma":[0.009538906,0.0009727,0.00094521773,0.0014269793,0.0010870473,0.0018360225,0.0010258938,0.0017570475,0.0012461038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006207563,0.00014089959,0.001433834,0.00023581955,0.00006824319,0.00037002595,0.00013797708,0.8725576,0.0015894347,0.10228127,0.003345952,0.01721827],"study_design_scores_gemma":[0.0001295084,0.00012942123,0.00066856184,0.000017088449,0.000025852667,0.00008304488,0.00004400254,0.9631447,0.000339988,0.033000313,0.002388162,0.000029378227],"about_ca_topic_score_codex":0.0057332627,"about_ca_topic_score_gemma":0.00369698,"teacher_disagreement_score":0.007808918,"about_ca_system_score_codex":0.0021994757,"about_ca_system_score_gemma":0.0013855459,"threshold_uncertainty_score":0.026123464},"labels":[],"label_agreement":null},{"id":"W2092176968","doi":"10.1287/moor.27.4.693.299","title":"Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"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":"Combinatorics; Mathematics; Matroid; Vertex (graph theory); Polyhedron; Path (computing); Corollary; Ideal (ethics); Graph; Cardinality (data modeling); Discrete mathematics","score_opus":0.06675678196061044,"score_gpt":0.3852024378835007,"score_spread":0.3184456559228903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092176968","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.8799076,0.00056448416,0.08093725,0.0004978458,0.000051979587,0.000048380858,0.00040634893,0.0001327154,0.03745338],"genre_scores_gemma":[0.9784303,0.00039053723,0.015011647,0.00006379663,0.00011012584,0.000036624424,0.00039164964,0.00002680635,0.005538608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994179,0.00006154111,0.000041271687,0.0001481007,0.00015915457,0.00017205052],"domain_scores_gemma":[0.99805886,0.00047888677,0.0005768564,0.0002090179,0.00020235113,0.00047399555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079667,0.00029780623,0.00044222694,0.0017862159,0.0011896181,0.0028610593,0.0006551928,0.00046812167,0.002961864],"category_scores_gemma":[0.0020550292,0.00031166803,0.00061845547,0.0013108093,0.0020676523,0.0034446958,0.0012731283,0.0012731665,0.0002218604],"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.00011154111,0.000048313585,0.0031238655,0.00004158474,0.000008642171,0.00018960758,0.0005338937,0.004611669,0.003085861,0.9750879,0.0008063315,0.0123507865],"study_design_scores_gemma":[0.000022480926,0.00007885668,0.004361432,0.000042597392,0.0000305174,0.0010164083,0.00063448783,0.0365757,0.003604477,0.94195855,0.011643276,0.000031199084],"about_ca_topic_score_codex":0.00081927684,"about_ca_topic_score_gemma":0.00080516585,"teacher_disagreement_score":0.002961864,"about_ca_system_score_codex":0.0012694902,"about_ca_system_score_gemma":0.0003893074,"threshold_uncertainty_score":0.009908438},"labels":[],"label_agreement":null},{"id":"W2096547979","doi":"10.1287/moor.1060.0212","title":"Computation of the Lasserre Ranks of Some Polytopes","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Carleton University","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Computation; Lift (data mining); Mathematical optimization; Discrete mathematics; Applied mathematics; Algorithm; Computer science","score_opus":0.17158579478364877,"score_gpt":0.4919333757813225,"score_spread":0.32034758099767374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096547979","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.15515128,0.00079385075,0.8235326,0.0008485845,0.00013583853,0.00015708827,0.0005065472,0.00066438055,0.018209865],"genre_scores_gemma":[0.6574605,0.0005506077,0.33042562,0.00017161849,0.00016448827,0.00029186413,0.0012524736,0.0003710061,0.009311797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987018,0.00037339955,0.00006111104,0.00018556982,0.00040600687,0.00027216063],"domain_scores_gemma":[0.9966204,0.002130421,0.00029848336,0.00029448365,0.00031901154,0.0003372304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022801494,0.0011721675,0.0017060457,0.0021568276,0.0010483774,0.002052832,0.0011815547,0.0012426985,0.0093499655],"category_scores_gemma":[0.010805944,0.000626256,0.0013213828,0.0009731695,0.0019147459,0.0028454224,0.0018409779,0.0035306248,0.0011246058],"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.00029915114,0.0002720348,0.0024754186,0.00062519836,0.00014070627,0.00026946503,0.00048523623,0.4435313,0.005223556,0.43194887,0.0100769345,0.10465208],"study_design_scores_gemma":[0.000043997174,0.00012910442,0.0010022448,0.00005111365,0.000016280772,0.00008868293,0.00014840822,0.7813021,0.0025630172,0.21103142,0.0035614662,0.0000621892],"about_ca_topic_score_codex":0.0016353203,"about_ca_topic_score_gemma":0.00295683,"teacher_disagreement_score":0.0093499655,"about_ca_system_score_codex":0.00093238987,"about_ca_system_score_gemma":0.0009575493,"threshold_uncertainty_score":0.03127879},"labels":[],"label_agreement":null},{"id":"W2100210445","doi":"10.1287/moor.27.3.567.317","title":"Approximating Subdifferentials by Random Sampling of Gradients","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":98,"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":"Mathematics; Lipschitz continuity; Differentiable function; Almost everywhere; Subderivative; Convex hull; Euclidean space; Function (biology); Euclidean geometry; Applied mathematics; Convex function; Point (geometry); Mathematical analysis; Regular polygon; Pure mathematics; Mathematical optimization; Convex optimization; Geometry","score_opus":0.3146180574641937,"score_gpt":0.465711267282209,"score_spread":0.15109320981801533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100210445","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.11510095,0.00029927102,0.88341486,0.00016042941,0.000037243386,0.00004699908,0.000039855433,0.00019832051,0.00070204795],"genre_scores_gemma":[0.80241394,0.00039299406,0.19502284,0.00009639081,0.000048171347,0.00009517919,0.00022121744,0.000117932905,0.0015913118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00035362397,0.000042724096,0.000113053575,0.00018850827,0.00006780631],"domain_scores_gemma":[0.99498016,0.003214004,0.00050399936,0.00061625335,0.0005088594,0.00017672614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035984362,0.0007843247,0.0009869152,0.0011108763,0.00030891979,0.0010231243,0.0012812628,0.001041371,0.0008510643],"category_scores_gemma":[0.017053852,0.0008030185,0.00069953647,0.00069149205,0.0015520199,0.0021093646,0.001175653,0.0012810609,0.00020692537],"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.00024279865,0.000054856984,0.0042365785,0.00009122299,0.0000624038,0.00016281063,0.00012084113,0.8979159,0.0042253532,0.07286747,0.00061694335,0.019402819],"study_design_scores_gemma":[0.000008450054,0.000016922697,0.00018236363,0.0000046766054,0.000002889483,0.000015282683,0.00000594682,0.9922935,0.00071176357,0.0066170176,0.00013686818,0.0000043176033],"about_ca_topic_score_codex":0.0031604953,"about_ca_topic_score_gemma":0.0030415547,"teacher_disagreement_score":0.0035984362,"about_ca_system_score_codex":0.0010674584,"about_ca_system_score_gemma":0.00063455745,"threshold_uncertainty_score":0.019030571},"labels":[],"label_agreement":null},{"id":"W2107854391","doi":"10.1287/moor.25.4.539.12117","title":"A Further Extension of the KKMS Theorem","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Toronto","funders":"","keywords":"Mathematics; Intersection (aeronautics); Generalization; Extension (predicate logic); Countable set; Intersection theorem; Point (geometry); Property (philosophy); Fixed-point theorem; Discrete mathematics; Combinatorics; Brouwer fixed-point theorem; Danskin's theorem; Computer science; Mathematical analysis; Geometry","score_opus":0.1299904349143645,"score_gpt":0.43996256635668796,"score_spread":0.3099721314423235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107854391","genre_codex":"other","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.077559866,0.0013681343,0.4364321,0.008154753,0.00079119677,0.00023650074,0.0013591843,0.00047235278,0.47362584],"genre_scores_gemma":[0.83189154,0.0013619268,0.08806711,0.0025803032,0.001354482,0.0003856353,0.0010608233,0.00019890808,0.07309934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980798,0.00035602477,0.000112659305,0.0006770488,0.00056500424,0.00020947627],"domain_scores_gemma":[0.99802184,0.00058850663,0.0001913454,0.0005301411,0.0004998424,0.00016841496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017082659,0.00061175117,0.00078895653,0.0016283225,0.0017334686,0.0023214621,0.0013767536,0.0008967355,0.022356957],"category_scores_gemma":[0.0056139375,0.00037605866,0.001536681,0.0014094643,0.0027257588,0.009128358,0.006758372,0.0028921075,0.0028691061],"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.000017347165,0.00001977209,0.00032863792,0.000042977175,0.000010464938,0.000059007394,0.00024551435,0.0005897674,0.00068748556,0.98527664,0.002466468,0.010255929],"study_design_scores_gemma":[0.000021215708,0.000052315343,0.0010859044,0.000029426006,0.00001850534,0.00035294963,0.000217481,0.0042768028,0.00097435835,0.94131273,0.051631793,0.000026503478],"about_ca_topic_score_codex":0.0010907738,"about_ca_topic_score_gemma":0.0008007082,"teacher_disagreement_score":0.022356957,"about_ca_system_score_codex":0.0014362029,"about_ca_system_score_gemma":0.0009963214,"threshold_uncertainty_score":0.07479149},"labels":[],"label_agreement":null},{"id":"W2109882860","doi":"10.1287/moor.1040.0097","title":"Existence and Properties of Optimal Production and Inventory Policies","year":2004,"lang":"en","type":"article","venue":"Mathematics of 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":"Mathematics; Production (economics); Mathematical economics; Mathematical optimization; Microeconomics; Economics","score_opus":0.14448603227975015,"score_gpt":0.3247139842135402,"score_spread":0.18022795193379004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109882860","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.17043552,0.0016055023,0.79839337,0.0022638924,0.00008496809,0.00014019695,0.0005723214,0.0003794252,0.026124856],"genre_scores_gemma":[0.85353345,0.0014816831,0.14142646,0.0002127464,0.00008851758,0.00024998636,0.00030043712,0.000116891795,0.0025898523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798703,0.0006752321,0.00014075763,0.00037353177,0.00041794454,0.00040555772],"domain_scores_gemma":[0.9845175,0.011212065,0.0022411153,0.0006515655,0.00090911664,0.0004686623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030482074,0.0006949208,0.0011557627,0.0012061893,0.0007910912,0.0025150962,0.0010214945,0.0017491549,0.0036564125],"category_scores_gemma":[0.026281873,0.0011437774,0.00079010386,0.0012533254,0.0020884024,0.0045129685,0.0011771236,0.001637868,0.00046319194],"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.00018639433,0.000170413,0.0018996636,0.00032846964,0.00007071278,0.0001400929,0.0002332544,0.3070842,0.003358575,0.65435076,0.0023599435,0.029817522],"study_design_scores_gemma":[0.000056959976,0.00009697104,0.0008041118,0.00009254462,0.000029859113,0.00011836389,0.00011948636,0.53382146,0.0026338657,0.4595695,0.0026212262,0.000035602174],"about_ca_topic_score_codex":0.00093318534,"about_ca_topic_score_gemma":0.0006251494,"teacher_disagreement_score":0.0036564125,"about_ca_system_score_codex":0.0017755225,"about_ca_system_score_gemma":0.002281421,"threshold_uncertainty_score":0.016120672},"labels":[],"label_agreement":null},{"id":"W2111067176","doi":"10.1287/moor.25.4.679.12115","title":"Diffusion Approximations for Some Multiclass Queueing Networks with FIFO Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 British Columbia","funders":"","keywords":"Semimartingale; Queueing theory; FIFO (computing and electronics); Layered queueing network; Mathematics; Heavy traffic approximation; Limit (mathematics); Diffusion; Computer science; Applied mathematics; Mathematical optimization; Discrete mathematics; Mathematical analysis; Computer network","score_opus":0.05305774655468025,"score_gpt":0.33971587626822725,"score_spread":0.286658129713547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111067176","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.083538376,0.0017406833,0.9052928,0.001419212,0.00014887367,0.00005972581,0.00012482522,0.00020119417,0.007474205],"genre_scores_gemma":[0.92176986,0.0026810605,0.06322049,0.00033120095,0.00018470634,0.00015021647,0.00017348409,0.00008622258,0.011402767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896944,0.00024277743,0.000052677184,0.00019314305,0.00032751285,0.00021457892],"domain_scores_gemma":[0.9958717,0.0024911598,0.00066066626,0.00017876264,0.00054637034,0.00025140427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039234217,0.00087971066,0.0009453137,0.0015194244,0.00074919406,0.0016934768,0.0016287272,0.0012990519,0.0020689524],"category_scores_gemma":[0.013452838,0.0005136369,0.0011404103,0.0009841139,0.0021588472,0.0032555799,0.0017259109,0.0025900602,0.0002523053],"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.000090378795,0.000042888943,0.0009362416,0.0001143162,0.000043792737,0.00016686736,0.0003218423,0.4043153,0.0033611897,0.5782225,0.0011931089,0.011191611],"study_design_scores_gemma":[0.0000069255684,0.000009376381,0.000114794384,0.00000875838,0.0000058121086,0.000021029027,0.000023672086,0.94678706,0.00021659108,0.052443095,0.00035382772,0.0000090344365],"about_ca_topic_score_codex":0.009162788,"about_ca_topic_score_gemma":0.0035828224,"teacher_disagreement_score":0.009162788,"about_ca_system_score_codex":0.0039930213,"about_ca_system_score_gemma":0.001453215,"threshold_uncertainty_score":0.028971493},"labels":[],"label_agreement":null},{"id":"W2113539939","doi":"10.1287/moor.1090.0411","title":"Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":28,"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":"Martingale (probability theory); Bid price; Mathematics; Revenue; Revenue management; Econometrics; Mathematical economics; Mathematical optimization; Economics; Finance; Applied mathematics","score_opus":0.0436355011372705,"score_gpt":0.34033009454800384,"score_spread":0.29669459341073334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113539939","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.06149156,0.00045905015,0.92853385,0.0007934883,0.0000888399,0.00008346453,0.000089035835,0.00007839585,0.008382353],"genre_scores_gemma":[0.95438564,0.0004946573,0.03879979,0.00017268278,0.00012316296,0.0001604633,0.000056995803,0.000043473323,0.0057630846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855524,0.00066747254,0.000047398462,0.00021878068,0.00030071588,0.00021037686],"domain_scores_gemma":[0.9975489,0.001204815,0.00042220566,0.00018604787,0.00035588356,0.00028217028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035425473,0.0012037468,0.0012551999,0.0007481,0.0004662975,0.0022158013,0.00213072,0.0016036272,0.002612522],"category_scores_gemma":[0.008426083,0.000663475,0.0012090442,0.00067781727,0.0035220846,0.003187178,0.0015097945,0.0023682455,0.00022983168],"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.0000616872,0.000070235925,0.00035752967,0.00006489879,0.000037589743,0.00011233564,0.000103184815,0.3048099,0.0023814489,0.68798023,0.0006435424,0.0033773826],"study_design_scores_gemma":[0.000018421086,0.00004123667,0.00013115564,0.000011312659,0.000009848819,0.000020489464,0.000012294681,0.8950917,0.0004272031,0.10383932,0.000381968,0.00001504822],"about_ca_topic_score_codex":0.0024089336,"about_ca_topic_score_gemma":0.0011616334,"teacher_disagreement_score":0.0035425473,"about_ca_system_score_codex":0.0027288585,"about_ca_system_score_gemma":0.0015856284,"threshold_uncertainty_score":0.019799411},"labels":[],"label_agreement":null},{"id":"W2117639993","doi":"10.1287/moor.25.1.141.15207","title":"Optimal Preventive Replacement Under Minimal Repair and Random Repair Cost","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reliability and Maintenance Optimization","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":"University of Toronto","funders":"","keywords":"Optimal stopping; Mathematical optimization; Mathematics; Maximization; Limit (mathematics); Semimartingale; Unit (ring theory); Utility maximization problem; Applied mathematics; Mathematical economics; Utility maximization","score_opus":0.031193077777050486,"score_gpt":0.3199220425933819,"score_spread":0.2887289648163314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117639993","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.43951142,0.0019533816,0.5505457,0.0010637096,0.00010497365,0.00010556386,0.00022749622,0.00035946572,0.0061282767],"genre_scores_gemma":[0.98046255,0.00031311635,0.01686572,0.00004973601,0.000028633394,0.00005086853,0.00008470124,0.00004101607,0.002103645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898475,0.00039423472,0.00005182713,0.00017854366,0.00013243232,0.00025823127],"domain_scores_gemma":[0.9970396,0.0019316495,0.00041791805,0.00011240257,0.00024417674,0.0002543229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017440335,0.0009326306,0.0016609534,0.0007238956,0.0003458432,0.00094886945,0.0011232959,0.0013510043,0.0016621833],"category_scores_gemma":[0.0051034777,0.0007832737,0.00064141944,0.00039890458,0.0011897926,0.00086416263,0.0006787381,0.0008887707,0.00019734509],"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.00020198942,0.00007142319,0.0004941326,0.00010926616,0.00003461044,0.00012501504,0.000042948195,0.9732842,0.0019593185,0.017272476,0.00045523033,0.0059493645],"study_design_scores_gemma":[0.000038614016,0.00008226085,0.00027857747,0.000010549843,0.000022992288,0.000028342694,0.00001655054,0.9887905,0.0005078196,0.010032932,0.000181951,0.000008928014],"about_ca_topic_score_codex":0.0055023083,"about_ca_topic_score_gemma":0.0021717842,"teacher_disagreement_score":0.0055023083,"about_ca_system_score_codex":0.0013554334,"about_ca_system_score_gemma":0.0014816808,"threshold_uncertainty_score":0.010940552},"labels":[],"label_agreement":null},{"id":"W2118084167","doi":"10.1287/moor.1040.0101","title":"Combination of General Antithetic Transformations and Control Variables","year":2004,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Mathematical Approximation and Integration","field":"Mathematics","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":"Université de Montréal; University of Calgary; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Control variates; Latin hypercube sampling; Monte Carlo method; Variance reduction; Estimator; Hypercube; Random variate; Context (archaeology); Variance (accounting); Random variable; Applied mathematics; Mathematical optimization; Statistics; Hybrid Monte Carlo; Discrete mathematics; Markov chain Monte Carlo","score_opus":0.08989146620482862,"score_gpt":0.39793939583802446,"score_spread":0.3080479296331958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118084167","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.006643556,0.00013154824,0.9902322,0.000060617567,0.00003658911,0.000023748937,0.000013186369,0.000098310986,0.0027601004],"genre_scores_gemma":[0.5545267,0.0004996988,0.4359988,0.00028890074,0.00020347616,0.00027899278,0.00011426481,0.00027516912,0.007814014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954625,0.0021955632,0.00020373479,0.00067945773,0.001203001,0.00025565817],"domain_scores_gemma":[0.99330235,0.0036581766,0.0007192877,0.00146831,0.00069698074,0.00015488276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005694948,0.0011308689,0.0010989781,0.0014927236,0.0005661967,0.0014530711,0.0015039007,0.0008611308,0.0033280095],"category_scores_gemma":[0.013171808,0.0005128141,0.0010520107,0.0019170403,0.0029508884,0.002317986,0.0020161287,0.0018734238,0.00059595524],"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.00023483997,0.00015159212,0.00087109214,0.00012806551,0.00008582788,0.00017212419,0.00010812558,0.09943594,0.005335374,0.8070632,0.0008734055,0.08554038],"study_design_scores_gemma":[0.000057596706,0.00029123152,0.00043410092,0.00003304903,0.000049510843,0.00015123222,0.000024251513,0.64968795,0.00785833,0.335766,0.0056014257,0.000045316952],"about_ca_topic_score_codex":0.0007104323,"about_ca_topic_score_gemma":0.0007805783,"teacher_disagreement_score":0.005694948,"about_ca_system_score_codex":0.0007254473,"about_ca_system_score_gemma":0.0009837868,"threshold_uncertainty_score":0.030118108},"labels":[],"label_agreement":null},{"id":"W2118679801","doi":"10.1287/moor.1080.0366","title":"Queue-and-Idleness-Ratio Controls in Many-Server Service Systems","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":158,"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":"Queue; Computer science; Limiting; State space; Routing (electronic design automation); Mathematical optimization; Multilevel queue; Service (business); Class (philosophy); State (computer science); Distributed computing; Computer network; Operations research; Queue management system; Mathematics; Engineering; Algorithm","score_opus":0.0640631890681417,"score_gpt":0.34920902483401234,"score_spread":0.28514583576587066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118679801","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.35848334,0.0006311519,0.63285136,0.00094872346,0.00008904595,0.000072533505,0.00009662684,0.00037924066,0.006447967],"genre_scores_gemma":[0.9916332,0.00014140287,0.0069732512,0.00004644934,0.000026914293,0.000032400374,0.00002140801,0.000021292846,0.001103637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.0004280344,0.000047269215,0.00018099195,0.0002099417,0.00017189315],"domain_scores_gemma":[0.99572146,0.002446542,0.00073354825,0.0002485663,0.00046949013,0.0003803755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523962,0.0007392992,0.0009315698,0.0005718022,0.00064591016,0.0014553784,0.0015321304,0.00082707335,0.0016098729],"category_scores_gemma":[0.00890612,0.0003560221,0.0005540688,0.00043227465,0.0028348404,0.0017119999,0.0013718624,0.0011937062,0.00015001194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001627371,0.00012715855,0.0012547957,0.00007697662,0.00004491681,0.00017722114,0.00019886573,0.7494355,0.0057982723,0.23585935,0.0009065717,0.0059577445],"study_design_scores_gemma":[0.000021712309,0.000033165306,0.00021149406,0.0000029231946,0.000006342731,0.00001247028,0.00002052769,0.9735555,0.00031136125,0.025710076,0.00010597848,0.000008430977],"about_ca_topic_score_codex":0.0040040817,"about_ca_topic_score_gemma":0.001453878,"teacher_disagreement_score":0.0040040817,"about_ca_system_score_codex":0.0018768472,"about_ca_system_score_gemma":0.0008832752,"threshold_uncertainty_score":0.013617516},"labels":[],"label_agreement":null},{"id":"W2119553628","doi":"10.1287/moor.2014.0672","title":"Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Waterloo","funders":"","keywords":"Subderivative; Mathematics; Dimension (graph theory); Simple (philosophy); Pure mathematics; Limiting; Argument (complex analysis); Regular polygon; Geometry; Convex optimization","score_opus":0.07019848095179337,"score_gpt":0.35941221556697756,"score_spread":0.2892137346151842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119553628","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.4524687,0.0004603975,0.5264988,0.00049528864,0.000044571767,0.000072022194,0.00025935422,0.00017035034,0.019530702],"genre_scores_gemma":[0.9161021,0.0006115415,0.068608746,0.00014839316,0.000052639127,0.00007814164,0.00026436942,0.00006778783,0.014066247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998068,0.00004499816,0.000009946316,0.000046555888,0.000059521535,0.000032272106],"domain_scores_gemma":[0.9992569,0.0002737881,0.00012714129,0.00007032218,0.0001333089,0.00013861402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063678354,0.00042342354,0.00032941892,0.0013701721,0.00043393293,0.0009511871,0.00048309992,0.00033317457,0.0027146807],"category_scores_gemma":[0.002212783,0.00025990256,0.00052147324,0.0005048638,0.0012669071,0.0014879863,0.0011258074,0.0012040943,0.00032855355],"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.000019359499,0.0000102897175,0.0006304449,0.000024659608,0.000005591041,0.00007291921,0.00015653307,0.006681404,0.0027989564,0.9830161,0.00039029375,0.0061935633],"study_design_scores_gemma":[0.000017585395,0.00008418062,0.0017762872,0.000024966916,0.000014872982,0.00020731699,0.00018891483,0.11328705,0.004204065,0.873948,0.006226326,0.000020484647],"about_ca_topic_score_codex":0.0015026304,"about_ca_topic_score_gemma":0.001812714,"teacher_disagreement_score":0.0027146807,"about_ca_system_score_codex":0.0009702196,"about_ca_system_score_gemma":0.0004224068,"threshold_uncertainty_score":0.0090815425},"labels":[],"label_agreement":null},{"id":"W2119663881","doi":"10.1287/moor.1070.0270","title":"On the Spanning Property of Risk Bonds Priced by Equilibrium","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of British Columbia","funders":"","keywords":"Hedge; Bond; Bond valuation; Stochastic differential equation; Economics; Financial market; Futures contract; Econometrics; Financial economics; Mathematics; Finance; Applied mathematics","score_opus":0.09462986760926169,"score_gpt":0.3287597655489408,"score_spread":0.23412989793967914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119663881","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.13639317,0.000548848,0.84687483,0.00070556777,0.00005492942,0.00004011076,0.000081668535,0.00010346225,0.015197325],"genre_scores_gemma":[0.8850387,0.0011682292,0.10444088,0.00015314188,0.00018628206,0.000118917094,0.00017049658,0.00011788045,0.0086054215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951375,0.00019928,0.000021909878,0.00007238854,0.00013275542,0.00005992316],"domain_scores_gemma":[0.99828583,0.0008934326,0.00027951537,0.0001440586,0.00020640442,0.00019080317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014142987,0.0005271851,0.000632857,0.000897359,0.00068701484,0.0014781872,0.00082722655,0.0010702661,0.004090959],"category_scores_gemma":[0.006783735,0.00039840274,0.00087190926,0.0006363195,0.0013675824,0.0029470662,0.0012724276,0.0012410289,0.0003984286],"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.000016686623,0.00002208313,0.00045504153,0.000023014847,0.000012887488,0.00009573028,0.000078417776,0.038363896,0.0013302524,0.95343435,0.00044894754,0.00571871],"study_design_scores_gemma":[0.000015589972,0.000032351854,0.00027416143,0.000014488943,0.000008183434,0.0001099782,0.000024524621,0.5692654,0.00041660038,0.4287047,0.0011207489,0.000013148334],"about_ca_topic_score_codex":0.001060796,"about_ca_topic_score_gemma":0.0006171568,"teacher_disagreement_score":0.004090959,"about_ca_system_score_codex":0.00072097476,"about_ca_system_score_gemma":0.0006412629,"threshold_uncertainty_score":0.013685644},"labels":[],"label_agreement":null},{"id":"W2120045945","doi":"10.1287/moor.2016.0832","title":"On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces","year":2017,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov decision process; Mathematics; State space; Convergence (economics); Applied mathematics; Mathematical optimization; Action (physics); Markov chain; Space (punctuation); Finite state; Markov process; Class (philosophy); Q-learning; State (computer science); Average cost; Reinforcement learning; Computer science; Algorithm; Statistics","score_opus":0.11485889613744056,"score_gpt":0.3944555419249472,"score_spread":0.27959664578750665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120045945","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.04024952,0.0011756549,0.9530747,0.0007299379,0.00006513998,0.0000537685,0.000081391365,0.00021933187,0.004350571],"genre_scores_gemma":[0.80245847,0.0022833273,0.18992405,0.00039815877,0.00021019284,0.00041358118,0.00048982725,0.00035069027,0.003471743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408144,0.0031439562,0.00029584926,0.00072669366,0.001284133,0.00046786922],"domain_scores_gemma":[0.8984431,0.092752084,0.0028169623,0.0027166838,0.0023792977,0.0008919176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0120010665,0.0016404517,0.002271788,0.0023398653,0.0011424059,0.003032789,0.002386183,0.0021784077,0.0024164785],"category_scores_gemma":[0.09989255,0.0010752559,0.001665893,0.0013456342,0.005724216,0.0052773026,0.0034113277,0.0053998325,0.00046157616],"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.00012161009,0.000081165526,0.0013514675,0.00018310064,0.000082093386,0.00009271746,0.00020201974,0.7005761,0.0008023205,0.28259218,0.0005926023,0.013322633],"study_design_scores_gemma":[0.000008217061,0.000030805062,0.00012452052,0.000038701124,0.0000074578124,0.00001612549,0.000017449118,0.8959663,0.0003265594,0.10323824,0.00021651355,0.000009009146],"about_ca_topic_score_codex":0.0044772,"about_ca_topic_score_gemma":0.0028455185,"teacher_disagreement_score":0.0120010665,"about_ca_system_score_codex":0.004066811,"about_ca_system_score_gemma":0.0028371597,"threshold_uncertainty_score":0.063468456},"labels":[],"label_agreement":null},{"id":"W2120257557","doi":"10.1287/moor.1100.0480","title":"Necessary Optimality Conditions for Multiobjective Bilevel Programs","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"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 Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Bilevel optimization; Mathematical optimization; Mathematics; Constraint (computer-aided design); Complementarity (molecular biology); Optimization problem; Upper and lower bounds; Multi-objective optimization; Set (abstract data type); Computer science","score_opus":0.3096603620746675,"score_gpt":0.4282102137386596,"score_spread":0.11854985166399207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120257557","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.01961544,0.0012153578,0.9340419,0.0016698618,0.00020964333,0.00027133097,0.0007638247,0.00026417474,0.04194848],"genre_scores_gemma":[0.56109715,0.0046244008,0.41462752,0.000830495,0.00068805326,0.0022788919,0.0017686221,0.00071224413,0.013372583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594766,0.0011584786,0.00032806877,0.00058587745,0.0013889696,0.00059097225],"domain_scores_gemma":[0.9911376,0.0054349643,0.0008539076,0.00033503457,0.0018441414,0.00039440312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049587735,0.0020446156,0.0021836534,0.0026177382,0.0016294522,0.0036454205,0.0016221281,0.002455678,0.014767629],"category_scores_gemma":[0.019889167,0.0016605392,0.002093381,0.0017781631,0.0037679384,0.0048653525,0.0032446247,0.005791001,0.0024259281],"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.00008756568,0.00012254347,0.0005639935,0.0005161182,0.00005787958,0.00037798836,0.00033305734,0.12058614,0.0032073383,0.85258704,0.0064336234,0.015126616],"study_design_scores_gemma":[0.00006570199,0.00011055459,0.00041293798,0.0002717738,0.000032885557,0.00016007917,0.00016640933,0.32118422,0.0028329662,0.66735774,0.0073514925,0.000053231408],"about_ca_topic_score_codex":0.0014311683,"about_ca_topic_score_gemma":0.0017899522,"teacher_disagreement_score":0.014767629,"about_ca_system_score_codex":0.0020059224,"about_ca_system_score_gemma":0.0036335692,"threshold_uncertainty_score":0.049402595},"labels":[],"label_agreement":null},{"id":"W2126905415","doi":"10.1287/moor.2014.0704","title":"A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies","year":2015,"lang":"en","type":"article","venue":"Mathematics of 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 Alberta","funders":"","keywords":"Mathematics; Bounded function; Convergence (economics); Mathematical optimization; Bellman equation; Power iteration; Function (biology); Markov decision process; Optimal control; Average cost; Context (archaeology); Value (mathematics); Applied mathematics; Iterative method; Markov process","score_opus":0.33334413430034004,"score_gpt":0.500800905692265,"score_spread":0.16745677139192494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126905415","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.0013032112,0.000114554365,0.99736565,0.00009850691,0.000025588777,0.00001690141,0.000008145116,0.000038897775,0.0010284827],"genre_scores_gemma":[0.18128602,0.00045019813,0.81071746,0.00023091993,0.00012570186,0.0003543939,0.00007409948,0.00013397812,0.0066271694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829143,0.00091515144,0.00006470327,0.00023168394,0.00039692794,0.00010009405],"domain_scores_gemma":[0.9980532,0.0012892771,0.00015082976,0.00013147014,0.0002558012,0.00011937159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026910002,0.0010189163,0.0012215822,0.00081737764,0.00047569125,0.0013390796,0.0013594255,0.0016140137,0.002974013],"category_scores_gemma":[0.0065952213,0.0005712166,0.0013067618,0.0007131841,0.0017712936,0.001986062,0.002079263,0.0025838271,0.0006026254],"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.00005839712,0.00008646575,0.00046825976,0.00014941723,0.00008334138,0.00010678796,0.00016767227,0.41166466,0.003116321,0.50203973,0.0015520222,0.0805069],"study_design_scores_gemma":[0.000008626618,0.000038926566,0.000029301575,0.000016189832,0.000006744853,0.000024137482,0.0000056887015,0.9445839,0.00064071943,0.053055268,0.0015792385,0.000011285532],"about_ca_topic_score_codex":0.0014125422,"about_ca_topic_score_gemma":0.0012514001,"teacher_disagreement_score":0.002974013,"about_ca_system_score_codex":0.0013123426,"about_ca_system_score_gemma":0.0019814728,"threshold_uncertainty_score":0.014231563},"labels":[],"label_agreement":null},{"id":"W2129894886","doi":"10.1287/moor.1060.0202","title":"A Limit Theorem for Financial Markets with Inert Investors","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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 British Columbia","funders":"","keywords":"Mathematics; Fractional Brownian motion; Brownian motion; Limit (mathematics); Markov process; Scaling limit; Arbitrage; Financial market; Geometric Brownian motion; Scaling; Range (aeronautics); Central limit theorem; Econometrics; Applied mathematics; Mathematical economics; Economics; Diffusion process; Financial economics; Mathematical analysis; Finance; Statistics","score_opus":0.08526009564124368,"score_gpt":0.2917202838248761,"score_spread":0.2064601881836324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129894886","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.10524504,0.0029372491,0.8743888,0.0022548996,0.00025044786,0.00006483457,0.0001787927,0.00032057829,0.01435946],"genre_scores_gemma":[0.90068734,0.0028666162,0.082003616,0.00079352176,0.00070681283,0.00045351352,0.0002620983,0.0002194814,0.0120069925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898356,0.00041023127,0.000052959505,0.00016314404,0.0002527318,0.00013728347],"domain_scores_gemma":[0.9908963,0.0062816804,0.0009982788,0.00039795678,0.000823103,0.00060273916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006209938,0.001202177,0.0013870794,0.0018583747,0.0010790203,0.0021619403,0.0020953573,0.0019969305,0.0048166346],"category_scores_gemma":[0.021505632,0.00046430845,0.0017943879,0.0010409585,0.003466832,0.0059101614,0.0021668628,0.0020686344,0.0005199356],"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.000035514226,0.00004046321,0.00068151916,0.0001402234,0.00005829676,0.00021777688,0.00021330212,0.028966632,0.0019214343,0.9600886,0.0012134878,0.006422657],"study_design_scores_gemma":[0.000045027868,0.000070669965,0.00052418205,0.00004084583,0.000033137632,0.00023708298,0.00004287699,0.42457944,0.0005366204,0.5719766,0.0018817298,0.000031767322],"about_ca_topic_score_codex":0.0020140824,"about_ca_topic_score_gemma":0.0008176643,"teacher_disagreement_score":0.006209938,"about_ca_system_score_codex":0.001333097,"about_ca_system_score_gemma":0.0011202722,"threshold_uncertainty_score":0.032841682},"labels":[],"label_agreement":null},{"id":"W2131783450","doi":"10.1287/moor.1050.0163","title":"Estimating Tangent and Normal Cones Without Calculus","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":16,"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":"Mathematics; Tangent cone; Tangent; Simple (philosophy); Base (topology); Boundary (topology); Set (abstract data type); Calculus (dental); Point (geometry); Tangent vector; Mathematical analysis; Applied mathematics; Geometry; Computer science","score_opus":0.20377526559783887,"score_gpt":0.4655214666875346,"score_spread":0.2617462010896957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131783450","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.03941757,0.00082775607,0.95660186,0.00026232554,0.00007570041,0.00005097819,0.00009475727,0.00012936945,0.002539647],"genre_scores_gemma":[0.6501867,0.002705633,0.33662334,0.00026749275,0.0004832797,0.00020654178,0.00066839054,0.00036872763,0.008489909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963787,0.00082040875,0.0002864382,0.0008137546,0.0013947096,0.00030590242],"domain_scores_gemma":[0.9785039,0.012952095,0.0026687328,0.0020190438,0.0026715274,0.0011846486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009692293,0.002023889,0.0025854316,0.004412936,0.0010517887,0.00433809,0.0031544545,0.001899605,0.002112226],"category_scores_gemma":[0.04902426,0.0011040169,0.0018581102,0.0023511404,0.0046483167,0.010471758,0.0052573625,0.0043080803,0.00030549773],"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.00015004886,0.000098599274,0.004105728,0.0003606849,0.00013006592,0.00038189234,0.00039781307,0.20513065,0.007984337,0.7417751,0.0013108323,0.03817422],"study_design_scores_gemma":[0.0000110102,0.00010466639,0.0014917024,0.00006911359,0.000043569573,0.00013865634,0.00010850151,0.69729114,0.0028411215,0.29596472,0.0018645204,0.00007130715],"about_ca_topic_score_codex":0.0061135925,"about_ca_topic_score_gemma":0.0034252554,"teacher_disagreement_score":0.009692293,"about_ca_system_score_codex":0.002394685,"about_ca_system_score_gemma":0.0015172628,"threshold_uncertainty_score":0.051258385},"labels":[],"label_agreement":null},{"id":"W2132064078","doi":"10.1287/moor.2013.0620","title":"Approximability of Robust Network Design","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Cooperative Communication and Network Coding","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":"Mathematics; Steiner tree problem; Network planning and design; Polytope; Approximation algorithm; Robustness (evolution); Combinatorics; Mathematical optimization; Reduction (mathematics); Generalization; Discrete mathematics; Regular polygon; Convex polytope; Convex optimization; Computer science; Convex set","score_opus":0.2796842248226325,"score_gpt":0.387521989843839,"score_spread":0.10783776502120651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132064078","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.021373956,0.00063070323,0.9701971,0.00048738735,0.000054746062,0.000054098036,0.00020950678,0.00036628015,0.006626287],"genre_scores_gemma":[0.6853712,0.0013063059,0.3048301,0.0003102228,0.00019215769,0.00030909112,0.00080528035,0.00030719832,0.0065683844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968771,0.0010344908,0.0001430419,0.00090217806,0.0007169242,0.0003262212],"domain_scores_gemma":[0.9911997,0.0063071926,0.00072248036,0.0011296349,0.00045997417,0.00018103035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028113546,0.0018351253,0.0017257205,0.00096940045,0.00054532965,0.0023447024,0.0020138533,0.0019355677,0.004870076],"category_scores_gemma":[0.01766042,0.0009219865,0.0020301503,0.0010338707,0.0023274291,0.0042177825,0.002907722,0.003300555,0.00068845385],"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.00010107906,0.000032056345,0.00045207315,0.00016681514,0.000047920767,0.00006144528,0.0000796743,0.8994971,0.0008798261,0.082457826,0.0009085837,0.015315688],"study_design_scores_gemma":[0.000014202793,0.000029611527,0.000055452554,0.00001626336,0.0000100195375,0.000025984291,0.000014545691,0.8978336,0.00041994732,0.100502536,0.0010706803,0.00000726077],"about_ca_topic_score_codex":0.0023629419,"about_ca_topic_score_gemma":0.0016243506,"teacher_disagreement_score":0.004870076,"about_ca_system_score_codex":0.0026320422,"about_ca_system_score_gemma":0.0009722113,"threshold_uncertainty_score":0.019096851},"labels":[],"label_agreement":null},{"id":"W2136937392","doi":"10.1287/moor.1050.0148","title":"On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"National Science Foundation","keywords":"Polytope; Mathematics; Markov decision process; Markov chain; State (computer science); Element (criminal law); Action (physics); Limit (mathematics); Empirical research; Finite state; Markov process; Mathematical optimization; Mathematical economics; Combinatorics; Statistics; Algorithm; Mathematical analysis; Law","score_opus":0.31700725284698666,"score_gpt":0.46017316569362243,"score_spread":0.14316591284663577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136937392","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.23369938,0.0006927629,0.75780016,0.00081263686,0.000046577297,0.00007434916,0.00019275199,0.00018255346,0.0064988662],"genre_scores_gemma":[0.9342227,0.00086784514,0.061394587,0.0001173793,0.00012507336,0.00026908904,0.00020174317,0.00011055849,0.0026910393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622786,0.0016026044,0.00019205408,0.0006974065,0.0008329007,0.00044726665],"domain_scores_gemma":[0.94660753,0.04479291,0.0038843572,0.0018771044,0.0016045807,0.0012335925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065195123,0.00081151206,0.0013855161,0.0015743544,0.0010192916,0.002532159,0.0016870825,0.0014355923,0.0036270476],"category_scores_gemma":[0.03610321,0.0008273764,0.0007925252,0.0011884595,0.0047935518,0.005824296,0.0027141825,0.0026372494,0.00035135637],"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.00016358474,0.000072202405,0.0015725814,0.00011175774,0.00004387851,0.0001289329,0.00027694486,0.3607748,0.0020264878,0.62433213,0.0003400574,0.010156719],"study_design_scores_gemma":[0.00002902365,0.00008151016,0.00083608116,0.000046275876,0.00001346819,0.000057994654,0.000072947085,0.6539472,0.0006073636,0.34375054,0.00052253634,0.000035017652],"about_ca_topic_score_codex":0.0018703465,"about_ca_topic_score_gemma":0.0009423223,"teacher_disagreement_score":0.0065195123,"about_ca_system_score_codex":0.0024830773,"about_ca_system_score_gemma":0.0013100667,"threshold_uncertainty_score":0.034478903},"labels":[],"label_agreement":null},{"id":"W2140964741","doi":"10.1287/moor.26.2.234.10553","title":"On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Point processes and geometric inequalities","field":"Mathematics","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":"Mathematics; Dual cone and polar cone; Homogeneous; Regular polygon; Convex cone; Cone (formal languages); Duality (order theory); Invariant (physics); Convex set; Subderivative; Convex analysis; Mathematical analysis; Combinatorics; Pure mathematics; Convex optimization; Geometry; Algorithm","score_opus":0.23114635500947497,"score_gpt":0.4375620588307149,"score_spread":0.20641570382123994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140964741","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.42636615,0.0016280042,0.44320208,0.0016361625,0.00010394404,0.000099724435,0.00021895234,0.00008258873,0.12666245],"genre_scores_gemma":[0.9394918,0.0011522869,0.049424022,0.0001585609,0.00012135244,0.00008887314,0.00013696612,0.000026738306,0.009399272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995877,0.00013139531,0.000020333277,0.00007510063,0.00011136995,0.00007395167],"domain_scores_gemma":[0.99851304,0.00074101373,0.00022980002,0.00011670024,0.0002058141,0.00019354146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010889408,0.0005128361,0.00042527803,0.0012643726,0.00083717133,0.0016144118,0.0005234665,0.00055544736,0.0034211057],"category_scores_gemma":[0.0022492048,0.00013996774,0.00046192386,0.00086987205,0.003282192,0.0029033911,0.0012091076,0.0011568194,0.0002698458],"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.0000073406795,0.0000059250347,0.00011907755,0.000010200567,0.0000013176057,0.000044325305,0.00005919068,0.00058336963,0.0005073919,0.9967529,0.00016144152,0.0017474764],"study_design_scores_gemma":[0.0000072037196,0.000018763347,0.0003225632,0.0000098885885,0.0000030923743,0.000102205166,0.00011656834,0.0070959646,0.0007706207,0.98903686,0.0025101884,0.0000060813504],"about_ca_topic_score_codex":0.00067355053,"about_ca_topic_score_gemma":0.0004470277,"teacher_disagreement_score":0.0034211057,"about_ca_system_score_codex":0.00092129403,"about_ca_system_score_gemma":0.0003116861,"threshold_uncertainty_score":0.011444688},"labels":[],"label_agreement":null},{"id":"W2141286079","doi":"10.1287/moor.1090.0406","title":"Locating Objects in the Plane Using Global Optimization Techniques","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Robotics and Sensor-Based Localization","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Ministerio de Ciencia e Innovación","keywords":"Mathematics; Translation (biology); Regular polygon; Plane (geometry); Rotation (mathematics); Measure (data warehouse); Object (grammar); Set (abstract data type); Mathematical optimization; Global optimization; Cutting-plane method; Optimization problem; Resolution (logic); Geometry; Artificial intelligence; Computer science; Integer programming","score_opus":0.07408521259537527,"score_gpt":0.37156391302561786,"score_spread":0.2974787004302426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141286079","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.0018942669,0.00013922344,0.99721956,0.000052375555,0.00000617171,0.0000058170976,0.000018091841,0.00007219779,0.00059236697],"genre_scores_gemma":[0.3114186,0.0015498752,0.6823961,0.00008822796,0.00010940052,0.0001929262,0.00034286248,0.0002006898,0.0037012557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999526,0.00015650064,0.000019990326,0.000112251815,0.00014338494,0.000041848747],"domain_scores_gemma":[0.99947304,0.0002611806,0.000089218025,0.00008499453,0.00006985381,0.000021701371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442899,0.0015580828,0.0014930513,0.0009885535,0.00030100637,0.0012183754,0.0011461884,0.0010168896,0.0013039819],"category_scores_gemma":[0.0022199622,0.00057949073,0.0008062695,0.0015336762,0.001222893,0.001963283,0.00171763,0.0009882004,0.00047403233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043010077,0.000011243135,0.00013997666,0.000071541304,0.000026601549,0.000027241791,0.0000335323,0.9414967,0.0022774409,0.022521425,0.0006992162,0.0326521],"study_design_scores_gemma":[0.000009089669,0.000040375977,0.00007183218,0.000009922264,0.000009662826,0.000025815598,0.000011225475,0.9787371,0.0010608673,0.018780379,0.0012364191,0.0000073427673],"about_ca_topic_score_codex":0.0013068838,"about_ca_topic_score_gemma":0.0008997172,"teacher_disagreement_score":0.0015580828,"about_ca_system_score_codex":0.00064524816,"about_ca_system_score_gemma":0.0005784332,"threshold_uncertainty_score":0.0055227876},"labels":[],"label_agreement":null},{"id":"W2144766726","doi":"10.1287/moor.27.4.647.307","title":"Cost Allocation for a Tree Network with Heterogeneous Customers","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Voting Systems","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":"University of British Columbia","funders":"","keywords":"Game tree; Tree (set theory); Shapley value; Vertex (graph theory); Mathematics; Core (optical fiber); Mathematical optimization; Cost allocation; Computer science; Cooperative game theory; Graph; Combinatorics; Game theory; Sequential game; Mathematical economics","score_opus":0.24337469006307053,"score_gpt":0.3435405823925388,"score_spread":0.10016589232946829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144766726","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.17197634,0.00014060289,0.8146402,0.00044874268,0.000035387075,0.00017043125,0.00016172833,0.00009558849,0.012330996],"genre_scores_gemma":[0.8033618,0.0003266997,0.1877854,0.000115883704,0.00003882999,0.00026812195,0.00024971488,0.000086177104,0.0077674687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.00026890583,0.000024886389,0.00014878955,0.000114855095,0.00017934424],"domain_scores_gemma":[0.9988176,0.0007303321,0.00011855404,0.00007582272,0.000099567136,0.00015802842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861441,0.00082063593,0.00079875847,0.000611946,0.0008676328,0.0014980272,0.0015832417,0.0010498081,0.004953626],"category_scores_gemma":[0.0032682288,0.00039007768,0.0007976286,0.0009102456,0.0011005402,0.0030099242,0.0014832994,0.0011831243,0.00033379486],"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.00023482199,0.00013099948,0.00070855144,0.00011992046,0.000039396582,0.00030246278,0.0002269477,0.7180618,0.003788841,0.2531061,0.0020986348,0.021181507],"study_design_scores_gemma":[0.000016888507,0.000039229228,0.00014850107,0.0000065097274,0.000011484934,0.00005333404,0.00007533631,0.93524134,0.0005758097,0.06283939,0.0009840792,0.000008079674],"about_ca_topic_score_codex":0.0039315866,"about_ca_topic_score_gemma":0.0033420573,"teacher_disagreement_score":0.004953626,"about_ca_system_score_codex":0.0023846284,"about_ca_system_score_gemma":0.00092080265,"threshold_uncertainty_score":0.017301798},"labels":[],"label_agreement":null},{"id":"W2154558981","doi":"10.1287/moor.1040.0124","title":"A Conic Programming Approach to Generalized Tchebycheff Inequalities","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"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":"Conic section; Mathematics; Semidefinite programming; Piecewise; Mathematical optimization; Class (philosophy); Applied mathematics; Mathematical analysis; Computer science","score_opus":0.2856956413919422,"score_gpt":0.4884137580789195,"score_spread":0.2027181166869773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154558981","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.005867183,0.0006301253,0.9805432,0.00054460583,0.00011246442,0.000019551793,0.000107351756,0.000051039104,0.012124447],"genre_scores_gemma":[0.5203259,0.0036818646,0.45323777,0.001274427,0.00094162737,0.00037782427,0.00043192363,0.00020710626,0.019521516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991689,0.0003017605,0.000028894661,0.00013795117,0.00023475416,0.00012769912],"domain_scores_gemma":[0.9980774,0.001153836,0.00019358806,0.00019297113,0.00028217174,0.000100031844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015313107,0.0011616921,0.0009477468,0.0012775061,0.00066525704,0.0018409692,0.0016569147,0.001273457,0.0057053794],"category_scores_gemma":[0.0054281326,0.0003861076,0.0006293611,0.002459862,0.0021464077,0.0024725008,0.0013316954,0.003997209,0.000561112],"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.000015426642,0.000013695588,0.00008729659,0.000049443086,0.000009853447,0.00004323708,0.00003192487,0.11093892,0.0005709878,0.87632924,0.0017086561,0.010201373],"study_design_scores_gemma":[0.0000057560446,0.000021996051,0.00006893411,0.000020553083,0.0000054290313,0.000045804725,0.000018913306,0.60749394,0.000593426,0.38706818,0.004645254,0.000011825526],"about_ca_topic_score_codex":0.0026797366,"about_ca_topic_score_gemma":0.0023594417,"teacher_disagreement_score":0.0057053794,"about_ca_system_score_codex":0.0018434584,"about_ca_system_score_gemma":0.001159205,"threshold_uncertainty_score":0.01908642},"labels":[],"label_agreement":null},{"id":"W2156211713","doi":"10.1287/moor.1090.0397","title":"Markov Decision Processes with Arbitrary Reward Processes","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":102,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov decision process; Regret; Hindsight bias; Reinforcement learning; Mathematical optimization; Mathematics; Q-learning; Markov process; Realization (probability); Function (biology); Trajectory; Markov chain; Process (computing); Computer science; Artificial intelligence","score_opus":0.20504333039520903,"score_gpt":0.5069362652545172,"score_spread":0.3018929348593081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156211713","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.07089176,0.00034312037,0.920385,0.0015067472,0.000105480176,0.00011676818,0.00024983723,0.0002135221,0.0061878464],"genre_scores_gemma":[0.90538144,0.00051680877,0.08349757,0.00023034416,0.00016210446,0.0003366682,0.00024383454,0.00003944586,0.009591855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710053,0.0011563782,0.000111618836,0.0007027158,0.00039388158,0.0005347928],"domain_scores_gemma":[0.9923379,0.005422144,0.0009176061,0.00050529424,0.00036899647,0.00044811185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036373828,0.0016218864,0.0020326502,0.00063432887,0.00087395916,0.0023136684,0.0028284492,0.0031669892,0.0036075928],"category_scores_gemma":[0.013209074,0.0007958619,0.0011872556,0.0010741932,0.0027028492,0.0031415334,0.0019952215,0.0034484959,0.0006649224],"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.00018926384,0.00010482749,0.00090821786,0.00006004055,0.000054646487,0.0003183068,0.000091663096,0.7284779,0.0005521195,0.26250985,0.0006348015,0.00609842],"study_design_scores_gemma":[0.00004260061,0.00002976945,0.00007822416,0.000005410485,0.000010907394,0.000017370892,0.00000825331,0.93349445,0.00017981461,0.065788545,0.0003328132,0.000011731067],"about_ca_topic_score_codex":0.0057931263,"about_ca_topic_score_gemma":0.003610947,"teacher_disagreement_score":0.0057931263,"about_ca_system_score_codex":0.002037786,"about_ca_system_score_gemma":0.001622648,"threshold_uncertainty_score":0.019236565},"labels":[],"label_agreement":null},{"id":"W2157555448","doi":"10.1287/moor.1090.0419","title":"A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"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":"Semidefinite programming; Mathematics; Relaxation (psychology); Quadratic assignment problem; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Dimension (graph theory); Quadratic equation; Positive-definite matrix; Majorization; Upper and lower bounds; Optimization problem; Combinatorics; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.15589598525044532,"score_gpt":0.4509045053540539,"score_spread":0.29500852010360856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157555448","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.003847922,0.00015571085,0.9907823,0.00035689407,0.000050396437,0.000058056186,0.00012864245,0.00013663147,0.004483555],"genre_scores_gemma":[0.20675965,0.0007820115,0.7825029,0.0005565302,0.00028199598,0.00069445506,0.0010902018,0.0004302448,0.0069019417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787474,0.00087781437,0.0000923163,0.00039677776,0.00061512075,0.00014325647],"domain_scores_gemma":[0.99329716,0.0045829588,0.0005405197,0.0005954078,0.00072019896,0.00026371243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038353936,0.0015075231,0.0011460056,0.0008608851,0.0005499054,0.0018742462,0.0015159798,0.0014317884,0.006187938],"category_scores_gemma":[0.013041649,0.0006633454,0.0010117654,0.0012544134,0.0015987463,0.0026807946,0.0021955674,0.0059172534,0.0016597236],"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.00019059259,0.0003896736,0.00041145706,0.0004496236,0.00006229508,0.00014902215,0.00018171321,0.6666509,0.006182275,0.22064424,0.015461622,0.08922665],"study_design_scores_gemma":[0.000026725049,0.00009404499,0.00008535076,0.000030734678,0.0000074034638,0.000056269295,0.00003008442,0.94489384,0.0011035685,0.050255258,0.0034007414,0.000015955775],"about_ca_topic_score_codex":0.0010905509,"about_ca_topic_score_gemma":0.0014302104,"teacher_disagreement_score":0.006187938,"about_ca_system_score_codex":0.0012618183,"about_ca_system_score_gemma":0.0018578582,"threshold_uncertainty_score":0.020700753},"labels":[],"label_agreement":null},{"id":"W2158898601","doi":"10.1287/moor.1100.0473","title":"On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Semidefinite programming; Quadratically constrained quadratic program; Mathematics; Semidefinite embedding; Quadratic growth; Quadratic programming; Relaxation (psychology); Equivalence (formal languages); Positive-definite matrix; Mathematical optimization; Second-order cone programming; Matrix (chemical analysis); Quadratic equation; Representation (politics); Applied mathematics; Discrete mathematics; Algorithm; Convex optimization","score_opus":0.22194514997965425,"score_gpt":0.40085174523395956,"score_spread":0.1789065952543053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158898601","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.01464768,0.0008564943,0.96177715,0.0011626935,0.00013984993,0.00012511916,0.00017452224,0.00016725909,0.020949312],"genre_scores_gemma":[0.51537395,0.0036419395,0.46039626,0.0019820775,0.0010548214,0.0011124185,0.0010547767,0.0008382873,0.014545469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993601,0.0029828926,0.0002555676,0.00077869825,0.0017489,0.00063285924],"domain_scores_gemma":[0.96766204,0.02631798,0.0018116662,0.0013363829,0.002024366,0.00084757607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010540574,0.0030822968,0.0015061314,0.0018042385,0.00094060414,0.0032911394,0.0021762725,0.0019001837,0.0098310765],"category_scores_gemma":[0.038780253,0.000873388,0.0016372621,0.0020421408,0.0044922023,0.006278197,0.0046461066,0.009406665,0.0015631119],"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.00025405394,0.0004122444,0.0004779775,0.00043936286,0.00006713532,0.00018477689,0.00048126234,0.16690591,0.0029196606,0.7718031,0.005893407,0.050161052],"study_design_scores_gemma":[0.00005279481,0.00027031638,0.00028414442,0.00011108695,0.00002155672,0.00010465822,0.00013681334,0.5318713,0.001305794,0.46251023,0.0032932484,0.00003802236],"about_ca_topic_score_codex":0.0012244508,"about_ca_topic_score_gemma":0.0010671873,"teacher_disagreement_score":0.010540574,"about_ca_system_score_codex":0.0022206383,"about_ca_system_score_gemma":0.0013540367,"threshold_uncertainty_score":0.05574453},"labels":[],"label_agreement":null},{"id":"W2160146903","doi":"10.1287/moor.1070.0254","title":"The Demand-Matching Problem","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"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":"Bipartite graph; Mathematics; Knapsack problem; Cardinality (data modeling); Matching (statistics); Combinatorics; Tree (set theory); Clos network; Discrete mathematics; Approximation algorithm; Time complexity; Node (physics); 3-dimensional matching; Mathematical optimization; Graph; Computer science","score_opus":0.07242089226921299,"score_gpt":0.4165825610196921,"score_spread":0.3441616687504791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160146903","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.058965065,0.0017419488,0.8370247,0.009193605,0.0005197439,0.00073344936,0.004402379,0.00060555607,0.08681356],"genre_scores_gemma":[0.59270465,0.0038195509,0.34202078,0.001994025,0.00091313315,0.00093795086,0.0075409613,0.0005393058,0.049529642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976948,0.0008504767,0.00014082502,0.0005583831,0.00040848364,0.0003469473],"domain_scores_gemma":[0.99760723,0.0014621667,0.00022974247,0.0002613891,0.00020341753,0.00023607875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020470258,0.0012246292,0.0014520087,0.0008021856,0.0011363281,0.0033742145,0.00272876,0.0039795116,0.026455512],"category_scores_gemma":[0.006537085,0.0007078254,0.0011489239,0.0022949993,0.0008971564,0.007811904,0.0025719444,0.0024690302,0.0030313823],"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.00042785553,0.00053986546,0.0012488309,0.0007792002,0.00012541401,0.00035274847,0.000223814,0.12050216,0.002240437,0.7328247,0.0492887,0.09144631],"study_design_scores_gemma":[0.00013763898,0.00016185665,0.0004886585,0.0000879049,0.00004835321,0.00060951215,0.0003534044,0.3174341,0.0017063278,0.611775,0.06716072,0.000036519596],"about_ca_topic_score_codex":0.0012554444,"about_ca_topic_score_gemma":0.0011399954,"teacher_disagreement_score":0.026455512,"about_ca_system_score_codex":0.0017368103,"about_ca_system_score_gemma":0.0012545778,"threshold_uncertainty_score":0.08850253},"labels":[],"label_agreement":null},{"id":"W2162870855","doi":"10.1287/moor.26.1.31.10590","title":"A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Computer science; Multiprocessor scheduling; Preemption; Time complexity; Multiprocessing; Algorithm; Scheduling (production processes); Job shop scheduling; Parallel computing; Schedule; Mathematics; Flow shop scheduling; Mathematical optimization; Operating system","score_opus":0.05539017173752653,"score_gpt":0.354648109459684,"score_spread":0.2992579377221575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162870855","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.012191984,0.0004904136,0.9663579,0.00094264105,0.00013776297,0.00036784768,0.00042697068,0.00510444,0.0139800515],"genre_scores_gemma":[0.12932155,0.00021514804,0.86024654,0.00025565596,0.000074451455,0.00045786198,0.0009956443,0.000568245,0.0078649465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.0003274528,0.000093237846,0.0004218563,0.00038480223,0.0003891908],"domain_scores_gemma":[0.9985221,0.0007163525,0.00010170319,0.0003408894,0.00017372613,0.00014532343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013646381,0.0014651136,0.0012507293,0.00093006,0.0013592377,0.0017631658,0.0025063392,0.0017361359,0.014675357],"category_scores_gemma":[0.0039453204,0.0006427492,0.0013003468,0.0019656527,0.00095989363,0.0027029957,0.002326063,0.0026063863,0.0039742207],"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.0009500939,0.00077626086,0.00073466456,0.00071745995,0.000122044214,0.00026391458,0.00048240757,0.2082833,0.011454574,0.19835174,0.041360594,0.536503],"study_design_scores_gemma":[0.0009958777,0.00027352563,0.00033589467,0.000057277903,0.00003990741,0.0001930445,0.00008796539,0.7589394,0.003457393,0.2086332,0.026926776,0.000059672286],"about_ca_topic_score_codex":0.003776251,"about_ca_topic_score_gemma":0.0039162613,"teacher_disagreement_score":0.014675357,"about_ca_system_score_codex":0.0027777334,"about_ca_system_score_gemma":0.0030104395,"threshold_uncertainty_score":0.04909396},"labels":[],"label_agreement":null},{"id":"W2164655620","doi":"10.1287/moor.1070.0285","title":"A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":100,"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":"Independent and identically distributed random variables; Dual (grammatical number); Mathematical optimization; Multiplicative function; Inventory control; Computer science; Lost sales; Marginal cost; Autoregressive model; Holding cost; Order (exchange); Mathematical economics; Random variable; Mathematics; Econometrics; Operations research; Economics; Microeconomics; Statistics; Finance","score_opus":0.12179615909050955,"score_gpt":0.31301050241897693,"score_spread":0.19121434332846737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164655620","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.01303692,0.00034099026,0.98254997,0.0003079041,0.000073976014,0.00007589849,0.00011172357,0.00068061054,0.0028219968],"genre_scores_gemma":[0.4971251,0.00045321128,0.4949149,0.00033767027,0.00011193198,0.00046208044,0.0006517442,0.00023369779,0.0057096854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906534,0.00028679727,0.000055473927,0.00019806031,0.00019238687,0.0002019505],"domain_scores_gemma":[0.99850625,0.0010344872,0.00012220518,0.00013628359,0.00012089185,0.000079712525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857402,0.001358548,0.0019438408,0.00086315785,0.00077786733,0.0017981936,0.0019548128,0.0017853014,0.0058822623],"category_scores_gemma":[0.004656151,0.0007376471,0.00090458203,0.0011861309,0.00075692206,0.002570885,0.0016026221,0.002400938,0.000899461],"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.00018975482,0.000097331955,0.00039953165,0.0000649728,0.000034570796,0.000045880657,0.00005926457,0.91216063,0.0003601906,0.033811923,0.0023330573,0.050442852],"study_design_scores_gemma":[0.000020649783,0.000013371682,0.000021333395,0.000003957452,0.000003005633,0.000008653223,0.000006700014,0.9866477,0.00006761652,0.012839013,0.00036511134,0.000002862994],"about_ca_topic_score_codex":0.007532387,"about_ca_topic_score_gemma":0.006080665,"teacher_disagreement_score":0.007532387,"about_ca_system_score_codex":0.0024181458,"about_ca_system_score_gemma":0.0031038532,"threshold_uncertainty_score":0.019678116},"labels":[],"label_agreement":null},{"id":"W2166100185","doi":"10.1287/moor.2014.0662","title":"Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Université de Montréal","funders":"","keywords":"Set (abstract data type); Normative; Object (grammar); Mechanism (biology); School choice; Computer science; Stability (learning theory); Mechanism design; Simple (philosophy); Linear programming; Strategic dominance; Mathematical economics; Mathematical optimization; Operations research; Economics; Mathematics; Artificial intelligence; Programming language; Machine learning","score_opus":0.13724092116046308,"score_gpt":0.332315853002385,"score_spread":0.1950749318419219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166100185","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.060888868,0.00021557238,0.9196213,0.0023641125,0.00018281072,0.00016745763,0.0000804182,0.00035611042,0.016123345],"genre_scores_gemma":[0.80925065,0.00023285764,0.18082687,0.0009795252,0.00018006907,0.00032274,0.00007685482,0.0001205152,0.0080099115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912367,0.004064579,0.00058726495,0.00150424,0.0018176171,0.00078963366],"domain_scores_gemma":[0.96351904,0.021544537,0.0035911687,0.0057310853,0.0037824896,0.0018315886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013218493,0.0006522198,0.00094673736,0.0008466919,0.0012070162,0.0034727857,0.0025081697,0.0021646165,0.0049859826],"category_scores_gemma":[0.05834665,0.00061062665,0.0017428551,0.00081744586,0.004361931,0.0076799616,0.0029491659,0.004974319,0.00082606595],"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.000101340964,0.00009529059,0.0005190649,0.000088850924,0.00004116993,0.00014824716,0.00049676566,0.0094634285,0.002638777,0.96631104,0.0008789689,0.019217117],"study_design_scores_gemma":[0.00019235307,0.0002318491,0.00026494396,0.000034155408,0.000044307453,0.00019181268,0.00012864119,0.08208971,0.0030451922,0.90790844,0.005823103,0.000045567198],"about_ca_topic_score_codex":0.0014864518,"about_ca_topic_score_gemma":0.00072031404,"teacher_disagreement_score":0.013218493,"about_ca_system_score_codex":0.0014659453,"about_ca_system_score_gemma":0.0030173613,"threshold_uncertainty_score":0.06990689},"labels":[],"label_agreement":null},{"id":"W2166630570","doi":"10.1287/moor.2017.0895","title":"On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation","year":2018,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Fonds De La Recherche Scientifique - FNRS","keywords":"Robust principal component analysis; Sparse PCA; Principal component analysis; Matrix (chemical analysis); Computation; Bipartite graph; Binary number; Logical matrix; Basis (linear algebra)","score_opus":0.12579522338170646,"score_gpt":0.336740079970483,"score_spread":0.21094485658877654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166630570","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.085838735,0.005548132,0.8578553,0.013390426,0.0004836624,0.000296588,0.0031941729,0.0013925699,0.03200043],"genre_scores_gemma":[0.6573587,0.005443451,0.31176734,0.0026293918,0.0010529369,0.0008412982,0.0052230996,0.0011869621,0.014496721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995503,0.0015229377,0.00021509445,0.0009295647,0.0012081392,0.0006214264],"domain_scores_gemma":[0.95519525,0.038516663,0.0014984095,0.0023739776,0.001737709,0.00067789404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036778117,0.0019320771,0.0027619123,0.0010986656,0.0014131193,0.0042626304,0.0027982646,0.0022990261,0.008809015],"category_scores_gemma":[0.030229863,0.0008548163,0.0018891492,0.0024745916,0.003139854,0.0072467187,0.0040531578,0.0060567204,0.0013747528],"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.0010708899,0.00034680718,0.002762231,0.0011912598,0.0002085691,0.0005241836,0.00049514556,0.56079006,0.003948157,0.28220704,0.038162403,0.10829326],"study_design_scores_gemma":[0.000056472647,0.00005273009,0.00052164024,0.000055499753,0.000034908677,0.00013945652,0.00009826619,0.66913325,0.000774309,0.3271494,0.0019557276,0.00002837376],"about_ca_topic_score_codex":0.0052157845,"about_ca_topic_score_gemma":0.006141223,"teacher_disagreement_score":0.008809015,"about_ca_system_score_codex":0.0032254064,"about_ca_system_score_gemma":0.0029569678,"threshold_uncertainty_score":0.029469013},"labels":[],"label_agreement":null},{"id":"W2167286763","doi":"10.1287/moor.2014.0702","title":"Entrepreneurial Decisions on Effort and Project with a Nonconcave Objective Function","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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 Alberta","funders":"","keywords":"Mathematics; Bellman equation; Mathematical optimization; Mathematical economics; Function (biology); Hull; Martingale (probability theory); Applied mathematics","score_opus":0.22463733283475137,"score_gpt":0.3527352854015343,"score_spread":0.12809795256678294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167286763","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.21326628,0.0007943257,0.75641584,0.0027026422,0.00009984687,0.00025263947,0.000207397,0.0001061504,0.026154855],"genre_scores_gemma":[0.9031695,0.0005599887,0.08166083,0.0001304529,0.00006606354,0.00023222053,0.000086113156,0.00003911046,0.01405559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984334,0.0008779754,0.000053069285,0.0002285844,0.0001511926,0.00025580346],"domain_scores_gemma":[0.99621236,0.0024968802,0.0004999872,0.00016806247,0.00019614027,0.00042655075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003963328,0.0009799242,0.0015466838,0.0006707416,0.0005983858,0.0022618005,0.0011600726,0.0022702732,0.0053055678],"category_scores_gemma":[0.0077062873,0.0007970573,0.0007916926,0.00067840674,0.0018307964,0.0022560498,0.0014973853,0.0018552779,0.00037510123],"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.00020798974,0.00021597603,0.0016143564,0.00015403482,0.000064915024,0.00041706432,0.00012494848,0.7446969,0.0010764033,0.22736877,0.001400462,0.0226582],"study_design_scores_gemma":[0.000050769235,0.00011831508,0.0008315822,0.000039806426,0.000025612651,0.000068715344,0.00005659587,0.910664,0.0006716604,0.08611804,0.0013231821,0.000031597287],"about_ca_topic_score_codex":0.0020861987,"about_ca_topic_score_gemma":0.0016684026,"teacher_disagreement_score":0.0053055678,"about_ca_system_score_codex":0.0018425392,"about_ca_system_score_gemma":0.0019154879,"threshold_uncertainty_score":0.020960271},"labels":[],"label_agreement":null},{"id":"W2167508847","doi":"10.1287/moor.26.4.796.10012","title":"When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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 Waterloo","funders":"National Science Foundation","keywords":"Constraint (computer-aided design); Mathematics; Lift (data mining); Integer programming; Mathematical optimization; Integer (computer science); Mathematical economics; Computer science; Geometry; Data mining","score_opus":0.08849708786235158,"score_gpt":0.3650675527512243,"score_spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167508847","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.13732332,0.00032213723,0.8382339,0.0030111875,0.00026360765,0.00030908955,0.00009490618,0.0005004563,0.019941308],"genre_scores_gemma":[0.55654424,0.00050983357,0.43593928,0.00072368036,0.00021837743,0.00029803556,0.00017577368,0.0004535747,0.0051372466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942059,0.0029119027,0.00035858076,0.00057258736,0.001078394,0.000872644],"domain_scores_gemma":[0.9644104,0.027042447,0.00222546,0.0040235473,0.0015019464,0.0007962708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014609737,0.0011123552,0.0014349035,0.0010551026,0.0025690983,0.002723888,0.0016993855,0.003031218,0.009205751],"category_scores_gemma":[0.07263664,0.0008483378,0.0015751242,0.0016355966,0.004818596,0.011348204,0.0052227513,0.0041457317,0.0019534298],"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.0006743378,0.00037820972,0.002533399,0.0003027138,0.000058774418,0.00032248633,0.0005492585,0.030759387,0.0067844805,0.8184229,0.0037823569,0.13543169],"study_design_scores_gemma":[0.000116653755,0.000462662,0.0006428586,0.00013604989,0.00004533247,0.00037020762,0.0004067721,0.14934868,0.011216508,0.83318937,0.003995471,0.00006948576],"about_ca_topic_score_codex":0.00054668536,"about_ca_topic_score_gemma":0.0007166041,"teacher_disagreement_score":0.014609737,"about_ca_system_score_codex":0.00073230825,"about_ca_system_score_gemma":0.0024322325,"threshold_uncertainty_score":0.07726461},"labels":[],"label_agreement":null},{"id":"W2168573415","doi":"10.1287/moor.1040.0113","title":"Explicit Solution of a Stochastic, Irreversible Investment Problem and Its Moving Threshold","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Optimal stopping; Mathematics; Mathematical optimization; Variational inequality; Profit (economics); Investment (military); Optimal control; Stochastic control; Obstacle problem; Shadow price; Monotone polygon; Boundary (topology); Bellman equation; Free boundary problem; Obstacle; Mathematical economics; Singular control; Economics; Microeconomics","score_opus":0.11381685190411865,"score_gpt":0.32109494761778185,"score_spread":0.20727809571366318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168573415","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.29943907,0.0017439183,0.63027716,0.005159092,0.00026021042,0.000063865235,0.00026346682,0.00020885558,0.06258431],"genre_scores_gemma":[0.95691556,0.0004614831,0.023722414,0.0001806465,0.00007781536,0.000071987895,0.000101783866,0.000057092962,0.018411135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995833,0.000119967815,0.000023373845,0.000085901476,0.00009414029,0.00009333165],"domain_scores_gemma":[0.9989397,0.00057736743,0.00017016566,0.000047468064,0.00011321724,0.00015208941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068876,0.0005705362,0.00095035054,0.0007050836,0.00048592317,0.0018296866,0.0010539894,0.0020260024,0.0032391977],"category_scores_gemma":[0.0036609264,0.00052442687,0.0007664648,0.00047662834,0.0021440755,0.0014193996,0.0014171245,0.0012956026,0.00021946339],"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.000046280304,0.00005051606,0.00050984643,0.00007002534,0.000027329972,0.0002853966,0.00009748497,0.34842047,0.0018406908,0.64370996,0.0009871884,0.0039548],"study_design_scores_gemma":[0.000019026571,0.00002309765,0.00019524798,0.000016776547,0.0000094202005,0.000035559027,0.000038068003,0.834487,0.000342524,0.1639415,0.0008787583,0.0000130304725],"about_ca_topic_score_codex":0.004447341,"about_ca_topic_score_gemma":0.0024249637,"teacher_disagreement_score":0.004447341,"about_ca_system_score_codex":0.0018253347,"about_ca_system_score_gemma":0.0017578537,"threshold_uncertainty_score":0.013243794},"labels":[],"label_agreement":null},{"id":"W2169572499","doi":"10.1287/moor.28.2.382.14484","title":"Optimal Replacement Under Partial Observations","year":2003,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":106,"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":"Mathematical optimization; Mathematics; Optimal stopping; Bellman equation; Piecewise; State (computer science); Projection (relational algebra); Markov process; Algorithm","score_opus":0.10975972824785399,"score_gpt":0.3453108476573518,"score_spread":0.23555111940949783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169572499","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.0638251,0.00067306904,0.9320916,0.00052899215,0.000044810433,0.00002979393,0.00010623359,0.00017265628,0.002527803],"genre_scores_gemma":[0.8990273,0.00065237575,0.09451003,0.00009877591,0.000088447974,0.0001225031,0.00026141646,0.00008939709,0.005149694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988368,0.0004688479,0.000052972333,0.00023671215,0.00024974858,0.00015493759],"domain_scores_gemma":[0.99730456,0.0018443834,0.00029790367,0.0002375743,0.00019399388,0.000121534256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021691602,0.00068398163,0.001529677,0.00048298435,0.0003530106,0.001062693,0.0010373708,0.0010736679,0.0022154767],"category_scores_gemma":[0.00855651,0.0006153282,0.0006823416,0.00051364355,0.0012206592,0.0022621427,0.001088403,0.0010202689,0.00026215706],"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.00016194143,0.00005178453,0.0007558794,0.000112390386,0.000036202004,0.00018127692,0.00009423161,0.85975385,0.0013993388,0.10479575,0.0010831762,0.031574085],"study_design_scores_gemma":[0.000023542858,0.00006397171,0.00023104798,0.0000119300175,0.000009457142,0.000044316388,0.000014939667,0.94538945,0.00048592844,0.053024948,0.0006906811,0.000009691824],"about_ca_topic_score_codex":0.001793074,"about_ca_topic_score_gemma":0.0010692939,"teacher_disagreement_score":0.0022154767,"about_ca_system_score_codex":0.0010645295,"about_ca_system_score_gemma":0.0013644327,"threshold_uncertainty_score":0.011471748},"labels":[],"label_agreement":null},{"id":"W2169696642","doi":"10.1287/moor.1090.0416","title":"Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"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; Ministerio de Economía y Competitividad","keywords":"Mathematics; Linear programming; Bellman equation; Mathematical optimization; Function (biology); Partition (number theory); Sensitivity (control systems); Applied mathematics; Convex function; Extension (predicate logic); Linear-fractional programming; Domain (mathematical analysis); Regular polygon; Combinatorics; Mathematical analysis; Computer science","score_opus":0.12241455602479392,"score_gpt":0.46007608964743907,"score_spread":0.33766153362264517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169696642","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.0833828,0.0006976461,0.90588087,0.0005459108,0.000034635385,0.00007589212,0.0001229304,0.000111488785,0.009147893],"genre_scores_gemma":[0.9663123,0.00047458045,0.030692954,0.00013902425,0.00004249412,0.00017677859,0.00013097252,0.00008017735,0.0019508235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967619,0.0019628762,0.00008117182,0.0003062966,0.00061130896,0.00027634855],"domain_scores_gemma":[0.9825335,0.015221759,0.0009342121,0.0004232333,0.0005895931,0.00029762776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053145564,0.0014522232,0.0013699359,0.0015076151,0.00062511105,0.0025467156,0.00085439644,0.0010161027,0.00215457],"category_scores_gemma":[0.021841018,0.0008848268,0.0012162941,0.00076465553,0.0034548119,0.0031103683,0.0025997174,0.0019943176,0.00014660145],"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.00009700023,0.000018342369,0.00052645773,0.00008666533,0.00007297535,0.0001302293,0.00011498922,0.83311796,0.0019705486,0.15895778,0.00030972523,0.00459735],"study_design_scores_gemma":[0.000011009706,0.00004179194,0.00023912972,0.000030647363,0.000014979069,0.000035927984,0.00004051278,0.86726993,0.0008057831,0.1311306,0.0003581907,0.000021509835],"about_ca_topic_score_codex":0.0014671471,"about_ca_topic_score_gemma":0.00066347123,"teacher_disagreement_score":0.0053145564,"about_ca_system_score_codex":0.0018684115,"about_ca_system_score_gemma":0.0008205488,"threshold_uncertainty_score":0.028106391},"labels":[],"label_agreement":null},{"id":"W2235312906","doi":"10.1287/moor.1080.0312","title":"Strategies for Prediction Under Imperfect Monitoring","year":2008,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Imperfect; Constructive; Logarithm; Consistency (knowledge bases); Convergence (economics); Simple (philosophy); Computer science; Mathematical optimization; Mathematics; Econometrics; Artificial intelligence; Economics","score_opus":0.14671318171670084,"score_gpt":0.39689635138303814,"score_spread":0.2501831696663373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235312906","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.017981192,0.00046508087,0.97665775,0.0007230286,0.000064918604,0.00010210325,0.00006786834,0.00014910952,0.0037890691],"genre_scores_gemma":[0.75335777,0.0009252174,0.23872916,0.0005413762,0.00019709971,0.0005594766,0.00015259458,0.0000881772,0.005449043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963013,0.0020081557,0.00015815852,0.0006647241,0.00058699894,0.000280625],"domain_scores_gemma":[0.9877692,0.009380674,0.0011294363,0.0009068917,0.0005611101,0.00025265024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271405,0.0012002672,0.0012865437,0.0007201631,0.00048771716,0.0017894121,0.002189392,0.0020663626,0.0025887794],"category_scores_gemma":[0.01768746,0.00056394294,0.00079343264,0.0007816632,0.0020078418,0.0028563766,0.001646421,0.0019816405,0.0004574888],"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.00016112666,0.000099057695,0.0005921499,0.00016683777,0.00009594511,0.00010860296,0.00019551134,0.39328045,0.0019602224,0.5682122,0.0018033606,0.03332459],"study_design_scores_gemma":[0.000070187,0.00008514183,0.00010436043,0.000021047828,0.000017849896,0.00003712611,0.000017128319,0.78768045,0.0006863266,0.20980984,0.0014467328,0.000023873024],"about_ca_topic_score_codex":0.00126994,"about_ca_topic_score_gemma":0.00092991506,"teacher_disagreement_score":0.004271405,"about_ca_system_score_codex":0.0016103083,"about_ca_system_score_gemma":0.0013041768,"threshold_uncertainty_score":0.022589624},"labels":[],"label_agreement":null},{"id":"W2263532892","doi":"10.1287/moor.2017.0852","title":"When Is the Matching Polytope Box-Totally Dual Integral?","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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":"Combinatorics; Mathematics; Polytope; Matching (statistics); Polyhedron; Linear programming; Convex hull; Polyhedral combinatorics; Regular polygon; Discrete mathematics; Convex optimization; Convex set; Mathematical optimization; Geometry","score_opus":0.11460997054815757,"score_gpt":0.4207609136705217,"score_spread":0.3061509431223641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263532892","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.5430048,0.0062208087,0.278283,0.012765402,0.00072556565,0.00015040816,0.0011795544,0.0003218134,0.15734848],"genre_scores_gemma":[0.96147126,0.0016027453,0.028004192,0.00075896096,0.00042331082,0.00005059122,0.0004855688,0.00011572233,0.0070877397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985563,0.00019310792,0.00004974347,0.00048790374,0.00030402688,0.00040894363],"domain_scores_gemma":[0.9976859,0.0010945721,0.0003574421,0.00026760736,0.00025259325,0.00034191844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014229545,0.00030250123,0.00089782936,0.00087292097,0.0012944815,0.004273401,0.0012982881,0.0022121693,0.0074174292],"category_scores_gemma":[0.008181345,0.0006248956,0.0008869658,0.0012697527,0.003984323,0.0076751765,0.0019247304,0.0027020203,0.00077315944],"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.0002152748,0.000048544694,0.0022521934,0.000094171526,0.000030386318,0.0002706057,0.0003204482,0.0052507157,0.00064459926,0.9556199,0.004515705,0.03073749],"study_design_scores_gemma":[0.000039037557,0.000052501928,0.0012932667,0.000093691786,0.00003002336,0.00078647555,0.000608304,0.019948678,0.0007784639,0.9574677,0.018870108,0.00003175681],"about_ca_topic_score_codex":0.0019323849,"about_ca_topic_score_gemma":0.001001386,"teacher_disagreement_score":0.0074174292,"about_ca_system_score_codex":0.0015894362,"about_ca_system_score_gemma":0.00066444004,"threshold_uncertainty_score":0.02481383},"labels":[],"label_agreement":null},{"id":"W2288719682","doi":"10.1287/moor.2015.0745","title":"Zero-Sum Polymatrix Games: A Generalization of Minmax","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":51,"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":"Alfred P. Sloan Foundation; National Science Foundation","keywords":"Zero-sum game; Nash equilibrium; Mathematics; Generalization; Minimax; Zero (linguistics); Correlated equilibrium; Mathematical economics; Best response; Epsilon-equilibrium; Set (abstract data type); Mathematical optimization; Combinatorics; Game theory; Applied mathematics; Repeated game; Equilibrium selection; Computer science; Mathematical analysis","score_opus":0.3045281447897193,"score_gpt":0.5122618047219017,"score_spread":0.20773365993218246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288719682","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.044699114,0.00014517416,0.9322798,0.0005288288,0.00008411737,0.00019880723,0.00026936326,0.0001862909,0.021608403],"genre_scores_gemma":[0.7081821,0.00048983574,0.27032125,0.0006077622,0.00019112618,0.00074117375,0.0004247994,0.00019837944,0.018843535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976525,0.001028784,0.00009987414,0.00051778427,0.00039522653,0.00030589127],"domain_scores_gemma":[0.9974049,0.0013261085,0.00034173363,0.00048101274,0.00019086454,0.00025548734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026093943,0.0014425493,0.0015591535,0.00078001915,0.0011954277,0.0027703017,0.002787701,0.0012790004,0.0095565375],"category_scores_gemma":[0.007322314,0.000643554,0.0013020625,0.0014008658,0.0025989707,0.005154373,0.0047886427,0.0034311607,0.0012503744],"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.00014763148,0.000108597815,0.0003936137,0.00012317182,0.00006097255,0.00016092387,0.00022254346,0.08180564,0.0020294655,0.89166045,0.0026507415,0.020636141],"study_design_scores_gemma":[0.000027254144,0.000059786595,0.0001434247,0.000021034097,0.00001693564,0.000100131634,0.000046091813,0.30786455,0.00091223075,0.68804973,0.0027322315,0.000026618105],"about_ca_topic_score_codex":0.0014605868,"about_ca_topic_score_gemma":0.0016173759,"teacher_disagreement_score":0.0095565375,"about_ca_system_score_codex":0.0013104203,"about_ca_system_score_gemma":0.0014968272,"threshold_uncertainty_score":0.031969786},"labels":[],"label_agreement":null},{"id":"W2325833190","doi":"10.1287/moor.2015.0758","title":"Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"","keywords":"Facility location problem; Steiner tree problem; Latency (audio); Mathematical optimization; Approximation algorithm; Total cost; Computer science; Mathematics; Set (abstract data type); Telecommunications","score_opus":0.09349109213490026,"score_gpt":0.36359941826799386,"score_spread":0.2701083261330936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325833190","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.003781773,0.000568739,0.98886395,0.00070469914,0.00007047895,0.00008429765,0.0002267118,0.00045275316,0.005246577],"genre_scores_gemma":[0.19711116,0.0021609487,0.7846214,0.00064135884,0.0007473101,0.00081783277,0.0012416762,0.00094505394,0.011713216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972631,0.0009941943,0.000107587,0.00041964397,0.0007528851,0.00046266304],"domain_scores_gemma":[0.9917706,0.0062136226,0.0005330361,0.0006320718,0.0005402024,0.00031047096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003050425,0.002921085,0.0019985712,0.0015672282,0.0010896252,0.0029714012,0.005142733,0.0028643545,0.010980903],"category_scores_gemma":[0.014857165,0.0012134301,0.0020097375,0.003488939,0.0012791966,0.0065418924,0.0037197236,0.0064772437,0.0019570645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001923158,0.0002824582,0.0005483596,0.0005815778,0.00007572924,0.00021614213,0.0002809888,0.7892626,0.002200478,0.12274291,0.012324061,0.071292415],"study_design_scores_gemma":[0.000035187204,0.00005225831,0.000073395415,0.00004806517,0.000020933456,0.00008222977,0.000078643025,0.8926275,0.0006272376,0.10140015,0.0049408474,0.000013498317],"about_ca_topic_score_codex":0.00436313,"about_ca_topic_score_gemma":0.0034242577,"teacher_disagreement_score":0.010980903,"about_ca_system_score_codex":0.0024819556,"about_ca_system_score_gemma":0.0022444169,"threshold_uncertainty_score":0.03673476},"labels":[],"label_agreement":null},{"id":"W2529415110","doi":"10.1287/moor.2016.0796","title":"Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization","year":2016,"lang":"en","type":"article","venue":"Mathematics of 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":"Dalhousie University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Mathematical optimization; Stochastic programming; Stochastic optimization; Generalization; Bounded function; Expected value; Linear programming; Optimization problem; Mathematical economics; Discrete mathematics; Statistics","score_opus":0.25606256179635734,"score_gpt":0.4637190489282441,"score_spread":0.20765648713188678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529415110","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.02679702,0.0007278073,0.96380526,0.00066792703,0.000025837555,0.00003059969,0.000029769404,0.000029087369,0.007886776],"genre_scores_gemma":[0.8070657,0.00089820655,0.18791117,0.00017652426,0.00010870409,0.00020013926,0.0000649264,0.00009156945,0.0034829422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9871567,0.0081412,0.0005835162,0.00091513013,0.0027034204,0.00049992866],"domain_scores_gemma":[0.9846102,0.011193894,0.0011759395,0.0014743278,0.0012613301,0.0002842989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0150990905,0.0011174455,0.0010929774,0.0016245014,0.0005653851,0.0026270784,0.0010736847,0.0011048986,0.0021387506],"category_scores_gemma":[0.034586415,0.0005434627,0.0012418547,0.0014911686,0.0045819064,0.0064251823,0.0031119771,0.0023379836,0.00031259138],"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.000024017507,0.0000149847165,0.0003000733,0.00006651804,0.00003128061,0.000032195607,0.000097509146,0.044823218,0.0008254523,0.94315,0.00018310534,0.010451825],"study_design_scores_gemma":[0.000009269497,0.00006766634,0.000323877,0.000044457574,0.000015872287,0.000044413715,0.00006209117,0.13748969,0.0012372722,0.8591223,0.0015666994,0.000016348602],"about_ca_topic_score_codex":0.000379433,"about_ca_topic_score_gemma":0.00024413434,"teacher_disagreement_score":0.0150990905,"about_ca_system_score_codex":0.0017920322,"about_ca_system_score_gemma":0.0009826837,"threshold_uncertainty_score":0.07985258},"labels":[],"label_agreement":null},{"id":"W2551153860","doi":"10.1287/moor.2016.0817","title":"A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":342,"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":"Lipschitz continuity; Mathematics; Sublinear function; Convexity; Gradient descent; Subgradient method; Lemma (botany); Uniqueness; Applied mathematics; Pointwise; Rate of convergence; Bregman divergence; Convex function; Mathematical optimization; Measure (data warehouse); Regular polygon; Mathematical analysis; Key (lock); Computer science; Geometry","score_opus":0.06474276344782105,"score_gpt":0.3797376502487932,"score_spread":0.31499488680097215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551153860","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.0031570941,0.0018818892,0.98755753,0.0013559897,0.00013054293,0.000026926238,0.000020718811,0.00005832932,0.005810951],"genre_scores_gemma":[0.24561852,0.009168378,0.7186879,0.0013876957,0.0008956843,0.00026902297,0.00010376993,0.00041121847,0.02345779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998705,0.0006107928,0.000059396323,0.00014188353,0.00041335874,0.00006957344],"domain_scores_gemma":[0.9944066,0.0040310174,0.00033287788,0.00045590874,0.00056370336,0.00020993242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004694218,0.0010483189,0.0011646615,0.0012516225,0.0007901728,0.0019467098,0.0011691132,0.0021017352,0.002786609],"category_scores_gemma":[0.015904795,0.0006285554,0.001333057,0.0010434556,0.0045046085,0.003967588,0.0035231623,0.006036094,0.00092486397],"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.00003531395,0.000021477083,0.0002481189,0.00017276616,0.000020794598,0.00010618376,0.00020476476,0.02711306,0.0024713527,0.9452831,0.0017090292,0.02261406],"study_design_scores_gemma":[0.000026505553,0.00011166802,0.00023493067,0.00013818621,0.000022309485,0.00026219283,0.00006457754,0.42341056,0.0032151637,0.5543252,0.01814803,0.000040606763],"about_ca_topic_score_codex":0.0014830261,"about_ca_topic_score_gemma":0.0011101691,"teacher_disagreement_score":0.004694218,"about_ca_system_score_codex":0.0012832438,"about_ca_system_score_gemma":0.0013266203,"threshold_uncertainty_score":0.024825752},"labels":[],"label_agreement":null},{"id":"W2569788251","doi":"10.1287/moor.2014.0699","title":"The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Formal Methods in Verification","field":"Computer Science","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 Waterloo","funders":"","keywords":"Mathematics; Simplex; Bounded function; Markov decision process; Combinatorics; Discounting; Polynomial; Simplex algorithm; Mathematical optimization; Markov chain; Discrete mathematics; Binary logarithm; Time complexity; Markov process; Applied mathematics; Linear programming; Statistics","score_opus":0.2552575597432615,"score_gpt":0.5082352828044298,"score_spread":0.2529777230611683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569788251","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.005051892,0.000107482185,0.9913743,0.00023661701,0.000027018092,0.000049267157,0.00006709278,0.00029249498,0.0027938068],"genre_scores_gemma":[0.36518934,0.00051217654,0.62480617,0.00031069253,0.00008894566,0.00045317598,0.00036423624,0.0005075555,0.0077677844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676776,0.001119159,0.00017008401,0.00056121004,0.000994659,0.00038714058],"domain_scores_gemma":[0.9901038,0.0067666206,0.00043271814,0.0011353733,0.001220046,0.0003414856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030409864,0.0013560822,0.0016416063,0.0007704217,0.00090577395,0.0019966033,0.0018280057,0.001104424,0.0063126027],"category_scores_gemma":[0.01673712,0.0007473308,0.0018569008,0.0008524655,0.0028284935,0.0029601087,0.0030624631,0.0046359785,0.0017476853],"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.00025314736,0.000109275104,0.00069506164,0.0002640107,0.00009086332,0.00011341626,0.00021263763,0.5360145,0.0022867243,0.38209844,0.0035103052,0.07435158],"study_design_scores_gemma":[0.000031580075,0.000024314542,0.000049689774,0.000017972825,0.000011421891,0.000019998879,0.000012616527,0.7724141,0.0010857157,0.2250459,0.0012729178,0.000013779535],"about_ca_topic_score_codex":0.0053768,"about_ca_topic_score_gemma":0.006102584,"teacher_disagreement_score":0.0063126027,"about_ca_system_score_codex":0.0020978216,"about_ca_system_score_gemma":0.0043438436,"threshold_uncertainty_score":0.021117806},"labels":[],"label_agreement":null},{"id":"W2570390297","doi":"10.1287/moor.2015.0752","title":"An Improved Integrality Gap for Asymmetric TSP Paths","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Alberta","funders":"","keywords":"Mathematics; Combinatorics; Linear programming relaxation; Conjecture; Bounded function; Spanning tree; Path (computing); Tree (set theory); Minimum spanning tree; Relaxation (psychology); Connection (principal bundle); Space (punctuation); Linear programming; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.13116101593447474,"score_gpt":0.4304011552015642,"score_spread":0.2992401392670895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570390297","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.123218544,0.0029264952,0.8103635,0.0034820468,0.0004162374,0.00025690056,0.0007439486,0.002451444,0.05614097],"genre_scores_gemma":[0.6311543,0.0024693063,0.34954205,0.001474953,0.00048283132,0.00034614507,0.0017599211,0.0012642551,0.0115062585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607784,0.000602652,0.0001606079,0.00093995477,0.0014025469,0.0008163459],"domain_scores_gemma":[0.9896478,0.0065733423,0.00068131386,0.0016590345,0.0008239749,0.0006146213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027962015,0.0018308747,0.001998111,0.0019302865,0.0016707313,0.0038380143,0.004117779,0.0020025661,0.010346817],"category_scores_gemma":[0.01869994,0.0009156246,0.0019210806,0.0030704602,0.0018991829,0.010332189,0.005151257,0.00778466,0.002032828],"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.001313043,0.0007506453,0.0029437384,0.0008090288,0.00013825763,0.0004925073,0.00094663055,0.4045121,0.018960671,0.31936568,0.01818933,0.23157838],"study_design_scores_gemma":[0.00006754313,0.00022509978,0.00064465415,0.00010708591,0.000075532844,0.00039276516,0.0001832037,0.78990793,0.0048887576,0.193439,0.010034791,0.000033615837],"about_ca_topic_score_codex":0.0024260704,"about_ca_topic_score_gemma":0.002188164,"teacher_disagreement_score":0.010346817,"about_ca_system_score_codex":0.0028810205,"about_ca_system_score_gemma":0.0026436977,"threshold_uncertainty_score":0.03461361},"labels":[],"label_agreement":null},{"id":"W2602817165","doi":"10.1287/moor.2016.0839","title":"Dynamical Analysis of a Repeated Game with Incomplete Information","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Thermodynamics and Statistical Mechanics","field":"Physics and Astronomy","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 Victoria","funders":"","keywords":"Parameterized complexity; Mathematics; Range (aeronautics); Complete information; Repeated game; State (computer science); Markov chain; Sequential game; Game theory; Mathematical economics; Bayesian game; Discrete mathematics; Combinatorics; Algorithm; Statistics","score_opus":0.045854504677929085,"score_gpt":0.3911853160385145,"score_spread":0.3453308113605854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602817165","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.6126633,0.0008810297,0.35730582,0.0032286884,0.00010643816,0.00012070206,0.00033494778,0.0001483633,0.025210794],"genre_scores_gemma":[0.98394066,0.00030073334,0.010472848,0.0001367316,0.00006497838,0.0001179953,0.00009089007,0.0000306405,0.004844506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989483,0.0004915405,0.00003733202,0.00013685446,0.00021062008,0.00017545231],"domain_scores_gemma":[0.99397624,0.003973283,0.0010862092,0.00018450971,0.0003072115,0.00047253206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001987045,0.0008037909,0.0011021984,0.0009349234,0.0006068933,0.0017394645,0.0015540384,0.0017348299,0.0030308461],"category_scores_gemma":[0.007700426,0.0005266989,0.0009005226,0.0004862065,0.0026043432,0.0020759976,0.0015817718,0.0015812833,0.00021179246],"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.00012424152,0.00009348008,0.0017112144,0.00009580144,0.00011122588,0.0005675103,0.00028705713,0.46616557,0.002786778,0.5243248,0.00078540656,0.0029468832],"study_design_scores_gemma":[0.000029779554,0.000039605984,0.0003335993,0.000011207749,0.000011433466,0.000037648366,0.00004620885,0.9109322,0.00015216677,0.08801734,0.00036951058,0.000019304975],"about_ca_topic_score_codex":0.004844166,"about_ca_topic_score_gemma":0.0022341786,"teacher_disagreement_score":0.004844166,"about_ca_system_score_codex":0.0016989779,"about_ca_system_score_gemma":0.0010824399,"threshold_uncertainty_score":0.012326956},"labels":[],"label_agreement":null},{"id":"W2623297173","doi":"10.1287/moor.2017.0847","title":"Information and Ambiguity: Toward a Foundation of Nonexpected Utility","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Decision-Making and Behavioral Economics","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":"Université de Montréal","funders":"","keywords":"Ambiguity; Class (philosophy); Probabilistic logic; Foundation (evidence); Relation (database); Mathematical economics; Expected utility hypothesis; Computer science; Mathematics; Epistemology; Artificial intelligence; Data mining; Law; Political science","score_opus":0.5213376055904207,"score_gpt":0.5533005944671012,"score_spread":0.031962988876680476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623297173","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.05301647,0.0033277052,0.851839,0.011912579,0.00020524471,0.00007985742,0.00017275922,0.000090385955,0.07935606],"genre_scores_gemma":[0.90265864,0.002064389,0.09114789,0.0007867599,0.00036565564,0.00016276156,0.000089175424,0.000048196078,0.0026766001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99228436,0.0042241914,0.00033714098,0.00089647673,0.0017290912,0.0005288229],"domain_scores_gemma":[0.97442424,0.019335896,0.0019985696,0.002340465,0.0013426464,0.000558164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008732777,0.00084736507,0.001318649,0.0029018964,0.001337175,0.005688369,0.0024305196,0.0026660173,0.0033058613],"category_scores_gemma":[0.028832844,0.0007009442,0.0013729668,0.001964597,0.013063719,0.01352104,0.0044983434,0.005728937,0.0003439983],"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.0000066507546,0.000009213269,0.00012436503,0.000022097563,0.0000057905336,0.000036337748,0.00013021714,0.002548496,0.000040473293,0.99493176,0.00012054561,0.0020240913],"study_design_scores_gemma":[0.0000032782373,0.0000064247233,0.00006148246,0.000019728524,0.0000022122679,0.00001674632,0.000038309023,0.0082566235,0.000036791364,0.990873,0.0006803784,0.000005039405],"about_ca_topic_score_codex":0.001176668,"about_ca_topic_score_gemma":0.00069180055,"teacher_disagreement_score":0.008732777,"about_ca_system_score_codex":0.0031880066,"about_ca_system_score_gemma":0.0019132749,"threshold_uncertainty_score":0.046183884},"labels":[],"label_agreement":null},{"id":"W2744036899","doi":"10.1287/moor.2018.0966","title":"A Mean Field Competition","year":2019,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Consumer Market Behavior and Pricing","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":"University of Toronto","funders":"","keywords":"Mathematics; Fraction (chemistry); Rank (graph theory); Scheme (mathematics); Mathematical optimization; Competition (biology); Principal (computer security); Population; Field (mathematics); Computer science; Combinatorics","score_opus":0.07781145011900378,"score_gpt":0.35266948026265094,"score_spread":0.2748580301436472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744036899","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.078877255,0.0007066426,0.7654231,0.006264341,0.0005485708,0.00028615503,0.0005294818,0.00036649697,0.14699791],"genre_scores_gemma":[0.87878895,0.0006254599,0.07277849,0.0014109878,0.00037738876,0.0003715007,0.00018427258,0.000090622634,0.045372378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854624,0.0005786606,0.00004176779,0.00032096007,0.00027975714,0.00023259086],"domain_scores_gemma":[0.998431,0.00072999124,0.00017019779,0.00018951838,0.00014901723,0.000330254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015765632,0.00076803233,0.0012156877,0.00066716055,0.001071052,0.0023396593,0.0019827387,0.0032304435,0.016192757],"category_scores_gemma":[0.0044946102,0.000420985,0.0010981691,0.00062398514,0.0018956881,0.003250187,0.0017603441,0.0019143323,0.0014197187],"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.00007354042,0.00008951537,0.00028710585,0.0000591985,0.00003041616,0.00009868247,0.00007571294,0.050955247,0.0012593558,0.9349185,0.004455584,0.0076971794],"study_design_scores_gemma":[0.00010180728,0.0001625596,0.0002787117,0.000022203662,0.000021015108,0.00016364393,0.00004546209,0.37030208,0.00027364588,0.61757964,0.011007341,0.000041776242],"about_ca_topic_score_codex":0.0020475287,"about_ca_topic_score_gemma":0.0018111875,"teacher_disagreement_score":0.016192757,"about_ca_system_score_codex":0.0016156897,"about_ca_system_score_gemma":0.0017082804,"threshold_uncertainty_score":0.05417019},"labels":[],"label_agreement":null},{"id":"W2752127906","doi":"10.1287/moor.2017.0861","title":"Negative Dependence, Scrambled Nets, and Variance Bounds","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Mathematical Approximation and Integration","field":"Mathematics","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 Waterloo","funders":"","keywords":"Mathematics; Monte Carlo method; Estimator; Importance sampling; Quasi-Monte Carlo method; Applied mathematics; Sampling (signal processing); Monte Carlo integration; Joint probability distribution; Generalization; Hybrid Monte Carlo; Statistics; Markov chain Monte Carlo; Computer science; Filter (signal processing); Mathematical analysis","score_opus":0.24849751078770774,"score_gpt":0.48243691596113814,"score_spread":0.2339394051734304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752127906","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.021622363,0.0003810213,0.9753631,0.00018669789,0.000024677833,0.000029477531,0.000066214605,0.0001333931,0.0021932244],"genre_scores_gemma":[0.6429193,0.0007167219,0.34987062,0.00041431218,0.00013848554,0.00034752878,0.00040543088,0.00028342436,0.0049041286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99466574,0.0027397648,0.00018379303,0.0007542776,0.0013786615,0.00027781684],"domain_scores_gemma":[0.9489367,0.039879084,0.0027493748,0.005611092,0.0022011923,0.0006226046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008940717,0.0007304463,0.0009345631,0.0013332283,0.00066878326,0.0014670374,0.002352606,0.001293267,0.0025889692],"category_scores_gemma":[0.051542036,0.0007525743,0.0006785829,0.0008122489,0.0033535315,0.0042466954,0.0022748627,0.0024386237,0.00035494711],"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.00018086939,0.00006804468,0.0023868068,0.0001676827,0.000068266454,0.00014049295,0.00015721715,0.22155277,0.004230361,0.74832326,0.0009865316,0.021737669],"study_design_scores_gemma":[0.000021796352,0.00008476782,0.0006154376,0.000045300563,0.00002044713,0.000100169746,0.000016557833,0.77851015,0.0030923358,0.21604687,0.0014160688,0.000030179184],"about_ca_topic_score_codex":0.00090089854,"about_ca_topic_score_gemma":0.00095288735,"teacher_disagreement_score":0.008940717,"about_ca_system_score_codex":0.001757776,"about_ca_system_score_gemma":0.00097012665,"threshold_uncertainty_score":0.04728359},"labels":[],"label_agreement":null},{"id":"W2752885799","doi":"10.1287/moor.2019.1034","title":"Stabilizing Weighted Graphs","year":2020,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Matching (statistics); Cardinality (data modeling); Time complexity; Bipartite graph; Graph; Factor-critical graph; Discrete mathematics; Line graph; Computer science; Graph power","score_opus":0.22893134895133008,"score_gpt":0.4098623481194887,"score_spread":0.1809309991681586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752885799","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.1771098,0.00023229398,0.7958143,0.00050045113,0.000092915594,0.0002477995,0.000656681,0.0008720605,0.024473794],"genre_scores_gemma":[0.75679153,0.00037485547,0.22500624,0.00020481323,0.000082582366,0.00023106721,0.0014540778,0.00025528754,0.015599661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993325,0.000118200274,0.000030994557,0.00020621295,0.00019234107,0.00011972539],"domain_scores_gemma":[0.99833894,0.0006762456,0.00025872077,0.0003596013,0.00023942279,0.00012699918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214578,0.0006710255,0.0005922305,0.0007069137,0.00089336815,0.0013839463,0.0014362527,0.00081251253,0.0061720596],"category_scores_gemma":[0.0041137957,0.00028067167,0.00046681004,0.0013701036,0.00076015975,0.002431468,0.0013526073,0.00097513583,0.0009159449],"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.0004316216,0.0001736734,0.0014959717,0.00034962367,0.00008247446,0.00040876138,0.00029013472,0.19919458,0.035541337,0.5949779,0.010393563,0.15666033],"study_design_scores_gemma":[0.000044947144,0.000098213284,0.0004505308,0.000028408322,0.000045037938,0.00024282142,0.00013161906,0.35948408,0.011340989,0.61479783,0.0133171845,0.000018362829],"about_ca_topic_score_codex":0.0009437712,"about_ca_topic_score_gemma":0.001399671,"teacher_disagreement_score":0.0061720596,"about_ca_system_score_codex":0.0009794025,"about_ca_system_score_gemma":0.00067658565,"threshold_uncertainty_score":0.020647585},"labels":[],"label_agreement":null},{"id":"W2753058904","doi":"10.1287/moor.2017.0871","title":"Ideal Clutters That Do Not Pack","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; National Science Foundation","keywords":"Ideal (ethics); Clutter; Mathematics; Combinatorics; Characterization (materials science); Set (abstract data type); Class (philosophy); Identification (biology); Discrete mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.13337599221911664,"score_gpt":0.3748297048317479,"score_spread":0.24145371261263124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753058904","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.6527335,0.00056978775,0.27428502,0.00035627445,0.00014461897,0.00010180923,0.0004447279,0.0008454207,0.07051873],"genre_scores_gemma":[0.94396293,0.00018151145,0.043465275,0.00018142925,0.000076884346,0.000062665,0.00066526973,0.00015627328,0.011247761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986706,0.00015392338,0.0000803183,0.00031557825,0.00033054914,0.00044893284],"domain_scores_gemma":[0.99703324,0.00066974416,0.0005380101,0.0007628492,0.0004874948,0.0005085855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057487574,0.0005067598,0.0006102502,0.0012961581,0.0017721605,0.002601793,0.0006215898,0.00051248743,0.0060563595],"category_scores_gemma":[0.0030212037,0.0005285048,0.0006662012,0.0011645677,0.0024398502,0.0030748667,0.0024240573,0.0008655261,0.0009545183],"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.0005488738,0.000090471935,0.012555576,0.00020697447,0.000058968595,0.001393988,0.0015012769,0.009920374,0.020013418,0.9087631,0.004655462,0.0402915],"study_design_scores_gemma":[0.000044714136,0.00029606643,0.012959731,0.00011164402,0.00007947649,0.0056935633,0.0024455318,0.0512206,0.021743903,0.8459391,0.05935194,0.000113730006],"about_ca_topic_score_codex":0.0013735325,"about_ca_topic_score_gemma":0.0010256403,"teacher_disagreement_score":0.0060563595,"about_ca_system_score_codex":0.0008403872,"about_ca_system_score_gemma":0.0005134984,"threshold_uncertainty_score":0.020260572},"labels":[],"label_agreement":null},{"id":"W2754102152","doi":"10.1287/moor.2017.0864","title":"Opposite Elements in Clutters","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Matroid; Combinatorics; Clutter; Ideal (ethics); Set (abstract data type); Cover (algebra); Property (philosophy); Discrete mathematics; Degenerate energy levels; Algorithm; Computer science","score_opus":0.1486357248062392,"score_gpt":0.46244065175271837,"score_spread":0.31380492694647916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754102152","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.5430692,0.0011463354,0.38971454,0.0010517574,0.00028208588,0.00008630827,0.00049405784,0.00057305506,0.063582644],"genre_scores_gemma":[0.9261255,0.00038632486,0.061836466,0.00035813983,0.00015897633,0.00007721745,0.00063221797,0.00013735444,0.0102878185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979557,0.00036072204,0.00016962491,0.0006520393,0.0004298855,0.0004319975],"domain_scores_gemma":[0.9959849,0.0016864081,0.0006114336,0.00079682004,0.0004120061,0.0005084735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128402,0.00045012566,0.00058719283,0.0016303663,0.0026995237,0.0032066475,0.00066677603,0.0010062826,0.005412473],"category_scores_gemma":[0.0048507745,0.0006228921,0.00088060333,0.001552634,0.0051174667,0.008100118,0.0033601136,0.0014595406,0.00077311334],"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.000110689594,0.000035075725,0.0036047308,0.00005818747,0.000014675635,0.00039475964,0.0010907634,0.0030918284,0.0034759943,0.97354853,0.0011407378,0.01343418],"study_design_scores_gemma":[0.000017621467,0.000083482504,0.0018027475,0.000049945902,0.000029179844,0.0014466343,0.0012375641,0.009522535,0.0057360465,0.9513386,0.028699024,0.00003662647],"about_ca_topic_score_codex":0.00089302775,"about_ca_topic_score_gemma":0.00080603326,"teacher_disagreement_score":0.005412473,"about_ca_system_score_codex":0.0010296656,"about_ca_system_score_gemma":0.00047212324,"threshold_uncertainty_score":0.01810646},"labels":[],"label_agreement":null},{"id":"W2788976390","doi":"10.1287/moor.2021.1129","title":"Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"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":"Mathematics; Dimension (graph theory); Matching (statistics); Approximation algorithm; Constant (computer programming); Set (abstract data type); Variance (accounting); Optimal design; Sampling (signal processing); Combinatorics; Mathematical optimization; Algorithm; Applied mathematics; Statistics; Computer science","score_opus":0.22246836699537323,"score_gpt":0.38686376411829076,"score_spread":0.16439539712291754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788976390","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.002736141,0.000385245,0.9944265,0.00019140996,0.000035063524,0.000041726264,0.00002745237,0.00012484324,0.0020314725],"genre_scores_gemma":[0.28271028,0.0011487288,0.71042985,0.00046869493,0.00022747109,0.0005921425,0.00028394378,0.0002230712,0.003915811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610776,0.001979956,0.0001631148,0.0004663178,0.0010353964,0.00024751763],"domain_scores_gemma":[0.98479164,0.012425541,0.00074745744,0.0010445582,0.00072472106,0.0002660403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053331563,0.0023160062,0.0018610955,0.0015325813,0.0006431393,0.0018390416,0.0016074796,0.0019809862,0.0033970047],"category_scores_gemma":[0.02867828,0.0010615876,0.0011004516,0.0017839218,0.0024250953,0.00302161,0.0027813665,0.0028961748,0.00075945305],"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.00019566216,0.00011369006,0.00065322244,0.00025266435,0.00008102174,0.00006844625,0.00010929807,0.75004804,0.0016604784,0.17440984,0.002410492,0.06999712],"study_design_scores_gemma":[0.000025559206,0.000047017522,0.000052941978,0.000024434486,0.000008474085,0.000028486422,0.000010990403,0.9224225,0.00050277537,0.07596937,0.00089926244,0.0000082387505],"about_ca_topic_score_codex":0.0024626323,"about_ca_topic_score_gemma":0.0017817594,"teacher_disagreement_score":0.0053331563,"about_ca_system_score_codex":0.0019505213,"about_ca_system_score_gemma":0.001853032,"threshold_uncertainty_score":0.02820474},"labels":[],"label_agreement":null},{"id":"W2809975097","doi":"10.1287/moor.2021.1244","title":"Gale’s Fixed Tax for Exchanging Houses","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Université de Montréal","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Payment; Object (grammar); Pairwise comparison; Microeconomics; Set (abstract data type); Lump sum; Contrast (vision); Mathematical economics; Economics; Computer science; Finance; Artificial intelligence","score_opus":0.23289875063069154,"score_gpt":0.35405686434292216,"score_spread":0.12115811371223062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809975097","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.11508529,0.00038950783,0.8228031,0.0018094579,0.00016552345,0.00028265666,0.00043146915,0.0003401705,0.058692858],"genre_scores_gemma":[0.76255524,0.00031875286,0.2164463,0.00031260314,0.000049795286,0.00017390393,0.00034779272,0.00013078797,0.019664802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987704,0.000448038,0.000054549673,0.0002903533,0.00027914933,0.00015743189],"domain_scores_gemma":[0.9986626,0.00046564452,0.00013128734,0.00050121953,0.00013977438,0.0000994676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016402323,0.00057491136,0.0009719598,0.00082822476,0.0013973302,0.0027127438,0.0016949759,0.0019674168,0.006737171],"category_scores_gemma":[0.0088115,0.00049138896,0.0010729505,0.0011568002,0.0021642756,0.0047537964,0.0017172784,0.002065426,0.00093596394],"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.00010068417,0.000077988116,0.0010741375,0.000049540507,0.00003517215,0.000115135925,0.00014621629,0.0806128,0.00057737913,0.8640901,0.003527752,0.049593095],"study_design_scores_gemma":[0.0000650797,0.000046298872,0.0003657406,0.000024301607,0.000022139275,0.00012703148,0.000053675165,0.18510403,0.001400732,0.8035544,0.009210441,0.000026176707],"about_ca_topic_score_codex":0.005035179,"about_ca_topic_score_gemma":0.004472597,"teacher_disagreement_score":0.006737171,"about_ca_system_score_codex":0.0017967015,"about_ca_system_score_gemma":0.0016259066,"threshold_uncertainty_score":0.022538066},"labels":[],"label_agreement":null},{"id":"W2888696679","doi":"10.1287/moor.2021.1168","title":"Multiplayer Bandits Without Observing Collision Information","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"McGill University","funders":"Institut de Valorisation des Données; Université de Montréal; Banco Bilbao Vizcaya Argentaria; Ministerio de Economía y Competitividad; Canada First Research Excellence Fund; Centre de Recherches Mathématiques; Fundación BBVA","keywords":"Regret; Logarithm; Collision; Square root; Computer science; Nash equilibrium; Square (algebra); Mathematical optimization; Root (linguistics); Mathematical economics; Mathematics; Computer security; Mathematical analysis; Machine learning; Geometry","score_opus":0.45722932184973136,"score_gpt":0.5586788726154809,"score_spread":0.10144955076574952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888696679","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.16851711,0.0005498976,0.82175344,0.0008257016,0.00011417186,0.00015833456,0.00020644261,0.00033575768,0.007539157],"genre_scores_gemma":[0.93604165,0.0002932678,0.05633627,0.00027286136,0.00010478829,0.00023016399,0.00020098439,0.000071994735,0.00644807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968292,0.00134923,0.00014420939,0.00057186245,0.0004941959,0.0006112284],"domain_scores_gemma":[0.98199534,0.013552348,0.0023122511,0.000879266,0.00053320976,0.0007275308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034665172,0.0022316459,0.0024725078,0.00074335217,0.001166744,0.0022813776,0.002551194,0.0023352713,0.0035717767],"category_scores_gemma":[0.01812477,0.0009529482,0.0010909485,0.001223302,0.0022980114,0.004001099,0.0031025007,0.0031986893,0.0006866055],"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.00073169405,0.00019936328,0.0010489903,0.00012327054,0.000102989114,0.00020522639,0.00015849412,0.8984149,0.0014122432,0.0857178,0.0009305925,0.010954482],"study_design_scores_gemma":[0.00003993954,0.00008290342,0.000082660736,0.000008427198,0.000011866733,0.00003182649,0.000022361874,0.96463513,0.00039901832,0.034454025,0.00022138275,0.000010402419],"about_ca_topic_score_codex":0.0027014036,"about_ca_topic_score_gemma":0.0019384586,"teacher_disagreement_score":0.0035717767,"about_ca_system_score_codex":0.0017804538,"about_ca_system_score_gemma":0.0010881465,"threshold_uncertainty_score":0.018332899},"labels":[],"label_agreement":null},{"id":"W2891732023","doi":"10.1287/moor.2020.1101","title":"Time-Consistent Conditional Expectation Under Probability Distortion","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","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 Toronto","funders":"National Science Foundation","keywords":"Conditional expectation; Nonlinear system; Mathematics; Conditional probability; Conditional probability distribution; Distortion (music); Regular conditional probability; Applied mathematics; Conditional variance; Mathematical economics; Random variable; Econometrics; Computer science; Statistics; Probability mass function; Physics","score_opus":0.16555775197349826,"score_gpt":0.3471680561921715,"score_spread":0.18161030421867325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891732023","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04106225,0.00021424731,0.94621325,0.0012293183,0.000113271715,0.000024998231,0.00022759684,0.00011925181,0.01079573],"genre_scores_gemma":[0.88196784,0.000678268,0.1019715,0.00049700873,0.00027132648,0.00010457905,0.00037537699,0.00016516815,0.013968876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837816,0.0005176188,0.00010247192,0.0003432972,0.000481388,0.00017707687],"domain_scores_gemma":[0.99549675,0.0020043289,0.00082440634,0.00063997897,0.00071284565,0.00032169363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025867303,0.0006591207,0.0006269448,0.0007035399,0.00047334642,0.0018881434,0.0014419999,0.0010352136,0.0042297957],"category_scores_gemma":[0.0106206015,0.00033053788,0.0011338114,0.0008810993,0.002625371,0.0056808977,0.002212603,0.0020833325,0.0005410833],"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.0000149991065,0.000007756554,0.0003139199,0.000020302037,0.00001255002,0.0000801509,0.00007371295,0.01813909,0.000763064,0.97737485,0.00038235105,0.0028172762],"study_design_scores_gemma":[0.000010841596,0.000030845535,0.00032619655,0.000011914046,0.000012593681,0.00011657414,0.000037043283,0.2309431,0.0009747843,0.765205,0.0023047908,0.000026353282],"about_ca_topic_score_codex":0.0019098159,"about_ca_topic_score_gemma":0.00091598375,"teacher_disagreement_score":0.0042297957,"about_ca_system_score_codex":0.0018779347,"about_ca_system_score_gemma":0.0012172613,"threshold_uncertainty_score":0.014150023},"labels":[],"label_agreement":null},{"id":"W2906115048","doi":"10.1287/moor.2021.1220","title":"A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","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":"Mathematical optimization; Curse of dimensionality; Regret; Dual (grammatical number); Dynamic pricing; Computer science; Revenue management; Constraint (computer-aided design); Revenue; Mathematics; Artificial intelligence; Machine learning; Economics; Microeconomics","score_opus":0.21645571140289932,"score_gpt":0.49928447950654015,"score_spread":0.2828287681036408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906115048","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.011865746,0.0004033759,0.9829947,0.0005673583,0.00007252019,0.000078158875,0.000077593984,0.00022902478,0.0037116262],"genre_scores_gemma":[0.3860553,0.00047982403,0.60460335,0.00060053443,0.00023524041,0.00045614372,0.000365845,0.00017150145,0.0070322333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992353,0.00030021954,0.000031381875,0.00017127476,0.00014064997,0.0001211993],"domain_scores_gemma":[0.9983171,0.0011681351,0.00011949041,0.000098284225,0.00019328862,0.00010367606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022893036,0.0012363113,0.0018403718,0.00065762515,0.0006304354,0.001491802,0.002070862,0.0022699686,0.004532402],"category_scores_gemma":[0.0050874003,0.00080192846,0.0005959802,0.0012645862,0.0010882393,0.0018877318,0.0016294477,0.0026559732,0.0008825845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013517837,0.00023769272,0.000601831,0.00010101362,0.000044405722,0.00006913407,0.000053237545,0.8912637,0.00048423826,0.03203675,0.005173841,0.06979893],"study_design_scores_gemma":[0.000022678294,0.000017242144,0.000025260122,0.0000051429975,0.0000032090209,0.000011942191,0.000004710325,0.9909462,0.000078854704,0.008513169,0.00036865385,0.000002981297],"about_ca_topic_score_codex":0.002991462,"about_ca_topic_score_gemma":0.0024987522,"teacher_disagreement_score":0.004532402,"about_ca_system_score_codex":0.0016151359,"about_ca_system_score_gemma":0.0022385707,"threshold_uncertainty_score":0.015162349},"labels":[],"label_agreement":null},{"id":"W2913334655","doi":"10.1287/moor.1120.0557","title":"Lipschitz Games","year":2012,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Kellogg's (Canada)","funders":"","keywords":"Lipschitz continuity; Constant (computer programming); Mathematical proof; Mathematics; Stochastic game; Mathematical economics; Probabilistic logic; Function (biology); Pure mathematics; Computer science; Statistics; Geometry","score_opus":0.5498980570001545,"score_gpt":0.581616604163756,"score_spread":0.03171854716360156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913334655","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.07966031,0.0010774059,0.81844956,0.0031390414,0.00014311659,0.00030811815,0.0013610546,0.0005411888,0.09532021],"genre_scores_gemma":[0.8336661,0.0014004997,0.1195624,0.0008410173,0.0002657328,0.00073981757,0.00089281,0.000119644996,0.042511955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980311,0.0006404999,0.00014049548,0.00046215334,0.00047355538,0.0002522105],"domain_scores_gemma":[0.9957088,0.0026746283,0.00043530765,0.00043288997,0.00040854118,0.0003398359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015965163,0.0012083482,0.0013718284,0.00078542455,0.001021726,0.0028957466,0.0015397428,0.0014302159,0.007443967],"category_scores_gemma":[0.010610972,0.00048095558,0.0009273571,0.00071554194,0.0027034713,0.0050728363,0.0024335426,0.0020837162,0.0010016827],"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.000052741376,0.000018606752,0.00018034462,0.000050037455,0.000016968903,0.000055354256,0.000086395885,0.014795073,0.00066471624,0.97511953,0.0017593375,0.0072009144],"study_design_scores_gemma":[0.000045744855,0.000035748482,0.0001865777,0.00001799447,0.0000147292585,0.000088439374,0.00003842809,0.08774294,0.00045072194,0.90455717,0.006802924,0.000018508716],"about_ca_topic_score_codex":0.0025808746,"about_ca_topic_score_gemma":0.0019549588,"teacher_disagreement_score":0.007443967,"about_ca_system_score_codex":0.002502499,"about_ca_system_score_gemma":0.0011596147,"threshold_uncertainty_score":0.024902523},"labels":[],"label_agreement":null},{"id":"W2947183726","doi":"10.1287/moor.2021.1177","title":"On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs","year":2021,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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 Alberta","funders":"Alberta Innovates; Alberta Innovates - Technology Futures; DeepMind; Alberta Machine Intelligence Institute","keywords":"Mathematics; Countable set; Markov decision process; Duality (order theory); Mathematical optimization; State space; Action (physics); Markov kernel; Markov chain; Discrete mathematics; Applied mathematics; Markov process; Markov model; Variable-order Markov model; Statistics","score_opus":0.07719914338480655,"score_gpt":0.38038640943968005,"score_spread":0.3031872660548735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947183726","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.029828057,0.0011904149,0.95625865,0.0014970915,0.000058853737,0.00007091321,0.00017009652,0.00009345968,0.010832465],"genre_scores_gemma":[0.7909776,0.002291509,0.18928522,0.0007670325,0.00038537086,0.0009511905,0.00051610905,0.00021976311,0.014606229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974255,0.0013568581,0.00010198397,0.0004823503,0.0003457097,0.00028742576],"domain_scores_gemma":[0.986129,0.011973132,0.0007867591,0.00021090526,0.00046504635,0.00043514025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004399921,0.002037339,0.001967076,0.0011824133,0.00081347977,0.0028159355,0.0020074674,0.002406248,0.00479155],"category_scores_gemma":[0.013501312,0.0008966663,0.0016224147,0.0013450615,0.0036703844,0.003977745,0.0033398215,0.0036379858,0.00035106775],"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.000066629385,0.000100539844,0.00042932772,0.00023123514,0.0000622504,0.0001741293,0.00015602716,0.45309305,0.0006297394,0.5362975,0.0008516857,0.007907815],"study_design_scores_gemma":[0.000016569562,0.000041917654,0.0001230726,0.000035432135,0.000012241385,0.000022259559,0.00003082995,0.76988024,0.00013664376,0.22915216,0.0005339796,0.00001468399],"about_ca_topic_score_codex":0.004662331,"about_ca_topic_score_gemma":0.0036177782,"teacher_disagreement_score":0.00479155,"about_ca_system_score_codex":0.0036955397,"about_ca_system_score_gemma":0.0032649203,"threshold_uncertainty_score":0.02681309},"labels":[],"label_agreement":null},{"id":"W2947550808","doi":"10.1287/moor.2018.0958","title":"Efficient Computation of Optimal Auctions via Reduced Forms","year":2019,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Auction 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 Toronto; University of British Columbia","funders":"","keywords":"Mathematical optimization; Parameterized complexity; Reduction (mathematics); Mathematics; Simple (philosophy); Polynomial; Time complexity; Computer science; Algorithm","score_opus":0.2008505575232814,"score_gpt":0.5018115791044099,"score_spread":0.3009610215811285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947550808","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.051790465,0.00015969046,0.9346734,0.0006637168,0.000048742895,0.00023046888,0.0003859002,0.0013121901,0.010735522],"genre_scores_gemma":[0.4983269,0.00017920451,0.49187565,0.00023050926,0.00006540101,0.00058541313,0.0011373954,0.00061382254,0.006985608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698097,0.0012027237,0.0001499311,0.0005316356,0.0006380558,0.0004965323],"domain_scores_gemma":[0.993722,0.0043053585,0.00036235346,0.000938119,0.0004889741,0.000183151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00263445,0.0013275766,0.0019878962,0.001152279,0.00094961555,0.0037282633,0.0023600569,0.0016158427,0.007924359],"category_scores_gemma":[0.016465982,0.0010936434,0.0018160406,0.0014903531,0.001844365,0.0045271316,0.0027816035,0.003192785,0.0017811371],"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.00033988093,0.00034402806,0.00091536576,0.00024058062,0.0000774262,0.00013291232,0.0002694397,0.6039416,0.0015988832,0.31346813,0.006333715,0.07233806],"study_design_scores_gemma":[0.00007039165,0.00003315361,0.00006761253,0.000012367244,0.000012845951,0.000018084158,0.000044279008,0.7404782,0.00070507784,0.25739053,0.0011570699,0.000010369686],"about_ca_topic_score_codex":0.002758585,"about_ca_topic_score_gemma":0.003645999,"teacher_disagreement_score":0.007924359,"about_ca_system_score_codex":0.0023182838,"about_ca_system_score_gemma":0.002601412,"threshold_uncertainty_score":0.026509583},"labels":[],"label_agreement":null},{"id":"W2951851225","doi":"10.1287/moor.2020.1107","title":"Terminal Ranking Games","year":2019,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Tournament; Ranking (information retrieval); Mathematical economics; Yield (engineering); Price of anarchy; Welfare; Value (mathematics); Terminal (telecommunication); Mathematics; Economics; Field (mathematics); Mathematical optimization; Computer science; Microeconomics; Statistics; Combinatorics; Artificial intelligence; Price of stability; Pure mathematics; Physics","score_opus":0.4655700130287429,"score_gpt":0.5634740402351454,"score_spread":0.09790402720640246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951851225","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.07471818,0.00097105076,0.46488056,0.00510271,0.0004391796,0.00020963988,0.0012053892,0.00033368927,0.45213953],"genre_scores_gemma":[0.71811634,0.0012565306,0.05054716,0.0009151328,0.00044123922,0.00031117335,0.0012832682,0.00014788663,0.22698128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857724,0.0005748218,0.00006396747,0.00020042012,0.0003706235,0.00021298406],"domain_scores_gemma":[0.9983398,0.0008990727,0.000103964456,0.00016179001,0.00024758084,0.00024784237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411079,0.0008828469,0.00093986193,0.000941856,0.0010943876,0.005131143,0.0011003682,0.001783241,0.02203209],"category_scores_gemma":[0.0046016434,0.00032696995,0.0007399283,0.0012247325,0.0016796035,0.0047054635,0.0015311496,0.0036114925,0.0035684162],"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.000019337793,0.00002481301,0.000039351402,0.000019106323,0.00000464413,0.000022263714,0.00003618151,0.0014155398,0.0002242123,0.9908098,0.0030722872,0.0043125045],"study_design_scores_gemma":[0.000015598782,0.000015285947,0.00006696612,0.000009755856,0.0000056913977,0.00004634738,0.00002918853,0.013997634,0.0001968589,0.978513,0.0070972997,0.000006461598],"about_ca_topic_score_codex":0.000732443,"about_ca_topic_score_gemma":0.0006829118,"teacher_disagreement_score":0.02203209,"about_ca_system_score_codex":0.0013808886,"about_ca_system_score_gemma":0.0009881416,"threshold_uncertainty_score":0.07370466},"labels":[],"label_agreement":null},{"id":"W2963317235","doi":"10.1287/moor.2020.1099","title":"A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Subderivative; Mathematics; Conic optimization; Convex analysis; Proper convex function; Convolution (computer science); Convex optimization; Convex function; Convexity; Applied mathematics; Mathematical optimization; Pure mathematics; Regular polygon; Mathematical analysis; Computer science; Geometry","score_opus":0.07620344229829072,"score_gpt":0.3650246803921398,"score_spread":0.2888212380938491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963317235","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.045879185,0.0005676023,0.9407373,0.00044739762,0.000083358515,0.000025304436,0.000024731653,0.00005186729,0.012183259],"genre_scores_gemma":[0.8203348,0.00096966495,0.1651215,0.00031623957,0.00033260294,0.00009035728,0.00005911585,0.00014096666,0.012634803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984084,0.00059209124,0.00008070734,0.0002559713,0.0005119536,0.0001510438],"domain_scores_gemma":[0.9965166,0.0019936184,0.00026793123,0.00035063195,0.0005175266,0.00035370752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918974,0.0012738239,0.0010493312,0.0013210375,0.0012459375,0.0024890075,0.001028865,0.0010247417,0.0023095817],"category_scores_gemma":[0.008253855,0.00043863896,0.0013951237,0.0011654866,0.003818544,0.0046814936,0.003589219,0.0033537336,0.00032215597],"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.000022415039,0.000023658704,0.00029698855,0.000034776873,0.000009160095,0.00013141437,0.00013878815,0.010539502,0.0018938988,0.97886217,0.0002432024,0.0078039635],"study_design_scores_gemma":[0.000008071176,0.000083601786,0.00035242309,0.000032537017,0.000018112047,0.00028513238,0.000087468405,0.29578432,0.003750265,0.6952461,0.0043298146,0.000022137654],"about_ca_topic_score_codex":0.0009218389,"about_ca_topic_score_gemma":0.00058785663,"teacher_disagreement_score":0.003918974,"about_ca_system_score_codex":0.0018625275,"about_ca_system_score_gemma":0.0011129974,"threshold_uncertainty_score":0.020725787},"labels":[],"label_agreement":null},{"id":"W2963547867","doi":"10.1287/moor.2017.0865","title":"Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Simon Fraser University","funders":"Hong Kong Polytechnic University","keywords":"Mathematics; Subgradient method; Conjugate gradient method; Line search; Mathematical optimization; Applied mathematics; Convex function; Subroutine; Norm (philosophy); Regular polygon; Computer science","score_opus":0.10755612476807822,"score_gpt":0.4067246504182096,"score_spread":0.2991685256501314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963547867","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.0010331139,0.000114234455,0.9978219,0.00005477204,0.000024481373,0.00002665057,0.000010787703,0.00014015372,0.00077388244],"genre_scores_gemma":[0.06634726,0.00042384735,0.92803925,0.00016686345,0.00008198512,0.00030529074,0.00010683396,0.0003860179,0.0041425917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991641,0.00034119314,0.00003325045,0.00010428853,0.00029768338,0.000059573762],"domain_scores_gemma":[0.9986557,0.0007259819,0.00013076536,0.00015831727,0.0002710943,0.000058176887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628094,0.0013769357,0.0010645342,0.0006494156,0.00041570058,0.00091345666,0.0014711273,0.0011404749,0.0040415004],"category_scores_gemma":[0.004152277,0.0006119451,0.001158857,0.000765634,0.0015659335,0.001143218,0.0014886666,0.0025621695,0.0013116902],"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.0001318745,0.00007171814,0.00046692285,0.00040098943,0.000097150005,0.00014604237,0.00014416125,0.7281699,0.007891969,0.13111265,0.0053255297,0.12604107],"study_design_scores_gemma":[0.000011172115,0.000023439441,0.00004514099,0.000011951023,0.0000050152785,0.000024084105,0.0000064068618,0.98472786,0.0013197964,0.011645375,0.002171446,0.000008409543],"about_ca_topic_score_codex":0.0024833016,"about_ca_topic_score_gemma":0.002586414,"teacher_disagreement_score":0.0040415004,"about_ca_system_score_codex":0.0008559937,"about_ca_system_score_gemma":0.0016024054,"threshold_uncertainty_score":0.013520122},"labels":[],"label_agreement":null},{"id":"W2963598490","doi":"10.1287/moor.2017.0905","title":"Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms","year":2018,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Restricted isometry property; Augmented Lagrangian method; Regularization (linguistics); Compressed sensing; Mathematical optimization; Sequence (biology); Applied mathematics; Optimization problem; Class (philosophy); Sparse approximation; Algorithm; Computer science; Artificial intelligence","score_opus":0.077372146898713,"score_gpt":0.33510701628345224,"score_spread":0.2577348693847392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963598490","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.0025238825,0.0014462254,0.9936754,0.0005964986,0.0000356976,0.000025292497,0.000060442242,0.00010432354,0.001532261],"genre_scores_gemma":[0.44388452,0.013159691,0.5244912,0.0010370134,0.0011247081,0.0008878618,0.00089111115,0.0003652204,0.0141587285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866056,0.00060226524,0.000051065326,0.00023263923,0.00034279373,0.000110760586],"domain_scores_gemma":[0.99638546,0.0024347645,0.00038703694,0.000322419,0.00035708718,0.00011328078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026224023,0.0015947965,0.0015871124,0.0014081495,0.0005820595,0.0018473328,0.0020696623,0.0022110003,0.0023732316],"category_scores_gemma":[0.007938749,0.00086238666,0.0013858817,0.002337163,0.002951044,0.003549904,0.0030940322,0.0035667974,0.0006256122],"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.00005471498,0.00006742823,0.00067340164,0.000335324,0.000078543264,0.000102429185,0.0001367107,0.6046604,0.0013852557,0.33413607,0.005789245,0.05258049],"study_design_scores_gemma":[0.0000069137313,0.000023010038,0.000071879265,0.000021602515,0.000009409913,0.00003397694,0.000011119078,0.91235036,0.00020859121,0.08593245,0.0013184691,0.000012175984],"about_ca_topic_score_codex":0.004560653,"about_ca_topic_score_gemma":0.0033503773,"teacher_disagreement_score":0.004560653,"about_ca_system_score_codex":0.0013552249,"about_ca_system_score_gemma":0.0015477106,"threshold_uncertainty_score":0.013868749},"labels":[],"label_agreement":null},{"id":"W2984243829","doi":"10.1287/moor.2021.1211","title":"Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Tangent cone; Set (abstract data type); Order (exchange); Function (biology); Tangent; Regular polygon; Duality (order theory); Feasible region; Optimization problem; Computer science; Combinatorics","score_opus":0.09983874736307896,"score_gpt":0.38433441770961,"score_spread":0.28449567034653106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984243829","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.014986533,0.0013680077,0.9628596,0.0010841702,0.00028386535,0.00011391626,0.0003045303,0.00008401092,0.01891545],"genre_scores_gemma":[0.6536904,0.0057739536,0.31062588,0.0009700601,0.00097142474,0.0008244122,0.001469842,0.0005332856,0.025140744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971289,0.0008802446,0.0001774654,0.00036348533,0.0011370579,0.00031280157],"domain_scores_gemma":[0.99249345,0.004843833,0.000641624,0.0002810052,0.0013763846,0.0003637121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00596327,0.0019003999,0.0015903981,0.002235581,0.00073352706,0.0031730551,0.0012787124,0.0019280951,0.0052476083],"category_scores_gemma":[0.01102896,0.000694599,0.0016931737,0.0013613462,0.0028541596,0.004254868,0.0024047557,0.0047118394,0.0010631162],"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.00004301055,0.00006567851,0.00045462995,0.00036573087,0.000047554196,0.00022896132,0.00018614672,0.09194842,0.0036140499,0.89034396,0.0030506058,0.009651245],"study_design_scores_gemma":[0.000027874363,0.000119362216,0.00048355717,0.00012616665,0.000026244243,0.00016078647,0.00013284602,0.66661984,0.0027522924,0.32142472,0.008077846,0.000048530324],"about_ca_topic_score_codex":0.001997802,"about_ca_topic_score_gemma":0.0019778258,"teacher_disagreement_score":0.00596327,"about_ca_system_score_codex":0.0018043872,"about_ca_system_score_gemma":0.0028009685,"threshold_uncertainty_score":0.031537116},"labels":[],"label_agreement":null},{"id":"W2997603461","doi":"10.1287/moor.2019.1048","title":"Resistant Sets in the Unit Hypercube","year":2020,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":6,"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; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Ideal (ethics); Mathematics; Class (philosophy); Hypercube; Combinatorics; Conjecture; Computer science; Artificial intelligence","score_opus":0.45605295422060094,"score_gpt":0.4961485545759485,"score_spread":0.04009560035534754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997603461","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.5771873,0.0015276098,0.30712816,0.0010838993,0.00022442096,0.00014949695,0.00069647137,0.00053248304,0.11147016],"genre_scores_gemma":[0.9334721,0.00076982356,0.0465328,0.00025250245,0.0001582948,0.00018604609,0.0005711459,0.0001007608,0.017956484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898654,0.00026144544,0.00006323619,0.00017535867,0.0003557387,0.00015774222],"domain_scores_gemma":[0.9984022,0.00069705176,0.000281755,0.00025356706,0.00017345812,0.0001920924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005817176,0.00038159083,0.0005332685,0.0011655367,0.001403028,0.00241869,0.00059004925,0.00059360603,0.005279909],"category_scores_gemma":[0.002837856,0.00036186885,0.0005304453,0.0010637941,0.0017645486,0.0024365925,0.0020742025,0.00094620074,0.00097324006],"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.0000835966,0.000022463613,0.0005098849,0.00004879775,0.0000126391205,0.00019003892,0.0002538362,0.0173109,0.002273105,0.9680874,0.0018192822,0.009388009],"study_design_scores_gemma":[0.00003423033,0.00006704633,0.00056381914,0.00003572845,0.000013113201,0.0004762944,0.00037062552,0.07204165,0.0029490273,0.9089139,0.014501868,0.000032726763],"about_ca_topic_score_codex":0.00108459,"about_ca_topic_score_gemma":0.0006677843,"teacher_disagreement_score":0.005279909,"about_ca_system_score_codex":0.0007962097,"about_ca_system_score_gemma":0.00043957573,"threshold_uncertainty_score":0.017663002},"labels":[],"label_agreement":null},{"id":"W3004312307","doi":"10.1287/moor.2021.1125","title":"Geometrical Bounds for Variance and Recentered Moments","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Point processes and geometric inequalities","field":"Mathematics","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Simplex; Regular polygon; Moment (physics); Second moment of area; Range (aeronautics); Vertex (graph theory); Duality (order theory); Variance (accounting); Quasiconvex function; Real line; Convex analysis; Convex optimization; Graph; Physics; Geometry","score_opus":0.4111611711408275,"score_gpt":0.5097600622196345,"score_spread":0.09859889107880704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004312307","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.041418217,0.0042810044,0.92498374,0.0019923637,0.00028413787,0.000021533284,0.00022554994,0.00022935477,0.026564168],"genre_scores_gemma":[0.89549255,0.0028771753,0.090622455,0.0007653291,0.0015772838,0.00016744525,0.00033909784,0.00036782824,0.007790783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604744,0.0014145944,0.00013912028,0.00077068567,0.0011226604,0.00050545164],"domain_scores_gemma":[0.9820707,0.011303887,0.0020475106,0.0020293498,0.001730968,0.0008176412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048562605,0.0015777916,0.0010385405,0.0036630856,0.00083139155,0.00339206,0.0027302476,0.0017057031,0.0048608067],"category_scores_gemma":[0.026003001,0.00054140366,0.0014769181,0.0018819879,0.0041818665,0.006314047,0.0033060673,0.0041014617,0.001048757],"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.000060985865,0.000021097349,0.0006783595,0.000074522184,0.000048306218,0.00011212333,0.00010174228,0.034431618,0.003081669,0.9522794,0.0010501408,0.008059964],"study_design_scores_gemma":[0.000012041279,0.00006976695,0.0011301067,0.00007313864,0.00003239561,0.00020127489,0.000046630685,0.18337911,0.003338985,0.8075262,0.004124693,0.0000655568],"about_ca_topic_score_codex":0.000511803,"about_ca_topic_score_gemma":0.00044057626,"teacher_disagreement_score":0.0048608067,"about_ca_system_score_codex":0.0025173128,"about_ca_system_score_gemma":0.0005628432,"threshold_uncertainty_score":0.025682628},"labels":[],"label_agreement":null},{"id":"W3017369915","doi":"10.1287/moor.2019.1019","title":"Variance Regularization in Sequential Bayesian Optimization","year":2020,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","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":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Mathematical optimization; Bayesian probability; A priori and a posteriori; Mathematics; Optimization problem; Computer science; Dynamic programming; Algorithm; Artificial intelligence","score_opus":0.29304720584955735,"score_gpt":0.49850097107321184,"score_spread":0.2054537652236545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017369915","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.0044605955,0.0008772681,0.98427147,0.0013064159,0.000071817696,0.00003032435,0.0000768768,0.00015438034,0.008750939],"genre_scores_gemma":[0.54799354,0.003068508,0.42065424,0.0017273343,0.00062702567,0.00065381575,0.0005505936,0.0006536646,0.024071306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650013,0.0016643088,0.00011825088,0.0004837951,0.0009962743,0.00023727948],"domain_scores_gemma":[0.98848766,0.009253497,0.00065792195,0.00048752647,0.0008737509,0.00023968039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062415013,0.0014507911,0.0014524506,0.0011171183,0.00078682497,0.0023104257,0.001846852,0.0024074453,0.0041399226],"category_scores_gemma":[0.025657509,0.0009810774,0.0011593661,0.00115313,0.0032681713,0.0032421614,0.0027498219,0.0038687496,0.00068384607],"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.000038890936,0.00002370136,0.000540726,0.00014731484,0.00005167604,0.000073153635,0.00008820462,0.4815387,0.0005055535,0.49870092,0.0027442505,0.015546849],"study_design_scores_gemma":[0.000008193439,0.0000101234045,0.00010616165,0.000030415591,0.000005948071,0.000012900357,0.000009865592,0.76161176,0.00013907257,0.23675561,0.0012995835,0.000010465635],"about_ca_topic_score_codex":0.0077394997,"about_ca_topic_score_gemma":0.0066224,"teacher_disagreement_score":0.0077394997,"about_ca_system_score_codex":0.003348523,"about_ca_system_score_gemma":0.0028671012,"threshold_uncertainty_score":0.033008575},"labels":[],"label_agreement":null},{"id":"W3020910130","doi":"10.1287/moor.2020.1092","title":"Proximal Gradient Methods with Adaptive Subspace Sampling","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Discovery Air (Canada)","funders":"Agence Nationale de la Recherche","keywords":"Subspace topology; Linear subspace; Proximal Gradient Methods; Sampling (signal processing); Key (lock); Computer science; Algorithm; Artificial intelligence; Mathematical optimization; Identification (biology); Mathematics; Gradient descent; Artificial neural network; Computer vision","score_opus":0.23433405679777014,"score_gpt":0.44618666313800154,"score_spread":0.2118526063402314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020910130","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.0014272413,0.00015284453,0.9975993,0.000066868924,0.00002413817,0.000027444914,0.000011715058,0.00013090864,0.0005594871],"genre_scores_gemma":[0.15257014,0.00068150164,0.8409182,0.0002040684,0.00020234422,0.00042948744,0.00016122813,0.00021070831,0.0046224366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00077215006,0.000042021504,0.00014471664,0.00039015443,0.00006372553],"domain_scores_gemma":[0.99860734,0.00083127833,0.00009901567,0.00017887732,0.00021409201,0.00006940779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017556278,0.0011467349,0.0012976706,0.00074367307,0.00042405835,0.0007476706,0.0012659814,0.0013353544,0.0025344107],"category_scores_gemma":[0.0059482064,0.0006067467,0.0007860584,0.00094598904,0.0014297217,0.0013807695,0.002048009,0.0018056965,0.0011510119],"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.00022000205,0.00013145708,0.00046048468,0.0002928172,0.00012459738,0.0001210708,0.00012021411,0.65567935,0.007824914,0.18875551,0.004140147,0.14212951],"study_design_scores_gemma":[0.000029072042,0.00006747717,0.00005321649,0.000010518386,0.0000063022294,0.000041718584,0.0000072042117,0.9702288,0.0013217357,0.025832742,0.0023893586,0.000011920701],"about_ca_topic_score_codex":0.0015269476,"about_ca_topic_score_gemma":0.001240754,"teacher_disagreement_score":0.0025344107,"about_ca_system_score_codex":0.00046914464,"about_ca_system_score_gemma":0.0012822658,"threshold_uncertainty_score":0.009284735},"labels":[],"label_agreement":null},{"id":"W3034080444","doi":"10.1287/moor.2022.1282","title":"Linear Programming and Community Detection","year":2022,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Office of Naval Research; York University; National Science Foundation","keywords":"Bisection method; Logarithm; Linear programming; Relaxation (psychology); Stochastic block model; Degree (music); Bisection; Semidefinite programming; Mathematics; Random graph; Graph; Mathematical optimization; Linear programming relaxation; Combinatorics; Discrete mathematics; Computer science; Statistics; Physics","score_opus":0.1433807337072273,"score_gpt":0.44252985491363594,"score_spread":0.2991491212064087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034080444","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.013873009,0.003020484,0.9649635,0.004266487,0.00015645761,0.000106861015,0.0004098971,0.00037267723,0.0128306],"genre_scores_gemma":[0.48927477,0.0047148047,0.47498706,0.0019555092,0.0011141885,0.0010489855,0.0017221508,0.00060062524,0.024582013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995852,0.0021582288,0.00011239885,0.0009144461,0.0006092378,0.00035371562],"domain_scores_gemma":[0.976867,0.019769456,0.0013466993,0.0005826008,0.0009990208,0.0004352527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004200407,0.0016530905,0.001676268,0.0016356036,0.0010661692,0.0031142668,0.0019731582,0.0022955767,0.0060959207],"category_scores_gemma":[0.02044019,0.00094226317,0.0013283854,0.002754477,0.002859721,0.003991649,0.002670781,0.005301724,0.0010260161],"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.00015258121,0.00020823312,0.0010399659,0.000558112,0.00019208826,0.00013903093,0.00025366247,0.42650843,0.0007845838,0.49496305,0.012595559,0.06260471],"study_design_scores_gemma":[0.000023115737,0.000029102805,0.00014418377,0.000034691468,0.000011577278,0.00003419071,0.000037971226,0.5784579,0.00023045004,0.41852805,0.0024550834,0.000013820119],"about_ca_topic_score_codex":0.0038997778,"about_ca_topic_score_gemma":0.0027828151,"teacher_disagreement_score":0.0060959207,"about_ca_system_score_codex":0.0033854367,"about_ca_system_score_gemma":0.0020989298,"threshold_uncertainty_score":0.024563193},"labels":[],"label_agreement":null},{"id":"W3036346356","doi":"10.1287/moor.2019.1043","title":"On the Scenario-Tree Optimal-Value Error for Stochastic Programming Problems","year":2020,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Tree (set theory); Mathematics; Stochastic programming; Discretization; Node (physics); Bellman equation; Dynamic programming; Computer science; Expected value","score_opus":0.4065420398833334,"score_gpt":0.48614134322049746,"score_spread":0.07959930333716408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036346356","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.014231065,0.00065297855,0.9810362,0.00069154636,0.000046379766,0.00002753088,0.00004130416,0.00005947402,0.0032135549],"genre_scores_gemma":[0.5709317,0.0019049702,0.42274326,0.0005023754,0.00018919399,0.00029439406,0.00025274398,0.00032135998,0.0028600248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957918,0.0025616162,0.00014274563,0.00036687596,0.00088964694,0.0002474301],"domain_scores_gemma":[0.9610538,0.03517753,0.0010832908,0.0009296574,0.0012745153,0.00048116627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013345389,0.0011548431,0.0014157864,0.0013243934,0.0008183889,0.0016471079,0.0013674787,0.0021963292,0.0027348269],"category_scores_gemma":[0.05215799,0.0006174943,0.001176575,0.001162153,0.0032517586,0.003939666,0.0026314824,0.0036705448,0.00031003775],"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.00005969783,0.000030189376,0.0007765357,0.00007857256,0.0000252013,0.00007429685,0.00007123334,0.74566674,0.00055380823,0.24412014,0.00059859763,0.007944927],"study_design_scores_gemma":[0.000007694856,0.00002390224,0.00014118153,0.00003733781,0.0000060824614,0.0000266149,0.000013747398,0.84057784,0.00025664293,0.15837027,0.00052816625,0.000010464924],"about_ca_topic_score_codex":0.0018472195,"about_ca_topic_score_gemma":0.0012853746,"teacher_disagreement_score":0.013345389,"about_ca_system_score_codex":0.0019524847,"about_ca_system_score_gemma":0.0015243734,"threshold_uncertainty_score":0.07057804},"labels":[],"label_agreement":null},{"id":"W3040430149","doi":"10.1287/moor.2019.1035","title":"Surplus-Invariant Risk Measures","year":2020,"lang":"en","type":"article","venue":"Mathematics of 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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Invariant (physics); Lattice (music); Dual (grammatical number); Pure mathematics; Mathematical economics; Discrete mathematics","score_opus":0.4733203417074584,"score_gpt":0.49657254792778727,"score_spread":0.023252206220328864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040430149","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.09900288,0.0012438017,0.83916485,0.0014859379,0.00017694152,0.00005597233,0.00022935065,0.00012426318,0.058515966],"genre_scores_gemma":[0.93391275,0.0012444949,0.054168776,0.00026525243,0.00036456736,0.000101397774,0.00016446103,0.00009100401,0.009687294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788946,0.00068814843,0.000107798,0.00036988623,0.0007160328,0.00022870183],"domain_scores_gemma":[0.99684,0.0014184869,0.00056528056,0.00047456077,0.0003963769,0.00030529487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028271985,0.00062402943,0.0007832458,0.0015570682,0.0006313512,0.003453535,0.0008972111,0.00086800416,0.004568824],"category_scores_gemma":[0.0074274833,0.00028925488,0.0008837857,0.00090693164,0.004042481,0.006178737,0.0023759922,0.0022095093,0.0005292978],"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.00000489392,0.000007011273,0.00010380442,0.000013379852,0.0000053507033,0.000015937105,0.000027999315,0.0022224418,0.00032108062,0.99476975,0.0001719711,0.0023363803],"study_design_scores_gemma":[0.00000506321,0.000018674898,0.00014573523,0.000012457022,0.000005132738,0.000055066266,0.00002846496,0.019837895,0.00028354593,0.9770757,0.0025236278,0.000008658865],"about_ca_topic_score_codex":0.0002747534,"about_ca_topic_score_gemma":0.00015912707,"teacher_disagreement_score":0.004568824,"about_ca_system_score_codex":0.0014405086,"about_ca_system_score_gemma":0.0007003069,"threshold_uncertainty_score":0.015284181},"labels":[],"label_agreement":null},{"id":"W3049647307","doi":"10.1287/moor.2022.1301","title":"Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"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":"Augmented Lagrangian method; Lagrange multiplier; Regular polygon; Mathematics; Lagrangian; Mathematical optimization; Applied mathematics; Geometry","score_opus":0.09276373530409061,"score_gpt":0.35479514559571934,"score_spread":0.26203141029162874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049647307","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.0047646053,0.00011529526,0.99325645,0.0001241626,0.000027953629,0.00003019287,0.000012490052,0.0000898286,0.0015790163],"genre_scores_gemma":[0.21610367,0.00037323992,0.7791459,0.000141335,0.00010694165,0.00032111868,0.00013809047,0.0001837606,0.0034859166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910647,0.00034113706,0.00003482064,0.000096295196,0.00034654423,0.00007469955],"domain_scores_gemma":[0.99773407,0.0015949801,0.00013870075,0.00013155174,0.00028792958,0.000112722155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018581086,0.00080298295,0.0007971996,0.0004849129,0.000471563,0.0010165035,0.0010796043,0.0010750546,0.0025969085],"category_scores_gemma":[0.0044682613,0.00045892777,0.00072888104,0.00042828787,0.0010500601,0.0011735545,0.0016404986,0.0020387473,0.00052413956],"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.00018029526,0.00007044867,0.00075045484,0.00021984965,0.00004741451,0.00016578323,0.00012650019,0.89943486,0.0043933718,0.03887656,0.00224719,0.053487297],"study_design_scores_gemma":[0.0000050162425,0.00001649387,0.000034406676,0.0000036607544,0.0000020613138,0.0000140021975,0.0000052214873,0.99693775,0.00032572408,0.0022573234,0.00039556326,0.0000027160966],"about_ca_topic_score_codex":0.0021232036,"about_ca_topic_score_gemma":0.0028541323,"teacher_disagreement_score":0.0025969085,"about_ca_system_score_codex":0.0006298534,"about_ca_system_score_gemma":0.0019657558,"threshold_uncertainty_score":0.009826779},"labels":[],"label_agreement":null},{"id":"W3080579124","doi":"10.1287/moor.2022.1296","title":"Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Representation theorem; Mathematical economics; Representation (politics); Stochastic control; Mathematical optimization; Function (biology); Argument (complex analysis); Optimal control; Discrete mathematics; Economics","score_opus":0.2265578077688728,"score_gpt":0.4777485362270733,"score_spread":0.2511907284582005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080579124","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.13549285,0.00019982531,0.8561496,0.000876457,0.000061098894,0.00010272951,0.00016981775,0.00011306368,0.0068344823],"genre_scores_gemma":[0.9302242,0.0002924224,0.065755844,0.00016950569,0.000060147126,0.00029527745,0.00021075294,0.00006080937,0.0029310898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995883,0.0020065145,0.00022220459,0.00089735247,0.00048385785,0.00050701265],"domain_scores_gemma":[0.98353565,0.011199768,0.0030823692,0.0007486155,0.00065257837,0.0007809148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051682238,0.0014051361,0.0021225258,0.00069925754,0.0006324533,0.0018323794,0.0016776194,0.0021019562,0.002797405],"category_scores_gemma":[0.022498114,0.000834188,0.0015489453,0.00050147605,0.0024125183,0.0025479174,0.0021639615,0.0025648056,0.0003707996],"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.00022367957,0.00014395088,0.0008545278,0.00014122964,0.00010406511,0.0001157213,0.00014577946,0.770865,0.0017667928,0.21775462,0.00063867675,0.007245992],"study_design_scores_gemma":[0.00003702182,0.000076301745,0.00012801605,0.000020190935,0.0000110790725,0.000014419274,0.000029602093,0.9293875,0.0006319638,0.06943969,0.00021244369,0.000011793521],"about_ca_topic_score_codex":0.0014896734,"about_ca_topic_score_gemma":0.0009733105,"teacher_disagreement_score":0.0051682238,"about_ca_system_score_codex":0.0023214014,"about_ca_system_score_gemma":0.0027933351,"threshold_uncertainty_score":0.027332544},"labels":[],"label_agreement":null},{"id":"W3094948588","doi":"10.1287/moor.2022.1299","title":"Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":10,"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":"Mathematics; Risk measure; Measure (data warehouse); Upper and lower bounds; Duality (order theory); Mathematical optimization; Applied mathematics; Expected shortfall; Metric (unit); Bellman equation; Function (biology); Wasserstein metric; Constraint (computer-aided design); Combinatorics; Mathematical analysis; Risk management; Computer science; Finance","score_opus":0.19479692925859743,"score_gpt":0.4235596820432506,"score_spread":0.2287627527846532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094948588","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.03565777,0.00044432862,0.96020913,0.00042285936,0.00002809277,0.0000399837,0.00008113918,0.00009984707,0.0030167515],"genre_scores_gemma":[0.8158785,0.00090563373,0.17856497,0.00019227389,0.00016568138,0.00028666639,0.00023004491,0.0001665446,0.0036098193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956807,0.0020539914,0.00017215322,0.0008920351,0.0008262527,0.00037494328],"domain_scores_gemma":[0.9748947,0.019662442,0.0019539103,0.0013572199,0.0013512493,0.0007805209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009679038,0.0018579564,0.0023228454,0.0018265932,0.0006838392,0.0035616308,0.0021241726,0.0022207405,0.002483134],"category_scores_gemma":[0.046307143,0.00087821274,0.0014161963,0.0011930765,0.0038713417,0.006550656,0.0030515406,0.0025592442,0.00038821076],"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.00013385636,0.00007210845,0.0010445052,0.0001918518,0.00011502301,0.00013218098,0.0001512223,0.51706094,0.0017302968,0.46539965,0.0007334629,0.013234908],"study_design_scores_gemma":[0.000010840427,0.00006314985,0.00028465182,0.000048465048,0.000017388895,0.000057443947,0.00003991069,0.73674226,0.00086719205,0.26121634,0.0006211658,0.00003118991],"about_ca_topic_score_codex":0.00089582003,"about_ca_topic_score_gemma":0.00053557556,"teacher_disagreement_score":0.009679038,"about_ca_system_score_codex":0.002888526,"about_ca_system_score_gemma":0.0013841625,"threshold_uncertainty_score":0.05118823},"labels":[],"label_agreement":null},{"id":"W3121210304","doi":"10.1287/moor.2015.0736","title":"Local Utility and Multivariate Risk Aversion","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Decision-Making and Behavioral Economics","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":"Université du Québec à Montréal","funders":"","keywords":"Multivariate statistics; Multivariate analysis; Expected utility hypothesis; Independence (probability theory); Risk aversion (psychology); Risk measure; Measure (data warehouse); Rank (graph theory); Extension (predicate logic)","score_opus":0.3745943975959188,"score_gpt":0.5166390033561686,"score_spread":0.14204460576024985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121210304","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.2165289,0.001998846,0.7322229,0.0029742215,0.000059732763,0.000046457102,0.00011220955,0.00007742566,0.045979284],"genre_scores_gemma":[0.97328013,0.0006468913,0.022449877,0.0001624425,0.00008562732,0.000041619896,0.000024858871,0.000019514873,0.003289014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989544,0.0004859668,0.000036061538,0.0001511515,0.000244405,0.00012804422],"domain_scores_gemma":[0.99612385,0.001890427,0.0008362176,0.0004774836,0.00036787696,0.0003040906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002176988,0.0005359251,0.0006692628,0.0010504598,0.00057774223,0.0017760905,0.00093988207,0.0005640021,0.0035657843],"category_scores_gemma":[0.006299432,0.00023723867,0.001057828,0.0011572461,0.0029747905,0.0036562977,0.0024706258,0.0019370911,0.00026513496],"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.000023720791,0.000037666872,0.0019104442,0.00004638693,0.000033392713,0.00010716641,0.00047357508,0.00932881,0.00065205566,0.9730638,0.00038025854,0.013942701],"study_design_scores_gemma":[0.0000091373695,0.000055569108,0.0019470658,0.000032592397,0.000022529443,0.000121870056,0.00011760458,0.03461913,0.00039991373,0.95997894,0.0026705347,0.000025055586],"about_ca_topic_score_codex":0.0009501649,"about_ca_topic_score_gemma":0.00081655366,"teacher_disagreement_score":0.0035657843,"about_ca_system_score_codex":0.0012767871,"about_ca_system_score_gemma":0.00044133788,"threshold_uncertainty_score":0.011928737},"labels":[],"label_agreement":null},{"id":"W3123587043","doi":"10.1287/moor.1120.0577","title":"External Risk Measures and Basel Accords","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":169,"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":"Hong Kong University of Science and Technology; Georgia State University; University of Alberta; National Science Foundation","keywords":"Basel II; Operational risk; Dynamic risk measure; Risk measure; Risk-weighted asset; Coherent risk measure; Capital requirement; Mathematics; Risk-adjusted return on capital; Robustness (evolution); Actuarial science; Measure (data warehouse); Econometrics; Risk analysis (engineering); Risk management; Value at risk; Economics; Computer science; Business; Finance; Data mining; Microeconomics; Profit (economics)","score_opus":0.2633710761696301,"score_gpt":0.4807259011762479,"score_spread":0.2173548250066178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123587043","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.05786625,0.0046654516,0.7595437,0.006277938,0.00097544026,0.0001733356,0.0005498367,0.00065216504,0.16929586],"genre_scores_gemma":[0.9339757,0.001351002,0.05409951,0.0010782587,0.00093492866,0.00034091965,0.00030269148,0.0001628233,0.007754265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9777974,0.009589955,0.0018375376,0.002761753,0.007094649,0.0009187386],"domain_scores_gemma":[0.9731084,0.012113404,0.0062062102,0.0034149964,0.0042478982,0.0009091267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017382154,0.0012231166,0.00097562186,0.0030398401,0.001131482,0.0056556673,0.0010803996,0.0023861907,0.0044482634],"category_scores_gemma":[0.04156412,0.00032166616,0.0010223833,0.0019209608,0.008869812,0.0059735333,0.0027540266,0.0035433855,0.0008225988],"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.000013440237,0.000010191294,0.00038966557,0.000029108178,0.000014721582,0.000037202524,0.000066415356,0.0075291055,0.00013880234,0.9831988,0.0015003496,0.007072144],"study_design_scores_gemma":[0.0000073397073,0.000027258802,0.00039027186,0.00005604564,0.000007676719,0.000056719,0.000030684307,0.009494742,0.00017867632,0.98129886,0.008425002,0.00002676052],"about_ca_topic_score_codex":0.00056698296,"about_ca_topic_score_gemma":0.00032099496,"teacher_disagreement_score":0.017382154,"about_ca_system_score_codex":0.0020586927,"about_ca_system_score_gemma":0.0015232799,"threshold_uncertainty_score":0.09192675},"labels":[],"label_agreement":null},{"id":"W3123884815","doi":"10.1287/moor.2015.0721","title":"Equilibrium Pricing in Incomplete Markets Under Translation Invariant Preferences","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"McMaster University","funders":"","keywords":"Uniqueness; Financial market; Mathematical economics; Incomplete markets; Regular polygon; Mathematics; Complete market; General equilibrium theory; Stochastic discount factor; Trading strategy; Invariant (physics); Dual (grammatical number); Economics; Econometrics; Capital asset pricing model; Finance; Microeconomics","score_opus":0.39013738590949265,"score_gpt":0.36322870415745967,"score_spread":0.02690868175203298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123884815","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.0738154,0.0002194391,0.91970944,0.00043179494,0.000043097683,0.000037787362,0.000107475185,0.000050297433,0.0055852947],"genre_scores_gemma":[0.8593209,0.00066489814,0.13252978,0.00014623295,0.00013653269,0.00013998592,0.00018472609,0.00005885233,0.0068181795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992206,0.0003468169,0.000051566203,0.00010136635,0.00016858074,0.00011112337],"domain_scores_gemma":[0.9984289,0.00075263827,0.00030794682,0.00020750858,0.00017517906,0.00012780185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020336572,0.00052097935,0.00092628243,0.0006078717,0.00040813512,0.0019157998,0.0012039922,0.0010019519,0.0028271717],"category_scores_gemma":[0.0054847184,0.00041936876,0.0011748127,0.000644561,0.0014692029,0.003954742,0.0010983422,0.0011384208,0.00032857832],"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.00002487563,0.000033849705,0.00020306239,0.000037728918,0.000022479111,0.00012334093,0.00007443877,0.10348077,0.000918847,0.89036703,0.0003394591,0.004374117],"study_design_scores_gemma":[0.000021169959,0.000016325572,0.00009937117,0.0000054496754,0.0000066029684,0.000027061405,0.000016522203,0.48333013,0.00032059476,0.5156613,0.00048561828,0.000009811745],"about_ca_topic_score_codex":0.0010670568,"about_ca_topic_score_gemma":0.0009671173,"teacher_disagreement_score":0.0028271717,"about_ca_system_score_codex":0.0012859397,"about_ca_system_score_gemma":0.0009198358,"threshold_uncertainty_score":0.010755122},"labels":[],"label_agreement":null},{"id":"W3123924727","doi":"10.1287/moor.2019.1020","title":"Characterization, Robustness, and Aggregation of Signed Choquet Integrals","year":2020,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Mathematics; Choquet integral; Monotonic function; Choquet theory; Additive function; Robustness (evolution); Class (philosophy); Regular polygon; Invariant (physics); Characterization (materials science); Pure mathematics; Applied mathematics; Mathematical economics; Discrete mathematics; Subderivative; Convex optimization; Mathematical analysis; Artificial intelligence; Computer science; Fuzzy logic","score_opus":0.2841848051385171,"score_gpt":0.45450103822292137,"score_spread":0.17031623308440424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123924727","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.22978102,0.00095464004,0.74620473,0.0007589827,0.00014328309,0.00005932768,0.00014938523,0.0001212304,0.02182744],"genre_scores_gemma":[0.97098136,0.00046694605,0.025259314,0.00011759634,0.00014919639,0.000048545884,0.00008443967,0.000043960485,0.0028486855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978485,0.00050289434,0.0001580601,0.00040083966,0.0008716151,0.00021806986],"domain_scores_gemma":[0.9944284,0.0025407097,0.0012842576,0.0006267765,0.0007447728,0.00037510006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036376384,0.00064174965,0.00077415764,0.002143381,0.0007424679,0.0033297562,0.00097134704,0.0010724836,0.002524895],"category_scores_gemma":[0.01424269,0.00030562154,0.0009844252,0.0013750035,0.0025203489,0.004561426,0.0020392393,0.0016308095,0.00018260934],"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.000064331885,0.000040259016,0.001778407,0.00007502933,0.000056434656,0.00025131356,0.00019310492,0.0281256,0.008916262,0.9427425,0.00049842015,0.017258313],"study_design_scores_gemma":[0.000014047878,0.00008912857,0.0026289606,0.000039427265,0.00003027748,0.00042150868,0.00013317392,0.27893618,0.004096301,0.71095973,0.0025924887,0.00005879342],"about_ca_topic_score_codex":0.0004233188,"about_ca_topic_score_gemma":0.00019852689,"teacher_disagreement_score":0.0036376384,"about_ca_system_score_codex":0.0013435577,"about_ca_system_score_gemma":0.0006817871,"threshold_uncertainty_score":0.019237936},"labels":[],"label_agreement":null},{"id":"W3125265748","doi":"10.1287/moor.2020.1072","title":"A Theory for Measures of Tail Risk","year":2021,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Coherent risk measure; Dynamic risk measure; Spectral risk measure; Risk measure; Expected shortfall; Tail risk; Subadditivity; Value at risk; Mathematics; Time consistency; Risk management; Actuarial science; Econometrics; Measure (data warehouse); Convexity; Financial risk; Financial risk management; Economics; Computer science; Finance","score_opus":0.4231346017905099,"score_gpt":0.5173141037081926,"score_spread":0.09417950191768276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125265748","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.01316488,0.0023521208,0.9523893,0.0024762899,0.00021845316,0.000053200376,0.00033002027,0.00016819221,0.028847579],"genre_scores_gemma":[0.70433956,0.0071794023,0.25629058,0.0028040584,0.0026227587,0.0007735261,0.00090092834,0.0004090778,0.024680069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951273,0.0015496584,0.0003626085,0.0008833418,0.0017438652,0.00033315818],"domain_scores_gemma":[0.98416704,0.009763376,0.0017850905,0.0017318876,0.0019448769,0.000607761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005918378,0.0014183518,0.0010315566,0.0035612904,0.0014917033,0.0056192055,0.001811585,0.0028180815,0.006805482],"category_scores_gemma":[0.021694241,0.0006680609,0.0021373038,0.0026817266,0.00574781,0.010501778,0.0034433326,0.00505151,0.0014696207],"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.0000027401766,0.0000061146184,0.000092761285,0.000020716107,0.0000067080286,0.000015866435,0.00005169678,0.0014883804,0.00012232282,0.9951095,0.00042258098,0.0026605274],"study_design_scores_gemma":[0.0000035559367,0.000015471924,0.00010073252,0.000025511856,0.000005358838,0.00004656516,0.000019037905,0.008879092,0.000095424766,0.987194,0.0036061578,0.000009147318],"about_ca_topic_score_codex":0.00088328565,"about_ca_topic_score_gemma":0.00045587332,"teacher_disagreement_score":0.006805482,"about_ca_system_score_codex":0.0030760013,"about_ca_system_score_gemma":0.0013277758,"threshold_uncertainty_score":0.03129977},"labels":[],"label_agreement":null},{"id":"W3131578784","doi":"10.1287/moor.2022.1317","title":"From Perspective Maps to Epigraphical Projections","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","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":true,"ca_institutions":"McGill University; University of British Columbia","funders":"","keywords":"Mathematics; Epigraph; Applied mathematics; Norm (philosophy); Differentiable function; Mathematical optimization; Mathematical analysis; Pure mathematics","score_opus":0.08675494905584905,"score_gpt":0.4038517438041044,"score_spread":0.31709679474825536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131578784","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.013367709,0.00014929006,0.9824514,0.00017517927,0.000025473451,0.000024802215,0.00004389262,0.000117053234,0.0036452136],"genre_scores_gemma":[0.4073761,0.00097643037,0.5819298,0.00019192172,0.00011530584,0.00016183054,0.00027181418,0.0005326857,0.008444021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993755,0.00022378594,0.000026172323,0.00012517103,0.00019215757,0.00005715923],"domain_scores_gemma":[0.9988877,0.0005080673,0.00011027318,0.0001522198,0.00021819789,0.00012358022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013696613,0.000676751,0.0005028428,0.0012646442,0.00056270347,0.0024095122,0.0007411085,0.00092760724,0.004479862],"category_scores_gemma":[0.006076983,0.0006695923,0.00077847316,0.0007028412,0.002330984,0.0032571617,0.0032002693,0.0018946426,0.0007970534],"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.000047293535,0.000024499413,0.00047734173,0.00009076717,0.00001938984,0.000076974495,0.00030793954,0.10669194,0.0040143207,0.8313394,0.001762552,0.055147532],"study_design_scores_gemma":[0.000008757861,0.00004423519,0.0003003847,0.000032370375,0.000007919081,0.000089030975,0.00008559429,0.5077659,0.0027940895,0.48261246,0.006239929,0.000019319006],"about_ca_topic_score_codex":0.0015881236,"about_ca_topic_score_gemma":0.0013738543,"teacher_disagreement_score":0.004479862,"about_ca_system_score_codex":0.0009585881,"about_ca_system_score_gemma":0.0010359525,"threshold_uncertainty_score":0.014986634},"labels":[],"label_agreement":null},{"id":"W3136541527","doi":"10.1287/moor.2022.1331","title":"Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Markov decision process; Partially observable Markov decision process; Convergence (economics); Bellman equation; Mathematical optimization; Mathematics; Limit (mathematics); Stability (learning theory); Filter (signal processing); Q-learning; Reinforcement learning; Optimal control; Ergodicity; Markov chain; Applied mathematics; Computer science; Markov process; Artificial intelligence; Machine learning","score_opus":0.19567375944599658,"score_gpt":0.3990674966197256,"score_spread":0.20339373717372905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136541527","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.033055406,0.00015793616,0.96442497,0.00028991673,0.000017601476,0.000054227843,0.00003205114,0.00015209922,0.0018157299],"genre_scores_gemma":[0.8718561,0.00034630724,0.12455048,0.00024694492,0.00004490515,0.00039969364,0.00013182206,0.00015088964,0.0022729237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976433,0.00093060697,0.00014469637,0.00047888194,0.00054735894,0.0002551225],"domain_scores_gemma":[0.9588679,0.035531618,0.0019823005,0.0010794197,0.0019185923,0.00062016054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007389967,0.0009997521,0.0014132909,0.0010984658,0.0009813897,0.001761536,0.0015003277,0.0019649672,0.0024683503],"category_scores_gemma":[0.0530324,0.00066819554,0.0010827674,0.00056112563,0.0038063363,0.0035742174,0.0027933843,0.0026531543,0.00033468805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017624303,0.000100093544,0.0018489711,0.00015232866,0.000069113004,0.00013525772,0.00030921792,0.83992827,0.0020572434,0.1370775,0.0004172377,0.01772861],"study_design_scores_gemma":[0.000015076115,0.00004978177,0.00011279247,0.000016471078,0.000004837877,0.000014954669,0.000016212285,0.96443504,0.00065847166,0.034558658,0.00011003252,0.0000075712883],"about_ca_topic_score_codex":0.004182089,"about_ca_topic_score_gemma":0.0019360182,"teacher_disagreement_score":0.007389967,"about_ca_system_score_codex":0.002279695,"about_ca_system_score_gemma":0.0027857055,"threshold_uncertainty_score":0.03908235},"labels":[],"label_agreement":null},{"id":"W3137982035","doi":"10.1287/moor.2020.1090","title":"Distributional Transforms, Probability Distortions, and Their Applications","year":2021,"lang":"en","type":"article","venue":"Mathematics of 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 Waterloo","funders":"","keywords":"Probability measure; Convexity; Probability distribution; Mathematics; Applied probability; Coherence (philosophical gambling strategy); Probability theory; Construct (python library); Set (abstract data type); Distortion (music); Class (philosophy); Mathematical optimization; Focus (optics); Mathematical economics; Econometrics; Computer science; Statistics; Artificial intelligence; Finance","score_opus":0.25412315247916384,"score_gpt":0.47134959989459996,"score_spread":0.21722644741543612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137982035","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.038369983,0.0038930015,0.9135661,0.0031751853,0.0003377299,0.00006751056,0.00013248833,0.000114651106,0.040343232],"genre_scores_gemma":[0.8143576,0.0059020864,0.16497871,0.0009292417,0.0012419187,0.00022547036,0.00019388681,0.00018976117,0.011981272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759275,0.0008931389,0.00016584268,0.00040999844,0.00079410675,0.00014403413],"domain_scores_gemma":[0.99295324,0.0041563325,0.0009725389,0.00086073054,0.0007314113,0.00032574695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033075302,0.0011173019,0.0009321981,0.0023879248,0.0010076194,0.002691142,0.0009379878,0.0020814796,0.0042547206],"category_scores_gemma":[0.01698238,0.0005198962,0.0013155225,0.0020367294,0.0054157567,0.006025523,0.00394925,0.0045784996,0.0005389788],"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.000009442816,0.000011027186,0.00019423994,0.000023670153,0.000008550397,0.000074444615,0.0000606493,0.007856431,0.00037397514,0.98501956,0.00026989673,0.0060980925],"study_design_scores_gemma":[0.0000047033323,0.000015644124,0.00010664578,0.000018081475,0.0000044194503,0.00018849454,0.00003942076,0.022820959,0.00033606793,0.97339183,0.003061962,0.000011851655],"about_ca_topic_score_codex":0.00062478933,"about_ca_topic_score_gemma":0.0002711425,"teacher_disagreement_score":0.0042547206,"about_ca_system_score_codex":0.001770009,"about_ca_system_score_gemma":0.0007729064,"threshold_uncertainty_score":0.017492115},"labels":[],"label_agreement":null},{"id":"W3153293675","doi":"10.1287/moor.2022.1297","title":"Mean Field Contest with Singularity","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":4,"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":"Mathematics; Mathematical economics; CONTEST; Nash equilibrium; Mean field theory; Function (biology); Bayesian game; Game theory; Applied mathematics; Sequential game","score_opus":0.10707565986247287,"score_gpt":0.3271706101716238,"score_spread":0.22009495030915094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153293675","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.34589732,0.00059051387,0.5808704,0.0038580738,0.00022257968,0.00014655018,0.00032387747,0.00030518262,0.06778551],"genre_scores_gemma":[0.9588107,0.00018316112,0.02612536,0.0002990321,0.00011388002,0.000115825045,0.000069841946,0.000046246252,0.014235982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984927,0.0007184622,0.00005835052,0.00026176864,0.00021712705,0.0002516348],"domain_scores_gemma":[0.9955456,0.002473456,0.0005940092,0.000397695,0.0002525745,0.00073663064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027141941,0.00072810036,0.0014826017,0.0006722048,0.00091507914,0.0022031865,0.0015319779,0.0024480089,0.008957507],"category_scores_gemma":[0.009381262,0.0003732768,0.0011391606,0.0004709669,0.0026160944,0.002312229,0.0018664863,0.0018546599,0.0006641811],"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.00014129095,0.000077594545,0.0005521081,0.00005752347,0.000028369735,0.00018374292,0.000118621574,0.09105621,0.001044191,0.8986536,0.0019309828,0.006155747],"study_design_scores_gemma":[0.0000709131,0.00010547205,0.0003545608,0.000016431022,0.000011220553,0.000095990086,0.000046062956,0.34227762,0.00022016418,0.6547567,0.0020154868,0.00002939063],"about_ca_topic_score_codex":0.001302738,"about_ca_topic_score_gemma":0.0011423118,"teacher_disagreement_score":0.008957507,"about_ca_system_score_codex":0.0017961484,"about_ca_system_score_gemma":0.0011212934,"threshold_uncertainty_score":0.029965818},"labels":[],"label_agreement":null},{"id":"W3154647796","doi":"10.1287/moor.2022.1307","title":"An Equilibrium Model for the Cross Section of Liquidity Premia","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Context (archaeology); Transaction cost; Market liquidity; Quadratic equation; Economics; Mathematical economics; Stochastic differential equation; Risk premium; Econometrics; Mathematics; Finance; Applied mathematics","score_opus":0.1867902130157397,"score_gpt":0.3936972005100859,"score_spread":0.2069069874943462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154647796","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.30873302,0.0007976313,0.6674172,0.0020982672,0.00007331366,0.00012162761,0.0005486535,0.00026386487,0.019946361],"genre_scores_gemma":[0.9596397,0.00038173408,0.01868678,0.0001513877,0.00006721237,0.00016370788,0.00022047064,0.000042569736,0.02064648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934,0.00021322237,0.000025767682,0.00019810001,0.00008120601,0.00014170268],"domain_scores_gemma":[0.9984316,0.00078957615,0.000386436,0.00008798766,0.00014156805,0.00016275498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014790947,0.0008855707,0.0012103054,0.0009811148,0.0006461781,0.002465634,0.0022157645,0.0028225954,0.008974671],"category_scores_gemma":[0.0039969147,0.000583298,0.0009533414,0.0008433407,0.0015922346,0.0035593705,0.0016245849,0.001835321,0.0009031864],"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.000100036734,0.00010421,0.0021140263,0.000052394782,0.000082109946,0.0005462513,0.00022648786,0.4025065,0.003248315,0.5851866,0.0010101419,0.0048229685],"study_design_scores_gemma":[0.000048612565,0.000049520047,0.00042852637,0.000009195368,0.000021607684,0.00011627366,0.00005268959,0.8873603,0.0002697456,0.11081567,0.000803253,0.000024556974],"about_ca_topic_score_codex":0.0048657963,"about_ca_topic_score_gemma":0.0023586317,"teacher_disagreement_score":0.008974671,"about_ca_system_score_codex":0.0016530094,"about_ca_system_score_gemma":0.0009701016,"threshold_uncertainty_score":0.030023277},"labels":[],"label_agreement":null},{"id":"W3175846223","doi":"10.1287/moor.2022.1347","title":"On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Disjoint sets; Generality; Shadow (psychology); Sequence (biology); Regular polygon; Algorithm; Limit (mathematics); Convergence (economics); Limit point; Mathematical optimization; Combinatorics; Mathematical analysis; Geometry","score_opus":0.12523216314823551,"score_gpt":0.3695865910523152,"score_spread":0.2443544279040797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175846223","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.004264007,0.0003707894,0.99265844,0.00029205275,0.000043136362,0.000050296116,0.00002277716,0.00010808663,0.0021904728],"genre_scores_gemma":[0.09871628,0.00046077184,0.8953657,0.00036226393,0.000121671495,0.0002692235,0.00018495892,0.00021168143,0.004307391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972566,0.0013739837,0.00013122997,0.00028708566,0.00075018575,0.00020094363],"domain_scores_gemma":[0.994816,0.0036757956,0.00029423405,0.00042030396,0.0005924979,0.00020119648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008198039,0.0014533645,0.0019307781,0.0018329385,0.001097236,0.0015478287,0.00268501,0.0025555003,0.0032008155],"category_scores_gemma":[0.01662317,0.0009592381,0.0014310974,0.0016218325,0.003178287,0.0022083605,0.0041802684,0.0032801523,0.0008060817],"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.00021161376,0.00008623315,0.0013781078,0.0002143041,0.00011224229,0.00023929818,0.00029344225,0.5525469,0.0017164802,0.36558414,0.0040185913,0.07359859],"study_design_scores_gemma":[0.000030276315,0.000045071025,0.00008115601,0.000037543283,0.000007775681,0.0000354861,0.000021075606,0.8897933,0.00036971507,0.107476115,0.0020879481,0.000014682519],"about_ca_topic_score_codex":0.0059183193,"about_ca_topic_score_gemma":0.0063017095,"teacher_disagreement_score":0.008198039,"about_ca_system_score_codex":0.0016035662,"about_ca_system_score_gemma":0.003210561,"threshold_uncertainty_score":0.043355882},"labels":[],"label_agreement":null},{"id":"W3185886855","doi":"10.1287/moor.2023.1382","title":"A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic growth; Jacobian matrix and determinant; Invertible matrix; Differentiable function; Matrix (chemical analysis); Newton's method; Applied mathematics; Convergence (economics); Type (biology); Rate of convergence; Upper and lower bounds; Mathematical optimization; Mathematical analysis; Nonlinear system; Pure mathematics; Computer science","score_opus":0.11297380170013353,"score_gpt":0.444277015250635,"score_spread":0.33130321355050146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185886855","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.0055864598,0.00009467045,0.9926301,0.00012223118,0.000039035738,0.000033127588,0.000016751204,0.00006468259,0.0014127827],"genre_scores_gemma":[0.22438067,0.00036497883,0.7608355,0.0002037826,0.00013886513,0.00029171977,0.00019402245,0.00025669602,0.013333768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.00016408943,0.000019582274,0.00007183031,0.00017530561,0.000039821934],"domain_scores_gemma":[0.99902344,0.00048280245,0.00010679763,0.000065252774,0.00021342638,0.000108239605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779537,0.0008349578,0.0010070556,0.0006679686,0.00049735425,0.0007280993,0.0011293881,0.0018508619,0.0026192688],"category_scores_gemma":[0.0025967923,0.000489278,0.0009096933,0.00041473735,0.0011545153,0.0011970778,0.0015259978,0.0018691337,0.0007025824],"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.000150889,0.00012983674,0.0009666764,0.00029509646,0.000078386256,0.00027580652,0.00025390415,0.81030166,0.01761579,0.10658842,0.0032252602,0.060118373],"study_design_scores_gemma":[0.0000063286316,0.000023642675,0.00003078917,0.000004905227,0.0000028796549,0.000020172725,0.0000048913903,0.9949935,0.0004769361,0.0037037316,0.0007261797,0.0000059668064],"about_ca_topic_score_codex":0.0036020742,"about_ca_topic_score_gemma":0.0032378032,"teacher_disagreement_score":0.0036020742,"about_ca_system_score_codex":0.00071736705,"about_ca_system_score_gemma":0.0016134275,"threshold_uncertainty_score":0.0087623},"labels":[],"label_agreement":null},{"id":"W3203261540","doi":"10.1287/moor.2023.1351","title":"Bilateral Trade: A Regret Minimization Perspective","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 Ottawa","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Agence Nationale de la Recherche","keywords":"Regret; Hindsight bias; Bounded function; Mathematical economics; Mathematics; Benchmark (surveying); Perspective (graphical); Statistics; Psychology","score_opus":0.46240689411217983,"score_gpt":0.5846736458382126,"score_spread":0.12226675172603274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203261540","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.0138534,0.001568757,0.9611527,0.0030227366,0.00018085829,0.000099421755,0.00016568704,0.00014505621,0.019811345],"genre_scores_gemma":[0.7608784,0.0030938082,0.21019143,0.0013809948,0.0014269169,0.0006009048,0.00030402406,0.00038319523,0.021740353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99403954,0.0032271594,0.00015887793,0.00087040704,0.0011087265,0.00059535867],"domain_scores_gemma":[0.98777986,0.0092040505,0.0009738433,0.0009873093,0.00056020473,0.00049479736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00852093,0.0020629007,0.002046318,0.001080552,0.0012189269,0.003720282,0.0036351301,0.0034834957,0.009059997],"category_scores_gemma":[0.018195735,0.00083355594,0.0021411525,0.0011842382,0.0033727973,0.007594932,0.0029399698,0.0053167474,0.0008688619],"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.00021477419,0.00015413146,0.0004940068,0.0002735608,0.00012629139,0.00013540834,0.00015950286,0.29932392,0.0010373666,0.6735266,0.0030745307,0.02147988],"study_design_scores_gemma":[0.00004357165,0.000112068876,0.00021250836,0.00006384396,0.000045331377,0.0000828063,0.000042545755,0.46713787,0.0005001215,0.5284423,0.0032907727,0.00002614001],"about_ca_topic_score_codex":0.0013848811,"about_ca_topic_score_gemma":0.00083038164,"teacher_disagreement_score":0.009059997,"about_ca_system_score_codex":0.0033648738,"about_ca_system_score_gemma":0.0023291172,"threshold_uncertainty_score":0.045063555},"labels":[],"label_agreement":null},{"id":"W3208746577","doi":"10.1287/moor.2022.0312","title":"Cash-Subadditive Risk Measures Without Quasi-Convexity","year":2025,"lang":"en","type":"article","venue":"Mathematics of 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":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subadditivity; Convexity; Cash; Actuarial science; Econometrics; Mathematics; Business; Statistics; Combinatorics; Finance","score_opus":0.2647810528765891,"score_gpt":0.5222964876332598,"score_spread":0.25751543475667066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208746577","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.21842565,0.001982001,0.74890524,0.0013724291,0.0001771297,0.00008832526,0.0004928098,0.00026848217,0.028287977],"genre_scores_gemma":[0.93999904,0.0013622679,0.045517955,0.00037946552,0.00023844617,0.00013803944,0.0003944863,0.00011965439,0.011850622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779093,0.00053221517,0.0001498567,0.00057557406,0.0006340696,0.0003172987],"domain_scores_gemma":[0.995231,0.0017398706,0.0010073094,0.00073693175,0.00080297305,0.00048195917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026382315,0.0013295878,0.0010862015,0.0019483356,0.000901881,0.0035993117,0.0010069534,0.0010011009,0.00398293],"category_scores_gemma":[0.007620503,0.00053853996,0.0023020073,0.0014633803,0.0032448974,0.0061294995,0.0021822606,0.0028914323,0.00061391375],"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.000028370096,0.000022452676,0.00073555205,0.000046406705,0.000027253425,0.00013028346,0.000109257046,0.010653646,0.0013216593,0.9783332,0.00061769655,0.007974336],"study_design_scores_gemma":[0.000014470276,0.00010003896,0.0015917062,0.00004958242,0.00003551656,0.00035996942,0.00010560367,0.12904865,0.0013211485,0.86281437,0.004513158,0.000045770124],"about_ca_topic_score_codex":0.0011670747,"about_ca_topic_score_gemma":0.0004699469,"teacher_disagreement_score":0.00398293,"about_ca_system_score_codex":0.002321302,"about_ca_system_score_gemma":0.001032869,"threshold_uncertainty_score":0.016842306},"labels":[],"label_agreement":null},{"id":"W3209016250","doi":"10.1287/moor.2021.1164","title":"Directional Necessary Optimality Conditions for Bilevel Programs","year":2021,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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 Victoria","funders":"","keywords":"Calmness; Mathematics; Directional derivative; Mathematical optimization; Constraint (computer-aided design); Normality; Bilevel optimization; Parametric statistics; Optimization problem; Function (biology); Metric (unit); Applied mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.18259648702591766,"score_gpt":0.43563346992666857,"score_spread":0.25303698290075094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209016250","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.0753328,0.0002918063,0.8913726,0.0013422226,0.00009614872,0.00016699803,0.00067664334,0.00026911212,0.030451573],"genre_scores_gemma":[0.82574815,0.00084691605,0.16076036,0.00067252765,0.00013752462,0.00079254835,0.0012346659,0.00031410187,0.0094931545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977489,0.0005309614,0.00021278526,0.00048739466,0.00071095896,0.00030901344],"domain_scores_gemma":[0.99435,0.0029619802,0.00059323094,0.0004234109,0.0013002488,0.000371115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033981719,0.0008784587,0.0010344534,0.0012737621,0.00084688474,0.002101381,0.00093432225,0.0014717277,0.00904869],"category_scores_gemma":[0.01662369,0.00066780404,0.0016659533,0.0006838363,0.0028521924,0.003809328,0.0025444357,0.0034932755,0.0009138606],"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.000059344817,0.00004785976,0.0009773987,0.00011930718,0.000020123909,0.00018912122,0.00015451647,0.044425398,0.005280196,0.9387411,0.001727677,0.008258021],"study_design_scores_gemma":[0.000049676033,0.00012262898,0.0008598656,0.00007254662,0.00001628245,0.00016212222,0.00014843712,0.31882492,0.0041907323,0.66919136,0.0063197017,0.000041815616],"about_ca_topic_score_codex":0.001874032,"about_ca_topic_score_gemma":0.0017646278,"teacher_disagreement_score":0.00904869,"about_ca_system_score_codex":0.0015498365,"about_ca_system_score_gemma":0.0021802003,"threshold_uncertainty_score":0.030270934},"labels":[],"label_agreement":null},{"id":"W3213237799","doi":"10.1287/moor.2021.1207","title":"Penalty and Augmented Lagrangian Methods for Constrained DC Programming","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Huawei Technologies (Canada)","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Penalty method; Sequence (biology); Stationary point; Mathematical optimization; Infimum and supremum; Pointwise; Regular polygon; Function (biology); Convergence (economics); Constraint (computer-aided design); Limit point; Point (geometry); Applied mathematics; Combinatorics; Mathematical analysis","score_opus":0.22256743211485086,"score_gpt":0.5456395272196878,"score_spread":0.3230720951048369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213237799","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.004093345,0.00043488303,0.9915665,0.00020580363,0.00007133857,0.0000343712,0.000047497168,0.000060729177,0.0034855052],"genre_scores_gemma":[0.39111796,0.0017477286,0.58619297,0.0004459061,0.00030585364,0.0005024384,0.000571684,0.00036704255,0.018748483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945766,0.00021603295,0.000024984172,0.00008407467,0.00016569856,0.00005153276],"domain_scores_gemma":[0.99898106,0.0005683681,0.00010849782,0.00006787943,0.00019962675,0.00007453718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429759,0.0013618856,0.0009101198,0.00084177766,0.00041660687,0.0011368792,0.0010714398,0.0012190907,0.0038396392],"category_scores_gemma":[0.002756099,0.00046330082,0.00090282067,0.0007799467,0.001024645,0.0012916839,0.0016029364,0.002231324,0.0005952632],"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.00005841135,0.00005800767,0.00041974738,0.00024610234,0.00004294163,0.00010331167,0.0000638424,0.84211093,0.0017387604,0.11943685,0.0019249534,0.033796106],"study_design_scores_gemma":[0.0000042911042,0.000014948088,0.000023381617,0.000010359077,0.000002384952,0.000008903815,0.000005110525,0.98964137,0.00019432971,0.008864093,0.0012269678,0.0000037825475],"about_ca_topic_score_codex":0.0029047942,"about_ca_topic_score_gemma":0.0025931725,"teacher_disagreement_score":0.0038396392,"about_ca_system_score_codex":0.000779323,"about_ca_system_score_gemma":0.0011867638,"threshold_uncertainty_score":0.012844861},"labels":[],"label_agreement":null},{"id":"W3213766502","doi":"10.1287/moor.2022.0097","title":"Improved Approximations for a CVRP with Unsplittable Demands","year":2025,"lang":"en","type":"article","venue":"Mathematics of 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":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Rounding; Approximation algorithm; Vehicle routing problem; Travelling salesman problem; Bounded function; Alpha (finance); Running time; Algorithm; Routing (electronic design automation); Computer science; Mathematical analysis; Statistics","score_opus":0.06807445142131156,"score_gpt":0.34632680949978645,"score_spread":0.27825235807847487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213766502","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.021999551,0.0011922335,0.96857417,0.000728878,0.00014847962,0.00009523162,0.00022328919,0.0009358168,0.006102344],"genre_scores_gemma":[0.3657491,0.001235532,0.6237976,0.0005020029,0.00021559877,0.00031784555,0.0010850276,0.00065285224,0.006444505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965828,0.000988754,0.0001487367,0.0005997477,0.0010138856,0.00066608645],"domain_scores_gemma":[0.9921692,0.004983141,0.00061002676,0.0012085439,0.00073254964,0.00029649067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029615064,0.001994107,0.0017060416,0.0011691583,0.000983819,0.0029298784,0.004456187,0.002141008,0.006009711],"category_scores_gemma":[0.015671775,0.00089207484,0.001746762,0.001973905,0.0012846151,0.0052251695,0.0024394963,0.0043616635,0.0014566607],"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.0002552029,0.00015193601,0.00055892195,0.00018380175,0.000058441463,0.00011333409,0.00016780487,0.9077345,0.001427432,0.043067746,0.005285926,0.040994853],"study_design_scores_gemma":[0.000016970609,0.00003397731,0.00007203823,0.000017608127,0.0000112556245,0.000045982215,0.000033978187,0.9803154,0.00033316622,0.017456587,0.0016549077,0.000008071651],"about_ca_topic_score_codex":0.0066774655,"about_ca_topic_score_gemma":0.00751056,"teacher_disagreement_score":0.0066774655,"about_ca_system_score_codex":0.0036246427,"about_ca_system_score_gemma":0.0024773262,"threshold_uncertainty_score":0.026298761},"labels":[],"label_agreement":null},{"id":"W4206777370","doi":"10.1287/moor.2021.1197","title":"Impact of Network Structure on New Service Pricing","year":2021,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Digital Platforms and Economics","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":"Profitability index; Network effect; Monetization; Revenue; Service (business); Microeconomics; Consumption (sociology); Business; Pricing strategies; Computer science; Industrial organization; Economics; Marketing","score_opus":0.0869430182846246,"score_gpt":0.34383328872926966,"score_spread":0.2568902704446451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206777370","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.9099299,0.00064809056,0.060899317,0.002713787,0.00007456023,0.00007696329,0.00020611612,0.000083028564,0.025368238],"genre_scores_gemma":[0.99702483,0.00017920276,0.0013615707,0.00005425187,0.00002224338,0.00001181737,0.000026674981,0.0000080230875,0.0013114681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919015,0.00034404217,0.000016096039,0.00011731137,0.00010833203,0.00022409465],"domain_scores_gemma":[0.98896515,0.007695367,0.0017918083,0.00034970467,0.00048034234,0.0007177182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015701244,0.0004992214,0.00068038964,0.000736076,0.0007871058,0.0021807388,0.0011604406,0.0015043383,0.0062565086],"category_scores_gemma":[0.013701419,0.0003882937,0.0005785856,0.00071743707,0.0015155431,0.004434611,0.0012026122,0.0022160956,0.00022817096],"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.00033899202,0.00030410677,0.008080175,0.000082565086,0.000057751913,0.00038161365,0.0001625334,0.83868754,0.0024887149,0.13514769,0.0016891768,0.012579129],"study_design_scores_gemma":[0.000038907438,0.00011302337,0.0025021657,0.000015225348,0.000036168152,0.000070614384,0.00016767374,0.94996965,0.0005236001,0.045896783,0.0006422916,0.000023926856],"about_ca_topic_score_codex":0.007953183,"about_ca_topic_score_gemma":0.006710681,"teacher_disagreement_score":0.007953183,"about_ca_system_score_codex":0.0032544474,"about_ca_system_score_gemma":0.0009750062,"threshold_uncertainty_score":0.023612738},"labels":[],"label_agreement":null},{"id":"W4210368301","doi":"10.1287/moor.2021.1217","title":"Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Risk measure; Coherent risk measure; Expected shortfall; Tail risk; Dynamic risk measure; Mathematics; Convexity; Measure (data warehouse); Quantile; Convolution (computer science); Econometrics; Value at risk; Risk management; Spectral risk measure; Pareto principle; Downside risk; Mathematical optimization; Computer science; Economics","score_opus":0.25711660572046824,"score_gpt":0.4669938152252159,"score_spread":0.20987720950474764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210368301","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.028849775,0.0007488368,0.96321297,0.0005186239,0.00004754191,0.000034277004,0.00007217832,0.00008263905,0.00643308],"genre_scores_gemma":[0.8651501,0.0019858798,0.12340593,0.00042532926,0.00025786544,0.00025636872,0.00017765356,0.00015958026,0.008181352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967853,0.0015208343,0.00013817784,0.00046725062,0.00066699926,0.00042148517],"domain_scores_gemma":[0.9904117,0.0066917366,0.0010443492,0.00082526106,0.00061659806,0.00041041904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065945056,0.0017791697,0.0022561357,0.0012904647,0.0007557455,0.0029687635,0.0016049937,0.0016980675,0.0047074426],"category_scores_gemma":[0.028881617,0.00080515584,0.0019875898,0.0015313457,0.0029874893,0.0069480087,0.0037070045,0.0029827482,0.00033076678],"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.00007886126,0.000096425654,0.0010098709,0.0001435225,0.00008155764,0.00015982638,0.00016794,0.33125234,0.0009692463,0.64122695,0.0013686531,0.023444775],"study_design_scores_gemma":[0.000008654368,0.00005411529,0.0003441976,0.000040894556,0.000026320746,0.0000942069,0.00003577874,0.5440379,0.00044213445,0.4540169,0.00087589264,0.000022993714],"about_ca_topic_score_codex":0.0011691827,"about_ca_topic_score_gemma":0.0007431046,"teacher_disagreement_score":0.0065945056,"about_ca_system_score_codex":0.002676658,"about_ca_system_score_gemma":0.0016944379,"threshold_uncertainty_score":0.034875512},"labels":[],"label_agreement":null},{"id":"W4210412728","doi":"10.1287/moor.2021.1226","title":"A Unified Framework for Bayesian and Non-Bayesian Decision Making and Inference","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","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":"Université de Montréal","funders":"","keywords":"Mathematics; Bayes' theorem; Inference; Bayesian inference; Bayesian statistics; Bayesian probability; Hilbert space; Algebra over a field; Artificial intelligence; Computer science; Pure mathematics","score_opus":0.097274659421694,"score_gpt":0.4192956162300998,"score_spread":0.3220209568084058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210412728","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.0006536282,0.0012336894,0.98680764,0.0021024114,0.0001441611,0.000036722136,0.00008526833,0.00005567816,0.008880751],"genre_scores_gemma":[0.1174526,0.0032352905,0.8683731,0.0015426357,0.0012895032,0.0006199096,0.00025790383,0.00011134137,0.0071178125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98746103,0.007496755,0.0006284688,0.0010511962,0.0029312505,0.00043130494],"domain_scores_gemma":[0.99300706,0.00459622,0.0005077101,0.00080802717,0.0007525912,0.0003282986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01332681,0.001682044,0.0018788876,0.0030035633,0.0017769227,0.006318552,0.0036065453,0.0035142961,0.0053167823],"category_scores_gemma":[0.01422357,0.0009250732,0.0026988112,0.0033434234,0.0069637885,0.0077407993,0.0041295043,0.0070103053,0.0012537303],"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.0000029245175,0.000007414545,0.000023748456,0.000021016864,0.000010761896,0.000017260916,0.00005076189,0.0018638851,0.000047689653,0.9943779,0.00038842252,0.0031880394],"study_design_scores_gemma":[0.0000071587265,0.0000093674835,0.00003383942,0.000023854185,0.0000060655343,0.000026999083,0.00001623492,0.011239796,0.000035998793,0.98295236,0.0056409924,0.0000073230485],"about_ca_topic_score_codex":0.0031530363,"about_ca_topic_score_gemma":0.003248851,"teacher_disagreement_score":0.01332681,"about_ca_system_score_codex":0.0033621087,"about_ca_system_score_gemma":0.004397534,"threshold_uncertainty_score":0.07047975},"labels":[],"label_agreement":null},{"id":"W4211227957","doi":"10.1287/moor.2021.1227","title":"The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Control Systems and Identification","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Property (philosophy); Mathematics; Modulus; Iterated function; Function (biology); Upper and lower bounds; Minification; Concave function; Applied mathematics; Mathematical analysis; Combinatorics; Mathematical optimization; Geometry","score_opus":0.059608800155880694,"score_gpt":0.3103009171479909,"score_spread":0.2506921169921102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211227957","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.04720797,0.00030446242,0.9405625,0.0003307215,0.000053049207,0.000032522486,0.0000832979,0.00017957341,0.011245866],"genre_scores_gemma":[0.80168474,0.0007203618,0.18627433,0.00029876406,0.00014410146,0.0001378721,0.0002143102,0.00025086102,0.010274645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996681,0.00008168161,0.000020046204,0.000063046755,0.0001198865,0.00004723385],"domain_scores_gemma":[0.9989017,0.0004502649,0.00017080514,0.00017510564,0.00020429309,0.000097739554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075761665,0.00064650114,0.0004952019,0.0004343033,0.0002881146,0.0008805559,0.00056467525,0.0004377703,0.0042277295],"category_scores_gemma":[0.0045603933,0.0002433203,0.00038390595,0.00033858686,0.0012996689,0.0020499453,0.0014334313,0.0012860781,0.0007739688],"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.00017171193,0.000036908004,0.001298636,0.00026426904,0.000029588391,0.00028632715,0.0002001002,0.13719991,0.037067343,0.7433728,0.0036492562,0.07642319],"study_design_scores_gemma":[0.000029830842,0.00023286708,0.0009184434,0.000040477888,0.000016172087,0.0004792797,0.000073367875,0.70732784,0.02066171,0.2619377,0.008234228,0.000048086054],"about_ca_topic_score_codex":0.0002144665,"about_ca_topic_score_gemma":0.0002538382,"teacher_disagreement_score":0.0042277295,"about_ca_system_score_codex":0.00030861745,"about_ca_system_score_gemma":0.00050349993,"threshold_uncertainty_score":0.014143169},"labels":[],"label_agreement":null},{"id":"W4226364838","doi":"10.1287/moor.2023.0035","title":"Optimal Partition for a Multi-Type Queueing System","year":2025,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","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":"Queue; Partition (number theory); Computer science; Probabilistic logic; Queueing theory; Mathematical optimization; Decision maker; Operations research; Computer network; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.17986786123719561,"score_gpt":0.4269801071810111,"score_spread":0.24711224594381548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226364838","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.19228815,0.00063373696,0.7988662,0.0008744949,0.00013550553,0.00021711331,0.00033604616,0.00029801793,0.0063506775],"genre_scores_gemma":[0.9286726,0.00035889575,0.06494733,0.00017781816,0.00009566332,0.00018513612,0.0003172976,0.0001304419,0.0051147696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825996,0.00053851126,0.00005818046,0.0003359586,0.00023287126,0.0005744605],"domain_scores_gemma":[0.9974547,0.0012549104,0.0003720471,0.00012623805,0.00033482135,0.00045725517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208318,0.0015726808,0.0020925177,0.0010795523,0.0012968421,0.0023132798,0.0024407592,0.0018266009,0.003887555],"category_scores_gemma":[0.00522232,0.0008938969,0.0012399837,0.0012034201,0.0016079174,0.0027238077,0.0016282356,0.0015550257,0.00047217228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023947567,0.00010587714,0.001082981,0.000115471055,0.000063295,0.00021842992,0.00016002881,0.94729716,0.0023986234,0.04029058,0.001623334,0.0064048315],"study_design_scores_gemma":[0.000024911653,0.00004848447,0.00020394668,0.0000070594187,0.000013367071,0.0000362627,0.00005902735,0.98615324,0.00027509168,0.01287301,0.00029400355,0.0000115427565],"about_ca_topic_score_codex":0.0069275936,"about_ca_topic_score_gemma":0.004305306,"teacher_disagreement_score":0.0069275936,"about_ca_system_score_codex":0.0032591561,"about_ca_system_score_gemma":0.0020337105,"threshold_uncertainty_score":0.023646891},"labels":[],"label_agreement":null},{"id":"W4233783080","doi":"10.1287/moor.2015.0755","title":"Joint Mixability","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Mathematics; Marginal distribution; Joint probability distribution; Random variable; Probabilistic logic; Monotone polygon; Applied mathematics; Generator (circuit theory); Combinatorics; Mathematical optimization; Statistics; Power (physics)","score_opus":0.5300525204133071,"score_gpt":0.5403228146903195,"score_spread":0.010270294277012426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233783080","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.04408644,0.00045832893,0.94014,0.0007115849,0.00003551163,0.000083009,0.000355137,0.00014799053,0.013981977],"genre_scores_gemma":[0.9010696,0.0009066197,0.08679511,0.00032715106,0.00020325558,0.00048560285,0.000741733,0.00019742391,0.009273502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995,0.0015317018,0.00026868327,0.0012408714,0.0014192308,0.00053963356],"domain_scores_gemma":[0.99140304,0.005244441,0.001052798,0.0010125432,0.00075808435,0.00052913884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041105463,0.0014071045,0.0017604019,0.0016550244,0.0012563715,0.0037061383,0.0017106174,0.0016063338,0.00905838],"category_scores_gemma":[0.018013392,0.0009073845,0.0020314327,0.0021691024,0.0031774351,0.0096600335,0.0053242953,0.003720487,0.0007700756],"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.000060264723,0.000045452125,0.0013488556,0.00011360057,0.000089984824,0.00018227081,0.0001873741,0.04312648,0.0014545755,0.93811214,0.0010828797,0.014196186],"study_design_scores_gemma":[0.000012980685,0.000055059085,0.0006115591,0.00003163448,0.000029899555,0.0001811803,0.00009516896,0.13964899,0.0012809052,0.8549445,0.003081039,0.000027097556],"about_ca_topic_score_codex":0.0007017125,"about_ca_topic_score_gemma":0.00048805343,"teacher_disagreement_score":0.00905838,"about_ca_system_score_codex":0.0016961964,"about_ca_system_score_gemma":0.00092998944,"threshold_uncertainty_score":0.0303033},"labels":[],"label_agreement":null},{"id":"W4298218231","doi":"10.1287/moor.2014.0682","title":"<i>K</i>-Optimal Design via Semidefinite Programming and Entropy Optimization","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","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 Victoria","funders":"","keywords":"Semidefinite programming; Mathematics; Mathematical optimization; Semidefinite embedding; Convex optimization; Minification; Entropy maximization; Dual (grammatical number); Entropy (arrow of time); Linear programming; Positive-definite matrix; Regular polygon; Quadratically constrained quadratic program; Principle of maximum entropy; Quadratic programming","score_opus":0.29742725395388764,"score_gpt":0.5002663857463289,"score_spread":0.20283913179244123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298218231","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.0037539671,0.00009193089,0.99494815,0.0001465749,0.000009513242,0.000052125353,0.00002597797,0.000051830808,0.0009199505],"genre_scores_gemma":[0.37916988,0.00038647823,0.6173415,0.00031410978,0.00006453771,0.0009486664,0.00016774039,0.00007568161,0.0015314264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950623,0.0032632074,0.00016646665,0.0007310084,0.00060981687,0.00016722517],"domain_scores_gemma":[0.9926272,0.0055515976,0.000884723,0.00033936562,0.00044709447,0.0001500972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007945864,0.0014262035,0.0017188207,0.00095667766,0.00038617826,0.0015479082,0.001281161,0.0011773832,0.0019428346],"category_scores_gemma":[0.012468569,0.0007417985,0.00086635904,0.00058884587,0.0028365026,0.0015784499,0.0014007511,0.0015837121,0.00036307485],"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.0003670607,0.00023482075,0.00046406046,0.00050563517,0.00013823976,0.000090112146,0.000082895334,0.7490479,0.0075677224,0.1932882,0.0008047624,0.04740864],"study_design_scores_gemma":[0.000043938322,0.0001759423,0.000120226425,0.000023581733,0.000016972203,0.000020315314,0.000008463065,0.9291957,0.0017734336,0.06813042,0.00047251536,0.000018412982],"about_ca_topic_score_codex":0.0006065467,"about_ca_topic_score_gemma":0.0005371246,"teacher_disagreement_score":0.007945864,"about_ca_system_score_codex":0.001274092,"about_ca_system_score_gemma":0.0023392998,"threshold_uncertainty_score":0.04202223},"labels":[],"label_agreement":null},{"id":"W4313299845","doi":"10.1287/moor.2022.1344","title":"Error Analysis of Surrogate Models Constructed Through Operations on Submodels","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Multi-Objective Optimization 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":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Black box; Chen; Mathematics; Function (biology); Mathematical optimization; Surrogate model; Computer science; Algorithm; Artificial intelligence","score_opus":0.1705759330340063,"score_gpt":0.416556545346156,"score_spread":0.24598061231214968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313299845","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.029982677,0.0001855386,0.96770144,0.00018706676,0.000027922577,0.000039851493,0.00008503331,0.00012488518,0.0016656439],"genre_scores_gemma":[0.84182185,0.0003288653,0.1550245,0.000081318714,0.000027759326,0.0002564437,0.00048716788,0.00015740174,0.0018146399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996092,0.0021820376,0.00019319709,0.00041048272,0.00087291235,0.00024937408],"domain_scores_gemma":[0.97931355,0.015417189,0.0016346362,0.001573406,0.0017362983,0.00032489237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01275329,0.0016156128,0.0017546444,0.0019153948,0.0006557501,0.0021957324,0.0014156023,0.0015893483,0.0016134275],"category_scores_gemma":[0.028638832,0.0007795168,0.0019103731,0.0010058375,0.0020800834,0.0022240004,0.0028384917,0.0022663095,0.0001898307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004507721,0.000012924742,0.00046227564,0.000029573126,0.000024680328,0.000014807413,0.000024451138,0.97950464,0.00024187082,0.015791358,0.0000876237,0.0037606389],"study_design_scores_gemma":[0.000002527012,0.000015601368,0.000052079606,0.000009023311,0.0000031217348,0.000002856105,0.0000046264554,0.9937943,0.00018992678,0.0058272574,0.000095852105,0.0000027397095],"about_ca_topic_score_codex":0.0062047928,"about_ca_topic_score_gemma":0.0029467705,"teacher_disagreement_score":0.01275329,"about_ca_system_score_codex":0.001934077,"about_ca_system_score_gemma":0.0022252526,"threshold_uncertainty_score":0.06744665},"labels":[],"label_agreement":null},{"id":"W4313331485","doi":"10.1287/moor.2022.1339","title":"Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"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 British Columbia","funders":"","keywords":"Unimodular matrix; Mathematics; Bounded function; Polynomial; Integer (computer science); Upper and lower bounds; Combinatorics; Matrix (chemical analysis); Relaxation (psychology); Matrix polynomial; Constraint (computer-aided design); Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.08539722762037652,"score_gpt":0.38763204911546406,"score_spread":0.3022348214950875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313331485","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.38451704,0.0018184353,0.54796803,0.0052314103,0.00029022712,0.00024665415,0.0010964031,0.0014608005,0.05737099],"genre_scores_gemma":[0.8643413,0.0009860017,0.121729694,0.0007121464,0.00038626156,0.0002636113,0.00090508995,0.00055217714,0.010123731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709857,0.00062417856,0.0001201774,0.0006563914,0.0007585398,0.0007421259],"domain_scores_gemma":[0.96842426,0.025020793,0.0019457162,0.0020330735,0.0011390237,0.0014371747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029766962,0.0019572694,0.0012927417,0.0012279745,0.0012941234,0.0037963665,0.0027675866,0.0012716418,0.010804883],"category_scores_gemma":[0.02299248,0.00081574597,0.0012883235,0.0016230907,0.0029424503,0.008357493,0.0034892939,0.0060053715,0.0015970492],"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.001210315,0.0006041049,0.0064220284,0.00085336785,0.00017412347,0.0005003852,0.00069208146,0.27642015,0.022234617,0.58151174,0.011453206,0.09792399],"study_design_scores_gemma":[0.00006760503,0.00018343546,0.0008670933,0.0000619733,0.000068953945,0.0001481763,0.000102598904,0.59467316,0.00627509,0.39397156,0.003537818,0.000042606418],"about_ca_topic_score_codex":0.0012572356,"about_ca_topic_score_gemma":0.0023849178,"teacher_disagreement_score":0.010804883,"about_ca_system_score_codex":0.003096854,"about_ca_system_score_gemma":0.0017318923,"threshold_uncertainty_score":0.036145985},"labels":[],"label_agreement":null},{"id":"W4366524444","doi":"10.1287/moor.2023.1366","title":"Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"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 Victoria","funders":"","keywords":"Minimax; Mathematics; Sensitivity (control systems); Function (biology); Mathematical economics; Duality (order theory); Maximization; Value (mathematics); Mathematical optimization; Bellman equation; Applied mathematics; Combinatorics; Statistics","score_opus":0.0643395731625063,"score_gpt":0.34800617114357185,"score_spread":0.2836665979810655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366524444","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.012557384,0.0016801329,0.9788482,0.00075395475,0.000057030287,0.0000834288,0.00007497512,0.0000865842,0.005858175],"genre_scores_gemma":[0.8272792,0.0046469877,0.15718308,0.0007597033,0.00030426975,0.0006720951,0.00029246326,0.00035216758,0.008510037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953648,0.0026938983,0.00017066098,0.00066422025,0.0007648852,0.00034160897],"domain_scores_gemma":[0.9719303,0.024424016,0.0011186538,0.00068443717,0.0013155891,0.00052697083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012269778,0.0026626291,0.0024795518,0.0034584142,0.0010170557,0.0029009462,0.001644769,0.002058818,0.0030346094],"category_scores_gemma":[0.034355793,0.0012110283,0.0029812155,0.0016733451,0.0039148293,0.0045911907,0.003945821,0.004693505,0.00021729444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009466988,0.00008315146,0.0010502366,0.00044868616,0.00019744187,0.00034718003,0.00030258976,0.639031,0.0041098846,0.33781758,0.0012156463,0.015301902],"study_design_scores_gemma":[0.000005619534,0.000046668796,0.0002774818,0.00007995599,0.000030368632,0.00006604323,0.000045728797,0.8803369,0.0011802275,0.11679614,0.0011055216,0.000029388542],"about_ca_topic_score_codex":0.0019349644,"about_ca_topic_score_gemma":0.0008639988,"teacher_disagreement_score":0.012269778,"about_ca_system_score_codex":0.0031532957,"about_ca_system_score_gemma":0.0016314829,"threshold_uncertainty_score":0.06488955},"labels":[],"label_agreement":null},{"id":"W4385698187","doi":"10.1287/moor.2022.0317","title":"(No-)Betting Pareto Optima Under Rank-Dependent Utility","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Decision-Making and Behavioral Economics","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":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generality; Pareto principle; Ambiguity; Expected utility hypothesis; Economics; Mathematical economics; Aggregate (composite); Weighting; Rank (graph theory); Matching (statistics); Preference; Probabilistic logic; Econometrics; Mathematics; Mathematical optimization; Microeconomics; Computer science; Statistics","score_opus":0.5542620435669947,"score_gpt":0.5590239752768249,"score_spread":0.004761931709830192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385698187","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.5474824,0.0006263093,0.4263257,0.0015005486,0.000024954894,0.0000973778,0.00040846303,0.00016207247,0.023372201],"genre_scores_gemma":[0.9731174,0.00033792402,0.021901127,0.00010706812,0.000028904766,0.00009850745,0.0001019645,0.000029043034,0.0042779627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983966,0.00082165765,0.00007784497,0.00023075064,0.00017019662,0.00030291534],"domain_scores_gemma":[0.99316794,0.004548409,0.0011650024,0.0003820189,0.00031946582,0.00041724733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582489,0.000908124,0.001384827,0.00078190456,0.00054809666,0.00279126,0.0009517446,0.0013488162,0.0033136508],"category_scores_gemma":[0.014259845,0.0006568513,0.0010006011,0.00068555964,0.0020882275,0.003435992,0.0014457372,0.0012872411,0.0004250195],"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.0002225514,0.00010200306,0.001987799,0.00014318453,0.00009941,0.00028285384,0.0002509408,0.23830794,0.0012522355,0.74589056,0.0012468017,0.01021376],"study_design_scores_gemma":[0.000050856965,0.000059311413,0.0009029084,0.00003773689,0.000022247976,0.000091507434,0.000098865785,0.40422642,0.0004741982,0.5935341,0.0004737613,0.000028139368],"about_ca_topic_score_codex":0.000996761,"about_ca_topic_score_gemma":0.00073125353,"teacher_disagreement_score":0.004582489,"about_ca_system_score_codex":0.0015266081,"about_ca_system_score_gemma":0.0008036378,"threshold_uncertainty_score":0.024234831},"labels":[],"label_agreement":null},{"id":"W4387578519","doi":"10.1287/moor.2022.0134","title":"Robustness of Stochastic Optimal Control to Approximate Diffusion Models Under Several Cost Evaluation Criteria","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Robustness (evolution); Mathematics; Optimal control; Mathematical optimization; Bellman equation; Applied mathematics; Partial differential equation; Stochastic differential equation; Ergodic theory; Stochastic control; Mathematical analysis","score_opus":0.20341783776608585,"score_gpt":0.38875182291361765,"score_spread":0.1853339851475318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387578519","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.10720187,0.001473441,0.88318837,0.0015616667,0.000064044565,0.00010219966,0.00017627726,0.00019604161,0.006036181],"genre_scores_gemma":[0.9813262,0.00043301398,0.015998203,0.000120791985,0.00004467625,0.000094107534,0.00013590518,0.000051194955,0.0017958871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948226,0.0026654217,0.00029305005,0.0008649463,0.0009139932,0.0004399974],"domain_scores_gemma":[0.9791656,0.014627132,0.003140963,0.0011227595,0.0014430789,0.00050042535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011378427,0.00192031,0.0016972286,0.0014710594,0.0006006626,0.0025655937,0.0015559063,0.0024789071,0.0013098564],"category_scores_gemma":[0.03686702,0.0005420527,0.001771645,0.00070522854,0.0029462117,0.0026275595,0.0033628487,0.0024464454,0.0000959483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018548487,0.000046112174,0.0011262888,0.00013349236,0.00011509309,0.00009781471,0.00010393808,0.8779452,0.0018669572,0.11293139,0.00028611868,0.005162167],"study_design_scores_gemma":[0.0000074694963,0.000051220293,0.0002641801,0.000016893655,0.000010841676,0.000018502013,0.000012609879,0.98198605,0.00044452713,0.0170733,0.000101420046,0.0000129336095],"about_ca_topic_score_codex":0.0056907563,"about_ca_topic_score_gemma":0.0013983586,"teacher_disagreement_score":0.011378427,"about_ca_system_score_codex":0.0035558362,"about_ca_system_score_gemma":0.0017769439,"threshold_uncertainty_score":0.060175598},"labels":[],"label_agreement":null},{"id":"W4387907909","doi":"10.1287/moor.2022.0188","title":"On Strategic Measures and Optimality Properties in Discrete-Time Stochastic Control with Universally Measurable Policies","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"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 Alberta","funders":"","keywords":"Markov decision process; Mathematics; Minimax; Optimal control; Stochastic control; Mathematical economics; Time horizon; Variety (cybernetics); Mathematical optimization; Discrete time and continuous time; Axiom; Determinacy; Control (management); Markov process; Economics","score_opus":0.16856298353397484,"score_gpt":0.30120525399167813,"score_spread":0.1326422704577033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387907909","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.090738095,0.0019254008,0.8842388,0.0036186893,0.00011419502,0.0000858442,0.00017187097,0.000108532244,0.018998552],"genre_scores_gemma":[0.9315699,0.0018548352,0.06224515,0.00048517407,0.00026114038,0.00024319057,0.00021872282,0.000101045545,0.0030208402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494535,0.0022473787,0.0003473301,0.0007607604,0.0012212262,0.00047808496],"domain_scores_gemma":[0.9661605,0.027020454,0.0028784901,0.0010471524,0.0019369866,0.0009565015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009442139,0.0012922481,0.001661617,0.0017507417,0.00089601637,0.0031631766,0.0014013002,0.0019981593,0.0022927336],"category_scores_gemma":[0.031242596,0.00080868445,0.0017034343,0.0016060232,0.007864736,0.0063714115,0.0028590492,0.003462828,0.00023120403],"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.000026720209,0.000029997393,0.0004536831,0.00008775326,0.000036348043,0.000059400445,0.00012450255,0.053717382,0.00056190457,0.9407328,0.00030643534,0.0038631773],"study_design_scores_gemma":[0.000022179413,0.00007059561,0.00046960602,0.000048684196,0.000016068865,0.000027940032,0.000047110625,0.16357335,0.00036447137,0.8348127,0.0005261701,0.000021132804],"about_ca_topic_score_codex":0.0030708,"about_ca_topic_score_gemma":0.0014414595,"teacher_disagreement_score":0.009442139,"about_ca_system_score_codex":0.0035503153,"about_ca_system_score_gemma":0.0030548905,"threshold_uncertainty_score":0.0499354},"labels":[],"label_agreement":null},{"id":"W4388941598","doi":"10.1287/moor.2022.0156","title":"Extreme-Case Distortion Risk Measures: A Unification and Generalization of Closed-Form Solutions","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","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":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Generalization; Mathematics; Extreme point; Extreme value theory; Distortion (music); Regular polygon; Risk measure; Risk management; Econometrics; Operations research; Computer science; Mathematical economics; Statistics; Combinatorics; Economics","score_opus":0.4734195131576592,"score_gpt":0.47380776710063716,"score_spread":0.00038825394297797855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388941598","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.0039999085,0.0007806743,0.98822635,0.00067907746,0.0000658217,0.00004460733,0.000076547214,0.000047486745,0.006079449],"genre_scores_gemma":[0.4915312,0.006059316,0.48459822,0.0011854997,0.0009452863,0.0007786721,0.000649674,0.0003838476,0.013868227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942263,0.0025012142,0.00035212963,0.0010836968,0.0013816818,0.00045499307],"domain_scores_gemma":[0.9802955,0.013676475,0.0019719203,0.001215154,0.0023303481,0.0005106691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011083633,0.002323115,0.0017972712,0.0029662834,0.0007332667,0.005182758,0.0023453527,0.0026518751,0.0053292396],"category_scores_gemma":[0.049415063,0.0008663983,0.0023245069,0.0021970314,0.0037703237,0.006665328,0.0037734697,0.0058586136,0.00092417555],"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.000029929619,0.000055925862,0.0009429717,0.0001791617,0.00006295828,0.00022943864,0.00028549114,0.089403376,0.0008410641,0.87884206,0.003138936,0.025988618],"study_design_scores_gemma":[0.0000107850965,0.00004084434,0.00038508148,0.0001309784,0.000018882116,0.00028366657,0.0001098523,0.29002103,0.00036911,0.70450187,0.004085053,0.00004281054],"about_ca_topic_score_codex":0.0013500969,"about_ca_topic_score_gemma":0.00072081876,"teacher_disagreement_score":0.011083633,"about_ca_system_score_codex":0.0022169992,"about_ca_system_score_gemma":0.0019284787,"threshold_uncertainty_score":0.05861658},"labels":[],"label_agreement":null},{"id":"W4389224571","doi":"10.1287/moor.2022.0335","title":"Proximity and Flatness Bounds for Linear Integer Optimization","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","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":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Polyhedron; Combinatorics; Unimodular matrix; Cutting-plane method; Integer programming; Integer (computer science); Linear programming; Linear programming relaxation; Integer points in convex polyhedra; Hyperplane; Vertex (graph theory); Polytope; Regular polygon; Discrete mathematics; Branch and price; Mathematical optimization; Computer science; Geometry","score_opus":0.13205313635593666,"score_gpt":0.4352795687934838,"score_spread":0.3032264324375471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389224571","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.014524601,0.004410611,0.94238436,0.0017000122,0.00026382954,0.00011533589,0.00020230113,0.00033024923,0.036068633],"genre_scores_gemma":[0.5450854,0.0069681113,0.42921728,0.0019180471,0.0016084916,0.00065673725,0.00061410054,0.0005535046,0.013378403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354446,0.002059342,0.00028469224,0.0012552463,0.0021997225,0.0006564231],"domain_scores_gemma":[0.97188705,0.022161318,0.001918435,0.0020463842,0.0011642695,0.00082250417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006735384,0.0025993427,0.0019024343,0.0032207354,0.0017972917,0.0039682365,0.0029088918,0.0014286722,0.011267024],"category_scores_gemma":[0.03834982,0.0011450246,0.0020830452,0.003684177,0.0053272936,0.01429341,0.0063449945,0.0108911395,0.0019451124],"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.00026843257,0.00013645651,0.0011571349,0.0006130295,0.00007307217,0.0002327248,0.00060396956,0.10850575,0.003414051,0.8036208,0.0048440895,0.07653056],"study_design_scores_gemma":[0.000027222206,0.00019593298,0.0006566473,0.00017170835,0.00003961257,0.00016245196,0.0001489528,0.2254503,0.0028814815,0.7598311,0.01038638,0.00004827131],"about_ca_topic_score_codex":0.0016683494,"about_ca_topic_score_gemma":0.0011711373,"teacher_disagreement_score":0.011267024,"about_ca_system_score_codex":0.0024239088,"about_ca_system_score_gemma":0.0009988543,"threshold_uncertainty_score":0.03769201},"labels":[],"label_agreement":null},{"id":"W4391315199","doi":"10.1287/moor.2022.0121","title":"Joint Mixability and Notions of Negative Dependence","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Probability and Risk Models","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":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthant; Mathematics; Joint (building); Mathematical economics; Joint probability distribution; Compatibility (geochemistry); Connection (principal bundle); Combinatorics; Econometrics; Copula (linguistics); Mathematical optimization; Statistics","score_opus":0.526354521327318,"score_gpt":0.5411465846788558,"score_spread":0.01479206335153782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391315199","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.10886843,0.00037201782,0.87692416,0.0007997153,0.000039442162,0.00006785785,0.00032071435,0.00012456793,0.012483225],"genre_scores_gemma":[0.9231495,0.00043693846,0.06657431,0.00032122037,0.00018555208,0.00031045557,0.000480699,0.00013616798,0.008405122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945368,0.0018190428,0.00037286233,0.0013835534,0.0014296913,0.00045796175],"domain_scores_gemma":[0.9792084,0.011183458,0.003697839,0.0024581223,0.0022231166,0.0012290946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00555172,0.0011833378,0.001008299,0.0022393481,0.001202126,0.0028389774,0.0016944532,0.0015938454,0.004343215],"category_scores_gemma":[0.020820385,0.00086627936,0.0012136931,0.001801431,0.006316998,0.00659475,0.004093896,0.0025298945,0.00061392254],"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.000093863084,0.000042081825,0.0028624851,0.000071234375,0.000062842475,0.00021871075,0.00021704039,0.032717228,0.0025348885,0.951523,0.0007194856,0.00893708],"study_design_scores_gemma":[0.000023113425,0.00009102876,0.0018333105,0.00003888519,0.00003814763,0.0002929918,0.00009137615,0.18835558,0.0016740278,0.80451375,0.0029962373,0.000051489355],"about_ca_topic_score_codex":0.0010544936,"about_ca_topic_score_gemma":0.0007090968,"teacher_disagreement_score":0.00555172,"about_ca_system_score_codex":0.0017336971,"about_ca_system_score_gemma":0.0008120923,"threshold_uncertainty_score":0.029360712},"labels":[],"label_agreement":null},{"id":"W4393222532","doi":"10.1287/moor.2023.0015","title":"Uniqueness of Convex-Ranged Probabilities and Applications to Risk Measures and Games","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Université de Montréal","funders":"Università Bocconi","keywords":"Mathematics; Uniqueness; Regular polygon; Mathematical economics; Mathematical optimization; Applied mathematics; Calculus (dental); Mathematical analysis; Geometry","score_opus":0.23452325936549379,"score_gpt":0.4890808803450211,"score_spread":0.25455762097952733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393222532","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.02711882,0.0066319,0.9281937,0.004666155,0.00039746342,0.000057370667,0.00011000402,0.00008534275,0.03273927],"genre_scores_gemma":[0.77719885,0.008304026,0.1944271,0.0014755034,0.0016918754,0.00028741919,0.00012695318,0.00018944203,0.01629885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752194,0.0010973986,0.00014797038,0.00045250857,0.00056478323,0.00021534266],"domain_scores_gemma":[0.9923103,0.0052032843,0.00053103414,0.00059276744,0.0009092399,0.0004534398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006271216,0.0012944624,0.0014008612,0.0037020082,0.0015797346,0.0031872308,0.0022932158,0.0022877576,0.0043946495],"category_scores_gemma":[0.019677067,0.00082534645,0.0023091852,0.0022682112,0.0062812767,0.007981301,0.005705493,0.004681809,0.0005444898],"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.0000031067839,0.0000055436144,0.00010248517,0.000028536697,0.0000075366484,0.00004717171,0.000054691292,0.003000429,0.00018138863,0.99316615,0.00024598915,0.0031569807],"study_design_scores_gemma":[0.0000028761149,0.000008639835,0.000078042984,0.000025585587,0.0000040543478,0.00006756183,0.000028999402,0.018580569,0.00022421348,0.9794799,0.0014862937,0.000013191449],"about_ca_topic_score_codex":0.0011645522,"about_ca_topic_score_gemma":0.0007589821,"teacher_disagreement_score":0.006271216,"about_ca_system_score_codex":0.0022987362,"about_ca_system_score_gemma":0.0011817787,"threshold_uncertainty_score":0.033165753},"labels":[],"label_agreement":null},{"id":"W4394569093","doi":"10.1287/moor.2022.0320","title":"On Constrained Mixed-Integer DR-Submodular Minimization","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Submodular set function; Mathematics; Integer (computer science); Integer programming; Mathematical optimization; Minification; Combinatorics; Computer science","score_opus":0.0928491537130744,"score_gpt":0.38163962710865945,"score_spread":0.28879047339558506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394569093","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.0147520425,0.0011951496,0.9718525,0.00093933527,0.00007511927,0.00011562734,0.00025031922,0.0001331552,0.010686808],"genre_scores_gemma":[0.5037022,0.0035765092,0.47391662,0.0010478044,0.0003996011,0.00078610296,0.0008959287,0.0003458266,0.015329463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871945,0.0007012926,0.00003826947,0.00022264333,0.00018460632,0.0001337352],"domain_scores_gemma":[0.9958326,0.003457445,0.00023716484,0.0001851758,0.00018681797,0.00010070762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022801796,0.0017705205,0.001282314,0.0007964161,0.00047890216,0.001519689,0.0013274034,0.0012199391,0.0046178717],"category_scores_gemma":[0.007795917,0.0005903896,0.0007659975,0.0016888953,0.0016780499,0.0025604775,0.001697855,0.002365568,0.000736023],"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.00013517325,0.00013274168,0.0006003189,0.00030597262,0.00007337407,0.00020541402,0.00011894394,0.70687497,0.0017900313,0.23108377,0.005967298,0.05271197],"study_design_scores_gemma":[0.000019448817,0.000050300398,0.00012213286,0.000034330656,0.000009418621,0.000039746366,0.000021384152,0.8805387,0.00046158241,0.11653844,0.0021539717,0.00001050181],"about_ca_topic_score_codex":0.0026880738,"about_ca_topic_score_gemma":0.0027581141,"teacher_disagreement_score":0.0046178717,"about_ca_system_score_codex":0.0017417554,"about_ca_system_score_gemma":0.0014507399,"threshold_uncertainty_score":0.015448332},"labels":[],"label_agreement":null},{"id":"W4396938499","doi":"10.1287/moor.2021.0237","title":"Robust Multiple Stopping—A Duality Approach","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":3,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Waterloo; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Duality (order theory); Optimal stopping; Mathematical optimization; Strong duality; Mathematical economics; Calculus (dental); Applied mathematics; Combinatorics; Optimization problem","score_opus":0.6215764346664281,"score_gpt":0.5293787763630006,"score_spread":0.09219765830342752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396938499","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.0009069319,0.000112481845,0.9964353,0.00014959603,0.000025838595,0.000026390164,0.000017570286,0.00004369669,0.0022822998],"genre_scores_gemma":[0.16329427,0.0006252461,0.823651,0.00040626977,0.00029353268,0.00061037537,0.00016733809,0.00043676197,0.010515268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961733,0.0018847601,0.00017205747,0.0005387865,0.000892142,0.00033888625],"domain_scores_gemma":[0.9916441,0.005787237,0.00074727857,0.0005762342,0.00083967356,0.0004054766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010028922,0.0015931854,0.0023309404,0.0027036448,0.00078950025,0.0024623277,0.0029382578,0.0025046696,0.0077824285],"category_scores_gemma":[0.020745482,0.0011580846,0.0030188418,0.0013051641,0.0022497657,0.0032092596,0.0041177943,0.005279876,0.0011832578],"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.00004506945,0.000083595456,0.00027028716,0.00013463429,0.000067275716,0.00009171451,0.00008088021,0.25804582,0.0013062706,0.71281856,0.0015721486,0.02548369],"study_design_scores_gemma":[0.000015322688,0.000044010678,0.00005805372,0.000033965058,0.0000129248465,0.000044554734,0.0000091873335,0.810633,0.00049286446,0.18636513,0.002275897,0.000015002323],"about_ca_topic_score_codex":0.0009367986,"about_ca_topic_score_gemma":0.0008413249,"teacher_disagreement_score":0.010028922,"about_ca_system_score_codex":0.0024931345,"about_ca_system_score_gemma":0.003418778,"threshold_uncertainty_score":0.053038657},"labels":[],"label_agreement":null},{"id":"W4400583084","doi":"10.1287/moor.2022.0342","title":"Order Independence in Sequential, Issue-by-Issue Voting","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"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":"Mathematics; Voting; Independence (probability theory); Mathematical economics; Order (exchange); Mathematical optimization; Political science; Economics; Statistics; Law","score_opus":0.1205292646494297,"score_gpt":0.37553947118519154,"score_spread":0.25501020653576184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400583084","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.314235,0.0005890843,0.64201814,0.003786946,0.00016831537,0.00032086117,0.0005807835,0.00021054313,0.038090285],"genre_scores_gemma":[0.96603775,0.00030300196,0.020946063,0.00021768539,0.00020606972,0.00024260671,0.00024188985,0.00006376672,0.011741254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98896164,0.0055587566,0.00048421606,0.001791597,0.0014961218,0.001707692],"domain_scores_gemma":[0.953461,0.030528942,0.007906959,0.0042101154,0.0021626786,0.0017303863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012365934,0.00080984156,0.0024490652,0.0011216203,0.0017566017,0.0032578458,0.0022056869,0.0023581402,0.010431679],"category_scores_gemma":[0.049566027,0.0008863718,0.0014467845,0.0015882553,0.00347752,0.006499862,0.0027017351,0.0037107172,0.0011648722],"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.0005090788,0.00019071785,0.0040902374,0.00015847945,0.00011566409,0.00033849824,0.0005812762,0.06943691,0.0013355105,0.8990937,0.0025294712,0.021620514],"study_design_scores_gemma":[0.00015742105,0.00012905829,0.0012914072,0.00002308463,0.000039991795,0.000088536086,0.00013416228,0.24823043,0.0006575266,0.74722433,0.0019846223,0.000039424605],"about_ca_topic_score_codex":0.0032942742,"about_ca_topic_score_gemma":0.0028775423,"teacher_disagreement_score":0.012365934,"about_ca_system_score_codex":0.0019785056,"about_ca_system_score_gemma":0.0020044376,"threshold_uncertainty_score":0.0653981},"labels":[],"label_agreement":null},{"id":"W4400732905","doi":"10.1287/moor.2023.0211","title":"Risk-Averse Markov Decision Processes Through a Distributional Lens","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","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":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov decision process; Mathematics; Partially observable Markov decision process; Mathematical optimization; Mathematical economics; Decision theory; Through-the-lens metering; Markov chain; Lens (geology); Markov process; Statistics","score_opus":0.22862792256408282,"score_gpt":0.5019646536223583,"score_spread":0.2733367310582755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400732905","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.043089718,0.0006486487,0.93278706,0.0028266525,0.00007818799,0.000049344726,0.00017849615,0.000101130114,0.020240795],"genre_scores_gemma":[0.8620956,0.0015662136,0.11776831,0.000519332,0.0003808756,0.00024600842,0.00019215497,0.00010254796,0.01712902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984592,0.0007183553,0.00006231047,0.0002558794,0.00034936029,0.00015486426],"domain_scores_gemma":[0.99554175,0.0027029035,0.0006247444,0.0003207536,0.00041049547,0.0003994198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028357247,0.00092847197,0.0008977605,0.0011908012,0.00074576744,0.0030286093,0.0011346894,0.0015604196,0.004728488],"category_scores_gemma":[0.007400667,0.00059447286,0.001409418,0.0007322884,0.0027452125,0.004255953,0.0022101959,0.0033737158,0.00043507924],"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.0000070632746,0.000014977471,0.00018291106,0.000013660417,0.000009591507,0.000048135225,0.000060443886,0.031839345,0.0002546951,0.96552426,0.00027122418,0.0017737717],"study_design_scores_gemma":[0.000009088861,0.000021043306,0.00016007293,0.000015550284,0.000006318485,0.000035585752,0.00003168536,0.22568253,0.00011222535,0.7726499,0.0012650444,0.000011067575],"about_ca_topic_score_codex":0.0023818146,"about_ca_topic_score_gemma":0.0018898697,"teacher_disagreement_score":0.004728488,"about_ca_system_score_codex":0.002735944,"about_ca_system_score_gemma":0.001613641,"threshold_uncertainty_score":0.01985073},"labels":[],"label_agreement":null},{"id":"W4401457094","doi":"10.1287/moor.2023.0267","title":"Uncertainty Propagation and Dynamic Robust Risk Measures","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","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":true,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Risk measure; Ambiguity; Mathematics; Uncertainty quantification; Infimum and supremum; Consistency (knowledge bases); Mathematical optimization; Convexity; Time horizon; Coherent risk measure; Sensitivity analysis; Set (abstract data type); Measure (data warehouse); Computer science; Uncertainty analysis; Data mining; Statistics; Economics; Discrete mathematics","score_opus":0.2246702037594537,"score_gpt":0.4762460642136392,"score_spread":0.25157586045418545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401457094","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.005056252,0.00045830163,0.98924047,0.00047174664,0.00004576336,0.00002623139,0.00011433364,0.00007732971,0.004509535],"genre_scores_gemma":[0.6236904,0.0018355866,0.3640356,0.0005367338,0.0005653713,0.0004071877,0.00057219533,0.00028171868,0.00807516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99073046,0.0026116397,0.0006398237,0.00229985,0.0030617502,0.00065652793],"domain_scores_gemma":[0.980493,0.011773754,0.0032626183,0.0019842328,0.001998454,0.00048797598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076730354,0.0020091906,0.0013422418,0.0036016945,0.0010957072,0.0053526736,0.0027369927,0.0029143211,0.0036553335],"category_scores_gemma":[0.025327442,0.0009554792,0.0027479096,0.0024195092,0.005265391,0.008992812,0.0038049389,0.005014208,0.0006156438],"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.000007932344,0.000012162525,0.00026630095,0.000045335815,0.000041542455,0.0000862414,0.00010304208,0.065701015,0.00055771443,0.92640966,0.00037009336,0.0063989228],"study_design_scores_gemma":[0.000005454067,0.000024966694,0.00026199216,0.000038261987,0.000017358961,0.000085602354,0.000033229626,0.15601648,0.0004990911,0.8395724,0.0034075817,0.000037674974],"about_ca_topic_score_codex":0.0025453132,"about_ca_topic_score_gemma":0.0010029786,"teacher_disagreement_score":0.0076730354,"about_ca_system_score_codex":0.003683969,"about_ca_system_score_gemma":0.0016876133,"threshold_uncertainty_score":0.04057938},"labels":[],"label_agreement":null},{"id":"W4412448255","doi":"10.1287/moor.2022.0328","title":"Robust Faber–Schauder Approximation Based on Discrete Observations of an Antiderivative","year":2025,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"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":"Mathematics; Discrete mathematics; Applied mathematics; Mathematical optimization; Mathematical economics","score_opus":0.18068538024043884,"score_gpt":0.35019823585394705,"score_spread":0.1695128556135082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412448255","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.038797494,0.00015577009,0.96019286,0.00011577651,0.000020502803,0.000009442893,0.000037470596,0.00010496348,0.00056574674],"genre_scores_gemma":[0.7338263,0.00072886265,0.26052666,0.00010430528,0.000082581544,0.00007257473,0.00031609862,0.0001444067,0.004198237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939525,0.00018846206,0.000027357974,0.0001238917,0.00018939989,0.000075581236],"domain_scores_gemma":[0.99649113,0.002181868,0.0004739486,0.0004128755,0.00029341615,0.000146715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031765155,0.00093478133,0.0010595345,0.0010638767,0.000292458,0.0011618193,0.0014126081,0.0012717025,0.00086168275],"category_scores_gemma":[0.010491828,0.0005467669,0.0010400965,0.0006537772,0.001781607,0.0018767937,0.0014372694,0.002429172,0.00026984836],"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.00020112806,0.000046550296,0.0023834172,0.0001605799,0.00006629021,0.00023912308,0.00022482932,0.7778517,0.016661715,0.16723834,0.0005191107,0.034407176],"study_design_scores_gemma":[0.000003568528,0.00001123615,0.0001285219,0.000006793429,0.000003970024,0.000016906979,0.000004861856,0.9887631,0.0013651026,0.009488983,0.00019673163,0.000010175567],"about_ca_topic_score_codex":0.0037227413,"about_ca_topic_score_gemma":0.0016186083,"teacher_disagreement_score":0.0037227413,"about_ca_system_score_codex":0.00075293117,"about_ca_system_score_gemma":0.00096852623,"threshold_uncertainty_score":0.016799212},"labels":[],"label_agreement":null},{"id":"W4412630514","doi":"10.1287/moor.2024.0591","title":"Distorted Optimal Transport","year":2025,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"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":"Mathematics; Mathematical optimization","score_opus":0.08777789874440091,"score_gpt":0.347427694514767,"score_spread":0.2596497957703661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412630514","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.016171824,0.00043780758,0.9613589,0.0013648509,0.000114803974,0.000056592595,0.00028003787,0.00011478951,0.020100426],"genre_scores_gemma":[0.79281354,0.0013737088,0.17916124,0.0006057736,0.00021074335,0.0002256952,0.0004177696,0.00034558095,0.024845937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980287,0.00072993134,0.0001188407,0.00048451294,0.00042321396,0.00021484208],"domain_scores_gemma":[0.9974227,0.00091272057,0.0004476558,0.00045710403,0.00052259234,0.00023728001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024801912,0.0012779667,0.0012947564,0.0010195072,0.0008414809,0.0032405423,0.002185908,0.0022491778,0.008145963],"category_scores_gemma":[0.008138747,0.0007101978,0.0012547552,0.0011872816,0.0031502845,0.0066445204,0.002778583,0.0022055244,0.00079312007],"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.000057116253,0.000021700977,0.00034964064,0.0000832008,0.00003401985,0.00007192337,0.00006624236,0.15987056,0.00072511646,0.82639754,0.0019955,0.010327496],"study_design_scores_gemma":[0.000014580773,0.00004766515,0.00025524624,0.000042045296,0.00001881053,0.00009597812,0.000061016308,0.46965224,0.00077188836,0.52376556,0.005247454,0.000027528524],"about_ca_topic_score_codex":0.0030704674,"about_ca_topic_score_gemma":0.0018812921,"teacher_disagreement_score":0.008145963,"about_ca_system_score_codex":0.0053557493,"about_ca_system_score_gemma":0.0023353037,"threshold_uncertainty_score":0.03885883},"labels":[],"label_agreement":null},{"id":"W7117305974","doi":"10.1287/moor.2022.0172","title":"Combining a Smart Pricing Policy with a Simple Replenishment Policy: Managing Uncertainties in the Presence of Stochastic Purchase Returns","year":2025,"lang":"en","type":"article","venue":"Mathematics of 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":"McGill University","funders":"","keywords":"Dynamic pricing; Simple (philosophy); Joint probability distribution; Pricing strategies; Stochastic process; Joint (building); Binomial options pricing model; Trading strategy","score_opus":0.055133894170290486,"score_gpt":0.3512912936868226,"score_spread":0.29615739951653214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117305974","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.08765392,0.00030771655,0.90826154,0.00066932617,0.00006935011,0.000080417325,0.0000712615,0.00023898642,0.0026474877],"genre_scores_gemma":[0.97296506,0.0001577106,0.025838485,0.0001020935,0.000047680307,0.000030073688,0.000027212303,0.00002755619,0.0008041311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977379,0.0007819642,0.00015162728,0.00043257742,0.00050440896,0.00039148596],"domain_scores_gemma":[0.99406886,0.0036766569,0.0010243144,0.0005280111,0.00040731553,0.0002948107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037410352,0.0009959039,0.0016014803,0.000496633,0.0005629221,0.0022519105,0.0018851686,0.0017738668,0.0018597533],"category_scores_gemma":[0.012385703,0.00084542297,0.00069285755,0.0006820169,0.0015694428,0.0033629045,0.00186222,0.0017605987,0.00021699007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010208145,0.00006922858,0.001337857,0.00006784803,0.00005005678,0.000231141,0.000084709165,0.9482899,0.0026210325,0.02843467,0.0004425828,0.018268976],"study_design_scores_gemma":[0.000012463398,0.00004144328,0.00017573888,0.0000056130934,0.000014019658,0.00003042654,0.000012242132,0.98848337,0.00046482598,0.010503305,0.00024316231,0.00001340116],"about_ca_topic_score_codex":0.003864597,"about_ca_topic_score_gemma":0.0021681974,"teacher_disagreement_score":0.003864597,"about_ca_system_score_codex":0.0012766162,"about_ca_system_score_gemma":0.0016245602,"threshold_uncertainty_score":0.019784749},"labels":[],"label_agreement":null}]}