{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"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"},"query_hash":"7100f6656e6c","filters":{"venue":"OPSEARCH"}},"results":[{"id":"W2737203876","doi":"10.1007/bf03399222","title":"Location-Arc Routing Problems","year":2001,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"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; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Arc routing; Computer science; Arc (geometry); Graph; Routing (electronic design automation); Vehicle routing problem; Routing algorithm; Garbage collection; Transport engineering; Operations research; Theoretical computer science; Computer network; Garbage; Mathematics; Routing protocol; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03531048059759525,"gpt":0.3021570851547711,"spread":0.2668466045571759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005987716,0.00008540598,0.00008754025,0.00008277434,0.00008787502,0.00005804358,0.0001494784,0.0000539503,0.0001964958],"category_scores_gemma":[0.0001185533,0.00009250898,0.0000208772,0.0006090829,0.00002218711,0.0001076409,0.00003240757,0.0001811465,0.0002196245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006807896,"about_ca_system_score_gemma":0.00002455236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001873734,"about_ca_topic_score_gemma":0.000004138289,"domain_scores_codex":[0.9991438,0.00005472136,0.0001668808,0.0001347507,0.0001977794,0.0003020644],"domain_scores_gemma":[0.9995124,0.000086019,0.00001327122,0.0002120187,0.0001015117,0.00007478978],"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.000001790483,0.00001372482,0.01199475,0.00005968612,0.00001423279,0.000004157405,0.0004724634,0.9460843,0.002301827,0.0007882969,0.0003796404,0.03788517],"study_design_scores_gemma":[0.0001937528,0.00001203456,0.004551901,0.0000470662,0.000003391412,0.00001655931,0.0000653915,0.9888493,0.00110615,0.0001838914,0.00481608,0.0001544249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08094822,0.000294454,0.8563023,0.0003266006,0.0002398272,0.000283666,0.000001055474,0.000909626,0.06069421],"genre_scores_gemma":[0.951463,0.00006120416,0.04694508,0.00002581519,0.0001131403,0.00002088257,0.000005376437,0.00004200579,0.001323448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8705148,"threshold_uncertainty_score":0.3772407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2774074136","doi":"10.1007/bf03398807","title":"Revisiting Dinkelbach-type algorithms for generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":25,"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","funders":"","keywords":"Iterated function; Computer science; Type (biology); Mathematical optimization; Algorithm; Fractional programming; Applied mathematics; Mathematics; Nonlinear programming; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.09134289677039446,"gpt":0.3276415467877081,"spread":0.2362986500173136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808876,0.00008719804,0.0001213626,0.00004499537,0.0001513153,0.00004076567,0.00007962403,0.00005470838,0.0001619183],"category_scores_gemma":[0.00008562434,0.00008370205,0.00005520186,0.0001926721,0.00003492365,0.00009503938,0.00001777113,0.0001193218,0.00006218383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003344166,"about_ca_system_score_gemma":0.00001881455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002595976,"about_ca_topic_score_gemma":1.971123e-7,"domain_scores_codex":[0.9992566,0.00001277448,0.0001625184,0.0001205927,0.0001819917,0.0002655057],"domain_scores_gemma":[0.9996015,0.00007592628,0.0000137887,0.0001041935,0.0001153369,0.00008925033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007297783,0.0002923282,0.001374557,0.001427886,0.0002476149,0.00003653441,0.001134257,0.03950836,0.003799919,0.0272735,0.009779994,0.9150521],"study_design_scores_gemma":[0.0007774543,0.00007197916,0.0001401559,0.00004987741,0.00001582899,0.0000465055,0.00004969117,0.9136517,0.0008605419,0.001011637,0.08303124,0.0002933705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03005793,0.0005678822,0.9550681,0.0003853579,0.0004848932,0.001164382,0.000006650607,0.001035511,0.0112293],"genre_scores_gemma":[0.2911163,0.0002436402,0.7040289,0.00007470795,0.0007668411,0.0002280437,0.0001542269,0.00009945797,0.003287867],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9147587,"threshold_uncertainty_score":0.341327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967352043","doi":"10.1007/s12597-013-0128-3","title":"Computational analysis of bulk service queue with Markovian arrival process: MAP/R(a, b)/1 queue","year":2013,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"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","funders":"","keywords":"Markovian arrival process; Computer science; Queueing theory; Applied mathematics; Queue; Fork–join queue; Laplace transform; Bulk queue; Markov process; Mathematical optimization; Mathematics; Statistical physics; Algorithm; Mathematical analysis; Queue management system; Physics; Statistics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0108566462305342,"gpt":0.2552764207603264,"spread":0.2444197745297922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004778737,0.0002006145,0.0004064731,0.0008918293,0.0001773822,0.0001850238,0.0004417589,0.00005825357,0.002911387],"category_scores_gemma":[0.00007714699,0.0001700559,0.000121246,0.003970221,0.0001206767,0.001051861,0.0001356463,0.0001838455,0.0004582944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003603134,"about_ca_system_score_gemma":0.00005541286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001785187,"about_ca_topic_score_gemma":0.0004041548,"domain_scores_codex":[0.9982361,0.00003542765,0.0003360707,0.0004029124,0.0006377414,0.0003517319],"domain_scores_gemma":[0.9979916,0.000146432,0.0002464401,0.0003649997,0.001219398,0.00003109489],"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.0002995999,0.0003892692,0.1050042,0.001026781,0.003155287,0.00002142511,0.0006265412,0.8499867,0.0005409315,0.03340155,0.0008628391,0.00468493],"study_design_scores_gemma":[0.0007324676,0.000027921,0.04142121,0.000106056,0.001451651,0.000001692412,0.001513263,0.8972476,0.0001302193,0.05572838,0.001090682,0.000548831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9727724,0.00002067157,0.01118576,0.002683032,0.00003809725,0.0003939865,0.000008697372,0.0001204491,0.01277692],"genre_scores_gemma":[0.995829,8.509194e-7,0.002064957,0.0009573355,0.0001701754,0.00005327963,0.0001894248,0.00003284364,0.0007021292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06358296,"threshold_uncertainty_score":0.9980001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028182461","doi":"10.1007/s12597-009-0011-4","title":"Solving bilevel programming problems with multicriteria optimization techniques","year":2009,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"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; Group for Research in Decision Analysis","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Intersection (aeronautics); Relation (database); Class (philosophy); Multi-objective optimization; Computer science; Pareto principle; Pareto optimal; Optimization problem; Mathematics; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01944054381970481,"gpt":0.2741314883152999,"spread":0.254690944495595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303201,0.00009552807,0.0001016486,0.0001877135,0.0001780537,0.0004098978,0.0003612462,0.0000396252,0.00004470155],"category_scores_gemma":[0.00003119533,0.00007561543,0.00002949891,0.0008302846,0.00002002036,0.0005943053,0.00005861907,0.0000852823,0.000009294012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003708431,"about_ca_system_score_gemma":0.00006887697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002026144,"about_ca_topic_score_gemma":0.000002680067,"domain_scores_codex":[0.9989468,0.00004833745,0.0001612149,0.0002881035,0.000330175,0.0002253965],"domain_scores_gemma":[0.9992979,0.00002793001,0.00005584818,0.0002511495,0.000294883,0.00007232311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002120812,0.0005310137,0.001323441,0.00003813714,0.00005814437,0.00001462698,0.001831854,0.3441251,0.002999173,0.0524401,0.0002618447,0.5963554],"study_design_scores_gemma":[0.0001570024,0.0001435845,0.0007147472,0.0000309206,0.000005297062,0.000007236471,0.00001095217,0.9966426,0.0009570934,0.0003465984,0.0008412891,0.0001426013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001267475,0.00001430195,0.9957051,0.002220693,0.00001510347,0.0002454625,6.331971e-7,0.0002559566,0.001416003],"genre_scores_gemma":[0.1568087,0.00001224101,0.8425876,0.0001892749,0.00003063105,0.00002567925,0.00001303974,0.000005825792,0.0003269142],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6525176,"threshold_uncertainty_score":0.3952654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2312556230","doi":"10.1007/s12597-016-0256-7","title":"Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems","year":2016,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Mathematical optimization; Particle swarm optimization; Benchmark (surveying); Multi-swarm optimization; Arithmetic function; Computer science; Premature convergence; Simplex algorithm; Algorithm; Metaheuristic; Convergence (economics); Population; Mathematics; Linear programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03600050729763214,"gpt":0.3165843001733349,"spread":0.2805837928757028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997449,0.0002109042,0.0002337464,0.00009835481,0.0003491274,0.0006680064,0.0008527702,0.0001031519,0.0002892025],"category_scores_gemma":[0.0007898108,0.0001434474,0.0000628361,0.00107446,0.0002144487,0.0009852407,0.0003463206,0.0001053121,0.00005222427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002272078,"about_ca_system_score_gemma":0.0003625466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001807636,"about_ca_topic_score_gemma":0.00000542451,"domain_scores_codex":[0.9968736,0.0001294895,0.0003894743,0.0007500116,0.001001285,0.0008562017],"domain_scores_gemma":[0.9974037,0.0004597681,0.0001008828,0.0006889815,0.001011723,0.0003349655],"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.00008555852,0.0001581594,0.0006066139,0.00003564851,0.00003375763,0.000006755745,0.00007922144,0.9473294,0.0001070615,0.0270811,0.0004344937,0.02404222],"study_design_scores_gemma":[0.001968211,0.0002769556,0.0001594737,0.00003861842,0.00000859341,0.00001758254,0.000009101714,0.9945036,0.00122885,0.0008008142,0.0007465368,0.0002416498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004311392,0.00003089578,0.994083,0.003376667,0.0001046289,0.0009797643,0.00003102071,0.0001983901,0.0007644512],"genre_scores_gemma":[0.08046833,0.00003832744,0.9178268,0.0001157868,0.00009735738,0.000234154,0.00001617651,0.00003383232,0.001169254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08003719,"threshold_uncertainty_score":0.6441602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2969963949","doi":"10.1007/s12597-019-00405-z","title":"Airplane boarding optimization considering reserved seats and passengers’ carry-on bags","year":2019,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Transportation and Mobility Innovations","field":"Engineering","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 Calgary","funders":"","keywords":"Airplane; Carry (investment); Computer science; Integer programming; Operations research; Transport engineering; Business; Engineering; Algorithm; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.01450194598291363,"gpt":0.2286421044232367,"spread":0.214140158440323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001622642,0.00007854633,0.00009496451,0.0001080569,0.00005569985,0.00003786408,0.00004554821,0.00005267595,0.0002006291],"category_scores_gemma":[0.00002494668,0.00008539481,0.00001643879,0.0001835448,0.00001942306,0.0001095581,0.000005998875,0.0001530301,0.00004160765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003081247,"about_ca_system_score_gemma":0.00001504678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001856407,"about_ca_topic_score_gemma":0.00002802414,"domain_scores_codex":[0.9993989,0.00001512216,0.0001311166,0.0001397179,0.0001488541,0.0001662171],"domain_scores_gemma":[0.999645,0.0000767121,0.000009442655,0.0001610823,0.00005445863,0.00005333472],"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.00001457367,0.00001343969,0.02684985,0.0001459402,0.00003776814,0.000006168414,0.0007455009,0.9539231,0.01507949,0.001544499,0.000582698,0.001056986],"study_design_scores_gemma":[0.002653799,0.0002632464,0.2867015,0.0003814814,0.00004059391,0.00002139117,0.002382838,0.6655293,0.03162485,0.0001752021,0.009214687,0.00101104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987407,0.00002778913,0.001852472,0.0003010641,0.0001865642,0.0002340486,0.00001320106,0.0001853539,0.009792535],"genre_scores_gemma":[0.9979175,0.00004265324,0.001565072,0.00003878522,0.00002133389,0.00001357877,0.00004759976,0.00001938975,0.0003340393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2883938,"threshold_uncertainty_score":0.3482299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947445009","doi":"10.1007/s12597-019-00381-4","title":"A novel approach to determine the cell formation using heuristics approach","year":2019,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Advanced Manufacturing and Logistics 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":"Concordia University","funders":"","keywords":"Cellular manufacturing; Heuristics; Computer science; Genetic algorithm; Group technology; Mathematical optimization; Domain (mathematical analysis); Selection (genetic algorithm); Population; Cell formation; Artificial intelligence; Machine learning; Mathematics; Engineering; Manufacturing engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04315383282869781,"gpt":0.2436475611557632,"spread":0.2004937283270654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001488623,0.0001028396,0.0000933041,0.00006632304,0.00007569229,0.000054174,0.0001659453,0.00004685297,0.00000581322],"category_scores_gemma":[0.00002108262,0.00008098278,0.0000224558,0.0001585731,0.00001485517,0.00009791829,0.00005242741,0.0001664458,0.00003886886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006865252,"about_ca_system_score_gemma":0.000009266071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008037732,"about_ca_topic_score_gemma":3.073924e-7,"domain_scores_codex":[0.9993225,0.00001162536,0.0001288295,0.0001298129,0.0001724897,0.0002346984],"domain_scores_gemma":[0.9995859,0.00004485437,0.00001763348,0.0002583636,0.00004083237,0.00005239912],"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.00000410212,0.00002642467,0.000009937465,0.0001177627,0.000003016026,1.217109e-7,0.0002939304,0.9935511,0.004720843,0.0002897101,0.00006809903,0.0009149711],"study_design_scores_gemma":[0.0001647045,0.00001443728,0.00007479881,0.000005820484,0.000005604731,0.000008819015,0.0001261777,0.9929541,0.005905391,0.00004443272,0.0005819029,0.0001137493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02321205,0.00001787171,0.9449803,0.000006702431,0.0000919457,0.0003450275,0.000007883528,0.00008693134,0.03125131],"genre_scores_gemma":[0.7621886,0.000006467163,0.2373439,0.000019817,0.00005116628,0.00001451181,0.00002552828,0.00002482228,0.0003252756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7389765,"threshold_uncertainty_score":0.3302382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2774441693","doi":"10.1007/bf03398797","title":"Evaluation of relative performance of product designs: A fuzzy dea approach to quality function deployment","year":2007,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Quality Function Deployment in Product Design","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Quality function deployment; Fuzzy logic; Product (mathematics); House of Quality; Computer science; Function (biology); Software deployment; Quality (philosophy); New product development; Reliability engineering; Mathematical optimization; Operations research; Industrial engineering; Mathematics; Business; Engineering; Artificial intelligence; Service quality; Marketing; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2059846842501279,"gpt":0.3586424368399183,"spread":0.1526577525897904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03095399,0.000186233,0.0002920945,0.0005752544,0.0001363759,0.00004592586,0.0002549397,0.00006696513,0.0001179749],"category_scores_gemma":[0.00149231,0.0001778745,0.00008044323,0.001535301,0.00009432338,0.00107669,0.0001326828,0.0001878896,0.0001311777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001917698,"about_ca_system_score_gemma":0.0001283434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002957213,"about_ca_topic_score_gemma":0.0000140296,"domain_scores_codex":[0.9955581,0.0002408622,0.0008456433,0.0005333835,0.002446505,0.0003755121],"domain_scores_gemma":[0.9963686,0.0001343543,0.0004539902,0.0005842815,0.002431667,0.0000270538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.006501025,0.004818255,0.2622627,0.004248693,0.0009014861,0.000001168725,0.002330477,0.0166175,0.1223352,0.1495041,0.008781986,0.4216973],"study_design_scores_gemma":[0.003979421,0.00070383,0.860217,0.0003129115,0.001074973,0.000003775806,0.002366086,0.01711624,0.09004369,0.01536868,0.007632283,0.001181099],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.926416,0.0001266948,0.02665885,0.0002590078,0.0003660456,0.001913685,0.00000179602,0.00008529694,0.04417264],"genre_scores_gemma":[0.9964876,0.000003906219,0.002346674,0.0001648565,0.000447636,0.00009958502,0.00002473277,0.00003227297,0.0003927781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5979543,"threshold_uncertainty_score":0.9978368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2956864070","doi":"10.1007/s12597-019-00394-z","title":"Ordering policies under currency risk sharing agreements: a Markov chain approach","year":2019,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"","keywords":"Currency; Exchange rate; Profit (economics); Markov chain; Economics; Microeconomics; Monetary economics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03122759698662441,"gpt":0.2570169438425696,"spread":0.2257893468559451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009321254,0.0002468546,0.0002299285,0.0004951768,0.0002613681,0.0005206827,0.0006605827,0.00006129389,0.003808731],"category_scores_gemma":[0.00003850728,0.0002336923,0.0001077502,0.0005409591,0.00005268973,0.0008636094,0.001039251,0.0002935619,0.003279838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000893119,"about_ca_system_score_gemma":0.0000159459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001951812,"about_ca_topic_score_gemma":0.00003239145,"domain_scores_codex":[0.9978678,0.00002153645,0.0002894535,0.0005591874,0.0005835031,0.0006785479],"domain_scores_gemma":[0.9991412,0.00002504765,0.0001375156,0.0005729991,0.00009536561,0.00002790587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008344774,0.000591437,0.7587818,0.001503106,0.0002679404,0.000008520645,0.0005660002,0.001585329,0.0004135236,0.17766,0.02071122,0.03782763],"study_design_scores_gemma":[0.004887002,0.00009455484,0.2380386,0.0003364279,0.0001737664,0.000003859291,0.01273221,0.3525963,0.00006728895,0.01561502,0.3732629,0.002192049],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5345691,0.0001609776,0.002145898,0.0007285509,0.0007338173,0.0009429505,0.000003860026,0.0002201869,0.4604946],"genre_scores_gemma":[0.9843336,0.00005284323,0.0003126333,0.001040062,0.0008522677,0.00007585259,0.00005576001,0.00005442133,0.01322254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5207432,"threshold_uncertainty_score":0.9974962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415127508","doi":"10.1007/s12597-025-01004-x","title":"Optimizing healthcare inventory management using machine learning for efficient classification of medical supplies","year":2025,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Intravenous Infusion Technology and Safety","field":"Engineering","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 Waterloo","funders":"","keywords":"Preprocessor; Random forest; Support vector machine; Health care; Python (programming language); Field (mathematics); Quality (philosophy); Decision support system","retraction":null,"screen_n_in":null,"score":{"opus":0.0279973859896102,"gpt":0.3154760352476191,"spread":0.2874786492580089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006309492,0.00007175285,0.0001290913,0.000227126,0.0001541997,0.000006892198,0.0001946934,0.0001504584,0.00004922639],"category_scores_gemma":[0.00003499252,0.00007387691,0.00003856815,0.0002005732,0.00006900125,0.00001165373,0.00008256279,0.0002960422,0.00000231014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001045775,"about_ca_system_score_gemma":0.00004097983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000028446,"about_ca_topic_score_gemma":0.00001450035,"domain_scores_codex":[0.9991789,0.00002978137,0.0002216612,0.0001232179,0.0002323796,0.0002140552],"domain_scores_gemma":[0.9996979,0.00005340177,0.00002137528,0.0001434795,0.00005065473,0.00003322513],"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.0001415573,0.0002109186,0.00369634,0.005035685,0.000289797,0.00001424531,0.00171868,0.2823541,0.01107557,0.4761168,0.0004828043,0.2188635],"study_design_scores_gemma":[0.0003073052,0.00002754028,0.0005258383,0.0001551464,0.0000107229,0.000001390098,0.0005192054,0.9897972,0.005334263,0.0003544783,0.002900766,0.00006619442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5305986,0.002173086,0.4549751,0.00260708,0.0006248275,0.001006235,0.00001514226,0.0004615643,0.007538347],"genre_scores_gemma":[0.9939178,0.000237199,0.005579108,0.00002183404,0.00001378485,0.00003408491,0.00001727894,0.00001205387,0.000166894],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7074431,"threshold_uncertainty_score":0.3012613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2773526192","doi":"10.1007/bf03398833","title":"On continuous review stock control with multiple suppliers and non-negative lead times with special emphasis on erlang distribution","year":2004,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Erlang (programming language); Stock (firearms); Erlang distribution; Lead time; Computer science; Mathematics; Operations management; Gamma distribution; Statistics; Economics; Engineering; Mechanical engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01491292877184739,"gpt":0.2764916209264729,"spread":0.2615786921546255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765344,0.0001780431,0.0003595371,0.00004183489,0.0001501222,0.00005076763,0.00007448327,0.00005984469,0.00004130405],"category_scores_gemma":[0.0002395718,0.0001181007,0.00003258758,0.0001671208,0.00009692187,0.00007848813,0.00001168094,0.0001668776,0.00002636463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001398081,"about_ca_system_score_gemma":0.00007349977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009097958,"about_ca_topic_score_gemma":0.0001310884,"domain_scores_codex":[0.9988205,0.00006876377,0.0001892265,0.0002735922,0.0003971018,0.0002507702],"domain_scores_gemma":[0.9990873,0.000353852,0.0001066154,0.0002134698,0.0001546949,0.00008400869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"randomized_trial","study_design_scores_codex":[0.04176388,0.009912237,0.05285893,0.02452785,0.004037476,0.001398513,0.02346505,0.02275755,0.001627828,0.4202885,0.2732704,0.1240917],"study_design_scores_gemma":[0.3780602,0.111541,0.1112674,0.1769394,0.004594784,0.001213296,0.01435789,0.03936199,0.04456449,0.06834624,0.03394005,0.01581323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8977478,0.0006731317,0.05736297,0.004191334,0.0002034479,0.01033018,0.001246877,0.0002112559,0.02803304],"genre_scores_gemma":[0.996358,0.0001117716,0.002356707,0.0001206859,0.0001822612,0.0001085428,0.00008203116,0.00003325479,0.0006467889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3519423,"threshold_uncertainty_score":0.4816005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416918344","doi":"10.1007/s12597-025-01049-y","title":"Modeling PCA information loss with fuzzy theory in a network DEA framework: efficiency evaluation of electricity distribution companies","year":2025,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Principal component analysis; Fuzzy logic; Data envelopment analysis; Curse of dimensionality; Electricity; Electric power distribution; Measure (data warehouse); Distribution (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0668215411421353,"gpt":0.4031353866466166,"spread":0.3363138455044813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0254642,0.0001373752,0.0003374757,0.0006805029,0.0002695794,0.0002162517,0.0006666939,0.0001242843,0.00004650591],"category_scores_gemma":[0.007481765,0.0001025088,0.00007924689,0.007526995,0.0001853382,0.0005781041,0.000131383,0.0003790276,0.00003016063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002720999,"about_ca_system_score_gemma":0.0006692393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001667377,"about_ca_topic_score_gemma":0.0001294152,"domain_scores_codex":[0.993757,0.001271257,0.0009468396,0.0003497864,0.00323389,0.0004411966],"domain_scores_gemma":[0.9951687,0.001882854,0.0002236063,0.0005777156,0.002103172,0.00004395437],"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.0001460874,0.00008457956,0.01216522,0.000009030706,0.00001317931,3.651633e-7,0.0005493379,0.9053013,0.00001264629,0.05389015,0.00004719418,0.02778087],"study_design_scores_gemma":[0.0003050748,0.00005080862,0.01280596,0.0001129559,0.00003635215,7.949662e-7,0.0004880977,0.8368577,0.0001049103,0.1491247,0.00002486139,0.00008772528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5133104,0.0001679427,0.4843245,0.0001376718,0.00004593583,0.0002336454,0.000005608398,0.0000130805,0.001761279],"genre_scores_gemma":[0.9988515,0.00001101869,0.0009886099,0.00004850197,0.00001878252,0.00002154978,0.00003057744,0.000003669518,0.00002574411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4855412,"threshold_uncertainty_score":0.8956913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998488507","doi":"10.1007/s12597-009-0024-z","title":"A simplex algorithm for network flow problems with piecewise linear fractional objective function","year":2009,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Mathematical Programming","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":"Simon Fraser University; University of New Brunswick","funders":"","keywords":"Piecewise linear function; Simplex algorithm; Linear-fractional programming; Linear programming; Simplex; Mathematics; Algorithm; Flow network; Criss-cross algorithm; Mathematical optimization; Function (biology); Flow (mathematics); Revised simplex method; Computer science; Mathematical analysis; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01676745918467157,"gpt":0.2586957893608883,"spread":0.2419283301762168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636293,0.0001021452,0.0001134783,0.00004319893,0.0001108983,0.0000458955,0.0000492137,0.00005755251,0.0001094511],"category_scores_gemma":[0.00001856316,0.00008754286,0.00003718834,0.000238616,0.00001807786,0.000130406,0.000006567528,0.0001501437,0.00002711553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004495811,"about_ca_system_score_gemma":0.00002252049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001383283,"about_ca_topic_score_gemma":0.000002326932,"domain_scores_codex":[0.9992664,0.000008295411,0.0001235218,0.0001372094,0.000175566,0.0002890191],"domain_scores_gemma":[0.9996099,0.00008151855,0.00001491335,0.00009341615,0.0001172885,0.00008293447],"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.00002461707,0.00005206909,0.000005291765,0.0000362784,0.00003656929,8.12419e-7,0.00008971115,0.6067106,0.00003165621,0.0007773983,0.001435454,0.3907996],"study_design_scores_gemma":[0.0004269564,0.0002583238,0.0000784756,0.0000253798,0.00001342955,0.000004079357,0.00003167772,0.9803774,0.00005172841,0.00335309,0.0152621,0.0001174066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001519232,0.00005305493,0.9963821,0.00009608466,0.00008000808,0.0005248697,0.000006155462,0.0002440131,0.002461787],"genre_scores_gemma":[0.1042754,0.00002379717,0.8935806,0.0001546285,0.0007428364,0.000225689,0.0001125002,0.00005907286,0.0008255219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3906822,"threshold_uncertainty_score":0.3569894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413441427","doi":"10.1007/s12597-025-00987-x","title":"Quarantine-aware home healthcare routing and scheduling: a bi-objective approach","year":2025,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Qatar National Library; Hamad Bin Khalifa University","keywords":"Health care; Quarantine; Computer science; Routing (electronic design automation); Scheduling (production processes); Business; Medicine; Operations management; Computer network; Economics; Economic growth","retraction":null,"screen_n_in":null,"score":{"opus":0.01159653695082098,"gpt":0.2668295413057821,"spread":0.2552330043549612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001775794,0.0001379408,0.0001840054,0.0001634183,0.0001476363,0.00004886524,0.0001012636,0.00009704463,0.000003673816],"category_scores_gemma":[0.00002921841,0.0001494879,0.00002501476,0.0006602366,0.00004132284,0.0001243216,0.00006738858,0.0003336717,0.000004365736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008761126,"about_ca_system_score_gemma":0.00004221505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002621956,"about_ca_topic_score_gemma":0.00000800519,"domain_scores_codex":[0.9990391,0.00004234224,0.0001716518,0.0002569261,0.0001369803,0.0003529838],"domain_scores_gemma":[0.9995676,0.00008136687,0.0000178034,0.0001806036,0.00008790597,0.00006475468],"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.00003045548,0.00002665845,0.01275886,0.0006113871,0.0000606534,0.000004879077,0.0009392031,0.9389997,0.0003301036,0.01078057,0.0000960317,0.03536154],"study_design_scores_gemma":[0.0003496683,0.00001573478,0.003547793,0.0001238441,0.00000561527,0.000003340718,0.000591678,0.9944255,0.0002693918,0.0004442595,0.00006702092,0.0001561093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1318853,0.001701367,0.8602591,0.0002797401,0.0001934356,0.0004515837,0.000008488403,0.0005557538,0.004665253],"genre_scores_gemma":[0.9801967,0.0002813496,0.01915529,0.00003012251,0.00007044405,0.00004240911,0.00002449949,0.00003426956,0.0001649188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8483114,"threshold_uncertainty_score":0.6095939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}