{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":30,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":30,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"88996ac5d38d","filters":{"venue":"Mathematical Methods of Operations Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael J. Best","is_ca":true},{"name":"Jaroslava Hlouskova","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4164572100295024,"gpt":0.6420881436023647,"spread":0.2256309335728622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002942678,0.0009805906,0.001545303,0.00187348,0.0006278052,0.003541829,0.001173708,0.00177769,0.003334169],"category_scores_gemma":[0.01294309,0.00079567,0.0007143115,0.001577361,0.002742452,0.004889265,0.002548697,0.002946399,0.0006517255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435384,"about_ca_system_score_gemma":0.001240341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009773518,"about_ca_topic_score_gemma":0.000577048,"domain_scores_codex":[0.9986778,0.000773102,0.00004839612,0.0001256317,0.000260596,0.0001144483],"domain_scores_gemma":[0.995706,0.003288042,0.0002516558,0.0002846561,0.0003061189,0.0001635834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001275788,0.000009637409,0.0000822724,0.00006049598,0.00001097962,0.00002403751,0.00005015269,0.04648497,0.0003563705,0.9434748,0.00111261,0.008320947],"study_design_scores_gemma":[0.000005027704,0.000007104142,0.0001081672,0.00002786373,0.000005545146,0.00001813625,0.00001745984,0.1106395,0.0001172356,0.8868936,0.002153622,0.000006734456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02654053,0.005322573,0.9355758,0.00192311,0.000105574,0.00002750981,0.000145133,0.00006990971,0.03028997],"genre_scores_gemma":[0.7711273,0.009575211,0.188896,0.0003478888,0.0005017516,0.0002793078,0.0003566706,0.0002106861,0.02870525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003541829,"threshold_uncertainty_score":0.01556259,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Eungab Kim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.114768975797243,"gpt":0.455007958257407,"spread":0.3402389824601639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003057437,0.0004184342,0.0009553572,0.001120904,0.0007590945,0.003106975,0.001490999,0.001455171,0.004869919],"category_scores_gemma":[0.01265797,0.0007941489,0.0003772657,0.001957409,0.001196481,0.004424894,0.0007944192,0.001064039,0.0003332108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002731549,"about_ca_system_score_gemma":0.001577702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005541199,"about_ca_topic_score_gemma":0.00512275,"domain_scores_codex":[0.9989666,0.0004879874,0.00006403068,0.0001371937,0.0001825065,0.0001616119],"domain_scores_gemma":[0.9920164,0.005946679,0.0007162878,0.0002657139,0.0007174877,0.0003374021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004592519,0.0001924834,0.00127953,0.00008059879,0.00002991584,0.0001421885,0.000100231,0.888638,0.0009127451,0.08589346,0.001530636,0.02074091],"study_design_scores_gemma":[0.00003229417,0.0000445993,0.0002616181,0.00001180316,0.00001459274,0.0000246463,0.0000474719,0.9698252,0.0002406657,0.0291113,0.0003747823,0.00001105297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5658915,0.001423165,0.4082943,0.002626203,0.0001647316,0.0001462133,0.0003855391,0.0003624073,0.02070588],"genre_scores_gemma":[0.9872487,0.000415034,0.009037782,0.00005200887,0.00003369288,0.00002738182,0.00006514557,0.00002138368,0.003098902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005541199,"threshold_uncertainty_score":0.01981884,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Eungab Kim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09918178702663151,"gpt":0.3948691515617233,"spread":0.2956873645350918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342012,0.002043468,0.002784277,0.001593493,0.001019059,0.003613259,0.003360095,0.002832478,0.004971157],"category_scores_gemma":[0.006651401,0.002261201,0.001600423,0.002604388,0.001756464,0.0029843,0.001962476,0.001870818,0.0006055073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004368743,"about_ca_system_score_gemma":0.00284518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009578995,"about_ca_topic_score_gemma":0.005712983,"domain_scores_codex":[0.9987078,0.0004789773,0.00005126355,0.0001862684,0.0001988787,0.0003768371],"domain_scores_gemma":[0.9968662,0.002087332,0.0003208142,0.00008580689,0.0003487962,0.0002910574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000148228,0.00006917491,0.0001682107,0.00008278648,0.00003827349,0.00009649697,0.00007704047,0.9673997,0.001168029,0.02540028,0.0006463606,0.004705473],"study_design_scores_gemma":[0.00002300558,0.00004939405,0.000064532,0.000007792826,0.00001605985,0.00001528954,0.00002246905,0.991264,0.0001855816,0.008179569,0.0001599603,0.0000123868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320386,0.0007573957,0.8521654,0.001019658,0.00009301367,0.0002849915,0.0003546445,0.0003363029,0.01294999],"genre_scores_gemma":[0.9510169,0.0004585006,0.04116218,0.00009958551,0.00006293719,0.0002507663,0.0001533303,0.000115009,0.00668082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009578995,"threshold_uncertainty_score":0.03169757,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Opher Baron","is_ca":true},{"name":"Oded Berman","is_ca":true},{"name":"David Perry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2136188641859939,"gpt":0.4628448770691848,"spread":0.2492260128831909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007425175,0.002556119,0.003721654,0.002231202,0.001041167,0.004688286,0.006641264,0.005326819,0.01095208],"category_scores_gemma":[0.02041231,0.002485423,0.002836739,0.002438999,0.002448655,0.005389961,0.001311993,0.003069546,0.002050278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005763921,"about_ca_system_score_gemma":0.002677926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01671645,"about_ca_topic_score_gemma":0.01122196,"domain_scores_codex":[0.9965821,0.001226212,0.0002060514,0.0006558493,0.0007846262,0.0005452627],"domain_scores_gemma":[0.9848992,0.01006739,0.001627122,0.0005506086,0.002346931,0.0005087773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003894187,0.0001608063,0.0009831339,0.0004422909,0.0001153969,0.0006690234,0.0002527894,0.8509173,0.001723857,0.129133,0.003487064,0.01172593],"study_design_scores_gemma":[0.00005461917,0.0001604714,0.0005550102,0.0000363082,0.00009014914,0.00008776339,0.00004191945,0.9800683,0.00028571,0.01695015,0.001605988,0.00006357446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1452417,0.008782336,0.8030908,0.00370751,0.0007424226,0.0007059124,0.002430021,0.0008216302,0.03447778],"genre_scores_gemma":[0.8307158,0.004746198,0.05234331,0.0004266851,0.0005792401,0.00068048,0.001352392,0.0002538782,0.108902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01671645,"threshold_uncertainty_score":0.04182035,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2380313023443612,"gpt":0.4704546168576607,"spread":0.2324233145132994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004106637,0.0007250655,0.0007459103,0.0007622739,0.0005375807,0.0008441568,0.001184168,0.001002714,0.00467379],"category_scores_gemma":[0.001556514,0.0004823414,0.001011867,0.0005408894,0.001248121,0.001134005,0.001081552,0.001284371,0.0003784098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005583173,"about_ca_system_score_gemma":0.0004493617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002058922,"about_ca_topic_score_gemma":0.002442546,"domain_scores_codex":[0.9998116,0.00008244815,0.000006697016,0.00002953453,0.00004666422,0.00002307765],"domain_scores_gemma":[0.9996349,0.0001999676,0.00004350752,0.00002747059,0.00005561879,0.00003851683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000283675,0.00002696241,0.0001341927,0.00005857665,0.00003006532,0.00006927471,0.00005812723,0.5217414,0.002274108,0.4612636,0.002006982,0.01230839],"study_design_scores_gemma":[0.00001298388,0.00002339495,0.00006782807,0.000005889041,0.000006227373,0.00001703053,0.000009919563,0.8695729,0.0001683521,0.1289916,0.001114032,0.000009888789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0199781,0.0005222273,0.9613428,0.0003407947,0.0001303866,0.00002719952,0.00007104386,0.0001238853,0.01746353],"genre_scores_gemma":[0.7434062,0.001584679,0.2136114,0.000401276,0.0004451495,0.0002231017,0.0002389046,0.0002587978,0.03983046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00467379,"threshold_uncertainty_score":0.01563537,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hossein Abouee‐Mehrizi","is_ca":true},{"name":"Sahar Babri","is_ca":false},{"name":"Oded Berman","is_ca":true},{"name":"Hassan Shavandi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3506698778758426,"gpt":0.4211256901839838,"spread":0.07045581230814119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863181,0.001706291,0.003825114,0.001339959,0.001098975,0.003220861,0.002796706,0.003031962,0.003524179],"category_scores_gemma":[0.008954104,0.002476878,0.0009679007,0.002309741,0.002353415,0.004456771,0.002007658,0.002161799,0.00029102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00268366,"about_ca_system_score_gemma":0.00158473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02319387,"about_ca_topic_score_gemma":0.01483717,"domain_scores_codex":[0.9986439,0.0007269387,0.00003930356,0.0002194747,0.00008727954,0.0002830628],"domain_scores_gemma":[0.9939961,0.004431619,0.0005019007,0.0001595643,0.0003687758,0.0005419837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007890963,0.00003331851,0.0002240662,0.00001123123,0.00001700054,0.00005457863,0.00001221041,0.9966756,0.0001608961,0.001415251,0.0001343676,0.001182601],"study_design_scores_gemma":[0.00001084377,0.00002079136,0.00008900363,0.000001337103,0.000008099441,0.000004769664,0.00001051859,0.9983443,0.00005172257,0.001420242,0.00003342162,0.000005023512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6157105,0.0006491001,0.3739199,0.001430199,0.0001692773,0.0001478826,0.0002868094,0.0002983724,0.007387982],"genre_scores_gemma":[0.9781241,0.0001888561,0.01510168,0.00007284629,0.00004859431,0.00005292347,0.000103851,0.00004901842,0.006258041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02319387,"threshold_uncertainty_score":0.04611772,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Olivier Menoukeu Pamen","is_ca":false},{"name":"Romuald Hervé Momeya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1352381933958266,"gpt":0.5324272925989078,"spread":0.3971890992030812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003237666,0.001299423,0.001198221,0.0008653863,0.000858155,0.0015749,0.001233074,0.001960807,0.004351343],"category_scores_gemma":[0.005592507,0.0006098714,0.00214191,0.0006994169,0.002964544,0.002734697,0.002727272,0.00342979,0.0003974052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001542443,"about_ca_system_score_gemma":0.00156063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009119383,"about_ca_topic_score_gemma":0.000638455,"domain_scores_codex":[0.9985915,0.0006343024,0.00006837014,0.0002680268,0.0003202264,0.0001176547],"domain_scores_gemma":[0.9977769,0.001609128,0.0001798687,0.00007543488,0.0002231922,0.0001354994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001708591,0.00002924137,0.0001072125,0.0001223156,0.00003642863,0.00007074857,0.00009854367,0.04432144,0.002152163,0.947108,0.0007538213,0.005182873],"study_design_scores_gemma":[0.00002339105,0.00006038632,0.0001427627,0.00003978561,0.00001862549,0.00005925636,0.00003098622,0.32322,0.0006209585,0.6734945,0.002265597,0.00002390379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01443645,0.0008469825,0.9665713,0.00120659,0.0001017051,0.00006911515,0.00009476445,0.0000703351,0.01660269],"genre_scores_gemma":[0.8118675,0.002495577,0.1698284,0.000649667,0.0003660195,0.0006098466,0.0001809788,0.0001350429,0.01386684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004351343,"threshold_uncertainty_score":0.01712263,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","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","authors":[{"name":"Qi‐Ming He","is_ca":true},{"name":"Hao Zhang","is_ca":false},{"name":"Qingqing Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1163353833401027,"gpt":0.4869793571310019,"spread":0.3706439737908992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196966,0.00104151,0.001527694,0.001441654,0.002780523,0.004622216,0.003640936,0.002477036,0.005931114],"category_scores_gemma":[0.01207119,0.0008542056,0.0007873639,0.001873421,0.001919312,0.00420208,0.002709459,0.002371409,0.0009732994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00609242,"about_ca_system_score_gemma":0.004693848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01467258,"about_ca_topic_score_gemma":0.008928435,"domain_scores_codex":[0.997897,0.0003884592,0.0001170786,0.0004325907,0.0005205433,0.0006443247],"domain_scores_gemma":[0.9945866,0.002227871,0.0005815322,0.0004334036,0.001237391,0.0009332771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002052778,0.0004056563,0.003838587,0.0004765042,0.0001330232,0.001221355,0.000548623,0.3118981,0.01476331,0.6289458,0.01338687,0.02232928],"study_design_scores_gemma":[0.0001590606,0.0001180606,0.0002809752,0.00001730877,0.00004018059,0.0001215655,0.0000634065,0.9530963,0.001275087,0.04369833,0.001084768,0.00004497961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2118795,0.00101726,0.7600814,0.004863021,0.0007372776,0.0003786203,0.001195414,0.001209071,0.01863851],"genre_scores_gemma":[0.913147,0.0005250925,0.06496666,0.0007173181,0.0003466319,0.0001375922,0.0002678991,0.0001317424,0.01976004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01467258,"threshold_uncertainty_score":0.04420376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Zehra Eksi","is_ca":false},{"name":"Hyejin Ku","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1889138845939967,"gpt":0.4734145068552124,"spread":0.2845006222612158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004837477,0.001662794,0.003132789,0.001250108,0.0005534941,0.003517972,0.001713821,0.004117623,0.002894323],"category_scores_gemma":[0.02014847,0.001509574,0.001298517,0.001537335,0.002046964,0.00468121,0.002808076,0.002430959,0.0003100827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428054,"about_ca_system_score_gemma":0.001616224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002906547,"about_ca_topic_score_gemma":0.001555004,"domain_scores_codex":[0.9986337,0.0006664662,0.0000700237,0.0002278208,0.0002368613,0.0001651334],"domain_scores_gemma":[0.989948,0.007845051,0.0009124912,0.0003002524,0.0004351233,0.0005591299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002107946,0.000121328,0.001615502,0.0001413994,0.0002066757,0.000556429,0.00007047004,0.8479148,0.001036805,0.135395,0.002259173,0.01047162],"study_design_scores_gemma":[0.00002527097,0.00003128934,0.0002532679,0.00000527361,0.0000270803,0.0000501104,0.000009656975,0.9635473,0.000119941,0.03575499,0.000163177,0.00001260979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1569508,0.001594489,0.8257114,0.005791698,0.0002379896,0.00009188698,0.0004159061,0.0002246479,0.008981185],"genre_scores_gemma":[0.9188825,0.001556477,0.04969357,0.0004238912,0.0006373309,0.0001866508,0.0005043785,0.0001523185,0.02796284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004837477,"threshold_uncertainty_score":0.02558339,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Zvi Drezner","is_ca":false},{"name":"Jack Brimberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2240559773635387,"gpt":0.5157598582568775,"spread":0.2917038808933388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003441635,0.003107726,0.001718498,0.003091414,0.001104575,0.00325795,0.002665471,0.002867044,0.004750425],"category_scores_gemma":[0.03323837,0.001564078,0.001493286,0.005166273,0.001993938,0.00345031,0.004001163,0.002383202,0.005136299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529297,"about_ca_system_score_gemma":0.00154415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004576359,"about_ca_topic_score_gemma":0.001819856,"domain_scores_codex":[0.9920743,0.003192739,0.0003219029,0.002101343,0.001986712,0.000322969],"domain_scores_gemma":[0.9900974,0.003473863,0.0008430952,0.003053368,0.002334715,0.0001975303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004215081,0.0001502136,0.001962312,0.0004870728,0.0001090809,0.0002615346,0.0009409307,0.2997895,0.02493228,0.1152889,0.007583052,0.5480736],"study_design_scores_gemma":[0.00002117144,0.0001269085,0.0008648763,0.00006771083,0.00002799835,0.0003250772,0.0001998468,0.8912237,0.02982337,0.05972502,0.01750422,0.00009017874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004002179,0.0001297973,0.993298,0.00007806215,0.00006094138,0.00004952534,0.00006118922,0.0007714597,0.00154878],"genre_scores_gemma":[0.2083065,0.0005525947,0.7842672,0.0001012672,0.00009655937,0.0003246349,0.0003935111,0.0007355015,0.005222224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004750425,"threshold_uncertainty_score":0.01820129,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gang Li","is_ca":true},{"name":"Jiaowan Luo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5802904042036138,"gpt":0.6155566351697195,"spread":0.0352662309661057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01303817,0.003697301,0.002879092,0.006233758,0.001951689,0.007690853,0.0044393,0.004515894,0.01241086],"category_scores_gemma":[0.07952127,0.001651767,0.002785692,0.003357691,0.005189056,0.007794043,0.006562822,0.01101265,0.001773381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004315995,"about_ca_system_score_gemma":0.00359686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002781785,"about_ca_topic_score_gemma":0.002243428,"domain_scores_codex":[0.9940679,0.002521216,0.0003010735,0.0005724001,0.001552475,0.0009848952],"domain_scores_gemma":[0.9190059,0.06915522,0.003416843,0.001730782,0.004298754,0.002392408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001254119,0.0001107854,0.0003912729,0.0003514191,0.00008366996,0.00007525455,0.0003515039,0.08066474,0.00131149,0.894318,0.003796699,0.01841976],"study_design_scores_gemma":[0.00002237882,0.00004015926,0.0002900069,0.0002398458,0.00005936563,0.00006896116,0.00008160548,0.3997103,0.0008236361,0.5959111,0.002690653,0.00006197683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03034402,0.01420852,0.9104611,0.005808525,0.0007292476,0.0001230275,0.0004384126,0.0003987066,0.03748848],"genre_scores_gemma":[0.6681316,0.02742389,0.2441186,0.0026509,0.004119642,0.001256191,0.001561098,0.0008928271,0.04984525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01303817,"threshold_uncertainty_score":0.06895328,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ines Fortin","is_ca":false},{"name":"Jaroslava Hlouskova","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4281410796259599,"gpt":0.4699745742157992,"spread":0.04183349458983926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008266448,0.0005787125,0.001333211,0.0007679361,0.0005684271,0.002942095,0.001001045,0.001558632,0.01035758],"category_scores_gemma":[0.02363922,0.0002994247,0.0005516213,0.0004449289,0.002845173,0.005750304,0.002619659,0.003941212,0.0007587579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004466586,"about_ca_system_score_gemma":0.0005156627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002206032,"about_ca_topic_score_gemma":0.0002618865,"domain_scores_codex":[0.9982983,0.0006141735,0.0001056277,0.0003514024,0.0003775566,0.0002528151],"domain_scores_gemma":[0.9915343,0.003850464,0.001610069,0.001230698,0.0007359028,0.00103857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001840077,0.0007916135,0.03176496,0.0004023369,0.0005585247,0.001350485,0.001213228,0.00773665,0.003487451,0.5443071,0.02703932,0.3795083],"study_design_scores_gemma":[0.0001022841,0.0003987395,0.008824822,0.0001699871,0.0002276152,0.000981488,0.001526967,0.03182289,0.001255625,0.944019,0.01058554,0.00008502439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6599244,0.008748665,0.2095889,0.04436989,0.002781769,0.0001279266,0.000239295,0.0002564171,0.07396265],"genre_scores_gemma":[0.9804052,0.001360398,0.007479523,0.001348841,0.001279002,0.00003534784,0.0000359434,0.00005803126,0.00799793],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01035758,"threshold_uncertainty_score":0.04371768,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lara Turner","is_ca":false},{"name":"Abraham P. Punnen","is_ca":true},{"name":"Y.P. Aneja","is_ca":true},{"name":"Horst W. Hamacher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1004040725637396,"gpt":0.4622253530535669,"spread":0.3618212804898274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002790664,0.002109729,0.001630227,0.001816284,0.0009117441,0.002146393,0.001254474,0.001186828,0.01053488],"category_scores_gemma":[0.006954994,0.0006369535,0.001041816,0.003146489,0.001960234,0.003973121,0.003349728,0.002548642,0.001219757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001563515,"about_ca_system_score_gemma":0.0009855119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001518798,"about_ca_topic_score_gemma":0.001664185,"domain_scores_codex":[0.9984556,0.0007896501,0.00005810281,0.0001969529,0.0003524957,0.0001471345],"domain_scores_gemma":[0.998848,0.0006436468,0.000124679,0.0001124481,0.0001717295,0.00009954348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004927942,0.00002616165,0.0001228046,0.0001111262,0.00003084475,0.00003396905,0.00006433074,0.04517128,0.0007757586,0.9166642,0.003405299,0.03354491],"study_design_scores_gemma":[0.0000203438,0.00003183568,0.0001133525,0.00003832173,0.00001511486,0.00003216389,0.00003499481,0.09791759,0.000237043,0.8931757,0.008374576,0.000008938107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01759372,0.003106519,0.9417269,0.001078605,0.0002992174,0.00006890168,0.0001874562,0.00007565816,0.03586315],"genre_scores_gemma":[0.439824,0.009012743,0.4819304,0.00127162,0.000881266,0.0007743553,0.001114534,0.0004864641,0.0647046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053488,"threshold_uncertainty_score":0.03524268,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jonathan M. Borwein","is_ca":true},{"name":"Pierre Maréchal","is_ca":true},{"name":"David Naugler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1515667568102964,"gpt":0.4892947998065489,"spread":0.3377280429962525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002100822,0.0009052977,0.001225032,0.001436226,0.0007660592,0.00295595,0.001997235,0.001463421,0.005383191],"category_scores_gemma":[0.007757702,0.0008771518,0.001058074,0.001190906,0.002225312,0.002689854,0.003529394,0.002980673,0.00109624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001150469,"about_ca_system_score_gemma":0.001626396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001861072,"about_ca_topic_score_gemma":0.00167976,"domain_scores_codex":[0.9991072,0.0004284573,0.00003704344,0.0001141327,0.0002465996,0.00006664621],"domain_scores_gemma":[0.9974497,0.001515055,0.0001452031,0.0002708984,0.0004196792,0.0001994367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001467609,0.0001094901,0.0002826648,0.0001573601,0.0000518249,0.000098134,0.00008968608,0.2951609,0.004084039,0.6418421,0.004353345,0.05362355],"study_design_scores_gemma":[0.000008925697,0.00001471418,0.00003890729,0.000009048929,0.000004499746,0.00001858116,0.000009451362,0.8908237,0.0006763618,0.1070308,0.001355554,0.000009441776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002785082,0.0001042886,0.9946995,0.0002922017,0.0000395075,0.00001306527,0.00003873996,0.00005864569,0.001969057],"genre_scores_gemma":[0.1889174,0.0006806366,0.7977551,0.0003548698,0.0004341911,0.0001932845,0.0003025986,0.0004092953,0.01095256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005383191,"threshold_uncertainty_score":0.01800859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gülesin Sena Daş","is_ca":false},{"name":"Fatma Gzara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1762174108771726,"gpt":0.4503761619334017,"spread":0.2741587510562291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006086358,0.001107011,0.001247019,0.001227596,0.0005689407,0.0009956823,0.0009814472,0.001018653,0.006105919],"category_scores_gemma":[0.001378628,0.0005530039,0.0007691419,0.001674477,0.0004159119,0.0005967277,0.0007422631,0.001128268,0.0006375706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006021122,"about_ca_system_score_gemma":0.001375264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007875719,"about_ca_topic_score_gemma":0.009696705,"domain_scores_codex":[0.9995969,0.0001594427,0.00001338756,0.00004531619,0.0001061132,0.00007881411],"domain_scores_gemma":[0.9992131,0.0004566546,0.00005773946,0.00004479962,0.0001874253,0.00004024384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008862332,0.0001178387,0.0002540429,0.0001480112,0.00005000217,0.0000652918,0.00003213663,0.9297607,0.002123754,0.003283438,0.002937795,0.06113831],"study_design_scores_gemma":[0.00001156023,0.00003024533,0.0000722504,0.000005471915,0.000009585093,0.000008777591,0.000008178509,0.9978291,0.0003500844,0.001352703,0.0003180695,0.00000390213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03994192,0.0006556471,0.9479262,0.0002695913,0.0001877532,0.0002023801,0.0004425774,0.0007176414,0.009656326],"genre_scores_gemma":[0.5358673,0.0004999621,0.4544405,0.0002778633,0.0001062208,0.0004578375,0.001061721,0.0002103867,0.007078171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007875719,"threshold_uncertainty_score":0.02042639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xikui Wang","is_ca":true},{"name":"Miķelis Bickis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5018446804662678,"gpt":0.6032521031918505,"spread":0.1014074227255827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01334829,0.003820112,0.007636277,0.001823144,0.001360618,0.00725312,0.005388073,0.009102272,0.008731729],"category_scores_gemma":[0.04281554,0.002430972,0.002286056,0.002962945,0.005125827,0.007060435,0.003255745,0.005994548,0.002449199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002422548,"about_ca_system_score_gemma":0.001336567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005899195,"about_ca_topic_score_gemma":0.003891337,"domain_scores_codex":[0.9920358,0.004626859,0.0003759732,0.001406976,0.0004922775,0.001062166],"domain_scores_gemma":[0.9318902,0.05793292,0.005233355,0.002204049,0.00193357,0.0008060219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007072025,0.000187655,0.001644849,0.0002360479,0.0002870785,0.0002993444,0.0002064036,0.8491155,0.0002836902,0.1373985,0.001573299,0.008060481],"study_design_scores_gemma":[0.0001297854,0.00009363299,0.0002462106,0.00003433047,0.00009309856,0.00003867071,0.00005496741,0.9436342,0.0001422702,0.05510551,0.000378759,0.00004850695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1220695,0.002587455,0.8621768,0.003173064,0.0003921879,0.0002842402,0.001239593,0.0005759908,0.007501136],"genre_scores_gemma":[0.9274741,0.00213276,0.04058844,0.000604392,0.0005329564,0.0008393444,0.0008126536,0.00008760778,0.02692783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01334829,"threshold_uncertainty_score":0.07059336,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergio M. Focardi","is_ca":true},{"name":"Frank J. Fabozzi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.228050201469345,"gpt":0.4094744795258505,"spread":0.1814242780565055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107215,0.001071898,0.00124597,0.00203284,0.001313866,0.003860797,0.0009784936,0.002700713,0.008191349],"category_scores_gemma":[0.008053657,0.0004770909,0.0005149095,0.003075552,0.007770077,0.009172045,0.003396462,0.004450756,0.001218102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002026699,"about_ca_system_score_gemma":0.001239706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006384847,"about_ca_topic_score_gemma":0.005926837,"domain_scores_codex":[0.99931,0.000291673,0.0000347279,0.0001288669,0.0001801401,0.00005448366],"domain_scores_gemma":[0.9978991,0.001181312,0.0001828296,0.0001616669,0.0003630146,0.0002120044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001198534,0.000008391246,0.0001793534,0.00003508437,0.000009690806,0.00003030179,0.0002290454,0.0005092887,0.0000702125,0.9657812,0.01997002,0.01316538],"study_design_scores_gemma":[0.000005306149,0.000005700523,0.0001876102,0.00005940177,0.000008110032,0.0000311099,0.0001354593,0.001577841,0.00006265067,0.9292131,0.0687045,0.00000922618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.03910147,0.3166603,0.2497378,0.1881822,0.02382813,0.00006249415,0.0003025825,0.0001752994,0.1819497],"genre_scores_gemma":[0.4420823,0.1333323,0.1145317,0.02213787,0.02086831,0.000224229,0.0002059478,0.00058031,0.2660369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008191349,"threshold_uncertainty_score":0.02740276,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexander Engau","is_ca":false},{"name":"Miguel F. Anjos","is_ca":true},{"name":"Immanuel M. Bomze","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1633956873692615,"gpt":0.5237032706965733,"spread":0.3603075833273118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507953,0.0009363314,0.00129877,0.0008152984,0.0006702956,0.001166105,0.002104722,0.001440743,0.005764388],"category_scores_gemma":[0.003428124,0.0008706386,0.0009234208,0.001300955,0.0008592907,0.001166304,0.00172297,0.002189775,0.0009431959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004774876,"about_ca_system_score_gemma":0.001449601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00331109,"about_ca_topic_score_gemma":0.003921752,"domain_scores_codex":[0.9990975,0.0003585163,0.00003399082,0.00008673174,0.0003555469,0.00006780175],"domain_scores_gemma":[0.9991962,0.000538021,0.0000408296,0.0000476192,0.0001421499,0.00003519987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002509986,0.0002381284,0.0005263281,0.0002270691,0.00005511425,0.0001433987,0.0002098108,0.733515,0.006388599,0.06506217,0.00393045,0.1894529],"study_design_scores_gemma":[0.00002612358,0.00003999125,0.00004720856,0.00001128942,0.000007613307,0.00001500433,0.00001375245,0.9921416,0.0007268657,0.005925104,0.001037957,0.000007496718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004741551,0.0000528966,0.992971,0.00005310824,0.00002020624,0.00005837658,0.00002647451,0.00007309707,0.002003277],"genre_scores_gemma":[0.08515362,0.0001096993,0.9115521,0.00009097402,0.00002830882,0.0003352118,0.0001521998,0.0001614842,0.002416373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005764388,"threshold_uncertainty_score":0.01928383,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Behzad Hezarkhani","is_ca":false},{"name":"Wiesław Kubiak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.103137110764168,"gpt":0.4079427460139822,"spread":0.3048056352498142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003493521,0.001674608,0.002264851,0.000983365,0.00102391,0.003627246,0.00226174,0.003882728,0.01543917],"category_scores_gemma":[0.01390418,0.0008854442,0.001353058,0.001152787,0.003091471,0.007842075,0.002723394,0.003232184,0.0009359524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001493609,"about_ca_system_score_gemma":0.0009091205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001629318,"about_ca_topic_score_gemma":0.001180392,"domain_scores_codex":[0.9978068,0.001247236,0.0001269597,0.0002660399,0.0002147792,0.0003381823],"domain_scores_gemma":[0.9865284,0.01019445,0.00117341,0.0006424986,0.0004148467,0.001046278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000321113,0.00008789186,0.0003651281,0.00009862336,0.00007219287,0.0005479368,0.0002889723,0.09994868,0.0004469118,0.8904962,0.002272967,0.005053307],"study_design_scores_gemma":[0.0002620608,0.00018516,0.0003471547,0.00003608903,0.00007526114,0.0003855655,0.0003521644,0.3296055,0.0002120961,0.666053,0.002424226,0.00006171525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4321326,0.0009380066,0.438012,0.004360381,0.0003823176,0.000242992,0.0005570024,0.0001920601,0.1231826],"genre_scores_gemma":[0.9417238,0.0005717393,0.01318457,0.0002131147,0.0001652392,0.0001751929,0.0001190306,0.00003798211,0.04380936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01543917,"threshold_uncertainty_score":0.05164909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Nickel; Computer science; Materials science","authors":[{"name":"Vedat Verter","is_ca":true},{"name":"َAlper Murat","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1255455380681576,"gpt":0.4706686301258944,"spread":0.3451230920577368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002016772,0.001208732,0.002215991,0.002842654,0.001326914,0.003742728,0.002404956,0.002966454,0.01527209],"category_scores_gemma":[0.006588477,0.0008395987,0.001533514,0.005630097,0.002680468,0.01075383,0.004363946,0.002680919,0.003259689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001700289,"about_ca_system_score_gemma":0.001631484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003843205,"about_ca_topic_score_gemma":0.003644082,"domain_scores_codex":[0.998713,0.000415761,0.00008195858,0.0002487037,0.0003803801,0.0001601983],"domain_scores_gemma":[0.9983379,0.0007635335,0.0001370322,0.0002562612,0.0003894069,0.0001158875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006808517,0.00003420691,0.0004618028,0.0002837548,0.00005778522,0.0001579119,0.0001697126,0.03699963,0.0006886399,0.8804376,0.02085444,0.05978645],"study_design_scores_gemma":[0.00002145978,0.00003423028,0.0002955329,0.0001055509,0.00008164878,0.0001734246,0.0001556351,0.1610091,0.001052828,0.8068994,0.0301034,0.00006769432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004518991,0.006468907,0.9687744,0.005362682,0.0004808129,0.00003787535,0.0002138071,0.0001372738,0.01400524],"genre_scores_gemma":[0.2963353,0.02815817,0.6050583,0.001780441,0.001951959,0.0003948495,0.000905261,0.0005120992,0.06490362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01527209,"threshold_uncertainty_score":0.05109018,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yu Yuan","is_ca":false},{"name":"Zhibin Liang","is_ca":false},{"name":"Xia Han","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2729761120144579,"gpt":0.4414852252801953,"spread":0.1685091132657374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005375178,0.001731673,0.001864942,0.001094864,0.0004968771,0.003183982,0.001897102,0.003306655,0.002827989],"category_scores_gemma":[0.01686503,0.001230338,0.0008953123,0.0008565824,0.002029112,0.002844344,0.002080378,0.002091254,0.0002804339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002451184,"about_ca_system_score_gemma":0.002059629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004353698,"about_ca_topic_score_gemma":0.001922691,"domain_scores_codex":[0.9981438,0.0009318808,0.00008124258,0.0003200716,0.0002680723,0.0002548691],"domain_scores_gemma":[0.9855797,0.01137627,0.00110815,0.0004248304,0.0007213863,0.0007896605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003904419,0.00008274191,0.001322879,0.0001735957,0.0001025624,0.0001766481,0.0001207363,0.9282781,0.002999813,0.05805055,0.0008482327,0.007453629],"study_design_scores_gemma":[0.0000134989,0.00004116168,0.0002694383,0.00000941746,0.00001710536,0.00002517286,0.0000114773,0.9888094,0.000285522,0.01041458,0.00009102858,0.0000122773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2216881,0.0009339512,0.7686311,0.002010625,0.00009781319,0.00008910154,0.0001633261,0.0003310897,0.006054956],"genre_scores_gemma":[0.9546396,0.0004737805,0.03588742,0.0001657762,0.00008956537,0.00009163638,0.0001306252,0.0001575902,0.008363951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005375178,"threshold_uncertainty_score":0.028427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Oleksandr Shlakhter","is_ca":true},{"name":"Chi-Guhn Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2714919902690478,"gpt":0.5351392337457531,"spread":0.2636472434767053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003059841,0.001199762,0.001964431,0.0009530113,0.0006172598,0.001356921,0.002182053,0.001908071,0.004818671],"category_scores_gemma":[0.01414442,0.001124874,0.0008908933,0.0008012196,0.001726407,0.002004999,0.002229806,0.003068274,0.0007200667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001755634,"about_ca_system_score_gemma":0.00303107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005611167,"about_ca_topic_score_gemma":0.004629883,"domain_scores_codex":[0.9985541,0.0007613783,0.00006892016,0.0001617067,0.0003230649,0.0001309123],"domain_scores_gemma":[0.9910773,0.00704517,0.0004311645,0.0003849308,0.0008085881,0.0002528536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001081847,0.00005985412,0.0002623534,0.0000662176,0.00003950291,0.00003166221,0.00005498859,0.9143505,0.0004039165,0.05812671,0.000925759,0.02557033],"study_design_scores_gemma":[0.00001391378,0.00001092267,0.00002079382,0.000004406317,0.00000263976,0.000003605992,0.000001732575,0.9852663,0.00007529038,0.01441442,0.000182551,0.000003476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01102688,0.0002834926,0.986426,0.0001960745,0.00009327294,0.00004528927,0.00002982845,0.0001609687,0.001738231],"genre_scores_gemma":[0.5207879,0.000606539,0.4669978,0.0002488944,0.0002265649,0.0006921596,0.0002169138,0.0002802026,0.009943084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005611167,"threshold_uncertainty_score":0.01618212,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Arash Khatibi","is_ca":false},{"name":"Golshid Baharian","is_ca":true},{"name":"Banafsheh Behzad","is_ca":false},{"name":"Sheldon H. Jacobson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.26806749435509,"gpt":0.4836843778956902,"spread":0.2156168835406002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031197,0.001063579,0.001147177,0.0008802233,0.0006719086,0.001550088,0.001870636,0.001039553,0.01284835],"category_scores_gemma":[0.008528051,0.0005781093,0.001630504,0.001574297,0.001222094,0.003296984,0.002119585,0.002318643,0.001079697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001102004,"about_ca_system_score_gemma":0.001943746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002137006,"about_ca_topic_score_gemma":0.002707219,"domain_scores_codex":[0.9978684,0.001142356,0.0001034137,0.0003958768,0.0003196822,0.0001703319],"domain_scores_gemma":[0.9956761,0.002356068,0.0006147384,0.0004788606,0.0004922445,0.0003820876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001519501,0.0001599885,0.0004987924,0.0001393421,0.00005613785,0.0001451756,0.0001216934,0.2182884,0.0007074624,0.7433465,0.005677252,0.03070751],"study_design_scores_gemma":[0.00004166956,0.00007840609,0.0002593961,0.00001834896,0.00001911556,0.00009544273,0.00003595435,0.4554183,0.0001551812,0.5367242,0.007138324,0.00001568714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03810559,0.0005998548,0.9337925,0.001230281,0.0002738194,0.00009327153,0.0003761694,0.0001351284,0.02539342],"genre_scores_gemma":[0.6271816,0.002164198,0.2898848,0.0006519763,0.001434838,0.0005312731,0.001410164,0.0002588737,0.07648221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01284835,"threshold_uncertainty_score":0.04298198,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Wei Li","is_ca":false},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1046753650126284,"gpt":0.4631989886852775,"spread":0.3585236236726492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423356,0.0008416349,0.001576754,0.0005786653,0.0006015033,0.001033535,0.001308886,0.001218996,0.002268221],"category_scores_gemma":[0.003713047,0.001100901,0.0009797572,0.0009484541,0.0007932826,0.001258208,0.0007334764,0.0007600898,0.0002234914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008727953,"about_ca_system_score_gemma":0.001211496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001245163,"about_ca_topic_score_gemma":0.001309055,"domain_scores_codex":[0.9993508,0.0002576884,0.00004107777,0.000105135,0.0001225119,0.0001227103],"domain_scores_gemma":[0.9975211,0.001662781,0.0003611033,0.0001355086,0.0001657927,0.0001536806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002206136,0.00005172188,0.0001859153,0.0001027766,0.00002659608,0.00009839673,0.00002215784,0.9784437,0.003500463,0.01308754,0.0002564648,0.00400359],"study_design_scores_gemma":[0.00002622359,0.00006334829,0.00009964137,0.000002641302,0.000005941083,0.00001108116,0.000004619209,0.9934676,0.0005756022,0.005621078,0.0001168826,0.000005310681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2252716,0.0003489212,0.7712224,0.0003320169,0.0001396309,0.0001353914,0.0001569424,0.0003469585,0.002046149],"genre_scores_gemma":[0.9258384,0.0002806252,0.07089629,0.00006615835,0.00009328746,0.0001235649,0.0001258421,0.0001121926,0.002463698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002268221,"threshold_uncertainty_score":0.007587969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Dmitry Krass","is_ca":true},{"name":"David Perry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2987104621699893,"gpt":0.463743073816939,"spread":0.1650326116469497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626792,0.0009579777,0.002146477,0.001466005,0.001146045,0.00329665,0.002769689,0.003071149,0.01543516],"category_scores_gemma":[0.005607167,0.0007223816,0.00111977,0.002031452,0.001632406,0.003862589,0.001033177,0.001700256,0.002163144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002126845,"about_ca_system_score_gemma":0.002249936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007260873,"about_ca_topic_score_gemma":0.003983503,"domain_scores_codex":[0.9992024,0.0001942956,0.00004159531,0.0001889712,0.0001650121,0.0002077327],"domain_scores_gemma":[0.9978222,0.0008173027,0.0003736432,0.0001781722,0.0004509297,0.0003578583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007324803,0.0003531959,0.001233588,0.0004008938,0.0001021951,0.00252809,0.000254278,0.584062,0.002832501,0.358204,0.01552389,0.03377282],"study_design_scores_gemma":[0.0001633964,0.0001628211,0.0005820967,0.00003125253,0.00008591615,0.0003579739,0.0001020053,0.8989807,0.0005401131,0.09302277,0.005912051,0.00005883173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4905347,0.003464266,0.3453754,0.007661926,0.0008450799,0.0004702712,0.003370982,0.00117214,0.1471051],"genre_scores_gemma":[0.891825,0.001097206,0.008669059,0.0001996447,0.0002255137,0.0001528282,0.0005053327,0.0001127624,0.09721273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01543516,"threshold_uncertainty_score":0.05163574,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"H. A. Eiselt","is_ca":true},{"name":"C.-L. Sandblom","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2217521175322165,"gpt":0.538634412973693,"spread":0.3168822954414765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002407244,0.001222449,0.001940021,0.001757296,0.001271426,0.003472495,0.002456099,0.002124467,0.01016304],"category_scores_gemma":[0.01269771,0.0009132239,0.001213765,0.002294452,0.002825274,0.004793786,0.002863171,0.006258923,0.003996894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435925,"about_ca_system_score_gemma":0.002188524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002301372,"about_ca_topic_score_gemma":0.001645326,"domain_scores_codex":[0.9984558,0.000591017,0.00007176286,0.0001780687,0.0005898016,0.0001135546],"domain_scores_gemma":[0.9976683,0.001446619,0.00007672723,0.0003022496,0.000376991,0.0001290179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001004279,0.00005553133,0.0001559069,0.0002119116,0.00005077708,0.00003026476,0.00008456501,0.03700507,0.0006096633,0.8191744,0.01023183,0.1322896],"study_design_scores_gemma":[0.00006601487,0.00004311627,0.0000761296,0.00006847186,0.00002390451,0.00005684144,0.00001789711,0.3082722,0.0007232874,0.6707212,0.01990495,0.00002602584],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001233211,0.0008386595,0.9903879,0.000423571,0.000201071,0.00004467715,0.00003866124,0.0002412922,0.006591028],"genre_scores_gemma":[0.08468119,0.002054494,0.8908483,0.0005491796,0.0003609133,0.0004272757,0.000278731,0.0006581014,0.02014172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01016304,"threshold_uncertainty_score":0.03399873,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marcos Escobar‐Anel","is_ca":true},{"name":"Michel Kschonnek","is_ca":false},{"name":"Rudi Zagst","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.17448148640032,"gpt":0.4240910821767344,"spread":0.2496095957764144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002528689,0.001247368,0.001601503,0.0006090205,0.0003680208,0.00259244,0.001181729,0.001914401,0.003435933],"category_scores_gemma":[0.008434142,0.0005222402,0.0009132618,0.0008770578,0.002325371,0.002902331,0.001837709,0.002377397,0.000452572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180349,"about_ca_system_score_gemma":0.0009422092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001135108,"about_ca_topic_score_gemma":0.0005011339,"domain_scores_codex":[0.9988606,0.0006413912,0.00003928075,0.0001832057,0.0001374207,0.0001380848],"domain_scores_gemma":[0.9982046,0.001176435,0.0001647573,0.0001312816,0.0001775242,0.0001453889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009558153,0.00008413926,0.0004729551,0.0001246713,0.00006368536,0.0004443006,0.0000964082,0.2371815,0.003012466,0.7463219,0.002056638,0.01004572],"study_design_scores_gemma":[0.00004685752,0.00006059565,0.0003296996,0.00003753477,0.00002025863,0.0001241438,0.00003046377,0.6888077,0.001012592,0.3076895,0.001821078,0.00001950918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08197433,0.0008203986,0.892469,0.002372569,0.0001150504,0.00005288106,0.0001829869,0.0000803633,0.02193239],"genre_scores_gemma":[0.9237088,0.001192297,0.05818388,0.0003522292,0.0002141306,0.0001823106,0.0001996968,0.0001184835,0.01584816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003435933,"threshold_uncertainty_score":0.01337314,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Paweł Kalczyński","is_ca":false},{"name":"Jack Brimberg","is_ca":true},{"name":"Zvi Drezner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1725629340062996,"gpt":0.422044377953618,"spread":0.2494814439473185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009898096,0.001129563,0.002890212,0.003614301,0.00112778,0.004992049,0.002784796,0.003661424,0.01434532],"category_scores_gemma":[0.09751211,0.001222781,0.001199042,0.002722965,0.006994483,0.008356244,0.002486892,0.004211015,0.0007481845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002720504,"about_ca_system_score_gemma":0.001922363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003230991,"about_ca_topic_score_gemma":0.001867419,"domain_scores_codex":[0.9960026,0.001938869,0.0002057879,0.0006729187,0.0006046092,0.0005752484],"domain_scores_gemma":[0.8031372,0.1842875,0.006422959,0.002143512,0.002477423,0.0015313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001065108,0.0002911984,0.00963131,0.0006349089,0.0002143143,0.0003741697,0.0005081027,0.2640266,0.001407079,0.6851859,0.006886243,0.02977512],"study_design_scores_gemma":[0.0001890615,0.0002401515,0.004322135,0.0002171004,0.0001334881,0.000476366,0.0004279924,0.6524806,0.0009617441,0.338427,0.002000394,0.0001239558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4022165,0.004810894,0.5135677,0.01765317,0.0007354749,0.0003556477,0.001556608,0.0004045315,0.0586994],"genre_scores_gemma":[0.9699617,0.003773008,0.01496407,0.0004799556,0.001189439,0.000289251,0.0004663797,0.00009617123,0.008779869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01434532,"threshold_uncertainty_score":0.05234677,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Dayou Mao","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1063795417632415,"gpt":0.4923671252131184,"spread":0.3859875834498769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009078381,0.0007219947,0.0006220093,0.0005902045,0.000620939,0.002376546,0.0008354943,0.0009699741,0.01202096],"category_scores_gemma":[0.00457244,0.0005197332,0.0007380058,0.0006361873,0.001261442,0.003513216,0.002538694,0.002352594,0.003716212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003093123,"about_ca_system_score_gemma":0.001138315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002180389,"about_ca_topic_score_gemma":0.002379705,"domain_scores_codex":[0.99935,0.0001287911,0.00004750038,0.0001724671,0.0002467322,0.00005444419],"domain_scores_gemma":[0.9989907,0.0003547377,0.00005527925,0.0001958865,0.0003195691,0.00008387622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001806145,0.00009840707,0.001149578,0.000559638,0.00006567139,0.0001301496,0.000519713,0.02930605,0.01552208,0.1716784,0.02347487,0.7573148],"study_design_scores_gemma":[0.00009817982,0.000171153,0.001192576,0.0001974913,0.00006009298,0.0008158624,0.001316093,0.3293871,0.03316494,0.5747253,0.05876577,0.0001055238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01051964,0.0001192722,0.9834562,0.0005209592,0.00009530719,0.00005366676,0.0001612132,0.000592182,0.004481551],"genre_scores_gemma":[0.06129835,0.0003910197,0.9320129,0.0001026265,0.00003735989,0.000102726,0.0005079492,0.0005592375,0.004987891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01202096,"threshold_uncertainty_score":0.04021406,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wenjing Guo","is_ca":true},{"name":"XU Chengming","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1531988684995458,"gpt":0.4507471260640896,"spread":0.2975482575645438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005234108,0.00317832,0.003217897,0.00546253,0.002824984,0.003038423,0.00624575,0.007899735,0.03732053],"category_scores_gemma":[0.06848849,0.001315839,0.003350009,0.005648705,0.003342459,0.002832318,0.002997947,0.0086462,0.01716243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003566609,"about_ca_system_score_gemma":0.00326922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01266562,"about_ca_topic_score_gemma":0.008761441,"domain_scores_codex":[0.9938135,0.001079812,0.0008430158,0.001020631,0.002737278,0.0005057475],"domain_scores_gemma":[0.9620051,0.01143961,0.001485052,0.00477858,0.01938074,0.0009107754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000160676,0.0000157606,0.0002479262,0.0005082074,0.00008457006,0.0002661624,0.00005837865,0.001083778,0.0002980485,0.009517015,0.9759985,0.0117609],"study_design_scores_gemma":[0.0003756484,0.0001007799,0.003788502,0.000629672,0.0004848603,0.001121221,0.00009974284,0.03065439,0.004568013,0.06038348,0.8975133,0.0002803729],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0009963273,0.002647865,0.01777791,0.051176,0.9202421,0.00004984998,0.001894137,0.001501896,0.003713847],"genre_scores_gemma":[0.07736232,0.008124863,0.02469622,0.07059372,0.7196566,0.000434273,0.003856138,0.002777149,0.09249871],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.03732053,"threshold_uncertainty_score":0.1248496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}