{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Gianpaolo Ghiani","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009633375,0.001281487,0.001344947,0.00105704,0.000649498,0.002170276,0.001569819,0.002707784,0.01597722],"category_scores_gemma":[0.00414853,0.0006637907,0.0007850074,0.002536087,0.0008993042,0.002892237,0.001620946,0.001883783,0.002281984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054855,"about_ca_system_score_gemma":0.0008156558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002019246,"about_ca_topic_score_gemma":0.002396765,"domain_scores_codex":[0.999319,0.0002729182,0.00002233819,0.0001660365,0.0001566259,0.00006305431],"domain_scores_gemma":[0.9990323,0.0006787596,0.00008471562,0.0000686983,0.00008398328,0.00005170119],"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.00008955936,0.0001374878,0.0006048277,0.0003657327,0.00008529806,0.0001880091,0.00008978172,0.499804,0.0005867375,0.3477612,0.03039462,0.1198928],"study_design_scores_gemma":[0.00005317189,0.00005104174,0.0002282468,0.00005523546,0.00003874019,0.00020681,0.00009163451,0.6790355,0.0005446151,0.2904243,0.02925483,0.00001597215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01622476,0.003508279,0.9139117,0.001836495,0.0003289995,0.0001484625,0.001179785,0.0003465793,0.06251504],"genre_scores_gemma":[0.3572922,0.007058714,0.4765778,0.0007699038,0.0008270747,0.0005688932,0.002908552,0.0003927814,0.1536041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01597722,"threshold_uncertainty_score":0.05344909,"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","authors":[{"name":"Jean-Pierre Crouzeix","is_ca":false},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Hien Van Nguyen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003515108,0.001200679,0.001471625,0.001483934,0.001121546,0.002508241,0.001975863,0.001839309,0.008431064],"category_scores_gemma":[0.0139126,0.0005368384,0.001261653,0.002080315,0.001727303,0.003703173,0.002917182,0.002837142,0.001360819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705393,"about_ca_system_score_gemma":0.001778081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002911392,"about_ca_topic_score_gemma":0.00494731,"domain_scores_codex":[0.9985465,0.0006700405,0.00008795516,0.0001884962,0.0003840863,0.0001227534],"domain_scores_gemma":[0.9972188,0.001805784,0.00008575927,0.0003902337,0.0004138162,0.00008564207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001548822,0.0001039379,0.0006631407,0.0002451121,0.00006024406,0.00005254625,0.000196287,0.1816443,0.001515834,0.609738,0.004399193,0.2012264],"study_design_scores_gemma":[0.00003420929,0.00005233251,0.0001308149,0.0001080825,0.0000181839,0.00004780974,0.00004868784,0.7000614,0.00139669,0.2886872,0.009394516,0.00001998496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008386067,0.0006075221,0.9769163,0.0004471916,0.0002737557,0.00005578698,0.00004619829,0.0001966277,0.01307056],"genre_scores_gemma":[0.1839115,0.0009755822,0.799596,0.0006525706,0.0002275034,0.0002061132,0.0001427533,0.0004069428,0.01388097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008431064,"threshold_uncertainty_score":0.02820474,"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","authors":[{"name":"Gagandeep Singh","is_ca":false},{"name":"Umesh Gupta","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547893,0.0004914362,0.0010628,0.0008299347,0.0009912825,0.001372207,0.001944743,0.001061656,0.005251401],"category_scores_gemma":[0.005707644,0.0004022158,0.0007483485,0.0007307345,0.000757373,0.001622973,0.001160559,0.001187746,0.0002124289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001990264,"about_ca_system_score_gemma":0.003465238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03092026,"about_ca_topic_score_gemma":0.01638512,"domain_scores_codex":[0.9995741,0.000137652,0.00001295581,0.00005566332,0.00009606265,0.0001235227],"domain_scores_gemma":[0.9965031,0.002572879,0.0001714545,0.0001037381,0.0004220342,0.0002267657],"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.0001219253,0.000117304,0.001258558,0.00007441604,0.00002168284,0.0001072739,0.00005300417,0.955317,0.0005491503,0.03659386,0.00190191,0.003883959],"study_design_scores_gemma":[0.000003953671,0.000002992213,0.00004097896,7.964846e-7,0.00000154956,0.000002847155,0.000005449331,0.9985005,0.00001942666,0.001395476,0.00002499688,0.000001121631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5429505,0.001468349,0.4300064,0.003215324,0.0004161794,0.0001589912,0.0006551484,0.000553309,0.0205758],"genre_scores_gemma":[0.9643686,0.0002649181,0.03042292,0.0001883049,0.0001710221,0.00007571768,0.0002204709,0.00007174223,0.004216189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03092026,"threshold_uncertainty_score":0.06148058,"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","authors":[{"name":"Calice Olivier Pieume","is_ca":true},{"name":"Laure Pauline Fotso","is_ca":false},{"name":"Patrick Siarry","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139042,0.001119988,0.001762879,0.0009345582,0.0006204853,0.001990901,0.001296919,0.001595754,0.003119534],"category_scores_gemma":[0.006441636,0.001101098,0.001193912,0.001777294,0.000936717,0.002254575,0.00296954,0.002119254,0.0005106027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004805999,"about_ca_system_score_gemma":0.0009611777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001067538,"about_ca_topic_score_gemma":0.001330614,"domain_scores_codex":[0.9990447,0.000448235,0.00006133255,0.0001133431,0.0002564906,0.00007585644],"domain_scores_gemma":[0.9988114,0.0007495114,0.0001193658,0.0001171046,0.0001648183,0.00003783958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008288385,0.0000942285,0.000387924,0.0002790082,0.000123315,0.00006628235,0.000118979,0.7889835,0.001614611,0.09150153,0.001569016,0.1151787],"study_design_scores_gemma":[0.000008557477,0.00002322632,0.0000309711,0.0000150964,0.000009403859,0.00002255118,0.00001479121,0.9783155,0.0004219981,0.02027718,0.0008559694,0.000004903108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003932883,0.0002226421,0.9940899,0.0001128189,0.00002259165,0.00001297299,0.000007446108,0.00005579625,0.001542951],"genre_scores_gemma":[0.2131652,0.0004793401,0.7819083,0.0001188034,0.00008325989,0.0001933662,0.00005927016,0.0001652527,0.003827249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003119534,"threshold_uncertainty_score":0.01131248,"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","authors":[{"name":"Mohamed A. Tawhid","is_ca":true},{"name":"Ahmed F. Ali","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008369037,0.0007460457,0.0008790277,0.0008630755,0.0004729115,0.0008457872,0.0007621109,0.0009409856,0.002348603],"category_scores_gemma":[0.00207772,0.000346956,0.0005427814,0.001625379,0.0006141277,0.000726797,0.0008351806,0.001545591,0.0005487616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004332774,"about_ca_system_score_gemma":0.0006946936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001980012,"about_ca_topic_score_gemma":0.001687462,"domain_scores_codex":[0.9995949,0.0001468319,0.00001745168,0.00003527152,0.0001828839,0.00002277007],"domain_scores_gemma":[0.9996825,0.0001619234,0.00002614384,0.0000457956,0.00007167453,0.00001200903],"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.0001284372,0.00009208827,0.0003294793,0.000249304,0.0001069492,0.00007124899,0.0001144126,0.7184302,0.005543558,0.06443013,0.003514382,0.2069899],"study_design_scores_gemma":[0.00001840088,0.00003005613,0.00007999703,0.00001073048,0.00001425997,0.00001550321,0.000007207199,0.9890524,0.001088597,0.007797528,0.001879407,0.000005914148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008002489,0.0006596037,0.9841888,0.00008204936,0.00009802001,0.00005148305,0.0000261624,0.0002421338,0.00664926],"genre_scores_gemma":[0.2211448,0.0008723392,0.7698767,0.00008082847,0.00009983229,0.0003445192,0.0001259463,0.000208306,0.007246796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002348603,"threshold_uncertainty_score":0.007856846,"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","authors":[{"name":"Mostafa Salari","is_ca":true},{"name":"R. John Milne","is_ca":false},{"name":"Lina Kattan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000595097,0.00253463,0.002401305,0.001030518,0.0007088191,0.002257317,0.001032886,0.002259751,0.01029904],"category_scores_gemma":[0.001388086,0.0009969847,0.001416295,0.00105365,0.0005410611,0.001470557,0.0007507292,0.001318072,0.0007949338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008455403,"about_ca_system_score_gemma":0.00121694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02003915,"about_ca_topic_score_gemma":0.009956103,"domain_scores_codex":[0.999605,0.0001071689,0.000008003265,0.00007292289,0.00004016893,0.0001667777],"domain_scores_gemma":[0.9993963,0.0003093324,0.00005017675,0.00002507831,0.0001013067,0.0001178465],"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.0001976616,0.00007544985,0.0004962964,0.00008363756,0.000040375,0.00009435055,0.00001642338,0.9898913,0.001063174,0.0008991632,0.001112528,0.006029574],"study_design_scores_gemma":[0.00002316162,0.0001153175,0.0006896638,0.00001321167,0.00003762999,0.0000172741,0.00005471697,0.9976497,0.0003230249,0.0006400766,0.000428587,0.000007546265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6632848,0.002660491,0.2746338,0.001137926,0.0006161465,0.0002450461,0.001402606,0.0006258351,0.05539333],"genre_scores_gemma":[0.9696612,0.0004636165,0.01618145,0.000100059,0.00007367793,0.00007908047,0.0004844423,0.000134156,0.01282233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02003915,"threshold_uncertainty_score":0.03984499,"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","authors":[{"name":"Shruti Shashikumar","is_ca":false},{"name":"Rakesh D. Raut","is_ca":false},{"name":"Vaibhav S. Narwane","is_ca":false},{"name":"Bhaskar B. Gardas","is_ca":false},{"name":"Balkrishna E. Narkhede","is_ca":false},{"name":"Anjali Awasthi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004457411,0.001173199,0.001397787,0.001991613,0.0009238402,0.001364246,0.001862922,0.001160357,0.004224397],"category_scores_gemma":[0.001218101,0.0005705471,0.00112274,0.001786699,0.0005563113,0.001030528,0.001009464,0.000742482,0.000669681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021492,"about_ca_system_score_gemma":0.002278917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01280689,"about_ca_topic_score_gemma":0.01130094,"domain_scores_codex":[0.9995751,0.00008110776,0.00002153064,0.00008802401,0.0001458016,0.00008834115],"domain_scores_gemma":[0.9995183,0.0002164618,0.00004509952,0.00005268969,0.0001343504,0.00003299036],"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.0001606516,0.0001958908,0.001537069,0.0002384287,0.0001251557,0.0002089704,0.0001140984,0.6824054,0.009898471,0.02413498,0.005883273,0.2750977],"study_design_scores_gemma":[0.00001819247,0.00005503015,0.0001814208,0.000009841055,0.00002513884,0.00006761604,0.00003800252,0.9921898,0.002005521,0.003656837,0.001739651,0.00001284382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01267457,0.0002867792,0.9806924,0.00009018101,0.00008882998,0.0001223506,0.0001098114,0.0006699649,0.0052651],"genre_scores_gemma":[0.2145193,0.0003286077,0.7790834,0.0001803418,0.00006047864,0.0002731395,0.000388453,0.0001571709,0.00500905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01280689,"threshold_uncertainty_score":0.02546471,"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","authors":[{"name":"Ranjan Pal","is_ca":false},{"name":"Jeebak Mitra","is_ca":true},{"name":"Manabendra Nath Pal","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008377442,0.00111302,0.001393485,0.004453155,0.0005342527,0.002008948,0.001055907,0.0007286748,0.001053724],"category_scores_gemma":[0.02014117,0.000392924,0.001119351,0.003040536,0.0007852049,0.001775637,0.0006835877,0.0006520567,0.0001129296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002581301,"about_ca_system_score_gemma":0.001169436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003820696,"about_ca_topic_score_gemma":0.003194969,"domain_scores_codex":[0.994539,0.002350865,0.000402447,0.0004770719,0.002032165,0.0001983895],"domain_scores_gemma":[0.9864603,0.009564251,0.001125929,0.000518197,0.002188166,0.0001430014],"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.0004731479,0.0002730025,0.005326393,0.0003270658,0.0003199541,0.00006925387,0.0002785503,0.7348607,0.0126582,0.01772283,0.0002724478,0.2274184],"study_design_scores_gemma":[0.00001189728,0.0001867604,0.001557907,0.00002052465,0.00007499477,0.00002043501,0.00005586303,0.9919536,0.00334355,0.00250877,0.0002502239,0.00001555626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2048989,0.0005178175,0.7889021,0.0001284164,0.0000231923,0.0001174712,0.00009926218,0.0001167977,0.005196068],"genre_scores_gemma":[0.8013134,0.0001598956,0.1975087,0.00001892581,0.00001409318,0.0001277426,0.0001103016,0.00002165795,0.0007252083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008377442,"threshold_uncertainty_score":0.04430473,"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","authors":[{"name":"Suresha Kharvi","is_ca":false},{"name":"Timo Pakkala","is_ca":false},{"name":"G. Srinivasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007944286,0.001235081,0.003355655,0.002831434,0.001507793,0.005398335,0.002780626,0.003799887,0.01429113],"category_scores_gemma":[0.02150693,0.002384842,0.00233783,0.00256349,0.003565042,0.007804076,0.002228943,0.003843491,0.001001624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005247275,"about_ca_system_score_gemma":0.00507344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02648524,"about_ca_topic_score_gemma":0.01763997,"domain_scores_codex":[0.9964027,0.001751537,0.0001337657,0.0005099953,0.000366408,0.0008355994],"domain_scores_gemma":[0.9688827,0.02654161,0.001905177,0.0007558222,0.001043788,0.0008709388],"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.0000974564,0.00006614265,0.0005726738,0.00003198465,0.00004871651,0.00009047838,0.00007016784,0.8843475,0.0001251051,0.1111478,0.0009144488,0.002487554],"study_design_scores_gemma":[0.00002150594,0.00001443657,0.0001213981,0.00001292993,0.00001819442,0.000009726017,0.00002769908,0.954018,0.00005097342,0.04552999,0.0001582859,0.00001691592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1909388,0.001017683,0.7753572,0.003665164,0.0001714069,0.0002539063,0.001384118,0.0005262428,0.02668548],"genre_scores_gemma":[0.9516701,0.001304767,0.02923701,0.0002545538,0.0001688816,0.000211166,0.0005999809,0.0001481704,0.01640541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02648524,"threshold_uncertainty_score":0.05266213,"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","authors":[{"name":"Alkan Durmuş","is_ca":false},{"name":"Ömer Aydın","is_ca":true},{"name":"Feriştah Dalkılıç","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008927678,0.0009545229,0.001216003,0.001414924,0.000482121,0.001628006,0.0008552998,0.0008805211,0.002016621],"category_scores_gemma":[0.002584218,0.000458494,0.0008996094,0.001255654,0.000270266,0.001190166,0.0005512974,0.0009373486,0.0006685074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078562,"about_ca_system_score_gemma":0.001945277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01145351,"about_ca_topic_score_gemma":0.008279194,"domain_scores_codex":[0.999386,0.0001537404,0.00005763891,0.0001325424,0.0001291704,0.0001408942],"domain_scores_gemma":[0.9988054,0.0006083928,0.000150777,0.00008764266,0.0002942185,0.00005358746],"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.0002696104,0.000454486,0.008067981,0.00008163061,0.00008255804,0.00006796961,0.00003873892,0.6942253,0.003651772,0.001174546,0.004273096,0.2876122],"study_design_scores_gemma":[0.000003847282,0.00002123283,0.0004279961,0.000002968895,0.000005408866,0.000007245584,0.000008277771,0.9982743,0.0006057143,0.0005137923,0.0001265464,0.000002674964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2734237,0.001590307,0.7159458,0.001163633,0.0001948529,0.0001590948,0.0008122901,0.003154104,0.003556183],"genre_scores_gemma":[0.8919333,0.0002858283,0.1040064,0.0001267216,0.000101409,0.00007697411,0.001153338,0.00007350751,0.002242489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01145351,"threshold_uncertainty_score":0.02277368,"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","authors":[{"name":"Yogendra P. Chaubey","is_ca":true},{"name":"Fassil Nebebe","is_ca":true},{"name":"Suresh Kumar Goyal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657498,0.001504529,0.002262277,0.0009241813,0.0007254948,0.003186342,0.001832576,0.002164503,0.005609744],"category_scores_gemma":[0.007208689,0.0007899631,0.001038369,0.001944851,0.001992837,0.002087165,0.001440079,0.001527428,0.0004001922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569638,"about_ca_system_score_gemma":0.001221977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006935249,"about_ca_topic_score_gemma":0.004956146,"domain_scores_codex":[0.998874,0.0004282663,0.00005436317,0.0002045116,0.0002701225,0.0001685631],"domain_scores_gemma":[0.9964529,0.002434762,0.0002882009,0.000110723,0.000587482,0.0001258654],"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.0003303002,0.0001640174,0.0006034822,0.0004522477,0.0001679459,0.0003748483,0.0002302534,0.8056613,0.002833994,0.1338763,0.005746999,0.04955811],"study_design_scores_gemma":[0.00003292147,0.0001256644,0.0004415594,0.00003159722,0.00007754964,0.00006263546,0.00004240387,0.9603001,0.0003875917,0.03670382,0.001764067,0.00003005336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06707355,0.009786147,0.8654177,0.003102122,0.001460979,0.0001505274,0.0002021517,0.0002146377,0.05259225],"genre_scores_gemma":[0.9501306,0.005470776,0.01620379,0.0003984557,0.0007035721,0.000098264,0.00006864037,0.00007852856,0.0268473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006935249,"threshold_uncertainty_score":0.01876646,"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)","authors":[{"name":"Hashem Omrani","is_ca":true},{"name":"Raha Imanirad","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324938,0.0007027277,0.0008743877,0.0009801688,0.0004207023,0.002021239,0.0008241102,0.0009869895,0.0008423212],"category_scores_gemma":[0.007483322,0.0003800655,0.0006750668,0.001216114,0.0006688161,0.002022961,0.0006537804,0.0009693585,0.00007784252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001873799,"about_ca_system_score_gemma":0.001260514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01271161,"about_ca_topic_score_gemma":0.006989169,"domain_scores_codex":[0.9990966,0.0004630012,0.00003574121,0.0001094247,0.0002020532,0.00009328176],"domain_scores_gemma":[0.9969606,0.002266187,0.0002543141,0.00009690002,0.0003701952,0.00005178115],"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.00002101916,0.0000236697,0.0003951245,0.00001537424,0.00002319538,0.00002394426,0.00001609126,0.9879227,0.0001983468,0.00689568,0.00008428202,0.004380515],"study_design_scores_gemma":[8.050141e-7,0.000004353442,0.0001128781,0.000001829535,0.000003745354,0.000003038552,0.000003675046,0.9983857,0.00006853072,0.001388049,0.00002564809,0.000001798472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1339027,0.0004070267,0.8623247,0.000366027,0.00002764183,0.00005564586,0.00007619936,0.00006257959,0.002777554],"genre_scores_gemma":[0.9733374,0.0002186618,0.02447587,0.00002459499,0.00001812596,0.00004554993,0.00006054647,0.00001725003,0.001801954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01271161,"threshold_uncertainty_score":0.02527523,"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","authors":[{"name":"Pooja Pandey","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051066,0.0009505796,0.001441764,0.0009699201,0.0006987603,0.001222411,0.001134374,0.001380213,0.005924281],"category_scores_gemma":[0.003746782,0.0007131742,0.0008144531,0.001498584,0.0006284065,0.001302126,0.001466925,0.001842029,0.001056765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008015041,"about_ca_system_score_gemma":0.001621192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005551404,"about_ca_topic_score_gemma":0.004114987,"domain_scores_codex":[0.9995084,0.0002181091,0.00002222518,0.00004441267,0.0001677271,0.00003906072],"domain_scores_gemma":[0.9991274,0.0005507119,0.00003777965,0.00006374966,0.0001801758,0.00004017513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001102736,0.00008511599,0.000210016,0.0001476148,0.00006084126,0.00004951688,0.00009517578,0.787929,0.001466886,0.04137895,0.003867253,0.1645994],"study_design_scores_gemma":[0.00001634342,0.00001628013,0.00002369986,0.00001147079,0.000006669532,0.00001182646,0.000007292761,0.9907403,0.0002720673,0.007238621,0.001648821,0.000006659825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002766868,0.0001533887,0.9940753,0.00007599469,0.0000398106,0.00004614175,0.00003392417,0.0002288047,0.002579703],"genre_scores_gemma":[0.06770874,0.0003402722,0.9263935,0.00006598271,0.00004561083,0.0003700543,0.0001069996,0.0002359792,0.004732874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005924281,"threshold_uncertainty_score":0.01981872,"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","authors":[{"name":"Najmeh Nabavizadeh","is_ca":false},{"name":"Majid Rafiee","is_ca":false},{"name":"Vahid Kayvanfar","is_ca":false},{"name":"Nima Moradi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002367655,0.001795322,0.001558023,0.001680067,0.0005793707,0.002661134,0.001946306,0.001735484,0.005750241],"category_scores_gemma":[0.002504259,0.001153852,0.001408727,0.001500344,0.0006139079,0.001318706,0.001482207,0.001749176,0.0004628407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594559,"about_ca_system_score_gemma":0.002462718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01194845,"about_ca_topic_score_gemma":0.008546961,"domain_scores_codex":[0.9988027,0.0006735975,0.00003685669,0.0001386351,0.000194383,0.0001537112],"domain_scores_gemma":[0.9983511,0.001022319,0.0001619717,0.00004734333,0.0002973745,0.000119915],"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.00002047422,0.00004652458,0.0002743967,0.00005224886,0.00003308949,0.00004400282,0.00001288228,0.9921696,0.0001942443,0.003153951,0.0003059266,0.003692772],"study_design_scores_gemma":[0.000003850919,0.00001647732,0.00005608338,0.00000745448,0.000005934212,0.000004043795,0.00001557449,0.9985445,0.00003817998,0.001062675,0.0002423906,0.000002939335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04099467,0.0009227869,0.9434698,0.0009700329,0.0001350711,0.0002428153,0.0004761025,0.0002249451,0.01256387],"genre_scores_gemma":[0.663845,0.001088444,0.3242146,0.0003606532,0.000174577,0.000574646,0.0006319555,0.0001319652,0.008978117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01194845,"threshold_uncertainty_score":0.02375776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}