{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":141,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":141,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"a689e6b5b14a","filters":{"venue":"Mathematics of Operations Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1493640761500596,"gpt":0.4924049965811565,"spread":0.3430409204310969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019287,0.001548042,0.001098672,0.001066147,0.001311689,0.001427001,0.001672952,0.001998931,0.002580415],"category_scores_gemma":[0.005553576,0.0005530503,0.001288937,0.0005489063,0.004015405,0.002773815,0.003853714,0.003816691,0.001022592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006546448,"about_ca_system_score_gemma":0.001209476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004347285,"about_ca_topic_score_gemma":0.000451771,"domain_scores_codex":[0.9990445,0.0003842236,0.00003940901,0.0001304372,0.0003396049,0.00006176654],"domain_scores_gemma":[0.9981888,0.000923291,0.0001387556,0.0001616769,0.0004170109,0.0001705054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004646203,0.00005697094,0.0001906629,0.0002767006,0.00004575182,0.0001830507,0.0002793774,0.04030349,0.01144232,0.9175038,0.002150634,0.02752077],"study_design_scores_gemma":[0.00002898211,0.0001813982,0.0002086393,0.00007136024,0.00002174505,0.0002013827,0.00004815089,0.3826382,0.004461796,0.6014962,0.01060275,0.00003939106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006988614,0.0006853958,0.983225,0.0007733072,0.0001580491,0.00007898053,0.00003231453,0.00007931385,0.00797895],"genre_scores_gemma":[0.2830981,0.002951618,0.6866438,0.0008214581,0.0007739906,0.0009108674,0.0001371971,0.000278771,0.02438418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004019287,"threshold_uncertainty_score":0.02125627,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Jérôme Bolte","is_ca":false},{"name":"Marc Teboulle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06474276344782105,"gpt":0.3797376502487932,"spread":0.3149948868009722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004694218,0.001048319,0.001164661,0.001251622,0.0007901728,0.00194671,0.001169113,0.002101735,0.002786609],"category_scores_gemma":[0.0159048,0.0006285554,0.001333057,0.001043456,0.004504608,0.003967588,0.003523162,0.006036094,0.000924864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283244,"about_ca_system_score_gemma":0.00132662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001483026,"about_ca_topic_score_gemma":0.001110169,"domain_scores_codex":[0.998705,0.0006107928,0.00005939632,0.0001418835,0.0004133587,0.00006957344],"domain_scores_gemma":[0.9944066,0.004031017,0.0003328779,0.0004559087,0.0005637034,0.0002099324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003531395,0.00002147708,0.0002481189,0.0001727662,0.0000207946,0.0001061838,0.0002047648,0.02711306,0.002471353,0.9452831,0.001709029,0.02261406],"study_design_scores_gemma":[0.00002650555,0.000111668,0.0002349307,0.0001381862,0.00002230948,0.0002621928,0.00006457754,0.4234106,0.003215164,0.5543252,0.01814803,0.00004060676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003157094,0.001881889,0.9875575,0.00135599,0.0001305429,0.00002692624,0.00002071881,0.00005832932,0.005810951],"genre_scores_gemma":[0.2456185,0.009168378,0.7186879,0.001387696,0.0008956843,0.000269023,0.0001037699,0.0004112185,0.02345779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004694218,"threshold_uncertainty_score":0.02482575,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Steven Kou","is_ca":false},{"name":"Xianhua Peng","is_ca":false},{"name":"C. C. Heyde","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2633710761696301,"gpt":0.4807259011762479,"spread":0.2173548250066178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01738215,0.001223117,0.0009756219,0.00303984,0.001131482,0.005655667,0.0010804,0.002386191,0.004448263],"category_scores_gemma":[0.04156412,0.0003216662,0.001022383,0.001920961,0.008869812,0.005973533,0.002754027,0.003543386,0.0008225988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002058693,"about_ca_system_score_gemma":0.00152328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000566983,"about_ca_topic_score_gemma":0.000320995,"domain_scores_codex":[0.9777974,0.009589955,0.001837538,0.002761753,0.007094649,0.0009187386],"domain_scores_gemma":[0.9731084,0.0121134,0.00620621,0.003414996,0.004247898,0.0009091267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001344024,0.00001019129,0.0003896656,0.00002910818,0.00001472158,0.00003720252,0.00006641536,0.007529106,0.0001388023,0.9831988,0.00150035,0.007072144],"study_design_scores_gemma":[0.000007339707,0.0000272588,0.0003902719,0.00005604564,0.000007676719,0.000056719,0.00003068431,0.009494742,0.0001786763,0.9812989,0.008425002,0.00002676052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05786625,0.004665452,0.7595437,0.006277938,0.0009754403,0.0001733356,0.0005498367,0.000652165,0.1692959],"genre_scores_gemma":[0.9339757,0.001351002,0.05409951,0.001078259,0.0009349287,0.0003409197,0.0003026915,0.0001628233,0.007754265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01738215,"threshold_uncertainty_score":0.09192675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Itai Gurvich","is_ca":true},{"name":"Ward Whitt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0640631890681417,"gpt":0.3492090248340123,"spread":0.2851458357658707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523962,0.0007392992,0.0009315698,0.0005718022,0.0006459102,0.001455378,0.00153213,0.0008270734,0.001609873],"category_scores_gemma":[0.00890612,0.0003560221,0.0005540688,0.0004322747,0.00283484,0.001712,0.001371862,0.001193706,0.0001500119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001876847,"about_ca_system_score_gemma":0.0008832752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004004082,"about_ca_topic_score_gemma":0.001453878,"domain_scores_codex":[0.9989618,0.0004280344,0.00004726922,0.0001809919,0.0002099417,0.0001718931],"domain_scores_gemma":[0.9957215,0.002446542,0.0007335483,0.0002485663,0.0004694901,0.0003803755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001627371,0.0001271585,0.001254796,0.00007697662,0.00004491681,0.0001772211,0.0001988657,0.7494355,0.005798272,0.2358593,0.0009065717,0.005957745],"study_design_scores_gemma":[0.00002171231,0.00003316531,0.0002114941,0.000002923195,0.000006342731,0.00001247028,0.00002052769,0.9735555,0.0003113612,0.02571008,0.0001059785,0.000008430977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3584833,0.0006311519,0.6328514,0.0009487235,0.00008904595,0.0000725335,0.00009662684,0.0003792407,0.006447967],"genre_scores_gemma":[0.9916332,0.0001414029,0.006973251,0.00004644934,0.00002691429,0.00003240037,0.00002140801,0.00002129285,0.001103637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004004082,"threshold_uncertainty_score":0.01361752,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mehmet A. Begen","is_ca":true},{"name":"Maurice Queyranne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3306439062779563,"gpt":0.509146559540775,"spread":0.1785026532628188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694338,0.0008858636,0.001907615,0.0006956984,0.0005949096,0.001621344,0.002411317,0.00184548,0.007808918],"category_scores_gemma":[0.009538906,0.0009727,0.0009452177,0.001426979,0.001087047,0.001836022,0.001025894,0.001757047,0.001246104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002199476,"about_ca_system_score_gemma":0.001385546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005733263,"about_ca_topic_score_gemma":0.00369698,"domain_scores_codex":[0.9972821,0.001076154,0.0001292625,0.0005713933,0.0004393646,0.0005017137],"domain_scores_gemma":[0.9954609,0.002760445,0.0008131973,0.0002833527,0.0002073747,0.0004746492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006207563,0.0001408996,0.001433834,0.0002358195,0.00006824319,0.000370026,0.0001379771,0.8725576,0.001589435,0.1022813,0.003345952,0.01721827],"study_design_scores_gemma":[0.0001295084,0.0001294212,0.0006685618,0.00001708845,0.00002585267,0.00008304488,0.00004400254,0.9631447,0.000339988,0.03300031,0.002388162,0.00002937823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1644008,0.002318944,0.8122236,0.00260537,0.0005321216,0.000262984,0.001974123,0.0007404846,0.01494156],"genre_scores_gemma":[0.9375452,0.00100846,0.0461857,0.0002388983,0.0003166089,0.000234604,0.0006554223,0.00009342801,0.01372159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007808918,"threshold_uncertainty_score":0.02612346,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gábor Bartók","is_ca":false},{"name":"Dean P. Foster","is_ca":false},{"name":"Dávid Pál","is_ca":false},{"name":"Alexander Rakhlin","is_ca":false},{"name":"Csaba Szepesvári","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4399227455027039,"gpt":0.5509132329952277,"spread":0.1109904874925237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01144437,0.002626846,0.003425036,0.001593988,0.001433202,0.004851421,0.004305751,0.003217822,0.004965133],"category_scores_gemma":[0.05788539,0.001160502,0.001654604,0.002680063,0.004002137,0.009273909,0.004386414,0.006341457,0.0009465159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004487347,"about_ca_system_score_gemma":0.002555125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002241248,"about_ca_topic_score_gemma":0.001667708,"domain_scores_codex":[0.9913235,0.003989917,0.0003719211,0.001624162,0.001770831,0.0009197365],"domain_scores_gemma":[0.9554811,0.03509465,0.003069885,0.003795486,0.001488003,0.001070839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005835444,0.0003523251,0.003884411,0.0004577454,0.000198518,0.00009932669,0.0002214512,0.5541915,0.001001572,0.322349,0.01039577,0.1062649],"study_design_scores_gemma":[0.0000329094,0.00006994815,0.0003950181,0.0000537208,0.00002469091,0.00005182118,0.00001835097,0.7526504,0.0003491156,0.245223,0.001114662,0.00001638289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02582207,0.005017256,0.9523138,0.003723375,0.0001844925,0.0001641444,0.0004506696,0.0006333352,0.01169079],"genre_scores_gemma":[0.6856772,0.005026856,0.2909489,0.001717209,0.001498941,0.001140311,0.001206586,0.0004835647,0.01230048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01144437,"threshold_uncertainty_score":0.06052428,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Viliam Makiš","is_ca":true},{"name":"Xiangqian Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.109759728247854,"gpt":0.3453108476573518,"spread":0.2355511194094978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216916,0.0006839816,0.001529677,0.0004829844,0.0003530106,0.001062693,0.001037371,0.001073668,0.002215477],"category_scores_gemma":[0.00855651,0.0006153282,0.0006823416,0.0005136436,0.001220659,0.002262143,0.001088403,0.001020269,0.0002621571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106453,"about_ca_system_score_gemma":0.001364433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001793074,"about_ca_topic_score_gemma":0.001069294,"domain_scores_codex":[0.9988368,0.0004688479,0.00005297233,0.0002367121,0.0002497486,0.0001549376],"domain_scores_gemma":[0.9973046,0.001844383,0.0002979037,0.0002375743,0.0001939939,0.0001215343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001619414,0.00005178453,0.0007558794,0.0001123904,0.000036202,0.0001812769,0.00009423161,0.8597538,0.001399339,0.1047957,0.001083176,0.03157409],"study_design_scores_gemma":[0.00002354286,0.00006397171,0.000231048,0.00001193002,0.000009457142,0.00004431639,0.00001493967,0.9453894,0.0004859284,0.05302495,0.0006906811,0.000009691824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0638251,0.000673069,0.9320916,0.0005289922,0.00004481043,0.00002979393,0.0001062336,0.0001726563,0.002527803],"genre_scores_gemma":[0.8990273,0.0006523757,0.09451003,0.00009877591,0.00008844797,0.0001225031,0.0002614165,0.00008939709,0.005149694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002215477,"threshold_uncertainty_score":0.01147175,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","authors":[{"name":"Jia Yuan Yu","is_ca":true},{"name":"Shie Mannor","is_ca":true},{"name":"Nahum Shimkin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.205043330395209,"gpt":0.5069362652545172,"spread":0.3018929348593081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003637383,0.001621886,0.00203265,0.0006343289,0.0008739592,0.002313668,0.002828449,0.003166989,0.003607593],"category_scores_gemma":[0.01320907,0.0007958619,0.001187256,0.001074193,0.002702849,0.003141533,0.001995221,0.003448496,0.0006649224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002037786,"about_ca_system_score_gemma":0.001622648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005793126,"about_ca_topic_score_gemma":0.003610947,"domain_scores_codex":[0.9971005,0.001156378,0.0001116188,0.0007027158,0.0003938816,0.0005347928],"domain_scores_gemma":[0.9923379,0.005422144,0.0009176061,0.0005052942,0.0003689965,0.0004481119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001892638,0.0001048275,0.0009082179,0.00006004055,0.00005464649,0.0003183068,0.0000916631,0.7284779,0.0005521195,0.2625099,0.0006348015,0.00609842],"study_design_scores_gemma":[0.00004260061,0.00002976945,0.00007822416,0.000005410485,0.00001090739,0.00001737089,0.00000825331,0.9334944,0.0001798146,0.06578854,0.0003328132,0.00001173107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07089176,0.0003431204,0.920385,0.001506747,0.0001054802,0.0001167682,0.0002498372,0.0002135221,0.006187846],"genre_scores_gemma":[0.9053814,0.0005168088,0.08349757,0.0002303442,0.0001621045,0.0003366682,0.0002438345,0.00003944586,0.009591855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005793126,"threshold_uncertainty_score":0.01923656,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Retsef Levi","is_ca":false},{"name":"Ganesh Janakiraman","is_ca":false},{"name":"Mahesh Nagarajan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1217961590905095,"gpt":0.3130105024189769,"spread":0.1912143433284674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857402,0.001358548,0.001943841,0.0008631579,0.0007778673,0.001798194,0.001954813,0.001785301,0.005882262],"category_scores_gemma":[0.004656151,0.0007376471,0.000904582,0.001186131,0.0007569221,0.002570885,0.001602622,0.002400938,0.000899461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002418146,"about_ca_system_score_gemma":0.003103853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007532387,"about_ca_topic_score_gemma":0.006080665,"domain_scores_codex":[0.9990653,0.0002867973,0.00005547393,0.0001980603,0.0001923869,0.0002019505],"domain_scores_gemma":[0.9985062,0.001034487,0.0001222052,0.0001362836,0.0001208918,0.00007971252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001897548,0.00009733195,0.0003995317,0.0000649728,0.0000345708,0.00004588066,0.00005926457,0.9121606,0.0003601906,0.03381192,0.002333057,0.05044285],"study_design_scores_gemma":[0.00002064978,0.00001337168,0.0000213334,0.000003957452,0.000003005633,0.000008653223,0.000006700014,0.9866477,0.00006761652,0.01283901,0.0003651113,0.000002862994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01303692,0.0003409903,0.98255,0.0003079041,0.00007397601,0.00007589849,0.0001117236,0.0006806105,0.002821997],"genre_scores_gemma":[0.4971251,0.0004532113,0.4949149,0.0003376703,0.000111932,0.0004620804,0.0006517442,0.0002336978,0.005709685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007532387,"threshold_uncertainty_score":0.01967812,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3146180574641937,"gpt":0.465711267282209,"spread":0.1510932098180153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003598436,0.0007843247,0.0009869152,0.001110876,0.0003089198,0.001023124,0.001281263,0.001041371,0.0008510643],"category_scores_gemma":[0.01705385,0.0008030185,0.0006995365,0.0006914921,0.00155202,0.002109365,0.001175653,0.001281061,0.0002069254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001067458,"about_ca_system_score_gemma":0.0006345575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003160495,"about_ca_topic_score_gemma":0.003041555,"domain_scores_codex":[0.9992342,0.000353624,0.0000427241,0.0001130536,0.0001885083,0.00006780631],"domain_scores_gemma":[0.9949802,0.003214004,0.0005039994,0.0006162534,0.0005088594,0.0001767261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002427986,0.00005485698,0.004236578,0.00009122299,0.0000624038,0.0001628106,0.0001208411,0.8979159,0.004225353,0.07286747,0.0006169433,0.01940282],"study_design_scores_gemma":[0.000008450054,0.0000169227,0.0001823636,0.000004676605,0.000002889483,0.00001528268,0.00000594682,0.9922935,0.0007117636,0.006617018,0.0001368682,0.000004317603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.115101,0.000299271,0.8834149,0.0001604294,0.00003724339,0.00004699908,0.00003985543,0.0001983205,0.000702048],"genre_scores_gemma":[0.8024139,0.0003929941,0.1950228,0.00009639081,0.00004817135,0.00009517919,0.0002212174,0.0001179329,0.001591312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003598436,"threshold_uncertainty_score":0.01903057,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ali Lazrak","is_ca":true},{"name":"M.C. Quenez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1407506360794377,"gpt":0.3447168680473967,"spread":0.203966231967959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001501496,0.000856349,0.0008843025,0.0006791826,0.0004353645,0.001852366,0.001133066,0.001600285,0.005087533],"category_scores_gemma":[0.002771775,0.0002972588,0.001090473,0.001010832,0.00152944,0.002470528,0.001534282,0.001549106,0.0005581399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001388299,"about_ca_system_score_gemma":0.001343706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002444008,"about_ca_topic_score_gemma":0.001438204,"domain_scores_codex":[0.9988469,0.0005126456,0.0000570011,0.0002310212,0.0002648143,0.00008755281],"domain_scores_gemma":[0.9993989,0.0002626775,0.00005689658,0.00008971104,0.0001257689,0.00006591476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006765727,0.00001389954,0.0001803957,0.00003519299,0.00001708522,0.00007695914,0.00005820199,0.02411783,0.0005429274,0.965239,0.001333357,0.008378294],"study_design_scores_gemma":[0.00001435479,0.00004264578,0.0003992817,0.00003004256,0.00001764761,0.0001543252,0.00003481242,0.1981487,0.000195122,0.7865109,0.01442879,0.00002333189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0319555,0.001386293,0.912926,0.003486823,0.0002338836,0.0001168394,0.0004658593,0.000184909,0.04924398],"genre_scores_gemma":[0.8014544,0.002540629,0.1559444,0.001070728,0.0004844491,0.0002919169,0.0004366815,0.00009729603,0.03767942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005087533,"threshold_uncertainty_score":0.01701945,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lars Ehlers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1842064859521359,"gpt":0.3546812017191083,"spread":0.1704747157669724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007868844,0.00073029,0.001771424,0.001425519,0.001621572,0.004042612,0.002154835,0.003385025,0.007587424],"category_scores_gemma":[0.02963789,0.0006919793,0.001666549,0.00147583,0.004062325,0.008803925,0.003194213,0.002980643,0.00111403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002523107,"about_ca_system_score_gemma":0.001704568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001687749,"about_ca_topic_score_gemma":0.0009280166,"domain_scores_codex":[0.9936681,0.003242794,0.0003892768,0.0007095599,0.001261631,0.0007285784],"domain_scores_gemma":[0.9856359,0.009596459,0.001203604,0.001418556,0.001199934,0.0009455386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005616712,0.00003613703,0.0002692324,0.00004560684,0.00001867833,0.00006677609,0.0002644829,0.007633539,0.000473418,0.9794292,0.001198376,0.01050837],"study_design_scores_gemma":[0.00005688614,0.0000459185,0.0001040334,0.00002062873,0.00001075988,0.00005698481,0.00006677165,0.04777227,0.0002115135,0.9496541,0.001981279,0.00001888211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1422677,0.003054778,0.797645,0.003885962,0.0002280998,0.0004435874,0.0002722813,0.0002984542,0.05190401],"genre_scores_gemma":[0.8845861,0.001613106,0.0913002,0.0008574175,0.0002397126,0.0004542199,0.0002132756,0.00008570603,0.02065039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007868844,"threshold_uncertainty_score":0.04161489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Douglas G. Down","is_ca":true},{"name":"H. Christian Gromoll","is_ca":false},{"name":"Amber L. Puha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09283470670110919,"gpt":0.3842832528348863,"spread":0.2914485461337771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511718,0.0007545786,0.000966061,0.001560804,0.000923335,0.002808727,0.001555831,0.00126041,0.001484037],"category_scores_gemma":[0.01215985,0.000489413,0.001110331,0.0007553829,0.002482953,0.002808691,0.002117263,0.001417174,0.0001546631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002467397,"about_ca_system_score_gemma":0.001306387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006376959,"about_ca_topic_score_gemma":0.001738585,"domain_scores_codex":[0.998938,0.000238233,0.00005046997,0.0001559281,0.0004003263,0.0002169279],"domain_scores_gemma":[0.9951612,0.002602747,0.0008563118,0.0001785002,0.000761945,0.0004392909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007220207,0.00005010754,0.0007994118,0.00008771908,0.00003265271,0.0002495545,0.0002993169,0.3100672,0.003878877,0.679388,0.0005315763,0.00454336],"study_design_scores_gemma":[0.00001153869,0.00002372801,0.0001260192,0.00001396829,0.000007811732,0.00003993053,0.00003178688,0.8902331,0.0005190747,0.1083487,0.0006275385,0.00001674923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2021554,0.002339632,0.7794108,0.001479982,0.0001587579,0.00006650326,0.0001240178,0.0002396245,0.01402531],"genre_scores_gemma":[0.9704264,0.001034689,0.0228295,0.0002074879,0.0001218712,0.0001342345,0.0001056231,0.00006251266,0.005077721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006376959,"threshold_uncertainty_score":0.01790226,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michel X. Goemans","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08849708786235158,"gpt":0.3650675527512243,"spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01460974,0.001112355,0.001434903,0.001055103,0.002569098,0.002723888,0.001699385,0.003031218,0.009205751],"category_scores_gemma":[0.07263664,0.0008483378,0.001575124,0.001635597,0.004818596,0.0113482,0.005222751,0.004145732,0.00195343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007323083,"about_ca_system_score_gemma":0.002432232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005466854,"about_ca_topic_score_gemma":0.0007166041,"domain_scores_codex":[0.9942059,0.002911903,0.0003585808,0.0005725874,0.001078394,0.000872644],"domain_scores_gemma":[0.9644104,0.02704245,0.00222546,0.004023547,0.001501946,0.0007962708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006743378,0.0003782097,0.002533399,0.0003027138,0.00005877442,0.0003224863,0.0005492585,0.03075939,0.006784481,0.8184229,0.003782357,0.1354317],"study_design_scores_gemma":[0.0001166538,0.000462662,0.0006428586,0.0001360499,0.00004533247,0.0003702076,0.0004067721,0.1493487,0.01121651,0.8331894,0.003995471,0.00006948576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1373233,0.0003221372,0.8382339,0.003011188,0.0002636077,0.0003090895,0.00009490618,0.0005004563,0.01994131],"genre_scores_gemma":[0.5565442,0.0005098336,0.4359393,0.0007236804,0.0002183774,0.0002980356,0.0001757737,0.0004535747,0.005137247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01460974,"threshold_uncertainty_score":0.07726461,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Bin Wang","is_ca":false},{"name":"Ruodu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5300525204133071,"gpt":0.5403228146903195,"spread":0.01027029427701243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004110546,0.001407105,0.001760402,0.001655024,0.001256371,0.003706138,0.001710617,0.001606334,0.00905838],"category_scores_gemma":[0.01801339,0.0009073845,0.002031433,0.002169102,0.003177435,0.009660034,0.005324295,0.003720487,0.0007700756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696196,"about_ca_system_score_gemma":0.0009299894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007017125,"about_ca_topic_score_gemma":0.0004880534,"domain_scores_codex":[0.995,0.001531702,0.0002686833,0.001240871,0.001419231,0.0005396336],"domain_scores_gemma":[0.991403,0.005244441,0.001052798,0.001012543,0.0007580844,0.0005291388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006026472,0.00004545213,0.001348856,0.0001136006,0.00008998482,0.0001822708,0.0001873741,0.04312648,0.001454575,0.9381121,0.00108288,0.01419619],"study_design_scores_gemma":[0.00001298068,0.00005505908,0.0006115591,0.00003163448,0.00002989955,0.0001811803,0.00009516896,0.139649,0.001280905,0.8549445,0.003081039,0.00002709756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04408644,0.0004583289,0.94014,0.0007115849,0.00003551163,0.000083009,0.000355137,0.0001479905,0.01398198],"genre_scores_gemma":[0.9010696,0.0009066197,0.08679511,0.0003271511,0.0002032556,0.0004856029,0.000741733,0.0001974239,0.009273502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00905838,"threshold_uncertainty_score":0.0303033,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jane J. Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1242592753038148,"gpt":0.4028250776607806,"spread":0.2785658023569658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004803509,0.001242381,0.001526561,0.0009829946,0.001374659,0.002692245,0.001239978,0.002036701,0.009382006],"category_scores_gemma":[0.01572519,0.000742487,0.00109557,0.00200107,0.004182826,0.004622371,0.002944018,0.004073285,0.002088724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001686354,"about_ca_system_score_gemma":0.003021754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003063136,"about_ca_topic_score_gemma":0.002049115,"domain_scores_codex":[0.9958059,0.001781704,0.0003182229,0.0006517646,0.001026376,0.0004160086],"domain_scores_gemma":[0.9945781,0.003156047,0.0006142842,0.0003529883,0.001060763,0.0002377725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001773509,0.00002151051,0.0001677556,0.0001550614,0.0000160537,0.0001456661,0.0001386183,0.04942535,0.0004510759,0.9377631,0.00249299,0.009205077],"study_design_scores_gemma":[0.0000250263,0.00003342373,0.0001534421,0.00008631097,0.000007929737,0.00007087853,0.00009351693,0.1221141,0.0004252497,0.8684593,0.008504531,0.00002620283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00910328,0.0006640374,0.9565957,0.002001996,0.0001844083,0.0001143049,0.0004626612,0.00009062938,0.03078299],"genre_scores_gemma":[0.5322267,0.004450012,0.4363115,0.001509443,0.0006614813,0.001490723,0.001994222,0.000255898,0.02110009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009382006,"threshold_uncertainty_score":0.03138596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ruodu Wang","is_ca":true},{"name":"Yunran Wei","is_ca":true},{"name":"Gordon E. Willmot","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2841848051385171,"gpt":0.4545010382229214,"spread":0.1703162330844042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003637638,0.0006417496,0.0007741576,0.002143381,0.0007424679,0.003329756,0.000971347,0.001072484,0.002524895],"category_scores_gemma":[0.01424269,0.0003056215,0.0009844252,0.001375003,0.002520349,0.004561426,0.002039239,0.00163081,0.0001826093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001343558,"about_ca_system_score_gemma":0.0006817871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004233188,"about_ca_topic_score_gemma":0.0001985269,"domain_scores_codex":[0.9978485,0.0005028943,0.0001580601,0.0004008397,0.0008716151,0.0002180699],"domain_scores_gemma":[0.9944284,0.00254071,0.001284258,0.0006267765,0.0007447728,0.0003751001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006433189,0.00004025902,0.001778407,0.00007502933,0.00005643466,0.0002513136,0.0001931049,0.0281256,0.008916262,0.9427425,0.0004984202,0.01725831],"study_design_scores_gemma":[0.00001404788,0.00008912857,0.002628961,0.00003942726,0.00003027748,0.0004215087,0.0001331739,0.2789362,0.004096301,0.7109597,0.002592489,0.00005879342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.229781,0.00095464,0.7462047,0.0007589827,0.0001432831,0.00005932768,0.0001493852,0.0001212304,0.02182744],"genre_scores_gemma":[0.9709814,0.000466946,0.02525931,0.0001175963,0.0001491964,0.00004854588,0.00008443967,0.00004396048,0.002848685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003637638,"threshold_uncertainty_score":0.01923794,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Fangda Liu","is_ca":true},{"name":"Ruodu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4231346017905099,"gpt":0.5173141037081926,"spread":0.09417950191768276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005918378,0.001418352,0.001031557,0.00356129,0.001491703,0.005619206,0.001811585,0.002818082,0.006805482],"category_scores_gemma":[0.02169424,0.0006680609,0.002137304,0.002681727,0.00574781,0.01050178,0.003443333,0.00505151,0.001469621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003076001,"about_ca_system_score_gemma":0.001327776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008832857,"about_ca_topic_score_gemma":0.0004558733,"domain_scores_codex":[0.9951273,0.001549658,0.0003626085,0.0008833418,0.001743865,0.0003331582],"domain_scores_gemma":[0.984167,0.009763376,0.001785091,0.001731888,0.001944877,0.000607761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002740177,0.000006114618,0.00009276129,0.00002071611,0.000006708029,0.00001586644,0.00005169678,0.00148838,0.0001223228,0.9951095,0.000422581,0.002660527],"study_design_scores_gemma":[0.000003555937,0.00001547192,0.0001007325,0.00002551186,0.000005358838,0.00004656516,0.00001903791,0.008879092,0.00009542477,0.987194,0.003606158,0.000009147318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01316488,0.002352121,0.9523893,0.00247629,0.0002184532,0.00005320038,0.0003300203,0.0001681922,0.02884758],"genre_scores_gemma":[0.7043396,0.007179402,0.2562906,0.002804058,0.002622759,0.0007735261,0.0009009283,0.0004090778,0.02468007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006805482,"threshold_uncertainty_score":0.03129977,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jane J. Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3096603620746675,"gpt":0.4282102137386596,"spread":0.1185498516639921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004958773,0.002044616,0.002183653,0.002617738,0.001629452,0.003645421,0.001622128,0.002455678,0.01476763],"category_scores_gemma":[0.01988917,0.001660539,0.002093381,0.001778163,0.003767938,0.004865353,0.003244625,0.005791001,0.002425928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002005922,"about_ca_system_score_gemma":0.003633569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001431168,"about_ca_topic_score_gemma":0.001789952,"domain_scores_codex":[0.9959477,0.001158479,0.0003280688,0.0005858775,0.00138897,0.0005909723],"domain_scores_gemma":[0.9911376,0.005434964,0.0008539076,0.0003350346,0.001844141,0.0003944031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008756568,0.0001225435,0.0005639935,0.0005161182,0.00005787958,0.0003779884,0.0003330573,0.1205861,0.003207338,0.852587,0.006433623,0.01512662],"study_design_scores_gemma":[0.00006570199,0.0001105546,0.000412938,0.0002717738,0.00003288556,0.0001600792,0.0001664093,0.3211842,0.002832966,0.6673577,0.007351493,0.00005323141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01961544,0.001215358,0.9340419,0.001669862,0.0002096433,0.000271331,0.0007638247,0.0002641747,0.04194848],"genre_scores_gemma":[0.5610971,0.004624401,0.4146275,0.000830495,0.0006880533,0.002278892,0.001768622,0.0007122441,0.01337258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01476763,"threshold_uncertainty_score":0.04940259,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yang Cai","is_ca":true},{"name":"Ozan Candogan","is_ca":false},{"name":"Constantinos Daskalakis","is_ca":false},{"name":"Christos Papadimitriou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3045281447897193,"gpt":0.5122618047219017,"spread":0.2077336599321825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002609394,0.001442549,0.001559154,0.0007800192,0.001195428,0.002770302,0.002787701,0.001279,0.009556537],"category_scores_gemma":[0.007322314,0.000643554,0.001302063,0.001400866,0.002598971,0.005154373,0.004788643,0.003431161,0.001250374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131042,"about_ca_system_score_gemma":0.001496827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001460587,"about_ca_topic_score_gemma":0.001617376,"domain_scores_codex":[0.9976525,0.001028784,0.00009987414,0.0005177843,0.0003952265,0.0003058913],"domain_scores_gemma":[0.9974049,0.001326108,0.0003417336,0.0004810127,0.0001908645,0.0002554873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001476315,0.0001085978,0.0003936137,0.0001231718,0.00006097255,0.0001609239,0.0002225435,0.08180564,0.002029466,0.8916605,0.002650741,0.02063614],"study_design_scores_gemma":[0.00002725414,0.00005978659,0.0001434247,0.0000210341,0.00001693564,0.0001001316,0.00004609181,0.3078645,0.0009122308,0.6880497,0.002732232,0.00002661811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04469911,0.0001451742,0.9322798,0.0005288288,0.00008411737,0.0001988072,0.0002693633,0.0001862909,0.0216084],"genre_scores_gemma":[0.7081821,0.0004898357,0.2703212,0.0006077622,0.0001911262,0.0007411737,0.0004247994,0.0001983794,0.01884354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009556537,"threshold_uncertainty_score":0.03196979,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Erhan Bayraktar","is_ca":false},{"name":"Ulrich Horst","is_ca":true},{"name":"Ronnie Sircar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08526009564124368,"gpt":0.2917202838248761,"spread":0.2064601881836324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006209938,0.001202177,0.001387079,0.001858375,0.00107902,0.00216194,0.002095357,0.00199693,0.004816635],"category_scores_gemma":[0.02150563,0.0004643085,0.001794388,0.001040958,0.003466832,0.005910161,0.002166863,0.002068634,0.0005199356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001333097,"about_ca_system_score_gemma":0.001120272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002014082,"about_ca_topic_score_gemma":0.0008176643,"domain_scores_codex":[0.9989836,0.0004102313,0.00005295951,0.000163144,0.0002527318,0.0001372835],"domain_scores_gemma":[0.9908963,0.00628168,0.0009982788,0.0003979568,0.000823103,0.0006027392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003551423,0.00004046321,0.0006815192,0.0001402234,0.00005829676,0.0002177769,0.0002133021,0.02896663,0.001921434,0.9600886,0.001213488,0.006422657],"study_design_scores_gemma":[0.00004502787,0.00007066996,0.000524182,0.00004084583,0.00003313763,0.000237083,0.00004287699,0.4245794,0.0005366204,0.5719766,0.00188173,0.00003176732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105245,0.002937249,0.8743888,0.0022549,0.0002504479,0.00006483457,0.0001787927,0.0003205783,0.01435946],"genre_scores_gemma":[0.9006873,0.002866616,0.08200362,0.0007935218,0.0007068128,0.0004535135,0.0002620983,0.0002194814,0.01200699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006209938,"threshold_uncertainty_score":0.03284168,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Patrick Cheridito","is_ca":false},{"name":"Ulrich Horst","is_ca":false},{"name":"Michael Kupper","is_ca":false},{"name":"Traian A. Pirvu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3901373859094927,"gpt":0.3632287041574597,"spread":0.02690868175203298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033657,0.0005209793,0.0009262824,0.0006078717,0.0004081351,0.0019158,0.001203992,0.001001952,0.002827172],"category_scores_gemma":[0.005484718,0.0004193688,0.001174813,0.000644561,0.001469203,0.003954742,0.001098342,0.001138421,0.0003285783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00128594,"about_ca_system_score_gemma":0.0009198358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001067057,"about_ca_topic_score_gemma":0.0009671173,"domain_scores_codex":[0.9992206,0.0003468169,0.0000515662,0.0001013663,0.0001685807,0.0001111234],"domain_scores_gemma":[0.9984289,0.0007526383,0.0003079468,0.0002075086,0.0001751791,0.0001278018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002487563,0.0000338497,0.0002030624,0.00003772892,0.00002247911,0.0001233409,0.00007443877,0.1034808,0.000918847,0.890367,0.0003394591,0.004374117],"study_design_scores_gemma":[0.00002116996,0.00001632557,0.00009937117,0.000005449675,0.000006602968,0.00002706141,0.0000165222,0.4833301,0.0003205948,0.5156613,0.0004856183,0.000009811745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0738154,0.0002194391,0.9197094,0.0004317949,0.00004309768,0.00003778736,0.0001074752,0.00005029743,0.005585295],"genre_scores_gemma":[0.8593209,0.0006648981,0.1325298,0.000146233,0.0001365327,0.0001399859,0.0001847261,0.00005885233,0.00681818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002827172,"threshold_uncertainty_score":0.01075512,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vikram Krishnamurthy","is_ca":true},{"name":"Bo Wahlberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.083850938900528,"gpt":0.3832298800101856,"spread":0.2993789411096576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003175688,0.001044429,0.001516531,0.0008318096,0.0009537921,0.002421685,0.001544639,0.001837307,0.004188333],"category_scores_gemma":[0.01417608,0.0008345696,0.0009576748,0.001072279,0.002463603,0.003633062,0.001849509,0.00308052,0.0007080167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001875415,"about_ca_system_score_gemma":0.00146544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001938869,"about_ca_topic_score_gemma":0.001501453,"domain_scores_codex":[0.9983494,0.0007455974,0.00005923864,0.0002450262,0.0003607933,0.0002398861],"domain_scores_gemma":[0.9912509,0.006656968,0.0008826642,0.0004806504,0.0004504632,0.0002784072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007855062,0.00005189612,0.0005559467,0.00007147601,0.00002823785,0.00006929662,0.00008689754,0.5323331,0.0005898037,0.4546331,0.0006988066,0.01080287],"study_design_scores_gemma":[0.000009657303,0.00001637763,0.00006868214,0.00001123065,0.000004531837,0.00001160639,0.00001079202,0.8808936,0.0001906357,0.1184659,0.0003101918,0.000006702004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02800952,0.0005262399,0.9628481,0.0007686306,0.00004532471,0.00004065028,0.00009444894,0.0001005442,0.007566546],"genre_scores_gemma":[0.8557331,0.001142602,0.1358689,0.000251946,0.0001308368,0.0003022398,0.0002507965,0.00009251461,0.006227074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004188333,"threshold_uncertainty_score":0.01679486,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"S. Thomas McCormick","is_ca":true},{"name":"Scott R. Smallwood","is_ca":false},{"name":"Frits Spieksma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05539017173752653,"gpt":0.354648109459684,"spread":0.2992579377221575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364638,0.001465114,0.001250729,0.00093006,0.001359238,0.001763166,0.002506339,0.001736136,0.01467536],"category_scores_gemma":[0.00394532,0.0006427492,0.001300347,0.001965653,0.0009598936,0.002702996,0.002326063,0.002606386,0.003974221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002777733,"about_ca_system_score_gemma":0.003010439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003776251,"about_ca_topic_score_gemma":0.003916261,"domain_scores_codex":[0.9983835,0.0003274528,0.00009323785,0.0004218563,0.0003848022,0.0003891908],"domain_scores_gemma":[0.9985221,0.0007163525,0.0001017032,0.0003408894,0.0001737261,0.0001453234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009500939,0.0007762609,0.0007346646,0.0007174599,0.0001220442,0.0002639146,0.0004824076,0.2082833,0.01145457,0.1983517,0.04136059,0.536503],"study_design_scores_gemma":[0.0009958777,0.0002735256,0.0003358947,0.0000572779,0.00003990741,0.0001930445,0.00008796539,0.7589394,0.003457393,0.2086332,0.02692678,0.00005967229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01219198,0.0004904136,0.9663579,0.0009426411,0.000137763,0.0003678477,0.0004269707,0.00510444,0.01398005],"genre_scores_gemma":[0.1293215,0.000215148,0.8602465,0.000255656,0.00007445145,0.000457862,0.0009956443,0.000568245,0.007864946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01467536,"threshold_uncertainty_score":0.04909396,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yaron Azrieli","is_ca":true},{"name":"Eran Shmaya","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5498980570001545,"gpt":0.581616604163756,"spread":0.03171854716360156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001596516,0.001208348,0.001371828,0.0007854245,0.001021726,0.002895747,0.001539743,0.001430216,0.007443967],"category_scores_gemma":[0.01061097,0.0004809556,0.0009273571,0.0007155419,0.002703471,0.005072836,0.002433543,0.002083716,0.001001683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002502499,"about_ca_system_score_gemma":0.001159615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002580875,"about_ca_topic_score_gemma":0.001954959,"domain_scores_codex":[0.9980311,0.0006404999,0.0001404955,0.0004621533,0.0004735554,0.0002522105],"domain_scores_gemma":[0.9957088,0.002674628,0.0004353077,0.00043289,0.0004085412,0.0003398359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005274138,0.00001860675,0.0001803446,0.00005003746,0.0000169689,0.00005535426,0.00008639588,0.01479507,0.0006647162,0.9751195,0.001759337,0.007200914],"study_design_scores_gemma":[0.00004574486,0.00003574848,0.0001865777,0.00001799447,0.00001472926,0.00008843937,0.00003842809,0.08774294,0.0004507219,0.9045572,0.006802924,0.00001850872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07966031,0.001077406,0.8184496,0.003139041,0.0001431166,0.0003081181,0.001361055,0.0005411888,0.09532021],"genre_scores_gemma":[0.8336661,0.0014005,0.1195624,0.0008410173,0.0002657328,0.0007398176,0.00089281,0.000119645,0.04251195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007443967,"threshold_uncertainty_score":0.02490252,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Maria B. Chiarolla","is_ca":false},{"name":"Ulrich G. Haussmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1138168519041187,"gpt":0.3210949476177818,"spread":0.2072780957136632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068876,0.0005705362,0.0009503505,0.0007050836,0.0004859232,0.001829687,0.001053989,0.002026002,0.003239198],"category_scores_gemma":[0.003660926,0.0005244269,0.0007664648,0.0004766283,0.002144075,0.0014194,0.001417125,0.001295603,0.0002194634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001825335,"about_ca_system_score_gemma":0.001757854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004447341,"about_ca_topic_score_gemma":0.002424964,"domain_scores_codex":[0.9995833,0.0001199678,0.00002337384,0.00008590148,0.00009414029,0.00009333165],"domain_scores_gemma":[0.9989397,0.0005773674,0.0001701657,0.00004746806,0.0001132172,0.0001520894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000462803,0.00005051606,0.0005098464,0.00007002534,0.00002732997,0.0002853966,0.00009748497,0.3484205,0.001840691,0.64371,0.0009871884,0.0039548],"study_design_scores_gemma":[0.00001902657,0.00002309765,0.000195248,0.00001677655,0.000009420201,0.00003555903,0.000038068,0.834487,0.000342524,0.1639415,0.0008787583,0.00001303047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2994391,0.001743918,0.6302772,0.005159092,0.0002602104,0.00006386523,0.0002634668,0.0002088556,0.06258431],"genre_scores_gemma":[0.9569156,0.0004614831,0.02372241,0.0001806465,0.00007781536,0.0000719879,0.0001017839,0.00005709296,0.01841114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004447341,"threshold_uncertainty_score":0.01324379,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ulrich Horst","is_ca":true},{"name":"Matthias A. Müller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09462986760926169,"gpt":0.3287597655489408,"spread":0.2341298979396791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001414299,0.0005271851,0.000632857,0.000897359,0.0006870148,0.001478187,0.0008272266,0.001070266,0.004090959],"category_scores_gemma":[0.006783735,0.0003984027,0.0008719093,0.0006363195,0.001367582,0.002947066,0.001272428,0.001241029,0.0003984286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007209748,"about_ca_system_score_gemma":0.0006412629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060796,"about_ca_topic_score_gemma":0.0006171568,"domain_scores_codex":[0.9995137,0.00019928,0.00002190988,0.00007238854,0.0001327554,0.00005992316],"domain_scores_gemma":[0.9982858,0.0008934326,0.0002795154,0.0001440586,0.0002064044,0.0001908032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001668662,0.00002208313,0.0004550415,0.00002301485,0.00001288749,0.00009573028,0.00007841778,0.0383639,0.001330252,0.9534343,0.0004489475,0.00571871],"study_design_scores_gemma":[0.00001558997,0.00003235185,0.0002741614,0.00001448894,0.000008183434,0.0001099782,0.00002452462,0.5692654,0.0004166004,0.4287047,0.001120749,0.00001314833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1363932,0.000548848,0.8468748,0.0007055678,0.00005492942,0.00004011076,0.00008166854,0.0001034622,0.01519732],"genre_scores_gemma":[0.8850387,0.001168229,0.1044409,0.0001531419,0.0001862821,0.0001189171,0.0001704966,0.0001178805,0.008605422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004090959,"threshold_uncertainty_score":0.01368564,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Xiaorui Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.077372146898713,"gpt":0.3351070162834522,"spread":0.2577348693847392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002622402,0.001594797,0.001587112,0.001408149,0.0005820595,0.001847333,0.002069662,0.002211,0.002373232],"category_scores_gemma":[0.007938749,0.0008623867,0.001385882,0.002337163,0.002951044,0.003549904,0.003094032,0.003566797,0.0006256122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001355225,"about_ca_system_score_gemma":0.001547711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004560653,"about_ca_topic_score_gemma":0.003350377,"domain_scores_codex":[0.9986606,0.0006022652,0.00005106533,0.0002326392,0.0003427937,0.0001107606],"domain_scores_gemma":[0.9963855,0.002434765,0.0003870369,0.000322419,0.0003570872,0.0001132808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005471498,0.00006742823,0.0006734016,0.000335324,0.00007854326,0.0001024292,0.0001367107,0.6046604,0.001385256,0.3341361,0.005789245,0.05258049],"study_design_scores_gemma":[0.000006913731,0.00002301004,0.00007187927,0.00002160251,0.000009409913,0.00003397694,0.00001111908,0.9123504,0.0002085912,0.08593245,0.001318469,0.00001217598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002523883,0.001446225,0.9936754,0.0005964986,0.0000356976,0.0000252925,0.00006044224,0.0001043235,0.001532261],"genre_scores_gemma":[0.4438845,0.01315969,0.5244912,0.001037013,0.001124708,0.0008878618,0.0008911112,0.0003652204,0.01415873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004560653,"threshold_uncertainty_score":0.01386875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Geneviève Benoît","is_ca":true},{"name":"Sylvia Boyd","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3837812636093662,"gpt":0.4339300606441794,"spread":0.05014879703481323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00347508,0.001095106,0.001675644,0.001862473,0.001430857,0.00304957,0.00283243,0.001648588,0.007351249],"category_scores_gemma":[0.02863244,0.0008687158,0.0009512319,0.001411771,0.003396806,0.009632628,0.002808075,0.005226865,0.000550882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002398992,"about_ca_system_score_gemma":0.001433021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009313293,"about_ca_topic_score_gemma":0.0007367673,"domain_scores_codex":[0.9979815,0.0005633417,0.00008700266,0.0004654783,0.0004389954,0.0004636128],"domain_scores_gemma":[0.9777876,0.0184627,0.001090783,0.001032438,0.0005530074,0.001073481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007982712,0.0005432645,0.002657237,0.0006288911,0.0001151349,0.0002774386,0.0006921478,0.1552685,0.005534268,0.7895217,0.006044392,0.0379187],"study_design_scores_gemma":[0.00004999328,0.00008010439,0.0005701035,0.00005156818,0.00002798392,0.0001385855,0.0001590689,0.2488309,0.001569545,0.7468204,0.001680263,0.00002131115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5655209,0.004027461,0.3499934,0.005674392,0.000295096,0.0001902467,0.0005399194,0.0007898699,0.07296878],"genre_scores_gemma":[0.933911,0.001101645,0.05976301,0.0005783819,0.000220366,0.0002133836,0.0004829507,0.0002459959,0.003483346],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007351249,"threshold_uncertainty_score":0.0245924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Fangda Liu","is_ca":true},{"name":"Tiantian Mao","is_ca":false},{"name":"Ruodu Wang","is_ca":true},{"name":"Linxiao Wei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2571166057204682,"gpt":0.4669938152252159,"spread":0.2098772095047476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006594506,0.00177917,0.002256136,0.001290465,0.0007557455,0.002968763,0.001604994,0.001698068,0.004707443],"category_scores_gemma":[0.02888162,0.0008051558,0.00198759,0.001531346,0.002987489,0.006948009,0.003707004,0.002982748,0.0003307668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002676658,"about_ca_system_score_gemma":0.001694438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169183,"about_ca_topic_score_gemma":0.0007431046,"domain_scores_codex":[0.9967853,0.001520834,0.0001381778,0.0004672506,0.0006669993,0.0004214852],"domain_scores_gemma":[0.9904117,0.006691737,0.001044349,0.0008252611,0.0006165981,0.000410419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007886126,0.00009642565,0.001009871,0.0001435225,0.00008155764,0.0001598264,0.00016794,0.3312523,0.0009692463,0.6412269,0.001368653,0.02344478],"study_design_scores_gemma":[0.000008654368,0.00005411529,0.0003441976,0.00004089456,0.00002632075,0.0000942069,0.00003577874,0.5440379,0.0004421344,0.4540169,0.0008758926,0.00002299371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02884977,0.0007488368,0.963213,0.0005186239,0.00004754191,0.000034277,0.00007217832,0.00008263905,0.00643308],"genre_scores_gemma":[0.8651501,0.00198588,0.1234059,0.0004253293,0.0002578654,0.0002563687,0.0001776536,0.0001595803,0.008181352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006594506,"threshold_uncertainty_score":0.03487551,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lars Ehlers","is_ca":true},{"name":"Bettina Klaus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1372409211604631,"gpt":0.332315853002385,"spread":0.1950749318419219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01321849,0.0006522198,0.0009467374,0.0008466919,0.001207016,0.003472786,0.00250817,0.002164616,0.004985983],"category_scores_gemma":[0.05834665,0.0006106267,0.001742855,0.0008174459,0.004361931,0.007679962,0.002949166,0.004974319,0.000826066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001465945,"about_ca_system_score_gemma":0.003017361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001486452,"about_ca_topic_score_gemma":0.000720314,"domain_scores_codex":[0.9912367,0.004064579,0.0005872649,0.00150424,0.001817617,0.0007896337],"domain_scores_gemma":[0.963519,0.02154454,0.003591169,0.005731085,0.00378249,0.001831589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000101341,0.00009529059,0.0005190649,0.00008885092,0.00004116993,0.0001482472,0.0004967657,0.009463429,0.002638777,0.966311,0.0008789689,0.01921712],"study_design_scores_gemma":[0.0001923531,0.0002318491,0.000264944,0.00003415541,0.00004430745,0.0001918127,0.0001286412,0.08208971,0.003045192,0.9079084,0.005823103,0.0000455672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06088887,0.0002155724,0.9196213,0.002364113,0.0001828107,0.0001674576,0.0000804182,0.0003561104,0.01612335],"genre_scores_gemma":[0.8092507,0.0002328576,0.1808269,0.0009795252,0.0001800691,0.00032274,0.00007685482,0.0001205152,0.008009912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01321849,"threshold_uncertainty_score":0.06990689,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ningyuan Chen","is_ca":true},{"name":"Guillermo Gallego","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2164557114028993,"gpt":0.4992844795065401,"spread":0.2828287681036408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002289304,0.001236311,0.001840372,0.0006576251,0.0006304354,0.001491802,0.002070862,0.002269969,0.004532402],"category_scores_gemma":[0.0050874,0.0008019285,0.0005959802,0.001264586,0.001088239,0.001887732,0.001629448,0.002655973,0.0008825845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001615136,"about_ca_system_score_gemma":0.002238571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991462,"about_ca_topic_score_gemma":0.002498752,"domain_scores_codex":[0.9992353,0.0003002195,0.00003138187,0.0001712748,0.00014065,0.0001211993],"domain_scores_gemma":[0.9983171,0.001168135,0.0001194904,0.00009828422,0.0001932886,0.0001036761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001351784,0.0002376927,0.000601831,0.0001010136,0.00004440572,0.00006913407,0.00005323755,0.8912637,0.0004842383,0.03203675,0.005173841,0.06979893],"study_design_scores_gemma":[0.00002267829,0.00001724214,0.00002526012,0.000005142997,0.000003209021,0.00001194219,0.000004710325,0.9909462,0.0000788547,0.008513169,0.0003686539,0.000002981297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01186575,0.0004033759,0.9829947,0.0005673583,0.00007252019,0.00007815888,0.00007759398,0.0002290248,0.003711626],"genre_scores_gemma":[0.3860553,0.000479824,0.6046034,0.0006005344,0.0002352404,0.0004561437,0.000365845,0.0001715015,0.007032233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004532402,"threshold_uncertainty_score":0.01516235,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luis F. Zuluaga","is_ca":true},{"name":"Javier Peña","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2856956413919422,"gpt":0.4884137580789195,"spread":0.2027181166869773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001531311,0.001161692,0.0009477468,0.001277506,0.000665257,0.001840969,0.001656915,0.001273457,0.005705379],"category_scores_gemma":[0.005428133,0.0003861076,0.0006293611,0.002459862,0.002146408,0.002472501,0.001331695,0.003997209,0.000561112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001843458,"about_ca_system_score_gemma":0.001159205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002679737,"about_ca_topic_score_gemma":0.002359442,"domain_scores_codex":[0.9991689,0.0003017605,0.00002889466,0.0001379512,0.0002347542,0.0001276991],"domain_scores_gemma":[0.9980774,0.001153836,0.0001935881,0.0001929711,0.0002821717,0.0001000318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001542664,0.00001369559,0.00008729659,0.00004944309,0.000009853447,0.00004323708,0.00003192487,0.1109389,0.0005709878,0.8763292,0.001708656,0.01020137],"study_design_scores_gemma":[0.000005756045,0.00002199605,0.00006893411,0.00002055308,0.000005429031,0.00004580473,0.00001891331,0.6074939,0.000593426,0.3870682,0.004645254,0.00001182553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005867183,0.0006301253,0.9805432,0.0005446058,0.0001124644,0.00001955179,0.0001073518,0.0000510391,0.01212445],"genre_scores_gemma":[0.5203259,0.003681865,0.4532378,0.001274427,0.0009416274,0.0003778243,0.0004319236,0.0002071063,0.01952152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005705379,"threshold_uncertainty_score":0.01908642,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1257952233817065,"gpt":0.336740079970483,"spread":0.2109448565887765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003677812,0.001932077,0.002761912,0.001098666,0.001413119,0.00426263,0.002798265,0.002299026,0.008809015],"category_scores_gemma":[0.03022986,0.0008548163,0.001889149,0.002474592,0.003139854,0.007246719,0.004053158,0.00605672,0.001374753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003225406,"about_ca_system_score_gemma":0.002956968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005215785,"about_ca_topic_score_gemma":0.006141223,"domain_scores_codex":[0.995503,0.001522938,0.0002150944,0.0009295647,0.001208139,0.0006214264],"domain_scores_gemma":[0.9551952,0.03851666,0.00149841,0.002373978,0.001737709,0.000677894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00107089,0.0003468072,0.002762231,0.00119126,0.0002085691,0.0005241836,0.0004951456,0.5607901,0.003948157,0.282207,0.0381624,0.1082933],"study_design_scores_gemma":[0.00005647265,0.00005273009,0.0005216402,0.00005549975,0.00003490868,0.0001394565,0.00009826619,0.6691332,0.000774309,0.3271494,0.001955728,0.00002837376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08583874,0.005548132,0.8578553,0.01339043,0.0004836624,0.000296588,0.003194173,0.00139257,0.03200043],"genre_scores_gemma":[0.6573587,0.005443451,0.3117673,0.002629392,0.001052937,0.0008412982,0.0052231,0.001186962,0.01449672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008809015,"threshold_uncertainty_score":0.02946901,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yichuan Ding","is_ca":false},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1558959852504453,"gpt":0.4509045053540539,"spread":0.2950085201036086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003835394,0.001507523,0.001146006,0.0008608851,0.0005499054,0.001874246,0.00151598,0.001431788,0.006187938],"category_scores_gemma":[0.01304165,0.0006633454,0.001011765,0.001254413,0.001598746,0.002680795,0.002195567,0.005917253,0.001659724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261818,"about_ca_system_score_gemma":0.001857858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090551,"about_ca_topic_score_gemma":0.00143021,"domain_scores_codex":[0.9978747,0.0008778144,0.0000923163,0.0003967778,0.0006151207,0.0001432565],"domain_scores_gemma":[0.9932972,0.004582959,0.0005405197,0.0005954078,0.000720199,0.0002637124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001905926,0.0003896736,0.0004114571,0.0004496236,0.00006229508,0.0001490221,0.0001817132,0.6666509,0.006182275,0.2206442,0.01546162,0.08922665],"study_design_scores_gemma":[0.00002672505,0.00009404499,0.00008535076,0.00003073468,0.000007403464,0.00005626929,0.00003008442,0.9448938,0.001103568,0.05025526,0.003400741,0.00001595577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003847922,0.0001557108,0.9907823,0.0003568941,0.00005039644,0.00005805619,0.0001286425,0.0001366315,0.004483555],"genre_scores_gemma":[0.2067596,0.0007820115,0.7825029,0.0005565302,0.000281996,0.0006944551,0.001090202,0.0004302448,0.006901942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006187938,"threshold_uncertainty_score":0.02070075,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Santosh N. Kabadi","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08683230206189134,"gpt":0.3337473374116076,"spread":0.2469150353497163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251405,0.001530617,0.001096756,0.0009514445,0.0009279427,0.00165724,0.002662674,0.001788457,0.01819593],"category_scores_gemma":[0.004396682,0.0007064043,0.001604052,0.001135812,0.001057963,0.002649342,0.002731555,0.003034748,0.005103935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001702367,"about_ca_system_score_gemma":0.003289172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0031036,"about_ca_topic_score_gemma":0.0051522,"domain_scores_codex":[0.9987184,0.0002474372,0.0001003273,0.0003802474,0.0002604635,0.0002930641],"domain_scores_gemma":[0.998201,0.0008750368,0.0002399522,0.0003820952,0.0002000916,0.0001017896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001448994,0.001315638,0.002027909,0.001065085,0.0001925316,0.0003932629,0.0004995008,0.210573,0.02495426,0.05093934,0.05578695,0.6508035],"study_design_scores_gemma":[0.0007960327,0.0004362265,0.001002848,0.0001108959,0.0001084014,0.0004529822,0.0003327378,0.8793027,0.01652019,0.0845672,0.01629612,0.0000736834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01335951,0.0002329358,0.9679976,0.001038564,0.00008879727,0.0006853334,0.0003589993,0.005021809,0.01121655],"genre_scores_gemma":[0.1253366,0.0001637101,0.8658933,0.0004062086,0.00007506154,0.0009321866,0.001280981,0.0005976897,0.005314251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01819593,"threshold_uncertainty_score":0.06087142,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mustafa Akan","is_ca":false},{"name":"Barış Ata","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0436355011372705,"gpt":0.3403300945480038,"spread":0.2966945934107333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003542547,0.001203747,0.0012552,0.0007481,0.0004662975,0.002215801,0.00213072,0.001603627,0.002612522],"category_scores_gemma":[0.008426083,0.000663475,0.001209044,0.0006778173,0.003522085,0.003187178,0.001509794,0.002368246,0.0002298317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002728858,"about_ca_system_score_gemma":0.001585628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002408934,"about_ca_topic_score_gemma":0.001161633,"domain_scores_codex":[0.9985552,0.0006674725,0.00004739846,0.0002187807,0.0003007159,0.0002103769],"domain_scores_gemma":[0.9975489,0.001204815,0.0004222057,0.0001860479,0.0003558836,0.0002821703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000616872,0.00007023592,0.0003575297,0.00006489879,0.00003758974,0.0001123356,0.0001031848,0.3048099,0.002381449,0.6879802,0.0006435424,0.003377383],"study_design_scores_gemma":[0.00001842109,0.00004123667,0.0001311556,0.00001131266,0.000009848819,0.00002048946,0.00001229468,0.8950917,0.0004272031,0.1038393,0.000381968,0.00001504822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06149156,0.0004590501,0.9285339,0.0007934883,0.0000888399,0.00008346453,0.00008903584,0.00007839585,0.008382353],"genre_scores_gemma":[0.9543856,0.0004946573,0.03879979,0.0001726828,0.000123163,0.0001604633,0.0000569958,0.00004347332,0.005763085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003542547,"threshold_uncertainty_score":0.01979941,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christian Bender","is_ca":false},{"name":"Robert J. Elliott","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05043644441289889,"gpt":0.3133080381157297,"spread":0.2628715937028308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00271246,0.0007171934,0.001290314,0.0009260675,0.0006183084,0.002703733,0.001307869,0.001575996,0.002647329],"category_scores_gemma":[0.007424868,0.0004158205,0.001174834,0.0005578197,0.003045141,0.005238397,0.001393319,0.001802425,0.0002787409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009382009,"about_ca_system_score_gemma":0.000787248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001765865,"about_ca_topic_score_gemma":0.0008129997,"domain_scores_codex":[0.9987009,0.0004522403,0.00007948786,0.0002292187,0.0003095871,0.0002285401],"domain_scores_gemma":[0.9972996,0.0009987486,0.0007350508,0.000245965,0.0002403011,0.0004803583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007609461,0.00005286364,0.0005273776,0.00004528105,0.00003422387,0.0002301615,0.00007487809,0.04061152,0.002011013,0.9537962,0.0004094708,0.002130959],"study_design_scores_gemma":[0.0000502672,0.00004998249,0.000259969,0.00001048867,0.0000214482,0.0001064218,0.0000220683,0.663595,0.0006179712,0.3345955,0.0006367182,0.00003422013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4409056,0.001185478,0.5411923,0.001343142,0.0003114592,0.00005337798,0.0001522617,0.0002083107,0.01464824],"genre_scores_gemma":[0.9781811,0.0003226777,0.01668428,0.000123368,0.0001805015,0.00003555947,0.00006160726,0.00002801108,0.004382989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00271246,"threshold_uncertainty_score":0.01434505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"F. Bruce Shepherd","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07242089226921299,"gpt":0.4165825610196921,"spread":0.3441616687504791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047026,0.001224629,0.001452009,0.0008021856,0.001136328,0.003374215,0.00272876,0.003979512,0.02645551],"category_scores_gemma":[0.006537085,0.0007078254,0.001148924,0.002294999,0.0008971564,0.007811904,0.002571944,0.00246903,0.003031382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173681,"about_ca_system_score_gemma":0.001254578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255444,"about_ca_topic_score_gemma":0.001139995,"domain_scores_codex":[0.9976948,0.0008504767,0.000140825,0.0005583831,0.0004084836,0.0003469473],"domain_scores_gemma":[0.9976072,0.001462167,0.0002297425,0.0002613891,0.0002034175,0.0002360787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004278555,0.0005398655,0.001248831,0.0007792002,0.000125414,0.0003527485,0.000223814,0.1205022,0.002240437,0.7328247,0.0492887,0.09144631],"study_design_scores_gemma":[0.000137639,0.0001618566,0.0004886585,0.0000879049,0.00004835321,0.0006095121,0.0003534044,0.3174341,0.001706328,0.611775,0.06716072,0.0000365196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05896506,0.001741949,0.8370247,0.009193605,0.0005197439,0.0007334494,0.004402379,0.0006055561,0.08681356],"genre_scores_gemma":[0.5927047,0.003819551,0.3420208,0.001994025,0.0009131331,0.0009379509,0.007540961,0.0005393058,0.04952964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02645551,"threshold_uncertainty_score":0.08850253,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christiane Lemieux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2484975107877077,"gpt":0.4824369159611381,"spread":0.2339394051734304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008940717,0.0007304463,0.0009345631,0.001333228,0.0006687833,0.001467037,0.002352606,0.001293267,0.002588969],"category_scores_gemma":[0.05154204,0.0007525743,0.0006785829,0.0008122489,0.003353531,0.004246695,0.002274863,0.002438624,0.0003549471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001757776,"about_ca_system_score_gemma":0.0009701267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009008985,"about_ca_topic_score_gemma":0.0009528873,"domain_scores_codex":[0.9946657,0.002739765,0.000183793,0.0007542776,0.001378661,0.0002778168],"domain_scores_gemma":[0.9489367,0.03987908,0.002749375,0.005611092,0.002201192,0.0006226046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001808694,0.00006804468,0.002386807,0.0001676827,0.00006826645,0.0001404929,0.0001572171,0.2215528,0.004230361,0.7483233,0.0009865316,0.02173767],"study_design_scores_gemma":[0.00002179635,0.00008476782,0.0006154376,0.00004530056,0.00002044713,0.0001001697,0.00001655783,0.7785102,0.003092336,0.2160469,0.001416069,0.00003017918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02162236,0.0003810213,0.9753631,0.0001866979,0.00002467783,0.00002947753,0.0000662146,0.0001333931,0.002193224],"genre_scores_gemma":[0.6429193,0.0007167219,0.3498706,0.0004143122,0.0001384855,0.0003475288,0.0004054309,0.0002834244,0.004904129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008940717,"threshold_uncertainty_score":0.04728359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ali̇ Devran Kara","is_ca":false},{"name":"Serdar Yüksel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1956737594459966,"gpt":0.3990674966197256,"spread":0.2033937371737291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007389967,0.0009997521,0.001413291,0.001098466,0.0009813897,0.001761536,0.001500328,0.001964967,0.00246835],"category_scores_gemma":[0.0530324,0.0006681955,0.001082767,0.0005611256,0.003806336,0.003574217,0.002793384,0.002653154,0.0003346881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279695,"about_ca_system_score_gemma":0.002785705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004182089,"about_ca_topic_score_gemma":0.001936018,"domain_scores_codex":[0.9976433,0.000930607,0.0001446964,0.0004788819,0.0005473589,0.0002551225],"domain_scores_gemma":[0.9588679,0.03553162,0.001982301,0.00107942,0.001918592,0.0006201605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000176243,0.0001000935,0.001848971,0.0001523287,0.000069113,0.0001352577,0.0003092179,0.8399283,0.002057243,0.1370775,0.0004172377,0.01772861],"study_design_scores_gemma":[0.00001507612,0.00004978177,0.0001127925,0.00001647108,0.000004837877,0.00001495467,0.00001621229,0.964435,0.0006584717,0.03455866,0.0001100325,0.000007571288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03305541,0.0001579362,0.964425,0.0002899167,0.00001760148,0.00005422784,0.00003205114,0.0001520992,0.00181573],"genre_scores_gemma":[0.8718561,0.0003463072,0.1245505,0.0002469449,0.00004490515,0.0003996936,0.0001318221,0.0001508896,0.002272924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007389967,"threshold_uncertainty_score":0.03908235,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Gábor Lugosi","is_ca":false},{"name":"Abbas Mehrabian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4572293218497314,"gpt":0.5586788726154809,"spread":0.1014495507657495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003466517,0.002231646,0.002472508,0.0007433522,0.001166744,0.002281378,0.002551194,0.002335271,0.003571777],"category_scores_gemma":[0.01812477,0.0009529482,0.001090948,0.001223302,0.002298011,0.004001099,0.003102501,0.003198689,0.0006866055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001780454,"about_ca_system_score_gemma":0.001088146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002701404,"about_ca_topic_score_gemma":0.001938459,"domain_scores_codex":[0.9968292,0.00134923,0.0001442094,0.0005718624,0.0004941959,0.0006112284],"domain_scores_gemma":[0.9819953,0.01355235,0.002312251,0.000879266,0.0005332098,0.0007275308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000731694,0.0001993633,0.00104899,0.0001232705,0.0001029891,0.0002052264,0.0001584941,0.8984149,0.001412243,0.0857178,0.0009305925,0.01095448],"study_design_scores_gemma":[0.00003993954,0.00008290342,0.00008266074,0.000008427198,0.00001186673,0.00003182649,0.00002236187,0.9646351,0.0003990183,0.03445403,0.0002213828,0.00001040242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1685171,0.0005498976,0.8217534,0.0008257016,0.0001141719,0.0001583346,0.0002064426,0.0003357577,0.007539157],"genre_scores_gemma":[0.9360417,0.0002932678,0.05633627,0.0002728614,0.0001047883,0.000230164,0.0002009844,0.00007199473,0.00644807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003571777,"threshold_uncertainty_score":0.0183329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shie Mannor","is_ca":true},{"name":"John N. Tsitsiklis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3170072528469867,"gpt":0.4601731656936224,"spread":0.1431659128466358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006519512,0.0008115121,0.001385516,0.001574354,0.001019292,0.002532159,0.001687082,0.001435592,0.003627048],"category_scores_gemma":[0.03610321,0.0008273764,0.0007925252,0.001188459,0.004793552,0.005824296,0.002714182,0.002637249,0.0003513564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002483077,"about_ca_system_score_gemma":0.001310067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001870346,"about_ca_topic_score_gemma":0.0009423223,"domain_scores_codex":[0.9962279,0.001602604,0.0001920541,0.0006974065,0.0008329007,0.0004472666],"domain_scores_gemma":[0.9466075,0.04479291,0.003884357,0.001877104,0.001604581,0.001233593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001635847,0.00007220241,0.001572581,0.0001117577,0.00004387851,0.0001289329,0.0002769449,0.3607748,0.002026488,0.6243321,0.0003400574,0.01015672],"study_design_scores_gemma":[0.00002902365,0.00008151016,0.0008360812,0.00004627588,0.00001346819,0.00005799465,0.00007294708,0.6539472,0.0006073636,0.3437505,0.0005225363,0.00003501765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2336994,0.0006927629,0.7578002,0.0008126369,0.0000465773,0.00007434916,0.000192752,0.0001825535,0.006498866],"genre_scores_gemma":[0.9342227,0.0008678451,0.06139459,0.0001173793,0.0001250734,0.000269089,0.0002017432,0.0001105585,0.002691039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006519512,"threshold_uncertainty_score":0.0344789,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Viliam Makiš","is_ca":true},{"name":"Xiangqian Jiang","is_ca":true},{"name":"Kian‐Kai Cheng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03119307777705049,"gpt":0.3199220425933819,"spread":0.2887289648163314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001744034,0.0009326306,0.001660953,0.0007238956,0.0003458432,0.0009488694,0.001123296,0.001351004,0.001662183],"category_scores_gemma":[0.005103478,0.0007832737,0.0006414194,0.0003989046,0.001189793,0.0008641626,0.0006787381,0.0008887707,0.0001973451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001355433,"about_ca_system_score_gemma":0.001481681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005502308,"about_ca_topic_score_gemma":0.002171784,"domain_scores_codex":[0.9989848,0.0003942347,0.00005182713,0.0001785437,0.0001324323,0.0002582313],"domain_scores_gemma":[0.9970396,0.00193165,0.0004179181,0.0001124026,0.0002441767,0.0002543229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002019894,0.00007142319,0.0004941326,0.0001092662,0.00003461044,0.000125015,0.0000429482,0.9732842,0.001959319,0.01727248,0.0004552303,0.005949365],"study_design_scores_gemma":[0.00003861402,0.00008226085,0.0002785775,0.00001054984,0.00002299229,0.00002834269,0.00001655054,0.9887905,0.0005078196,0.01003293,0.000181951,0.000008928014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4395114,0.001953382,0.5505457,0.00106371,0.0001049737,0.0001055639,0.0002274962,0.0003594657,0.006128277],"genre_scores_gemma":[0.9804626,0.0003131164,0.01686572,0.00004973601,0.00002863339,0.00005086853,0.00008470124,0.00004101607,0.002103645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005502308,"threshold_uncertainty_score":0.01094055,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marcel Nutz","is_ca":false},{"name":"Yuchong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07781145011900378,"gpt":0.3526694802626509,"spread":0.2748580301436472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576563,0.0007680323,0.001215688,0.0006671606,0.001071052,0.002339659,0.001982739,0.003230443,0.01619276],"category_scores_gemma":[0.00449461,0.000420985,0.001098169,0.0006239851,0.001895688,0.003250187,0.001760344,0.001914332,0.001419719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00161569,"about_ca_system_score_gemma":0.00170828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002047529,"about_ca_topic_score_gemma":0.001811187,"domain_scores_codex":[0.9985462,0.0005786606,0.00004176779,0.0003209601,0.0002797571,0.0002325909],"domain_scores_gemma":[0.998431,0.0007299912,0.0001701978,0.0001895184,0.0001490172,0.000330254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007354042,0.00008951537,0.0002871059,0.0000591985,0.00003041616,0.00009868247,0.00007571294,0.05095525,0.001259356,0.9349185,0.004455584,0.007697179],"study_design_scores_gemma":[0.0001018073,0.0001625596,0.0002787117,0.00002220366,0.00002101511,0.0001636439,0.00004546209,0.3703021,0.0002736459,0.6175796,0.01100734,0.00004177624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07887726,0.0007066426,0.7654231,0.006264341,0.0005485708,0.000286155,0.0005294818,0.000366497,0.1469979],"genre_scores_gemma":[0.8787889,0.0006254599,0.07277849,0.001410988,0.0003773888,0.0003715007,0.0001842726,0.00009062263,0.04537238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01619276,"threshold_uncertainty_score":0.05417019,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Minimum-cost flow problem; Flow (mathematics); Algorithm; Mathematical optimization; Flow network; Geometry","authors":[{"name":"Maiko Shigeno","is_ca":false},{"name":"Satoru Iwata","is_ca":false},{"name":"S. Thomas McCormick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08106170843672988,"gpt":0.3754496383923113,"spread":0.2943879299555814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002175484,0.001394834,0.001157809,0.001555556,0.001004837,0.001366647,0.002336978,0.000899371,0.007226764],"category_scores_gemma":[0.007932363,0.0005398351,0.001230707,0.001921556,0.001215761,0.003481379,0.002031401,0.0022845,0.001100181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390024,"about_ca_system_score_gemma":0.001537056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002236544,"about_ca_topic_score_gemma":0.002386109,"domain_scores_codex":[0.9977421,0.0006238528,0.000161319,0.0003602356,0.0009014066,0.0002111535],"domain_scores_gemma":[0.9966418,0.001506498,0.0002910329,0.000828404,0.0005683393,0.0001639349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00037151,0.0002269546,0.001084118,0.0002859715,0.00005905533,0.00006592228,0.0002325987,0.159663,0.008444902,0.1811365,0.01077325,0.6376563],"study_design_scores_gemma":[0.0001268222,0.0001732926,0.0005259626,0.00004131292,0.00004790129,0.0001757589,0.00006984769,0.7913694,0.009946956,0.1791188,0.01835159,0.00005226059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01187429,0.0002956488,0.9810489,0.0002055983,0.00006784556,0.0001194446,0.00007319014,0.000980634,0.005334442],"genre_scores_gemma":[0.1267199,0.0003246372,0.8671579,0.0002474188,0.0001408938,0.0003136535,0.000449912,0.000591935,0.004053864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007226764,"threshold_uncertainty_score":0.02417594,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kevin K. H. Cheung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1715857947836488,"gpt":0.4919333757813225,"spread":0.3203475809976737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002280149,0.001172167,0.001706046,0.002156828,0.001048377,0.002052832,0.001181555,0.001242699,0.009349965],"category_scores_gemma":[0.01080594,0.000626256,0.001321383,0.0009731695,0.001914746,0.002845422,0.001840978,0.003530625,0.001124606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009323899,"about_ca_system_score_gemma":0.0009575493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00163532,"about_ca_topic_score_gemma":0.00295683,"domain_scores_codex":[0.9987018,0.0003733996,0.00006111104,0.0001855698,0.0004060069,0.0002721606],"domain_scores_gemma":[0.9966204,0.002130421,0.0002984834,0.0002944836,0.0003190115,0.0003372304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002991511,0.0002720348,0.002475419,0.0006251984,0.0001407063,0.000269465,0.0004852362,0.4435313,0.005223556,0.4319489,0.01007693,0.1046521],"study_design_scores_gemma":[0.00004399717,0.0001291044,0.001002245,0.00005111365,0.00001628077,0.00008868293,0.0001484082,0.7813021,0.002563017,0.2110314,0.003561466,0.0000621892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1551513,0.0007938507,0.8235326,0.0008485845,0.0001358385,0.0001570883,0.0005065472,0.0006643806,0.01820987],"genre_scores_gemma":[0.6574605,0.0005506077,0.3304256,0.0001716185,0.0001644883,0.0002918641,0.001252474,0.0003710061,0.009311797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009349965,"threshold_uncertainty_score":0.03127879,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Yichuan Ding","is_ca":false},{"name":"Dongdong Ge","is_ca":false},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2219451499796543,"gpt":0.4008517452339596,"spread":0.1789065952543053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01054057,0.003082297,0.001506131,0.001804239,0.0009406041,0.003291139,0.002176272,0.001900184,0.009831076],"category_scores_gemma":[0.03878025,0.000873388,0.001637262,0.002042141,0.004492202,0.006278197,0.004646107,0.009406665,0.001563112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002220638,"about_ca_system_score_gemma":0.001354037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224451,"about_ca_topic_score_gemma":0.001067187,"domain_scores_codex":[0.993601,0.002982893,0.0002555676,0.0007786982,0.0017489,0.0006328592],"domain_scores_gemma":[0.967662,0.02631798,0.001811666,0.001336383,0.002024366,0.0008475761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002540539,0.0004122444,0.0004779775,0.0004393629,0.00006713532,0.0001847769,0.0004812623,0.1669059,0.002919661,0.7718031,0.005893407,0.05016105],"study_design_scores_gemma":[0.00005279481,0.0002703164,0.0002841444,0.0001110869,0.00002155672,0.0001046582,0.0001368133,0.5318713,0.001305794,0.4625102,0.003293248,0.00003802236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01464768,0.0008564943,0.9617772,0.001162693,0.0001398499,0.0001251192,0.0001745222,0.0001672591,0.02094931],"genre_scores_gemma":[0.5153739,0.003641939,0.4603963,0.001982077,0.001054821,0.001112418,0.001054777,0.0008382873,0.01454547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01054057,"threshold_uncertainty_score":0.05574453,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Miguel Á. Goberna","is_ca":false},{"name":"Tamás Terlaky","is_ca":false},{"name":"M. I. Todorov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1224145560247939,"gpt":0.4600760896474391,"spread":0.3376615336226452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005314556,0.001452223,0.001369936,0.001507615,0.000625111,0.002546716,0.0008543964,0.001016103,0.00215457],"category_scores_gemma":[0.02184102,0.0008848268,0.001216294,0.0007646555,0.003454812,0.003110368,0.002599717,0.001994318,0.0001466015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001868412,"about_ca_system_score_gemma":0.0008205488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001467147,"about_ca_topic_score_gemma":0.0006634712,"domain_scores_codex":[0.9967619,0.001962876,0.00008117182,0.0003062966,0.000611309,0.0002763486],"domain_scores_gemma":[0.9825335,0.01522176,0.0009342121,0.0004232333,0.0005895931,0.0002976278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009700023,0.00001834237,0.0005264577,0.00008666533,0.00007297535,0.0001302293,0.0001149892,0.833118,0.001970549,0.1589578,0.0003097252,0.00459735],"study_design_scores_gemma":[0.00001100971,0.00004179194,0.0002391297,0.00003064736,0.00001497907,0.00003592798,0.00004051278,0.8672699,0.0008057831,0.1311306,0.0003581907,0.00002150984],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0833828,0.0006976461,0.9058809,0.0005459108,0.00003463538,0.00007589212,0.0001229304,0.0001114888,0.009147893],"genre_scores_gemma":[0.9663123,0.0004745804,0.03069295,0.0001390243,0.00004249412,0.0001767786,0.0001309725,0.00008017735,0.001950823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005314556,"threshold_uncertainty_score":0.02810639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hong Chen","is_ca":true},{"name":"Hanqin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05305774655468025,"gpt":0.3397158762682272,"spread":0.286658129713547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003923422,0.0008797107,0.0009453137,0.001519424,0.0007491941,0.001693477,0.001628727,0.001299052,0.002068952],"category_scores_gemma":[0.01345284,0.0005136369,0.00114041,0.0009841139,0.002158847,0.00325558,0.001725911,0.00259006,0.0002523053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003993021,"about_ca_system_score_gemma":0.001453215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009162788,"about_ca_topic_score_gemma":0.003582822,"domain_scores_codex":[0.9989694,0.0002427774,0.00005267718,0.000193143,0.0003275129,0.0002145789],"domain_scores_gemma":[0.9958717,0.00249116,0.0006606663,0.0001787626,0.0005463703,0.0002514043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009037879,0.00004288894,0.0009362416,0.0001143162,0.00004379274,0.0001668674,0.0003218423,0.4043153,0.00336119,0.5782225,0.001193109,0.01119161],"study_design_scores_gemma":[0.000006925568,0.000009376381,0.0001147944,0.00000875838,0.000005812109,0.00002102903,0.00002367209,0.9467871,0.0002165911,0.05244309,0.0003538277,0.000009034437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08353838,0.001740683,0.9052928,0.001419212,0.0001488737,0.00005972581,0.0001248252,0.0002011942,0.007474205],"genre_scores_gemma":[0.9217699,0.00268106,0.06322049,0.000331201,0.0001847063,0.0001502165,0.0001734841,0.00008622258,0.01140277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009162788,"threshold_uncertainty_score":0.02897149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}