{"meta":{"query_hash":"88996ac5d38d","filters":{"venue":"Mathematical Methods of Operations Research"},"cohort_total":30,"direct_labels_cover":0,"predictions_cover":30,"exported":30,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/88996ac5d38d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+Methods+of+Operations+Research"},"results":[{"id":"W1570285879","doi":"10.1007/s00186-007-0170-0","title":"S. Nickel and J. Puerto: Location theory: a unified approach","year":2007,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nickel; Computer science; Materials science","score_opus":0.1255455380681576,"score_gpt":0.4706686301258944,"score_spread":0.3451230920577368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570285879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018541072,0.000058422796,0.9816704,0.0005747662,0.000027841405,0.00038243757,6.3931225e-7,0.000045381894,0.015386034],"genre_scores_gemma":[0.14169176,0.000012065846,0.85771674,0.000031017073,0.0000128361335,0.000024961977,0.000002028086,0.000006172728,0.0005024373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781245,0.0008930246,0.00036772375,0.00027028171,0.00041225192,0.00024425547],"domain_scores_gemma":[0.9970965,0.0017402739,0.000025458894,0.00044725303,0.0005679879,0.00012254895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012007893,0.00008378904,0.00016469118,0.00035063367,0.0002372437,0.00016452705,0.0003257605,0.00008081947,0.00006841891],"category_scores_gemma":[0.0026805352,0.00006980538,0.000027391914,0.0010568235,0.00028931166,0.00033119848,0.00018182132,0.00022876887,0.000015691883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064645333,0.00009266958,0.000010079041,0.00004603724,0.000009062843,5.3024934e-7,0.0006646503,0.00044168453,0.0021361285,0.88351375,0.000021638934,0.113057315],"study_design_scores_gemma":[0.0003260734,0.00008499614,0.0007988541,0.00003455758,0.0000065440463,0.00003368192,0.0009902045,0.83579886,0.00868702,0.1529697,0.00013167792,0.00013784232],"about_ca_topic_score_codex":0.000010223291,"about_ca_topic_score_gemma":0.0000056886133,"teacher_disagreement_score":0.8353571,"about_ca_system_score_codex":0.000034965582,"about_ca_system_score_gemma":0.000106468164,"threshold_uncertainty_score":0.41617203},"labels":[],"label_agreement":null},{"id":"W1967250047","doi":"10.1007/s001860200197","title":"An Attractor-Repeller approach to floorplanning","year":2002,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Mathematical optimization; Set (abstract data type); Floorplan; Attractor; Optimization problem; Computer science; Regular polygon; Mathematics; Fixed point; Combinatorial optimization; Algorithm","score_opus":0.23803130234436123,"score_gpt":0.47045461685766066,"score_spread":0.23242331451329942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967250047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044044447,0.00004867989,0.96088374,0.00004339056,0.000033357184,0.00027083053,0.000004564851,0.000115077746,0.034195896],"genre_scores_gemma":[0.27843443,0.000009491637,0.7210492,0.000006872308,0.000036503843,0.000057238114,0.0000049994183,0.000023357119,0.00037794907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872845,0.00023146188,0.0002821823,0.00018380267,0.00029773978,0.0002763397],"domain_scores_gemma":[0.9988775,0.00037601904,0.0000061754636,0.00041470662,0.0001662776,0.00015926697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012800475,0.000102399834,0.00019191895,0.00023322104,0.00013593402,0.0000722135,0.00022940771,0.000076772594,0.00036610934],"category_scores_gemma":[0.0008668857,0.000090782065,0.000028328723,0.0003421075,0.000070274196,0.00015161137,0.000037301936,0.00028378674,0.00009755498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016729606,0.00015273438,0.000001084245,0.00008560622,0.000010515501,4.847166e-7,0.0010038876,0.96979135,0.006251262,0.015476577,0.0002789875,0.0069458266],"study_design_scores_gemma":[0.000070580325,0.00005376695,0.000015894775,0.000018971881,0.000004147236,0.000003451139,0.00020338915,0.97918516,0.017056677,0.0029106971,0.00037117713,0.00010607113],"about_ca_topic_score_codex":0.0000035829185,"about_ca_topic_score_gemma":5.025723e-7,"teacher_disagreement_score":0.27402997,"about_ca_system_score_codex":0.000036712754,"about_ca_system_score_gemma":0.0000053282656,"threshold_uncertainty_score":0.40086403},"labels":[],"label_agreement":null},{"id":"W1989295643","doi":"10.1007/s00186-005-0008-6","title":"Upper and lower bounds for the solutions of Markov renewal equations","year":2005,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Markov chain; Upper and lower bounds; Markov process; Mathematics; Applied mathematics; Markov renewal process; Construct (python library); Renewal theory; Mathematical optimization; Markov model; Markov property; Computer science; Mathematical analysis; Statistics","score_opus":0.5802904042036138,"score_gpt":0.6155566351697195,"score_spread":0.035266230966105705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989295643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074440823,0.00037606136,0.9741274,0.013764633,0.000041887426,0.0007459606,0.0000439566,0.000007341618,0.0034486419],"genre_scores_gemma":[0.29605186,0.000024638368,0.7015814,0.000026885398,0.00004504679,0.0001726746,0.0000010398763,0.000006548289,0.0020899018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959922,0.0013786111,0.0008899902,0.00029853865,0.0011300624,0.00031060146],"domain_scores_gemma":[0.96545243,0.031980596,0.000051062118,0.0008466591,0.0015721746,0.00009710195],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.033657473,0.00008415104,0.00029344892,0.00027466536,0.0008292241,0.00018727755,0.0006590285,0.000091156115,0.0006322533],"category_scores_gemma":[0.047109943,0.000046128684,0.00013996534,0.0007593902,0.0011693477,0.0002708763,0.0004116527,0.00020969751,0.000022920489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000326492,0.00034252246,0.000009997038,0.00002653215,0.000027167904,4.3818126e-8,0.0013091721,0.0027487967,0.0036018272,0.8940412,0.00082044804,0.09703967],"study_design_scores_gemma":[0.0001403833,0.00008078432,0.000042592765,0.00001418384,0.000012316387,0.0000015900602,0.00050786,0.4415596,0.0015419722,0.55472374,0.0013330427,0.00004189217],"about_ca_topic_score_codex":0.00003040952,"about_ca_topic_score_gemma":0.0001171297,"teacher_disagreement_score":0.43881083,"about_ca_system_score_codex":0.000029375164,"about_ca_system_score_gemma":0.00022081171,"threshold_uncertainty_score":0.995053},"labels":[],"label_agreement":null},{"id":"W1995695651","doi":"10.1007/s001860000073","title":"The efficient frontier for bounded assets","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":105,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Efficient frontier; Portfolio; Bounded function; Constraint (computer-aided design); Upper and lower bounds; Selection (genetic algorithm); Variance (accounting); Project portfolio management; Budget constraint; Asset (computer security); Mathematical optimization; Universe; Mathematics; Econometrics; Economics; Mathematical economics; Computer science; Finance; Microeconomics","score_opus":0.4164572100295024,"score_gpt":0.6420881436023647,"score_spread":0.22563093357286224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995695651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023543708,0.00015885684,0.9491084,0.0024851328,0.00008779323,0.00088924123,0.000012977552,0.000013098982,0.023700792],"genre_scores_gemma":[0.026451347,0.00008591392,0.94529176,0.000023540815,0.000059601338,0.0002646682,0.0000035654198,0.000014294637,0.027805295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950058,0.0018816482,0.00084973295,0.00030406658,0.0015958204,0.0003629262],"domain_scores_gemma":[0.98532546,0.012326574,0.000038181246,0.000831231,0.0013663456,0.00011223948],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.032342598,0.00008800464,0.00025815665,0.00020606125,0.0010892453,0.00065723783,0.00081583887,0.000078774625,0.0016984111],"category_scores_gemma":[0.02086564,0.000046721478,0.00012913908,0.0010067441,0.0004272465,0.000119305994,0.00007458599,0.00018100273,0.0002748187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089960784,0.0002925086,0.000020603238,0.000008463465,0.000026409674,4.487959e-7,0.00089462154,0.03278083,0.0007138749,0.31269068,0.012710251,0.63977134],"study_design_scores_gemma":[0.0001948527,0.00008781122,0.000118254204,0.000008709165,0.000006207357,0.0000024154908,0.00036280128,0.65661985,0.0026990476,0.27314577,0.06668888,0.000065418804],"about_ca_topic_score_codex":0.000011400812,"about_ca_topic_score_gemma":0.000008378534,"teacher_disagreement_score":0.63970596,"about_ca_system_score_codex":0.000027517692,"about_ca_system_score_gemma":0.00015274386,"threshold_uncertainty_score":0.9992142},"labels":[],"label_agreement":null},{"id":"W2002760368","doi":"10.1007/s001860050004","title":"A convex dual approach to the computation of NMR complex spectra","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Thermodynamics and Statistical Mechanics","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computation; Duality (order theory); Dual (grammatical number); Spectral line; Regular polygon; Entropy (arrow of time); Statistical physics; Mathematics; Computer science; Algorithm; Combinatorics; Physics; Quantum mechanics; Geometry","score_opus":0.1515667568102964,"score_gpt":0.4892947998065489,"score_spread":0.3377280429962525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002760368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011374707,0.0000067373367,0.9498684,0.0003599605,0.00000849125,0.0005478109,0.00006792357,0.0000062062936,0.03775981],"genre_scores_gemma":[0.43905348,6.2091675e-7,0.56063265,0.000009827071,0.000026914535,0.000050272753,0.000011867062,0.000008847559,0.00020551943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982222,0.00057569076,0.00040592105,0.00018217208,0.00038141577,0.0002326326],"domain_scores_gemma":[0.99847627,0.0008392398,0.000021924825,0.00028578416,0.0002859427,0.00009083297],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016898431,0.000092761366,0.0002792939,0.00007076409,0.00018294035,0.000039285012,0.00022497473,0.00002707411,0.0015024209],"category_scores_gemma":[0.00017215907,0.000063381114,0.000061880346,0.00042835335,0.0001787151,0.000043354125,0.00006672343,0.00022502065,0.00004855585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146389075,0.00033809224,0.0000012024559,0.000032450134,0.000028318644,1.1105343e-7,0.00056688656,0.015349731,0.0039497465,0.916313,0.000046210174,0.06335963],"study_design_scores_gemma":[0.00012538754,0.00008397539,0.000044877142,0.000015609603,0.000007673293,8.3703696e-7,0.0004823494,0.680895,0.0011862728,0.31695905,0.00014230738,0.00005670885],"about_ca_topic_score_codex":0.000037272708,"about_ca_topic_score_gemma":0.0000012369251,"teacher_disagreement_score":0.6655452,"about_ca_system_score_codex":0.000014305158,"about_ca_system_score_gemma":0.00004637594,"threshold_uncertainty_score":0.99941033},"labels":[],"label_agreement":null},{"id":"W2005776335","doi":"10.1007/s00186-011-0361-6","title":"Optimizing capacity, pricing and location decisions on a congested network with balking","year":2011,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Queue; Service (business); Mathematical optimization; Tabu search; Operations research; Poisson distribution; Facility location problem; Heuristic; Node (physics); Process (computing); Queueing theory; Transshipment (information security); Multinomial logistic regression; Computer network; Algorithm; Mathematics; Economics","score_opus":0.3506698778758426,"score_gpt":0.42112569018398377,"score_spread":0.07045581230814119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005776335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18408798,0.000041500898,0.7771424,0.0006757089,0.00006403791,0.0008644019,6.6376214e-7,0.00006250941,0.037060775],"genre_scores_gemma":[0.5352474,0.0000081830385,0.46436587,0.00011318264,0.000057170713,0.00007784311,0.000002966789,0.0000132224195,0.00011417514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984089,0.00016966008,0.00038817953,0.0002764105,0.00046303135,0.00029380224],"domain_scores_gemma":[0.9982939,0.00038063293,0.00002613654,0.00036710614,0.0009025874,0.000029663248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004302659,0.00012317048,0.00021627882,0.00037235575,0.00044624237,0.00016621046,0.00021178201,0.000051091294,0.0003847793],"category_scores_gemma":[0.002492229,0.00009415673,0.000023621787,0.001369915,0.00020534446,0.00044891785,0.00020737787,0.00021728639,0.00007655142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060581824,0.00031277337,0.00018442461,0.00032600955,0.00005038527,0.0000014677667,0.0011475561,0.02151412,0.00036635812,0.96129036,0.00018383261,0.014562142],"study_design_scores_gemma":[0.00068402995,0.00017817903,0.0046167653,0.00094647193,0.00008226161,0.000004404875,0.0032034344,0.93401927,0.00088443945,0.054102715,0.0008987453,0.0003792614],"about_ca_topic_score_codex":0.0004627526,"about_ca_topic_score_gemma":0.00029689557,"teacher_disagreement_score":0.91250515,"about_ca_system_score_codex":0.000026716074,"about_ca_system_score_gemma":0.000027759781,"threshold_uncertainty_score":0.42130637},"labels":[],"label_agreement":null},{"id":"W2019454467","doi":"10.1007/s00186-008-0243-8","title":"Black swans and white eagles: on mathematics and finance","year":2008,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Intertek (Canada)","funders":"","keywords":"Black swan theory; Mathematical finance; Parallels; Financial engineering; Financial market; Physical law; Finance; Point (geometry); Mathematical economics; Economics; Computer science; Mathematics; Epistemology; Statistics","score_opus":0.22805020146934502,"score_gpt":0.40947447952585053,"score_spread":0.18142427805650552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019454467","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65566784,0.0010295744,0.29281843,0.0017760803,0.00003177289,0.0006403385,0.00007675267,0.000022846853,0.047936376],"genre_scores_gemma":[0.374468,0.0005314087,0.61905634,0.000025391499,0.000032754928,0.000048763824,0.0000021750827,0.000022416567,0.005812734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852383,0.00010567536,0.0006947398,0.000320591,0.000110847635,0.00024433577],"domain_scores_gemma":[0.998665,0.000623242,0.000065762266,0.0004441936,0.00013058947,0.00007121171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025996214,0.00011976396,0.0005553591,0.00033244412,0.00030916027,0.00007712504,0.00015967489,0.00007478541,0.0004848331],"category_scores_gemma":[0.0011301786,0.000109269444,0.00006843852,0.00044730396,0.00053247594,0.000117030526,0.00013423836,0.00020245243,0.00014451062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045413617,0.00018459483,0.0003776412,0.00017334604,0.000046991638,0.0000023650964,0.0029465356,0.00025372396,0.00009820102,0.99492407,0.00022633502,0.00076165836],"study_design_scores_gemma":[0.0006415337,0.0004593157,0.0033674804,0.00019742588,0.000017290398,0.000059061425,0.0023584717,0.573192,0.00059995893,0.41152725,0.007144322,0.00043586516],"about_ca_topic_score_codex":0.00006481257,"about_ca_topic_score_gemma":0.00001580832,"teacher_disagreement_score":0.5833968,"about_ca_system_score_codex":0.000023698578,"about_ca_system_score_gemma":0.000019006164,"threshold_uncertainty_score":0.5308582},"labels":[],"label_agreement":null},{"id":"W2019780010","doi":"10.1007/s00186-013-0431-z","title":"Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cutting-plane method; Mathematical optimization; Relaxation (psychology); Set (abstract data type); Conic section; Cluster analysis; Constraint (computer-aided design); Computer science; Point (geometry); Plane (geometry); Interior point method; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Integer programming; Geometry","score_opus":0.1633956873692615,"score_gpt":0.5237032706965733,"score_spread":0.36030758332731183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019780010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004970145,0.000021639433,0.9877483,0.001417088,0.00003810756,0.004343608,0.00004126554,0.000035612873,0.0013842048],"genre_scores_gemma":[0.01202881,0.000009827105,0.98469526,0.000014793347,0.000025915542,0.0017692735,0.0000066164534,0.000052251897,0.001397261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454767,0.0021365539,0.0014345502,0.00041123744,0.0008539581,0.0006160396],"domain_scores_gemma":[0.98603046,0.01064777,0.00019633013,0.00056904997,0.002428026,0.00012836719],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011845991,0.00020544368,0.00060533575,0.0006098182,0.00036269648,0.00012416464,0.00060830114,0.00017979782,0.0010615212],"category_scores_gemma":[0.032355573,0.00015034253,0.00015105856,0.0016470642,0.00047508552,0.00036850234,0.00036085263,0.0007718619,0.000012593662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006964518,0.0008139088,0.00010196839,0.0023073845,0.00015742957,6.131833e-7,0.0074758525,0.015835842,0.19868015,0.747321,0.0014068176,0.025829364],"study_design_scores_gemma":[0.0005475807,0.00014278943,0.000024900215,0.00031266984,0.000015825539,0.000015979249,0.0022961495,0.5869949,0.05987005,0.34959435,0.000056512523,0.0001283258],"about_ca_topic_score_codex":0.00015580069,"about_ca_topic_score_gemma":0.00011756695,"teacher_disagreement_score":0.571159,"about_ca_system_score_codex":0.00023028608,"about_ca_system_score_gemma":0.00037413635,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W2024490033","doi":"10.1007/s001860300295","title":"One-armed bandit models with continuous and delayed responses","year":2003,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Manitoba","funders":"","keywords":"Multi-armed bandit; Monotonic function; Markov decision process; Sequence (biology); Optimal stopping; Markov process; Mathematical optimization; Limit (mathematics); Index (typography); Bayesian probability; Markov chain; Mathematics; Time horizon; Computer science; Statistics","score_opus":0.5018446804662678,"score_gpt":0.6032521031918505,"score_spread":0.10140742272558267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024490033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055256747,0.00024632568,0.9353731,0.0006675868,0.000019765937,0.0008693182,0.000022338982,0.000023704764,0.0075210594],"genre_scores_gemma":[0.22190814,0.000035775924,0.7734496,0.000017009443,0.000016397624,0.00016233958,0.0000012115138,0.000025577168,0.004383924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874809,0.0065718335,0.00097413757,0.00070565584,0.0035805367,0.00068695983],"domain_scores_gemma":[0.96992165,0.025749264,0.0000644883,0.0011458349,0.0027489185,0.0003698447],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.031206377,0.0001797086,0.00066124357,0.0009237052,0.0005326594,0.00047843452,0.0007306165,0.00013084855,0.0010979556],"category_scores_gemma":[0.06461966,0.000120499084,0.00006847142,0.001976847,0.0014519482,0.0006188687,0.00026000856,0.00061220175,0.00008915829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001325283,0.0015959312,0.00012414872,0.00013421285,0.00025434053,0.000056804318,0.0051836893,0.015184848,0.025045501,0.8224453,0.0006926708,0.12795727],"study_design_scores_gemma":[0.0010228003,0.0009246806,0.00012653615,0.00006913255,0.000015822021,0.00006603368,0.0036671448,0.16374265,0.033454772,0.7958686,0.0007964245,0.00024544806],"about_ca_topic_score_codex":0.000022195545,"about_ca_topic_score_gemma":0.00003056109,"teacher_disagreement_score":0.16665138,"about_ca_system_score_codex":0.00005777715,"about_ca_system_score_gemma":0.0004034227,"threshold_uncertainty_score":0.99981517},"labels":[],"label_agreement":null},{"id":"W2028962211","doi":"10.1007/s00186-013-0455-4","title":"Fitting concentric circles to measurements","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Ottawa Mental Health Centre; Royal Military College of Canada","funders":"","keywords":"Concentric; Mathematics; Generalization; Least-squares function approximation; Combinatorics; Set (abstract data type); Geometry; Mathematical analysis; Statistics; Computer science","score_opus":0.22405597736353874,"score_gpt":0.5157598582568775,"score_spread":0.29170388089333876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028962211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033747677,0.000076701006,0.9593633,0.0002988765,0.000013537273,0.000589205,0.0000013806434,0.000146348,0.0057629645],"genre_scores_gemma":[0.28530443,0.0000067836986,0.71424294,0.000017804437,0.000016225487,0.00027952882,8.1186664e-7,0.000017930062,0.00011358775],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821174,0.00034982362,0.00042500196,0.0001642484,0.00051637,0.0003328222],"domain_scores_gemma":[0.9982476,0.0007082451,0.000008702837,0.0003445889,0.00052520976,0.00016563998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018958292,0.000097565695,0.00027339254,0.00021916609,0.00010366553,0.000069240006,0.0002930038,0.000051990475,0.00083367137],"category_scores_gemma":[0.0032043993,0.00008307542,0.000056297315,0.0010478066,0.00008714492,0.00016697952,0.00010694409,0.0002274245,0.00033536277],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022330905,0.00017336047,0.00009278758,0.00024606424,0.00009449306,7.6638145e-7,0.0005725011,0.024809675,0.7418894,0.009667801,0.0015764331,0.22087444],"study_design_scores_gemma":[0.000120680095,0.000091358845,0.00027022063,0.000120235694,0.000014430736,0.0000021061212,0.00030175297,0.38864622,0.5645052,0.04509927,0.00059731596,0.00023117989],"about_ca_topic_score_codex":0.000022050604,"about_ca_topic_score_gemma":0.00000154708,"teacher_disagreement_score":0.36383656,"about_ca_system_score_codex":0.00008133584,"about_ca_system_score_gemma":0.000014142828,"threshold_uncertainty_score":0.9128117},"labels":[],"label_agreement":null},{"id":"W2039023026","doi":"10.1007/s001860000072","title":"The bounce algorithm for mathematical programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Ball (mathematics); Point (geometry); Mathematical optimization; Interior point method; Computer science; Set (abstract data type); Rest (music); Mathematics; Algorithm; Geometry; Physics","score_opus":0.22175211753221646,"score_gpt":0.538634412973693,"score_spread":0.3168822954414765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039023026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004236046,0.00012221329,0.9914227,0.0028972318,0.000047503603,0.0011542132,0.0000028223433,0.00006708137,0.003862615],"genre_scores_gemma":[0.0010045549,0.000025448404,0.9944429,0.000027589358,0.0000643086,0.000763643,7.0993684e-7,0.000015930276,0.003654959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660605,0.0008806403,0.00070017023,0.0003614969,0.00083107996,0.00062053977],"domain_scores_gemma":[0.9899371,0.008157732,0.00002671406,0.0009991534,0.0007423519,0.00013691226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011477955,0.00013144151,0.0002670721,0.0001045238,0.0009974337,0.00069813925,0.0017253872,0.000087062224,0.00029923115],"category_scores_gemma":[0.004599907,0.00008405007,0.00012780908,0.0007542029,0.00075703353,0.00032966604,0.00023574116,0.00031377547,0.00026241905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021517521,0.00010595331,1.3216948e-7,0.000020564908,0.0000094870875,4.7323024e-7,0.00053019915,0.000065133696,0.00025631898,0.4136654,0.0001010102,0.58524317],"study_design_scores_gemma":[0.0000351112,0.00010953958,7.486399e-7,0.000031578245,0.0000031439286,0.000008170295,0.00021264316,0.6072137,0.013086743,0.37022632,0.009002564,0.00006974938],"about_ca_topic_score_codex":0.00000899914,"about_ca_topic_score_gemma":0.0000046038203,"teacher_disagreement_score":0.6071486,"about_ca_system_score_codex":0.000046488945,"about_ca_system_score_gemma":0.00016082048,"threshold_uncertainty_score":0.7671554},"labels":[],"label_agreement":null},{"id":"W2053009572","doi":"10.1007/s00186-010-0331-4","title":"On generalized balanced optimization problems","year":2010,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bottleneck; Mathematical optimization; Mathematics; Time complexity; Polynomial; Optimization problem; Computational complexity theory; Computer science; Algorithm","score_opus":0.10040407256373958,"score_gpt":0.46222535305356693,"score_spread":0.36182128048982737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053009572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032864935,0.0000042787815,0.9855482,0.0016534668,0.00013722837,0.00047137236,0.0000019872482,0.00007734539,0.008819612],"genre_scores_gemma":[0.043908417,0.000008006991,0.95547587,0.000059825412,0.000023862185,0.000102549384,0.0000044746894,0.00000982783,0.00040718928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978953,0.0006549955,0.0003873573,0.00029314324,0.0005305016,0.0002386993],"domain_scores_gemma":[0.9976879,0.0009228335,0.000031720807,0.00064527354,0.0005973648,0.000114931536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032452256,0.00009945183,0.0001912104,0.0003404432,0.00025374134,0.0002171385,0.0004975999,0.000100777776,0.0010944655],"category_scores_gemma":[0.0027267102,0.00008196241,0.0000539362,0.00081310264,0.00016934038,0.00031763085,0.0001297804,0.0004239603,0.000056689212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003193802,0.00012232648,0.000004264827,0.000020312073,0.0000070444676,3.5708183e-7,0.00023104927,0.18319634,0.02235978,0.7771891,0.0000801869,0.016786078],"study_design_scores_gemma":[0.00025260053,0.000073202325,0.00003330322,0.000019369394,0.0000018776109,0.000006417657,0.000014957248,0.946156,0.010867008,0.04238769,0.000103607286,0.000083939485],"about_ca_topic_score_codex":0.00000832378,"about_ca_topic_score_gemma":0.000010666474,"teacher_disagreement_score":0.76295966,"about_ca_system_score_codex":0.000022264703,"about_ca_system_score_gemma":0.00011944547,"threshold_uncertainty_score":0.9998187},"labels":[],"label_agreement":null},{"id":"W2060702903","doi":"10.1007/s00186-010-0318-1","title":"Continuous review inventory models for perishable items ordered in batches","year":2010,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Perishability; Heuristics; Poisson distribution; Inventory control; Lost sales; Computer science; Mathematical optimization; Heuristic; Food spoilage; Lead time; Holding cost; Operations research; Mathematics; Operations management; Statistics; Economics","score_opus":0.2136188641859939,"score_gpt":0.4628448770691848,"score_spread":0.2492260128831909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060702903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075745344,0.004744263,0.543364,0.021720657,0.0011627424,0.016136535,0.000023291923,0.0002726333,0.33683053],"genre_scores_gemma":[0.14706774,0.0005192541,0.8344553,0.0025570076,0.0009755644,0.004497913,0.00008122922,0.00014039449,0.009705595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804723,0.00015762454,0.0006382955,0.00030481216,0.00044916422,0.00040288692],"domain_scores_gemma":[0.99827564,0.0004998911,0.0000540163,0.00049861986,0.0006432608,0.000028564282],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009817592,0.00014233944,0.00044250867,0.00047101715,0.00018385798,0.00021130867,0.0004794423,0.00008612725,0.0014026231],"category_scores_gemma":[0.004588044,0.00012100848,0.000111185036,0.0007510273,0.00019312059,0.000718426,0.00026158715,0.0003616778,0.00007403288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026210197,0.00069984596,0.00013872105,0.008140926,0.000036563917,0.00000221895,0.00024496237,0.00042676186,0.0053398246,0.9519733,0.01974181,0.013228863],"study_design_scores_gemma":[0.0006754577,0.000038265625,0.000034362354,0.0009536531,0.000035148892,0.0000011162051,0.00084224064,0.68054897,0.0005922985,0.22655675,0.089463785,0.00025798942],"about_ca_topic_score_codex":0.00021305558,"about_ca_topic_score_gemma":0.00017283528,"teacher_disagreement_score":0.72541654,"about_ca_system_score_codex":0.000021385715,"about_ca_system_score_gemma":0.00005337948,"threshold_uncertainty_score":0.9995102},"labels":[],"label_agreement":null},{"id":"W2067468128","doi":"10.1007/s00186-006-0139-4","title":"Correction on “Optimal portfolio selection when stock prices follow an jump-diffusion process”","year":2007,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Jump diffusion; Portfolio; Jump; Selection (genetic algorithm); Stock (firearms); Computer science; Stock price; Econometrics; Mathematical optimization; Mathematics; Financial economics; Economics; Artificial intelligence; Series (stratigraphy); Physics; Biology","score_opus":0.15319886849954578,"score_gpt":0.45074712606408956,"score_spread":0.2975482575645438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067468128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06780585,0.000073794006,0.91444206,0.00019625117,0.00014119103,0.0006600801,0.000014831146,0.000048070993,0.016617894],"genre_scores_gemma":[0.36826485,0.0000098329865,0.6299131,0.000038766648,0.00017142475,0.00027159363,0.000016641481,0.000033843302,0.0012799824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997997,0.00004654376,0.00084714574,0.00048298278,0.00021349355,0.0004128306],"domain_scores_gemma":[0.998247,0.00061458116,0.00013087483,0.00036246455,0.00048709998,0.00015793741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005552017,0.00014990379,0.0003767783,0.000677641,0.00050151884,0.00010842239,0.0003178875,0.00017299136,0.0004977881],"category_scores_gemma":[0.0026525664,0.00014872634,0.000082251114,0.0011072739,0.00013603416,0.00031440562,0.000059418548,0.00041741118,0.00016950397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007338581,0.0009288446,0.00014967381,0.0000780413,0.00001929054,6.7400515e-7,0.0012005733,0.00059824437,0.0012824578,0.97868013,0.0001882137,0.016800454],"study_design_scores_gemma":[0.00041723906,0.0009903482,0.0024395515,0.00007361032,0.000011360423,0.000015221643,0.00070504454,0.2684389,0.0077630877,0.7175567,0.0012975886,0.00029131863],"about_ca_topic_score_codex":0.00015363442,"about_ca_topic_score_gemma":0.000053027812,"teacher_disagreement_score":0.300459,"about_ca_system_score_codex":0.000118873984,"about_ca_system_score_gemma":0.0000847759,"threshold_uncertainty_score":0.6064884},"labels":[],"label_agreement":null},{"id":"W2077707094","doi":"10.1007/s00186-015-0493-1","title":"Downside loss aversion: Winner or loser?","year":2015,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"CVAR; Downside risk; Expected shortfall; Portfolio; Asset allocation; Econometrics; Stochastic dominance; Asset (computer security); Economics; Risk aversion (psychology); Loss aversion; Expected utility hypothesis; Computer science; Microeconomics; Financial economics","score_opus":0.42814107962595993,"score_gpt":0.4699745742157992,"score_spread":0.04183349458983926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077707094","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1268154,0.0011120384,0.2646112,0.0071563395,0.00043933283,0.0012215753,0.00010428638,0.000072802606,0.598467],"genre_scores_gemma":[0.20880713,0.00010370886,0.776429,0.00016041762,0.00014509614,0.00011573844,0.000008481948,0.00003264991,0.01419777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825585,0.00025817193,0.0006871802,0.0002973793,0.00016088824,0.00034053097],"domain_scores_gemma":[0.9984602,0.0005273357,0.00005166028,0.0004743251,0.00030452915,0.0001819597],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0065116654,0.00011747228,0.0004294166,0.000315271,0.00016757558,0.00013067387,0.00033596202,0.00011060271,0.0025434166],"category_scores_gemma":[0.005240913,0.00009312325,0.000076639546,0.000610626,0.00037315715,0.00033991857,0.00017402737,0.00025117878,0.0009402634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042652504,0.00020099444,0.00014196525,0.00007261984,0.00002069802,0.000006091594,0.00055411836,0.00010534266,0.00009486505,0.99389666,0.00404226,0.0008217501],"study_design_scores_gemma":[0.0006140322,0.00043658627,0.00042505356,0.000060250935,0.000004919682,0.000012779898,0.00096212566,0.017065002,0.0019890573,0.9403837,0.03781891,0.00022760296],"about_ca_topic_score_codex":0.000115321505,"about_ca_topic_score_gemma":0.000012908238,"teacher_disagreement_score":0.5842692,"about_ca_system_score_codex":0.00008294204,"about_ca_system_score_gemma":0.00014939491,"threshold_uncertainty_score":0.99983764},"labels":[],"label_agreement":null},{"id":"W2079676062","doi":"10.1007/s001860100116","title":"Dynamic order replenishment policy in internet-based supply chains","year":2001,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Erlang (programming language); Reorder point; Lead time; Markov decision process; Computer science; Holding cost; Supply chain; Mathematical optimization; Operations research; Inventory control; Poisson distribution; Exponential distribution; Markov chain; Erlang distribution; Newsvendor model; Markov process; Economic order quantity; Operations management; Mathematics; Business; Economics","score_opus":0.11476897579724302,"score_gpt":0.455007958257407,"score_spread":0.34023898246016393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079676062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1839433,0.0001267245,0.6487009,0.029712494,0.00020777262,0.0026209753,0.000004380452,0.00015298283,0.1345305],"genre_scores_gemma":[0.70430136,0.000023595432,0.28567788,0.0011979211,0.00019582156,0.0004628251,0.000036544152,0.000051924453,0.008052146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760985,0.00026611975,0.0006161339,0.0003577454,0.0006429503,0.0005072176],"domain_scores_gemma":[0.9986274,0.00035839766,0.000044097636,0.00056029094,0.00037779092,0.00003198318],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0053068707,0.0001652536,0.00031371898,0.0015505652,0.00013096548,0.00027068044,0.00050981774,0.00007638472,0.0031635023],"category_scores_gemma":[0.0030308596,0.00014314838,0.000081602,0.0022342063,0.00021486201,0.00040430954,0.00036649848,0.00030136082,0.00029544026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089095585,0.0016151113,0.0016945412,0.00076847215,0.000045485478,0.000029637507,0.0004060626,0.00328411,0.0020689236,0.9538941,0.0024531712,0.03365133],"study_design_scores_gemma":[0.000740746,0.000050091545,0.0009564624,0.00018272406,0.0000107457945,0.0000016845394,0.0007352934,0.94941455,0.00043597195,0.025377113,0.021898767,0.00019584036],"about_ca_topic_score_codex":0.0011701246,"about_ca_topic_score_gemma":0.00037632883,"teacher_disagreement_score":0.94613045,"about_ca_system_score_codex":0.00017562036,"about_ca_system_score_gemma":0.0000912933,"threshold_uncertainty_score":0.9977477},"labels":[],"label_agreement":null},{"id":"W2081102656","doi":"10.1007/s00186-013-0432-y","title":"Accelerated modified policy iteration algorithms for Markov decision processes","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov decision process; Convergence (economics); Markov chain; Operator (biology); Mathematical optimization; Computer science; Markov process; Algorithm; Markov model; Partially observable Markov decision process; Mathematics; Machine learning; Statistics","score_opus":0.2714919902690478,"score_gpt":0.5351392337457531,"score_spread":0.2636472434767053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081102656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014791632,0.000025748588,0.9927419,0.001796239,0.000052774907,0.0016468198,0.0000023069788,0.0000715109,0.002183577],"genre_scores_gemma":[0.037627295,0.000015015855,0.95979697,0.000056565084,0.000070086295,0.0007448823,0.000008815873,0.000018634812,0.0016617294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712586,0.0005769469,0.00067787257,0.00037550673,0.00078388804,0.0004598962],"domain_scores_gemma":[0.9920178,0.0041485275,0.000054266446,0.00073254615,0.0028973897,0.00014946715],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0038549218,0.0001494421,0.0002891806,0.00058721454,0.0004163149,0.00096454273,0.0009913023,0.00011873237,0.00014851733],"category_scores_gemma":[0.016072698,0.00011818085,0.00006259329,0.0017486213,0.00013839558,0.0010838667,0.00037060236,0.00025756643,0.00009018952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017232156,0.0003090999,0.000005713352,0.0005840243,0.000049197868,6.835875e-7,0.0017689595,0.25402,0.015944267,0.48225287,0.0011529389,0.243895],"study_design_scores_gemma":[0.00027037752,0.00019787096,0.00003067011,0.00007225565,0.0000030672943,0.000003448513,0.00005790544,0.92052853,0.014937962,0.06361915,0.00016644322,0.00011231133],"about_ca_topic_score_codex":0.000043680604,"about_ca_topic_score_gemma":0.0000014491599,"teacher_disagreement_score":0.66650856,"about_ca_system_score_codex":0.000082107465,"about_ca_system_score_gemma":0.00046786544,"threshold_uncertainty_score":0.99221534},"labels":[],"label_agreement":null},{"id":"W2090320702","doi":"10.1007/s001860200266","title":"A transfer/clearing inventory model under sporadic review","year":2003,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Clearing; Computer science; Transfer (computing); Sensitivity (control systems); Operations research; Set (abstract data type); Mathematical optimization; Holding cost; Function (biology); Process (computing); Production (economics); Inventory control; Microeconomics; Mathematics; Economics","score_opus":0.2987104621699893,"score_gpt":0.46374307381693897,"score_spread":0.16503261164694966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090320702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027072271,0.002834867,0.7072404,0.0048406413,0.00013834998,0.002112359,0.0000019173608,0.000121973426,0.2556372],"genre_scores_gemma":[0.47132903,0.00091109844,0.5066048,0.009274403,0.0003688192,0.0008877613,0.000023911318,0.0001848145,0.010415369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977258,0.00032427604,0.00055728975,0.00030221036,0.0006976096,0.0003927997],"domain_scores_gemma":[0.9988255,0.00022937622,0.0000238247,0.0005172787,0.00036582895,0.000038228893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008641218,0.00015457149,0.00036704986,0.0004389473,0.0002625341,0.00014752895,0.00037534774,0.000062536266,0.0027347598],"category_scores_gemma":[0.0021477772,0.00013204633,0.00013519949,0.00092186296,0.00020564624,0.00051185285,0.00013009732,0.00031202624,0.00027367502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041950893,0.00023411193,0.000013078988,0.0027834096,0.000028510909,0.0000015380749,0.00005447531,0.004609289,0.0012755747,0.9875473,0.00208379,0.0013647643],"study_design_scores_gemma":[0.00051117426,0.000028952129,0.000018244476,0.0014227275,0.000097587275,0.000002954853,0.000844281,0.6898206,0.0011593278,0.27927932,0.026484752,0.00033011872],"about_ca_topic_score_codex":0.000041877527,"about_ca_topic_score_gemma":0.0000086909395,"teacher_disagreement_score":0.7082679,"about_ca_system_score_codex":0.000055845787,"about_ca_system_score_gemma":0.00006743349,"threshold_uncertainty_score":0.9981769},"labels":[],"label_agreement":null},{"id":"W2093517648","doi":"10.1007/s001860400411","title":"Scheduling Stochastic jobs on a repairable machine with general phase type uptime","year":2005,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exponential distribution; Erlang (programming language); Erlang distribution; Scheduling (production processes); Mathematical optimization; Permutation (music); Phase-type distribution; Exponential function; Mathematics; Statistics; Theoretical computer science","score_opus":0.10467536501262836,"score_gpt":0.46319898868527754,"score_spread":0.35852362367264917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093517648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043074057,0.000168683,0.9529735,0.00026494815,0.00003968541,0.00032025855,0.000007212224,0.0001626778,0.0029889906],"genre_scores_gemma":[0.06653847,0.000010401132,0.9324715,0.000024583747,0.00010535859,0.00005776908,0.000010673453,0.000045677963,0.00073553866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834764,0.00026858487,0.00037015643,0.00021308662,0.00047029072,0.00033021302],"domain_scores_gemma":[0.9984844,0.0005636219,0.000012867367,0.00041231935,0.00037677615,0.00015002329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082833,0.00014731332,0.00027158947,0.000297358,0.00017977128,0.000087354,0.00019769516,0.000082924336,0.0007514588],"category_scores_gemma":[0.0012386042,0.000114578375,0.000042392563,0.00072059437,0.00011127027,0.00012645901,0.00003626501,0.00044880988,0.0001599444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004107288,0.00025829763,5.2414293e-7,0.000049596423,0.0000424544,0.0000015240987,0.0002524565,0.9745656,0.003310238,0.011424535,0.00003664748,0.010017028],"study_design_scores_gemma":[0.0006132172,0.0003114448,0.0000012588413,0.00008683737,0.000013293905,0.0000110545125,0.0000667092,0.9877289,0.010444409,0.0005286428,0.00006624589,0.00012800848],"about_ca_topic_score_codex":0.0000059569766,"about_ca_topic_score_gemma":0.000003919166,"teacher_disagreement_score":0.023464411,"about_ca_system_score_codex":0.000069113994,"about_ca_system_score_gemma":0.00005793982,"threshold_uncertainty_score":0.8227947},"labels":[],"label_agreement":null},{"id":"W2094779358","doi":"10.1007/s001860400369","title":"Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time","year":2004,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lead time; Markov decision process; Profit maximization; Inventory control; Operations research; Computer science; Profit (economics); Mathematical optimization; Maximization; Erlang (programming language); Supply chain; Poisson process; Poisson distribution; Markov chain; Optimal control; Service level; Holding cost; Markov process; Operations management; Business; Microeconomics; Economics; Mathematics","score_opus":0.09918178702663151,"score_gpt":0.39486915156172325,"score_spread":0.29568736453509176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094779358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34107432,0.000039306113,0.65249085,0.0028743474,0.000016877955,0.0019386013,0.0000070293345,0.00003678933,0.0015218607],"genre_scores_gemma":[0.6563951,0.0000042788784,0.34112608,0.0006296663,0.00005938233,0.0011697215,0.00010235571,0.000046068257,0.0004673833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857306,0.00011408293,0.00036150578,0.0002985436,0.00035791128,0.0002949158],"domain_scores_gemma":[0.9988963,0.00018938258,0.00004141627,0.0002599397,0.00059084897,0.000022140039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031173867,0.00014284419,0.00026593922,0.0004493902,0.00019134051,0.00029477413,0.00021122783,0.00006510203,0.00013340147],"category_scores_gemma":[0.00040748165,0.00011593172,0.000024741856,0.0009299643,0.00012765106,0.0008129761,0.00017013925,0.00015764985,0.000054554508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005098955,0.000918945,0.00044124617,0.014380325,0.00016464228,0.000006572092,0.00459011,0.32480788,0.010302277,0.63860065,0.00013269772,0.0051447228],"study_design_scores_gemma":[0.0011607679,0.000058865884,0.00031798836,0.00024137257,0.000028265425,0.0000013395714,0.002942956,0.88244176,0.00009752978,0.11248342,0.000065018554,0.00016071601],"about_ca_topic_score_codex":0.00028365516,"about_ca_topic_score_gemma":0.0010147726,"teacher_disagreement_score":0.5576339,"about_ca_system_score_codex":0.00008114478,"about_ca_system_score_gemma":0.00009713738,"threshold_uncertainty_score":0.47275585},"labels":[],"label_agreement":null},{"id":"W2133185406","doi":"10.1007/s00186-015-0516-y","title":"Extensions of the sequential stochastic assignment problem","year":2015,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"Air Force Office of Scientific Research","keywords":"Mathematical optimization; Extension (predicate logic); Computer science; Assignment problem; Generalized assignment problem; Mathematics","score_opus":0.26806749435509003,"score_gpt":0.48368437789569024,"score_spread":0.2156168835406002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133185406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002409645,0.000057502315,0.98783094,0.0002805741,0.00006634943,0.0006535706,0.0000040642703,0.00004596592,0.008651414],"genre_scores_gemma":[0.27404693,0.0000019180259,0.7255207,0.000005014729,0.000015389536,0.00008954148,0.0000010607921,0.000018918863,0.00030056734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980637,0.00047355695,0.00049159396,0.00011290443,0.0006230111,0.000235255],"domain_scores_gemma":[0.9983378,0.0005984391,0.000018916708,0.00040210536,0.00050079427,0.00014191263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003205326,0.00009310263,0.00024337247,0.0001174489,0.00009433584,0.00003882975,0.00028402306,0.00006835101,0.00018674869],"category_scores_gemma":[0.0025954312,0.00006057669,0.0000730741,0.0005370527,0.000283706,0.00008120363,0.00016330977,0.00025849004,0.00002443907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063366856,0.00036391744,0.0000013959203,0.00044297153,0.00006207035,5.219568e-7,0.0018589356,0.6200394,0.023440855,0.34592706,0.00071628817,0.007140208],"study_design_scores_gemma":[0.00023317909,0.00006446439,0.0000025766824,0.00014576972,0.000022362658,0.0000063180833,0.0006664865,0.90633994,0.01999123,0.072289854,0.00015001501,0.00008780635],"about_ca_topic_score_codex":0.000004477867,"about_ca_topic_score_gemma":0.000001999291,"teacher_disagreement_score":0.2863005,"about_ca_system_score_codex":0.00005484819,"about_ca_system_score_gemma":0.00009337642,"threshold_uncertainty_score":0.31071612},"labels":[],"label_agreement":null},{"id":"W2139139599","doi":"10.1007/s00186-013-0446-5","title":"Transshipment games with identical newsvendors and cooperation costs","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transshipment (information security); Clique; Core (optical fiber); Computer science; Mathematical economics; Network topology; Game theory; Set (abstract data type); Mathematical optimization; Cooperative game theory; Limit (mathematics); Microeconomics; Operations research; Economics; Mathematics; Computer network; Combinatorics; Computer security","score_opus":0.10313711076416801,"score_gpt":0.4079427460139822,"score_spread":0.3048056352498142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139139599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44001547,0.0001387396,0.47948155,0.013009599,0.00010172042,0.003205923,0.0000019825893,0.00010264291,0.06394237],"genre_scores_gemma":[0.786009,0.000017435486,0.21128297,0.0003925554,0.0002136868,0.0005574554,0.000011870722,0.000032557964,0.0014824728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998304,0.0001807197,0.00040495748,0.0002665072,0.0005370227,0.00030678278],"domain_scores_gemma":[0.9988174,0.00031603128,0.000027270224,0.00027795535,0.00052096386,0.00004040282],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002560372,0.00013432124,0.0002428984,0.0003603859,0.00025578254,0.00062852155,0.00020543799,0.00005101998,0.002561701],"category_scores_gemma":[0.0007223873,0.000095648735,0.000035691046,0.0005280927,0.00033088386,0.00090058654,0.00015199349,0.0001923012,0.0002645527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028877412,0.00033477214,0.0003659085,0.0005526952,0.000065105596,0.0000032510613,0.0002980741,0.00020223905,0.006737273,0.9439051,0.0020110023,0.045495704],"study_design_scores_gemma":[0.0036045266,0.00048249794,0.006630892,0.00081960123,0.0002120547,0.00002050816,0.010866471,0.8112593,0.01173561,0.12715358,0.02611222,0.0011027346],"about_ca_topic_score_codex":0.0003143261,"about_ca_topic_score_gemma":0.00004778692,"teacher_disagreement_score":0.81675154,"about_ca_system_score_codex":0.00003781803,"about_ca_system_score_gemma":0.000024130755,"threshold_uncertainty_score":0.9983501},"labels":[],"label_agreement":null},{"id":"W2575679751","doi":"10.1007/s00186-017-0574-4","title":"A maximum principle for Markov regime-switching forward–backward stochastic differential games and applications","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Insurance, Mortality, Demography, Risk Management","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"Seventh Framework Programme; Alexander von Humboldt-Stiftung","keywords":"Maximum principle; Mathematics; Differential game; Stochastic differential equation; Markov chain; Corollary; Applied mathematics; Differential (mechanical device); Mathematical optimization; Principle of maximum entropy; Mathematical economics; Optimal control; Discrete mathematics","score_opus":0.13523819339582657,"score_gpt":0.5324272925989078,"score_spread":0.3971890992030812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575679751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023163963,0.000070083435,0.9605793,0.0017638211,0.00007505974,0.0031015112,0.000026337211,0.000037414073,0.011182509],"genre_scores_gemma":[0.51727325,0.000057412097,0.479188,0.000012746821,0.00019627408,0.0018248253,0.000004285081,0.000023733133,0.0014194649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698895,0.00083096506,0.00046441334,0.00041260847,0.0007681572,0.0005349272],"domain_scores_gemma":[0.9966565,0.001517489,0.00009709298,0.0009185579,0.00061214354,0.00019825438],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008407928,0.00014250992,0.0003690749,0.00028034745,0.003295451,0.00069327874,0.0008263689,0.00011637823,0.00013025329],"category_scores_gemma":[0.005315759,0.00012653388,0.00013327687,0.00022413567,0.0011187703,0.0003060701,0.0004114214,0.00027225312,0.000012388789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032297834,0.0002995205,0.00028113578,0.000357705,0.00009739025,5.249624e-7,0.0031051824,0.000046947684,0.00065305235,0.9094099,0.00012636566,0.08559003],"study_design_scores_gemma":[0.0013952568,0.0002467758,0.00976683,0.00027634727,0.00019255558,0.0000027357974,0.0062371627,0.05956447,0.00071012374,0.90642864,0.014578416,0.0006007146],"about_ca_topic_score_codex":0.00027819583,"about_ca_topic_score_gemma":0.00040099132,"teacher_disagreement_score":0.4941093,"about_ca_system_score_codex":0.000056946068,"about_ca_system_score_gemma":0.00013874633,"threshold_uncertainty_score":0.9980021},"labels":[],"label_agreement":null},{"id":"W2613233453","doi":"10.1007/s00186-017-0589-x","title":"Portfolio optimization for a large investor under partial information and price impact","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Utility maximization problem; Stochastic control; Portfolio; Mathematical optimization; Maximization; Complete information; Portfolio optimization; Optimal control; Computer science; Markov chain; Optimization problem; Utility maximization; Economics; Econometrics; Mathematical economics; Mathematics; Financial economics","score_opus":0.1889138845939967,"score_gpt":0.4734145068552124,"score_spread":0.28450062226121575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613233453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004529023,0.00011800899,0.9905186,0.00085258286,0.000031475683,0.0006988897,0.00017886351,0.000010355258,0.0030621688],"genre_scores_gemma":[0.22443283,0.0000358941,0.77481216,0.000039819723,0.000054829594,0.00048864493,0.000024650097,0.000012111023,0.000099084566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989449,0.000019478572,0.00054657506,0.00017354418,0.000069071255,0.00024644047],"domain_scores_gemma":[0.99871534,0.00029616253,0.00014975427,0.00042455885,0.00031797172,0.00009621633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031247206,0.00008240464,0.0002653179,0.00021168315,0.00072515797,0.00030766314,0.00025605303,0.00009113783,0.00019088665],"category_scores_gemma":[0.005340389,0.00007807273,0.0000592141,0.00015869757,0.00014244195,0.00066424365,0.0001283446,0.00011735858,0.00003105856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011589571,0.000082354054,0.0000702548,0.00008340371,0.000016112137,2.877908e-8,0.00022840979,0.0009210702,0.000033172993,0.9973948,0.00006229617,0.0010965238],"study_design_scores_gemma":[0.000360254,0.00009299356,0.0012102922,0.000018585712,0.000004557397,0.0000016469508,0.000081094106,0.47957718,0.00014963993,0.5173798,0.0010348791,0.000089068046],"about_ca_topic_score_codex":0.00008177448,"about_ca_topic_score_gemma":0.000003859457,"teacher_disagreement_score":0.48001498,"about_ca_system_score_codex":0.000043926248,"about_ca_system_score_gemma":0.000080851605,"threshold_uncertainty_score":0.639333},"labels":[],"label_agreement":null},{"id":"W2764314492","doi":"10.1007/s00186-017-0612-2","title":"An M/PH/K queue with constant impatient time","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Queueing theory; Constant (computer programming); Computer science; Server; Burke's theorem; Reduction (mathematics); Queueing system; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Queue management system; Computer network; Fork–join queue","score_opus":0.11633538334010268,"score_gpt":0.4869793571310019,"score_spread":0.3706439737908992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764314492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35780793,0.000022540731,0.55723447,0.0017661047,0.00003814103,0.0008702152,0.000008115939,0.000099365854,0.082153134],"genre_scores_gemma":[0.58287203,0.0000015693136,0.41607487,0.00006350204,0.00013775544,0.00007760022,0.000008527799,0.00003097002,0.0007331552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981945,0.0002705872,0.00036136442,0.00030002283,0.0005456888,0.00032782057],"domain_scores_gemma":[0.99713284,0.000492708,0.00010397433,0.0012927292,0.0009396438,0.00003811534],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0057558995,0.00013601319,0.0003474906,0.00032922896,0.0011039291,0.0007252552,0.0007677475,0.000057435424,0.0014340709],"category_scores_gemma":[0.004408055,0.00009618478,0.0000610999,0.0003233499,0.00075634907,0.0013886008,0.0002856155,0.00025351954,0.00033493852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009281606,0.00047676553,0.0001385259,0.00018278496,0.000074146476,0.000009605653,0.00015963933,0.003591541,0.02199087,0.9636135,0.00008599652,0.0095838],"study_design_scores_gemma":[0.00050130504,0.00013930458,0.00016752396,0.00020590387,0.00008617222,0.000004631433,0.000671622,0.6914085,0.007280889,0.29843003,0.00081557984,0.00028854937],"about_ca_topic_score_codex":0.00012806949,"about_ca_topic_score_gemma":0.00004537192,"teacher_disagreement_score":0.687817,"about_ca_system_score_codex":0.000031874206,"about_ca_system_score_gemma":0.000054613196,"threshold_uncertainty_score":0.99947876},"labels":[],"label_agreement":null},{"id":"W3129799581","doi":"10.1007/s00186-022-00772-2","title":"Portfolio optimization: not necessarily concave utility and constraints on wealth and allocation","year":2022,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Technische Universität München","keywords":"Portfolio; Mathematical optimization; Expected utility hypothesis; Terminal (telecommunication); Portfolio optimization; Portfolio allocation; Regular polygon; Legendre transformation; Transformation (genetics); Convex optimization; Mathematics; Computer science; Mathematical economics; Economics; Financial economics","score_opus":0.17448148640032002,"score_gpt":0.4240910821767344,"score_spread":0.2496095957764144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129799581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004682404,0.00025425234,0.9785409,0.002086914,0.000030877338,0.0005487852,0.0001580255,0.000013286858,0.013684576],"genre_scores_gemma":[0.6550658,0.000052538457,0.34425628,0.00012412002,0.000020632138,0.0003279018,0.000014149003,0.000010881702,0.00012770496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867207,0.00009902264,0.0005553131,0.00035075826,0.00012563508,0.00019719459],"domain_scores_gemma":[0.9987132,0.00067797164,0.000078612546,0.00027681785,0.00015704197,0.00009636633],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038707373,0.00008770267,0.0002980093,0.0002365008,0.000593418,0.000069317895,0.00016334665,0.00005103411,0.001239373],"category_scores_gemma":[0.0015246037,0.00009575739,0.000026954598,0.0004695726,0.00045816568,0.000090270674,0.0001928444,0.00028366214,0.000014392368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014716489,0.00015646806,0.000035034784,0.000057536345,0.0000111971285,3.1458313e-7,0.00038973225,0.0011508007,0.000048134094,0.99019784,0.000040183342,0.007898047],"study_design_scores_gemma":[0.00044229307,0.00029740715,0.0013305814,0.000016581005,0.0000067507335,0.000016023847,0.0008600107,0.46183118,0.00022608458,0.5339662,0.0008415017,0.00016539556],"about_ca_topic_score_codex":0.00006250318,"about_ca_topic_score_gemma":0.0000022997478,"teacher_disagreement_score":0.65038335,"about_ca_system_score_codex":0.000046038407,"about_ca_system_score_gemma":0.00007741207,"threshold_uncertainty_score":0.9996736},"labels":[],"label_agreement":null},{"id":"W4289780624","doi":"10.1007/s00186-022-00794-w","title":"Minimizing the penalized probability of drawdown for a general insurance company under ambiguity aversion","year":2022,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; University of Waterloo","funders":"Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology; National Natural Science Foundation of China","keywords":"Reinsurance; Ambiguity aversion; Ambiguity; Bellman equation; Risk aversion (psychology); Drawdown (hydrology); Mathematical optimization; Stochastic control; Mathematics; Mathematical economics; Probability density function; Function (biology); Value (mathematics); Distortion (music); Investment strategy; Expected utility hypothesis; Economics; Computer science; Actuarial science; Optimal control; Microeconomics; Statistics","score_opus":0.27297611201445793,"score_gpt":0.44148522528019535,"score_spread":0.16850911326573742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289780624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5604341,0.00031653736,0.43032226,0.0016746074,0.000108121654,0.0017122637,0.00023902617,0.000010080381,0.005183019],"genre_scores_gemma":[0.6940028,0.000025043364,0.30456656,0.000055914905,0.000025126652,0.00062992016,0.000007673977,0.000012363314,0.00067458494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791026,0.0004981311,0.0008287547,0.00028751075,0.00019074498,0.00028458537],"domain_scores_gemma":[0.9982499,0.00084453,0.00012312796,0.0005199141,0.00022599669,0.000036521047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011393689,0.00009179958,0.00044961387,0.0001930536,0.0007084566,0.000043554537,0.0005065615,0.000039317627,0.0005088378],"category_scores_gemma":[0.0014611585,0.00007814056,0.0001707303,0.00054609444,0.00029443076,0.000100640726,0.0003477982,0.0002705935,0.00001299519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008152308,0.00043918545,0.00047090623,0.00021815929,0.000035342295,1.8804376e-7,0.0012328652,0.004104829,0.0008336261,0.9903753,0.00026171724,0.0019463548],"study_design_scores_gemma":[0.00089363905,0.0003293825,0.008030344,0.000023962897,0.000008497405,0.000001350549,0.001047325,0.105531074,0.0023685375,0.87673557,0.0048685023,0.00016182737],"about_ca_topic_score_codex":0.0002104695,"about_ca_topic_score_gemma":0.000013730014,"teacher_disagreement_score":0.13356873,"about_ca_system_score_codex":0.00011590817,"about_ca_system_score_gemma":0.000060139177,"threshold_uncertainty_score":0.5571417},"labels":[],"label_agreement":null},{"id":"W4396215930","doi":"10.1007/s00186-024-00856-1","title":"Column generation based solution for bi-objective gate assignment problems","year":2024,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Column generation; Robustness (evolution); Mathematical optimization; Column (typography); Computer science; Heuristic; Multi-objective optimization; Solution set; Set (abstract data type); Algorithm; Mathematics","score_opus":0.1762174108771726,"score_gpt":0.4503761619334017,"score_spread":0.2741587510562291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396215930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000529448,0.00018202765,0.99364024,0.000504969,0.00013871117,0.0014563001,0.000013799203,0.00017481226,0.0033596652],"genre_scores_gemma":[0.1160942,0.000028726638,0.88175946,0.000008578754,0.000102077036,0.0010837797,0.0000627594,0.000036985824,0.00082343636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986273,0.00025511737,0.00034097047,0.00020262811,0.0003320651,0.00024188627],"domain_scores_gemma":[0.9989453,0.0005620447,0.0000075316466,0.00018748967,0.00024559957,0.000052047704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031399974,0.00010291446,0.0001607508,0.00032344818,0.00017594639,0.00019533573,0.000111957066,0.000079505546,0.00024117409],"category_scores_gemma":[0.0003842253,0.000092858594,0.00006512727,0.0005227521,0.00007117391,0.00018901355,0.000027536156,0.00015529222,0.00002623817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004383984,0.000078878096,3.6314182e-7,0.0009974723,0.000057047422,3.598455e-7,0.00042057212,0.89518696,0.02496127,0.05219734,0.003215809,0.022879526],"study_design_scores_gemma":[0.00014671052,0.000103718514,0.0000021621806,0.000106502084,0.000022552871,3.5378594e-7,0.00006329702,0.9793274,0.015348183,0.00333919,0.0014469553,0.00009297139],"about_ca_topic_score_codex":0.0000043874556,"about_ca_topic_score_gemma":0.000010729194,"teacher_disagreement_score":0.115564756,"about_ca_system_score_codex":0.0001356101,"about_ca_system_score_gemma":0.000056239027,"threshold_uncertainty_score":0.37866634},"labels":[],"label_agreement":null},{"id":"W4403192332","doi":"10.1007/s00186-024-00866-z","title":"How to project onto the intersection of a closed affine subspace and a hyperplane","year":2024,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hyperplane; Affine transformation; Intersection (aeronautics); Subspace topology; Mathematics; Affine hull; Affine space; Combinatorics; Computer science; Pure mathematics; Mathematical analysis; Geography","score_opus":0.1063795417632415,"score_gpt":0.4923671252131184,"score_spread":0.3859875834498769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403192332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044033084,0.0002671751,0.95228106,0.0014845332,0.00001505257,0.0004988297,0.000005764839,0.00010034147,0.0013141541],"genre_scores_gemma":[0.41672605,0.000023303523,0.5826492,0.0000032327719,0.000017769178,0.00013281153,9.3542604e-7,0.000013688661,0.00043305033],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989806,0.0002685413,0.00020977738,0.00014018008,0.00025249712,0.00014841522],"domain_scores_gemma":[0.9985284,0.0010425881,0.0000052643018,0.00024138633,0.00014003375,0.0000422834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016117758,0.00008013154,0.00021877083,0.00023211278,0.00004894145,0.000090948284,0.00014275077,0.000042214782,0.00003186724],"category_scores_gemma":[0.0013712957,0.00004946183,0.000045771827,0.0009432647,0.00012411024,0.00010564599,0.00008069328,0.00024219911,0.000003353706],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021871743,0.00009018689,0.0000033565223,0.00097089476,0.00014730297,0.0000026490732,0.0034518123,0.001718681,0.7738306,0.083908804,0.000891995,0.13496187],"study_design_scores_gemma":[0.00006863386,0.0002900848,0.000023988383,0.0002617293,0.000034818582,0.000016982338,0.0015735433,0.6870628,0.28928384,0.018038169,0.003223066,0.00012235373],"about_ca_topic_score_codex":0.000035531284,"about_ca_topic_score_gemma":0.00004596961,"teacher_disagreement_score":0.6853441,"about_ca_system_score_codex":0.000049381888,"about_ca_system_score_gemma":0.000020838857,"threshold_uncertainty_score":0.20169948},"labels":[],"label_agreement":null},{"id":"W4414358199","doi":"10.1007/s00186-025-00906-2","title":"On the probability that the optimal solution of the Weber location problem is at a demand point","year":2025,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Probability distribution; Point (geometry); Euclidean geometry; Set (abstract data type); Random walk; Distribution (mathematics); Facility location problem; Convergence (economics); Plane (geometry)","score_opus":0.17256293400629957,"score_gpt":0.42204437795361804,"score_spread":0.24948144394731847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414358199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.295954,0.00010036134,0.48081592,0.17493378,0.00020300427,0.0056135096,0.0000064341593,0.000043822693,0.042329196],"genre_scores_gemma":[0.9657403,0.000008264614,0.028442655,0.00093376444,0.000031326377,0.000571799,0.0000037593932,0.000010307414,0.004257799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782836,0.0005660533,0.00047502166,0.00024031039,0.0006675228,0.00022272776],"domain_scores_gemma":[0.99755937,0.0007066829,0.00004423454,0.00088851614,0.0007923809,0.0000087984345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009848882,0.00011275744,0.00016942895,0.0001430972,0.00082161726,0.00013195528,0.0006345537,0.000055549237,0.00097354973],"category_scores_gemma":[0.0033864889,0.000052488154,0.00010593029,0.0012626377,0.0005066058,0.00021354521,0.00066545705,0.00024568013,0.00008669134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037604255,0.0003345173,0.00010240421,0.0007728304,0.000050818675,2.881151e-8,0.0005035928,0.012303646,0.00077510596,0.97359705,0.009486394,0.0020359796],"study_design_scores_gemma":[0.00031742366,0.00002668392,0.0028852131,0.00029578642,0.00007248303,3.7135862e-7,0.0014398835,0.69673955,0.011343351,0.2836789,0.0030779708,0.00012239418],"about_ca_topic_score_codex":0.00034792224,"about_ca_topic_score_gemma":0.000329051,"teacher_disagreement_score":0.6899182,"about_ca_system_score_codex":0.000081774204,"about_ca_system_score_gemma":0.00006718685,"threshold_uncertainty_score":0.9999397},"labels":[],"label_agreement":null}]}