{"meta":{"query_hash":"7100f6656e6c","filters":{"venue":"OPSEARCH"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7100f6656e6c","api":"https://metacan.xera.ac/api/v1/cohort?venue=OPSEARCH"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0108566462305342,"score_gpt":0.2552764207603264,"score_spread":0.24441977452979222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967352043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5429505,0.001468349,0.4300064,0.0032153244,0.0004161794,0.00015899123,0.0006551484,0.000553309,0.020575795],"genre_scores_gemma":[0.96436864,0.00026491808,0.030422918,0.00018830491,0.00017102211,0.00007571768,0.00022047095,0.00007174223,0.0042161895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995741,0.00013765196,0.000012955811,0.000055663324,0.00009606265,0.00012352274],"domain_scores_gemma":[0.9965031,0.002572879,0.00017145454,0.00010373807,0.00042203424,0.0002267657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015478927,0.0004914362,0.0010628003,0.0008299347,0.0009912825,0.0013722073,0.0019447429,0.0010616564,0.0052514006],"category_scores_gemma":[0.0057076444,0.0004022158,0.0007483485,0.0007307345,0.000757373,0.0016229731,0.0011605595,0.001187746,0.0002124289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012192532,0.00011730398,0.0012585584,0.00007441604,0.000021682838,0.00010727393,0.000053004165,0.955317,0.00054915034,0.03659386,0.0019019101,0.0038839593],"study_design_scores_gemma":[0.000003953671,0.000002992213,0.000040978957,7.964846e-7,0.0000015495605,0.0000028471547,0.000005449331,0.99850047,0.00001942666,0.0013954758,0.000024996882,0.0000011216315],"about_ca_topic_score_codex":0.03092026,"about_ca_topic_score_gemma":0.016385125,"teacher_disagreement_score":0.03092026,"about_ca_system_score_codex":0.0019902636,"about_ca_system_score_gemma":0.0034652378,"threshold_uncertainty_score":0.06148058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016767459184671568,"score_gpt":0.25869578936088833,"score_spread":0.24192833017621676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998488507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027668676,0.00015338865,0.9940753,0.000075994685,0.000039810602,0.00004614175,0.00003392417,0.00022880468,0.0025797028],"genre_scores_gemma":[0.06770874,0.00034027218,0.9263935,0.000065982706,0.000045610832,0.00037005427,0.00010699963,0.00023597921,0.004732874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995084,0.00021810913,0.00002222518,0.00004441267,0.00016772712,0.000039060717],"domain_scores_gemma":[0.99912745,0.00055071193,0.000037779646,0.000063749656,0.00018017578,0.00004017513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051066,0.0009505796,0.0014417637,0.00096992013,0.00069876027,0.0012224114,0.0011343737,0.0013802127,0.0059242807],"category_scores_gemma":[0.0037467817,0.0007131742,0.0008144531,0.0014985836,0.00062840653,0.0013021263,0.0014669248,0.0018420289,0.0010567649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011027357,0.00008511599,0.00021001598,0.00014761485,0.000060841263,0.000049516882,0.00009517578,0.787929,0.0014668857,0.041378945,0.003867253,0.16459945],"study_design_scores_gemma":[0.000016343416,0.000016280133,0.000023699862,0.000011470794,0.0000066695316,0.000011826464,0.000007292761,0.9907403,0.00027206732,0.0072386214,0.0016488213,0.0000066598254],"about_ca_topic_score_codex":0.005551404,"about_ca_topic_score_gemma":0.0041149873,"teacher_disagreement_score":0.0059242807,"about_ca_system_score_codex":0.00080150407,"about_ca_system_score_gemma":0.0016211917,"threshold_uncertainty_score":0.019818723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019440543819704812,"score_gpt":0.2741314883152999,"score_spread":0.25469094449559504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028182461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039328826,0.00022264208,0.9940899,0.00011281885,0.000022591654,0.000012972985,0.000007446108,0.000055796252,0.0015429513],"genre_scores_gemma":[0.21316518,0.0004793401,0.7819083,0.00011880339,0.00008325989,0.00019336618,0.000059270158,0.00016525266,0.003827249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990447,0.000448235,0.00006133255,0.00011334312,0.0002564906,0.00007585644],"domain_scores_gemma":[0.99881136,0.0007495114,0.00011936581,0.00011710463,0.00016481831,0.00003783958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021390417,0.0011199878,0.001762879,0.0009345582,0.0006204853,0.0019909013,0.0012969194,0.0015957541,0.0031195336],"category_scores_gemma":[0.0064416355,0.001101098,0.0011939115,0.001777294,0.00093671697,0.0022545755,0.00296954,0.002119254,0.00051060267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082883846,0.000094228504,0.00038792402,0.0002790082,0.00012331498,0.00006628235,0.000118978955,0.78898346,0.0016146114,0.09150153,0.0015690157,0.11517871],"study_design_scores_gemma":[0.0000085574775,0.000023226323,0.000030971103,0.000015096399,0.000009403859,0.000022551176,0.000014791213,0.9783155,0.0004219981,0.020277178,0.0008559694,0.0000049031078],"about_ca_topic_score_codex":0.0010675382,"about_ca_topic_score_gemma":0.001330614,"teacher_disagreement_score":0.0031195336,"about_ca_system_score_codex":0.00048059993,"about_ca_system_score_gemma":0.0009611777,"threshold_uncertainty_score":0.011312485},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03600050729763214,"score_gpt":0.31658430017333494,"score_spread":0.2805837928757028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312556230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008002489,0.0006596037,0.9841888,0.00008204936,0.00009802001,0.000051483054,0.000026162399,0.00024213383,0.0066492604],"genre_scores_gemma":[0.22114478,0.0008723392,0.7698767,0.00008082847,0.000099832294,0.00034451915,0.00012594629,0.00020830602,0.007246796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959487,0.00014683185,0.000017451679,0.000035271518,0.0001828839,0.000022770073],"domain_scores_gemma":[0.99968255,0.00016192342,0.000026143838,0.0000457956,0.000071674534,0.000012009025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008369037,0.00074604567,0.0008790277,0.00086307555,0.00047291146,0.00084578723,0.00076211087,0.00094098557,0.0023486027],"category_scores_gemma":[0.0020777201,0.00034695596,0.00054278143,0.0016253794,0.00061412767,0.00072679704,0.0008351806,0.0015455907,0.0005487616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012843715,0.00009208827,0.00032947928,0.000249304,0.000106949235,0.000071248985,0.00011441262,0.71843016,0.005543558,0.064430125,0.003514382,0.20698988],"study_design_scores_gemma":[0.000018400877,0.000030056128,0.00007999703,0.000010730485,0.000014259971,0.000015503207,0.0000072071994,0.98905236,0.0010885973,0.007797528,0.0018794069,0.0000059141485],"about_ca_topic_score_codex":0.0019800118,"about_ca_topic_score_gemma":0.0016874623,"teacher_disagreement_score":0.0023486027,"about_ca_system_score_codex":0.0004332774,"about_ca_system_score_gemma":0.00069469365,"threshold_uncertainty_score":0.007856846},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03531048059759525,"score_gpt":0.30215708515477113,"score_spread":0.2668466045571759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737203876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016224764,0.003508279,0.9139117,0.0018364948,0.00032899948,0.0001484625,0.0011797847,0.0003465793,0.062515035],"genre_scores_gemma":[0.35729218,0.007058714,0.4765778,0.0007699038,0.00082707475,0.0005688932,0.0029085516,0.00039278143,0.15360412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931896,0.00027291823,0.000022338192,0.00016603651,0.00015662589,0.000063054315],"domain_scores_gemma":[0.99903226,0.0006787596,0.00008471562,0.0000686983,0.00008398328,0.000051701194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096333754,0.0012814874,0.0013449474,0.0010570397,0.00064949796,0.0021702761,0.0015698194,0.0027077843,0.015977217],"category_scores_gemma":[0.0041485303,0.0006637907,0.0007850074,0.002536087,0.00089930417,0.0028922367,0.0016209463,0.0018837829,0.0022819843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008955936,0.00013748783,0.00060482766,0.0003657327,0.00008529806,0.00018800909,0.000089781715,0.499804,0.00058673753,0.34776115,0.030394625,0.119892806],"study_design_scores_gemma":[0.000053171887,0.00005104174,0.00022824679,0.00005523546,0.000038740185,0.00020681,0.00009163451,0.6790355,0.0005446151,0.2904243,0.029254833,0.000015972146],"about_ca_topic_score_codex":0.0020192463,"about_ca_topic_score_gemma":0.002396765,"teacher_disagreement_score":0.015977217,"about_ca_system_score_codex":0.0010548553,"about_ca_system_score_gemma":0.0008156558,"threshold_uncertainty_score":0.053449094},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01491292877184739,"score_gpt":0.27649162092647295,"score_spread":0.26157869215462554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773526192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06707355,0.009786147,0.8654177,0.0031021219,0.0014609786,0.00015052743,0.00020215173,0.00021463765,0.052592248],"genre_scores_gemma":[0.9501306,0.005470776,0.016203795,0.00039845574,0.0007035721,0.000098264005,0.000068640365,0.00007852856,0.0268473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998874,0.00042826627,0.00005436317,0.0002045116,0.0002701225,0.00016856309],"domain_scores_gemma":[0.9964529,0.0024347617,0.0002882009,0.00011072304,0.000587482,0.00012586544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026574982,0.0015045288,0.0022622773,0.00092418125,0.00072549476,0.0031863416,0.0018325757,0.002164503,0.0056097438],"category_scores_gemma":[0.0072086887,0.00078996306,0.0010383694,0.0019448511,0.0019928368,0.0020871647,0.0014400786,0.0015274282,0.00040019216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033030024,0.00016401743,0.00060348224,0.00045224774,0.00016794591,0.00037484828,0.00023025338,0.8056613,0.0028339943,0.13387634,0.0057469993,0.04955811],"study_design_scores_gemma":[0.000032921467,0.0001256644,0.0004415594,0.000031597225,0.000077549645,0.00006263546,0.00004240387,0.96030015,0.0003875917,0.03670382,0.0017640669,0.000030053365],"about_ca_topic_score_codex":0.0069352486,"about_ca_topic_score_gemma":0.004956146,"teacher_disagreement_score":0.0069352486,"about_ca_system_score_codex":0.0015696379,"about_ca_system_score_gemma":0.0012219773,"threshold_uncertainty_score":0.018766463},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09134289677039446,"score_gpt":0.3276415467877081,"score_spread":0.23629865001731365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774074136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008386067,0.0006075221,0.97691625,0.00044719162,0.00027375566,0.000055786983,0.000046198293,0.00019662766,0.013070555],"genre_scores_gemma":[0.18391153,0.00097558217,0.799596,0.0006525706,0.00022750336,0.0002061132,0.00014275328,0.00040694283,0.013880967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854654,0.0006700405,0.00008795516,0.00018849623,0.00038408628,0.00012275338],"domain_scores_gemma":[0.99721885,0.0018057841,0.00008575927,0.00039023368,0.00041381625,0.00008564207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035151078,0.001200679,0.0014716247,0.0014839343,0.0011215456,0.0025082415,0.0019758625,0.0018393095,0.008431064],"category_scores_gemma":[0.0139126,0.00053683843,0.0012616531,0.002080315,0.0017273033,0.0037031726,0.0029171824,0.0028371422,0.0013608186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015488216,0.00010393794,0.00066314073,0.00024511208,0.000060244056,0.00005254625,0.00019628704,0.18164426,0.0015158338,0.609738,0.0043991925,0.20122643],"study_design_scores_gemma":[0.000034209294,0.000052332507,0.00013081486,0.00010808249,0.000018183899,0.000047809743,0.00004868784,0.70006144,0.0013966899,0.2886872,0.009394516,0.000019984956],"about_ca_topic_score_codex":0.0029113921,"about_ca_topic_score_gemma":0.00494731,"teacher_disagreement_score":0.008431064,"about_ca_system_score_codex":0.001705393,"about_ca_system_score_gemma":0.0017780808,"threshold_uncertainty_score":0.02820474},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20598468425012786,"score_gpt":0.3586424368399183,"score_spread":0.15265775258979045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774441693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2048989,0.0005178175,0.7889021,0.00012841636,0.000023192302,0.00011747119,0.00009926218,0.000116797695,0.0051960684],"genre_scores_gemma":[0.8013134,0.00015989556,0.19750872,0.000018925813,0.000014093176,0.0001277426,0.00011030158,0.00002165795,0.0007252083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453896,0.0023508652,0.00040244704,0.00047707185,0.0020321654,0.00019838952],"domain_scores_gemma":[0.9864603,0.009564251,0.001125929,0.000518197,0.0021881661,0.00014300144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008377442,0.0011130202,0.001393485,0.0044531547,0.0005342527,0.0020089478,0.0010559069,0.00072867476,0.0010537243],"category_scores_gemma":[0.02014117,0.00039292403,0.0011193505,0.0030405356,0.0007852049,0.0017756367,0.00068358774,0.00065205665,0.000112929636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047314787,0.00027300246,0.0053263926,0.00032706585,0.00031995407,0.000069253874,0.00027855026,0.7348607,0.012658199,0.017722828,0.00027244783,0.22741838],"study_design_scores_gemma":[0.000011897282,0.00018676036,0.0015579065,0.000020524652,0.00007499477,0.000020435005,0.000055863027,0.99195355,0.0033435498,0.00250877,0.00025022394,0.000015556261],"about_ca_topic_score_codex":0.003820696,"about_ca_topic_score_gemma":0.0031949694,"teacher_disagreement_score":0.008377442,"about_ca_system_score_codex":0.0025813007,"about_ca_system_score_gemma":0.0011694356,"threshold_uncertainty_score":0.04430473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043153832828697815,"score_gpt":0.2436475611557632,"score_spread":0.20049372832706538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947445009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012674573,0.0002867792,0.98069245,0.00009018101,0.00008882998,0.00012235061,0.00010981138,0.0006699649,0.0052651004],"genre_scores_gemma":[0.21451934,0.00032860774,0.7790834,0.0001803418,0.000060478636,0.00027313948,0.000388453,0.00015717094,0.0050090505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.00008110776,0.00002153064,0.00008802401,0.00014580156,0.00008834115],"domain_scores_gemma":[0.9995183,0.00021646182,0.000045099525,0.00005268969,0.00013435037,0.000032990356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044574114,0.001173199,0.0013977874,0.0019916128,0.00092384015,0.0013642455,0.0018629222,0.0011603571,0.004224397],"category_scores_gemma":[0.001218101,0.00057054707,0.0011227395,0.0017866988,0.0005563113,0.0010305282,0.0010094638,0.000742482,0.000669681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016065156,0.00019589077,0.0015370694,0.00023842872,0.00012515567,0.00020897038,0.00011409842,0.68240535,0.009898471,0.024134982,0.005883273,0.27509767],"study_design_scores_gemma":[0.000018192468,0.00005503015,0.00018142076,0.000009841055,0.000025138836,0.00006761604,0.000038002516,0.9921898,0.002005521,0.003656837,0.0017396507,0.000012843824],"about_ca_topic_score_codex":0.012806888,"about_ca_topic_score_gemma":0.011300944,"teacher_disagreement_score":0.012806888,"about_ca_system_score_codex":0.001021492,"about_ca_system_score_gemma":0.0022789172,"threshold_uncertainty_score":0.025464714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Currency; Exchange rate; Profit (economics); Markov chain; Economics; Microeconomics; Monetary economics; Computer science","score_opus":0.031227596986624407,"score_gpt":0.25701694384256957,"score_spread":0.22578934685594515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956864070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19093879,0.0010176826,0.7753572,0.0036651636,0.00017140686,0.0002539063,0.0013841182,0.00052624283,0.026685482],"genre_scores_gemma":[0.95167005,0.0013047666,0.029237006,0.0002545538,0.00016888157,0.00021116597,0.0005999809,0.00014817041,0.016405405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640274,0.0017515366,0.00013376566,0.0005099953,0.000366408,0.0008355994],"domain_scores_gemma":[0.96888274,0.026541611,0.0019051766,0.00075582217,0.0010437878,0.0008709388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007944286,0.0012350813,0.003355655,0.0028314337,0.0015077932,0.005398335,0.002780626,0.0037998867,0.014291133],"category_scores_gemma":[0.021506932,0.0023848417,0.0023378301,0.0025634896,0.0035650423,0.007804076,0.0022289432,0.0038434912,0.001001624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097456395,0.000066142646,0.0005726738,0.000031984648,0.000048716513,0.00009047838,0.00007016784,0.8843475,0.00012510511,0.11114782,0.0009144488,0.0024875544],"study_design_scores_gemma":[0.00002150594,0.000014436573,0.00012139813,0.0000129299315,0.000018194418,0.000009726017,0.000027699076,0.954018,0.00005097342,0.04552999,0.0001582859,0.000016915918],"about_ca_topic_score_codex":0.026485244,"about_ca_topic_score_gemma":0.017639974,"teacher_disagreement_score":0.026485244,"about_ca_system_score_codex":0.0052472753,"about_ca_system_score_gemma":0.0050734403,"threshold_uncertainty_score":0.052662134},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01450194598291363,"score_gpt":0.22864210442323665,"score_spread":0.21414015844032303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969963949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66328484,0.0026604906,0.2746338,0.0011379259,0.00061614654,0.0002450461,0.0014026058,0.00062583515,0.055393334],"genre_scores_gemma":[0.96966124,0.00046361654,0.016181452,0.00010005902,0.000073677926,0.00007908047,0.0004844423,0.00013415604,0.01282233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999605,0.00010716895,0.000008003265,0.000072922885,0.00004016893,0.00016677765],"domain_scores_gemma":[0.9993963,0.00030933245,0.000050176746,0.000025078312,0.00010130666,0.00011784651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000595097,0.0025346302,0.0024013047,0.0010305184,0.0007088191,0.0022573166,0.0010328862,0.0022597513,0.010299042],"category_scores_gemma":[0.0013880864,0.0009969847,0.0014162948,0.0010536496,0.0005410611,0.0014705572,0.0007507292,0.0013180721,0.00079493376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019766156,0.000075449854,0.00049629644,0.00008363756,0.000040375,0.00009435055,0.00001642338,0.9898913,0.001063174,0.00089916325,0.0011125278,0.0060295737],"study_design_scores_gemma":[0.000023161618,0.00011531755,0.0006896638,0.000013211674,0.000037629987,0.000017274098,0.000054716966,0.9976497,0.0003230249,0.0006400766,0.00042858702,0.000007546265],"about_ca_topic_score_codex":0.020039152,"about_ca_topic_score_gemma":0.009956103,"teacher_disagreement_score":0.020039152,"about_ca_system_score_codex":0.00084554026,"about_ca_system_score_gemma":0.0012169395,"threshold_uncertainty_score":0.03984499},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011596536950820982,"score_gpt":0.2668295413057821,"score_spread":0.25523300435496116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413441427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040994674,0.00092278695,0.9434698,0.0009700329,0.00013507105,0.00024281531,0.00047610255,0.00022494512,0.012563871],"genre_scores_gemma":[0.663845,0.0010884438,0.32421464,0.00036065315,0.00017457703,0.000574646,0.00063195545,0.00013196516,0.008978117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880266,0.0006735975,0.000036856687,0.00013863506,0.00019438296,0.00015371121],"domain_scores_gemma":[0.9983511,0.0010223191,0.0001619717,0.00004734333,0.0002973745,0.00011991504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023676553,0.0017953217,0.0015580226,0.0016800674,0.00057937065,0.002661134,0.001946306,0.001735484,0.005750241],"category_scores_gemma":[0.0025042586,0.0011538519,0.0014087268,0.0015003441,0.00061390793,0.0013187062,0.0014822072,0.0017491756,0.00046284066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002047422,0.000046524576,0.0002743967,0.00005224886,0.00003308949,0.000044002816,0.000012882278,0.99216956,0.00019424435,0.0031539514,0.00030592663,0.0036927725],"study_design_scores_gemma":[0.000003850919,0.000016477325,0.000056083383,0.0000074544796,0.0000059342124,0.0000040437953,0.000015574491,0.99854445,0.000038179984,0.0010626753,0.00024239058,0.0000029393354],"about_ca_topic_score_codex":0.011948448,"about_ca_topic_score_gemma":0.008546961,"teacher_disagreement_score":0.011948448,"about_ca_system_score_codex":0.0015945588,"about_ca_system_score_gemma":0.0024627177,"threshold_uncertainty_score":0.023757756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0279973859896102,"score_gpt":0.3154760352476191,"score_spread":0.28747864925800887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415127508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2734237,0.001590307,0.71594584,0.0011636334,0.00019485285,0.0001590948,0.00081229006,0.0031541036,0.0035561826],"genre_scores_gemma":[0.8919333,0.00028582828,0.10400637,0.00012672163,0.00010140902,0.00007697411,0.0011533384,0.00007350751,0.0022424886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.00015374042,0.00005763891,0.00013254238,0.00012917037,0.00014089419],"domain_scores_gemma":[0.9988054,0.0006083928,0.00015077698,0.00008764266,0.00029421848,0.000053587457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008927678,0.0009545229,0.0012160033,0.0014149244,0.000482121,0.0016280061,0.0008552998,0.0008805211,0.002016621],"category_scores_gemma":[0.002584218,0.00045849403,0.00089960935,0.0012556543,0.000270266,0.0011901656,0.00055129745,0.0009373486,0.00066850736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002696104,0.00045448603,0.008067981,0.000081630606,0.000082558036,0.00006796961,0.000038738923,0.6942253,0.0036517722,0.0011745456,0.0042730956,0.28761223],"study_design_scores_gemma":[0.0000038472817,0.000021232827,0.0004279961,0.0000029688947,0.000005408866,0.0000072455837,0.0000082777715,0.9982743,0.0006057143,0.00051379227,0.00012654642,0.0000026749642],"about_ca_topic_score_codex":0.011453514,"about_ca_topic_score_gemma":0.008279194,"teacher_disagreement_score":0.011453514,"about_ca_system_score_codex":0.001078562,"about_ca_system_score_gemma":0.001945277,"threshold_uncertainty_score":0.022773683},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0668215411421353,"score_gpt":0.40313538664661663,"score_spread":0.33631384550448135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416918344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13390273,0.00040702667,0.86232466,0.000366027,0.000027641832,0.00005564586,0.00007619936,0.000062579595,0.002777554],"genre_scores_gemma":[0.9733374,0.00021866176,0.024475874,0.00002459499,0.000018125958,0.00004554993,0.000060546474,0.000017250031,0.0018019539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909663,0.0004630012,0.000035741214,0.000109424655,0.00020205317,0.00009328176],"domain_scores_gemma":[0.9969606,0.0022661865,0.0002543141,0.00009690002,0.00037019516,0.000051781146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033249378,0.0007027277,0.0008743877,0.0009801688,0.00042070233,0.0020212394,0.00082411023,0.0009869895,0.0008423212],"category_scores_gemma":[0.0074833217,0.0003800655,0.00067506684,0.001216114,0.0006688161,0.0020229607,0.00065378036,0.0009693585,0.000077842524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021019165,0.0000236697,0.00039512455,0.00001537424,0.000023195376,0.000023944256,0.000016091257,0.9879227,0.00019834675,0.00689568,0.000084282015,0.0043805153],"study_design_scores_gemma":[8.0501405e-7,0.0000043534424,0.00011287809,0.0000018295348,0.0000037453542,0.0000030385522,0.0000036750462,0.99838567,0.00006853072,0.001388049,0.000025648094,0.0000017984721],"about_ca_topic_score_codex":0.012711609,"about_ca_topic_score_gemma":0.0069891694,"teacher_disagreement_score":0.012711609,"about_ca_system_score_codex":0.0018737993,"about_ca_system_score_gemma":0.0012605145,"threshold_uncertainty_score":0.02527523},"labels":[],"label_agreement":null}]}