{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035622254,0.000100858284,0.9605515,0.0011243197,0.00003045631,0.00061898684,0.0000060924813,0.00002943874,0.0019160772],"genre_scores_gemma":[0.3562585,0.000024015797,0.6422391,0.000024694118,0.00004558711,0.0000913683,0.000014850609,0.000014617472,0.0012872561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988742,0.000052838157,0.0002009811,0.00021584466,0.00039670692,0.0002594268],"domain_scores_gemma":[0.9987194,0.00021074715,0.000025802496,0.0004902092,0.00045355884,0.00010028388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019432805,0.00008318783,0.00014860895,0.00018033427,0.00017342613,0.00047356111,0.0005607628,0.000028393102,0.0000027519598],"category_scores_gemma":[0.00020914355,0.00006156174,0.000017032116,0.0004033685,0.00013116846,0.0004607827,0.00042232222,0.00009561767,0.0000060929597],"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.000030037712,0.00039062768,0.00016638786,0.00025838113,0.00010612809,0.0000144960695,0.009370875,0.0140468255,0.00024101623,0.95409024,0.008117139,0.013167874],"study_design_scores_gemma":[0.0004363687,0.00029111968,0.00001985786,0.00006742516,0.0000063629755,0.0000067908795,0.0010038117,0.9915059,0.00021218305,0.005708503,0.00064959977,0.00009206778],"about_ca_topic_score_codex":0.000016853714,"about_ca_topic_score_gemma":0.000027807,"teacher_disagreement_score":0.9774591,"about_ca_system_score_codex":0.000016554064,"about_ca_system_score_gemma":0.000070795824,"threshold_uncertainty_score":0.4566561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137928,0.02516064,0.42573568,0.005619255,0.0002575233,0.00626826,0.000075087315,0.00020069565,0.02289003],"genre_scores_gemma":[0.80503654,0.004811119,0.18610634,0.0000067970345,0.000018955257,0.00020989229,0.0000029349742,0.000029224168,0.0037782127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986306,0.00012661112,0.00027408343,0.000282801,0.00037712354,0.00030877462],"domain_scores_gemma":[0.99743664,0.0009833948,0.000049495564,0.00094304176,0.00047857303,0.00010884432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022376152,0.00010001282,0.0002419787,0.00023569973,0.0012572627,0.0006658559,0.0008695919,0.000066234614,0.000008340167],"category_scores_gemma":[0.0013440859,0.0000876229,0.00003627708,0.00015715718,0.0007909622,0.0007535978,0.000626504,0.00020671843,0.0000074345025],"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.0000054570037,0.00005162657,0.000035406032,0.00033253565,0.000026992053,0.0000029469472,0.002914398,0.000017537659,0.0008425632,0.99028784,0.000033752352,0.0054489183],"study_design_scores_gemma":[0.0015769389,0.00051218976,0.00028007283,0.0003947333,0.000023059356,0.00012318524,0.002753437,0.3704972,0.0071393806,0.61477613,0.0015178147,0.00040584648],"about_ca_topic_score_codex":0.000040848947,"about_ca_topic_score_gemma":0.00003434597,"teacher_disagreement_score":0.37551174,"about_ca_system_score_codex":0.000019769053,"about_ca_system_score_gemma":0.00010472199,"threshold_uncertainty_score":0.9669975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97431123,0.00005153002,0.0150545705,0.0002688072,0.00013155435,0.00022315989,0.000008515349,0.000008850296,0.009941805],"genre_scores_gemma":[0.9201548,0.0000048900483,0.07939351,0.000013232361,0.000024200133,0.000016281305,0.0000012809458,0.000010378147,0.00038140017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961592,0.0002593701,0.0011124774,0.00033008514,0.0018545571,0.00028429253],"domain_scores_gemma":[0.9944325,0.0030444125,0.0000666924,0.0008847576,0.0014583769,0.00011327739],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015026576,0.0000894366,0.00033738857,0.0014373234,0.00012196427,0.00036855187,0.0010457813,0.00009380637,0.000352267],"category_scores_gemma":[0.019995224,0.00006699241,0.00006329988,0.001705843,0.00017209003,0.00033843692,0.00039263137,0.00026584862,0.0008430058],"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.0001024168,0.0016035441,0.008617802,0.000016903929,0.0000121916155,0.000065217326,0.01123533,0.09484501,0.0010080297,0.06497646,0.016903417,0.80061364],"study_design_scores_gemma":[0.00046866262,0.00016532106,0.0011131426,0.00014222751,0.0000027005806,0.000020184478,0.0066547883,0.20776927,0.0002508989,0.78163886,0.0016357016,0.00013825385],"about_ca_topic_score_codex":0.000064852415,"about_ca_topic_score_gemma":0.00093155395,"teacher_disagreement_score":0.8004754,"about_ca_system_score_codex":0.0001198092,"about_ca_system_score_gemma":0.000314564,"threshold_uncertainty_score":0.999935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027760213,0.00012417429,0.8846294,0.06344912,0.00052956643,0.0021846495,0.00018603566,0.0000453637,0.021091472],"genre_scores_gemma":[0.93573934,0.000088653294,0.056817614,0.00017466089,0.00010929744,0.00028179726,0.000007681914,0.000023044931,0.0067579313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725753,0.00045990056,0.000540414,0.0002680694,0.001293476,0.00018058108],"domain_scores_gemma":[0.9953648,0.0010752089,0.00012458848,0.0018480539,0.0015459409,0.000041413205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023185886,0.00013622838,0.0002626134,0.00024886933,0.0004052259,0.00025913375,0.0028254946,0.00011230196,0.00029555082],"category_scores_gemma":[0.0015244787,0.000061748295,0.00019197018,0.00073855737,0.00021030939,0.000118821445,0.0018476164,0.0004451356,0.000058019563],"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.0000016526637,0.00018971183,0.000019750782,0.00007056473,0.000069872214,1.4666549e-7,0.0012598499,0.024584707,0.00018883616,0.9714256,0.0021044551,0.000084832085],"study_design_scores_gemma":[0.00021377161,0.00004564101,0.00017683185,0.00038828352,0.000021667316,0.0000011071864,0.00012977955,0.89051956,0.0033033367,0.10475915,0.00029111412,0.00014975494],"about_ca_topic_score_codex":0.000040440907,"about_ca_topic_score_gemma":0.000027760761,"teacher_disagreement_score":0.90797913,"about_ca_system_score_codex":0.000056750174,"about_ca_system_score_gemma":0.000493694,"threshold_uncertainty_score":0.5250519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009738619,0.00006398839,0.99620014,0.000026418322,0.000032098884,0.00079944485,0.00003943918,0.00010586486,0.0017587321],"genre_scores_gemma":[0.2024574,0.000109612716,0.7967032,0.0000053274493,0.000069183785,0.0002782053,0.000057413105,0.00004213802,0.00027749737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990503,0.00003340187,0.00029607562,0.00012984098,0.000257496,0.0002328447],"domain_scores_gemma":[0.9988378,0.00022304844,0.000016438029,0.00041329712,0.00045795608,0.000051434497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007022205,0.00010273189,0.00012535896,0.00012890491,0.0003053894,0.0000709652,0.0002947879,0.0000691566,0.000049779726],"category_scores_gemma":[0.00013980268,0.000077976656,0.000033453394,0.00023691216,0.00010638186,0.0002073267,0.000030370664,0.00017585167,0.00001170881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020135126,0.00011095947,0.0000012756997,0.00009623061,0.000022171138,1.9705314e-7,0.0030618033,0.9748415,0.00028295064,0.012938945,0.00015907918,0.008482888],"study_design_scores_gemma":[0.00015227559,0.000087553024,0.0000042054553,0.000019534487,0.0000126397545,0.0000015798853,0.00067492726,0.9788527,0.014002673,0.005835394,0.00026911093,0.000087393484],"about_ca_topic_score_codex":0.000025860421,"about_ca_topic_score_gemma":0.000011308714,"teacher_disagreement_score":0.20148355,"about_ca_system_score_codex":0.000028474367,"about_ca_system_score_gemma":0.00003383005,"threshold_uncertainty_score":0.31797957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6212916,0.00027966042,0.33562785,0.003500084,0.00006877624,0.00086842687,0.00034584908,0.000009096567,0.038008682],"genre_scores_gemma":[0.99000525,0.00003349976,0.009423889,0.000009757019,0.000018828301,0.00006104833,0.0000052785704,0.000008898496,0.00043353526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990898,0.000007225526,0.00048056597,0.0001508349,0.0001233125,0.00014827144],"domain_scores_gemma":[0.9993203,0.000104040235,0.00008171096,0.00032647382,0.00014140383,0.0000260599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080212444,0.000060155242,0.00017865413,0.0002187571,0.00013965441,0.000027049187,0.00031946562,0.00005409001,0.00014348971],"category_scores_gemma":[0.00060143863,0.000052482883,0.000059567003,0.000683039,0.00023025324,0.00012479405,0.00010489322,0.00023468358,0.000065200984],"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.0000056896006,0.00024389483,0.00029193194,0.000073894786,0.000007158641,2.1842604e-7,0.0007070885,0.0031338502,0.00035738826,0.99509,0.00007171853,0.000017142278],"study_design_scores_gemma":[0.00067765516,0.00005898245,0.013550305,0.00016525439,0.000003476512,0.0000031196173,0.000774763,0.024087396,0.0016784007,0.9582482,0.00063182303,0.00012061663],"about_ca_topic_score_codex":0.00041955692,"about_ca_topic_score_gemma":0.00015143702,"teacher_disagreement_score":0.36871368,"about_ca_system_score_codex":0.000075376636,"about_ca_system_score_gemma":0.00011652114,"threshold_uncertainty_score":0.21401899},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05806725,0.000096921045,0.9367973,0.0028487055,0.00006489315,0.0015444887,0.000020598543,0.00002173913,0.0005381074],"genre_scores_gemma":[0.35664192,0.0000117059735,0.6409079,0.000015556976,0.00008339339,0.0006855933,0.0000074958193,0.000012012323,0.0016344759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697447,0.00021347063,0.00073695544,0.0002469427,0.0015009916,0.00032714324],"domain_scores_gemma":[0.9936688,0.0025915136,0.00007437898,0.0007880247,0.0027779173,0.00009939879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011360094,0.00008547569,0.00018244974,0.00028717285,0.0010189303,0.0010277329,0.00083341467,0.000054130393,0.00036357838],"category_scores_gemma":[0.0031134584,0.00004921268,0.00008642717,0.0009400326,0.00017422154,0.00048657163,0.00006686601,0.00019257728,0.00025439425],"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.0000074936456,0.0020270548,0.000081630205,0.00008069906,0.00015407175,3.7611758e-7,0.020601,0.2561401,0.03183889,0.16385964,0.008830124,0.5163789],"study_design_scores_gemma":[0.0001467367,0.00008616108,0.00007728326,0.000019889105,0.000009270664,0.000002107752,0.00478518,0.937607,0.0028907822,0.053944606,0.00037388055,0.000057118672],"about_ca_topic_score_codex":0.00014998228,"about_ca_topic_score_gemma":0.000040058276,"teacher_disagreement_score":0.6814669,"about_ca_system_score_codex":0.00003376762,"about_ca_system_score_gemma":0.00016115665,"threshold_uncertainty_score":0.9910452},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02078968,0.00018399372,0.8785082,0.00015955686,0.000080380516,0.0046757925,0.00024887192,0.00018123264,0.09517231],"genre_scores_gemma":[0.21529378,0.000037440117,0.7828625,0.000004909125,0.00002967537,0.00031578497,0.000011474761,0.000054977547,0.0013894615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989749,0.00003914608,0.00035393215,0.00010217771,0.00030174875,0.00022806192],"domain_scores_gemma":[0.9987754,0.00036899687,0.00003243394,0.00028447722,0.0004988124,0.000039840943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008670966,0.00010150099,0.00019092824,0.00009731765,0.00017444092,0.00004576814,0.00022170959,0.00005162349,0.00025816684],"category_scores_gemma":[0.00008197782,0.00006865686,0.000043855372,0.00032325438,0.00016626684,0.000098043,0.000039585462,0.00016434646,0.000021805508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020542397,0.0029217924,0.0005469689,0.006465664,0.0024706228,0.000008993279,0.1515901,0.6534234,0.032702263,0.051764797,0.030492488,0.067407496],"study_design_scores_gemma":[0.00044768918,0.000111893634,0.0000031227878,0.00016417041,0.000022216438,0.000013392591,0.000720074,0.9869955,0.010957085,0.00013163575,0.00032912163,0.00010405912],"about_ca_topic_score_codex":0.000045570378,"about_ca_topic_score_gemma":0.000017706985,"teacher_disagreement_score":0.33357215,"about_ca_system_score_codex":0.000022839611,"about_ca_system_score_gemma":0.00011297759,"threshold_uncertainty_score":0.28267458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33174247,0.00033038502,0.65362364,0.0040222653,0.00032248872,0.0012480847,0.000048045677,0.00007511886,0.008587533],"genre_scores_gemma":[0.8922712,0.000091614354,0.10276009,0.000006189352,0.00026462745,0.00012515669,0.0000057606376,0.00002628303,0.0044490406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99376196,0.0006443029,0.0009071517,0.00053190626,0.0036781053,0.00047655002],"domain_scores_gemma":[0.99202764,0.003616151,0.00008345014,0.0012330939,0.0028154764,0.0002241752],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.013318639,0.00013983471,0.00036192316,0.00072660577,0.0007185513,0.0007027714,0.0009872518,0.00010524598,0.00025109452],"category_scores_gemma":[0.018495983,0.00010554159,0.000057395002,0.0014543171,0.00081394217,0.0005053089,0.00039402736,0.00041966836,0.00029355206],"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.00010175245,0.00243794,0.008668742,0.00039023784,0.00018709709,0.000017801232,0.018593442,0.010663006,0.061382987,0.4737054,0.016761944,0.40708962],"study_design_scores_gemma":[0.00061050936,0.00030493704,0.003805149,0.000073945565,0.00000702436,0.000019089599,0.0044506076,0.83760476,0.022505343,0.1170473,0.013321934,0.0002493899],"about_ca_topic_score_codex":0.00003706817,"about_ca_topic_score_gemma":0.0000227815,"teacher_disagreement_score":0.8269418,"about_ca_system_score_codex":0.000060505397,"about_ca_system_score_gemma":0.00018611524,"threshold_uncertainty_score":0.98977166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26311287,0.000059906903,0.7320087,0.0016523718,0.00022620376,0.0007336044,0.00003985196,0.00014826299,0.002018206],"genre_scores_gemma":[0.8213294,0.000014419542,0.17821527,0.000022923872,0.000058117363,0.00001697903,0.00001761954,0.000006615153,0.00031864387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746996,0.00012512323,0.000627112,0.00035280234,0.0010333307,0.00039164536],"domain_scores_gemma":[0.99749875,0.00037393012,0.0000595847,0.00077132165,0.0011493973,0.0001470211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383113,0.00013270172,0.00022250273,0.00022624116,0.0004409614,0.0004474655,0.00093779917,0.0000939779,0.000033413256],"category_scores_gemma":[0.0011868505,0.000107716114,0.00006819626,0.0011546385,0.000084801264,0.00047159818,0.00012454449,0.000292483,0.00003767866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042528112,0.0022367977,0.0000827004,0.00024975554,0.0001381366,0.000104891806,0.01266496,0.5055092,0.013744019,0.10164004,0.013661834,0.34954238],"study_design_scores_gemma":[0.0006631888,0.00021382097,0.0009707122,0.00006845814,0.0000028284358,0.000014747145,0.00013384988,0.98210055,0.0058387592,0.009717737,0.00014484045,0.00013048759],"about_ca_topic_score_codex":0.000015269277,"about_ca_topic_score_gemma":0.00004704089,"teacher_disagreement_score":0.5582165,"about_ca_system_score_codex":0.00004381377,"about_ca_system_score_gemma":0.00014260369,"threshold_uncertainty_score":0.43925357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0789988,0.00023192329,0.91021615,0.0022498106,0.00011886878,0.0024299568,0.00036357332,0.000079829784,0.005311078],"genre_scores_gemma":[0.07049601,0.00015981299,0.92726076,0.00006380025,0.00007669348,0.00031369875,0.000025968702,0.000021421849,0.0015818183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823993,0.00010510972,0.00038274087,0.00036603017,0.00051627116,0.00038988778],"domain_scores_gemma":[0.9976473,0.0009108308,0.000031069376,0.0005011095,0.0007879509,0.00012172953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010169632,0.00014011664,0.00024724766,0.0002212224,0.0008007614,0.00033533265,0.0006399124,0.000068587935,0.00007824442],"category_scores_gemma":[0.00038244601,0.00013264475,0.000048943046,0.0009106231,0.00031570214,0.00044361866,0.0002118683,0.0002519645,0.000017299495],"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.00006884077,0.0015940357,0.000019659888,0.00042965155,0.00025251223,0.000023232104,0.050641794,0.035226073,0.0038152775,0.3554194,0.0033170385,0.5491925],"study_design_scores_gemma":[0.0004858135,0.00017607573,0.000028443186,0.00011125278,0.0000056783188,0.000012637363,0.0006069739,0.9631655,0.0057153497,0.02922961,0.00031825242,0.00014439938],"about_ca_topic_score_codex":0.00023976564,"about_ca_topic_score_gemma":0.00023183454,"teacher_disagreement_score":0.9279394,"about_ca_system_score_codex":0.00005615319,"about_ca_system_score_gemma":0.00020411388,"threshold_uncertainty_score":0.615889},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73444736,0.00045673954,0.16841686,0.007098844,0.00007409143,0.0029020498,0.00001565448,0.00048776064,0.08610062],"genre_scores_gemma":[0.9536307,0.0000048364336,0.04372371,0.00012315593,0.00032305688,0.00005944829,0.000035060046,0.000028903727,0.0020711645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862105,0.000019881247,0.00040296992,0.0002181494,0.0004269551,0.00031098453],"domain_scores_gemma":[0.9981626,0.00023715814,0.00006728301,0.00033077513,0.0011878024,0.000014340296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021728072,0.00011780835,0.00025035455,0.00050481246,0.00057951955,0.0003666077,0.00033912546,0.000052189884,0.000108294684],"category_scores_gemma":[0.0023383435,0.000106453146,0.00007440264,0.000868749,0.00009519199,0.00094907725,0.00006237541,0.00013569195,0.00011722698],"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.00007084951,0.001021497,0.00004431923,0.0009392136,0.00008201925,0.0000058602895,0.0014932535,0.07599061,0.17561907,0.71421486,0.0030492689,0.027469177],"study_design_scores_gemma":[0.00020058634,0.00004146513,0.000018150615,0.00024360517,0.000042606927,0.0000013128358,0.0006984659,0.91917616,0.0034103247,0.07494315,0.0010602467,0.00016393515],"about_ca_topic_score_codex":0.000009240198,"about_ca_topic_score_gemma":0.000019213716,"teacher_disagreement_score":0.84318554,"about_ca_system_score_codex":0.000031739928,"about_ca_system_score_gemma":0.000050079387,"threshold_uncertainty_score":0.44572547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105741605,0.000109730514,0.8913088,0.0003155125,0.000062276384,0.0004642529,0.0000021249346,0.000051663883,0.0019440239],"genre_scores_gemma":[0.6136735,0.00014481402,0.3847877,0.000008554014,0.000011286869,0.000042094438,0.0000023236314,0.000011940007,0.0013177322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974393,0.00018240453,0.00059906254,0.00028553384,0.0010940197,0.00039965508],"domain_scores_gemma":[0.9975976,0.00092259067,0.00006317652,0.0006382023,0.0007052718,0.00007320711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019280576,0.00013309515,0.00021774747,0.00064513704,0.0002917592,0.00039562356,0.000906223,0.00006534365,0.00012917828],"category_scores_gemma":[0.0036142506,0.000120923854,0.000034594552,0.0013885522,0.000112347545,0.00089030317,0.0003326246,0.00039364913,0.00011586486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022990866,0.000181441,0.0003476327,0.0002714632,0.000008802008,0.000007071317,0.007752599,0.98271734,0.0025956666,0.0035919591,0.00017515884,0.0023485825],"study_design_scores_gemma":[0.00021895011,0.000102604004,0.00016789045,0.00020148625,0.0000010650532,0.0000041140797,0.00035191528,0.9946882,0.0032006402,0.00078023225,0.00016198316,0.000120913464],"about_ca_topic_score_codex":0.00007101005,"about_ca_topic_score_gemma":0.00010658202,"teacher_disagreement_score":0.50793195,"about_ca_system_score_codex":0.00014540827,"about_ca_system_score_gemma":0.00012401195,"threshold_uncertainty_score":0.49311316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1366117,0.00007588714,0.8590629,0.0011807136,0.000035618377,0.0013309023,0.000009561661,0.000044438075,0.0016482408],"genre_scores_gemma":[0.7081387,0.00005355176,0.2897903,0.000013247257,0.00003538082,0.00038059065,0.000007428164,0.000019483781,0.0015613219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975859,0.00031354188,0.00046836332,0.00032848987,0.00076836394,0.00053534145],"domain_scores_gemma":[0.99592185,0.0018507036,0.000045078734,0.0010808972,0.0010087368,0.00009273491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005256696,0.00012800132,0.00021990034,0.00027184284,0.0012894856,0.00018490755,0.001964526,0.00006198601,0.000017590206],"category_scores_gemma":[0.0017251321,0.00008709268,0.000109318156,0.0010259968,0.00050472404,0.0003303302,0.00040916193,0.00047037928,0.000025003588],"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.0000075724793,0.00029135065,0.000077134886,0.00022224772,0.000034926976,0.0000033227564,0.012150365,0.007173084,0.014607787,0.96340597,0.00017506306,0.0018511578],"study_design_scores_gemma":[0.00050431397,0.00028906035,0.00017722874,0.00016219907,0.0000049561045,0.00005775482,0.0013274355,0.70694757,0.021880167,0.2678207,0.0005955802,0.00023306161],"about_ca_topic_score_codex":0.000038508093,"about_ca_topic_score_gemma":0.00009982789,"teacher_disagreement_score":0.69977444,"about_ca_system_score_codex":0.000068742,"about_ca_system_score_gemma":0.0002647111,"threshold_uncertainty_score":0.9917811},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94185716,0.00016867102,0.0060965936,0.00013095568,0.000041157316,0.0002346481,0.000012476608,0.000011638935,0.051446706],"genre_scores_gemma":[0.9922307,0.00004762511,0.0056447797,0.0000032660735,0.000023761082,0.000041009964,0.0000053949625,0.000011483074,0.0019919493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989296,0.00006936048,0.000582643,0.00015007384,0.00008255481,0.000185757],"domain_scores_gemma":[0.9993698,0.00018250836,0.000054510852,0.00027663753,0.00008895342,0.000027588345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030379354,0.000061428414,0.0002185885,0.00043441154,0.00016862775,0.00006113377,0.00020381884,0.00005242649,0.00021418369],"category_scores_gemma":[0.00035424915,0.000066252585,0.000033254226,0.0003865466,0.000099858524,0.000271571,0.000039813676,0.00017125125,0.00026867964],"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.0000037687012,0.00016247311,0.001401811,0.000109268025,0.000007527106,0.000002078248,0.009105158,0.0024864606,0.00050560385,0.9861266,0.000062812855,0.000026433778],"study_design_scores_gemma":[0.000947787,0.00013492651,0.029176284,0.00029022654,0.000002034378,0.00004736791,0.014743531,0.09093818,0.0016316357,0.8610438,0.0006581206,0.00038612034],"about_ca_topic_score_codex":0.00030359608,"about_ca_topic_score_gemma":0.000092273076,"teacher_disagreement_score":0.12508282,"about_ca_system_score_codex":0.000049076112,"about_ca_system_score_gemma":0.00005317876,"threshold_uncertainty_score":0.3453423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6484419,0.00006938826,0.32345384,0.003168347,0.00006529516,0.00079988,0.000011714274,0.000050636874,0.023938965],"genre_scores_gemma":[0.978995,0.000008828702,0.013856575,0.000078687306,0.000035618043,0.00004194459,0.000002881214,0.000006118638,0.0069742966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966762,0.00030380613,0.00055206136,0.00028011962,0.0019550405,0.00023274832],"domain_scores_gemma":[0.99514157,0.0025604863,0.000055312867,0.0008827144,0.0012547838,0.00010511593],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005372418,0.000086719236,0.00020015553,0.00051530666,0.00052066415,0.00025525995,0.0008594087,0.00009237889,0.0005230688],"category_scores_gemma":[0.0050414926,0.00006486659,0.00006551749,0.001727475,0.0002237487,0.0003082793,0.000095932584,0.0003154889,0.0009383703],"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.0000065544405,0.00039080458,0.000017616612,0.000008357157,0.000008215008,0.0000011050245,0.0012172455,0.006460495,0.022713628,0.9608804,0.0019373432,0.006358239],"study_design_scores_gemma":[0.00032187355,0.00030427185,0.00158437,0.00004873972,0.0000075665625,0.000014859845,0.00384571,0.052776523,0.054505143,0.88565886,0.0007760338,0.00015606314],"about_ca_topic_score_codex":0.000007655239,"about_ca_topic_score_gemma":0.000014610582,"teacher_disagreement_score":0.3305531,"about_ca_system_score_codex":0.000031376538,"about_ca_system_score_gemma":0.0001318197,"threshold_uncertainty_score":0.99983954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1006506,0.00029269012,0.88847923,0.0001422327,0.00005656873,0.00040674052,0.00009540855,0.000015265041,0.009861256],"genre_scores_gemma":[0.96856874,0.000012152941,0.03053014,0.000007545592,0.000028935767,0.00021262195,0.000010557508,0.000015626632,0.00061369245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987719,0.000014136799,0.0005877861,0.00025030042,0.000110132176,0.00026576768],"domain_scores_gemma":[0.99905246,0.00011990217,0.000061007446,0.00044925004,0.00024662644,0.000070729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767205,0.000092036025,0.00028899728,0.00023646258,0.00027757918,0.00006938724,0.00025454693,0.000068824,0.0007800081],"category_scores_gemma":[0.0012976303,0.000096560616,0.00006962622,0.0005234195,0.00015647353,0.00008341997,0.000055377386,0.0001675436,0.00032765706],"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.000002221397,0.00030315807,0.000022425242,0.00004285347,0.000013609862,1.4337134e-7,0.00044156262,0.00022279771,0.0002643076,0.9985324,0.00007809092,0.000076402015],"study_design_scores_gemma":[0.00043929738,0.000054415803,0.00033935707,0.000018703939,0.0000049244386,0.0000035942478,0.00020056232,0.070801795,0.0005900579,0.92656904,0.0008225572,0.00015571526],"about_ca_topic_score_codex":0.00011999195,"about_ca_topic_score_gemma":0.000030860963,"teacher_disagreement_score":0.86791813,"about_ca_system_score_codex":0.000034713325,"about_ca_system_score_gemma":0.0000741328,"threshold_uncertainty_score":0.85405415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021344287,0.000062791485,0.9714,0.00199723,0.000016852302,0.0037605064,0.0001605845,0.000075505915,0.0011822094],"genre_scores_gemma":[0.054263663,0.000017329561,0.94099593,0.00004275332,0.000091560876,0.0008861171,0.000039144365,0.000074493895,0.0035890199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651796,0.0005382583,0.00092128746,0.00040569718,0.0010436408,0.0005731612],"domain_scores_gemma":[0.99009216,0.00537776,0.00013047681,0.0010970364,0.003158314,0.00014428221],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007355988,0.00022876973,0.0004884144,0.00029060504,0.0006910523,0.00027348002,0.00071176834,0.00010605406,0.0009958373],"category_scores_gemma":[0.0034019002,0.00014970398,0.00006720442,0.0006338838,0.00045731114,0.0005481661,0.00018889808,0.0005326982,0.000015524387],"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.0005783581,0.0037928983,0.00010872561,0.005233023,0.0007032868,0.0000061121827,0.06534862,0.102478154,0.026077978,0.779214,0.0037597553,0.0126990825],"study_design_scores_gemma":[0.0013871883,0.00061481923,0.000007659731,0.00016483838,0.00003077655,0.000032259664,0.015804589,0.9253024,0.027000004,0.02881105,0.0005887411,0.00025569063],"about_ca_topic_score_codex":0.000037688525,"about_ca_topic_score_gemma":0.0007846544,"teacher_disagreement_score":0.82282424,"about_ca_system_score_codex":0.00016730845,"about_ca_system_score_gemma":0.0004003188,"threshold_uncertainty_score":0.9999174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015893355,0.000010674054,0.977766,0.00009821218,0.00002811794,0.0025007548,0.00006447871,0.000027846505,0.0036105944],"genre_scores_gemma":[0.2565844,0.0000040111295,0.74262834,0.0000061687283,0.000013907602,0.000402367,0.00006806905,0.000017474922,0.00027526295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614865,0.0005277072,0.0011163751,0.00037961768,0.0014405057,0.00038713266],"domain_scores_gemma":[0.9931082,0.0034157266,0.00016581353,0.00073710515,0.002431131,0.00014201159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010200545,0.00016209066,0.00045940845,0.0004717129,0.00046616216,0.0003110168,0.00065980444,0.00007931059,0.0018206708],"category_scores_gemma":[0.0062997737,0.00010926397,0.00009998214,0.0009459887,0.0006503132,0.0003599528,0.0001273069,0.00018485483,0.00004964127],"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.00020626198,0.0026818553,0.00026800475,0.00020178521,0.00015133126,0.0000014880312,0.02747251,0.009348858,0.0010188462,0.87381005,0.0003692091,0.08446977],"study_design_scores_gemma":[0.00082734536,0.00041678053,0.000059097743,0.00006032385,0.000028017737,0.0000136587205,0.0037927292,0.6660129,0.0018576242,0.32660848,0.00016713241,0.00015592959],"about_ca_topic_score_codex":0.00008744399,"about_ca_topic_score_gemma":0.00009053037,"teacher_disagreement_score":0.656664,"about_ca_system_score_codex":0.00004418308,"about_ca_system_score_gemma":0.00023373755,"threshold_uncertainty_score":0.9990918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36946172,0.00006362943,0.608378,0.001634622,0.00008881063,0.0043355864,0.00004984796,0.00019952451,0.01578827],"genre_scores_gemma":[0.19431224,0.000019696023,0.80047953,0.000022483402,0.000083782565,0.00072354695,0.000013464892,0.00007310622,0.004272131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649334,0.00021747909,0.000806003,0.00034686952,0.001428743,0.0007075764],"domain_scores_gemma":[0.9950621,0.0011520963,0.000062676125,0.000825018,0.0026210123,0.0002770734],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015339194,0.00020989003,0.0004014983,0.0007246105,0.000512903,0.00030932677,0.00069877855,0.00010697547,0.0025322041],"category_scores_gemma":[0.0054725744,0.00018100164,0.00007269012,0.0011343134,0.00025528035,0.0005542501,0.0005124318,0.00044952863,0.00041269444],"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.00002006038,0.0010093987,0.000058260917,0.0013311452,0.00013417457,0.00000777518,0.014396833,0.04388083,0.044317022,0.87618,0.010988409,0.007676117],"study_design_scores_gemma":[0.0009141345,0.00032732717,0.00007285264,0.0002752216,0.000017163862,0.000033184486,0.014364421,0.57410306,0.07864513,0.3301489,0.00048032583,0.0006182829],"about_ca_topic_score_codex":0.00009036687,"about_ca_topic_score_gemma":0.000038932612,"teacher_disagreement_score":0.54603106,"about_ca_system_score_codex":0.00009640416,"about_ca_system_score_gemma":0.0001607059,"threshold_uncertainty_score":0.9983796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9148378,0.000092958835,0.06134408,0.0011413429,0.00001571134,0.00039647537,0.000015373433,0.000015985477,0.022140289],"genre_scores_gemma":[0.9765962,0.000011018531,0.018297484,0.000006545664,0.00002670801,0.00007157518,0.000003453641,0.0000062816666,0.0049807457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979811,0.00018834963,0.00052384473,0.0001938737,0.00095967465,0.00015320757],"domain_scores_gemma":[0.9977456,0.0012636483,0.00004997673,0.0004895518,0.00040618965,0.00004506353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041465187,0.000060559563,0.0001582174,0.00027933635,0.00051669887,0.00024127447,0.00034211393,0.000038411174,0.00025903498],"category_scores_gemma":[0.00064362714,0.00004470868,0.000030873038,0.0005192365,0.00027194098,0.000167077,0.00015137867,0.0001338182,0.00019955586],"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.000002441069,0.00024833102,0.00029431362,0.000011574563,0.0000053445133,4.4315655e-7,0.0008042545,0.0049043116,0.011565203,0.97766364,0.0012548965,0.0032452547],"study_design_scores_gemma":[0.00020403418,0.00006372156,0.0024302537,0.00003020794,0.0000062981817,0.000011147283,0.0042606327,0.099289425,0.02356805,0.86702657,0.0029969525,0.00011268258],"about_ca_topic_score_codex":0.00010091053,"about_ca_topic_score_gemma":0.00009715928,"teacher_disagreement_score":0.11063704,"about_ca_system_score_codex":0.00002717952,"about_ca_system_score_gemma":0.00004919272,"threshold_uncertainty_score":0.3974082},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002049018,0.000031352527,0.99203753,0.003865556,0.000013066706,0.00071095664,0.000056984336,0.000037484737,0.0011980445],"genre_scores_gemma":[0.3960365,0.000008124637,0.6028906,0.000010319607,0.000018673181,0.00024141425,0.000111724454,0.0000058241703,0.000676788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885297,0.000062128594,0.00038653647,0.00019550034,0.00033272168,0.00017016963],"domain_scores_gemma":[0.99811596,0.00042202527,0.000044446,0.0002932636,0.0010760465,0.000048286118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994016,0.0000671629,0.00012706756,0.00032343954,0.0004964239,0.00029951672,0.00027336826,0.00003889916,0.00003256092],"category_scores_gemma":[0.00024855323,0.000060121038,0.000044381883,0.0006714138,0.00016663267,0.00026132492,0.0000739058,0.000070291884,0.000008030986],"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":[2.4832053e-7,0.00025991027,0.00002635687,0.000056505072,0.000017061284,7.8141895e-8,0.00050012453,0.021394188,0.0025399572,0.97452474,0.0002726225,0.00040818643],"study_design_scores_gemma":[0.00021017806,0.00004020341,0.00013643326,0.000023880064,0.000009507292,0.000004055077,0.00026239737,0.9375185,0.0005604354,0.060133956,0.0010172471,0.00008326025],"about_ca_topic_score_codex":0.000079806065,"about_ca_topic_score_gemma":0.00007961901,"teacher_disagreement_score":0.9161243,"about_ca_system_score_codex":0.00002333473,"about_ca_system_score_gemma":0.00015140371,"threshold_uncertainty_score":0.38181415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069128056,0.000019293226,0.9848978,0.005593639,0.000032079257,0.0006022069,0.0000047411845,0.000018646635,0.0019188168],"genre_scores_gemma":[0.09992158,0.000025022264,0.89612377,0.0000350927,0.00001682844,0.00023389801,0.000006448874,0.000007781133,0.0036295864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984607,0.00016973751,0.00041883945,0.0002588659,0.0004342692,0.00025756663],"domain_scores_gemma":[0.99811333,0.00054706493,0.00003576003,0.00045989215,0.000751495,0.00009246525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024454694,0.00008316593,0.0002028203,0.0005672827,0.00019172944,0.00019165661,0.000671907,0.00004360499,0.00013394404],"category_scores_gemma":[0.0011509877,0.00007495198,0.000055151228,0.0017609393,0.00004127878,0.0003228112,0.00023465444,0.00010201448,0.000038092116],"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.000005602806,0.00032853466,0.0003783358,0.000040534527,0.000025077557,6.6201824e-7,0.0019233327,0.15412103,0.0029857561,0.8392646,0.00022406448,0.0007024742],"study_design_scores_gemma":[0.00019537665,0.00005577598,0.00027044513,0.000023272449,0.0000032594612,0.0000018734263,0.00020974148,0.9907671,0.0026322568,0.0037078136,0.0020497877,0.00008329142],"about_ca_topic_score_codex":0.00010383886,"about_ca_topic_score_gemma":0.00021769505,"teacher_disagreement_score":0.8366461,"about_ca_system_score_codex":0.00006947727,"about_ca_system_score_gemma":0.00018432087,"threshold_uncertainty_score":0.30564532},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035862364,0.00010565722,0.9567405,0.000032186916,0.00002347946,0.0008149324,0.0000014822368,0.00031332346,0.0061060702],"genre_scores_gemma":[0.34950462,0.000038521786,0.6498778,9.148102e-7,0.000020281643,0.00024034876,0.0000010151176,0.00002787457,0.00028859987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902576,0.000034083147,0.00021459862,0.00011620314,0.00029183686,0.00031750326],"domain_scores_gemma":[0.99924254,0.00010927843,0.0000103380935,0.0003823453,0.00021438982,0.00004108899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054926,0.000096717624,0.00014513652,0.00011949661,0.00017778897,0.000021104102,0.00021922195,0.00008417294,0.000118106946],"category_scores_gemma":[0.00015613875,0.000076460885,0.000017444205,0.0005754052,0.00025572107,0.00011956452,0.00008486825,0.0002827388,0.00007423425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000162162,0.00007597928,0.000008570054,0.00010786243,0.000035825313,0.00000381847,0.00057870476,0.95928955,0.0035612914,0.03450351,0.0003845466,0.0014341385],"study_design_scores_gemma":[0.00018355345,0.000349099,0.00003207932,0.00013155316,0.000008761086,0.000015514457,0.0002685801,0.94096845,0.03785884,0.019850057,0.00016027897,0.00017319997],"about_ca_topic_score_codex":0.000005408745,"about_ca_topic_score_gemma":0.00003270272,"teacher_disagreement_score":0.31364226,"about_ca_system_score_codex":0.00007499673,"about_ca_system_score_gemma":0.000019524596,"threshold_uncertainty_score":0.31179842},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42118213,0.000071580005,0.50886315,0.0025389413,0.00012538697,0.0038292473,0.000041970365,0.00010834529,0.063239284],"genre_scores_gemma":[0.6627735,0.000050480474,0.3349367,0.000033174765,0.000054583805,0.0006101553,0.000043305005,0.000028924005,0.001469207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708986,0.0006672453,0.00088267826,0.000256495,0.00062206417,0.00048163795],"domain_scores_gemma":[0.99668044,0.0004729073,0.000083063875,0.0005979215,0.0019996406,0.00016599991],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029692221,0.00014197861,0.00030360147,0.00036418973,0.0020263647,0.000036332945,0.0002455593,0.0001399825,0.0015521747],"category_scores_gemma":[0.0008678079,0.000103055565,0.00004570445,0.00073999166,0.00018171842,0.00029827873,0.00009689776,0.00065936893,0.00019495634],"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.00041425572,0.0019230585,0.006652791,0.0017440749,0.00028807163,0.000015099657,0.13757265,0.07430843,0.005026625,0.77010244,0.00092570845,0.001026828],"study_design_scores_gemma":[0.007469069,0.0015969679,0.0030280692,0.0023467797,0.000120496545,0.000018490464,0.08494646,0.8858303,0.0052836435,0.007197451,0.0012787648,0.0008835454],"about_ca_topic_score_codex":0.00046198146,"about_ca_topic_score_gemma":0.0009365405,"teacher_disagreement_score":0.8115218,"about_ca_system_score_codex":0.000110967834,"about_ca_system_score_gemma":0.0009019334,"threshold_uncertainty_score":0.99936056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7514142,0.0005455809,0.22415885,0.0075441445,0.00009612895,0.0015536371,0.000021700114,0.0001709724,0.014494786],"genre_scores_gemma":[0.82066023,0.000059435413,0.17270824,0.000025930067,0.00001335917,0.00009113029,0.0000016593104,0.000023212839,0.0064168056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972693,0.00028851873,0.000465305,0.00040870172,0.001006282,0.0005618962],"domain_scores_gemma":[0.9975439,0.0004992851,0.000026811385,0.0010696722,0.00060138485,0.00025896984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019525744,0.00014840582,0.00025566813,0.0007725695,0.00043077275,0.0002797381,0.001267283,0.000084102925,0.00024250703],"category_scores_gemma":[0.0010881596,0.00013090349,0.00005645953,0.0018129182,0.00029844927,0.0005984829,0.00086060865,0.000495355,0.00039761263],"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.00000641667,0.00040256203,0.00005846655,0.000087305256,0.000035825808,0.0000137189845,0.009370035,0.0015199678,0.016922861,0.96194005,0.001031544,0.0086112255],"study_design_scores_gemma":[0.0005972114,0.000610161,0.00020371568,0.00017345657,0.0000049756068,0.00009068654,0.0011996777,0.75389576,0.01169757,0.23058641,0.0005997239,0.0003406725],"about_ca_topic_score_codex":0.000031706266,"about_ca_topic_score_gemma":0.00003641442,"teacher_disagreement_score":0.7523758,"about_ca_system_score_codex":0.00006954653,"about_ca_system_score_gemma":0.000059849528,"threshold_uncertainty_score":0.53380895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4629253,0.00020092847,0.5290035,0.0005350445,0.00009280776,0.0017884562,0.000050193015,0.000032880485,0.0053709233],"genre_scores_gemma":[0.69989717,0.00003319809,0.29886958,0.000004184979,0.000027958678,0.000018479437,0.000004319488,0.000029777471,0.0011153085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967458,0.00021241348,0.0009963225,0.00016727361,0.0015552151,0.0003229691],"domain_scores_gemma":[0.99531275,0.0016969173,0.00017508976,0.0006318158,0.0021176336,0.000065805616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038082602,0.000117331,0.00035641456,0.00045994724,0.00020635047,0.000023790195,0.00060119067,0.000101954836,0.000094235285],"category_scores_gemma":[0.0040195156,0.00008572132,0.000108953034,0.0012209855,0.00056295097,0.00021687453,0.00028170078,0.00034599775,0.0000065527947],"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.00006033386,0.0020689126,0.00028133442,0.0021379641,0.00014986709,0.0000023930568,0.007698478,0.05172866,0.06334552,0.86813605,0.00074509945,0.0036453865],"study_design_scores_gemma":[0.0013930589,0.00026582257,0.0007099123,0.0006650225,0.0000374807,0.000012379384,0.0061409003,0.29775783,0.47099742,0.22169225,0.00007493384,0.0002529768],"about_ca_topic_score_codex":0.000035111578,"about_ca_topic_score_gemma":0.0000717081,"teacher_disagreement_score":0.6464438,"about_ca_system_score_codex":0.000063742205,"about_ca_system_score_gemma":0.0002273887,"threshold_uncertainty_score":0.48120257},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1960595,0.00029584416,0.7964155,0.00019802991,0.00004569768,0.0016899471,0.00011103939,0.00006320276,0.0051212106],"genre_scores_gemma":[0.34882802,0.00016061925,0.64763474,0.0000029161115,0.000028251296,0.00015180555,0.000024656454,0.00006248232,0.0031065368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960477,0.000324881,0.0012529257,0.00029011886,0.0015806915,0.0005037149],"domain_scores_gemma":[0.9953815,0.0021654821,0.00016550622,0.00071985,0.0014374488,0.00013021145],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002582384,0.00018146311,0.00059472094,0.00052394666,0.00033964985,0.00008390332,0.0005783876,0.0001104521,0.0012991204],"category_scores_gemma":[0.0073119886,0.00016211305,0.00011251651,0.00097580557,0.0003548115,0.00024497084,0.00023648226,0.0003888319,0.0000365999],"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.00015113816,0.016990239,0.00034624126,0.01039734,0.0010032319,0.000009919021,0.049342047,0.03623422,0.3446092,0.5003008,0.021581143,0.019034455],"study_design_scores_gemma":[0.0020805073,0.0001567599,0.000004495143,0.00032908088,0.000027367752,0.000007772808,0.0019778498,0.88073945,0.06961699,0.044703823,0.00009475474,0.00026113153],"about_ca_topic_score_codex":0.00001984293,"about_ca_topic_score_gemma":0.0000091228785,"teacher_disagreement_score":0.84450525,"about_ca_system_score_codex":0.00007864443,"about_ca_system_score_gemma":0.000040509207,"threshold_uncertainty_score":0.9996138},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587553,0.00009207532,0.0026491813,0.0007670414,0.000036384983,0.0005859722,0.000015008778,0.000021546593,0.037077475],"genre_scores_gemma":[0.95944256,0.000039594204,0.02996298,0.00001376484,0.00002476064,0.00003200709,0.0000013070039,0.000023263312,0.010459761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983438,0.00034598517,0.0004410955,0.00014889668,0.0004917142,0.00022845448],"domain_scores_gemma":[0.99762565,0.000992397,0.000044718465,0.0009131926,0.00038868628,0.000035344925],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018699903,0.0000977513,0.0002464822,0.00010072694,0.00025655722,0.000011848368,0.00046921056,0.00009570808,0.0027045999],"category_scores_gemma":[0.0013068384,0.000059768954,0.000100402045,0.00038671264,0.0007571719,0.000081588936,0.00010662335,0.0002863179,0.00006628939],"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.00002325563,0.00045588202,0.000014762279,0.000118045224,0.000030198047,9.948475e-7,0.0051134266,0.00047729,0.010606787,0.9809809,0.00038471556,0.0017937816],"study_design_scores_gemma":[0.0002568533,0.00007159919,0.00007108647,0.00013810112,0.0000164879,0.000014977739,0.0022935772,0.0037299485,0.030242404,0.9628474,0.00023740991,0.000080160986],"about_ca_topic_score_codex":0.000010990358,"about_ca_topic_score_gemma":0.000034321954,"teacher_disagreement_score":0.027313799,"about_ca_system_score_codex":0.000019126646,"about_ca_system_score_gemma":0.00007774802,"threshold_uncertainty_score":0.9982071},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950234,0.00028162578,0.0001005609,0.0013133774,0.00003130759,0.0003805743,5.711608e-7,0.000013152943,0.002855401],"genre_scores_gemma":[0.99604917,0.00007702162,0.003152629,0.000026552167,0.00008741434,0.000037059315,0.0000015067027,0.000008994373,0.0005596819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991991,0.0000103156735,0.00022156893,0.0001259475,0.0003142799,0.00012882114],"domain_scores_gemma":[0.9994537,0.000008187916,0.00003561991,0.00017218587,0.00032111,0.000009156477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249739,0.00006544422,0.00011914911,0.0003281135,0.00017125583,0.00011334174,0.000108993656,0.00002219287,0.00001841421],"category_scores_gemma":[0.00040335412,0.000053490414,0.000015196398,0.00026313777,0.00037806245,0.0005022039,0.00021359559,0.00006872314,0.0000069625903],"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.000021128766,0.0005592258,0.0010782526,0.004915656,0.000049429942,0.0000012124897,0.0073000416,0.0024871544,0.0418104,0.94080806,0.0004308827,0.00053855637],"study_design_scores_gemma":[0.0056481487,0.000945502,0.009635761,0.010242416,0.0003334878,0.0000551608,0.22763802,0.24603061,0.3155346,0.16868865,0.012909101,0.0023385591],"about_ca_topic_score_codex":0.0004781683,"about_ca_topic_score_gemma":0.000107645144,"teacher_disagreement_score":0.7721194,"about_ca_system_score_codex":0.000017087184,"about_ca_system_score_gemma":0.00002481978,"threshold_uncertainty_score":0.21812758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85303134,0.000039021856,0.14026788,0.0027301942,0.000024573063,0.0011683009,0.000010420173,0.000094613315,0.0026336282],"genre_scores_gemma":[0.9418397,0.000016356862,0.053618595,0.00013939409,0.00041800545,0.00038981868,0.00008728461,0.000056288318,0.0034345773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.000026024003,0.0003682814,0.00023174203,0.00039302252,0.00030798244],"domain_scores_gemma":[0.99834967,0.0003479738,0.000060181275,0.00043464117,0.0007900995,0.000017410754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981014,0.0001356929,0.00023376118,0.0003099232,0.0008008602,0.0002872153,0.00034046586,0.000046778536,0.00033561565],"category_scores_gemma":[0.0002875634,0.00010444223,0.000058131536,0.0011122676,0.00011205044,0.0011265579,0.00012285158,0.00016234396,0.00006936338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050540846,0.00036688434,0.00007225032,0.00058801164,0.000051261304,0.0000010221308,0.00037632862,0.82741797,0.0010835594,0.16795042,0.00010635164,0.0019354131],"study_design_scores_gemma":[0.00037787823,0.000014048819,0.00003588305,0.00014580051,0.000040898372,8.325419e-7,0.00077591825,0.97904307,0.00016044707,0.01869139,0.0005825332,0.00013131702],"about_ca_topic_score_codex":0.00016358202,"about_ca_topic_score_gemma":0.00069032586,"teacher_disagreement_score":0.1516251,"about_ca_system_score_codex":0.000028828927,"about_ca_system_score_gemma":0.000025868936,"threshold_uncertainty_score":0.615965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7794095,0.00007589578,0.21159439,0.0009191085,0.00006358238,0.0017754239,0.00003396781,0.000052638134,0.006075462],"genre_scores_gemma":[0.93109846,0.00003445625,0.065966,0.00008963067,0.0004132348,0.00012453548,0.00010352518,0.000027074355,0.0021430727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986277,0.000027963779,0.0005119482,0.00018352852,0.00036935534,0.00027947073],"domain_scores_gemma":[0.99854606,0.0001831493,0.00020342882,0.00035184517,0.0007040995,0.000011385931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020630658,0.00010410779,0.00027208636,0.00038856224,0.00029853985,0.00014138034,0.00033236566,0.000037347076,0.000079620884],"category_scores_gemma":[0.00059295224,0.00009899751,0.000081479535,0.0010261133,0.00007277338,0.0006267132,0.0000998407,0.000094551535,0.00002586794],"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.00010217996,0.0005532798,0.00008757782,0.0012541199,0.00014273496,0.0000021275248,0.00035807502,0.075309075,0.106500946,0.8119151,0.00059763895,0.0031771578],"study_design_scores_gemma":[0.0015856061,0.00017362351,0.0013635366,0.000817423,0.00028404815,0.0000013762328,0.0009515547,0.86243755,0.008108069,0.11243828,0.0113660665,0.00047286437],"about_ca_topic_score_codex":0.0000076259225,"about_ca_topic_score_gemma":0.0000066531093,"teacher_disagreement_score":0.7871285,"about_ca_system_score_codex":0.000020288495,"about_ca_system_score_gemma":0.000014689195,"threshold_uncertainty_score":0.40370014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.939289,0.00028589327,0.04190041,0.00021393104,0.00003925965,0.0017090429,0.000023993678,0.00026412384,0.016274352],"genre_scores_gemma":[0.78017634,0.0010562063,0.20905052,0.00001052149,0.000030768853,0.00034723454,0.000029327764,0.000040934494,0.009258158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988071,0.00008648276,0.0003793172,0.00017931123,0.0003187907,0.00022901065],"domain_scores_gemma":[0.99915165,0.00018309317,0.000010205914,0.00035698878,0.00023463085,0.00006341876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282848,0.000098559685,0.00018815963,0.00010979735,0.00015489683,0.000051089733,0.00009316282,0.00006645668,0.0006920364],"category_scores_gemma":[0.00021775845,0.00008943219,0.0000670443,0.00023044816,0.00016028513,0.00018213224,0.000038409977,0.00017057691,0.00003206305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006988562,0.00019068786,0.000021695152,0.00029090542,0.00007718689,0.0000013018376,0.0018901575,0.9900588,0.00064694445,0.003557485,0.002732367,0.0004625965],"study_design_scores_gemma":[0.0007422344,0.00012660207,0.00012942577,0.000101477934,0.000014319607,0.0000064618457,0.00092705776,0.99525446,0.0012268637,0.00033102027,0.0010386645,0.00010143504],"about_ca_topic_score_codex":0.000018206772,"about_ca_topic_score_gemma":0.000023779887,"teacher_disagreement_score":0.16715011,"about_ca_system_score_codex":0.00006960631,"about_ca_system_score_gemma":0.000042037933,"threshold_uncertainty_score":0.7577313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52508384,0.00003695423,0.4639417,0.00087835797,0.000021520224,0.000990324,0.000039761442,0.00003287632,0.008974667],"genre_scores_gemma":[0.7691638,0.000030072903,0.2304259,0.0000086930195,0.000011345893,0.00007754617,0.000011688033,0.00001623056,0.0002547344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979626,0.00012775003,0.0008658782,0.0001504446,0.0006857368,0.00020761706],"domain_scores_gemma":[0.99799556,0.00052905444,0.00009453253,0.0003333401,0.00097354164,0.00007397992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018309222,0.00013122817,0.0003702812,0.00038227515,0.00020990848,0.00007701636,0.00019308012,0.000099087185,0.0001768568],"category_scores_gemma":[0.0014002891,0.00010649889,0.00006775763,0.00046833942,0.0003037964,0.00031178244,0.00003216038,0.00019276401,0.000012049751],"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.000006197183,0.0007877773,0.0000055252112,0.0006577671,0.00003089765,2.0785063e-7,0.0032027648,0.00026199795,0.016875403,0.9779468,0.00005722862,0.00016744355],"study_design_scores_gemma":[0.0013528875,0.00020767063,0.00003401786,0.00023854595,0.000036604702,0.000012033592,0.0009666624,0.07865908,0.04836368,0.86999035,0.000025815212,0.00011266836],"about_ca_topic_score_codex":0.000055123677,"about_ca_topic_score_gemma":0.000032161362,"teacher_disagreement_score":0.24407995,"about_ca_system_score_codex":0.000046329984,"about_ca_system_score_gemma":0.00012820408,"threshold_uncertainty_score":0.43428987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982115,0.0002354774,0.0067275795,0.0028400884,0.000038948598,0.0007962104,0.0000033858762,0.000052294243,0.007191054],"genre_scores_gemma":[0.9978937,0.000015401214,0.0010635385,0.00019650828,0.00011711953,0.000056727877,0.000012984616,0.000015357266,0.0006286822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985066,0.0000613357,0.0004846459,0.0002135347,0.00046772233,0.0002661841],"domain_scores_gemma":[0.9985586,0.0001961313,0.000066662804,0.00041135238,0.0007525206,0.000014780436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022482069,0.00012099922,0.0003118584,0.00060586084,0.00021850121,0.00038538527,0.00030662384,0.000064195825,0.00008101034],"category_scores_gemma":[0.0006347444,0.00010817954,0.000035569057,0.0011465909,0.000060719674,0.00097327173,0.00011215342,0.00020184934,0.00011741967],"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.000017156794,0.00024627958,0.00019251436,0.00043688572,0.00002256194,0.0000055332275,0.00034572728,0.08541654,0.0060933214,0.90691453,0.00006694457,0.00024201334],"study_design_scores_gemma":[0.00052681036,0.000017661629,0.0005065583,0.0002504735,0.000026234307,0.000002099825,0.0017079666,0.9536304,0.00028140785,0.042534713,0.00035097558,0.00016474152],"about_ca_topic_score_codex":0.00058854447,"about_ca_topic_score_gemma":0.0005974564,"teacher_disagreement_score":0.86821383,"about_ca_system_score_codex":0.000040126255,"about_ca_system_score_gemma":0.000031651056,"threshold_uncertainty_score":0.44114336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035285975,0.0000099539875,0.9847341,0.0019390782,0.0000863886,0.00032441432,0.000018407343,0.00004227708,0.009316771],"genre_scores_gemma":[0.47069886,0.0000061770584,0.51907533,0.00003340109,0.00007108659,0.0001832673,0.000055110715,0.000010873217,0.009865887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998528,0.00011917634,0.00035537226,0.00023632993,0.0005528713,0.00020826774],"domain_scores_gemma":[0.9975843,0.00048461423,0.00003873319,0.00046198326,0.0013468002,0.000083592364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016435483,0.0000796865,0.000151887,0.0003885549,0.00060703076,0.00026528497,0.00049236475,0.00005025536,0.00012875779],"category_scores_gemma":[0.0008134853,0.000071802584,0.00008539883,0.00092270394,0.000056380333,0.0003753401,0.0000892052,0.00011149665,0.000060117814],"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.0000021623637,0.00034417427,0.00006621899,0.00004016588,0.000045184614,5.0169188e-8,0.00035750726,0.05794239,0.0013172308,0.9372753,0.001980282,0.0006293136],"study_design_scores_gemma":[0.00020419066,0.00008720906,0.00032963307,0.000013607299,0.000008272561,0.000001413662,0.00006935455,0.9806073,0.00063098554,0.014957861,0.0030116923,0.00007850491],"about_ca_topic_score_codex":0.00004248595,"about_ca_topic_score_gemma":0.00015808648,"teacher_disagreement_score":0.9226649,"about_ca_system_score_codex":0.00003471698,"about_ca_system_score_gemma":0.00015271398,"threshold_uncertainty_score":0.46688512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31851512,0.0003680726,0.64688087,0.0008845471,0.000028900795,0.0006600109,0.00024459185,0.000013337831,0.03240453],"genre_scores_gemma":[0.98949635,0.00002394221,0.009555585,0.000016913453,0.000026340284,0.000071067996,0.0000083135665,0.000015975551,0.00078549475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880075,0.000008571903,0.000634283,0.00017996914,0.00013915256,0.00023725977],"domain_scores_gemma":[0.99840295,0.0006948937,0.00014213602,0.0004490069,0.000269278,0.000041703617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029247517,0.000077100136,0.00021905902,0.00019891608,0.00021952557,0.00004190846,0.00038669654,0.00005896054,0.00010450279],"category_scores_gemma":[0.002383182,0.000051849227,0.000045209064,0.0006816188,0.00018230024,0.00007157626,0.000092541166,0.00023323967,0.00011137479],"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.000006939813,0.00026166823,0.00006503103,0.000045154517,0.000013562697,1.06833966e-7,0.0011917601,0.00021744387,0.0019726432,0.9951367,0.00085502793,0.0002339628],"study_design_scores_gemma":[0.0005065214,0.00040955492,0.0012421752,0.00012547935,0.000010705366,0.0000022640413,0.0016283314,0.071476705,0.018306654,0.90309983,0.0028977518,0.00029403323],"about_ca_topic_score_codex":0.00025742722,"about_ca_topic_score_gemma":0.000022056214,"teacher_disagreement_score":0.6709812,"about_ca_system_score_codex":0.000034789045,"about_ca_system_score_gemma":0.00004263505,"threshold_uncertainty_score":0.28530636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027809277,0.00002795787,0.9619757,0.0022935949,0.000057104156,0.001723886,0.000023305392,0.000031834574,0.00605736],"genre_scores_gemma":[0.48764536,0.00004192169,0.51119643,0.000013374241,0.00001625764,0.0002441033,0.000010751268,0.000019819112,0.00081199897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963108,0.0002126725,0.0006637246,0.000459486,0.0020188629,0.00033445487],"domain_scores_gemma":[0.9892951,0.004460787,0.0002822295,0.0032239757,0.0026403572,0.00009752711],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032582833,0.00023775273,0.00042573042,0.0005130506,0.0006890981,0.0011338663,0.003825783,0.00013688157,0.000036218436],"category_scores_gemma":[0.014389807,0.00014990625,0.00007118355,0.0006598789,0.00036338318,0.0002568683,0.002433891,0.0007571104,0.00004305261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010118178,0.00017875254,0.00001894738,0.0009360077,0.000048563736,0.0000010917297,0.0029006165,0.8835837,0.000039474904,0.11173988,0.000353363,0.00018946399],"study_design_scores_gemma":[0.00013997202,0.00035842953,0.00013593948,0.002429406,0.000016125648,0.0000020485256,0.00027485806,0.98162425,0.0017507711,0.0130485315,0.000031280368,0.0001884222],"about_ca_topic_score_codex":0.000059823953,"about_ca_topic_score_gemma":0.00006126883,"teacher_disagreement_score":0.45983607,"about_ca_system_score_codex":0.00007494747,"about_ca_system_score_gemma":0.0012833445,"threshold_uncertainty_score":0.999903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034729003,0.0000090849935,0.990769,0.0004788826,0.00002881854,0.0007229717,0.00003840495,0.000045484157,0.0044344086],"genre_scores_gemma":[0.41245726,0.0000041365624,0.58667505,0.00001199605,0.00001129829,0.00030571522,0.000035439847,0.0000054189964,0.0004936795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987373,0.00009747177,0.00034139343,0.00022277879,0.0004053655,0.00019572269],"domain_scores_gemma":[0.99738806,0.00023587588,0.000043399068,0.0004310451,0.0018319482,0.00006968027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006518,0.00007683793,0.00015204294,0.00030092185,0.0003938577,0.00013002139,0.0005649809,0.000048935202,0.0001360177],"category_scores_gemma":[0.00041858788,0.000066526714,0.00008395935,0.0008562493,0.00011949913,0.00048711122,0.00014443492,0.00009610371,0.00003061391],"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.000003301877,0.0010777505,0.000091262526,0.000054736516,0.00007008826,3.8149997e-7,0.00484194,0.006439011,0.00042972522,0.98615456,0.00021877211,0.00061850174],"study_design_scores_gemma":[0.00023850489,0.00010755477,0.0005903392,0.000017717974,0.000010224141,0.0000017202957,0.00047802867,0.9565175,0.0022426292,0.039670773,0.00003803557,0.00008694041],"about_ca_topic_score_codex":0.00010626179,"about_ca_topic_score_gemma":0.00004607679,"teacher_disagreement_score":0.95007855,"about_ca_system_score_codex":0.000034999543,"about_ca_system_score_gemma":0.00018562989,"threshold_uncertainty_score":0.3029275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044111878,0.000047429075,0.95112437,0.0022564372,0.000021945434,0.00087360374,0.00004480828,0.00001285483,0.001506689],"genre_scores_gemma":[0.69616205,0.000010244858,0.30150148,0.000022836595,0.00004844979,0.000072263276,0.000009126293,0.000014158948,0.0021594302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973286,0.00038220818,0.00045710264,0.00022971032,0.0013683324,0.00023407835],"domain_scores_gemma":[0.99396825,0.001817665,0.000080287406,0.00038864755,0.003591456,0.00015371999],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0074982718,0.00009925648,0.0002736037,0.0008280907,0.00031052897,0.00045193022,0.00029457032,0.000059606286,0.000009951143],"category_scores_gemma":[0.00874678,0.000067676985,0.00003356341,0.0011045387,0.00016399761,0.00043726742,0.00005125966,0.00009543439,0.000010420141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009262503,0.00011670346,0.00007589139,0.000014125343,0.0000315377,4.7298295e-7,0.0071766586,0.67925733,0.0009335354,0.3089528,0.0012855887,0.0020627151],"study_design_scores_gemma":[0.0011226104,0.00035250554,0.000088487985,0.000024734949,0.00001655513,0.000011841687,0.004298586,0.95444727,0.00058331806,0.038642753,0.00032780846,0.00008354407],"about_ca_topic_score_codex":0.00042179183,"about_ca_topic_score_gemma":0.00041464614,"teacher_disagreement_score":0.65205014,"about_ca_system_score_codex":0.00006026918,"about_ca_system_score_gemma":0.00075037876,"threshold_uncertainty_score":0.999603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8592291,0.00071284466,0.06296971,0.0012210945,0.00006446637,0.0013035377,0.0003124339,0.000030381641,0.07415643],"genre_scores_gemma":[0.962285,0.000010197445,0.02732773,0.000010315559,0.00009419749,0.00018668988,0.000029135315,0.000023335077,0.010033404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988719,0.000020047064,0.0005593342,0.00021063758,0.00009828677,0.00023979676],"domain_scores_gemma":[0.99906516,0.00015734187,0.00007878205,0.0003729837,0.0002866042,0.000039135262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013239853,0.000092236325,0.0003362153,0.0003839339,0.00024965563,0.000109403445,0.0002179676,0.000052637806,0.0003604722],"category_scores_gemma":[0.00035191685,0.000081404156,0.00009019784,0.00053230615,0.00013124595,0.00012006371,0.000052987376,0.000092666254,0.000059071823],"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.000011780455,0.0001716861,0.00083673565,0.0001084272,0.000031352964,5.202236e-7,0.00028249156,0.000952089,0.00007751326,0.9948146,0.0026460728,0.000066745335],"study_design_scores_gemma":[0.0020332066,0.0007077421,0.0092867715,0.00019620928,0.00003570819,0.000013884791,0.00117771,0.3503235,0.0012890056,0.54841125,0.08577799,0.00074701925],"about_ca_topic_score_codex":0.000967278,"about_ca_topic_score_gemma":0.0011998495,"teacher_disagreement_score":0.44640332,"about_ca_system_score_codex":0.000048551723,"about_ca_system_score_gemma":0.00006196274,"threshold_uncertainty_score":0.39469177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190459,0.0004471981,0.070217416,0.0009508445,0.00003921748,0.00051008846,0.00002693066,0.00004931493,0.0087130815],"genre_scores_gemma":[0.6547421,0.000028200355,0.3428582,0.000011538029,0.000099406636,0.00005071173,0.0000031832046,0.000017289305,0.0021893156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982672,0.000075809636,0.00052783807,0.00016512407,0.00064376683,0.00032026734],"domain_scores_gemma":[0.99817085,0.0007204821,0.000051600426,0.0003074668,0.00066188816,0.00008771669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021004144,0.00011841949,0.0002811667,0.00034875007,0.00031841532,0.00012783916,0.00020095328,0.000063360516,0.000225015],"category_scores_gemma":[0.0030188477,0.0000969554,0.000037023834,0.0004553972,0.00019491231,0.00025411416,0.00017714637,0.00020710404,0.000030451405],"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.000012734316,0.0007306486,0.00014074423,0.002266333,0.00009615254,0.000003607246,0.017334053,0.0019206726,0.0016679139,0.9642694,0.0014764447,0.0100813145],"study_design_scores_gemma":[0.00090817636,0.00026282566,0.000051324463,0.00040978333,0.00005238537,0.00008218505,0.0075249695,0.89616895,0.01643565,0.076547556,0.0011668482,0.00038932374],"about_ca_topic_score_codex":0.0000667563,"about_ca_topic_score_gemma":0.00012898105,"teacher_disagreement_score":0.8942483,"about_ca_system_score_codex":0.000038869664,"about_ca_system_score_gemma":0.000097458855,"threshold_uncertainty_score":0.39537266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011295068,0.00021393386,0.9829191,0.0007991864,0.000025149078,0.0007477143,6.2477284e-7,0.000027187552,0.0039720587],"genre_scores_gemma":[0.4355773,0.00008979936,0.5639044,0.000008687676,0.000013287405,0.00010007034,0.0000010338598,0.000004777941,0.00030066236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981783,0.00050831464,0.00045357656,0.00017344602,0.00044814852,0.00023819656],"domain_scores_gemma":[0.9964067,0.0007916619,0.000043751832,0.0012152831,0.0014805236,0.00006211852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028440843,0.00007740418,0.0001995919,0.000130369,0.00026744144,0.00013668727,0.0013059893,0.000043182597,0.00020880558],"category_scores_gemma":[0.00059598504,0.00006530146,0.000043570853,0.0010388978,0.0002054103,0.000378839,0.00059786666,0.00020755883,0.000058370333],"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.0000017541107,0.0005618198,0.00006589479,0.00010040067,0.000028234219,2.1869577e-7,0.0031721124,0.20308027,0.0068021673,0.7698559,0.0047211484,0.011610045],"study_design_scores_gemma":[0.00010557544,0.00007182695,0.00018277182,0.00005402368,0.0000013907435,0.0000012453312,0.00011622844,0.982056,0.004389037,0.012875274,0.000079294994,0.00006731947],"about_ca_topic_score_codex":0.00002267272,"about_ca_topic_score_gemma":0.000013714242,"teacher_disagreement_score":0.7789757,"about_ca_system_score_codex":0.00003072599,"about_ca_system_score_gemma":0.00015224295,"threshold_uncertainty_score":0.26629162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4734502,0.000017106668,0.5207565,0.0038803574,0.000023155148,0.00026127926,9.588447e-7,0.000021908769,0.0015885619],"genre_scores_gemma":[0.8651178,0.000059984046,0.13301925,0.0001355698,0.000028467906,0.000053696753,0.0000017119186,0.00001040591,0.0015730911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798477,0.00015938221,0.00039182254,0.00018349785,0.0009886674,0.00029185112],"domain_scores_gemma":[0.9974459,0.001434012,0.00003567263,0.0005692786,0.0004732678,0.000041914816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015212226,0.0000974379,0.00013163086,0.0003734744,0.00028733554,0.00035753424,0.0008273652,0.0000463698,0.00005916406],"category_scores_gemma":[0.0014595042,0.000064306885,0.000026679158,0.0010578135,0.0001493979,0.0004203297,0.0002328607,0.00032490777,0.000084029016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033862268,0.00011356565,0.000055131895,0.000025646223,0.0000064638903,4.8413455e-7,0.0045435177,0.8931477,0.00063377095,0.09974442,0.0006279575,0.0010979779],"study_design_scores_gemma":[0.00012969297,0.0001498061,0.0005286004,0.000089523295,0.0000011992325,0.000003996066,0.00068473036,0.97970426,0.0049614115,0.013463232,0.00019496701,0.000088579],"about_ca_topic_score_codex":0.000067231136,"about_ca_topic_score_gemma":0.00031001063,"teacher_disagreement_score":0.3916676,"about_ca_system_score_codex":0.00015775175,"about_ca_system_score_gemma":0.0002975253,"threshold_uncertainty_score":0.3447711},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540159,0.00058789575,0.008008178,0.0045511997,0.00006363199,0.0011452616,0.000034384684,0.000036824444,0.031556718],"genre_scores_gemma":[0.9881623,0.00046655297,0.0035114104,0.00010474942,0.00007057734,0.00016160593,0.0000039865986,0.000022644712,0.0074962005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756813,0.0004688063,0.00058907294,0.00018942011,0.0008504977,0.0003340473],"domain_scores_gemma":[0.9910473,0.0074188937,0.000075244214,0.0007056287,0.00069840753,0.00005452265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064993524,0.00014485659,0.00035389417,0.00016009567,0.00081837235,0.00021307233,0.0004428203,0.000074142445,0.00026580182],"category_scores_gemma":[0.006213707,0.00007570574,0.00007534714,0.0008088858,0.00084252405,0.00009036918,0.00020891908,0.0003876787,0.000053354426],"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.000027180033,0.0001855169,0.000022926462,0.00028716368,0.000061094775,0.000004749585,0.009448086,0.000059214937,0.000068138484,0.98759294,0.0019130565,0.0003299628],"study_design_scores_gemma":[0.0014180944,0.000100215366,0.00004510878,0.00018096497,0.000040240415,0.00019091068,0.023003967,0.016873015,0.0010370326,0.954313,0.0025785787,0.00021888744],"about_ca_topic_score_codex":0.00022270165,"about_ca_topic_score_gemma":0.00008925316,"teacher_disagreement_score":0.034146365,"about_ca_system_score_codex":0.000032777658,"about_ca_system_score_gemma":0.00011933484,"threshold_uncertainty_score":0.74388367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14180063,0.000088603694,0.8504429,0.00018201162,0.000021822587,0.0005817532,0.000006814813,0.00007097677,0.0068044863],"genre_scores_gemma":[0.8362834,0.000021707378,0.16362533,0.00001242103,0.000021312271,0.000007749486,0.000015002747,0.0000072732937,0.0000058141104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990753,0.00006853911,0.00027369306,0.00007636772,0.00033781904,0.0001683047],"domain_scores_gemma":[0.99950844,0.000072646166,0.000011200901,0.000217244,0.00017092799,0.00001956037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735169,0.00006922484,0.00010265955,0.0001412321,0.000111808855,0.00009347522,0.00017493323,0.000055645145,0.000010877621],"category_scores_gemma":[0.00017098394,0.000055621233,0.000016310145,0.00070124626,0.00003401351,0.00009961914,0.000011670064,0.00013322609,0.000002314519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.604296e-7,0.0000604429,0.000016934779,0.000049509974,0.0000022468507,0.0000014997343,0.0007972929,0.9874975,0.0027234491,0.008371017,0.0000317694,0.00044755187],"study_design_scores_gemma":[0.00006084776,0.00003666447,0.000032833803,0.000068395944,0.0000027723113,0.0000063759785,0.0006815431,0.99361306,0.0046284753,0.0008110686,0.000003234407,0.00005472034],"about_ca_topic_score_codex":0.000039155067,"about_ca_topic_score_gemma":0.0000503184,"teacher_disagreement_score":0.6944828,"about_ca_system_score_codex":0.00008534641,"about_ca_system_score_gemma":0.00003690513,"threshold_uncertainty_score":0.2268168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.687792,0.00188166,0.2230465,0.0016183377,0.00027655467,0.0054552923,0.000237738,0.00009895773,0.07959297],"genre_scores_gemma":[0.98201805,0.000029264835,0.013585968,0.0000118695325,0.00007587369,0.00031119434,0.000010995132,0.000023198047,0.0039335974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998993,0.000034627006,0.0004422307,0.00018297209,0.00007731179,0.00026986405],"domain_scores_gemma":[0.9991237,0.00022377197,0.000073988536,0.0003381616,0.0001900179,0.000050389728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017366763,0.00007826132,0.00023961533,0.00018237768,0.00024136929,0.0000826226,0.00020588569,0.000052976284,0.00020289813],"category_scores_gemma":[0.00025313368,0.00007424459,0.000048377507,0.00033743214,0.00009892087,0.00009502484,0.00002461205,0.00009721139,0.00025435834],"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.00001817738,0.00037591736,0.00035187273,0.0002720005,0.00009538872,9.610804e-7,0.0038693561,0.08406042,0.00011493839,0.9080429,0.0018507191,0.0009473283],"study_design_scores_gemma":[0.0010712128,0.000566491,0.00006231733,0.0001634954,0.000010969686,0.00002137478,0.0010502166,0.9624522,0.0009424336,0.023288144,0.010069924,0.0003012246],"about_ca_topic_score_codex":0.000035071665,"about_ca_topic_score_gemma":0.00011123763,"teacher_disagreement_score":0.8847548,"about_ca_system_score_codex":0.000047538557,"about_ca_system_score_gemma":0.000011414563,"threshold_uncertainty_score":0.3269347},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090981014,0.00014910873,0.8855104,0.0016012696,0.000032394033,0.0033892875,0.000036013666,0.00019071659,0.018109797],"genre_scores_gemma":[0.07811609,0.000033384036,0.91088,0.000031628937,0.00012218842,0.0008871465,0.000023798979,0.00007524947,0.009830497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590504,0.0003691616,0.00093810825,0.00040424647,0.0016476938,0.0007357244],"domain_scores_gemma":[0.9960974,0.00084608403,0.00006181585,0.0009333544,0.001797027,0.00026434904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036493351,0.00022215082,0.0004856216,0.0007701702,0.00041207005,0.00022371681,0.0007169063,0.00012750196,0.00029707837],"category_scores_gemma":[0.0047797463,0.00019988701,0.00010118985,0.0014829208,0.00026617077,0.00032944072,0.00039095237,0.0004868019,0.00012386749],"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.000030882373,0.0026222076,0.000009562689,0.0009189011,0.00011550759,0.000001935027,0.021289187,0.0912891,0.0035611435,0.8680344,0.0030886095,0.009038512],"study_design_scores_gemma":[0.0017205034,0.00030414,0.0000060529997,0.00023351693,0.000028194094,0.000031005406,0.010532458,0.91750455,0.022622744,0.03634788,0.010033026,0.00063592265],"about_ca_topic_score_codex":0.000038115082,"about_ca_topic_score_gemma":0.00006369074,"teacher_disagreement_score":0.83168656,"about_ca_system_score_codex":0.00023953685,"about_ca_system_score_gemma":0.00029710605,"threshold_uncertainty_score":0.81511563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39983994,0.0013592005,0.56882113,0.0042500445,0.000069617294,0.0028871833,0.000091409005,0.00014660883,0.022534907],"genre_scores_gemma":[0.6772392,0.000274021,0.31753558,0.000035982248,0.00008609535,0.00011422591,0.000010296217,0.00003215648,0.0046724402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99100554,0.00022575687,0.0010193563,0.0006615821,0.006440941,0.000646831],"domain_scores_gemma":[0.9822537,0.0069871503,0.00010329334,0.0012831091,0.009140673,0.00023212559],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0059818355,0.00021597452,0.00048393296,0.0012780024,0.00064926594,0.0007381237,0.0018506332,0.000109067754,0.00055127096],"category_scores_gemma":[0.0491695,0.00013460571,0.00005413499,0.006631904,0.0005196418,0.0011686882,0.00023314565,0.00053180766,0.0002831775],"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.0034922343,0.022072518,0.0031882317,0.0066884025,0.0004561912,0.00075075706,0.050968993,0.15153147,0.018739646,0.043355048,0.07353304,0.62522346],"study_design_scores_gemma":[0.003538978,0.005989485,0.003038308,0.0026778544,0.00003969661,0.0003287962,0.018441506,0.066169694,0.114331685,0.77573085,0.008209879,0.0015032559],"about_ca_topic_score_codex":0.000012570188,"about_ca_topic_score_gemma":0.00030748616,"teacher_disagreement_score":0.7323758,"about_ca_system_score_codex":0.00007448259,"about_ca_system_score_gemma":0.0022123354,"threshold_uncertainty_score":0.9588398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008561924,0.00013961339,0.9781038,0.0058729206,0.000049979146,0.004725069,0.00004854678,0.000080872516,0.0024172692],"genre_scores_gemma":[0.13243018,0.00005969416,0.86103487,0.00006192194,0.00008345745,0.00085800537,0.00003829605,0.000051165272,0.005382388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965124,0.00022891835,0.00084886217,0.0003096245,0.0015987142,0.0005014542],"domain_scores_gemma":[0.9924354,0.0046163695,0.00011935349,0.00078983844,0.0019311421,0.00010790399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033467,0.00018489802,0.00031455344,0.0003453297,0.00084634806,0.0001632348,0.0005273325,0.00011096188,0.00020437397],"category_scores_gemma":[0.0053491797,0.00012872166,0.00011599488,0.0008595352,0.00022827825,0.00026674903,0.000111699206,0.0004197195,0.000043194],"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.000058324225,0.0018582384,0.0000033719757,0.0004841113,0.00010562029,0.0000022743882,0.0035173092,0.18618315,0.011568181,0.78273225,0.0076153316,0.005871815],"study_design_scores_gemma":[0.00070440094,0.0003715957,0.000014910357,0.00019816664,0.000025059291,0.000008640113,0.0008641835,0.7040795,0.009099464,0.28421482,0.00025328554,0.00016597158],"about_ca_topic_score_codex":0.000007478956,"about_ca_topic_score_gemma":0.000024046292,"teacher_disagreement_score":0.51789635,"about_ca_system_score_codex":0.00017549424,"about_ca_system_score_gemma":0.00032561927,"threshold_uncertainty_score":0.6509511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55138636,0.00016246061,0.43380567,0.00003882213,0.00006170909,0.0015190946,0.00003571079,0.00024774313,0.012742426],"genre_scores_gemma":[0.73312026,0.000022952705,0.26657197,0.0000010445066,0.000007527212,0.00011971487,0.000004204177,0.000018821433,0.00013353198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991018,0.000028835668,0.00033920177,0.0000922186,0.00025907913,0.00017884927],"domain_scores_gemma":[0.99877924,0.00036342247,0.00002668648,0.000365875,0.00043331488,0.000031471394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542421,0.00007780576,0.00016110009,0.00026045454,0.00009597516,0.000021555581,0.00020221288,0.00005260148,0.000036198762],"category_scores_gemma":[0.0004894833,0.0000716327,0.000051043815,0.00028566082,0.00009669329,0.00007768512,0.000034704004,0.00012799958,0.000010206443],"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.000020494675,0.0006560161,0.000038430073,0.0011268244,0.0001103732,0.0000021308808,0.009996678,0.031102896,0.09184277,0.8608315,0.001901373,0.0023705112],"study_design_scores_gemma":[0.00022947574,0.00048674433,0.000036705118,0.0007548045,0.000025677151,0.000004215363,0.00094433,0.48535618,0.45500132,0.056852363,0.00012468507,0.00018348052],"about_ca_topic_score_codex":0.000023473527,"about_ca_topic_score_gemma":0.0000148484605,"teacher_disagreement_score":0.80397916,"about_ca_system_score_codex":0.000021685632,"about_ca_system_score_gemma":0.000032468834,"threshold_uncertainty_score":0.29210967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03455,0.00018947113,0.9509739,0.0010861579,0.000034410485,0.00054976525,0.0000011104233,0.00004646869,0.012568662],"genre_scores_gemma":[0.6031462,0.000050570667,0.39469233,0.000010124559,0.000027998612,0.0000525564,7.653765e-7,0.000013155383,0.0020062742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735224,0.00021134592,0.00043739052,0.00021873027,0.0011923335,0.000587941],"domain_scores_gemma":[0.99581534,0.0021803104,0.0000306072,0.0010010408,0.00086763303,0.00010507737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013189653,0.00008538624,0.00012508879,0.00030509644,0.001219528,0.00035862994,0.001892312,0.00004305293,0.000011251888],"category_scores_gemma":[0.00074395514,0.000056171044,0.000050174556,0.0012435118,0.0003512672,0.00042233217,0.0006535216,0.0004135467,0.00007787811],"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.0000035206706,0.00009046055,0.000011363189,0.000034895664,0.000012219486,0.0000036576168,0.0025536239,0.0014760054,0.00833115,0.9815906,0.0001083848,0.0057840752],"study_design_scores_gemma":[0.00024072344,0.00014650694,0.000108428794,0.00007734314,0.0000018588122,0.00002279547,0.0019697607,0.08510424,0.03580449,0.874994,0.0013773266,0.0001525328],"about_ca_topic_score_codex":0.000018894361,"about_ca_topic_score_gemma":0.00014282636,"teacher_disagreement_score":0.56859624,"about_ca_system_score_codex":0.000048969097,"about_ca_system_score_gemma":0.00014156509,"threshold_uncertainty_score":0.9379747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109894656,0.00013720842,0.88778114,0.000119625416,0.00006144333,0.0005921587,0.000025685038,0.0001290987,0.0012589967],"genre_scores_gemma":[0.1330945,0.00005306656,0.86578757,0.0000053429444,0.00013123547,0.00021309161,0.00001823664,0.000051484436,0.0006454467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987779,0.000022610195,0.00032015995,0.00016160744,0.00039043196,0.00032729335],"domain_scores_gemma":[0.9986746,0.000245603,0.000015374066,0.000268872,0.0007061792,0.000089370704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066632306,0.00012745557,0.00020343732,0.0002841425,0.0002484074,0.00012539636,0.00022539118,0.00006417224,0.00005859129],"category_scores_gemma":[0.0002448661,0.00011044224,0.00004217987,0.0005410277,0.00008896628,0.0001733396,0.000028027323,0.00021664776,0.00002414208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099880335,0.00013113096,0.000024174191,0.0001450771,0.00006244472,0.0000023079258,0.0013158052,0.98314,0.001445011,0.0004008238,0.00015408144,0.013169135],"study_design_scores_gemma":[0.00093607715,0.0000753096,0.0000045040388,0.000077957084,0.000010619021,0.00001415133,0.0009978919,0.9919132,0.005615949,0.000039825936,0.00018156512,0.000132975],"about_ca_topic_score_codex":0.000019346775,"about_ca_topic_score_gemma":0.00004948974,"teacher_disagreement_score":0.02319985,"about_ca_system_score_codex":0.00004870325,"about_ca_system_score_gemma":0.000093479786,"threshold_uncertainty_score":0.4503704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04728898,0.000087851484,0.9407428,0.0005091522,0.0000642454,0.0031204463,0.00001908647,0.00004656182,0.008120898],"genre_scores_gemma":[0.9612408,0.0000062430945,0.03611627,0.00011706921,0.00028751424,0.0008527811,0.000098420845,0.000042334366,0.0012385197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998307,0.00002426969,0.00033627986,0.00021434938,0.0008265295,0.00029157006],"domain_scores_gemma":[0.9982369,0.00010230185,0.000065709886,0.00032742787,0.0012486369,0.000019021585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013386987,0.00013117975,0.0002192199,0.0005214109,0.0004236676,0.00014235017,0.0002731112,0.00004413035,0.00013495791],"category_scores_gemma":[0.0001885168,0.00010768469,0.000057920453,0.00043073436,0.00022268941,0.0008282093,0.000083112536,0.00011283205,0.00009749577],"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.00009174788,0.0020467227,0.00008438048,0.001684559,0.0002995111,0.000008395527,0.0023233802,0.29330176,0.00058621477,0.67752486,0.017670466,0.0043780007],"study_design_scores_gemma":[0.0012565729,0.000047129128,0.0000115042785,0.000081245504,0.000037660342,0.0000024370006,0.0011125016,0.9877509,0.000046293666,0.009062937,0.00046749183,0.00012331775],"about_ca_topic_score_codex":0.000086244545,"about_ca_topic_score_gemma":0.000062606385,"teacher_disagreement_score":0.9139519,"about_ca_system_score_codex":0.00006259392,"about_ca_system_score_gemma":0.0000909521,"threshold_uncertainty_score":0.43912542},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9541076,0.0002754536,0.01708727,0.00041341767,0.000054224864,0.00051511475,0.000042299474,0.000021623195,0.027483044],"genre_scores_gemma":[0.98941964,0.000018400715,0.0022733787,0.000010955886,0.000058202204,0.00011582138,0.0000033227873,0.000019568011,0.008080685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867284,0.00017665247,0.00050315616,0.00022290634,0.00015077963,0.00027365322],"domain_scores_gemma":[0.99827844,0.00065091526,0.00009783985,0.00063552323,0.0002940272,0.000043229928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034600112,0.00011222371,0.00030958734,0.0001984762,0.00042471619,0.00024869366,0.0004952057,0.00005991173,0.00014686058],"category_scores_gemma":[0.0009844188,0.000078003446,0.000043185126,0.00039755154,0.00038073896,0.00012306082,0.00007068175,0.0002590475,0.00014277348],"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.000017915734,0.00007588796,0.0012264933,0.00014113564,0.000026097969,4.6232716e-7,0.0035641964,0.0006699083,0.0002964406,0.99356633,0.000050805585,0.00036435048],"study_design_scores_gemma":[0.0018096045,0.0016809207,0.043501116,0.0008764553,0.000025469513,0.000056800356,0.027878279,0.122503616,0.0097196,0.78725773,0.0036537377,0.0010366463],"about_ca_topic_score_codex":0.000104244406,"about_ca_topic_score_gemma":0.00017353914,"teacher_disagreement_score":0.20630856,"about_ca_system_score_codex":0.000032832482,"about_ca_system_score_gemma":0.00005709203,"threshold_uncertainty_score":0.32666165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548731,0.00004665854,0.039883375,0.00020929922,0.000024722602,0.00044699924,0.000013516273,0.0000749667,0.0044273897],"genre_scores_gemma":[0.981091,0.00005265512,0.018748686,0.000006618702,0.000032058484,0.000025990485,0.0000048466504,0.000019022373,0.000019078963],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904203,0.000062780266,0.00027279535,0.000101087426,0.0003623614,0.00015896991],"domain_scores_gemma":[0.99885416,0.00024534733,0.000023000686,0.00041133518,0.00043582075,0.000030355273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490203,0.000090975904,0.00016206496,0.00016281352,0.00018864434,0.00005740609,0.00019434364,0.000054431497,0.000027759144],"category_scores_gemma":[0.00020791612,0.000067535104,0.000029144201,0.00027916284,0.00060440315,0.00007789281,0.00007626084,0.00018244449,0.000018438372],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014588725,0.00020144241,0.0000054019083,0.00033733045,0.000056387467,8.1734345e-7,0.0021900316,0.012984013,0.6326255,0.34633726,0.004418067,0.00082914345],"study_design_scores_gemma":[0.00006408548,0.00006599985,0.000038999435,0.00013812145,0.000004264622,0.0000024027338,0.00015842136,0.4302378,0.5523984,0.016830971,0.000010024282,0.000050507213],"about_ca_topic_score_codex":0.000017631057,"about_ca_topic_score_gemma":0.0000415617,"teacher_disagreement_score":0.4172538,"about_ca_system_score_codex":0.000023559322,"about_ca_system_score_gemma":0.000021756636,"threshold_uncertainty_score":0.27540016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9464657,0.000100299796,0.010376641,0.00017479883,0.00008703005,0.0006488578,0.00006881935,0.000013336848,0.042064574],"genre_scores_gemma":[0.9926312,0.000043127002,0.00568807,0.00001348475,0.000059306127,0.00009511773,0.000009442168,0.00001727238,0.0014429532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990797,0.000017071161,0.0003732598,0.00026149725,0.000084613515,0.00018386781],"domain_scores_gemma":[0.9991062,0.00021746848,0.000058871017,0.0003345754,0.00020446665,0.00007836288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013498146,0.00008924445,0.00025573425,0.00032612577,0.00014448713,0.000100579164,0.00012081346,0.00005589733,0.000052928008],"category_scores_gemma":[0.000495027,0.0000775417,0.000030603023,0.00020418203,0.00013714249,0.00016716153,0.00007986892,0.00014855813,0.000095661264],"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.0001313249,0.0002310461,0.00066244625,0.00001782576,0.00005709765,0.0000012110601,0.005684075,0.003004937,0.000028525865,0.9893835,0.00053745136,0.00026054945],"study_design_scores_gemma":[0.0064551462,0.0062017045,0.0016383225,0.00026553095,0.000035432826,0.00004261249,0.0176771,0.15907253,0.0023085917,0.79817057,0.0073650265,0.0007674161],"about_ca_topic_score_codex":0.00023663808,"about_ca_topic_score_gemma":0.00012204751,"teacher_disagreement_score":0.19121292,"about_ca_system_score_codex":0.0000831014,"about_ca_system_score_gemma":0.0001232967,"threshold_uncertainty_score":0.31620586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5485546,0.00022592358,0.42071384,0.013924634,0.00013205314,0.0014512985,0.000023408726,0.000082872255,0.0148913795],"genre_scores_gemma":[0.8881479,0.000050545685,0.11128297,0.000054029035,0.000032739063,0.000083328116,0.0000024766873,0.000007178231,0.0003388174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983402,0.00019395044,0.00035827243,0.00021906337,0.00058068364,0.0003078404],"domain_scores_gemma":[0.9979738,0.0009296383,0.000030956766,0.00053299195,0.00048637995,0.00004623285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021184965,0.0000900999,0.00015438048,0.0002903421,0.00040619736,0.00032230723,0.0010681669,0.000042800777,0.00004357453],"category_scores_gemma":[0.0009811684,0.000055430322,0.000042852058,0.0009547812,0.00033806585,0.00028122345,0.00043391428,0.00032916592,0.000017165974],"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.000002922846,0.0003569889,0.00041930325,0.000088237,0.00001753915,0.000019220191,0.017605575,0.00132198,0.0013484034,0.9730621,0.00011281236,0.005644945],"study_design_scores_gemma":[0.0003999732,0.00011576824,0.0011659638,0.00055204425,0.0000039707556,0.000115227274,0.0071759326,0.62735766,0.0060071186,0.35666326,0.00020917955,0.00023390401],"about_ca_topic_score_codex":0.00017365467,"about_ca_topic_score_gemma":0.00070862257,"teacher_disagreement_score":0.6260357,"about_ca_system_score_codex":0.00003603493,"about_ca_system_score_gemma":0.0002386024,"threshold_uncertainty_score":0.31241828},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12260582,0.002555323,0.8588009,0.0013687183,0.000020156358,0.0010636057,0.0001302535,0.000017658984,0.013437572],"genre_scores_gemma":[0.9446028,0.000054302272,0.054708015,0.000017108016,0.000033129487,0.00018532923,0.0000061111646,0.000012188747,0.00038100264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989431,0.0000038018447,0.0005523153,0.00019899964,0.0001039742,0.0001978358],"domain_scores_gemma":[0.99929845,0.000078451216,0.000095811345,0.00022839327,0.00024227299,0.000056634995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076178764,0.0000780294,0.00024122222,0.000295609,0.00018689143,0.00003486817,0.00018739798,0.000057780926,0.000058502443],"category_scores_gemma":[0.00023874441,0.00008483152,0.00003340077,0.0003970166,0.000076429526,0.00019397444,0.00013049945,0.00012103137,0.00006819994],"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.000002410166,0.00021600226,0.000011936572,0.00014314626,0.000012851286,5.0723852e-8,0.0014252475,0.0018032813,0.0017578849,0.99439514,0.00006735471,0.00016471106],"study_design_scores_gemma":[0.0004267128,0.00013612803,0.0001283907,0.00011840357,0.000008084515,0.0000036526733,0.0004886609,0.53463256,0.0024997776,0.46112505,0.0002662083,0.00016641176],"about_ca_topic_score_codex":0.000084476604,"about_ca_topic_score_gemma":0.000046963447,"teacher_disagreement_score":0.821997,"about_ca_system_score_codex":0.000054658783,"about_ca_system_score_gemma":0.000057105102,"threshold_uncertainty_score":0.34593287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43767786,0.000067438436,0.5486867,0.00026488837,0.00009861442,0.0005499463,0.000009522189,0.00007753965,0.012567519],"genre_scores_gemma":[0.80372185,0.00008505094,0.19493437,0.0000063949833,0.000011464062,0.0001212171,0.000014507561,0.000019417253,0.0010857043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900043,0.00006044342,0.00030744227,0.00010507072,0.0003172461,0.000209372],"domain_scores_gemma":[0.99913555,0.000107241496,0.000008673089,0.00034633637,0.0003546517,0.00004752978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092959264,0.00006996231,0.0001120587,0.000109189015,0.00015021431,0.000057168316,0.000111445086,0.000051819326,0.00026365242],"category_scores_gemma":[0.00048173792,0.0000658688,0.00003153292,0.00036239185,0.00008325187,0.00015591532,0.000020257921,0.00014625699,0.00003921704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011673288,0.000085641834,0.00001396344,0.00005822724,0.000013055877,1.3685931e-7,0.00045141697,0.823271,0.0043555982,0.17101358,0.00071882486,0.000017390612],"study_design_scores_gemma":[0.0002122306,0.000055984096,0.00006683576,0.000036137695,0.0000062697172,0.000002283474,0.0011583482,0.976741,0.017685968,0.002394413,0.0015451733,0.000095338466],"about_ca_topic_score_codex":0.000008326698,"about_ca_topic_score_gemma":0.00001704327,"teacher_disagreement_score":0.366044,"about_ca_system_score_codex":0.00007059743,"about_ca_system_score_gemma":0.00006645494,"threshold_uncertainty_score":0.2886809},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10357989,0.000033285345,0.89183,0.0009914327,0.000020042722,0.0013023006,0.00003559185,0.000095616844,0.002111808],"genre_scores_gemma":[0.50932074,0.000029162615,0.4896587,0.000010408905,0.000028884511,0.00008215037,0.000037344103,0.0000211209,0.00081149343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641985,0.00049515796,0.0008728449,0.0003640035,0.0012334926,0.0006146308],"domain_scores_gemma":[0.9960883,0.001454566,0.00007312615,0.0008272082,0.001398779,0.00015801864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041068215,0.00018288003,0.00053229707,0.0017737728,0.0003304166,0.00010646107,0.00027582553,0.0001318701,0.00023055013],"category_scores_gemma":[0.004024879,0.00017638279,0.00015674648,0.0054233605,0.00022501043,0.0003401351,0.00012311357,0.00062062003,0.000048271857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039787734,0.006066272,0.0008631377,0.00040091985,0.000462232,0.00009699267,0.007817193,0.8496003,0.008953818,0.11455737,0.0003604397,0.010781513],"study_design_scores_gemma":[0.00038833419,0.00012852,0.00036261737,0.00007889288,0.000060423234,0.000008812363,0.0008014633,0.9582901,0.0029919546,0.036604308,0.00008212532,0.00020244472],"about_ca_topic_score_codex":0.00007385692,"about_ca_topic_score_gemma":0.0008880094,"teacher_disagreement_score":0.40574083,"about_ca_system_score_codex":0.00015537009,"about_ca_system_score_gemma":0.00016548566,"threshold_uncertainty_score":0.71926814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012721192,0.000175803,0.9836273,0.00020795358,0.0006270524,0.00094673486,0.00015186198,0.00012674059,0.0014153552],"genre_scores_gemma":[0.63049984,0.0006261543,0.36703712,0.000004329116,0.00045749993,0.000627307,0.00008337263,0.000034888944,0.00062950846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783546,0.00011148328,0.00052135263,0.00041937325,0.000764341,0.00034797125],"domain_scores_gemma":[0.99718183,0.0003398397,0.00006731826,0.0009324692,0.0013922869,0.00008627604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010228181,0.00017825275,0.00029896086,0.00036322456,0.0004971724,0.00074979936,0.00090243947,0.00024400908,0.000007180744],"category_scores_gemma":[0.00014164732,0.00016757134,0.00014575517,0.0004453842,0.00012229886,0.0003335094,0.00065920706,0.0006254492,0.0000104854735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004790003,0.0002973366,0.0000052610744,0.0004096919,0.00010064781,0.000002334775,0.001646465,0.88300806,0.0014206129,0.10847088,0.0022099374,0.002423958],"study_design_scores_gemma":[0.00018040756,0.00013446514,0.000033007076,0.00016406878,0.0000075370376,0.000012034794,0.0008616451,0.9634162,0.003528792,0.031314068,0.00020769757,0.0001400712],"about_ca_topic_score_codex":0.000051777573,"about_ca_topic_score_gemma":0.000008637064,"teacher_disagreement_score":0.61777866,"about_ca_system_score_codex":0.0001250065,"about_ca_system_score_gemma":0.00058246223,"threshold_uncertainty_score":0.72303325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22353598,0.00019991321,0.69820523,0.03845396,0.00019439099,0.0016877078,0.000032760152,0.000106013555,0.037584014],"genre_scores_gemma":[0.7762287,0.00003500012,0.2162883,0.00007074861,0.00005893379,0.00010866997,0.000001618216,0.000023638315,0.0071843984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707437,0.0002681175,0.00039736438,0.00035115736,0.0013757577,0.00053321815],"domain_scores_gemma":[0.9950668,0.00067200593,0.00007450809,0.0032166056,0.00085263106,0.00011740551],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004109434,0.00014380415,0.00022320845,0.000283031,0.0024684772,0.0016764189,0.0045913323,0.0000661423,0.00015089942],"category_scores_gemma":[0.0015065719,0.00009466164,0.00009960123,0.00030181636,0.00080034434,0.0011600532,0.0022534255,0.00066607184,0.0002197357],"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.0000040571344,0.00014269791,0.000021723925,0.000049581195,0.000034256907,0.000009324173,0.015591451,0.00016264805,0.007149883,0.9709153,0.0013427627,0.0045762914],"study_design_scores_gemma":[0.00028151248,0.000116592375,0.00021925865,0.000121293706,0.0000041586677,0.000034662848,0.0018436734,0.086471796,0.020756632,0.8891405,0.0008234036,0.00018651123],"about_ca_topic_score_codex":0.00021865338,"about_ca_topic_score_gemma":0.000114517876,"teacher_disagreement_score":0.5526927,"about_ca_system_score_codex":0.00004950517,"about_ca_system_score_gemma":0.00024706914,"threshold_uncertainty_score":0.99935997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7326681,0.000079170306,0.25829825,0.0018309638,0.000034705747,0.00047301062,0.0000848978,0.00001642348,0.006514465],"genre_scores_gemma":[0.96398956,0.000032236916,0.021156864,0.000008507477,0.000025815296,0.00007033784,0.000003411266,0.00001173631,0.014701541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675024,0.0003324344,0.0009079147,0.00024891866,0.001541705,0.00021876737],"domain_scores_gemma":[0.99506193,0.0019615525,0.00011539587,0.0010385044,0.0017403924,0.00008223159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054115457,0.0000862538,0.0002581659,0.0005587401,0.00019314945,0.00008629289,0.0008736021,0.00006699049,0.0011963991],"category_scores_gemma":[0.005488913,0.00005027822,0.00008467146,0.0013243968,0.00044458825,0.00025409137,0.00017844416,0.00007510471,0.0004454801],"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.000008756831,0.00031785923,0.00016021702,0.000026224461,0.000014978679,2.999162e-7,0.0018370466,0.0005065529,0.3077907,0.68008465,0.0035393746,0.005713343],"study_design_scores_gemma":[0.00064190105,0.00019226359,0.0003809248,0.00017188872,0.00001531765,0.000009096206,0.0026668664,0.014192228,0.35575807,0.6218275,0.0039480124,0.0001959334],"about_ca_topic_score_codex":0.000022788836,"about_ca_topic_score_gemma":0.000025276242,"teacher_disagreement_score":0.23714139,"about_ca_system_score_codex":0.000025915848,"about_ca_system_score_gemma":0.00016718238,"threshold_uncertainty_score":0.99971664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051136605,0.000024552808,0.9464873,0.0003134295,0.000015246014,0.0012265865,0.000051174884,0.00017869592,0.0005664091],"genre_scores_gemma":[0.46706998,0.000014931207,0.5320364,0.000002760173,0.000011082626,0.00049301237,0.00001808272,0.000023230925,0.00033049253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986741,0.00008264978,0.0004100608,0.00017154362,0.00040027848,0.00026136282],"domain_scores_gemma":[0.99770373,0.0004915933,0.000025851212,0.00042225848,0.0012988998,0.00005766806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019657856,0.00011255848,0.00017854298,0.000234718,0.00014875316,0.00004986015,0.00020846346,0.00008143651,0.000047570567],"category_scores_gemma":[0.0007337175,0.000074831245,0.000031788015,0.00048332894,0.00014196205,0.00015483571,0.000024555775,0.00009783171,0.000014065662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023864102,0.0004129327,0.00029988468,0.0024239242,0.00006295387,4.949182e-7,0.0022551704,0.7913526,0.18553346,0.006251317,0.00040188426,0.01098146],"study_design_scores_gemma":[0.0003866503,0.00022244165,0.000040343577,0.00035909668,0.000009018088,0.0000012915954,0.0001840726,0.85732645,0.14033177,0.0006757344,0.00031420187,0.00014889396],"about_ca_topic_score_codex":0.000009266743,"about_ca_topic_score_gemma":0.000023063161,"teacher_disagreement_score":0.41593337,"about_ca_system_score_codex":0.00011543164,"about_ca_system_score_gemma":0.0001360209,"threshold_uncertainty_score":0.30515295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36846495,0.0001559372,0.6284941,0.0014188851,0.000030023932,0.00057235744,0.000014827192,0.000009104991,0.0008398192],"genre_scores_gemma":[0.93802,0.00023256648,0.061020296,0.0000068126087,0.000012730082,0.00003504819,0.000001687863,0.000008870871,0.0006620015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997927,0.00023115128,0.00055598374,0.00026560796,0.00083389116,0.00018633738],"domain_scores_gemma":[0.9973618,0.0015204396,0.000039653667,0.0003033698,0.0007037345,0.000071020884],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0039544883,0.000077414385,0.00018340765,0.0006022503,0.00018047796,0.00020933452,0.00021078443,0.0000573915,0.000121733625],"category_scores_gemma":[0.009638925,0.000044300083,0.000015086407,0.00072307995,0.0003049993,0.00046102257,0.00011188353,0.000073468946,0.000015164045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010471271,0.0012018366,0.0033124269,0.00007037544,0.000020102041,0.000007717695,0.023642339,0.8655515,0.017997885,0.036812708,0.00092419365,0.050354242],"study_design_scores_gemma":[0.000512281,0.00009565491,0.00051306887,0.00006886975,0.0000025855793,0.000009277525,0.0011787938,0.994375,0.0003915651,0.0027130113,0.00006369982,0.00007618428],"about_ca_topic_score_codex":0.00003464528,"about_ca_topic_score_gemma":0.0000503864,"teacher_disagreement_score":0.56955504,"about_ca_system_score_codex":0.00001926612,"about_ca_system_score_gemma":0.00007585115,"threshold_uncertainty_score":0.9987033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053793013,0.0007621305,0.9382672,0.0004904674,0.000022169666,0.0010623861,0.00002495163,0.0002284266,0.005349273],"genre_scores_gemma":[0.58781874,0.00061400916,0.41089514,0.000008681486,0.000042315205,0.0002485413,0.000004294684,0.000031910535,0.00033634953],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990362,0.0000805397,0.0002886166,0.00015490943,0.00022837643,0.00021135401],"domain_scores_gemma":[0.9986481,0.00036124568,0.00001597407,0.00045876091,0.0004435813,0.000072321855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717144,0.0001021061,0.00019631989,0.00022280245,0.00017018784,0.000069411966,0.00017557268,0.000058963582,0.000041635416],"category_scores_gemma":[0.0002443059,0.00007442963,0.000030441255,0.00035346765,0.00014745891,0.000086478816,0.000109589855,0.00012759892,0.00001479679],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010588095,0.00046821637,0.00021872742,0.000661899,0.0002322212,0.000004812386,0.0027797194,0.0015079421,0.54351646,0.3239858,0.007662383,0.11895126],"study_design_scores_gemma":[0.0013073497,0.0002978643,0.0008015786,0.0018094104,0.00010368613,0.00007428722,0.0007235745,0.35089847,0.49138653,0.06364337,0.08803673,0.00091713254],"about_ca_topic_score_codex":0.000012072121,"about_ca_topic_score_gemma":0.000034600544,"teacher_disagreement_score":0.5340257,"about_ca_system_score_codex":0.00004073866,"about_ca_system_score_gemma":0.000020501424,"threshold_uncertainty_score":0.3035152},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050202548,0.00007648736,0.9924088,0.0005884788,0.00011465623,0.0008112429,0.00001639203,0.000026158541,0.00093753816],"genre_scores_gemma":[0.03839941,0.0000135040245,0.9606198,0.000012562594,0.00005235116,0.0002729661,0.0000024301994,0.000012851962,0.0006140993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978652,0.00024453716,0.0004846682,0.00024971578,0.000832922,0.0003229695],"domain_scores_gemma":[0.9937404,0.003072634,0.0000650052,0.0009372036,0.0020766011,0.00010820436],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007239034,0.0000983966,0.00016406015,0.00016697934,0.00056915794,0.00050325826,0.0015452853,0.000060721664,0.0000061431733],"category_scores_gemma":[0.0120186955,0.00006790041,0.000043805572,0.00066982553,0.00015321966,0.00041305894,0.00034866147,0.00014865617,0.000021905638],"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.0001497949,0.0006411665,0.000016828908,0.0006707664,0.00007129089,0.0000018315861,0.017790833,0.0055444636,0.002828113,0.5549508,0.028148534,0.38918558],"study_design_scores_gemma":[0.000284503,0.00026142504,0.000013347498,0.000034238838,0.0000051725415,0.00000845213,0.0007118722,0.95528865,0.013962923,0.022725716,0.0066123693,0.00009133149],"about_ca_topic_score_codex":0.000015532107,"about_ca_topic_score_gemma":0.00003230782,"teacher_disagreement_score":0.94974416,"about_ca_system_score_codex":0.00007477463,"about_ca_system_score_gemma":0.000763313,"threshold_uncertainty_score":0.9963035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06946956,0.00003103693,0.92781514,0.00016800499,0.000059891903,0.0006313529,0.000058213805,0.0001230969,0.0016437188],"genre_scores_gemma":[0.5292184,0.000019883186,0.47023264,0.000002497131,0.000033511544,0.0001250684,0.0000066196167,0.000031270836,0.0003301477],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.00014330125,0.0004052117,0.0001592049,0.00029645392,0.00029233773],"domain_scores_gemma":[0.99777716,0.0008031682,0.000018060977,0.0005421865,0.0007662415,0.00009315258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030420844,0.00010110745,0.0001923494,0.0003873352,0.00013888767,0.000078447636,0.00032513172,0.00008676165,0.00007447142],"category_scores_gemma":[0.0025094626,0.000072524796,0.000052723182,0.0006418801,0.000082847924,0.00022653643,0.00004008402,0.00012840175,0.0000182105],"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.000021881442,0.00079190196,0.0002469611,0.0012082455,0.00013841693,9.4455106e-7,0.0033292472,0.110537365,0.6648298,0.110777915,0.0013734071,0.10674395],"study_design_scores_gemma":[0.0003376845,0.00011288607,0.00005510333,0.000051798426,0.0000059043186,0.0000012180416,0.00024199227,0.93767375,0.058501326,0.0028041701,0.000106081774,0.0001080798],"about_ca_topic_score_codex":0.000014414669,"about_ca_topic_score_gemma":0.000018088884,"teacher_disagreement_score":0.8271364,"about_ca_system_score_codex":0.00009256867,"about_ca_system_score_gemma":0.000062642815,"threshold_uncertainty_score":0.30042425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36993352,9.548856e-7,0.62496454,0.000049855556,0.0000056509057,0.00017355799,0.00028460118,0.0000033376953,0.004583972],"genre_scores_gemma":[0.9558156,0.0000010718239,0.043933287,0.0000010897609,0.0000057427387,0.00002349969,0.00012921596,0.0000060660245,0.000084391446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901605,0.000032620785,0.00034799837,0.00008753978,0.0003691545,0.0001466389],"domain_scores_gemma":[0.99841607,0.00012716626,0.0001121379,0.00060544274,0.00069137436,0.000047802332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038840613,0.000069838505,0.0002624675,0.00024663878,0.00023661317,0.00009693687,0.00029770687,0.000023220604,0.00021915202],"category_scores_gemma":[0.0001474323,0.000053795495,0.000056336612,0.0003070045,0.00017801338,0.00024752563,0.00010845979,0.00013349914,0.000006311053],"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.000014167182,0.00014716461,0.00041144685,0.000035163957,0.0003711291,2.9767492e-7,0.00056622544,0.01277704,0.0013249025,0.9821677,0.0000024543856,0.0021822648],"study_design_scores_gemma":[0.00021134564,0.00007883768,0.0012976462,0.000030389217,0.00009097172,1.5388045e-7,0.0004156021,0.96831584,0.0004963682,0.028986774,0.000013901003,0.000062176674],"about_ca_topic_score_codex":0.0003012487,"about_ca_topic_score_gemma":0.000091173206,"teacher_disagreement_score":0.9555388,"about_ca_system_score_codex":0.000016501555,"about_ca_system_score_gemma":0.000057392688,"threshold_uncertainty_score":0.2399561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983868,0.000008282677,0.009676332,0.0005106958,0.00006544257,0.00028037146,0.000029764873,0.000006866175,0.005554219],"genre_scores_gemma":[0.985467,0.000015586767,0.014314777,0.000003907768,0.000011018809,0.000013481662,0.000006363442,0.0000038108678,0.00016401107],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755096,0.0001041188,0.000936924,0.00014316863,0.0011242437,0.00014059845],"domain_scores_gemma":[0.9958476,0.00064630643,0.00025437685,0.0011183526,0.0020704232,0.000062986066],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006343687,0.00007123315,0.00027097343,0.00042944594,0.00055345567,0.0010183649,0.0008010897,0.0000700038,0.00027614736],"category_scores_gemma":[0.015477196,0.000055086766,0.000051016617,0.00023905755,0.0004586398,0.0014343114,0.00041869594,0.0001358923,0.00012061465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005733464,0.00056998443,0.0059111575,0.00011793852,0.000027093285,9.791216e-7,0.014472507,0.00028676947,0.003909615,0.034674883,0.0011745946,0.9387971],"study_design_scores_gemma":[0.0013984572,0.00046502944,0.082558975,0.000243483,0.000030707422,0.000016540831,0.018926855,0.4144502,0.013590272,0.4644715,0.0034816207,0.00036636903],"about_ca_topic_score_codex":0.00031016933,"about_ca_topic_score_gemma":0.0001686511,"teacher_disagreement_score":0.9384308,"about_ca_system_score_codex":0.000025633426,"about_ca_system_score_gemma":0.00016329382,"threshold_uncertainty_score":0.99281585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89733034,0.000018823815,0.00063891965,0.0005392423,0.000070494796,0.0003301865,0.0000011023529,0.000024429915,0.101046436],"genre_scores_gemma":[0.99669176,0.000004135855,0.0015986118,0.000067148445,0.00007492162,0.00001864777,0.00001039895,0.0000104680585,0.0015239151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991595,0.0000128231495,0.00019962761,0.000109280074,0.0003669847,0.00015178518],"domain_scores_gemma":[0.99914855,0.00014991651,0.000021750888,0.00027721818,0.00039593497,0.0000066038688],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009120652,0.00005695514,0.00011528943,0.00030340173,0.00013392873,0.00018736834,0.00019015124,0.00003307,0.0031510014],"category_scores_gemma":[0.00018683268,0.00005128808,0.00003689027,0.00041033135,0.000030038966,0.00036371697,0.00014242553,0.00014456954,0.00087151455],"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.000021600814,0.0004698625,0.013687382,0.0010986063,0.000027561357,0.000003235446,0.00094491686,0.0003218718,0.04074856,0.9335617,0.0020925375,0.007022205],"study_design_scores_gemma":[0.004586734,0.00035166857,0.026903639,0.0023054061,0.0002457642,0.00002338687,0.018166373,0.73338425,0.029965974,0.06101143,0.12114349,0.0019119022],"about_ca_topic_score_codex":0.00042661876,"about_ca_topic_score_gemma":0.00026248765,"teacher_disagreement_score":0.87255025,"about_ca_system_score_codex":0.000009439309,"about_ca_system_score_gemma":0.000021902453,"threshold_uncertainty_score":0.9999064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6594409,0.00007514345,0.1582105,0.004592649,0.00013148763,0.0025090897,0.0000490602,0.00011926253,0.1748719],"genre_scores_gemma":[0.62579036,0.000038741193,0.36804456,0.000018214245,0.0000416211,0.00014403922,0.000004050415,0.000027646087,0.005890805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770427,0.00017103786,0.0006452283,0.00028850455,0.00086601754,0.00032491673],"domain_scores_gemma":[0.99647063,0.001110993,0.00016006608,0.001106112,0.001019201,0.00013301722],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.00289006,0.00017516525,0.0003921104,0.00021457917,0.0013309425,0.00088453013,0.0006281138,0.0001446243,0.0005004304],"category_scores_gemma":[0.012411846,0.00013978107,0.000062046,0.00017984185,0.0006455952,0.0006454031,0.00028642375,0.00041125432,0.000067048306],"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.000007840403,0.00031161847,0.000026979535,0.00032707053,0.00003186595,0.0000015602483,0.0023314434,0.0000046241935,0.0018942854,0.9933051,0.0010579398,0.0006996947],"study_design_scores_gemma":[0.00046427778,0.00010564177,0.000170176,0.0002706577,0.000019405012,0.000013460254,0.0013240995,0.11004917,0.009320087,0.8778764,0.00021940657,0.00016723285],"about_ca_topic_score_codex":0.00010026698,"about_ca_topic_score_gemma":0.00019626015,"teacher_disagreement_score":0.20983405,"about_ca_system_score_codex":0.000045580815,"about_ca_system_score_gemma":0.00013628995,"threshold_uncertainty_score":0.9999692},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032571398,0.0004098056,0.95489764,0.0038941444,0.00035567873,0.0012583504,0.00007255726,0.00022723319,0.006313205],"genre_scores_gemma":[0.26818073,0.00012292413,0.73125637,0.000024627661,0.00006141477,0.00014541687,0.000027051834,0.00002383993,0.00015766169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967221,0.00028284523,0.0006684405,0.00060612475,0.0013331438,0.00038736773],"domain_scores_gemma":[0.9965129,0.0004812104,0.000071287715,0.0017277756,0.001051009,0.00015581139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016674908,0.00021678215,0.00045257623,0.0006548954,0.0003938843,0.00063838315,0.0030813369,0.00017640686,0.000082737315],"category_scores_gemma":[0.0005066454,0.00020528423,0.00019439518,0.0012977533,0.0003026164,0.00022591572,0.0046639945,0.0013241661,0.000063143074],"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.0000012251795,0.00028782958,0.000007821569,0.00063339336,0.0000582497,0.000008185769,0.0047168066,0.0009017104,0.0011488358,0.9895428,0.00066856644,0.002024593],"study_design_scores_gemma":[0.00008129299,0.000051719144,0.000018621338,0.00017184258,0.0000048278507,0.0000028340455,0.0001539919,0.52827424,0.002448061,0.46846297,0.00018168917,0.00014792991],"about_ca_topic_score_codex":0.00009768786,"about_ca_topic_score_gemma":0.000044584674,"teacher_disagreement_score":0.52737254,"about_ca_system_score_codex":0.00005646398,"about_ca_system_score_gemma":0.0005264548,"threshold_uncertainty_score":0.8371248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96056414,0.000070073394,0.0036828388,0.00035282213,0.0001692766,0.00037677784,0.000033983084,0.000057686306,0.0346924],"genre_scores_gemma":[0.9970089,0.000026681118,0.0021388507,0.000004148255,0.000042227184,0.00005077388,0.0000038359467,0.000022054157,0.00070250867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.00005107881,0.00021697841,0.00009721675,0.000401935,0.00023033906],"domain_scores_gemma":[0.9988554,0.00010876634,0.000017549211,0.00082584843,0.0001295647,0.00006283002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012403295,0.00008227401,0.00016457874,0.00014391389,0.00049540156,0.0003182066,0.00051950454,0.00005905948,0.00012866095],"category_scores_gemma":[0.00018584992,0.000072220726,0.00005184824,0.000070998176,0.00017653551,0.00020997364,0.00008485214,0.00019721378,0.0001666801],"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.00002146168,0.0004135829,0.00042520024,0.0016898828,0.00025875092,0.000019401872,0.013478538,0.018106986,0.1141245,0.8336605,0.012288816,0.0055123726],"study_design_scores_gemma":[0.002876477,0.00036837536,0.0031104367,0.0010447535,0.000047730882,0.00005205079,0.010497992,0.61321056,0.30738813,0.053128228,0.007282987,0.0009922414],"about_ca_topic_score_codex":0.000029128185,"about_ca_topic_score_gemma":0.000030759238,"teacher_disagreement_score":0.7805323,"about_ca_system_score_codex":0.000021564505,"about_ca_system_score_gemma":0.00001856737,"threshold_uncertainty_score":0.38102785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60051763,0.00008639661,0.36445087,0.006104794,0.00011435038,0.001416156,0.0000121151725,0.000050280723,0.027247388],"genre_scores_gemma":[0.78777903,0.000026756039,0.21096307,0.000013266679,0.000011124574,0.000075344935,0.0000012212928,0.000009274142,0.0011208947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798787,0.00016023693,0.0003538929,0.00025335053,0.0008358996,0.0004087559],"domain_scores_gemma":[0.99744105,0.0002182979,0.000042668293,0.0018277997,0.0003862287,0.00008395445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031674884,0.00007914428,0.00016009925,0.0005156753,0.00064390356,0.0004999676,0.0028512843,0.000039608916,0.000033540233],"category_scores_gemma":[0.0011042536,0.00007231505,0.00003640479,0.0003600434,0.00030759198,0.000893313,0.0011404607,0.00029904154,0.00008919331],"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.0000053211775,0.00035840186,0.0013231523,0.000078084384,0.0000152609,0.00001929003,0.0020052753,0.00090484374,0.019039545,0.9704846,0.00017590316,0.0055902814],"study_design_scores_gemma":[0.0012717455,0.00025967247,0.005667003,0.0002752151,0.0000023082403,0.00001163434,0.00057959644,0.6841882,0.041616026,0.26539537,0.00041805443,0.00031518366],"about_ca_topic_score_codex":0.0000664357,"about_ca_topic_score_gemma":0.00018022819,"teacher_disagreement_score":0.7050893,"about_ca_system_score_codex":0.00005833726,"about_ca_system_score_gemma":0.00012556034,"threshold_uncertainty_score":0.5298443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0629992,0.00008534815,0.93583745,0.00007305613,0.000022608552,0.0007027566,0.000023549735,0.0000862762,0.00016973708],"genre_scores_gemma":[0.40227187,0.000008850934,0.5971458,0.0000018453301,0.000019693245,0.00038770752,0.000020968762,0.000015977383,0.00012729611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922955,0.000040153755,0.00019825928,0.000094098104,0.00030029702,0.00013762129],"domain_scores_gemma":[0.9994805,0.0001283517,0.00001181765,0.00013885302,0.000216349,0.000024129235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008818554,0.00005665657,0.00009952688,0.00016639306,0.000339677,0.000051473624,0.00010290463,0.00002205335,0.000046701796],"category_scores_gemma":[0.00009925717,0.000058843794,0.000020773223,0.00015617754,0.00005015628,0.00007608536,0.00007423232,0.00013807724,0.0000012889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007175748,0.0001090776,0.00000736078,0.00011774274,0.00003066755,6.374201e-7,0.0012002885,0.93867546,0.040369175,0.014624141,0.0017827338,0.003075545],"study_design_scores_gemma":[0.000088162524,0.00009124371,0.000013581036,0.000013785289,0.000004299958,0.000009598796,0.00040247964,0.9778425,0.016362896,0.004770716,0.000340337,0.000060389848],"about_ca_topic_score_codex":0.0000058835967,"about_ca_topic_score_gemma":8.1318126e-7,"teacher_disagreement_score":0.33927268,"about_ca_system_score_codex":0.000043472166,"about_ca_system_score_gemma":0.000037980906,"threshold_uncertainty_score":0.26125553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77903146,0.0014429447,0.16368856,0.0029180567,0.0004940904,0.0023065791,0.003011929,0.0000626482,0.047043752],"genre_scores_gemma":[0.9656738,0.000050057617,0.020468738,0.000029263538,0.000058324993,0.00069336215,0.000029079818,0.00003228851,0.012965097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896085,0.000022259104,0.00048594506,0.00020296918,0.000060554183,0.00026740736],"domain_scores_gemma":[0.9992261,0.00021283608,0.00006735762,0.00035950274,0.00009459639,0.000039631996],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002324129,0.00006848172,0.0002478302,0.00034674103,0.0006044732,0.00007158414,0.0003310398,0.000026451698,0.001354975],"category_scores_gemma":[0.00030713627,0.00008253621,0.00008512976,0.00020967035,0.00006782462,0.000117567455,0.00022496918,0.00014123651,0.00005797053],"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.0000060724224,0.00013767167,0.000045269313,0.000077541496,0.000024370942,2.6101995e-7,0.0026692378,0.014095177,0.00019227121,0.979528,0.0031437061,0.00008040016],"study_design_scores_gemma":[0.0009818022,0.0003753947,0.000038331866,0.000021784002,0.000006151782,0.000007762887,0.007425642,0.39018056,0.0017289707,0.5256631,0.073231086,0.00033941676],"about_ca_topic_score_codex":0.00012435034,"about_ca_topic_score_gemma":0.0000401068,"teacher_disagreement_score":0.45386493,"about_ca_system_score_codex":0.00010340652,"about_ca_system_score_gemma":0.000047293066,"threshold_uncertainty_score":0.9995579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031856,0.00038576443,0.48789847,0.00097335526,0.0006271983,0.00287858,0.00033006218,0.00007096797,0.0036500103],"genre_scores_gemma":[0.7704714,0.00023338126,0.22475488,0.000020362726,0.00016539924,0.0004227397,0.00031243797,0.000051666157,0.0035677487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9857937,0.0010218053,0.0023938732,0.0007629242,0.009307857,0.0007198015],"domain_scores_gemma":[0.9797072,0.0037747729,0.00032588717,0.0028473742,0.013077546,0.00026725826],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01472623,0.00034918747,0.00096200453,0.0021018097,0.0007713684,0.003033222,0.0029254786,0.00050602725,0.0011181241],"category_scores_gemma":[0.04280111,0.00027837086,0.0002624699,0.0023893733,0.00042215647,0.0018821053,0.0052398825,0.002037273,0.0005742277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005270423,0.0008468533,0.0005138811,0.0009842527,0.00015301793,0.000024196657,0.02009699,0.9541693,0.0031430388,0.001950874,0.0053897453,0.012675191],"study_design_scores_gemma":[0.0005667354,0.000088791494,0.0006798301,0.0006905843,0.000013460352,0.000012737404,0.010919224,0.96089876,0.013121457,0.011173224,0.0014689728,0.0003662319],"about_ca_topic_score_codex":0.000232365,"about_ca_topic_score_gemma":0.0004100826,"teacher_disagreement_score":0.2672858,"about_ca_system_score_codex":0.00032045034,"about_ca_system_score_gemma":0.0017288195,"threshold_uncertainty_score":0.99996686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19384211,0.00070507475,0.79888135,0.0008798017,0.00010714541,0.0010586763,0.00057452964,0.000029449233,0.003921837],"genre_scores_gemma":[0.94698125,0.00004431853,0.049836766,0.000016143804,0.000096567055,0.0011435994,0.001176226,0.000030119128,0.0006750169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978653,0.000025006539,0.0010924902,0.00054770365,0.00022498943,0.00024447218],"domain_scores_gemma":[0.9977968,0.00018766547,0.00022731537,0.0007341206,0.0009804791,0.000073664676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011686409,0.00016836655,0.0005029194,0.00032814013,0.0003032914,0.00018636291,0.00035237242,0.00023496621,0.0006108215],"category_scores_gemma":[0.0009728997,0.00019903314,0.00016799862,0.00040868786,0.00032166534,0.00012947757,0.000380572,0.00048039472,0.00029237362],"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.0000035758662,0.0008112556,0.00003767601,0.0005209742,0.000066547786,5.6132956e-7,0.002126915,0.013613091,0.00025097746,0.9823318,0.00017758226,0.000059007933],"study_design_scores_gemma":[0.00018517494,0.00004228503,0.0016975439,0.00013193625,0.000013649256,0.0000033472559,0.0008816055,0.06407752,0.00039042358,0.9322451,0.000086038286,0.0002453712],"about_ca_topic_score_codex":0.00018651866,"about_ca_topic_score_gemma":0.00007059343,"teacher_disagreement_score":0.75313914,"about_ca_system_score_codex":0.00030812,"about_ca_system_score_gemma":0.00037156473,"threshold_uncertainty_score":0.8116336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10284472,0.00010406776,0.893934,0.0004086913,0.000046927973,0.0018800573,0.00016028712,0.00004454074,0.0005767064],"genre_scores_gemma":[0.3847758,0.000011638214,0.5950463,0.000017472372,0.000059211347,0.0013848473,0.00009939696,0.000073597395,0.018531743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921001,0.001000477,0.0007754818,0.0005996236,0.0048967507,0.0006275417],"domain_scores_gemma":[0.9941263,0.0025138794,0.00012374076,0.0006968058,0.0023451599,0.00019406916],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013873767,0.00016504097,0.00042368466,0.0011032649,0.0020124658,0.00037637103,0.0010276908,0.000049173057,0.0014399285],"category_scores_gemma":[0.004262734,0.0001294245,0.00010096185,0.001782133,0.00083294854,0.00047403146,0.00056640245,0.0008841141,0.000023092367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053881,0.0046745613,0.0002341702,0.00033920645,0.00037215566,0.00013481935,0.068823315,0.5196187,0.018010404,0.08145364,0.0011342904,0.3046659],"study_design_scores_gemma":[0.0009691857,0.0014780192,0.00001643414,0.00002098897,0.0000068362924,0.00006339336,0.04561574,0.94248104,0.0004890437,0.0071003246,0.0016031462,0.00015585936],"about_ca_topic_score_codex":0.00003536182,"about_ca_topic_score_gemma":0.00007144506,"teacher_disagreement_score":0.42286232,"about_ca_system_score_codex":0.00035151216,"about_ca_system_score_gemma":0.0010095779,"threshold_uncertainty_score":0.9994729},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.906349,0.00015063841,0.01989253,0.0013053402,0.00005922208,0.00037627592,0.000018386105,0.000021734939,0.071826845],"genre_scores_gemma":[0.9623752,0.000007765882,0.02640229,0.000014736178,0.00008062734,0.00007613254,0.0000022641398,0.000008316061,0.01103267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972959,0.00029114404,0.00052857655,0.0001499513,0.001428854,0.00030555556],"domain_scores_gemma":[0.9960778,0.0020290324,0.000038039438,0.00089773344,0.0008226287,0.00013480514],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010544272,0.0000654315,0.00017053874,0.00036299566,0.0003362781,0.00016579352,0.00077373674,0.000045805307,0.0019328996],"category_scores_gemma":[0.0059813745,0.00004574416,0.00006089826,0.0011364486,0.00028461815,0.0003569577,0.00019973738,0.0001859261,0.0027856412],"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.0000022627128,0.0004795577,0.00041562354,0.000009873621,0.000008167084,1.09928855e-7,0.0045405934,0.00035302222,0.010838179,0.9750352,0.0047394433,0.0035779886],"study_design_scores_gemma":[0.0004752287,0.00016018095,0.005340044,0.000070273694,0.00002033202,0.00003218052,0.027235178,0.029217303,0.08963996,0.7857896,0.061622474,0.0003972232],"about_ca_topic_score_codex":0.000009169413,"about_ca_topic_score_gemma":0.000010741956,"teacher_disagreement_score":0.18924555,"about_ca_system_score_codex":0.000015136757,"about_ca_system_score_gemma":0.00006873099,"threshold_uncertainty_score":0.99897945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086334586,0.000045534533,0.91155744,0.00036390114,0.000025407691,0.0010619429,0.000009453721,0.000032731,0.0005689937],"genre_scores_gemma":[0.4551454,0.00007824663,0.54411703,0.000014597984,0.000013114019,0.00010673911,0.00001716528,0.000012361962,0.00049535476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984006,0.0000649227,0.0002980748,0.00031535805,0.00063949305,0.00028150552],"domain_scores_gemma":[0.99593896,0.0021012533,0.000062631014,0.00033084702,0.0014753798,0.000090957896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096084323,0.00012934228,0.0002081609,0.00021304979,0.00049325306,0.00085685204,0.00021923336,0.00006330857,0.000011894721],"category_scores_gemma":[0.0027122414,0.00010531474,0.000016477064,0.00072122953,0.0002403018,0.00042667016,0.00013743195,0.00018989967,0.0000020397345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029316617,0.0012036026,0.0005941934,0.005102712,0.00031154658,0.000051495477,0.007827589,0.49705645,0.008713468,0.39986435,0.0004401256,0.078541294],"study_design_scores_gemma":[0.0014513347,0.0008433194,0.000036901773,0.0006510528,0.000015126684,0.0000704877,0.0018228668,0.98256373,0.010663197,0.0012518658,0.00043132438,0.00019879515],"about_ca_topic_score_codex":0.000015248917,"about_ca_topic_score_gemma":0.00018657616,"teacher_disagreement_score":0.48550728,"about_ca_system_score_codex":0.000068536494,"about_ca_system_score_gemma":0.00078377855,"threshold_uncertainty_score":0.8262644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73208094,0.000011449251,0.26170757,0.00034922056,0.000054068514,0.00053207023,0.000016877677,0.000012736779,0.0052350927],"genre_scores_gemma":[0.96594656,0.0000016894412,0.031324457,0.0000034538295,0.00001810454,0.00005494172,0.000007448784,0.000009593009,0.0026337793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996974,0.00018649577,0.00088773447,0.0002601424,0.0015029049,0.00018870978],"domain_scores_gemma":[0.99628615,0.0009476341,0.00013338868,0.00068212004,0.001881329,0.00006936309],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045022783,0.000081376325,0.00025144813,0.0005989273,0.0003132521,0.00008678045,0.00052468426,0.00006255358,0.00082526694],"category_scores_gemma":[0.0011835296,0.000061519764,0.00009837786,0.0016701397,0.00029195598,0.00013564147,0.00014606077,0.0001807153,0.000819657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011034443,0.0005142042,0.000030566836,0.00003156687,0.000016767313,1.10100004e-7,0.002477548,0.6693086,0.077773616,0.24779461,0.00026455,0.0017768232],"study_design_scores_gemma":[0.0002527897,0.00013519544,0.0002721533,0.000035781526,0.000006730971,0.0000097359,0.0063538523,0.89902145,0.038170025,0.055496685,0.00015518504,0.00009039366],"about_ca_topic_score_codex":0.000014999885,"about_ca_topic_score_gemma":0.0000051841344,"teacher_disagreement_score":0.2338656,"about_ca_system_score_codex":0.000036661757,"about_ca_system_score_gemma":0.00013768364,"threshold_uncertainty_score":0.99995834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87129146,0.00021459954,0.06509782,0.0018074658,0.00024258856,0.0019048335,0.00017878815,0.0000421236,0.059220325],"genre_scores_gemma":[0.9507419,0.0000284014,0.028826155,0.000013222725,0.00009425345,0.00022870595,0.000023006152,0.000023773742,0.02002059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943704,0.0005799982,0.0012016598,0.0005946959,0.0029170807,0.00033619243],"domain_scores_gemma":[0.99155545,0.0033987719,0.00016550692,0.0025867717,0.0022012766,0.00009222584],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.013355672,0.00018397011,0.00055910746,0.00091280194,0.00033999162,0.00078671443,0.0026038068,0.00022462088,0.0015683952],"category_scores_gemma":[0.0063007907,0.00013978878,0.00020074092,0.0008335363,0.00044030003,0.00015111324,0.0019260594,0.0009922463,0.0020439273],"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.00003189983,0.0015026528,0.00048819502,0.0008378186,0.00014697573,0.000010007926,0.019509017,0.14057072,0.012013022,0.7911937,0.014928828,0.01876716],"study_design_scores_gemma":[0.00024414924,0.00007129134,0.0003875135,0.00042247018,0.000025494139,0.000016170005,0.0047116373,0.15285715,0.0063920533,0.8309467,0.003617638,0.00030771003],"about_ca_topic_score_codex":0.000027623946,"about_ca_topic_score_gemma":0.000029876093,"teacher_disagreement_score":0.079450436,"about_ca_system_score_codex":0.000051220406,"about_ca_system_score_gemma":0.0005521989,"threshold_uncertainty_score":0.9993443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07043,0.00007652317,0.92633617,0.0004939771,0.00004417198,0.0016116556,0.000033459706,0.000047181788,0.0009268826],"genre_scores_gemma":[0.80494636,0.000023219174,0.19355047,0.000010287896,0.0000279869,0.00077416596,0.00017498506,0.000016612097,0.00047590592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965804,0.00036421718,0.0009123788,0.0005572098,0.0013538122,0.00023195484],"domain_scores_gemma":[0.99304885,0.00032831027,0.00023569856,0.0014751878,0.0048061856,0.00010577763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010741573,0.00021203101,0.0005877429,0.0008163424,0.00042268424,0.0003719041,0.0010255211,0.00015139539,0.00013671754],"category_scores_gemma":[0.000116154464,0.00019059808,0.00011681337,0.0018859949,0.00019553976,0.00030565777,0.0010615204,0.00056908873,0.000023456898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018238137,0.009233672,0.0012349302,0.00079887576,0.0012583989,0.0000069115877,0.019135404,0.8416525,0.0031562506,0.12293104,0.00014768542,0.00042609443],"study_design_scores_gemma":[0.000633835,0.00029053402,0.00089177385,0.00014354585,0.0001339513,0.0000114512895,0.0047494057,0.9907799,0.0009057995,0.0011815277,0.000031855125,0.0002464521],"about_ca_topic_score_codex":0.00038432883,"about_ca_topic_score_gemma":0.0002753478,"teacher_disagreement_score":0.7345164,"about_ca_system_score_codex":0.00009742075,"about_ca_system_score_gemma":0.0008338919,"threshold_uncertainty_score":0.7772364},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31285036,0.00011891305,0.68490744,0.0001384942,0.000078356126,0.001400814,0.000011499128,0.00016212655,0.00033198445],"genre_scores_gemma":[0.4979391,0.000079692865,0.50146437,0.000005297553,0.000022974347,0.0003681262,0.000010689096,0.00003850385,0.00007121134],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852765,0.00012474779,0.0004145132,0.00022243505,0.00032153202,0.00038910063],"domain_scores_gemma":[0.9977261,0.00034667033,0.000067308785,0.0009975879,0.0007689403,0.00009342362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291945,0.00018028307,0.00039793435,0.00017608017,0.0006552477,0.00034728638,0.00048822528,0.000087385066,0.000009653707],"category_scores_gemma":[0.00068672426,0.000151499,0.00007746388,0.00014463803,0.00037044505,0.00020208397,0.00010286621,0.00021475033,0.0000065908393],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041945077,0.00015106506,0.000017002203,0.00048569276,0.00020508321,0.000006486329,0.0014401717,0.012988582,0.9404802,0.035345618,0.00051570946,0.008322493],"study_design_scores_gemma":[0.00037881927,0.000101643964,0.000008565188,0.0001630783,0.00002128444,0.00000462629,0.00008561993,0.48850212,0.5074982,0.00279637,0.00031360472,0.00012607721],"about_ca_topic_score_codex":0.000031005733,"about_ca_topic_score_gemma":0.000050665418,"teacher_disagreement_score":0.47551352,"about_ca_system_score_codex":0.00003982751,"about_ca_system_score_gemma":0.00007727637,"threshold_uncertainty_score":0.617795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05925926,0.0001631296,0.92955464,0.00006267312,0.000063283405,0.00027219747,0.000007150218,0.00015218035,0.010465458],"genre_scores_gemma":[0.89423555,0.00013408375,0.10501383,0.000008773914,0.00012247775,0.000027973952,0.0000074663717,0.00002914022,0.0004207313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912757,0.000091173075,0.00021945742,0.00012145855,0.0002641126,0.00017620184],"domain_scores_gemma":[0.9990931,0.0001306069,0.0000102849735,0.0003517744,0.0003675313,0.00004666763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087940105,0.000083291765,0.0001391202,0.0001654196,0.00016745263,0.00008166904,0.00013764176,0.000067877256,0.000063419495],"category_scores_gemma":[0.00011712795,0.000077441175,0.000021752465,0.00022765821,0.00022962736,0.00018082595,0.000080386606,0.00012681235,0.000017419226],"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.000044246313,0.0003201977,0.00000785832,0.00023156605,0.00020698993,0.000010134067,0.0062230616,0.08357518,0.13381901,0.742843,0.0077384314,0.024980346],"study_design_scores_gemma":[0.00006398656,0.000067006455,0.000002809571,0.00005527499,0.000005725677,0.000008426606,0.00009651262,0.77207845,0.11102705,0.11637161,0.00015273993,0.00007040929],"about_ca_topic_score_codex":0.000012999862,"about_ca_topic_score_gemma":0.00001246963,"teacher_disagreement_score":0.83497626,"about_ca_system_score_codex":0.000019159002,"about_ca_system_score_gemma":0.000023458835,"threshold_uncertainty_score":0.31579596},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009120132,0.000015187079,0.9912513,0.0034284976,0.000057571175,0.0009249316,0.00022547778,0.000052782812,0.0031322788],"genre_scores_gemma":[0.18231791,0.000006794693,0.81232446,0.00009418214,0.00002534215,0.0011106669,0.000606491,0.000016100596,0.0034980648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979096,0.00023620074,0.0005397843,0.00030926938,0.00075190654,0.00025325362],"domain_scores_gemma":[0.9971527,0.00043181606,0.00008370264,0.000512613,0.0017404818,0.00007869669],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021413546,0.00010505296,0.00021032595,0.00047122064,0.0012403015,0.00023122436,0.000742707,0.000040696115,0.0024870476],"category_scores_gemma":[0.00042661378,0.000107230975,0.00009429582,0.0016589778,0.00010594443,0.00044932755,0.00033870945,0.00019693114,0.000010370562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013173002,0.00023159775,0.0000045962674,0.0000430044,0.00003442344,2.0855525e-7,0.0010541966,0.67397314,0.00050203747,0.323704,0.00042811525,0.000023366469],"study_design_scores_gemma":[0.0004151071,0.000109776236,0.0000098476585,0.000006766551,0.00001030204,0.0000062933614,0.00054015225,0.9914681,0.000241351,0.0062949536,0.0007845569,0.00011283908],"about_ca_topic_score_codex":0.00001806082,"about_ca_topic_score_gemma":0.000025142832,"teacher_disagreement_score":0.31749493,"about_ca_system_score_codex":0.00010050489,"about_ca_system_score_gemma":0.00048803363,"threshold_uncertainty_score":0.9984248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95339465,0.000081818114,0.0036300889,0.018974768,0.0000072653825,0.0012242701,0.00003908532,0.000030537896,0.022617495],"genre_scores_gemma":[0.96959156,0.00002130475,0.029854111,0.00011792859,0.000023668106,0.0001882168,0.000008486166,0.000019580712,0.00017514128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810416,0.00035847828,0.00047403984,0.00016511504,0.0006672006,0.0002310205],"domain_scores_gemma":[0.9970258,0.0018984468,0.000031012598,0.0005922794,0.00039088068,0.000061609644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018826107,0.00009816265,0.00020911354,0.00014612167,0.00026824352,0.00008908222,0.00072241947,0.000046881334,0.0002313656],"category_scores_gemma":[0.0024721918,0.00006729057,0.000049585688,0.0012130252,0.00018669285,0.000102738064,0.00014971022,0.00040993493,0.000095010306],"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.000008812799,0.0004000001,0.000044309225,0.00018539123,0.00001624306,0.0000037337286,0.02741222,0.00007816467,0.007695274,0.960342,0.0035860983,0.0002277355],"study_design_scores_gemma":[0.0011333249,0.0005578519,0.001624006,0.00022568482,0.00004969759,0.00001790629,0.06093806,0.07067769,0.007983844,0.84995687,0.006412419,0.00042262435],"about_ca_topic_score_codex":0.000044775497,"about_ca_topic_score_gemma":0.00025288854,"teacher_disagreement_score":0.11038512,"about_ca_system_score_codex":0.000022189144,"about_ca_system_score_gemma":0.000118086195,"threshold_uncertainty_score":0.29596233},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5157413,0.002710613,0.47219732,0.0015340567,0.0003910764,0.003274736,0.0007381966,0.00007434086,0.0033383868],"genre_scores_gemma":[0.37950104,0.0014482698,0.604671,0.000023477516,0.00020034956,0.0011497807,0.00023424921,0.000099415505,0.012672416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968369,0.00016445479,0.0009859399,0.0004942525,0.0010324031,0.00048607073],"domain_scores_gemma":[0.99367815,0.0026654103,0.00013875598,0.00084353203,0.002551146,0.00012302707],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0037040466,0.00025275597,0.000768985,0.0011223812,0.0003291428,0.0006132516,0.0005288503,0.00031656417,0.00015475815],"category_scores_gemma":[0.01467514,0.00023361444,0.00014567474,0.0011614005,0.00020312308,0.00015389256,0.0012335858,0.00065753335,0.000003334761],"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.00007003863,0.0039593913,0.00007427941,0.045687795,0.0009944997,0.00001430135,0.017336205,0.00055240706,0.0013284422,0.9174259,0.009157517,0.0033992773],"study_design_scores_gemma":[0.0016347724,0.0004848473,0.00005170866,0.0025444631,0.00018859249,0.00003118136,0.00974543,0.11380699,0.005899663,0.86324763,0.001544469,0.0008202562],"about_ca_topic_score_codex":0.00007218957,"about_ca_topic_score_gemma":0.000044948265,"teacher_disagreement_score":0.13624023,"about_ca_system_score_codex":0.0001204597,"about_ca_system_score_gemma":0.00048914575,"threshold_uncertainty_score":0.9936247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028901733,0.00003533982,0.98972774,0.0039943815,0.000036142337,0.0006569063,0.000019333602,0.000019970596,0.002620031],"genre_scores_gemma":[0.60325354,0.00003669923,0.39360923,0.000043343745,0.00011526753,0.00008451822,0.000029764471,0.000031668656,0.0027959943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994564,0.00058365276,0.0009770999,0.00045645787,0.0030577122,0.00036110837],"domain_scores_gemma":[0.99643344,0.00092512585,0.00007139879,0.0006070542,0.0018055991,0.00015736427],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051408615,0.00010831,0.00029895696,0.0007221229,0.0002331281,0.0003510297,0.000974053,0.00009874845,0.0011849472],"category_scores_gemma":[0.017060885,0.00009268273,0.000052412066,0.0041681817,0.0002505929,0.00071516307,0.00031300736,0.00038730336,0.00015486541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016635444,0.00014091945,0.000053617263,0.000028873548,0.0000056977437,0.0000071204367,0.0024351154,0.97801256,0.0023164891,0.015150704,0.00032257184,0.0015096712],"study_design_scores_gemma":[0.00033603623,0.00008534294,0.000044014032,0.000025715352,0.0000014131997,0.000002198839,0.0010270695,0.971967,0.0040875454,0.022181831,0.00015873926,0.00008311106],"about_ca_topic_score_codex":0.000021715712,"about_ca_topic_score_gemma":0.00004822636,"teacher_disagreement_score":0.6003634,"about_ca_system_score_codex":0.00008845932,"about_ca_system_score_gemma":0.00032844816,"threshold_uncertainty_score":0.9997281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17945798,0.00066080614,0.8152809,0.000047423913,0.00006655696,0.00077968993,0.000014479574,0.00021671028,0.0034754626],"genre_scores_gemma":[0.38302016,0.000094602416,0.6165572,0.0000012973055,0.00003084209,0.00014886548,0.000019512716,0.000047148496,0.000080357306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982941,0.00019351584,0.00035885142,0.0002925427,0.0005440579,0.00031693457],"domain_scores_gemma":[0.99770045,0.0002736117,0.000030862404,0.0008527962,0.0010701852,0.000072082825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243541,0.00022405751,0.0004440989,0.00034142964,0.00013654098,0.00023134492,0.00037494028,0.0001813811,0.00003556213],"category_scores_gemma":[0.0001741976,0.00019558091,0.00008109321,0.0003548486,0.00015242942,0.00007357479,0.00048573606,0.0010267186,0.0000031483844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014935826,0.00035287777,0.000010789436,0.0011719583,0.0005269632,0.000031147603,0.010061449,0.9019302,0.062154867,0.020965835,0.0004856831,0.0022932675],"study_design_scores_gemma":[0.00008611927,0.00008914681,0.000019877536,0.0013665467,0.00003448056,0.00001650736,0.001994711,0.74588877,0.24754748,0.0026486798,0.00005246544,0.00025519848],"about_ca_topic_score_codex":0.00009028168,"about_ca_topic_score_gemma":0.00011751376,"teacher_disagreement_score":0.2035622,"about_ca_system_score_codex":0.0001182151,"about_ca_system_score_gemma":0.00020066185,"threshold_uncertainty_score":0.7975558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90085024,0.000073220355,0.09357304,0.00007846096,0.000027147718,0.0010543452,0.000053437918,0.000058137863,0.0042319754],"genre_scores_gemma":[0.93796515,0.000010182411,0.060948674,8.83832e-7,0.00007217406,0.00050717907,0.0001216733,0.000022134886,0.00035193676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812394,0.0007018472,0.00037999408,0.00017366066,0.00043382647,0.00018673758],"domain_scores_gemma":[0.9983703,0.0003479554,0.000064902066,0.0007638658,0.00040730558,0.00004565268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002837244,0.00012624249,0.00028999147,0.0003092816,0.0010398598,0.0001478877,0.00041736133,0.00005283459,0.00047762954],"category_scores_gemma":[0.00006966421,0.00012896342,0.00009269574,0.00033958262,0.00015383217,0.000045893066,0.0021895312,0.0022487293,0.0000027925855],"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.000064885025,0.017871441,0.011049709,0.0073801554,0.003619604,0.000006291073,0.09318802,0.14417467,0.023934405,0.3125158,0.0018696559,0.38432539],"study_design_scores_gemma":[0.00031006028,0.00039357407,0.0002885808,0.0003582243,0.00016245192,0.0000021063045,0.020183207,0.8221493,0.012444095,0.14033045,0.00278837,0.00058963493],"about_ca_topic_score_codex":0.0023409782,"about_ca_topic_score_gemma":0.00021604446,"teacher_disagreement_score":0.6779746,"about_ca_system_score_codex":0.000051190735,"about_ca_system_score_gemma":0.000097483826,"threshold_uncertainty_score":0.97697353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055255532,0.000049214053,0.92293084,0.016714087,0.000052488223,0.0030652734,0.000033374938,0.000031683394,0.0018675042],"genre_scores_gemma":[0.8357803,0.000014775623,0.16150445,0.00012320293,0.00008930398,0.00060587673,0.000023025814,0.00003238338,0.0018266318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965228,0.00022581048,0.000718427,0.00033159248,0.0018846289,0.00031676586],"domain_scores_gemma":[0.9943374,0.0033362359,0.0000933782,0.00059758907,0.0015115937,0.00012380273],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005612512,0.00011840204,0.00024591407,0.00024231903,0.00066015276,0.00055423,0.0009415136,0.00006459483,0.00016617341],"category_scores_gemma":[0.018053435,0.00006824746,0.000104025225,0.0013238328,0.00022281003,0.0001936115,0.00015097963,0.0002479472,0.00017649219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021946018,0.0001899412,0.000006914418,0.000026393092,0.000017205455,4.4539394e-7,0.007041778,0.8103902,0.00052169623,0.17328267,0.004734079,0.0037667376],"study_design_scores_gemma":[0.00020720328,0.00038044812,0.000007166255,0.000042238065,0.000008018637,0.000001394692,0.0027907356,0.97979397,0.0004477209,0.014186149,0.0020531642,0.00008181975],"about_ca_topic_score_codex":0.0000164369,"about_ca_topic_score_gemma":0.000029531533,"teacher_disagreement_score":0.7805248,"about_ca_system_score_codex":0.00002490771,"about_ca_system_score_gemma":0.0002175506,"threshold_uncertainty_score":0.9902179},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29647478,0.0003375085,0.64956826,0.00960679,0.0001482747,0.0011509605,0.00013593455,0.00007458276,0.0425029],"genre_scores_gemma":[0.9414058,0.0006132387,0.05632199,0.000044352306,0.000098021694,0.000024262463,0.0000071736526,0.00001553308,0.0014696503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953877,0.0005693861,0.00080493116,0.00029800448,0.0027064339,0.00023359408],"domain_scores_gemma":[0.99586546,0.0012211233,0.000088815046,0.0006188299,0.0020255859,0.00018017097],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007854681,0.00009133604,0.00026899384,0.00033231656,0.00039943669,0.000380756,0.00081703987,0.00006860261,0.00058193004],"category_scores_gemma":[0.021923639,0.000064659886,0.00008391293,0.001814501,0.00017222615,0.00029462343,0.00018255622,0.0002747263,0.0007859584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085819134,0.0008978894,0.0072832266,0.0000532678,0.00013597228,0.000021619648,0.04814309,0.5706295,0.010795839,0.21185683,0.09576334,0.054333616],"study_design_scores_gemma":[0.00035034385,0.00019115068,0.00069629936,0.000016890664,0.000014203511,0.0000040415075,0.0039782883,0.95004874,0.0065453644,0.024093973,0.013903115,0.000157614],"about_ca_topic_score_codex":0.00011391556,"about_ca_topic_score_gemma":0.00009503375,"teacher_disagreement_score":0.64493096,"about_ca_system_score_codex":0.000017066513,"about_ca_system_score_gemma":0.00024042149,"threshold_uncertainty_score":0.9999921},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04772535,0.00003087487,0.949744,0.00009136481,0.00002182229,0.001574108,0.00013883525,0.00009969246,0.00057393615],"genre_scores_gemma":[0.4378555,0.0000033743786,0.56177825,0.0000040386826,0.0000097129505,0.00019206249,0.00011136031,0.000021716713,0.000023963608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998709,0.000100748315,0.00040738378,0.00014726161,0.0004381802,0.00019737767],"domain_scores_gemma":[0.99875534,0.00017974772,0.000053441898,0.0002534779,0.0007210358,0.000036945516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008857009,0.00011144277,0.00026698777,0.00027519252,0.00030319946,0.00005711418,0.00019151556,0.000037396934,0.00009849949],"category_scores_gemma":[0.000052478517,0.00010639143,0.000045077784,0.00038224828,0.00022229955,0.000115692215,0.00007947846,0.00020476672,5.1425826e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028612638,0.00021954064,0.000013237157,0.0003246197,0.00007473575,8.416966e-7,0.0019578761,0.8560645,0.1355761,0.0053356723,0.00010115786,0.00030308904],"study_design_scores_gemma":[0.00042469002,0.0002508586,0.000006788281,0.00012007708,0.000016811498,0.00001224055,0.0005137063,0.8995681,0.09859279,0.0003679524,0.000031362375,0.00009466826],"about_ca_topic_score_codex":0.00003481584,"about_ca_topic_score_gemma":0.000024734542,"teacher_disagreement_score":0.39013016,"about_ca_system_score_codex":0.00006537196,"about_ca_system_score_gemma":0.00007704062,"threshold_uncertainty_score":0.43385166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5697761,0.0000874034,0.42396733,0.00043077354,0.000030510126,0.0024735075,0.0002213054,0.000013825362,0.002999233],"genre_scores_gemma":[0.94330925,0.000006173735,0.052497495,0.00001402551,0.000014932379,0.0014590236,0.00001342644,0.000018066294,0.002667626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946022,0.000690927,0.0011520077,0.00034144853,0.0028907012,0.0003227139],"domain_scores_gemma":[0.98186105,0.015116637,0.00022546115,0.00095190783,0.0017522355,0.000092679176],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.022241732,0.0001293769,0.0006563255,0.001494647,0.00082769257,0.00017200268,0.001194592,0.000046710553,0.0007583895],"category_scores_gemma":[0.012062963,0.00009046338,0.00016212794,0.003326365,0.00058265054,0.00018432685,0.00050606916,0.00027786428,0.00002742197],"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.0051683905,0.0011144294,0.000026711057,0.000081496975,0.00009591038,7.5943507e-7,0.0063410136,0.2479327,0.0017229252,0.7342334,0.00085990585,0.002422387],"study_design_scores_gemma":[0.0318693,0.0009362784,0.00010953137,0.00008787764,0.0000875857,0.00002957068,0.03669788,0.40373006,0.0039365,0.52162236,0.0005764879,0.00031655215],"about_ca_topic_score_codex":0.00010974342,"about_ca_topic_score_gemma":0.000041917247,"teacher_disagreement_score":0.37353313,"about_ca_system_score_codex":0.00007264452,"about_ca_system_score_gemma":0.00030838273,"threshold_uncertainty_score":0.99625885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8230623,0.00010184363,0.17001441,0.0003399242,0.000054605902,0.0005576255,0.0031514233,0.00001633073,0.0027015072],"genre_scores_gemma":[0.9641448,0.00019376322,0.03474286,0.0000012353671,0.00002337896,0.0000646925,0.000040151248,0.00001339231,0.0007756965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945286,0.00084776815,0.0007535053,0.00028413418,0.0033049516,0.00028103692],"domain_scores_gemma":[0.9960555,0.0012787642,0.00022657397,0.0007778426,0.001565251,0.00009609371],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0053196275,0.00011143024,0.00030874697,0.0006210653,0.0010946381,0.00015779669,0.00081055646,0.000037351405,0.0022059272],"category_scores_gemma":[0.003941087,0.000079755526,0.000099808756,0.0020106386,0.00032284166,0.00022538957,0.00024983246,0.00048046806,0.000037267822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030672114,0.0026608906,0.070623614,0.000041157644,0.00024905292,0.000016028758,0.020711118,0.801421,0.002192802,0.07068738,0.0087983515,0.022291875],"study_design_scores_gemma":[0.0031222075,0.0030768309,0.12043107,0.00008816866,0.00020693844,0.00010014585,0.04475681,0.535891,0.020396924,0.25525972,0.015693251,0.000976933],"about_ca_topic_score_codex":0.00036301365,"about_ca_topic_score_gemma":0.00032600513,"teacher_disagreement_score":0.26553,"about_ca_system_score_codex":0.0000770813,"about_ca_system_score_gemma":0.00035320548,"threshold_uncertainty_score":0.99870616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8901276,0.00001713962,0.10772442,0.00043792254,0.000050619477,0.00018128804,0.000058512393,0.000009923269,0.0013925724],"genre_scores_gemma":[0.9802708,0.000035731315,0.018405907,0.000004036338,0.000011893632,0.0000080267655,6.095003e-7,0.0000071411105,0.001255824],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997493,0.00030808666,0.00062226213,0.00033538914,0.0010344591,0.00020674506],"domain_scores_gemma":[0.9946096,0.0035889433,0.000067434376,0.00074293977,0.0008797631,0.00011130702],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008730515,0.00008100226,0.00022817541,0.0003431593,0.00035468308,0.00020621464,0.0005028845,0.000076863675,0.00085658295],"category_scores_gemma":[0.008871023,0.00004377466,0.000056148365,0.00038041951,0.00049799535,0.0003154853,0.0004046988,0.00014765516,0.0006009173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030470846,0.0003567899,0.0022983542,0.000008610032,0.0000103305565,0.0000029150551,0.0013568082,0.00021655005,0.0051668817,0.0071638743,0.0018042297,0.9815842],"study_design_scores_gemma":[0.0014396138,0.00036071177,0.012024655,0.00021456087,0.00001986687,0.000017557097,0.0058325785,0.33855203,0.0131098,0.62147164,0.006627627,0.00032936348],"about_ca_topic_score_codex":0.00014168526,"about_ca_topic_score_gemma":0.000121876794,"teacher_disagreement_score":0.9812548,"about_ca_system_score_codex":0.000038967,"about_ca_system_score_gemma":0.00009017285,"threshold_uncertainty_score":0.9994777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8699831,0.00020711788,0.12107403,0.00042768288,0.00004335893,0.000459838,0.00001465598,0.000012076605,0.007778154],"genre_scores_gemma":[0.9099837,0.0008993789,0.08481812,0.0000096310405,0.000038801598,0.00005704776,0.0000017278644,0.000009515116,0.004182098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690187,0.00033119865,0.00056524144,0.00021746261,0.0017877063,0.00019652434],"domain_scores_gemma":[0.99626666,0.0011049786,0.00006582599,0.0005414105,0.0019098988,0.00011123477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058876127,0.00007662812,0.00018313878,0.00046907298,0.0003712803,0.0006578127,0.00044613102,0.000055404358,0.00090479763],"category_scores_gemma":[0.006765632,0.000051739065,0.0000395135,0.00069329684,0.00020922752,0.000521102,0.00015426226,0.00018883921,0.000427991],"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.000034105728,0.001384281,0.06529111,0.00005912543,0.00010328613,0.000006984447,0.020550113,0.06640042,0.025661623,0.121191904,0.055735853,0.6435812],"study_design_scores_gemma":[0.00038447106,0.00015068204,0.021476397,0.0000430559,0.000011787972,0.000014575093,0.004129693,0.8151718,0.0051964507,0.15133652,0.0019023734,0.00018221693],"about_ca_topic_score_codex":0.0005272504,"about_ca_topic_score_gemma":0.00010362946,"teacher_disagreement_score":0.74877137,"about_ca_system_score_codex":0.000012408984,"about_ca_system_score_gemma":0.00009594614,"threshold_uncertainty_score":0.99068993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9131137,0.00042565778,0.021971652,0.0008480649,0.00007305177,0.0004365395,0.00004696282,0.000011610484,0.06307277],"genre_scores_gemma":[0.983017,0.000037219314,0.01629408,0.000011371417,0.0000262135,0.000041861425,0.000012767453,0.000014285361,0.0005451767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987091,0.00005493014,0.00070698856,0.0002114078,0.000078923076,0.00023869642],"domain_scores_gemma":[0.9992583,0.00018821347,0.000064663654,0.00030421137,0.00011432326,0.000070295966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034537576,0.00008092462,0.00028252814,0.00041788784,0.000050321803,0.00009957195,0.00025977546,0.00006716414,0.00018274791],"category_scores_gemma":[0.00028957313,0.00008559068,0.000034505156,0.0003083658,0.00009238849,0.00034315404,0.000086935645,0.0001632959,0.00010991783],"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.0000131472525,0.00014665586,0.0006058095,0.000066538945,0.000016321721,5.5432264e-7,0.0051577906,0.018408284,0.00024429563,0.97505814,0.00008872406,0.00019371968],"study_design_scores_gemma":[0.0006221404,0.000077456054,0.00085570826,0.000055009376,0.0000016217176,0.0000021159256,0.0020393312,0.36180034,0.00035893673,0.6336872,0.00035489528,0.00014527036],"about_ca_topic_score_codex":0.00046959808,"about_ca_topic_score_gemma":0.00037979044,"teacher_disagreement_score":0.34339204,"about_ca_system_score_codex":0.00010566823,"about_ca_system_score_gemma":0.00009959097,"threshold_uncertainty_score":0.34902865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75836146,0.000048165126,0.23801194,0.0021807132,0.000021525397,0.00041437347,0.000038101556,0.000011529215,0.00091219705],"genre_scores_gemma":[0.97036606,0.00026597935,0.028683443,0.000023176972,0.000035887842,0.000020092693,0.00004568551,0.000010784123,0.0005488638],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739534,0.0002325277,0.00083082874,0.00022072639,0.0011914528,0.00012911283],"domain_scores_gemma":[0.99682,0.0005271642,0.00013994997,0.00032702507,0.0020931016,0.00009276599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002580665,0.00007990722,0.0002752097,0.00033962328,0.00015527624,0.00017942004,0.00036224833,0.00006628242,0.00029578028],"category_scores_gemma":[0.0064920085,0.000060218703,0.00003808419,0.0014406668,0.00020823683,0.00045602728,0.00011431295,0.000114616436,0.000022941535],"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.000115219074,0.00082413456,0.005044374,0.00034290014,0.0000925359,0.000004278855,0.042375438,0.13899983,0.5288175,0.22441025,0.0043318514,0.054641664],"study_design_scores_gemma":[0.0003139163,0.00017756007,0.0011330793,0.000060056722,0.000009322902,0.000002608766,0.002162376,0.93024707,0.060554933,0.0047020847,0.00052623637,0.00011075105],"about_ca_topic_score_codex":0.000019662035,"about_ca_topic_score_gemma":0.000015042479,"teacher_disagreement_score":0.79124725,"about_ca_system_score_codex":0.000009143,"about_ca_system_score_gemma":0.00012577683,"threshold_uncertainty_score":0.77720094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23196386,0.00051401847,0.7532088,0.00043518882,0.00007788599,0.0006068512,0.00015674031,0.000009951982,0.013026665],"genre_scores_gemma":[0.81301254,0.00051894994,0.1767317,0.000006444482,0.000033668322,0.00006841627,0.00001336577,0.000012926938,0.009601995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684453,0.00054582855,0.0007199231,0.00019746921,0.0015312105,0.00016102598],"domain_scores_gemma":[0.99032396,0.003608553,0.00009923183,0.00069012603,0.0052271327,0.000050999726],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012608446,0.000060313894,0.00024696882,0.0003466597,0.00024688276,0.00013469013,0.00042279076,0.00005811296,0.00038076192],"category_scores_gemma":[0.03259732,0.000043749267,0.000107928856,0.0011006109,0.00018107619,0.00015735389,0.00010263409,0.00011167101,0.00003345801],"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.000063416075,0.00097167253,0.0013362155,0.00008473752,0.000106718835,0.0000024142382,0.011262551,0.09174784,0.016289962,0.815023,0.010665609,0.052445833],"study_design_scores_gemma":[0.00058434345,0.00018030852,0.00040419516,0.000058697256,0.00003217779,0.000006330847,0.011384821,0.22646183,0.11459457,0.63990635,0.0062502366,0.00013612701],"about_ca_topic_score_codex":0.000020357005,"about_ca_topic_score_gemma":0.00009478712,"teacher_disagreement_score":0.58104867,"about_ca_system_score_codex":0.000012149366,"about_ca_system_score_gemma":0.0003786857,"threshold_uncertainty_score":0.97555155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072087874,0.000023594797,0.96451956,0.021913687,0.000065424305,0.00044588602,0.00010164339,0.000050061833,0.005671326],"genre_scores_gemma":[0.4529326,0.0000045427355,0.5446187,0.000096717005,0.00004574033,0.0003506567,0.000028154256,0.000008274535,0.0019145878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823356,0.00022973768,0.00024310345,0.00025390915,0.00088662154,0.00015308423],"domain_scores_gemma":[0.9983147,0.00024266655,0.000019541627,0.0004645516,0.0008819083,0.00007663568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008931654,0.000058165504,0.000120587945,0.0006725074,0.00078299694,0.00015244017,0.00072364183,0.000018650408,0.0006096353],"category_scores_gemma":[0.00043910387,0.00005615022,0.00006214125,0.0027402388,0.000039517345,0.00017764991,0.0005848103,0.0002190353,0.000060889888],"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.0000017459464,0.00039672124,0.000014577536,0.0000024331744,0.000036383957,9.463897e-7,0.0091697825,0.07452412,0.0006679786,0.9128068,0.0022838346,0.0000946688],"study_design_scores_gemma":[0.00016182079,0.00014115806,0.00012797647,0.000005654911,0.00000801333,0.0000037253456,0.008125893,0.9122603,0.0004330038,0.07663047,0.0019865902,0.000115383285],"about_ca_topic_score_codex":0.00094875053,"about_ca_topic_score_gemma":0.0001417652,"teacher_disagreement_score":0.8377362,"about_ca_system_score_codex":0.00012977644,"about_ca_system_score_gemma":0.00022135527,"threshold_uncertainty_score":0.6675079},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39721042,0.000033147935,0.6012613,0.00039701484,0.000025123765,0.0005194405,0.000011562002,0.000019796256,0.0005222084],"genre_scores_gemma":[0.84846663,0.000015476182,0.15093961,0.000007739051,0.000004391635,0.00005756113,0.0000054234306,0.00000872486,0.0004944034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786466,0.0003533252,0.00055161986,0.00021309368,0.00077874825,0.00023856176],"domain_scores_gemma":[0.9971887,0.0013538742,0.0001229222,0.00058061763,0.00070591114,0.000048009573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033846025,0.00008664653,0.00025961894,0.00017740947,0.00048180527,0.00007525148,0.00067778386,0.00003345328,0.00014438451],"category_scores_gemma":[0.0013360075,0.000085584754,0.000060181825,0.0005070648,0.00035227102,0.0002130654,0.00094873604,0.00030288304,0.0000015644682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008553389,0.00014149214,0.00035567614,0.00039549542,0.000028111099,1.5474824e-7,0.009657264,0.9354561,0.005158649,0.048685305,0.0000337799,0.00007942629],"study_design_scores_gemma":[0.00023771393,0.0004406867,0.0003147298,0.000018865876,0.000005949748,0.0000015047887,0.0027147103,0.9825591,0.012241159,0.001310095,0.00008233423,0.00007314459],"about_ca_topic_score_codex":0.000106996165,"about_ca_topic_score_gemma":0.000004428844,"teacher_disagreement_score":0.45125625,"about_ca_system_score_codex":0.00004904203,"about_ca_system_score_gemma":0.00027590743,"threshold_uncertainty_score":0.37057054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16830584,0.0005027853,0.82168543,0.002553479,0.000029957842,0.0007664457,0.00040017653,0.000020621232,0.0057352455],"genre_scores_gemma":[0.96341354,0.0003280588,0.034101784,0.000008227549,0.000032233114,0.00023310163,0.00015688616,0.0000074746654,0.0017186739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774814,0.00020465098,0.0006554885,0.00029358125,0.00092629314,0.00017187641],"domain_scores_gemma":[0.9960629,0.000872638,0.00004119504,0.00061317976,0.0023135159,0.00009661715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033652673,0.00007996697,0.00019643425,0.00017274467,0.00054167997,0.00024485128,0.00027923216,0.00006073471,0.00032681972],"category_scores_gemma":[0.0022225098,0.000055646295,0.00006317142,0.0012528056,0.00032956828,0.00026303227,0.0000964322,0.00015831493,0.000039704886],"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.000008590741,0.0012594442,0.002478119,0.000064652435,0.000036015823,0.0000012886528,0.0033654105,0.0055390396,0.004985055,0.94803,0.0021837428,0.032048628],"study_design_scores_gemma":[0.00045054485,0.00008209946,0.004746691,0.000038679966,0.000015490972,0.000049493952,0.006279443,0.11169373,0.017862981,0.81662166,0.04188996,0.00026924323],"about_ca_topic_score_codex":0.000015606784,"about_ca_topic_score_gemma":0.00013173114,"teacher_disagreement_score":0.7951077,"about_ca_system_score_codex":0.0000411175,"about_ca_system_score_gemma":0.0003599488,"threshold_uncertainty_score":0.4166219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06788486,0.0004231558,0.89968264,0.002121316,0.000040063693,0.00058799254,0.00021517827,0.000022830547,0.029021973],"genre_scores_gemma":[0.9670017,0.000005856461,0.031885885,0.000044415185,0.000022380633,0.00033674977,0.000013156611,0.000012579325,0.0006772841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991897,0.0000074346617,0.00033325792,0.00017850548,0.00012114763,0.0001700076],"domain_scores_gemma":[0.999243,0.00016182038,0.000052246687,0.00033659177,0.0001694126,0.000036927704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890438,0.000056755063,0.00018076938,0.0001910264,0.00057718315,0.00004949777,0.0002997309,0.000022675995,0.00045465547],"category_scores_gemma":[0.0003135638,0.00005914539,0.00003016545,0.0005683306,0.00008003318,0.00006600316,0.00015142729,0.00024013928,0.000058431164],"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.0000049750574,0.00026851785,0.00014775735,0.000030262925,0.000010579158,7.571285e-7,0.0011789653,0.0004488038,0.00007526183,0.9975729,0.00015339635,0.00010781947],"study_design_scores_gemma":[0.0006313139,0.00081828714,0.00043239028,0.000026485692,0.0000066318757,0.000022371167,0.0030901807,0.04346018,0.00080383796,0.940603,0.009829055,0.0002762364],"about_ca_topic_score_codex":0.00046415985,"about_ca_topic_score_gemma":0.00013592283,"teacher_disagreement_score":0.8991168,"about_ca_system_score_codex":0.00005129421,"about_ca_system_score_gemma":0.00006895631,"threshold_uncertainty_score":0.49781585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15537997,0.00018098658,0.84221035,0.00027796833,0.000053585856,0.00066657,0.0006211813,0.000008126456,0.00060123135],"genre_scores_gemma":[0.9805743,0.000010168886,0.017635368,0.000008054018,0.000054294676,0.0010724553,0.000022794604,0.000014086519,0.00060848286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909014,0.000007810302,0.00047102958,0.00016982509,0.00010549144,0.00015568796],"domain_scores_gemma":[0.9989131,0.00021092902,0.00009345074,0.00044454256,0.00031158797,0.000026363115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017917734,0.000052434076,0.00016191247,0.000132247,0.0005635911,0.000048752372,0.00045194128,0.000033266388,0.000076285265],"category_scores_gemma":[0.0003660477,0.000050086233,0.000058428228,0.00037935757,0.00012713879,0.00012670597,0.00013922961,0.0001557314,0.000004427326],"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.000012994037,0.0002906418,0.000027252117,0.00008039614,0.0000107893375,1.5549288e-8,0.0017247075,0.27948922,0.0016628128,0.7164349,0.00019637831,0.00006991962],"study_design_scores_gemma":[0.00012501472,0.00012684942,0.00007221317,0.0000026471328,0.00000251264,7.4896786e-7,0.00027308415,0.8571337,0.0006756778,0.14124249,0.00029988782,0.00004521166],"about_ca_topic_score_codex":0.0001187528,"about_ca_topic_score_gemma":0.000020461837,"teacher_disagreement_score":0.8251943,"about_ca_system_score_codex":0.000054693148,"about_ca_system_score_gemma":0.0000986074,"threshold_uncertainty_score":0.4334744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042870152,0.000009455092,0.9899111,0.007852451,0.00006398743,0.00070996466,0.000017004964,0.000067092406,0.0009402836],"genre_scores_gemma":[0.025464298,0.000055095243,0.9698108,0.00010715816,0.000057476333,0.00053911447,0.000105011946,0.000019450465,0.0038416157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835396,0.00009810767,0.00038310434,0.00021979061,0.00071116374,0.00023386296],"domain_scores_gemma":[0.9969587,0.0012356085,0.00005323487,0.0005077905,0.0011967665,0.00004789931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024462794,0.000087717395,0.00013996377,0.00048740167,0.0007567787,0.00041838293,0.00067788834,0.000046131427,0.000068405636],"category_scores_gemma":[0.000995702,0.00006029491,0.000085871565,0.0019727936,0.000065307606,0.00027724687,0.00021533052,0.0001251422,0.000065825305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.166959e-7,0.000091559086,0.0000010541498,0.000021143636,0.000025232534,1.6199535e-7,0.00095384655,0.63944787,0.00008366722,0.3576722,0.0009336263,0.0007690982],"study_design_scores_gemma":[0.00014834244,0.00007005929,0.000007899415,0.00003616368,0.0000057842685,9.019001e-7,0.00026302793,0.98571926,0.00023214151,0.013325388,0.00012467422,0.000066333036],"about_ca_topic_score_codex":0.000019185263,"about_ca_topic_score_gemma":0.0000140174425,"teacher_disagreement_score":0.3462714,"about_ca_system_score_codex":0.00004552586,"about_ca_system_score_gemma":0.00015729411,"threshold_uncertainty_score":0.58206064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006064943,0.00016714502,0.9878339,0.0095093995,0.00014346902,0.0012103233,0.000016935328,0.00010386004,0.0004084421],"genre_scores_gemma":[0.010207752,0.000042536874,0.9538716,0.000029569912,0.00014675874,0.00047492966,0.000011505209,0.000031349293,0.035183966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982113,0.00018764363,0.0003381007,0.00025220067,0.0006022607,0.00040846557],"domain_scores_gemma":[0.9956276,0.0027392537,0.000034727418,0.0008219689,0.00070148706,0.00007498593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468759,0.0001062423,0.00017923242,0.00026633835,0.0006416845,0.00037833417,0.0013323252,0.000059538517,0.000045158176],"category_scores_gemma":[0.0008174623,0.00007306048,0.000072552175,0.001847484,0.000119380056,0.00025604817,0.0004260592,0.00023397205,0.0001611803],"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.00000702569,0.00010164703,2.2962377e-7,0.00020810396,0.000034181463,0.000002012794,0.0029665125,0.10789496,0.0017847155,0.87322944,0.009912135,0.0038590305],"study_design_scores_gemma":[0.00020038818,0.00008971636,0.0000016901428,0.000047508212,0.0000070288525,0.000010408753,0.00034496284,0.9087858,0.0010873085,0.08617021,0.0031751024,0.00007982846],"about_ca_topic_score_codex":0.00004516666,"about_ca_topic_score_gemma":0.000019314975,"teacher_disagreement_score":0.80089086,"about_ca_system_score_codex":0.00002507918,"about_ca_system_score_gemma":0.00026990563,"threshold_uncertainty_score":0.49353832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69696254,0.0004098687,0.216302,0.044214,0.0006167447,0.0055794334,0.00048767682,0.00056604185,0.03486169],"genre_scores_gemma":[0.9482973,0.00007876384,0.030780556,0.0000132220675,0.000119888005,0.00016652985,0.000028715936,0.000041938132,0.020473054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993554,0.00049209304,0.0007778608,0.00048228563,0.0041714394,0.0005223506],"domain_scores_gemma":[0.99368286,0.0027501173,0.000056822755,0.00096350204,0.0024061345,0.00014053936],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007288245,0.00012493097,0.00031721438,0.0019562184,0.00051663705,0.00040760823,0.0010784608,0.00009700667,0.0008551619],"category_scores_gemma":[0.019157631,0.0000922782,0.00012533709,0.0065231053,0.00047824156,0.0005338051,0.00036990584,0.0003886021,0.0012904215],"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.00015917892,0.002048657,0.0008404882,0.000229384,0.00027803757,0.00018037592,0.11023017,0.3466407,0.023277355,0.3539258,0.13741761,0.024772236],"study_design_scores_gemma":[0.0004815291,0.0002125975,0.0014587188,0.000047663074,0.0000046299215,0.000014707678,0.027517017,0.80067676,0.0057807695,0.1621712,0.0014590804,0.00017534514],"about_ca_topic_score_codex":0.000048434147,"about_ca_topic_score_gemma":0.00008468294,"teacher_disagreement_score":0.45403606,"about_ca_system_score_codex":0.00015030308,"about_ca_system_score_gemma":0.00031696763,"threshold_uncertainty_score":0.99948716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26161158,0.0002498333,0.640022,0.0014530653,0.00021669356,0.0011200779,0.00015444736,0.00004728697,0.09512501],"genre_scores_gemma":[0.9433477,0.00056096003,0.040980753,0.00002498016,0.00003740635,0.000079824094,0.0000115103185,0.00001175057,0.014945102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954802,0.00079356827,0.00088411715,0.00035624436,0.0022043432,0.00028155942],"domain_scores_gemma":[0.99316496,0.0021492522,0.00010742012,0.0009591944,0.0035318655,0.00008733633],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010749491,0.00012119048,0.0003521322,0.0009818358,0.0006884384,0.00041862408,0.0008042868,0.00010760277,0.00042819543],"category_scores_gemma":[0.019470517,0.000088409346,0.00010085324,0.0021900493,0.00039100705,0.0003368649,0.00019987996,0.0003568049,0.00030809033],"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.00015409674,0.0033810935,0.05682065,0.00010025656,0.00038149988,0.000012830534,0.027664669,0.10773296,0.0022699856,0.52503234,0.1094544,0.16699523],"study_design_scores_gemma":[0.0010311657,0.0002835588,0.005607303,0.00017330128,0.00006333623,0.0000071082977,0.013859657,0.66376364,0.018365676,0.26671532,0.029751435,0.00037848222],"about_ca_topic_score_codex":0.00035280417,"about_ca_topic_score_gemma":0.0007278664,"teacher_disagreement_score":0.6817361,"about_ca_system_score_codex":0.000054383043,"about_ca_system_score_gemma":0.00049437216,"threshold_uncertainty_score":0.9887889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023878391,0.000033018267,0.98960567,0.004586705,0.00005119822,0.00032327263,0.000056195655,0.00004083449,0.0029152443],"genre_scores_gemma":[0.15518156,0.000016306307,0.84108555,0.000037750204,0.00003825087,0.00028614124,0.00021833206,0.0000072726752,0.0031288308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858946,0.00011292218,0.00033748787,0.00023649681,0.00054722663,0.00017643425],"domain_scores_gemma":[0.9964164,0.00039488683,0.00003164227,0.00040342455,0.0026859343,0.000067725334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000950595,0.00006742838,0.00014851474,0.00019879818,0.00047361825,0.0002856332,0.00036425874,0.00004535274,0.00021247409],"category_scores_gemma":[0.0006688409,0.00006275644,0.000096467506,0.001189714,0.00007921294,0.00037023274,0.00015816018,0.00009694797,0.000023084736],"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.0000010865682,0.0008187708,0.00005950546,0.00006450375,0.00006594037,9.2220904e-7,0.00042337546,0.031164208,0.0022085484,0.96366984,0.0009444885,0.0005787904],"study_design_scores_gemma":[0.00020495309,0.000036725483,0.00022997393,0.000021182539,0.00000938457,0.0000074183613,0.00018492046,0.96126217,0.004272925,0.033063494,0.00062497327,0.00008190299],"about_ca_topic_score_codex":0.000019592382,"about_ca_topic_score_gemma":0.00004199704,"teacher_disagreement_score":0.93060637,"about_ca_system_score_codex":0.00003816239,"about_ca_system_score_gemma":0.00044041694,"threshold_uncertainty_score":0.36427367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008896418,0.00016125993,0.9844409,0.001014822,0.000042031952,0.0036417188,0.00012240894,0.00007668068,0.001603757],"genre_scores_gemma":[0.01658659,0.000020448759,0.9783471,0.0000100967445,0.000022044735,0.0017280255,0.00004471822,0.00005201775,0.0031889114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718195,0.0006033624,0.0005965765,0.00031246734,0.0008275356,0.00047808318],"domain_scores_gemma":[0.9954126,0.002870178,0.000069884365,0.0004599179,0.0010527008,0.00013471728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065320986,0.0001428808,0.00034221305,0.000526974,0.0011774012,0.000115157505,0.00038978254,0.0000504471,0.00043096862],"category_scores_gemma":[0.004583223,0.00013789964,0.00007701387,0.00090589887,0.00036077914,0.00014891617,0.00037180577,0.0004328163,0.0000023471555],"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.00009183672,0.0022823012,0.000018025881,0.0019112208,0.0002781403,0.000006780515,0.011765817,0.009609821,0.028288646,0.8809033,0.0017752135,0.06306888],"study_design_scores_gemma":[0.0018572677,0.00078342773,0.0000030675403,0.00006275171,0.000038891547,0.00005454551,0.016279679,0.8546277,0.010833934,0.108819835,0.0063304887,0.00030837103],"about_ca_topic_score_codex":0.000015218537,"about_ca_topic_score_gemma":0.000018003871,"teacher_disagreement_score":0.8450179,"about_ca_system_score_codex":0.0001253149,"about_ca_system_score_gemma":0.00024413022,"threshold_uncertainty_score":0.9055737},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07558361,0.00013337148,0.64167285,0.007199781,0.00019602547,0.005832823,0.000024398936,0.0001670833,0.26919007],"genre_scores_gemma":[0.8798604,0.000010204221,0.07597057,0.00038954048,0.00022442044,0.0020646339,0.00010529347,0.000042424686,0.041332483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989383,0.000010679624,0.0003074423,0.00019013089,0.00028618335,0.00026723085],"domain_scores_gemma":[0.99859387,0.00012275143,0.000037929527,0.00038733016,0.0008485889,0.000009538948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095904,0.000100936624,0.00017542826,0.00064526196,0.00046556187,0.00034860172,0.0003113195,0.000039445586,0.00017172132],"category_scores_gemma":[0.00034218963,0.00008022051,0.00004866485,0.00099169,0.00011651659,0.0004696694,0.00016130524,0.00009953846,0.000025452271],"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.000022262378,0.0004022924,0.000107582644,0.0018231294,0.00007204718,2.73548e-7,0.00016850593,0.0016461713,0.0013266002,0.9842526,0.009651791,0.0005267746],"study_design_scores_gemma":[0.0011039118,0.0000510366,0.000059402708,0.00021631067,0.000056653425,2.7977643e-7,0.003008592,0.91822696,0.0014022923,0.027236793,0.048478305,0.00015947054],"about_ca_topic_score_codex":0.00013303595,"about_ca_topic_score_gemma":0.0002074406,"teacher_disagreement_score":0.95701575,"about_ca_system_score_codex":0.00003820214,"about_ca_system_score_gemma":0.00007819218,"threshold_uncertainty_score":0.35807726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97439605,0.000016543941,0.0002304638,0.00017460436,0.00003561532,0.0001354103,0.000005444357,0.000008164267,0.024997693],"genre_scores_gemma":[0.99532574,0.000003464305,0.0037411205,0.000066967004,0.00026723213,0.0000018371173,0.000039135295,0.000014668148,0.00053985673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920034,0.0000017187491,0.00027360648,0.00010909267,0.00022168011,0.0001935779],"domain_scores_gemma":[0.99903363,0.000073473486,0.000048927523,0.00028134117,0.00054842484,0.000014210757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002841894,0.000074334406,0.000175978,0.00013302293,0.000108330525,0.00040126697,0.0001785073,0.000040152318,0.00055600493],"category_scores_gemma":[0.00023836752,0.00005933778,0.000058964164,0.0006692286,0.000020701389,0.0009571408,0.00016431407,0.00012114505,0.000075755],"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.000022000017,0.00032974128,0.0013871156,0.00069746637,0.00012551175,0.0000037639456,0.00041734317,0.45206502,0.003888332,0.5298231,0.008823541,0.0024170482],"study_design_scores_gemma":[0.0013210025,0.00015860969,0.008567827,0.00088305573,0.000052142645,0.000009979994,0.003373989,0.6268423,0.0035177425,0.35321844,0.0015162769,0.0005386111],"about_ca_topic_score_codex":0.00047054456,"about_ca_topic_score_gemma":0.00059937616,"teacher_disagreement_score":0.17660467,"about_ca_system_score_codex":0.000027841621,"about_ca_system_score_gemma":0.00014729737,"threshold_uncertainty_score":0.60878646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29830995,0.00032599733,0.6975836,0.0012009977,0.000054227203,0.0011174835,0.0003459121,0.00002157282,0.0010402652],"genre_scores_gemma":[0.8488093,0.00043129752,0.1460033,0.000017948312,0.000024904639,0.0005673596,0.00004831249,0.00001544288,0.0040821247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996405,0.0004065568,0.0007405705,0.00031946212,0.0018829505,0.00024548062],"domain_scores_gemma":[0.99562836,0.0012860287,0.00011486121,0.0005893351,0.002292784,0.000088651555],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.011002618,0.00009602644,0.0002246803,0.00060388894,0.001761873,0.00025591036,0.00057061214,0.000045572793,0.00016206037],"category_scores_gemma":[0.006897496,0.000080538826,0.00006732335,0.0009984114,0.00022243535,0.00028672206,0.00029242688,0.00024296054,0.000011668971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018326346,0.00014839928,0.00028064003,0.000006633602,0.000015012944,1.2370896e-7,0.0030692883,0.93890387,0.0002602075,0.0474514,0.0065768077,0.0032693075],"study_design_scores_gemma":[0.00027666756,0.00010999622,0.000069769834,0.000003858073,0.00001145695,0.0000034227344,0.004585482,0.9484888,0.00018235332,0.042444088,0.0037418592,0.00008226169],"about_ca_topic_score_codex":0.00014619905,"about_ca_topic_score_gemma":0.00013148968,"teacher_disagreement_score":0.5515803,"about_ca_system_score_codex":0.000072222545,"about_ca_system_score_gemma":0.00046066748,"threshold_uncertainty_score":0.9995377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0401823,0.00009056115,0.95831794,0.0006528005,0.00003636817,0.0004238742,0.000011354228,0.000023547584,0.00026122938],"genre_scores_gemma":[0.5369075,0.0000148767,0.4629016,0.000021801476,0.000007980049,0.00010437899,0.000001013807,0.0000061609758,0.000034683377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984658,0.000101724625,0.0003170692,0.00032262626,0.00052188186,0.0002709193],"domain_scores_gemma":[0.99750775,0.0015597064,0.00003651329,0.00051065255,0.0003008495,0.000084509964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558676,0.00010110281,0.00018939193,0.000291987,0.0008891636,0.00035589773,0.000624827,0.0000547518,0.000025141855],"category_scores_gemma":[0.00087115663,0.000096631666,0.000026598198,0.00054278405,0.00011398405,0.00021271704,0.00076279667,0.0003538009,0.00000131642],"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.000009946204,0.00012494727,0.000070267524,0.00011793653,0.000011211313,0.0000022211761,0.005009651,0.004128949,0.0006444248,0.96424,0.00008190997,0.02555855],"study_design_scores_gemma":[0.00010350994,0.00014959797,0.00005002352,0.00009445985,0.0000023043776,0.000007255636,0.00041963975,0.672789,0.00015008291,0.32614103,0.000018009268,0.00007510823],"about_ca_topic_score_codex":0.000020412406,"about_ca_topic_score_gemma":0.000018542638,"teacher_disagreement_score":0.66866004,"about_ca_system_score_codex":0.00003226347,"about_ca_system_score_gemma":0.00018418166,"threshold_uncertainty_score":0.6838817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976914,0.0015414783,0.004621007,0.0018311506,0.000686853,0.0030688236,0.00009788382,0.000066708955,0.01117213],"genre_scores_gemma":[0.99046826,0.0000363483,0.0003927331,0.0000025399452,0.000028103392,0.00039178773,0.000004022953,0.00001757482,0.008658636],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845517,0.00023228873,0.00040876964,0.00008550307,0.0006526772,0.00016558787],"domain_scores_gemma":[0.99887323,0.00013836371,0.00003321635,0.000618955,0.00031315134,0.00002305335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017709112,0.00006343185,0.00014049011,0.000068713125,0.0006791348,0.00007534037,0.00050015,0.000020732596,0.000112872454],"category_scores_gemma":[0.00026802032,0.00003219756,0.00006632798,0.00038601333,0.000104050596,0.00005775843,0.0001697871,0.00021041886,0.000008373509],"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.000016739947,0.00030002158,0.000064793225,0.0005293343,0.00019852402,8.3722244e-7,0.008274111,0.35796317,0.5223857,0.08524696,0.019166553,0.0058532148],"study_design_scores_gemma":[0.00030193946,0.00003548156,0.00019752003,0.000021833506,0.000010823977,0.000004861302,0.0017410293,0.97349805,0.014313677,0.0007448914,0.009059956,0.00006995568],"about_ca_topic_score_codex":0.00024298075,"about_ca_topic_score_gemma":0.00016077819,"teacher_disagreement_score":0.61553484,"about_ca_system_score_codex":0.000087499575,"about_ca_system_score_gemma":0.00008052246,"threshold_uncertainty_score":0.52234244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11949578,0.00018664799,0.86738837,0.0006359362,0.00044790376,0.0034609367,0.000097466705,0.00026347698,0.008023468],"genre_scores_gemma":[0.7236526,0.000011970783,0.2707243,0.000027580072,0.00048697385,0.0008931015,0.00030490893,0.000050444643,0.0038481255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982031,0.000053395615,0.00062949647,0.00036913698,0.00044331682,0.00030152596],"domain_scores_gemma":[0.9964028,0.00028464635,0.00014978227,0.000690431,0.0024600218,0.000012293003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023805776,0.00019828607,0.00045785675,0.00090997096,0.00040809024,0.00043422377,0.0005520368,0.00017570535,0.00005288486],"category_scores_gemma":[0.0020227507,0.00018697481,0.0001730369,0.00071344257,0.00010642396,0.00033882802,0.0009239298,0.00039937388,0.000060946666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027972952,0.00032629704,0.000009140803,0.00960896,0.00014574108,0.0000016167273,0.00026227382,0.49849728,0.0012499808,0.48929054,0.00039402265,0.00018616792],"study_design_scores_gemma":[0.00021134454,0.000011297746,0.0000020293683,0.0012931667,0.0001309647,3.4612174e-7,0.0014681531,0.98671526,0.0009549174,0.008554891,0.000494616,0.0001630372],"about_ca_topic_score_codex":0.00019638897,"about_ca_topic_score_gemma":0.0001708685,"teacher_disagreement_score":0.6041568,"about_ca_system_score_codex":0.00014747331,"about_ca_system_score_gemma":0.00012891187,"threshold_uncertainty_score":0.7624611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75430727,0.000042244632,0.21407904,0.0045622294,0.00009327615,0.00050445204,0.000032117307,0.00002313526,0.026356269],"genre_scores_gemma":[0.94843024,0.00009819037,0.04076837,0.000006890839,0.00003172663,0.00002912521,0.0000012402614,0.000007539546,0.010626678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966426,0.00030549022,0.00074501697,0.00023779865,0.0018652935,0.00020379959],"domain_scores_gemma":[0.9953964,0.0014752182,0.00004994616,0.0009230279,0.0020710933,0.00008436815],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009664,0.000062724364,0.00019359736,0.00043023744,0.00021214854,0.00014862716,0.00050628436,0.00005281461,0.0016236609],"category_scores_gemma":[0.014646981,0.000031874915,0.00006804122,0.0009047525,0.00028581018,0.0003129324,0.00015431846,0.00008126854,0.0008710479],"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.000034287117,0.0017538702,0.007922292,0.000049020822,0.000051194114,0.0000058693413,0.008111841,0.010003602,0.12827837,0.6250137,0.05068293,0.16809301],"study_design_scores_gemma":[0.0011780492,0.00042931503,0.01074562,0.00017649132,0.00001265332,0.000018788855,0.00363869,0.13168184,0.13384531,0.6962941,0.021549542,0.00042954905],"about_ca_topic_score_codex":0.00003099816,"about_ca_topic_score_gemma":0.000053575048,"teacher_disagreement_score":0.194123,"about_ca_system_score_codex":0.00003515179,"about_ca_system_score_gemma":0.00015956968,"threshold_uncertainty_score":0.9999069},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021996269,0.00009263974,0.9752879,0.00022480529,0.000038600178,0.00068876415,0.0000029878756,0.000027227432,0.0016408109],"genre_scores_gemma":[0.19816452,0.000015717744,0.8010958,0.0000137875195,0.000027070684,0.000080914295,0.0000031062564,0.000019501482,0.0005796255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950031,0.0014748904,0.00082442665,0.00041435042,0.0019245679,0.00035865977],"domain_scores_gemma":[0.99376994,0.004157502,0.00008774264,0.0006618727,0.0011681208,0.0001547998],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.016972905,0.00014391553,0.00033719387,0.00056001544,0.0004188168,0.00063700305,0.000581011,0.00009103633,0.00028807422],"category_scores_gemma":[0.008683549,0.00011209964,0.00005639914,0.0011261207,0.00040483766,0.00043634043,0.00029080702,0.00022514242,0.00009494457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003758073,0.0004208925,0.00008822813,0.00004308749,0.000024001682,0.0000017962436,0.0039505665,0.8483805,0.08532044,0.04106403,0.00044404232,0.020224798],"study_design_scores_gemma":[0.0002484159,0.0003215109,0.000013187246,0.000027217928,0.0000058963533,0.000011911509,0.0009759708,0.962717,0.029625928,0.005652652,0.0002877614,0.00011255855],"about_ca_topic_score_codex":0.000020572437,"about_ca_topic_score_gemma":0.0000020576408,"teacher_disagreement_score":0.17616825,"about_ca_system_score_codex":0.00003859515,"about_ca_system_score_gemma":0.00007967908,"threshold_uncertainty_score":0.99966675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037145317,0.000031389616,0.95919925,0.0003210975,0.00005107023,0.0006405224,0.00022320605,0.000048729744,0.0023394355],"genre_scores_gemma":[0.5128616,0.0000146347265,0.48645332,0.000020528674,0.000004275812,0.00017168288,0.00005312824,0.000012619789,0.00040820733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968437,0.00044253707,0.00067616074,0.00040905108,0.0013306017,0.00029797197],"domain_scores_gemma":[0.9967446,0.00046493643,0.00007844862,0.001087738,0.0015561398,0.00006816487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011952239,0.00014368084,0.00043456018,0.0011300199,0.00078784337,0.0001037838,0.0010906814,0.00004572105,0.00029912597],"category_scores_gemma":[0.000352392,0.00014216335,0.00012327849,0.004956095,0.00024835352,0.00076613156,0.00062897516,0.00037981643,0.000007476451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038518615,0.0003497831,0.0000026919167,0.000009652283,0.00013690013,0.0000012560022,0.0035645429,0.653452,0.00093235594,0.3414443,0.000018180011,0.00008451486],"study_design_scores_gemma":[0.00032464424,0.00016057206,0.000011062493,0.000009321041,0.00003959747,0.000003651738,0.0015432818,0.9868362,0.003530399,0.0074069775,0.000012915007,0.00012136218],"about_ca_topic_score_codex":0.00014848277,"about_ca_topic_score_gemma":0.000074037045,"teacher_disagreement_score":0.4757163,"about_ca_system_score_codex":0.00015802117,"about_ca_system_score_gemma":0.0003432021,"threshold_uncertainty_score":0.6059534},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9628516,0.000027688895,0.0316811,0.0008403201,0.000053524393,0.0008837434,0.000019234403,0.000020061074,0.0036227298],"genre_scores_gemma":[0.9740182,0.000005742767,0.024444472,0.000009046209,0.000012933668,0.00031153942,0.0000032453565,0.000017260256,0.0011775711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968205,0.0005085103,0.00047354348,0.00024057912,0.0016048816,0.00035199997],"domain_scores_gemma":[0.997324,0.00078323204,0.00006783922,0.0011902855,0.00057804404,0.00005662886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032301722,0.00010141097,0.00025193612,0.00029854808,0.00053588423,0.00009511442,0.0019275725,0.000031466498,0.00029862518],"category_scores_gemma":[0.00054369617,0.00007666532,0.000108023305,0.0015194678,0.0005636752,0.00016991887,0.0014067802,0.00053762464,0.0000139661415],"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.00003793121,0.0016683982,0.00068469124,0.00017484838,0.00008197686,0.0000037520304,0.008237154,0.0058273706,0.039608873,0.9409118,0.00044518104,0.0023180165],"study_design_scores_gemma":[0.0012642064,0.002106495,0.0008627722,0.0003194229,0.00001618445,0.000059655154,0.011255123,0.7684937,0.12634614,0.08675729,0.0020083329,0.00051065657],"about_ca_topic_score_codex":0.00006242567,"about_ca_topic_score_gemma":0.000011274472,"teacher_disagreement_score":0.8541545,"about_ca_system_score_codex":0.00008223407,"about_ca_system_score_gemma":0.00020770004,"threshold_uncertainty_score":0.41216424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14803828,0.000004805122,0.8491558,0.0013893006,0.000010902016,0.0005796467,0.000012069753,0.00003269784,0.0007764975],"genre_scores_gemma":[0.94162124,0.0000050376975,0.057792753,0.000007909841,0.000006006068,0.00012492694,0.00003824723,0.0000049211662,0.0003989467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840224,0.00020444716,0.00032667755,0.00019801591,0.00071761553,0.00015100915],"domain_scores_gemma":[0.99829286,0.00031391124,0.0000590539,0.0005817617,0.0007204091,0.000032008305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016136621,0.000065710075,0.00019919603,0.0008934617,0.00018912424,0.00008382015,0.00035755202,0.000036962665,0.000017913577],"category_scores_gemma":[0.00013094234,0.00004343592,0.000089485104,0.012005079,0.00011366449,0.00018696426,0.00017731987,0.00011504788,0.000010448893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033163435,0.00044762998,0.007182551,0.00004364087,0.00026667278,5.1842085e-7,0.0017454022,0.58159417,0.0008379816,0.40734518,0.000022229731,0.0005107444],"study_design_scores_gemma":[0.00009425604,0.000032135147,0.02963616,0.00001377448,0.00006808131,4.270108e-7,0.0004392354,0.96817636,0.00037573726,0.0010960982,0.000021767708,0.00004594149],"about_ca_topic_score_codex":0.00018899508,"about_ca_topic_score_gemma":0.0008892576,"teacher_disagreement_score":0.793583,"about_ca_system_score_codex":0.000034563647,"about_ca_system_score_gemma":0.00015987392,"threshold_uncertainty_score":0.5768042},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97632307,0.00002222448,0.0059205345,0.00086325576,0.00022241243,0.00041447993,0.00005473888,0.00006693095,0.016112346],"genre_scores_gemma":[0.9750861,0.000019297415,0.015259496,0.000020341995,0.000055859324,0.000047182137,0.000010505439,0.00002158891,0.009479622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502605,0.00033326063,0.0012024107,0.00050154247,0.0024787302,0.0004579771],"domain_scores_gemma":[0.9929485,0.0035396644,0.000090555084,0.0013290283,0.0019477907,0.00014451455],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.017073086,0.00013522072,0.00038693662,0.00081107643,0.0005906793,0.0007639343,0.0012888589,0.000111991474,0.0017263998],"category_scores_gemma":[0.011421842,0.000102707214,0.00013711592,0.0016968953,0.00026090257,0.00036564306,0.00066407607,0.0003524466,0.0074826097],"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.00016146491,0.003701296,0.005961074,0.00027233936,0.00019870551,0.000099200006,0.013595947,0.20379797,0.026160166,0.09305188,0.10692675,0.5460732],"study_design_scores_gemma":[0.0005478982,0.00016264827,0.0016354371,0.0001201659,0.000013540223,0.000012523395,0.011246825,0.703334,0.0032342763,0.27527505,0.004098548,0.0003190926],"about_ca_topic_score_codex":0.00007967896,"about_ca_topic_score_gemma":0.000115969335,"teacher_disagreement_score":0.54575413,"about_ca_system_score_codex":0.00007149939,"about_ca_system_score_gemma":0.00025794268,"threshold_uncertainty_score":0.99918616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10444824,0.00006104539,0.8923899,0.0005635,0.000062677755,0.0015168191,0.00033526868,0.000022389955,0.00060016883],"genre_scores_gemma":[0.9703334,0.000009054362,0.028328894,0.000012029985,0.000046640256,0.0009792298,0.00005861385,0.000025509838,0.00020660419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835855,0.000019660487,0.0007520741,0.00029255755,0.0002682157,0.00030897348],"domain_scores_gemma":[0.99837327,0.00020972293,0.00010144838,0.00042856444,0.00080201344,0.00008497065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023371482,0.00011266086,0.00037670427,0.00061036245,0.00023529203,0.000070816284,0.00033627878,0.000081561906,0.00014940402],"category_scores_gemma":[0.0006936035,0.00012068699,0.00006123289,0.0012126281,0.000103951825,0.00018702216,0.00014121708,0.00012943467,0.00013033404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009791076,0.000141387,0.0000013695465,0.000068292415,0.000012194262,6.563095e-8,0.00065993244,0.60936016,0.00043488218,0.3890896,0.00009982806,0.000122456],"study_design_scores_gemma":[0.00047872192,0.00006396555,0.000117035306,0.000047518504,0.000008065077,9.973968e-7,0.00045497355,0.89562935,0.000070556736,0.10301838,0.0000071150403,0.000103335195],"about_ca_topic_score_codex":0.000094564064,"about_ca_topic_score_gemma":0.000017841245,"teacher_disagreement_score":0.8658852,"about_ca_system_score_codex":0.00008667839,"about_ca_system_score_gemma":0.00011424559,"threshold_uncertainty_score":0.49214727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98710024,0.00011614732,0.0022327502,0.00065945985,0.000011216853,0.00048437293,0.00011055929,0.000021467773,0.009263811],"genre_scores_gemma":[0.997395,0.00003206539,0.00042783265,0.0000068189747,0.000008716926,0.00005464726,0.0000049178193,0.000018148874,0.0020518664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898684,0.00004243749,0.0003799953,0.00022135912,0.0000901703,0.0002792194],"domain_scores_gemma":[0.99932724,0.00018116517,0.000046961017,0.00027556214,0.00011478594,0.00005427378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018137818,0.000102012484,0.00033439873,0.00043777947,0.00016362134,0.00012918892,0.00017906974,0.00004820741,0.000060030554],"category_scores_gemma":[0.00022528139,0.00008700057,0.000025862553,0.0003191212,0.0002449494,0.00018211173,0.000049773473,0.00015501423,0.000105744395],"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.000046771613,0.00008216502,0.00011655509,0.000058578935,0.000032390697,0.0000010864067,0.0016655796,0.21720588,0.00023307816,0.7805302,0.000018478386,0.000009194631],"study_design_scores_gemma":[0.0013168046,0.000492509,0.00068469153,0.00017274352,0.0000058133546,0.0000031690795,0.0041174353,0.782758,0.00018165004,0.21000406,0.000015972408,0.00024716294],"about_ca_topic_score_codex":0.00059897255,"about_ca_topic_score_gemma":0.0003775361,"teacher_disagreement_score":0.5705262,"about_ca_system_score_codex":0.000069306756,"about_ca_system_score_gemma":0.00007409199,"threshold_uncertainty_score":0.354778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7388003,0.000129877,0.25896144,0.00029005724,0.000059706326,0.0005449314,0.00009014369,0.000035815814,0.001087747],"genre_scores_gemma":[0.9830004,0.0023427147,0.01304669,0.0000019285048,0.000030472685,0.00005993433,0.00007148811,0.000014444816,0.0014319239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645317,0.000439937,0.0010017536,0.0002786612,0.0015965799,0.00022989634],"domain_scores_gemma":[0.99596584,0.0007646735,0.00020648609,0.00066408527,0.0023127818,0.00008611064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009195009,0.000096222655,0.00022953298,0.001195504,0.0006992676,0.00015883529,0.00027114796,0.000093293565,0.000064416745],"category_scores_gemma":[0.0063952454,0.0000779401,0.00006181766,0.0030434285,0.0002693634,0.00044180363,0.00012543563,0.00013931513,0.000062498686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060708473,0.0011953,0.011782962,0.000177559,0.00013249952,0.000027204771,0.044405386,0.41344908,0.031487536,0.31126404,0.0130553255,0.1729624],"study_design_scores_gemma":[0.00029901604,0.000095023854,0.003882314,0.000034046916,0.000028111095,0.000034572444,0.0051788124,0.95243937,0.002525369,0.03447807,0.0008830834,0.00012219456],"about_ca_topic_score_codex":0.00030061722,"about_ca_topic_score_gemma":0.00064086524,"teacher_disagreement_score":0.5389903,"about_ca_system_score_codex":0.00004246417,"about_ca_system_score_gemma":0.0001532705,"threshold_uncertainty_score":0.76561683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024916226,0.000027950851,0.97263587,0.00094154396,0.000033974127,0.00089140795,0.000011173174,0.000086776236,0.00045508973],"genre_scores_gemma":[0.17102721,0.00007109307,0.82571834,0.00000872727,0.000035353416,0.0004580245,0.000020006191,0.00002425772,0.002636997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984334,0.00012478139,0.00027566933,0.00027253095,0.00055367,0.00033992226],"domain_scores_gemma":[0.9974735,0.00078583334,0.00002150228,0.00057148724,0.0010661486,0.00008157371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031272036,0.00008287509,0.00015881742,0.0005779763,0.00045347106,0.000205675,0.0006458498,0.00005768371,0.000012572021],"category_scores_gemma":[0.0016429109,0.00007250248,0.000034835342,0.0016204859,0.00026048473,0.0006178936,0.0004921997,0.00018455074,0.000020724525],"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.000009341585,0.00013296075,0.000020198207,0.00030660254,0.000019097322,0.0000015982415,0.0023934634,0.12567936,0.0030013686,0.86616707,0.00027822857,0.0019907057],"study_design_scores_gemma":[0.00019417284,0.000097002136,0.000012243781,0.000034926903,0.000001390138,0.0000029144755,0.00025904374,0.93170047,0.0040642153,0.063444495,0.00012052058,0.00006859446],"about_ca_topic_score_codex":0.0000052081245,"about_ca_topic_score_gemma":0.000009210828,"teacher_disagreement_score":0.8060211,"about_ca_system_score_codex":0.00002855337,"about_ca_system_score_gemma":0.0001322126,"threshold_uncertainty_score":0.34877786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9071207,0.0003474333,0.086318076,0.0019029555,0.000051715586,0.0005050093,0.000079044046,0.000015790802,0.0036592924],"genre_scores_gemma":[0.9571271,0.00004573946,0.041856147,0.000002478006,0.000010478074,0.000028651491,8.3050077e-7,0.0000047511926,0.0009238443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700737,0.00033590975,0.00073353096,0.00030589223,0.0014603197,0.0001569805],"domain_scores_gemma":[0.994228,0.0036164375,0.000028870498,0.0006307339,0.0014256916,0.000070266615],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010043962,0.00006752271,0.00024015298,0.00041055234,0.0002094307,0.00022906158,0.00038640774,0.00005941542,0.00030841766],"category_scores_gemma":[0.0130448695,0.00004406839,0.00007054431,0.0010718401,0.000802384,0.00037714708,0.0002810851,0.00024681925,0.00006752139],"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.00001105832,0.0006583654,0.00026438606,0.00054787315,0.000045486813,0.0000031530565,0.025489112,0.008300965,0.024850503,0.9298916,0.00083731994,0.009100207],"study_design_scores_gemma":[0.00006352633,0.00007658705,0.0006316316,0.0001076974,0.0000052349233,0.000005033303,0.0022120376,0.34552038,0.016940698,0.6343351,0.00005175023,0.00005030235],"about_ca_topic_score_codex":0.00015578681,"about_ca_topic_score_gemma":0.0003171871,"teacher_disagreement_score":0.33721942,"about_ca_system_score_codex":0.000030229823,"about_ca_system_score_gemma":0.000298647,"threshold_uncertainty_score":0.99526864},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.765898,0.0021786047,0.22541441,0.0010793809,0.00003299995,0.0016754048,0.00013430891,0.000031359315,0.0035555374],"genre_scores_gemma":[0.9605148,0.0016435398,0.035993382,0.0000043870164,0.000021260465,0.00023842152,0.000003435149,0.000010512429,0.0015702681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796057,0.00023575847,0.0005215986,0.0002434836,0.0009173639,0.000121232566],"domain_scores_gemma":[0.9965985,0.0016441304,0.000033087894,0.00040559986,0.0012391746,0.00007953366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052118115,0.00007057896,0.00021680811,0.00059591694,0.0001892748,0.00032042456,0.00023242051,0.000048107035,0.00004396436],"category_scores_gemma":[0.0026989055,0.000050103536,0.000026894815,0.0010576366,0.00034702496,0.00019971252,0.000121029545,0.00011542946,0.000015067822],"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.00002926166,0.0003609552,0.005297189,0.00059204106,0.0001031806,0.0000015787504,0.04553088,0.023953207,0.0081190495,0.7352041,0.0026841897,0.17812438],"study_design_scores_gemma":[0.0004362172,0.0005066365,0.004415569,0.00043783567,0.000076805416,0.0000235535,0.02574443,0.34890932,0.027922977,0.5571186,0.033985637,0.00042240086],"about_ca_topic_score_codex":0.00010600848,"about_ca_topic_score_gemma":0.00014712705,"teacher_disagreement_score":0.32495612,"about_ca_system_score_codex":0.000011743502,"about_ca_system_score_gemma":0.00014941736,"threshold_uncertainty_score":0.3231037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009294115,0.000119487486,0.9800174,0.0018168899,0.00019801703,0.00031803947,0.000014790996,0.00012278708,0.008098465],"genre_scores_gemma":[0.7709373,0.000027832937,0.22687295,0.00002829702,0.000055886474,0.00006437948,0.00001240763,0.000016367889,0.0019845695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832344,0.00012287605,0.00031765318,0.00028075647,0.0007195478,0.00023574548],"domain_scores_gemma":[0.99830043,0.00065406266,0.000012446079,0.0005862771,0.00038172049,0.00006507719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011470346,0.000098535784,0.00014730939,0.0005405615,0.00023948324,0.0005024234,0.0006958355,0.000055721026,0.00014187043],"category_scores_gemma":[0.0003594445,0.00008375471,0.00007335615,0.0011495297,0.00020887113,0.0002967278,0.00019892986,0.00027882197,0.00017279398],"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":[8.147117e-7,0.00016616932,4.942021e-7,0.00011058328,0.000020927757,0.000008968816,0.0012874671,0.0036877869,0.00072408584,0.98742086,0.0025614186,0.0040104347],"study_design_scores_gemma":[0.000075201766,0.00010086322,0.000004580638,0.00017295874,0.0000024668013,0.0000106376865,0.00014674108,0.8631026,0.0037047642,0.13177113,0.00082897505,0.00007903998],"about_ca_topic_score_codex":0.000012433959,"about_ca_topic_score_gemma":0.000013802297,"teacher_disagreement_score":0.8594149,"about_ca_system_score_codex":0.000038649698,"about_ca_system_score_gemma":0.00018511075,"threshold_uncertainty_score":0.484488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056931876,0.00016170494,0.9144968,0.00029429974,0.00008844147,0.0006450977,0.000080206024,0.00011086557,0.027190734],"genre_scores_gemma":[0.29362425,0.00001507956,0.7044503,0.0000044349276,0.00005423863,0.000104916086,0.0000072139046,0.000026137257,0.0017134339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976142,0.00034815146,0.0005817669,0.00030269066,0.00081315165,0.00034005803],"domain_scores_gemma":[0.9940716,0.0046891556,0.000020295209,0.0005767268,0.0005373135,0.000104883526],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0043670163,0.00013469077,0.0003120708,0.00026859328,0.00022498556,0.00023790817,0.00033836826,0.00009658599,0.0004471037],"category_scores_gemma":[0.010914475,0.00010464956,0.00008096712,0.0006942088,0.0002836371,0.00011818515,0.00017619492,0.00046644124,0.00008307381],"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.0000026516045,0.00040428643,0.000013696439,0.001439836,0.000039810064,0.0000037100285,0.0021470662,0.00036269904,0.001617433,0.9905619,0.0019216349,0.0014852599],"study_design_scores_gemma":[0.00011654238,0.00006597829,0.000028545322,0.00022791741,0.000018426395,0.000010788837,0.0013394307,0.6155704,0.0020152382,0.38011122,0.00036079987,0.0001347203],"about_ca_topic_score_codex":0.000063844,"about_ca_topic_score_gemma":0.000020207746,"teacher_disagreement_score":0.6152077,"about_ca_system_score_codex":0.000060527473,"about_ca_system_score_gemma":0.0001795409,"threshold_uncertainty_score":0.99741703},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8695419,0.0064233635,0.038177606,0.0028068468,0.0007148287,0.001265099,0.0002199541,0.00011466073,0.08073576],"genre_scores_gemma":[0.9823821,0.000055620105,0.0029563436,0.000008133021,0.00008790073,0.000053299467,0.000010081167,0.000025378475,0.014421111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847525,0.00007796471,0.0007277239,0.00028447298,0.00014355667,0.00029104034],"domain_scores_gemma":[0.9992262,0.00025808474,0.00003876708,0.00029273954,0.00013877764,0.000045429264],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0051221885,0.000094309966,0.0002753109,0.00054552045,0.00012334052,0.00027709288,0.00032261503,0.00010470854,0.0014845313],"category_scores_gemma":[0.0008729419,0.00009972855,0.000041282223,0.0009328921,0.00010047228,0.00028802306,0.00010100535,0.00039941733,0.0021747395],"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.0000024907374,0.00021430063,0.00074815645,0.0008078002,0.000035062025,0.000008270056,0.005248921,0.0021647438,0.002150428,0.9845591,0.0038300178,0.00023070714],"study_design_scores_gemma":[0.0007176822,0.00023231508,0.0001411003,0.0015915063,0.000008641435,0.000033427397,0.0050071413,0.8293904,0.01072591,0.101541184,0.04991788,0.00069282],"about_ca_topic_score_codex":0.00046597194,"about_ca_topic_score_gemma":0.000111704205,"teacher_disagreement_score":0.8830179,"about_ca_system_score_codex":0.000079328274,"about_ca_system_score_gemma":0.00006297014,"threshold_uncertainty_score":0.9994283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2309448,0.0010877526,0.74561584,0.0011791728,0.00028647334,0.00074028264,0.00062028866,0.00008138386,0.019444017],"genre_scores_gemma":[0.8735773,0.0026792607,0.11889966,0.00000938516,0.000106471714,0.00006958624,0.00006916944,0.000021439722,0.0045677223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533415,0.00023423729,0.0008512337,0.0004098183,0.002886926,0.00028362006],"domain_scores_gemma":[0.99222875,0.004367286,0.00005868383,0.00063557865,0.0026396448,0.00007003669],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0060359775,0.00012281664,0.00023632628,0.00052174757,0.00054001785,0.0008832877,0.0006390593,0.00009764711,0.0013202693],"category_scores_gemma":[0.018859139,0.00008427719,0.000098360535,0.00324061,0.0002660858,0.0010164127,0.00020280851,0.0003181223,0.00096349465],"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.000110885274,0.0016178562,0.002630486,0.0004325899,0.00018472862,0.00006014962,0.019058166,0.12130285,0.0011672325,0.5539454,0.23593129,0.06355833],"study_design_scores_gemma":[0.00033169342,0.00018892386,0.00054713606,0.00034256314,0.00003461723,0.000039420433,0.0033067425,0.6122842,0.0034022892,0.3015893,0.077655,0.00027810133],"about_ca_topic_score_codex":0.0000731878,"about_ca_topic_score_gemma":0.0001318597,"teacher_disagreement_score":0.6426325,"about_ca_system_score_codex":0.00006443247,"about_ca_system_score_gemma":0.00070755294,"threshold_uncertainty_score":0.9998144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53912234,0.0014051667,0.4507382,0.0013393862,0.00015338582,0.00084854127,0.00007159189,0.00006394935,0.0062574614],"genre_scores_gemma":[0.9672469,0.0017883034,0.027252732,0.000002930172,0.000026917038,0.00004119125,0.000012423091,0.000013336021,0.0036152778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969512,0.00034125306,0.0005665188,0.00029752476,0.0016680051,0.00017548153],"domain_scores_gemma":[0.9971461,0.0011360527,0.00003892893,0.00042973537,0.0011796199,0.00006952837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083859665,0.00008398126,0.0001709343,0.000701307,0.00035994334,0.0008217945,0.00029565566,0.00006618144,0.00012983993],"category_scores_gemma":[0.005073976,0.000056407425,0.000044689466,0.0013761927,0.00022158951,0.00039257327,0.0000991388,0.00024005199,0.00013178257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012047943,0.00016510328,0.0004282599,0.00007575035,0.000047329057,0.000005543098,0.008168754,0.7726888,0.0022728122,0.07494724,0.0034723135,0.13771603],"study_design_scores_gemma":[0.00006485375,0.000051656272,0.00026163692,0.000046616842,0.000009265223,0.000006670444,0.0012785894,0.96658725,0.000340132,0.029799884,0.0014913909,0.000062079205],"about_ca_topic_score_codex":0.00011926344,"about_ca_topic_score_gemma":0.0003640022,"teacher_disagreement_score":0.42812455,"about_ca_system_score_codex":0.000040868887,"about_ca_system_score_gemma":0.00020731943,"threshold_uncertainty_score":0.7924583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061439905,0.00006213233,0.92694736,0.0010775125,0.000031570995,0.0006368472,0.00023876684,0.000015481086,0.009550431],"genre_scores_gemma":[0.84743774,0.000008576481,0.15179527,0.000038854607,0.000016081784,0.00026554754,0.00007820242,0.000013123673,0.0003465844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986966,0.000015573281,0.0007197518,0.00025930355,0.00012968144,0.00017908552],"domain_scores_gemma":[0.998484,0.00025931007,0.00012582149,0.0005612378,0.0005314142,0.00003818142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094916526,0.00009823834,0.00030065846,0.00057415024,0.00027484406,0.000059828522,0.00034125167,0.00007819049,0.00005734407],"category_scores_gemma":[0.0011069371,0.00010307859,0.000057982492,0.001263074,0.0001716449,0.00021824102,0.000060787876,0.00016409399,0.000026409798],"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.0000066750295,0.0004854,0.00014292811,0.00016276639,0.000015158807,7.46778e-8,0.0004992001,0.021445908,0.0007082992,0.9763516,0.000051946507,0.00013001898],"study_design_scores_gemma":[0.00029944553,0.00011839332,0.003969915,0.00010728213,0.000004969297,1.3996078e-7,0.00042512352,0.72268605,0.002446334,0.26972166,0.0001217206,0.00009894912],"about_ca_topic_score_codex":0.00016102643,"about_ca_topic_score_gemma":0.00004479728,"teacher_disagreement_score":0.78599787,"about_ca_system_score_codex":0.000050736373,"about_ca_system_score_gemma":0.00012546366,"threshold_uncertainty_score":0.4203423},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037101667,0.00043769306,0.90941423,0.0007410889,0.000044464992,0.00033162325,0.00010485841,0.000017338009,0.051807016],"genre_scores_gemma":[0.95682573,0.000026077363,0.039272845,0.00001698337,0.000019344903,0.00020026838,0.000019130006,0.000009387521,0.0036102487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990602,0.0000028831316,0.0005090573,0.0001874078,0.0000636675,0.00017676261],"domain_scores_gemma":[0.99930906,0.00007479518,0.000034430795,0.00034067864,0.00020831719,0.000032710108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000636156,0.00006360812,0.00021733377,0.0003321922,0.00021951414,0.000028607215,0.00028608998,0.00005759113,0.0001307427],"category_scores_gemma":[0.0002559944,0.000069885515,0.000053470514,0.0007971772,0.0001346773,0.00007897181,0.000042127038,0.00014022445,0.00015226369],"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.0000022477702,0.00021416716,0.00017279996,0.000079737925,0.000016259453,2.3745905e-7,0.00043607646,0.00041176064,0.00013458596,0.9981863,0.00020446462,0.00014136297],"study_design_scores_gemma":[0.00056722853,0.00008885267,0.0056296643,0.00010353496,0.000011808657,0.000001794615,0.0006539864,0.07046778,0.0011861651,0.9062006,0.014844664,0.00024390708],"about_ca_topic_score_codex":0.00019736106,"about_ca_topic_score_gemma":0.00006748876,"teacher_disagreement_score":0.91972405,"about_ca_system_score_codex":0.00004502879,"about_ca_system_score_gemma":0.00008315515,"threshold_uncertainty_score":0.28498486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83384275,0.00018429884,0.035542496,0.034479693,0.00009145099,0.004645538,0.000011354832,0.00008147399,0.09112096],"genre_scores_gemma":[0.99761194,0.000008497042,0.0010085825,0.0002821931,0.00007836093,0.00020273254,0.000012398912,0.000014362981,0.0007809437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981109,0.00006988306,0.00049652107,0.00021982464,0.00073988433,0.00036297383],"domain_scores_gemma":[0.9985665,0.00032443815,0.00009047785,0.0006118285,0.00039627263,0.00001047462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002534143,0.00013350674,0.00024746932,0.0017235783,0.00030849103,0.00028704858,0.0006334809,0.000031048377,0.0000332566],"category_scores_gemma":[0.0014097481,0.00009499378,0.000044928343,0.002695616,0.00025848323,0.0003707528,0.00044596198,0.00022827221,0.0000053144613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042540716,0.0004893519,0.0006748855,0.0016319742,0.00006474123,0.0000055698074,0.0075250077,0.03664696,0.00037174945,0.95050544,0.0012934093,0.00074837526],"study_design_scores_gemma":[0.0014926207,0.00013948025,0.00076400867,0.0018064978,0.000057833477,0.0000025698023,0.07814554,0.8198955,0.0003810145,0.09509959,0.0019329338,0.0002823851],"about_ca_topic_score_codex":0.006744827,"about_ca_topic_score_gemma":0.001161958,"teacher_disagreement_score":0.85540587,"about_ca_system_score_codex":0.0001031103,"about_ca_system_score_gemma":0.00021128201,"threshold_uncertainty_score":0.99986935},"labels":[],"label_agreement":null}]}