{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97277236,0.00002067157,0.011185758,0.002683032,0.00003809725,0.00039398647,0.000008697372,0.000120449135,0.012776924],"genre_scores_gemma":[0.995829,8.509194e-7,0.0020649573,0.0009573355,0.00017017541,0.000053279633,0.00018942484,0.000032843644,0.0007021292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982361,0.000035427653,0.0003360707,0.00040291244,0.0006377414,0.0003517319],"domain_scores_gemma":[0.9979916,0.00014643202,0.00024644006,0.00036499972,0.001219398,0.000031094893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047787375,0.00020061451,0.00040647312,0.0008918293,0.00017738223,0.00018502383,0.0004417589,0.000058253572,0.002911387],"category_scores_gemma":[0.00007714699,0.00017005586,0.00012124596,0.0039702207,0.00012067672,0.0010518612,0.00013564632,0.00018384549,0.0004582944],"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.0002995999,0.0003892692,0.10500418,0.0010267812,0.0031552871,0.000021425114,0.0006265412,0.8499867,0.00054093153,0.03340155,0.0008628391,0.0046849297],"study_design_scores_gemma":[0.0007324676,0.000027920996,0.041421212,0.00010605599,0.0014516505,0.0000016924115,0.001513263,0.8972476,0.00013021934,0.055728383,0.0010906818,0.00054883095],"about_ca_topic_score_codex":0.001785187,"about_ca_topic_score_gemma":0.00040415477,"teacher_disagreement_score":0.063582964,"about_ca_system_score_codex":0.000036031342,"about_ca_system_score_gemma":0.000055412864,"threshold_uncertainty_score":0.9980001},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015192323,0.000053054926,0.9963821,0.00009608466,0.00008000808,0.00052486965,0.000006155462,0.00024401306,0.002461787],"genre_scores_gemma":[0.10427539,0.00002379717,0.89358056,0.00015462848,0.0007428364,0.00022568897,0.000112500195,0.000059072863,0.00082552194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992664,0.000008295411,0.00012352178,0.00013720944,0.00017556599,0.00028901905],"domain_scores_gemma":[0.99960995,0.00008151855,0.00001491335,0.00009341615,0.000117288546,0.00008293447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016362927,0.00010214517,0.00011347829,0.00004319893,0.0001108983,0.000045895496,0.0000492137,0.00005755251,0.000109451146],"category_scores_gemma":[0.000018563156,0.00008754286,0.000037188343,0.00023861599,0.000018077855,0.000130406,0.0000065675276,0.0001501437,0.000027115533],"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.000024617075,0.00005206909,0.000005291765,0.000036278398,0.000036569287,8.1241905e-7,0.000089711146,0.60671055,0.00003165621,0.0007773983,0.0014354535,0.39079958],"study_design_scores_gemma":[0.00042695642,0.0002583238,0.000078475605,0.000025379803,0.000013429545,0.000004079357,0.000031677715,0.9803774,0.000051728413,0.00335309,0.015262101,0.000117406635],"about_ca_topic_score_codex":0.0000013832826,"about_ca_topic_score_gemma":0.000002326932,"teacher_disagreement_score":0.39068216,"about_ca_system_score_codex":0.000044958106,"about_ca_system_score_gemma":0.000022520495,"threshold_uncertainty_score":0.35698944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012674747,0.000014301946,0.9957051,0.0022206926,0.000015103467,0.0002454625,6.331971e-7,0.00025595658,0.0014160031],"genre_scores_gemma":[0.15680875,0.000012241012,0.84258765,0.00018927486,0.000030631047,0.00002567925,0.000013039738,0.000005825792,0.00032691425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989468,0.000048337453,0.00016121495,0.0002881035,0.000330175,0.0002253965],"domain_scores_gemma":[0.99929786,0.00002793001,0.00005584818,0.00025114953,0.00029488298,0.000072323106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030320097,0.00009552807,0.00010164859,0.00018771354,0.0001780537,0.00040989782,0.00036124617,0.000039625196,0.00004470155],"category_scores_gemma":[0.000031195334,0.00007561543,0.000029498915,0.0008302846,0.000020020361,0.0005943053,0.00005861907,0.0000852823,0.000009294012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002120812,0.0005310137,0.0013234406,0.000038137136,0.00005814437,0.000014626983,0.001831854,0.34412506,0.002999173,0.052440103,0.00026184466,0.5963554],"study_design_scores_gemma":[0.00015700236,0.00014358449,0.00071474724,0.000030920597,0.000005297062,0.0000072364705,0.000010952172,0.99664265,0.0009570934,0.00034659845,0.00084128906,0.00014260128],"about_ca_topic_score_codex":0.00002026144,"about_ca_topic_score_gemma":0.000002680067,"teacher_disagreement_score":0.6525176,"about_ca_system_score_codex":0.00003708431,"about_ca_system_score_gemma":0.00006887697,"threshold_uncertainty_score":0.39526543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043113923,0.00003089578,0.99408305,0.0033766674,0.000104628896,0.0009797643,0.00003102071,0.00019839013,0.0007644512],"genre_scores_gemma":[0.08046833,0.00003832744,0.9178268,0.00011578675,0.000097357384,0.00023415395,0.00001617651,0.000033832315,0.0011692542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687356,0.00012948946,0.0003894743,0.0007500116,0.0010012854,0.0008562017],"domain_scores_gemma":[0.9974037,0.00045976814,0.00010088282,0.0006889815,0.0010117228,0.00033496553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997449,0.00021090421,0.0002337464,0.00009835481,0.00034912743,0.0006680064,0.0008527702,0.00010315187,0.00028920246],"category_scores_gemma":[0.00078981085,0.00014344738,0.0000628361,0.0010744601,0.00021444872,0.0009852407,0.00034632056,0.000105312145,0.000052224266],"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.00008555852,0.00015815937,0.00060661393,0.00003564851,0.000033757635,0.0000067557453,0.00007922144,0.9473294,0.000107061525,0.0270811,0.00043449373,0.024042223],"study_design_scores_gemma":[0.0019682113,0.00027695563,0.00015947374,0.000038618422,0.00000859341,0.000017582537,0.000009101714,0.9945036,0.0012288501,0.00080081425,0.00074653677,0.00024164976],"about_ca_topic_score_codex":0.000018076362,"about_ca_topic_score_gemma":0.0000054245097,"teacher_disagreement_score":0.08003719,"about_ca_system_score_codex":0.00022720783,"about_ca_system_score_gemma":0.00036254665,"threshold_uncertainty_score":0.64416015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094822,0.00029445396,0.8563023,0.0003266006,0.00023982718,0.00028366596,0.0000010554742,0.00090962596,0.060694207],"genre_scores_gemma":[0.95146304,0.00006120416,0.046945084,0.000025815192,0.000113140304,0.00002088257,0.0000053764375,0.000042005788,0.0013234485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991438,0.000054721357,0.00016688083,0.00013475075,0.00019777942,0.0003020644],"domain_scores_gemma":[0.9995124,0.000086019,0.000013271219,0.00021201868,0.00010151172,0.00007478978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059877156,0.00008540598,0.000087540255,0.00008277434,0.00008787502,0.00005804358,0.00014947842,0.0000539503,0.00019649578],"category_scores_gemma":[0.00011855335,0.00009250898,0.000020877196,0.0006090829,0.000022187109,0.00010764092,0.000032407574,0.00018114646,0.00021962447],"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.0000017904835,0.000013724819,0.011994751,0.000059686117,0.000014232794,0.000004157405,0.00047246338,0.94608426,0.0023018273,0.00078829686,0.00037964038,0.03788517],"study_design_scores_gemma":[0.00019375276,0.000012034564,0.0045519015,0.0000470662,0.0000033914116,0.000016559314,0.000065391505,0.98884934,0.0011061495,0.00018389145,0.00481608,0.00015442491],"about_ca_topic_score_codex":0.000018737343,"about_ca_topic_score_gemma":0.0000041382887,"teacher_disagreement_score":0.8705148,"about_ca_system_score_codex":0.00006807896,"about_ca_system_score_gemma":0.000024552362,"threshold_uncertainty_score":0.37724066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89774776,0.00067313167,0.057362966,0.0041913344,0.00020344791,0.010330178,0.001246877,0.00021125595,0.028033042],"genre_scores_gemma":[0.996358,0.00011177164,0.0023567071,0.00012068585,0.00018226118,0.00010854281,0.00008203116,0.00003325479,0.0006467889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"randomized_trial","domain_scores_codex":[0.99882054,0.00006876377,0.00018922648,0.00027359222,0.00039710177,0.00025077024],"domain_scores_gemma":[0.99908733,0.00035385203,0.00010661536,0.00021346983,0.00015469489,0.000084008694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027653438,0.0001780431,0.00035953708,0.00004183489,0.0001501222,0.00005076763,0.000074483265,0.000059844686,0.000041304054],"category_scores_gemma":[0.00023957176,0.00011810065,0.000032587577,0.00016712083,0.000096921875,0.000078488134,0.000011680944,0.00016687757,0.000026364625],"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.041763876,0.009912237,0.052858926,0.024527848,0.0040374757,0.0013985125,0.02346505,0.022757554,0.0016278276,0.42028853,0.27327043,0.12409171],"study_design_scores_gemma":[0.3780602,0.11154104,0.111267425,0.17693937,0.0045947838,0.0012132956,0.014357894,0.039361995,0.044564486,0.06834624,0.033940047,0.015813233],"about_ca_topic_score_codex":0.00009097958,"about_ca_topic_score_gemma":0.00013108844,"teacher_disagreement_score":0.3519423,"about_ca_system_score_codex":0.00013980812,"about_ca_system_score_gemma":0.000073499774,"threshold_uncertainty_score":0.4816005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030057926,0.0005678822,0.9550681,0.00038535788,0.00048489321,0.001164382,0.000006650607,0.0010355113,0.011229295],"genre_scores_gemma":[0.2911163,0.00024364017,0.7040289,0.00007470795,0.0007668411,0.00022804375,0.00015422695,0.00009945797,0.0032878672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992566,0.0000127744825,0.00016251841,0.00012059268,0.00018199165,0.00026550572],"domain_scores_gemma":[0.9996015,0.000075926284,0.0000137887,0.00010419349,0.00011533693,0.00008925033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018088758,0.00008719804,0.000121362646,0.000044995373,0.00015131528,0.000040765673,0.000079624035,0.000054708376,0.00016191832],"category_scores_gemma":[0.000085624335,0.00008370205,0.000055201857,0.00019267207,0.000034923654,0.00009503938,0.00001777113,0.00011932178,0.000062183826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072977826,0.00029232822,0.0013745571,0.0014278863,0.00024761487,0.000036534413,0.001134257,0.039508358,0.0037999188,0.027273504,0.009779994,0.91505206],"study_design_scores_gemma":[0.00077745435,0.00007197916,0.00014015588,0.000049877413,0.000015828991,0.0000465055,0.00004969117,0.9136517,0.00086054194,0.0010116372,0.083031245,0.0002933705],"about_ca_topic_score_codex":0.0000025959755,"about_ca_topic_score_gemma":1.971123e-7,"teacher_disagreement_score":0.9147587,"about_ca_system_score_codex":0.00003344166,"about_ca_system_score_gemma":0.000018814546,"threshold_uncertainty_score":0.34132704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.926416,0.00012669481,0.026658852,0.0002590078,0.0003660456,0.0019136852,0.0000017960203,0.00008529694,0.044172637],"genre_scores_gemma":[0.99648756,0.0000039062193,0.0023466742,0.00016485651,0.00044763603,0.00009958502,0.000024732772,0.00003227297,0.0003927781],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9955581,0.0002408622,0.0008456433,0.0005333835,0.0024465052,0.00037551206],"domain_scores_gemma":[0.99636865,0.00013435425,0.00045399021,0.00058428146,0.0024316672,0.000027053804],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.030953992,0.000186233,0.0002920945,0.0005752544,0.00013637588,0.000045925855,0.0002549397,0.000066965134,0.000117974865],"category_scores_gemma":[0.00149231,0.0001778745,0.00008044323,0.0015353013,0.00009432338,0.00107669,0.0001326828,0.00018788964,0.00013117773],"study_design_candidate":"observational","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.006501025,0.004818255,0.26226273,0.0042486927,0.00090148614,0.000001168725,0.002330477,0.016617496,0.12233522,0.14950413,0.008781986,0.42169735],"study_design_scores_gemma":[0.0039794208,0.00070383,0.86021703,0.00031291152,0.0010749728,0.0000037758057,0.0023660858,0.017116245,0.09004369,0.015368678,0.007632283,0.0011810993],"about_ca_topic_score_codex":0.00029572126,"about_ca_topic_score_gemma":0.000014029596,"teacher_disagreement_score":0.5979543,"about_ca_system_score_codex":0.00019176982,"about_ca_system_score_gemma":0.00012834337,"threshold_uncertainty_score":0.99783677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023212047,0.000017871705,0.94498026,0.0000067024307,0.0000919457,0.00034502748,0.000007883528,0.00008693134,0.031251308],"genre_scores_gemma":[0.76218855,0.0000064671626,0.23734386,0.000019817002,0.00005116628,0.000014511814,0.000025528278,0.000024822282,0.00032527559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932253,0.0000116253605,0.00012882949,0.0001298129,0.00017248967,0.00023469841],"domain_scores_gemma":[0.9995859,0.000044854372,0.00001763348,0.00025836364,0.00004083237,0.00005239912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014886234,0.0001028396,0.0000933041,0.00006632304,0.00007569229,0.000054173997,0.00016594534,0.000046852972,0.00000581322],"category_scores_gemma":[0.000021082622,0.00008098278,0.000022455795,0.00015857306,0.000014855171,0.00009791829,0.00005242741,0.00016644581,0.000038868857],"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.00000410212,0.000026424674,0.000009937465,0.0001177627,0.0000030160263,1.2171088e-7,0.00029393038,0.9935511,0.0047208434,0.00028971012,0.000068099034,0.00091497105],"study_design_scores_gemma":[0.00016470453,0.000014437283,0.00007479881,0.0000058204837,0.000005604731,0.000008819015,0.00012617772,0.99295413,0.005905391,0.000044432716,0.0005819029,0.00011374931],"about_ca_topic_score_codex":0.000008037732,"about_ca_topic_score_gemma":3.0739238e-7,"teacher_disagreement_score":0.73897654,"about_ca_system_score_codex":0.000068652516,"about_ca_system_score_gemma":0.000009266071,"threshold_uncertainty_score":0.3302382},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53456914,0.00016097762,0.002145898,0.0007285509,0.0007338173,0.0009429505,0.0000038600265,0.0002201869,0.46049464],"genre_scores_gemma":[0.98433363,0.00005284323,0.00031263332,0.0010400618,0.0008522677,0.00007585259,0.000055760014,0.000054421333,0.013222541],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786776,0.000021536453,0.0002894535,0.0005591874,0.0005835031,0.00067854795],"domain_scores_gemma":[0.99914116,0.000025047648,0.00013751558,0.0005729991,0.00009536561,0.000027905866],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009321254,0.00024685464,0.00022992851,0.0004951768,0.0002613681,0.0005206827,0.00066058274,0.00006129389,0.0038087314],"category_scores_gemma":[0.00003850728,0.00023369229,0.000107750166,0.00054095907,0.000052689735,0.0008636094,0.0010392505,0.00029356193,0.003279838],"study_design_candidate":"observational","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.00008344774,0.000591437,0.7587818,0.0015031056,0.00026794043,0.000008520645,0.00056600024,0.0015853293,0.00041352364,0.17766003,0.020711217,0.03782763],"study_design_scores_gemma":[0.0048870016,0.00009455484,0.23803861,0.00033642794,0.00017376643,0.0000038592907,0.012732213,0.35259634,0.00006728895,0.015615018,0.37326285,0.0021920488],"about_ca_topic_score_codex":0.0019518124,"about_ca_topic_score_gemma":0.000032391446,"teacher_disagreement_score":0.5207432,"about_ca_system_score_codex":0.0000893119,"about_ca_system_score_gemma":0.000015945903,"threshold_uncertainty_score":0.99749625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98740697,0.000027789127,0.001852472,0.0003010641,0.00018656415,0.0002340486,0.000013201059,0.00018535394,0.009792535],"genre_scores_gemma":[0.99791753,0.000042653235,0.0015650723,0.000038785216,0.000021333892,0.000013578773,0.00004759976,0.000019389754,0.0003340393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939895,0.000015122165,0.0001311166,0.00013971787,0.00014885406,0.00016621711],"domain_scores_gemma":[0.999645,0.0000767121,0.000009442655,0.00016108225,0.000054458633,0.000053334723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016226423,0.000078546334,0.00009496451,0.00010805691,0.00005569985,0.000037864083,0.000045548208,0.000052675954,0.00020062909],"category_scores_gemma":[0.000024946676,0.00008539481,0.000016438786,0.00018354483,0.00001942306,0.00010955812,0.000005998875,0.00015303005,0.000041607655],"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.00001457367,0.0000134396905,0.026849847,0.00014594024,0.00003776814,0.0000061684136,0.0007455009,0.9539231,0.01507949,0.0015444992,0.00058269803,0.0010569858],"study_design_scores_gemma":[0.0026537986,0.00026324645,0.28670153,0.00038148143,0.000040593914,0.000021391172,0.002382838,0.6655293,0.031624846,0.00017520209,0.009214687,0.0010110402],"about_ca_topic_score_codex":0.000018564067,"about_ca_topic_score_gemma":0.000028024138,"teacher_disagreement_score":0.28839377,"about_ca_system_score_codex":0.000030812473,"about_ca_system_score_gemma":0.000015046783,"threshold_uncertainty_score":0.34822994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13188535,0.0017013674,0.86025906,0.00027974005,0.00019343564,0.0004515837,0.000008488403,0.0005557538,0.004665253],"genre_scores_gemma":[0.9801967,0.00028134964,0.019155292,0.000030122514,0.00007044405,0.00004240911,0.00002449949,0.000034269564,0.00016491883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990391,0.00004234224,0.00017165179,0.00025692605,0.00013698034,0.0003529838],"domain_scores_gemma":[0.99956757,0.000081366874,0.000017803402,0.00018060365,0.000087905966,0.00006475468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017757942,0.00013794082,0.00018400536,0.00016341833,0.00014763634,0.00004886524,0.00010126363,0.000097044634,0.0000036738163],"category_scores_gemma":[0.000029218409,0.0001494879,0.000025014755,0.0006602366,0.000041322837,0.00012432161,0.00006738858,0.0003336717,0.000004365736],"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.000030455478,0.000026658454,0.012758864,0.0006113871,0.000060653398,0.0000048790766,0.00093920314,0.93899965,0.00033010365,0.010780568,0.000096031705,0.03536154],"study_design_scores_gemma":[0.00034966832,0.00001573478,0.0035477933,0.00012384409,0.00000561527,0.0000033407175,0.00059167796,0.99442554,0.00026939178,0.0004442595,0.00006702092,0.0001561093],"about_ca_topic_score_codex":0.000026219557,"about_ca_topic_score_gemma":0.00000800519,"teacher_disagreement_score":0.84831136,"about_ca_system_score_codex":0.00008761126,"about_ca_system_score_gemma":0.000042215048,"threshold_uncertainty_score":0.6095939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53059864,0.0021730857,0.45497507,0.0026070804,0.00062482746,0.0010062349,0.000015142262,0.0004615643,0.0075383466],"genre_scores_gemma":[0.99391776,0.00023719897,0.0055791084,0.000021834036,0.000013784848,0.000034084907,0.000017278942,0.000012053872,0.00016689401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991789,0.000029781373,0.00022166118,0.00012321788,0.00023237956,0.00021405522],"domain_scores_gemma":[0.99969786,0.00005340177,0.000021375283,0.00014347954,0.000050654733,0.000033225126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063094916,0.000071752846,0.0001290913,0.00022712597,0.00015419969,0.0000068921977,0.00019469344,0.00015045844,0.00004922639],"category_scores_gemma":[0.000034992518,0.00007387691,0.000038568152,0.00020057317,0.000069001246,0.000011653734,0.00008256279,0.0002960422,0.0000023101395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001415573,0.00021091857,0.0036963397,0.005035685,0.000289797,0.000014245312,0.0017186796,0.28235412,0.011075572,0.4761168,0.00048280426,0.21886347],"study_design_scores_gemma":[0.00030730522,0.000027540282,0.00052583835,0.00015514636,0.000010722903,0.000001390098,0.00051920535,0.9897972,0.005334263,0.0003544783,0.0029007657,0.00006619442],"about_ca_topic_score_codex":0.000028446002,"about_ca_topic_score_gemma":0.000014500353,"teacher_disagreement_score":0.70744306,"about_ca_system_score_codex":0.00010457749,"about_ca_system_score_gemma":0.000040979827,"threshold_uncertainty_score":0.30126128},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5133104,0.00016794268,0.48432449,0.00013767183,0.00004593583,0.00023364545,0.000005608398,0.000013080499,0.0017612787],"genre_scores_gemma":[0.99885154,0.000011018688,0.0009886099,0.00004850197,0.000018782515,0.000021549784,0.000030577445,0.000003669518,0.000025744113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993757,0.0012712568,0.0009468396,0.00034978642,0.0032338898,0.00044119658],"domain_scores_gemma":[0.9951687,0.0018828538,0.00022360626,0.00057771563,0.0021031718,0.000043954373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025464196,0.00013737519,0.0003374757,0.0006805029,0.00026957944,0.00021625169,0.0006666939,0.0001242843,0.000046505906],"category_scores_gemma":[0.0074817655,0.00010250884,0.00007924689,0.0075269947,0.00018533818,0.00057810405,0.00013138296,0.00037902757,0.000030160632],"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.00014608745,0.00008457956,0.01216522,0.000009030706,0.000013179313,3.6516334e-7,0.00054933794,0.90530133,0.000012646288,0.053890154,0.000047194182,0.027780866],"study_design_scores_gemma":[0.00030507476,0.00005080862,0.0128059555,0.00011295587,0.000036352154,7.9496624e-7,0.00048809772,0.83685774,0.000104910345,0.1491247,0.000024861392,0.00008772528],"about_ca_topic_score_codex":0.00016673768,"about_ca_topic_score_gemma":0.00012941516,"teacher_disagreement_score":0.4855412,"about_ca_system_score_codex":0.00027209992,"about_ca_system_score_gemma":0.0006692393,"threshold_uncertainty_score":0.8956913},"labels":[],"label_agreement":null}]}