{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":10,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":10,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"45dbae460def","filters":{"venue":"New Generation Computing"}},"results":[{"id":"W1600165002","doi":"10.1007/bf03037362","title":"The power of communication: P systems with symport/antiport","year":2002,"lang":"en","type":"article","venue":"New Generation Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":341,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane computing; Antiporter; Membrane; Symporter; Computer science; Computation; Power (physics); Theoretical computer science; Chemistry; Algorithm; Physics; Biochemistry; Transporter; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.02731062806746406,"gpt":0.2381451841888484,"spread":0.2108345561213844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441072,0.00008810431,0.00009404652,0.00001142123,0.000265259,0.00005322814,0.000195494,0.0000621731,0.00000783481],"category_scores_gemma":[0.00003232177,0.00005441851,0.00003579324,0.00008372973,0.00005633566,0.000002359263,0.00008697515,0.00006111377,0.000003371283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004982088,"about_ca_system_score_gemma":0.00002113325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001410411,"about_ca_topic_score_gemma":0.000009165897,"domain_scores_codex":[0.9992629,0.00007369887,0.0002515362,0.0001668633,0.000111707,0.0001332987],"domain_scores_gemma":[0.9993131,0.00002765713,0.0001752785,0.0003340374,0.0001104297,0.00003949683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009806572,0.0002715117,0.05269399,0.00003123923,0.0003961075,0.000007600393,0.0007636678,0.1008157,0.632755,0.01183045,0.09063451,0.1097021],"study_design_scores_gemma":[0.002568582,0.00279616,0.009577354,0.0001878781,0.00007200699,0.000208283,0.0007536699,0.5138672,0.1270363,0.00005794435,0.3416947,0.001179823],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9716328,0.003407291,0.0203798,0.0002770571,0.000193278,0.0001476781,8.537326e-7,0.00001921271,0.003942023],"genre_scores_gemma":[0.9968786,0.00008739776,0.001802816,0.00009861697,0.0003562881,0.000001252669,0.00002777431,0.000007520313,0.0007397908],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5057187,"threshold_uncertainty_score":0.2219122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024144496","doi":"10.1007/bf03037572","title":"Logic-based genetic programming with definite clause translation grammars","year":2001,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Definite clause grammar; Tree-adjoining grammar; Programming language; Natural language processing; Context-free grammar; Genetic programming; Artificial intelligence; Context-sensitive grammar; Rule-based machine translation; Attribute grammar; Grammar; Affix grammar; Synchronous context-free grammar; L-attributed grammar; Generative grammar; Linguistics; Example-based machine translation","retraction":null,"screen_n_in":null,"score":{"opus":0.04981549137993206,"gpt":0.2629529065584332,"spread":0.2131374151785011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001492081,0.0001573219,0.0001124942,0.0001035892,0.0004441182,0.0002641999,0.0003067929,0.00005997382,0.000008567744],"category_scores_gemma":[0.0000073041,0.0001467325,0.00004639957,0.000718767,0.00002685577,0.0002438367,0.00003104925,0.0001145398,0.00002461652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004362916,"about_ca_system_score_gemma":0.0001705139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000527357,"about_ca_topic_score_gemma":0.00006218015,"domain_scores_codex":[0.9986627,0.00005508772,0.0002820498,0.0004424885,0.0002757489,0.0002819828],"domain_scores_gemma":[0.9992229,0.00006511226,0.0001250481,0.0003503187,0.0001149371,0.0001216709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003969045,0.0000777294,0.001745661,0.000004164735,0.000009129797,0.000008612827,0.0001925631,0.2573148,0.001220334,0.017617,0.0003086919,0.7214973],"study_design_scores_gemma":[0.0005465224,0.000129355,0.002123264,0.00001257574,0.00000865732,0.00003344344,0.000007282577,0.9850116,0.0002728433,0.0008834218,0.01076306,0.0002079938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02395593,0.0002087054,0.9731438,0.00177546,0.0001152094,0.000298349,5.192316e-7,0.0003162064,0.0001858179],"genre_scores_gemma":[0.3327779,0.000006469646,0.666421,0.0003585916,0.0003424303,0.00001277669,0.00002896732,0.000009508473,0.00004239023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7276967,"threshold_uncertainty_score":0.5983576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086609533","doi":"10.1007/bf03040964","title":"Procedural texture evolution using multi-objective optimization","year":2004,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Computer science; Pareto principle; Multi-objective optimization; Ranking (information retrieval); Artificial intelligence; Genetic programming; Feature (linguistics); Evolutionary algorithm; Pattern recognition (psychology); Population; Abstraction; Feature vector; Data mining; Machine learning; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03252205465707154,"gpt":0.2886651881681984,"spread":0.2561431335111269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001755128,0.0002740677,0.0002017421,0.0002445196,0.000612035,0.0002843705,0.0003716649,0.0001355006,0.00000739764],"category_scores_gemma":[0.0001722759,0.0002974838,0.00007301422,0.00103682,0.00003519909,0.001380697,0.0001824126,0.0002148151,0.00001673635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008698915,"about_ca_system_score_gemma":0.0005786236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009875953,"about_ca_topic_score_gemma":0.00002675367,"domain_scores_codex":[0.998055,0.00008159586,0.0004119054,0.0007207234,0.0003562954,0.0003744524],"domain_scores_gemma":[0.9986432,0.00002752246,0.000310626,0.0003503894,0.0005133716,0.000154879],"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.000002393292,0.00005577696,0.00006758549,0.000003801503,0.00001129644,0.000002740107,0.0008775378,0.9804491,0.004028915,0.003352627,0.00002125963,0.01112691],"study_design_scores_gemma":[0.001503938,0.00005522242,0.0003606405,0.00003119752,0.000008118969,0.0000481928,0.00005888435,0.9924318,0.004820436,0.000335754,0.00001593385,0.0003299178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002143436,0.0001065843,0.9954552,0.0002837239,0.0009223856,0.0004867329,0.000001413338,0.0004849746,0.000115556],"genre_scores_gemma":[0.3180382,0.000002356406,0.6810245,0.0002666338,0.0005672674,0.000003503336,0.00001834599,0.00002234752,0.00005684238],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3158948,"threshold_uncertainty_score":0.9999477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3174933226","doi":"10.1007/s00354-021-00131-5","title":"Computer-Aided-Diagnosis as a Service on Decentralized Medical Cloud for Efficient and Rapid Emergency Response Intelligence","year":2021,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":18,"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":"Computer science; Workload; Cloud computing; CAD; Artificial intelligence; Machine learning; Health care; Service (business); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03121236064216924,"gpt":0.3013314093945483,"spread":0.270119048752379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009091491,0.0001789149,0.0002103186,0.0001025819,0.0004552215,0.0001184061,0.0005401773,0.0001865586,0.00006985585],"category_scores_gemma":[0.0003868719,0.0001883063,0.00006601412,0.0007049625,0.00003028055,0.00004803144,0.0003744156,0.000198401,0.00002330613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004466896,"about_ca_system_score_gemma":0.000311346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002593863,"about_ca_topic_score_gemma":0.00003813925,"domain_scores_codex":[0.9979658,0.0002102032,0.0004618419,0.0007111216,0.0003391042,0.0003119525],"domain_scores_gemma":[0.9982641,0.0005308277,0.0001346811,0.0005667446,0.0002889472,0.0002147179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005083795,0.0002988724,0.0001388139,0.00002792156,0.00003591832,0.00001761974,0.001508018,0.0133109,0.001450712,0.2288203,0.007415158,0.7469249],"study_design_scores_gemma":[0.000429666,0.0001662246,0.0001884556,0.00003539997,0.000007244658,0.00004375652,0.00002716116,0.9622087,0.02320891,0.002361484,0.01112748,0.0001954866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3418156,0.0004310004,0.6422482,0.01445297,0.0006410729,0.0002308116,0.000001511802,0.0001653432,0.00001354419],"genre_scores_gemma":[0.7926723,0.0002713883,0.2024481,0.003819417,0.0006688577,0.00005437889,0.0000186292,0.00001593561,0.00003095446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9488978,"threshold_uncertainty_score":0.7678908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977101885","doi":"10.1007/s00354-009-0115-7","title":"Evolutionary Synthesis of Stochastic Gene Network Models Using Feature-based Search Spaces","year":2011,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fitness function; Genetic programming; Modular design; Series (stratigraphy); Feature (linguistics); Function (biology); Noise (video); Fitness approximation; Set (abstract data type); Stochastic modelling; Measure (data warehouse); Artificial intelligence; Gene regulatory network; Genetic network; Gene expression programming; Genetic algorithm; Machine learning; Data mining; Mathematics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.04939823128084773,"gpt":0.2536482194920534,"spread":0.2042499882112056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002749536,0.0001699651,0.0002078766,0.00007773555,0.0001887676,0.00001875209,0.0001665857,0.0001499476,0.00001904324],"category_scores_gemma":[0.00002518856,0.0001822688,0.0001381951,0.0002480362,0.00005088391,0.000006062947,0.00009420384,0.0000721192,0.000001378848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003116533,"about_ca_system_score_gemma":0.0002754492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000801823,"about_ca_topic_score_gemma":0.00002195605,"domain_scores_codex":[0.9987181,0.0001460371,0.000261339,0.0003714577,0.0002179895,0.0002850216],"domain_scores_gemma":[0.9991912,0.00002197555,0.0001601917,0.0003452559,0.0001798153,0.0001015494],"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.00002272869,0.00002187404,0.0005485163,0.000006481595,0.00007619848,5.467209e-7,0.00003490628,0.8534319,0.1428919,0.00006577501,0.000972388,0.001926774],"study_design_scores_gemma":[0.0001499236,0.00005214906,0.0002303175,0.00001941835,0.00007012183,0.000004409369,0.00001177534,0.8442202,0.1549889,0.00008160213,0.00001829482,0.0001529095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4240533,0.0009565582,0.5747136,0.00001748383,0.0001040683,0.00008322634,0.000002327798,0.00001081505,0.00005860922],"genre_scores_gemma":[0.8570299,0.000005519507,0.1414316,0.00004747931,0.001342597,0.000001827703,0.00006520496,0.00002463135,0.00005129538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4332821,"threshold_uncertainty_score":0.7432705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056710678","doi":"10.1007/bf03037573","title":"From eager to lazy constrained data acquisition: A general framework","year":2001,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Patient Safety Institute","keywords":"Computer science; Lazy evaluation; Programming language; Functional programming","retraction":null,"screen_n_in":null,"score":{"opus":0.05510647354240323,"gpt":0.3076926848245852,"spread":0.252586211282182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002350125,0.0001698579,0.0001623284,0.0001208397,0.0002922826,0.0005760576,0.0007221228,0.0001024439,0.0004813402],"category_scores_gemma":[0.000100114,0.0001880361,0.00003815023,0.0005674603,0.00002039954,0.0005847722,0.0004211946,0.000147789,0.0001748207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005136392,"about_ca_system_score_gemma":0.0001744759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001382906,"about_ca_topic_score_gemma":0.00005035708,"domain_scores_codex":[0.9982767,0.00009104799,0.0003698474,0.0006981115,0.0003055107,0.0002588078],"domain_scores_gemma":[0.998483,0.000112767,0.0001153237,0.0009482372,0.0001115323,0.0002291648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009504846,0.00004460087,0.00197465,0.000002246145,0.00004288623,0.00002982429,0.001751252,0.1385181,0.007079043,0.03084254,0.04055841,0.7791469],"study_design_scores_gemma":[0.0003425629,0.00002951414,0.002161314,0.00002392612,0.000006815691,0.00002270485,0.00002450175,0.9866577,0.0005067957,0.0009780307,0.009003441,0.0002426454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04366596,0.0000367793,0.9474041,0.006092374,0.001478278,0.0001839847,0.00001265712,0.0003228379,0.0008030192],"genre_scores_gemma":[0.3642674,0.00000537034,0.6281772,0.004089576,0.003016172,0.000001539845,0.0002040568,0.00000947762,0.0002291623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8481396,"threshold_uncertainty_score":0.7667891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3093584058","doi":"10.1007/s00354-020-00112-0","title":"Learning Disjunctive Logic Programs from Nondeterministic Interpretation Transitions","year":2020,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Inductive logic programming; Computer science; Nondeterministic algorithm; Logic program; Dynamic logic (digital electronics); Artificial intelligence; Logic programming; Multimodal logic; Theoretical computer science; Programming language; State (computer science); Interpretation (philosophy); Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.04480490933102638,"gpt":0.2609039098683966,"spread":0.2160990005373702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106407,0.0001628571,0.0001731751,0.00003937748,0.0003374018,0.0004134642,0.00032263,0.00006659555,0.00001989174],"category_scores_gemma":[0.0001252268,0.0001568628,0.00008476679,0.0003191882,0.00002385166,0.0003087498,0.0001047441,0.0002185724,0.00009654288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000412515,"about_ca_system_score_gemma":0.0001034863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002234646,"about_ca_topic_score_gemma":0.00002187932,"domain_scores_codex":[0.9986632,0.0001501726,0.0002746794,0.0005052238,0.0001889009,0.0002177921],"domain_scores_gemma":[0.9993541,0.00008590016,0.0001348583,0.0001520839,0.0001026985,0.0001703808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001274524,0.00007400655,0.0008766556,0.00001332312,0.00004273787,0.00001793071,0.04793704,0.03776057,0.009791718,0.022161,0.0006018791,0.8807104],"study_design_scores_gemma":[0.0003192047,0.0003328813,0.000426742,0.0000200724,0.00001420482,0.000002987997,0.0001494308,0.9960718,0.0007370039,0.001098472,0.0006408462,0.0001863635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03629418,0.00007705154,0.9595675,0.0011886,0.0004846696,0.0001800343,6.795408e-7,0.0004118778,0.001795346],"genre_scores_gemma":[0.9215685,0.000001808248,0.07636201,0.0007635601,0.00112818,0.000004877023,0.00008275923,0.00001043833,0.00007786145],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9583112,"threshold_uncertainty_score":0.639668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983360143","doi":"10.1007/s00354-008-0052-x","title":"Application of Computational Mechanics to the Analysis of Seismic Time-series via Numerical Optimisation","year":2008,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Ontario Ministry of Natural Resources and Forestry","keywords":"Computer science; Predictability; Series (stratigraphy); Time series; Algorithm; Machine learning; Mathematics; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.01914973622621777,"gpt":0.2327899121022148,"spread":0.213640175875997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003027499,0.0001055048,0.0002669722,0.0002234198,0.0002569967,0.00003478366,0.0003667812,0.00003220366,0.00001576376],"category_scores_gemma":[0.00003517147,0.00009029209,0.0001411556,0.002015726,0.00001810228,0.0001836517,0.0001354507,0.00005565774,0.00001146421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003075728,"about_ca_system_score_gemma":0.00007389669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000150177,"about_ca_topic_score_gemma":0.00001234342,"domain_scores_codex":[0.9986407,0.00007018474,0.0005212875,0.0002763517,0.0003649098,0.0001265856],"domain_scores_gemma":[0.9988649,0.00008641563,0.0003852849,0.0003242928,0.0002815839,0.00005744871],"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.000002893656,0.00001671139,0.0001532046,0.000001759242,0.0001097418,1.436061e-7,0.000889055,0.9383169,0.002840952,0.003295948,0.0002368685,0.05413586],"study_design_scores_gemma":[0.00007643514,0.00004665636,0.001432848,0.000002392799,0.00007731643,0.000004657922,0.00001325987,0.9953719,0.002349334,0.0002624921,0.0002768283,0.00008585379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03130555,0.00002487522,0.9677608,0.0006328468,0.00006163479,0.0001250049,0.000002429775,0.00003813507,0.0000486936],"genre_scores_gemma":[0.7501229,0.000001290996,0.2495421,0.0001150552,0.0001119041,0.000001854514,0.00005010098,0.000004686922,0.0000501073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7188174,"threshold_uncertainty_score":0.3682005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404743120","doi":"10.1007/s00354-024-00288-9","title":"Simulations of Policy Responses and Interventions to Promote Inclusive Adaptation to and Recovery from the Covid-19 Crisis in Vietnam","year":2024,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Regional resilience and development","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Adaptation (eye); Psychological intervention; Coronavirus disease 2019 (COVID-19); Computer science; Political science; Psychology; Medicine; Nursing; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.1066807727161403,"gpt":0.3514995026796047,"spread":0.2448187299634643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003215416,0.00005723147,0.0001060627,0.0002969582,0.0001187133,0.0001088445,0.0000515207,0.00002639458,0.00001376201],"category_scores_gemma":[0.0008201358,0.00005587093,0.00002631613,0.0003932261,0.000009791249,0.0001025812,0.00008856194,0.00004059261,0.00001041376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000119405,"about_ca_system_score_gemma":0.0001502025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002067447,"about_ca_topic_score_gemma":0.001211489,"domain_scores_codex":[0.9992802,0.00002436617,0.000359037,0.0002267213,0.00003481783,0.00007486075],"domain_scores_gemma":[0.9995126,0.0002473522,0.00006541097,0.00007901045,0.00002136646,0.00007430799],"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.00008189095,0.00005675791,0.0135664,0.0001012456,0.00006557679,0.000003919845,0.06590178,0.6938573,0.001264271,0.08223454,0.01761642,0.1252499],"study_design_scores_gemma":[0.0007668061,0.0003518101,0.09553541,0.0003339148,0.00001477382,0.000006166651,0.002135662,0.7533123,0.0004066155,0.08153724,0.06513558,0.0004637042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7206429,0.0009011081,0.2513386,0.02670674,0.00009699041,0.0002112123,0.00004451411,0.000009182571,0.00004882924],"genre_scores_gemma":[0.987025,0.00005742714,0.01007084,0.002547265,0.0001557223,0.000005012947,0.00001675895,0.000005255479,0.0001167112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2663822,"threshold_uncertainty_score":0.3125376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004252403","doi":"10.1007/bf03037648","title":"Equilibrium of E-markets populated with reputation oriented learning agents","year":2005,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Quality (philosophy); Computer science; Purchasing; Product (mathematics); Microeconomics; Reinforcement learning; Population; Value (mathematics); Business; Marketing; Artificial intelligence; Economics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.09120223876998775,"gpt":0.3746790799358612,"spread":0.2834768411658735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136483,0.00009946489,0.0001533392,0.0001584093,0.000217352,0.00009686021,0.0001714719,0.00004991062,0.0003333832],"category_scores_gemma":[0.0005679882,0.00008161317,0.00004483457,0.0008474985,0.00003484528,0.0003051205,0.00005005752,0.0001099349,0.00008543632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003171647,"about_ca_system_score_gemma":0.00006811522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001148456,"about_ca_topic_score_gemma":0.00000972078,"domain_scores_codex":[0.9980627,0.0002197904,0.0006231272,0.0003509161,0.0006037402,0.000139756],"domain_scores_gemma":[0.9985603,0.0002085997,0.0005214578,0.0002568887,0.0003707695,0.00008196897],"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.00004233996,0.00004664826,0.004768197,0.000001655685,0.00001562227,4.854647e-7,0.001131937,0.7252879,0.02381686,0.004629325,0.004170935,0.2360881],"study_design_scores_gemma":[0.000545121,0.00007998967,0.005848335,0.00001461649,0.00001208022,0.000009661458,0.0003087056,0.9459462,0.0260056,0.000660104,0.02042783,0.0001417996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6214669,0.00001378299,0.376865,0.0003834858,0.0001004764,0.00009672631,6.678838e-7,0.0000540722,0.0010189],"genre_scores_gemma":[0.9772106,7.306398e-7,0.01896024,0.0001148373,0.0004760703,0.000001674111,0.00003759663,0.00001016122,0.003188116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3579047,"threshold_uncertainty_score":0.3650312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}