{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045189913,0.0064689065,0.96877444,0.0053626816,0.0004808129,0.000037875347,0.00021380714,0.00013727378,0.014005244],"genre_scores_gemma":[0.2963353,0.028158167,0.60505825,0.001780441,0.0019519589,0.0003948495,0.000905261,0.0005120992,0.064903624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998713,0.00041576102,0.000081958584,0.00024870373,0.0003803801,0.00016019832],"domain_scores_gemma":[0.99833786,0.0007635335,0.0001370322,0.0002562612,0.00038940686,0.000115887524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020167716,0.0012087321,0.0022159913,0.0028426542,0.0013269142,0.0037427277,0.002404956,0.002966454,0.015272089],"category_scores_gemma":[0.0065884767,0.0008395987,0.0015335141,0.005630097,0.0026804681,0.010753835,0.004363946,0.0026809194,0.0032596893],"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.000068085166,0.00003420691,0.0004618028,0.00028375475,0.000057785222,0.00015791191,0.00016971263,0.036999628,0.0006886399,0.88043755,0.020854441,0.059786454],"study_design_scores_gemma":[0.000021459779,0.000034230285,0.00029553287,0.00010555089,0.00008164878,0.00017342457,0.00015563508,0.16100907,0.0010528283,0.8068994,0.030103398,0.00006769432],"about_ca_topic_score_codex":0.0038432046,"about_ca_topic_score_gemma":0.003644082,"teacher_disagreement_score":0.015272089,"about_ca_system_score_codex":0.0017002886,"about_ca_system_score_gemma":0.0016314845,"threshold_uncertainty_score":0.05109018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019978102,0.00052222726,0.9613428,0.00034079468,0.0001303866,0.000027199518,0.00007104386,0.00012388534,0.017463528],"genre_scores_gemma":[0.7434062,0.0015846788,0.21361142,0.00040127602,0.00044514952,0.00022310168,0.00023890458,0.0002587978,0.03983046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998116,0.000082448154,0.0000066970156,0.00002953453,0.000046664216,0.00002307765],"domain_scores_gemma":[0.99963486,0.00019996765,0.00004350752,0.000027470587,0.00005561879,0.000038516828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041066375,0.00072506553,0.0007459103,0.0007622739,0.0005375807,0.00084415684,0.0011841683,0.0010027144,0.00467379],"category_scores_gemma":[0.0015565138,0.00048234142,0.0010118672,0.0005408894,0.0012481214,0.0011340054,0.0010815519,0.0012843705,0.00037840984],"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.000028367502,0.000026962414,0.00013419267,0.00005857665,0.000030065325,0.000069274705,0.00005812723,0.5217414,0.0022741081,0.46126363,0.0020069822,0.012308388],"study_design_scores_gemma":[0.000012983875,0.000023394949,0.00006782807,0.000005889041,0.0000062273734,0.00001703053,0.000009919563,0.8695729,0.00016835208,0.12899162,0.0011140321,0.0000098887895],"about_ca_topic_score_codex":0.0020589218,"about_ca_topic_score_gemma":0.0024425464,"teacher_disagreement_score":0.00467379,"about_ca_system_score_codex":0.00055831735,"about_ca_system_score_gemma":0.00044936172,"threshold_uncertainty_score":0.015635371},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030344019,0.0142085245,0.9104611,0.005808525,0.0007292476,0.00012302745,0.00043841256,0.00039870664,0.037488483],"genre_scores_gemma":[0.6681316,0.027423894,0.24411865,0.0026509,0.0041196416,0.0012561914,0.0015610977,0.00089282705,0.04984525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940679,0.002521216,0.00030107348,0.00057240005,0.0015524749,0.0009848952],"domain_scores_gemma":[0.91900593,0.06915522,0.0034168432,0.0017307819,0.0042987536,0.002392408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01303817,0.003697301,0.0028790925,0.006233758,0.0019516895,0.0076908525,0.0044393004,0.0045158938,0.012410861],"category_scores_gemma":[0.07952127,0.0016517674,0.0027856922,0.0033576905,0.0051890556,0.007794043,0.006562822,0.011012652,0.0017733815],"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.00012541187,0.00011078541,0.00039127292,0.00035141912,0.00008366996,0.000075254546,0.00035150393,0.08066474,0.0013114898,0.894318,0.0037966988,0.018419761],"study_design_scores_gemma":[0.000022378823,0.000040159255,0.0002900069,0.0002398458,0.00005936563,0.000068961155,0.00008160548,0.39971027,0.00082363613,0.59591115,0.0026906526,0.000061976825],"about_ca_topic_score_codex":0.0027817846,"about_ca_topic_score_gemma":0.0022434283,"teacher_disagreement_score":0.01303817,"about_ca_system_score_codex":0.0043159947,"about_ca_system_score_gemma":0.0035968602,"threshold_uncertainty_score":0.068953276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02654053,0.0053225732,0.9355758,0.0019231103,0.000105574,0.000027509806,0.00014513297,0.00006990971,0.030289974],"genre_scores_gemma":[0.7711273,0.009575211,0.18889605,0.00034788877,0.0005017516,0.00027930783,0.00035667064,0.0002106861,0.028705254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986778,0.000773102,0.00004839612,0.00012563166,0.00026059602,0.000114448296],"domain_scores_gemma":[0.995706,0.0032880425,0.00025165582,0.0002846561,0.00030611892,0.00016358339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029426783,0.0009805906,0.001545303,0.0018734799,0.00062780525,0.0035418286,0.0011737081,0.00177769,0.0033341693],"category_scores_gemma":[0.012943091,0.00079567,0.0007143115,0.0015773606,0.0027424516,0.0048892647,0.0025486967,0.0029463994,0.0006517255],"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.000012757877,0.000009637409,0.0000822724,0.000060495975,0.0000109796165,0.000024037512,0.00005015269,0.046484973,0.00035637052,0.94347477,0.0011126101,0.008320947],"study_design_scores_gemma":[0.000005027704,0.0000071041422,0.00010816724,0.000027863727,0.000005545146,0.000018136254,0.000017459839,0.110639475,0.00011723562,0.88689363,0.0021536218,0.000006734456],"about_ca_topic_score_codex":0.0009773518,"about_ca_topic_score_gemma":0.00057704805,"teacher_disagreement_score":0.0035418286,"about_ca_system_score_codex":0.0014353838,"about_ca_system_score_gemma":0.0012403411,"threshold_uncertainty_score":0.015562594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027850817,0.00010428863,0.9946995,0.0002922017,0.000039507504,0.000013065271,0.000038739963,0.000058645688,0.0019690567],"genre_scores_gemma":[0.18891744,0.0006806366,0.7977551,0.00035486982,0.00043419105,0.0001932845,0.00030259864,0.0004092953,0.010952563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991072,0.00042845734,0.000037043435,0.000114132716,0.00024659958,0.000066646215],"domain_scores_gemma":[0.9974497,0.001515055,0.00014520307,0.00027089837,0.00041967924,0.00019943673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021008223,0.0009052977,0.0012250324,0.0014362261,0.00076605915,0.0029559503,0.0019972355,0.0014634207,0.005383191],"category_scores_gemma":[0.0077577024,0.00087715185,0.0010580744,0.001190906,0.002225312,0.0026898535,0.0035293938,0.0029806728,0.0010962401],"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.00014676085,0.00010949006,0.00028266484,0.00015736013,0.0000518249,0.000098134,0.00008968608,0.2951609,0.004084039,0.6418421,0.004353345,0.053623546],"study_design_scores_gemma":[0.000008925697,0.000014714176,0.00003890729,0.000009048929,0.0000044997455,0.000018581155,0.000009451362,0.8908237,0.0006763618,0.10703083,0.0013555543,0.000009441776],"about_ca_topic_score_codex":0.0018610725,"about_ca_topic_score_gemma":0.0016797603,"teacher_disagreement_score":0.005383191,"about_ca_system_score_codex":0.0011504687,"about_ca_system_score_gemma":0.0016263957,"threshold_uncertainty_score":0.01800859},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6157105,0.00064910005,0.3739199,0.0014301989,0.00016927734,0.00014788265,0.00028680937,0.00029837238,0.007387982],"genre_scores_gemma":[0.97812414,0.00018885611,0.015101677,0.00007284629,0.00004859431,0.00005292347,0.00010385101,0.000049018425,0.006258041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864393,0.0007269387,0.00003930356,0.00021947472,0.000087279535,0.0002830628],"domain_scores_gemma":[0.99399614,0.0044316193,0.0005019007,0.00015956431,0.0003687758,0.0005419837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028631806,0.0017062909,0.003825114,0.0013399592,0.001098975,0.003220861,0.0027967058,0.0030319616,0.0035241786],"category_scores_gemma":[0.008954104,0.0024768785,0.00096790073,0.0023097412,0.0023534154,0.004456771,0.0020076577,0.0021617992,0.00029101997],"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.00007890963,0.00003331851,0.00022406619,0.000011231231,0.000017000542,0.000054578628,0.00001221041,0.9966756,0.00016089615,0.0014152509,0.00013436761,0.0011826009],"study_design_scores_gemma":[0.000010843772,0.000020791358,0.00008900363,0.0000013371033,0.000008099441,0.0000047696644,0.000010518586,0.9983443,0.000051722574,0.0014202415,0.00003342162,0.0000050235117],"about_ca_topic_score_codex":0.023193873,"about_ca_topic_score_gemma":0.014837175,"teacher_disagreement_score":0.023193873,"about_ca_system_score_codex":0.0026836595,"about_ca_system_score_gemma":0.0015847296,"threshold_uncertainty_score":0.046117723},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039101474,0.31666028,0.24973778,0.18818218,0.023828134,0.000062494146,0.00030258246,0.00017529941,0.18194973],"genre_scores_gemma":[0.4420823,0.13333234,0.11453175,0.022137871,0.020868307,0.00022422904,0.0002059478,0.00058031,0.26603693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931,0.000291673,0.000034727902,0.00012886689,0.00018014014,0.000054483662],"domain_scores_gemma":[0.99789906,0.0011813123,0.00018282961,0.00016166693,0.00036301455,0.00021200436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021072146,0.0010718983,0.0012459696,0.0020328397,0.0013138659,0.0038607968,0.0009784936,0.0027007125,0.008191349],"category_scores_gemma":[0.008053657,0.00047709086,0.0005149095,0.0030755524,0.007770077,0.009172045,0.0033964622,0.004450756,0.0012181022],"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.000011985336,0.0000083912455,0.00017935339,0.000035084373,0.000009690806,0.000030301786,0.0002290454,0.0005092887,0.000070212496,0.96578115,0.01997002,0.013165384],"study_design_scores_gemma":[0.000005306149,0.0000057005227,0.00018761025,0.000059401773,0.000008110032,0.000031109896,0.00013545934,0.0015778409,0.00006265067,0.9292131,0.0687045,0.00000922618],"about_ca_topic_score_codex":0.0063848468,"about_ca_topic_score_gemma":0.005926837,"teacher_disagreement_score":0.008191349,"about_ca_system_score_codex":0.0020266986,"about_ca_system_score_gemma":0.0012397063,"threshold_uncertainty_score":0.027402759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047415514,0.000052896605,0.992971,0.000053108244,0.000020206237,0.00005837658,0.00002647451,0.00007309707,0.0020032772],"genre_scores_gemma":[0.085153624,0.000109699315,0.9115521,0.00009097402,0.000028308825,0.00033521184,0.00015219976,0.00016148425,0.0024163732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909747,0.0003585163,0.000033990822,0.00008673174,0.0003555469,0.000067801746],"domain_scores_gemma":[0.99919623,0.00053802104,0.000040829604,0.0000476192,0.00014214989,0.00003519987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015079532,0.0009363314,0.0012987698,0.0008152984,0.00067029556,0.0011661052,0.0021047224,0.0014407426,0.0057643885],"category_scores_gemma":[0.0034281244,0.00087063864,0.00092342077,0.001300955,0.00085929065,0.001166304,0.0017229699,0.0021897752,0.00094319595],"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.0002509986,0.00023812841,0.0005263281,0.00022706906,0.000055114255,0.0001433987,0.0002098108,0.73351496,0.006388599,0.065062165,0.00393045,0.18945289],"study_design_scores_gemma":[0.000026123582,0.00003999125,0.000047208556,0.000011289423,0.0000076133074,0.00001500433,0.000013752448,0.9921416,0.0007268657,0.005925104,0.0010379571,0.0000074967184],"about_ca_topic_score_codex":0.0033110897,"about_ca_topic_score_gemma":0.0039217523,"teacher_disagreement_score":0.0057643885,"about_ca_system_score_codex":0.00047748757,"about_ca_system_score_gemma":0.0014496007,"threshold_uncertainty_score":0.019283831},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12206946,0.0025874553,0.86217684,0.0031730642,0.00039218785,0.00028424017,0.0012395935,0.0005759908,0.007501136],"genre_scores_gemma":[0.9274741,0.0021327597,0.040588442,0.00060439203,0.0005329564,0.0008393444,0.0008126536,0.00008760778,0.026927834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920358,0.0046268594,0.00037597324,0.0014069763,0.0004922775,0.001062166],"domain_scores_gemma":[0.9318902,0.05793292,0.005233355,0.0022040487,0.0019335699,0.0008060219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013348294,0.0038201115,0.0076362775,0.0018231441,0.0013606178,0.0072531197,0.0053880727,0.009102272,0.008731729],"category_scores_gemma":[0.04281554,0.0024309717,0.002286056,0.0029629446,0.005125827,0.0070604347,0.0032557454,0.005994548,0.002449199],"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.0007072025,0.00018765502,0.0016448487,0.00023604785,0.00028707852,0.00029934442,0.00020640361,0.8491155,0.00028369023,0.13739851,0.001573299,0.008060481],"study_design_scores_gemma":[0.00012978545,0.00009363299,0.0002462106,0.000034330475,0.00009309856,0.00003867071,0.000054967408,0.9436342,0.00014227023,0.055105515,0.00037875897,0.000048506947],"about_ca_topic_score_codex":0.0058991946,"about_ca_topic_score_gemma":0.003891337,"teacher_disagreement_score":0.013348294,"about_ca_system_score_codex":0.0024225484,"about_ca_system_score_gemma":0.001336567,"threshold_uncertainty_score":0.07059336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004002179,0.00012979729,0.993298,0.00007806215,0.000060941376,0.000049525337,0.000061189225,0.00077145966,0.0015487801],"genre_scores_gemma":[0.20830648,0.00055259466,0.78426725,0.0001012672,0.00009655937,0.00032463486,0.00039351106,0.0007355015,0.0052222237],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99207425,0.0031927386,0.0003219029,0.002101343,0.0019867118,0.00032296896],"domain_scores_gemma":[0.9900974,0.0034738632,0.00084309524,0.0030533676,0.0023347149,0.00019753027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034416346,0.0031077256,0.0017184976,0.0030914138,0.0011045755,0.0032579498,0.002665471,0.0028670442,0.0047504245],"category_scores_gemma":[0.033238366,0.0015640783,0.0014932859,0.0051662726,0.001993938,0.0034503103,0.0040011634,0.0023832016,0.005136299],"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.0004215081,0.0001502136,0.001962312,0.00048707283,0.00010908093,0.0002615346,0.00094093074,0.2997895,0.024932284,0.115288936,0.007583052,0.5480736],"study_design_scores_gemma":[0.000021171441,0.00012690853,0.00086487626,0.000067710826,0.000027998347,0.00032507718,0.00019984678,0.89122367,0.029823367,0.059725016,0.017504215,0.00009017874],"about_ca_topic_score_codex":0.0045763594,"about_ca_topic_score_gemma":0.0018198565,"teacher_disagreement_score":0.0047504245,"about_ca_system_score_codex":0.0015292969,"about_ca_system_score_gemma":0.0015441497,"threshold_uncertainty_score":0.018201292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012332106,0.0008386595,0.99038786,0.00042357104,0.00020107105,0.000044677152,0.000038661237,0.00024129219,0.0065910276],"genre_scores_gemma":[0.08468119,0.0020544939,0.8908483,0.00054917956,0.00036091325,0.0004272757,0.00027873102,0.0006581014,0.020141724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845576,0.00059101696,0.000071762865,0.00017806866,0.0005898016,0.000113554604],"domain_scores_gemma":[0.9976683,0.0014466186,0.00007672723,0.00030224957,0.000376991,0.00012901788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002407244,0.0012224492,0.0019400213,0.0017572958,0.0012714263,0.0034724954,0.0024560986,0.0021244667,0.010163036],"category_scores_gemma":[0.012697714,0.0009132239,0.0012137648,0.0022944524,0.0028252741,0.004793786,0.0028631713,0.0062589226,0.003996894],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100427926,0.000055531327,0.00015590686,0.00021191161,0.00005077708,0.000030264764,0.000084565014,0.037005067,0.00060966326,0.8191744,0.010231835,0.1322896],"study_design_scores_gemma":[0.000066014865,0.000043116266,0.000076129596,0.00006847186,0.000023904511,0.00005684144,0.000017897111,0.30827215,0.0007232874,0.6707212,0.019904945,0.000026025844],"about_ca_topic_score_codex":0.0023013724,"about_ca_topic_score_gemma":0.0016453257,"teacher_disagreement_score":0.010163036,"about_ca_system_score_codex":0.0014359253,"about_ca_system_score_gemma":0.0021885242,"threshold_uncertainty_score":0.033998728},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017593725,0.0031065189,0.94172686,0.0010786046,0.00029921735,0.00006890168,0.00018745624,0.000075658165,0.03586315],"genre_scores_gemma":[0.43982401,0.009012743,0.4819304,0.0012716198,0.000881266,0.0007743553,0.0011145336,0.0004864641,0.0647046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845564,0.00078965013,0.000058102807,0.00019695294,0.0003524957,0.00014713455],"domain_scores_gemma":[0.99884796,0.0006436468,0.00012467903,0.00011244815,0.00017172952,0.00009954348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002790664,0.002109729,0.0016302267,0.0018162836,0.00091174414,0.0021463926,0.0012544738,0.0011868281,0.010534881],"category_scores_gemma":[0.0069549936,0.0006369535,0.0010418156,0.0031464892,0.0019602338,0.003973121,0.003349728,0.0025486422,0.0012197567],"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.000049279424,0.000026161648,0.0001228046,0.0001111262,0.000030844745,0.000033969045,0.00006433074,0.04517128,0.0007757586,0.91666424,0.0034052988,0.033544913],"study_design_scores_gemma":[0.000020343805,0.000031835676,0.000113352464,0.00003832173,0.000015114859,0.000032163887,0.000034994806,0.09791759,0.00023704303,0.8931757,0.0083745755,0.000008938107],"about_ca_topic_score_codex":0.001518798,"about_ca_topic_score_gemma":0.0016641848,"teacher_disagreement_score":0.010534881,"about_ca_system_score_codex":0.0015635146,"about_ca_system_score_gemma":0.0009855119,"threshold_uncertainty_score":0.035242677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14524171,0.0087823365,0.80309075,0.0037075102,0.0007424226,0.0007059124,0.002430021,0.0008216302,0.03447778],"genre_scores_gemma":[0.8307158,0.004746198,0.052343313,0.00042668512,0.0005792401,0.00068048,0.0013523916,0.0002538782,0.10890204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965821,0.0012262124,0.00020605138,0.0006558493,0.00078462623,0.0005452627],"domain_scores_gemma":[0.98489916,0.01006739,0.0016271218,0.0005506086,0.0023469313,0.00050877733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074251746,0.0025561189,0.0037216537,0.002231202,0.0010411667,0.004688286,0.006641264,0.0053268187,0.010952075],"category_scores_gemma":[0.02041231,0.0024854229,0.002836739,0.0024389985,0.002448655,0.0053899614,0.0013119932,0.0030695463,0.002050278],"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.00038941868,0.00016080627,0.0009831339,0.00044229085,0.000115396855,0.00066902343,0.0002527894,0.8509173,0.0017238567,0.12913299,0.0034870638,0.011725927],"study_design_scores_gemma":[0.000054619173,0.00016047145,0.0005550102,0.000036308196,0.000090149144,0.00008776339,0.000041919448,0.98006827,0.00028571003,0.016950151,0.0016059884,0.00006357446],"about_ca_topic_score_codex":0.016716449,"about_ca_topic_score_gemma":0.011221956,"teacher_disagreement_score":0.016716449,"about_ca_system_score_codex":0.005763921,"about_ca_system_score_gemma":0.0026779263,"threshold_uncertainty_score":0.041820347},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009963273,0.002647865,0.01777791,0.051175997,0.92024213,0.000049849983,0.0018941369,0.0015018963,0.003713847],"genre_scores_gemma":[0.07736232,0.008124863,0.024696223,0.07059372,0.7196566,0.00043427295,0.003856138,0.002777149,0.09249871],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938135,0.0010798122,0.00084301585,0.001020631,0.0027372777,0.0005057475],"domain_scores_gemma":[0.96200514,0.011439607,0.001485052,0.00477858,0.01938074,0.00091077544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005234108,0.0031783204,0.0032178971,0.00546253,0.0028249843,0.003038423,0.00624575,0.007899735,0.037320532],"category_scores_gemma":[0.068488486,0.0013158389,0.0033500094,0.0056487047,0.003342459,0.0028323182,0.002997947,0.0086462,0.017162427],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016067599,0.000015760603,0.00024792625,0.0005082074,0.00008457006,0.00026616242,0.000058378646,0.0010837779,0.00029804854,0.009517015,0.97599846,0.0117609035],"study_design_scores_gemma":[0.0003756484,0.00010077989,0.003788502,0.00062967197,0.00048486027,0.0011212213,0.000099742836,0.03065439,0.004568013,0.060383484,0.8975133,0.00028037294],"about_ca_topic_score_codex":0.012665617,"about_ca_topic_score_gemma":0.008761441,"teacher_disagreement_score":0.037320532,"about_ca_system_score_codex":0.0035666095,"about_ca_system_score_gemma":0.00326922,"threshold_uncertainty_score":0.12484962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65992445,0.008748665,0.20958894,0.04436989,0.0027817695,0.00012792661,0.000239295,0.00025641714,0.07396265],"genre_scores_gemma":[0.98040515,0.0013603977,0.007479523,0.0013488408,0.0012790019,0.000035347835,0.0000359434,0.000058031255,0.00799793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829835,0.00061417354,0.00010562769,0.00035140244,0.00037755657,0.0002528151],"domain_scores_gemma":[0.9915343,0.0038504642,0.0016100688,0.0012306982,0.0007359028,0.00103857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008266448,0.0005787125,0.0013332106,0.0007679361,0.00056842715,0.0029420948,0.0010010445,0.0015586325,0.010357579],"category_scores_gemma":[0.023639217,0.00029942472,0.00055162125,0.00044492885,0.0028451735,0.0057503036,0.0026196588,0.003941212,0.0007587579],"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.0018400775,0.00079161354,0.031764958,0.00040233688,0.0005585247,0.0013504851,0.0012132282,0.00773665,0.0034874505,0.5443071,0.027039321,0.3795083],"study_design_scores_gemma":[0.000102284124,0.00039873947,0.008824822,0.00016998709,0.0002276152,0.000981488,0.0015269672,0.031822894,0.0012556249,0.944019,0.01058554,0.00008502439],"about_ca_topic_score_codex":0.0002206032,"about_ca_topic_score_gemma":0.0002618865,"teacher_disagreement_score":0.010357579,"about_ca_system_score_codex":0.00044665864,"about_ca_system_score_gemma":0.0005156627,"threshold_uncertainty_score":0.043717682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5658915,0.0014231645,0.40829435,0.0026262028,0.00016473162,0.00014621328,0.0003855391,0.00036240733,0.02070588],"genre_scores_gemma":[0.9872487,0.00041503398,0.0090377815,0.000052008865,0.000033692875,0.000027381822,0.00006514557,0.000021383676,0.0030989018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989666,0.0004879874,0.000064030675,0.00013719371,0.00018250648,0.00016161193],"domain_scores_gemma":[0.99201643,0.005946679,0.0007162878,0.0002657139,0.0007174877,0.0003374021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030574375,0.00041843415,0.0009553572,0.0011209036,0.0007590945,0.0031069752,0.0014909989,0.0014551712,0.0048699193],"category_scores_gemma":[0.012657968,0.00079414895,0.00037726568,0.001957409,0.0011964809,0.0044248938,0.0007944192,0.0010640388,0.0003332108],"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.0004592519,0.00019248342,0.0012795305,0.000080598795,0.000029915842,0.00014218848,0.000100230995,0.888638,0.0009127451,0.08589346,0.001530636,0.020740908],"study_design_scores_gemma":[0.000032294174,0.000044599296,0.00026161812,0.000011803162,0.000014592735,0.000024646304,0.000047471898,0.9698252,0.00024066571,0.029111296,0.00037478228,0.000011052973],"about_ca_topic_score_codex":0.0055411994,"about_ca_topic_score_gemma":0.0051227496,"teacher_disagreement_score":0.0055411994,"about_ca_system_score_codex":0.0027315486,"about_ca_system_score_gemma":0.0015777024,"threshold_uncertainty_score":0.019818842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011026879,0.00028349264,0.986426,0.0001960745,0.00009327294,0.00004528927,0.000029828454,0.00016096869,0.0017382308],"genre_scores_gemma":[0.5207879,0.00060653896,0.46699783,0.00024889436,0.00022656492,0.0006921596,0.00021691382,0.0002802026,0.009943084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855405,0.00076137827,0.00006892016,0.00016170673,0.00032306495,0.00013091227],"domain_scores_gemma":[0.9910773,0.00704517,0.00043116455,0.0003849308,0.0008085881,0.00025285364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030598408,0.0011997621,0.0019644315,0.0009530113,0.00061725976,0.0013569206,0.002182053,0.0019080706,0.0048186714],"category_scores_gemma":[0.014144419,0.0011248736,0.0008908933,0.0008012196,0.0017264065,0.0020049985,0.0022298056,0.0030682744,0.0007200667],"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.00010818467,0.000059854116,0.0002623534,0.0000662176,0.000039502906,0.00003166221,0.000054988588,0.9143505,0.00040391652,0.058126714,0.000925759,0.025570335],"study_design_scores_gemma":[0.000013913778,0.000010922674,0.000020793821,0.0000044063167,0.0000026397604,0.0000036059919,0.0000017325747,0.98526627,0.00007529038,0.014414419,0.000182551,0.0000034760003],"about_ca_topic_score_codex":0.005611167,"about_ca_topic_score_gemma":0.004629883,"teacher_disagreement_score":0.005611167,"about_ca_system_score_codex":0.0017556336,"about_ca_system_score_gemma":0.0030310696,"threshold_uncertainty_score":0.016182125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49053472,0.0034642657,0.34537545,0.0076619256,0.0008450799,0.00047027122,0.0033709821,0.0011721399,0.14710507],"genre_scores_gemma":[0.891825,0.0010972056,0.008669059,0.00019964472,0.0002255137,0.00015282816,0.00050533266,0.000112762384,0.09721273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00019429559,0.00004159531,0.00018897116,0.00016501214,0.00020773272],"domain_scores_gemma":[0.99782217,0.0008173027,0.00037364318,0.00017817217,0.0004509297,0.00035785828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016267921,0.0009579777,0.0021464773,0.0014660046,0.0011460454,0.0032966498,0.002769689,0.003071149,0.015435158],"category_scores_gemma":[0.005607167,0.0007223816,0.0011197696,0.002031452,0.0016324058,0.0038625891,0.001033177,0.0017002561,0.002163144],"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.0007324803,0.00035319588,0.0012335881,0.00040089383,0.00010219507,0.0025280898,0.000254278,0.584062,0.002832501,0.35820404,0.01552389,0.033772815],"study_design_scores_gemma":[0.00016339635,0.00016282113,0.00058209675,0.000031252534,0.00008591615,0.00035797394,0.000102005295,0.8989807,0.0005401131,0.09302277,0.005912051,0.000058831727],"about_ca_topic_score_codex":0.007260873,"about_ca_topic_score_gemma":0.003983503,"teacher_disagreement_score":0.015435158,"about_ca_system_score_codex":0.0021268446,"about_ca_system_score_gemma":0.0022499356,"threshold_uncertainty_score":0.051635742},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22527158,0.00034892122,0.77122235,0.0003320169,0.00013963085,0.0001353914,0.00015694239,0.00034695846,0.0020461485],"genre_scores_gemma":[0.9258384,0.00028062525,0.07089629,0.00006615835,0.00009328746,0.00012356494,0.00012584208,0.000112192574,0.0024636982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935085,0.00025768837,0.000041077772,0.00010513504,0.0001225119,0.00012271033],"domain_scores_gemma":[0.9975211,0.0016627815,0.00036110333,0.00013550857,0.00016579266,0.00015368055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014233564,0.0008416349,0.0015767539,0.00057866535,0.0006015033,0.0010335353,0.0013088862,0.0012189959,0.0022682208],"category_scores_gemma":[0.0037130467,0.0011009008,0.0009797572,0.0009484541,0.0007932826,0.0012582084,0.0007334764,0.00076008984,0.00022349137],"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.00022061364,0.000051721883,0.00018591534,0.000102776634,0.000026596079,0.00009839673,0.000022157841,0.97844374,0.0035004625,0.013087542,0.00025646482,0.0040035904],"study_design_scores_gemma":[0.000026223586,0.000063348285,0.000099641366,0.000002641302,0.0000059410827,0.000011081159,0.000004619209,0.9934676,0.0005756022,0.0056210784,0.0001168826,0.0000053106814],"about_ca_topic_score_codex":0.0012451635,"about_ca_topic_score_gemma":0.0013090551,"teacher_disagreement_score":0.0022682208,"about_ca_system_score_codex":0.0008727953,"about_ca_system_score_gemma":0.0012114962,"threshold_uncertainty_score":0.0075879693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13203856,0.0007573957,0.8521654,0.0010196579,0.00009301367,0.0002849915,0.00035464446,0.00033630294,0.01294999],"genre_scores_gemma":[0.9510169,0.00045850064,0.04116218,0.00009958551,0.000062937186,0.00025076632,0.00015333029,0.00011500895,0.00668082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987078,0.00047897728,0.000051263552,0.00018626844,0.00019887865,0.00037683712],"domain_scores_gemma":[0.99686617,0.0020873318,0.0003208142,0.00008580689,0.00034879622,0.0002910574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023420125,0.0020434677,0.0027842766,0.0015934933,0.0010190586,0.0036132587,0.0033600945,0.0028324784,0.0049711573],"category_scores_gemma":[0.006651401,0.0022612012,0.0016004232,0.0026043877,0.0017564637,0.0029842998,0.0019624757,0.0018708183,0.0006055073],"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.000148228,0.00006917491,0.00016821074,0.00008278648,0.000038273487,0.000096496966,0.00007704047,0.96739966,0.0011680289,0.025400277,0.00064636057,0.004705473],"study_design_scores_gemma":[0.000023005576,0.00004939405,0.000064531996,0.000007792826,0.00001605985,0.00001528954,0.00002246905,0.991264,0.0001855816,0.008179569,0.00015996028,0.000012386798],"about_ca_topic_score_codex":0.009578995,"about_ca_topic_score_gemma":0.005712983,"teacher_disagreement_score":0.009578995,"about_ca_system_score_codex":0.004368743,"about_ca_system_score_gemma":0.0028451802,"threshold_uncertainty_score":0.03169757},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038105592,0.0005998548,0.9337925,0.0012302811,0.0002738194,0.000093271534,0.0003761694,0.00013512839,0.02539342],"genre_scores_gemma":[0.62718165,0.0021641983,0.28988484,0.00065197627,0.0014348376,0.0005312731,0.0014101644,0.00025887368,0.076482214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978684,0.001142356,0.00010341374,0.00039587682,0.00031968224,0.0001703319],"domain_scores_gemma":[0.9956761,0.002356068,0.0006147384,0.0004788606,0.0004922445,0.00038208763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031196997,0.0010635792,0.001147177,0.00088022335,0.00067190855,0.001550088,0.0018706359,0.0010395527,0.012848353],"category_scores_gemma":[0.008528051,0.00057810935,0.0016305045,0.0015742967,0.0012220942,0.003296984,0.0021195847,0.0023186433,0.0010796968],"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.00015195012,0.00015998854,0.00049879245,0.00013934208,0.000056137855,0.00014517557,0.00012169336,0.21828836,0.0007074624,0.74334645,0.005677252,0.030707512],"study_design_scores_gemma":[0.000041669562,0.00007840609,0.0002593961,0.000018348961,0.00001911556,0.00009544273,0.00003595435,0.45541832,0.00015518116,0.5367242,0.0071383235,0.000015687141],"about_ca_topic_score_codex":0.002137006,"about_ca_topic_score_gemma":0.002707219,"teacher_disagreement_score":0.012848353,"about_ca_system_score_codex":0.0011020037,"about_ca_system_score_gemma":0.0019437465,"threshold_uncertainty_score":0.042981982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4321326,0.0009380066,0.438012,0.0043603806,0.0003823176,0.000242992,0.00055700244,0.00019206014,0.12318255],"genre_scores_gemma":[0.94172376,0.0005717393,0.013184574,0.00021311469,0.00016523918,0.0001751929,0.0001190306,0.000037982107,0.043809358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780685,0.0012472364,0.00012695971,0.0002660399,0.00021477915,0.0003381823],"domain_scores_gemma":[0.9865284,0.010194449,0.0011734099,0.0006424986,0.00041484667,0.0010462776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003493521,0.0016746082,0.002264851,0.000983365,0.0010239098,0.0036272455,0.0022617402,0.0038827276,0.015439166],"category_scores_gemma":[0.013904183,0.00088544417,0.0013530581,0.0011527874,0.0030914713,0.007842075,0.0027233944,0.0032321836,0.0009359524],"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.00032111295,0.00008789186,0.00036512807,0.000098623364,0.00007219287,0.0005479368,0.0002889723,0.09994868,0.0004469118,0.8904962,0.0022729672,0.0050533074],"study_design_scores_gemma":[0.00026206078,0.00018515995,0.00034715474,0.000036089034,0.00007526114,0.00038556548,0.0003521644,0.32960552,0.00021209609,0.666053,0.0024242264,0.00006171525],"about_ca_topic_score_codex":0.001629318,"about_ca_topic_score_gemma":0.0011803916,"teacher_disagreement_score":0.015439166,"about_ca_system_score_codex":0.0014936087,"about_ca_system_score_gemma":0.0009091205,"threshold_uncertainty_score":0.051649094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014436446,0.0008469825,0.96657133,0.0012065904,0.00010170514,0.00006911515,0.00009476445,0.0000703351,0.016602695],"genre_scores_gemma":[0.8118675,0.0024955769,0.16982844,0.000649667,0.00036601946,0.0006098466,0.00018097881,0.00013504288,0.013866835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985915,0.0006343024,0.000068370144,0.00026802684,0.00032022642,0.00011765473],"domain_scores_gemma":[0.9977769,0.0016091281,0.00017986874,0.00007543488,0.00022319223,0.00013549937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032376663,0.0012994232,0.0011982213,0.0008653863,0.000858155,0.0015749,0.0012330743,0.0019608065,0.0043513426],"category_scores_gemma":[0.0055925073,0.0006098714,0.0021419097,0.00069941685,0.0029645436,0.0027346967,0.0027272722,0.0034297898,0.00039740515],"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.000017085906,0.00002924137,0.00010721254,0.00012231557,0.000036428628,0.00007074857,0.00009854367,0.044321444,0.0021521626,0.94710803,0.00075382134,0.0051828725],"study_design_scores_gemma":[0.00002339105,0.000060386323,0.0001427627,0.000039785613,0.000018625495,0.000059256363,0.000030986215,0.32321995,0.00062095845,0.67349446,0.0022655965,0.000023903793],"about_ca_topic_score_codex":0.00091193826,"about_ca_topic_score_gemma":0.00063845504,"teacher_disagreement_score":0.0043513426,"about_ca_system_score_codex":0.001542443,"about_ca_system_score_gemma":0.0015606299,"threshold_uncertainty_score":0.017122626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15695076,0.001594489,0.8257114,0.0057916977,0.00023798963,0.00009188698,0.00041590608,0.00022464794,0.008981185],"genre_scores_gemma":[0.9188825,0.0015564766,0.04969357,0.00042389124,0.00063733093,0.00018665084,0.0005043785,0.00015231848,0.027962841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986337,0.0006664662,0.0000700237,0.00022782078,0.00023686135,0.00016513336],"domain_scores_gemma":[0.98994803,0.007845051,0.0009124912,0.00030025237,0.00043512328,0.00055912987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048374766,0.0016627937,0.003132789,0.0012501082,0.0005534941,0.0035179718,0.0017138206,0.0041176225,0.0028943233],"category_scores_gemma":[0.020148473,0.0015095738,0.0012985169,0.0015373351,0.0020469637,0.0046812096,0.002808076,0.002430959,0.00031008266],"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.00021079459,0.00012132803,0.0016155024,0.00014139937,0.00020667566,0.000556429,0.00007047004,0.84791476,0.0010368048,0.135395,0.0022591732,0.0104716215],"study_design_scores_gemma":[0.000025270972,0.00003128934,0.0002532679,0.0000052736104,0.000027080296,0.0000501104,0.000009656975,0.9635473,0.000119941,0.035754986,0.000163177,0.000012609792],"about_ca_topic_score_codex":0.002906547,"about_ca_topic_score_gemma":0.0015550044,"teacher_disagreement_score":0.0048374766,"about_ca_system_score_codex":0.0014280541,"about_ca_system_score_gemma":0.0016162243,"threshold_uncertainty_score":0.025583386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21187949,0.0010172597,0.76008135,0.0048630214,0.00073727756,0.00037862032,0.0011954135,0.0012090711,0.01863851],"genre_scores_gemma":[0.91314703,0.00052509253,0.064966656,0.0007173181,0.00034663195,0.00013759221,0.00026789907,0.00013174243,0.019760042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997897,0.00038845916,0.00011707857,0.0004325907,0.00052054325,0.0006443247],"domain_scores_gemma":[0.9945866,0.002227871,0.0005815322,0.00043340365,0.0012373915,0.0009332771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031969657,0.0010415105,0.0015276937,0.0014416539,0.0027805232,0.004622216,0.0036409358,0.0024770363,0.0059311143],"category_scores_gemma":[0.01207119,0.0008542056,0.0007873639,0.001873421,0.0019193123,0.0042020804,0.0027094588,0.002371409,0.0009732994],"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.002052778,0.00040565635,0.0038385866,0.00047650424,0.00013302318,0.0012213553,0.000548623,0.31189814,0.014763307,0.6289458,0.013386865,0.022329284],"study_design_scores_gemma":[0.00015906058,0.0001180606,0.00028097516,0.000017308768,0.00004018059,0.00012156547,0.0000634065,0.9530963,0.0012750875,0.043698326,0.0010847679,0.000044979613],"about_ca_topic_score_codex":0.014672579,"about_ca_topic_score_gemma":0.008928435,"teacher_disagreement_score":0.014672579,"about_ca_system_score_codex":0.0060924203,"about_ca_system_score_gemma":0.0046938476,"threshold_uncertainty_score":0.04420376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08197433,0.00082039856,0.892469,0.002372569,0.00011505036,0.00005288106,0.00018298687,0.0000803633,0.021932393],"genre_scores_gemma":[0.9237088,0.0011922966,0.058183882,0.00035222917,0.0002141306,0.00018231058,0.00019969676,0.00011848352,0.01584816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988606,0.0006413912,0.000039280752,0.00018320573,0.00013742073,0.00013808483],"domain_scores_gemma":[0.9982046,0.0011764348,0.00016475731,0.00013128159,0.00017752424,0.00014538894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002528689,0.0012473684,0.0016015031,0.00060902047,0.00036802085,0.0025924402,0.0011817287,0.0019144007,0.0034359333],"category_scores_gemma":[0.008434142,0.00052224024,0.0009132618,0.00087705784,0.0023253707,0.0029023313,0.0018377091,0.0023773974,0.00045257204],"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.000095581534,0.00008413926,0.00047295514,0.00012467132,0.00006368536,0.00044430065,0.0000964082,0.23718154,0.0030124665,0.74632186,0.0020566385,0.010045716],"study_design_scores_gemma":[0.00004685752,0.00006059565,0.00032969957,0.00003753477,0.00002025863,0.0001241438,0.000030463769,0.6888077,0.0010125918,0.30768946,0.0018210778,0.00001950918],"about_ca_topic_score_codex":0.0011351077,"about_ca_topic_score_gemma":0.0005011339,"teacher_disagreement_score":0.0034359333,"about_ca_system_score_codex":0.0011803495,"about_ca_system_score_gemma":0.00094220915,"threshold_uncertainty_score":0.0133731365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22168808,0.0009339512,0.7686311,0.0020106246,0.000097813194,0.000089101544,0.00016332614,0.00033108966,0.0060549565],"genre_scores_gemma":[0.9546396,0.00047378047,0.03588742,0.00016577625,0.00008956537,0.00009163638,0.00013062517,0.00015759018,0.008363951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981438,0.00093188084,0.00008124258,0.0003200716,0.0002680723,0.0002548691],"domain_scores_gemma":[0.9855797,0.011376275,0.0011081501,0.0004248304,0.0007213863,0.0007896605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053751776,0.0017316731,0.0018649421,0.0010948641,0.00049687707,0.0031839816,0.0018971015,0.0033066547,0.0028279892],"category_scores_gemma":[0.016865032,0.0012303377,0.0008953123,0.00085658237,0.002029112,0.0028443444,0.0020803777,0.0020912536,0.00028043386],"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.00039044186,0.00008274191,0.0013228785,0.00017359573,0.00010256244,0.00017664809,0.000120736346,0.9282781,0.002999813,0.05805055,0.0008482327,0.007453629],"study_design_scores_gemma":[0.000013498898,0.00004116168,0.00026943834,0.00000941746,0.000017105362,0.000025172863,0.000011477297,0.9888094,0.00028552202,0.010414576,0.00009102858,0.000012277297],"about_ca_topic_score_codex":0.0043536983,"about_ca_topic_score_gemma":0.0019226912,"teacher_disagreement_score":0.0053751776,"about_ca_system_score_codex":0.002451184,"about_ca_system_score_gemma":0.0020596294,"threshold_uncertainty_score":0.028427005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03994192,0.0006556471,0.94792616,0.00026959126,0.00018775325,0.00020238009,0.0004425774,0.0007176414,0.009656326],"genre_scores_gemma":[0.5358673,0.0004999621,0.4544405,0.00027786332,0.00010622077,0.00045783748,0.001061721,0.00021038674,0.007078171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.00015944272,0.000013387561,0.000045316192,0.00010611324,0.00007881411],"domain_scores_gemma":[0.9992131,0.0004566546,0.00005773946,0.000044799617,0.00018742534,0.00004024384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006086358,0.001107011,0.0012470192,0.0012275956,0.0005689407,0.0009956823,0.0009814472,0.0010186533,0.0061059194],"category_scores_gemma":[0.0013786277,0.0005530039,0.00076914195,0.0016744768,0.00041591187,0.00059672765,0.0007422631,0.0011282676,0.0006375706],"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.00008862332,0.00011783869,0.0002540429,0.00014801115,0.00005000217,0.000065291795,0.000032136628,0.9297607,0.002123754,0.0032834378,0.0029377947,0.061138313],"study_design_scores_gemma":[0.000011560229,0.000030245326,0.000072250405,0.0000054719153,0.000009585093,0.000008777591,0.000008178509,0.99782914,0.0003500844,0.0013527033,0.0003180695,0.00000390213],"about_ca_topic_score_codex":0.007875719,"about_ca_topic_score_gemma":0.009696705,"teacher_disagreement_score":0.007875719,"about_ca_system_score_codex":0.0006021122,"about_ca_system_score_gemma":0.0013752641,"threshold_uncertainty_score":0.020426393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010519636,0.00011927222,0.9834562,0.0005209592,0.000095307194,0.000053666765,0.00016121319,0.000592182,0.0044815512],"genre_scores_gemma":[0.061298348,0.00039101968,0.93201286,0.00010262646,0.000037359892,0.00010272604,0.0005079492,0.0005592375,0.004987891],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935,0.00012879106,0.00004750038,0.0001724671,0.0002467322,0.000054444186],"domain_scores_gemma":[0.9989907,0.00035473774,0.000055279248,0.00019588649,0.00031956905,0.00008387622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009078381,0.00072199473,0.00062200933,0.0005902045,0.000620939,0.0023765462,0.00083549425,0.00096997415,0.012020957],"category_scores_gemma":[0.0045724404,0.00051973324,0.0007380058,0.0006361873,0.0012614417,0.0035132156,0.0025386938,0.0023525937,0.003716212],"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.00018061449,0.00009840707,0.0011495779,0.00055963796,0.00006567139,0.00013014956,0.00051971304,0.029306054,0.015522078,0.17167838,0.023474872,0.7573148],"study_design_scores_gemma":[0.00009817982,0.00017115305,0.001192576,0.00019749135,0.000060092978,0.0008158624,0.001316093,0.32938707,0.033164937,0.5747253,0.05876577,0.00010552381],"about_ca_topic_score_codex":0.0021803894,"about_ca_topic_score_gemma":0.0023797047,"teacher_disagreement_score":0.012020957,"about_ca_system_score_codex":0.0003093123,"about_ca_system_score_gemma":0.001138315,"threshold_uncertainty_score":0.04021406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4022165,0.0048108944,0.51356775,0.017653175,0.0007354749,0.00035564767,0.0015566085,0.00040453149,0.058699396],"genre_scores_gemma":[0.9699617,0.0037730075,0.014964069,0.0004799556,0.0011894387,0.00028925104,0.00046637966,0.00009617123,0.008779869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960026,0.0019388692,0.00020578787,0.0006729187,0.0006046092,0.0005752484],"domain_scores_gemma":[0.80313724,0.18428747,0.006422959,0.0021435125,0.0024774228,0.0015313004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009898096,0.0011295629,0.002890212,0.0036143009,0.0011277798,0.004992049,0.0027847956,0.0036614237,0.01434532],"category_scores_gemma":[0.09751211,0.0012227811,0.0011990423,0.0027229646,0.006994483,0.008356244,0.0024868916,0.0042110146,0.00074818445],"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.0010651081,0.0002911984,0.00963131,0.00063490885,0.00021431432,0.0003741697,0.0005081027,0.26402655,0.0014070788,0.6851859,0.0068862434,0.029775117],"study_design_scores_gemma":[0.00018906147,0.00024015151,0.0043221354,0.00021710037,0.00013348814,0.000476366,0.00042799243,0.6524806,0.00096174405,0.33842704,0.0020003943,0.00012395585],"about_ca_topic_score_codex":0.0032309913,"about_ca_topic_score_gemma":0.0018674185,"teacher_disagreement_score":0.01434532,"about_ca_system_score_codex":0.002720504,"about_ca_system_score_gemma":0.001922363,"threshold_uncertainty_score":0.052346766},"labels":[],"label_agreement":null}]}