{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":45,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":45,"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":"0ac3632425aa","filters":{"venue":"Computing"}},"results":[{"id":"W2131771497","doi":"10.1007/s00607-004-0056-9","title":"Robust Spherical Parameterization of Triangular Meshes","year":2004,"lang":"en","type":"article","venue":"Computing","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":77,"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":"Polygon mesh; Morphing; Triangle mesh; Volume mesh; Triangulation; Mathematics; Unit sphere; Computer science; Spherical trigonometry; Position (finance); Computer graphics; Domain (mathematical analysis); Mesh generation; Geometry; Computer graphics (images); Combinatorics; Finite element method; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02487536545239894,"gpt":0.2089123434765954,"spread":0.1840369780241964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006823485,0.00005668413,0.0001250997,0.00002764311,0.00002394252,0.00001092657,0.00005717767,0.0000294932,0.00000799588],"category_scores_gemma":[0.00002328293,0.00005688586,0.00005346276,0.0001670983,0.000009965793,0.00002361706,0.00001229392,0.00004739698,0.000005626854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001864718,"about_ca_system_score_gemma":0.000005892504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008747506,"about_ca_topic_score_gemma":6.400653e-7,"domain_scores_codex":[0.9996028,0.000007243849,0.0001581952,0.00007257358,0.00006655086,0.00009266836],"domain_scores_gemma":[0.9998363,0.00001704463,0.00002138608,0.00008461731,0.00001806501,0.00002262105],"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":[5.22611e-7,0.000006103612,0.0001052124,0.00001868368,0.00001741201,0.000001054351,0.0001233735,0.989414,0.002911592,0.00003930985,0.000006888574,0.007355803],"study_design_scores_gemma":[0.000158717,0.000008104234,0.000133742,0.0000390435,0.00001603171,0.000001060138,0.00003161924,0.9930156,0.006330356,0.0001836768,0.0000166945,0.00006532043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4225523,0.0001221053,0.576965,0.000008743557,0.00004303263,0.00001256053,2.722438e-7,0.00008507624,0.0002109564],"genre_scores_gemma":[0.9577845,0.000005965639,0.0421272,0.000008287221,0.0000543928,2.688435e-7,0.000003929282,0.00001075067,0.000004736132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5352322,"threshold_uncertainty_score":0.2319738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977292054","doi":"10.1007/s00607-008-0001-z","title":"A new local stabilized nonconforming finite element method for the Stokes equations","year":2008,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"CMG Reservoir Simulation Foundation; National Science Foundation","keywords":"Finite element method; Mathematics; Mixed finite element method; Gauss; Stability (learning theory); Extended finite element method; Mathematical analysis; Applied mathematics; Order (exchange); Finite element limit analysis; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0670170312128948,"gpt":0.3583443537672329,"spread":0.2913273225543381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242326,0.0001365096,0.000191341,0.00004339507,0.0002924851,0.00001757701,0.0001903127,0.00003222109,0.00001757515],"category_scores_gemma":[0.0007367645,0.0001102956,0.0000842523,0.0002103858,0.0000335632,0.00006507021,0.00006039134,0.0001438797,0.00000834294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008427611,"about_ca_system_score_gemma":0.00004461026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004008857,"about_ca_topic_score_gemma":9.903507e-7,"domain_scores_codex":[0.9990541,0.00003609845,0.0003634443,0.0001308989,0.0001712132,0.0002442105],"domain_scores_gemma":[0.9875553,0.01206685,0.00006976993,0.0001755186,0.00006983674,0.00006275796],"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.000002316554,0.000004262477,0.000003563821,0.00002654166,0.00002159911,4.149656e-7,0.0006652298,0.7156686,0.00005697868,0.003095224,0.000109926,0.2803454],"study_design_scores_gemma":[0.0003226009,0.0000221099,0.00001714534,0.00002646027,0.0000173144,0.000007438718,0.0002187207,0.9797655,0.0007046913,0.01435186,0.004413155,0.0001329798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001907089,0.00026186,0.9981771,0.000106429,0.0003549755,0.0003756988,0.000003195367,0.0002541508,0.0002759561],"genre_scores_gemma":[0.08490922,0.000006846872,0.9146987,0.00008734737,0.0002096255,0.00001978861,0.000003000461,0.00003071852,0.00003475944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2802124,"threshold_uncertainty_score":0.4497722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084095496","doi":"10.1007/s00607-008-0009-4","title":"On the numerical solution of nonlinear systems of Volterra integro-differential equations with delay arguments","year":2008,"lang":"en","type":"article","venue":"Computing","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Superconvergence; Piecewise; Nonlinear system; Mathematics; Collocation method; Convergence (economics); Polynomial; Differential equation; Applied mathematics; Collocation (remote sensing); Volterra integral equation; Numerical analysis; Mathematical analysis; Computer science; Ordinary differential equation; Finite element method; Integral equation","retraction":null,"screen_n_in":null,"score":{"opus":0.05106779509966347,"gpt":0.2903040580349835,"spread":0.2392362629353201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002685331,0.00007154623,0.0003116677,0.00002687531,0.00009354924,8.465674e-7,0.00005868483,0.00006724591,0.0000885541],"category_scores_gemma":[0.0004838391,0.00003617447,0.00005680739,0.00006580018,0.0002869249,0.00000905962,0.00003040627,0.0001708431,0.00001303735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013599,"about_ca_system_score_gemma":0.00002278411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001163182,"about_ca_topic_score_gemma":1.797053e-7,"domain_scores_codex":[0.9992427,0.0001016621,0.000321359,0.0001020341,0.0001008587,0.0001313395],"domain_scores_gemma":[0.9985042,0.001127892,0.0001286452,0.0001312942,0.00006659086,0.00004140371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003468906,0.0007115941,0.003557492,0.0001715442,0.0002105745,0.00001047653,0.0006594376,0.002999581,0.0005251493,0.9903179,0.0001985166,0.000290806],"study_design_scores_gemma":[0.000398703,0.0004609836,0.001518665,0.000236643,0.00005158578,0.00004731354,0.00003546899,0.9949434,0.0002937586,0.001969063,0.000003609802,0.00004082212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4899511,0.0000124349,0.5090332,0.0001560306,0.00004279374,0.00009540241,8.568302e-7,0.000007793863,0.0007003486],"genre_scores_gemma":[0.9988176,0.000001379428,0.000980172,0.00009488006,0.00004862569,0.000003030626,0.000005403804,0.000004588414,0.0000443672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9919438,"threshold_uncertainty_score":0.1475152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025944808","doi":"10.1007/s006070050007","title":"Finite Volume Element Approximations of Nonlocal in Time One-Dimensional Flows in Porous Media","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Texas A and M University; Lawrence Livermore National Laboratory; U.S. Department of Energy; National Science Foundation","keywords":"Finite element method; Finite volume method; Mathematics; Norm (philosophy); Volume (thermodynamics); Approximations of π; Mathematical analysis; Applied mathematics; Porous medium; Mixed finite element method; hp-FEM; Partial differential equation; Representative elementary volume; Finite element limit analysis; Mechanics; Porosity; Physics; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.02046139254517452,"gpt":0.2680796776812291,"spread":0.2476182851360546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003294906,0.0001149481,0.0002568885,0.0001304711,0.00001966426,0.000006887333,0.0001431469,0.00004816706,0.0001951863],"category_scores_gemma":[0.0001846944,0.0001338484,0.00002998662,0.000387749,0.00002590969,0.000054881,0.00004550287,0.0001881572,0.00007093255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008997006,"about_ca_system_score_gemma":0.00001425679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003243669,"about_ca_topic_score_gemma":0.000002303533,"domain_scores_codex":[0.9988145,0.00005168368,0.0005431304,0.0001404311,0.0002419507,0.0002082729],"domain_scores_gemma":[0.9987537,0.001010456,0.00004513263,0.0001243671,0.00002697364,0.0000393663],"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.000003288428,0.00007037718,0.0002183773,0.00004233011,0.000005368432,0.000003584496,0.0003241698,0.9194447,0.0001503686,0.0001179675,0.0000123403,0.07960711],"study_design_scores_gemma":[0.000278091,0.00001290978,0.001842287,0.0001524497,0.000002858588,0.000002823891,0.00001153907,0.9903067,0.00013742,0.007083174,0.00004695589,0.0001227589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3602953,0.0000723722,0.6385393,0.00002657506,0.00007632546,0.0001479329,0.000005141599,0.00008825576,0.0007487668],"genre_scores_gemma":[0.4291873,0.000001710424,0.5707157,0.00001796544,0.00003672882,0.000003827737,0.000009449156,0.00001652888,0.00001077916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07948434,"threshold_uncertainty_score":0.545818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004663077","doi":"10.1007/s00607-009-0064-5","title":"Performance of several stabilized finite element methods for the Stokes equations based on the lowest equal-order pairs","year":2009,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":31,"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":"Gauss; Finite element method; Mathematics; Convergence (economics); Order (exchange); Element (criminal law); Mathematical analysis; Gauss–Seidel method; Polynomial; Applied mathematics; Mixed finite element method; Mathematical optimization; Physics; Iterative method; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.0601805366785815,"gpt":0.3685665198685561,"spread":0.3083859831899746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302207,0.0001370081,0.0001784267,0.00004173023,0.0002103542,0.00001848484,0.0002293774,0.00002759995,0.00001683912],"category_scores_gemma":[0.00171514,0.00008781072,0.00007324186,0.0002972023,0.00004372648,0.00003918725,0.0000241754,0.0001552269,0.000001868643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005101861,"about_ca_system_score_gemma":0.00002120064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.312099e-7,"about_ca_topic_score_gemma":9.902986e-8,"domain_scores_codex":[0.9989982,0.0001432478,0.0003708115,0.0001190938,0.0001690358,0.0001996318],"domain_scores_gemma":[0.9783041,0.02118359,0.0001071365,0.0002584945,0.0001228073,0.0000238154],"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.000008998182,0.00002358046,0.00001023304,0.00004339411,0.00001294012,3.166321e-8,0.0002034665,0.8711997,0.0001306146,0.00336539,0.00001674266,0.1249849],"study_design_scores_gemma":[0.0002256548,0.0001148154,0.0002072128,0.00006243179,0.00001747725,2.022815e-7,0.0000695721,0.9910356,0.000871104,0.006945331,0.0003441989,0.000106363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004197645,0.00006328429,0.9942349,0.0004549095,0.0002036333,0.0004597998,0.000004229482,0.0001096023,0.0002720658],"genre_scores_gemma":[0.4681179,0.000001980156,0.5316374,0.0001725165,0.00004028386,0.00001370828,0.000001942339,0.00001113534,0.00000309222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4639202,"threshold_uncertainty_score":0.3580817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2807971989","doi":"10.1007/s00607-018-0631-8","title":"On personalized cloud service provisioning for mobile users using adaptive and context-aware service composition","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Provisioning; Personalization; Cloud computing; Context (archaeology); World Wide Web; Service provider; Service (business); Service delivery framework; Mobile computing; Mobile QoS; Computer network; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.05535906009207481,"gpt":0.3033924351767459,"spread":0.248033375084671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551847,0.0002761185,0.0003691694,0.0001498809,0.0008379972,0.0003509977,0.0004529149,0.0001096272,0.000007249365],"category_scores_gemma":[0.00003670131,0.0002908733,0.00007780462,0.0005287128,0.00006916512,0.0005709131,0.0003744403,0.0001788954,0.00003539028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001540164,"about_ca_system_score_gemma":0.0001057798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002393058,"about_ca_topic_score_gemma":0.00008453157,"domain_scores_codex":[0.9979647,0.000211365,0.0003654041,0.0007463039,0.0002965977,0.0004156211],"domain_scores_gemma":[0.9973078,0.0009393884,0.0003262808,0.0003640125,0.0009213674,0.000141088],"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.001459233,0.0008205436,0.00208136,0.001411393,0.0006786009,0.00004867861,0.09957159,0.005520651,0.04154725,0.0277506,0.001616691,0.8174934],"study_design_scores_gemma":[0.001553189,0.0003967172,0.0002107179,0.0007587915,0.00002188978,0.00007838081,0.001504221,0.9920138,0.002059893,0.0003686732,0.0006515848,0.0003821992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4733688,0.00005820232,0.5248743,0.0002274387,0.0005024208,0.0006990316,0.000009830741,0.0001953215,0.00006470732],"genre_scores_gemma":[0.9803963,6.070777e-7,0.01652272,0.002553984,0.0004445282,0.00002976986,0.00001037616,0.00003039185,0.00001136225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9864931,"threshold_uncertainty_score":0.9999543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3131825464","doi":"10.1007/s00607-021-00912-2","title":"Adaptive ensembles of autoencoders for unsupervised IoT network intrusion detection","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Anomaly detection; Scalability; Artificial intelligence; Machine learning; Inference; Cloud computing; Enhanced Data Rates for GSM Evolution; Artificial neural network; Internet of Things; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.02195650726565292,"gpt":0.2399702837364764,"spread":0.2180137764708234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004087599,0.0001241555,0.0002107568,0.00006407787,0.0003556123,0.00006294755,0.0002824793,0.00009549524,0.000008231225],"category_scores_gemma":[0.00009370778,0.0001327344,0.0001215654,0.0006588763,0.00003132514,0.0001347014,0.0002985251,0.0001421029,0.000003628972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004472815,"about_ca_system_score_gemma":0.00007149784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001923692,"about_ca_topic_score_gemma":0.000041798,"domain_scores_codex":[0.9987019,0.0001251087,0.0003263034,0.0003753356,0.000178912,0.0002924455],"domain_scores_gemma":[0.9988579,0.0003254156,0.0001694824,0.0003072575,0.0002827483,0.00005718349],"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.00005418494,0.00006535088,0.00008498667,0.00006148069,0.00004084048,0.000006642027,0.00114111,0.1536839,0.01201537,0.01442192,0.0005059479,0.8179182],"study_design_scores_gemma":[0.0003383528,0.0001660037,0.0004155454,0.0001079635,0.000008436365,0.00001833266,0.00006797291,0.9511769,0.03857573,0.007507508,0.001477021,0.0001402219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09769058,0.0003596299,0.8999647,0.0001157124,0.001291833,0.0001591661,6.76617e-7,0.0001469388,0.0002706913],"genre_scores_gemma":[0.8591123,0.0000159523,0.140285,0.0001506059,0.0004021965,0.000004000934,0.000002010794,0.000009130575,0.00001881152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8177781,"threshold_uncertainty_score":0.541275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404507082","doi":"10.1007/s00607-024-01356-0","title":"Distributed computing in multi-agent systems: a survey of decentralized machine learning approaches","year":2024,"lang":"en","type":"article","venue":"Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":27,"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":"Computer science; Distributed computing; Multi-agent system; Artificial intelligence; Machine learning; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.1415602752600565,"gpt":0.3140181154727547,"spread":0.1724578402126982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003037966,0.000263251,0.0004829178,0.0003328223,0.0001321049,0.0003694195,0.009983741,0.0001383096,0.000001782402],"category_scores_gemma":[0.01273653,0.0002565644,0.00007246115,0.001914754,0.00009312485,0.000280218,0.03528328,0.0006791875,0.00001086009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002001109,"about_ca_system_score_gemma":0.00009114665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001266871,"about_ca_topic_score_gemma":0.00007497126,"domain_scores_codex":[0.9968234,0.0006312954,0.0007871433,0.0008012061,0.0003407657,0.0006161729],"domain_scores_gemma":[0.9959852,0.001210678,0.0002335072,0.002418078,0.00008234609,0.00007025422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003048939,0.0005493203,0.5710804,0.002336737,0.0003331597,0.0004331615,0.002313421,0.2408822,0.0006133626,0.007533498,0.005216079,0.1686781],"study_design_scores_gemma":[0.0003623098,0.00002433923,0.03544196,0.0006476574,0.0000050097,0.00002309601,0.00005497036,0.9625445,0.0001855006,0.0002959449,0.0001780687,0.0002366623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1035924,0.005092153,0.8885643,0.0004909999,0.0006534234,0.0002730754,0.00004194212,0.001267721,0.00002397752],"genre_scores_gemma":[0.8662534,0.00003028001,0.1335376,0.000006425411,0.00001453347,0.000002575494,0.0001306474,0.00002099273,0.000003556382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7626609,"threshold_uncertainty_score":0.9999887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977066728","doi":"10.1007/s00607-013-0334-0","title":"Energy efficiency on location based applications in mobile cloud computing: a survey","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Computer science; Mobile cloud computing; Efficient energy use; Mobile device; Systems engineering; Energy (signal processing); Global Positioning System; Distributed computing; Data science; Real-time computing; Telecommunications; Engineering; World Wide Web; Electrical engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02022659973194987,"gpt":0.2544815625279349,"spread":0.234254962795985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009989863,0.0002756538,0.0002956246,0.0003529075,0.0004051889,0.0003240841,0.001222998,0.0001053107,0.000003364706],"category_scores_gemma":[0.00008612902,0.0002784149,0.00007165662,0.001990607,0.00005517715,0.0001854927,0.000404394,0.0002665687,0.0001490188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001504398,"about_ca_system_score_gemma":0.0001498835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006418899,"about_ca_topic_score_gemma":0.0000130084,"domain_scores_codex":[0.9973693,0.0003046297,0.0005727222,0.00076264,0.0003333273,0.0006573297],"domain_scores_gemma":[0.9974312,0.001142229,0.0002345511,0.000774122,0.0002783312,0.0001395301],"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.000008533792,0.001194472,0.05126907,0.0001026493,0.00001959396,0.000008517566,0.0022936,0.3063008,0.0003355918,0.009662589,0.007248617,0.621556],"study_design_scores_gemma":[0.0003321841,0.00008646031,0.05147226,0.00008591035,0.000001485463,0.000002307087,0.00002014686,0.9449982,0.0004109819,0.0003567237,0.001922188,0.0003111219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1865434,0.0001297267,0.8094631,0.00008461913,0.002026072,0.0003968604,1.597226e-7,0.0003174394,0.001038502],"genre_scores_gemma":[0.9886743,9.942565e-7,0.00988277,0.0004719935,0.0008628526,0.00002992675,0.00002336739,0.00002216389,0.00003156354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8021309,"threshold_uncertainty_score":0.9999668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165372370","doi":"10.1007/s00607-005-0140-4","title":"Optimal Quadratic and Cubic Spline Collocation on Nonuniform Partitions","year":2005,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Mathematics; Collocation method; Collocation (remote sensing); Orthogonal collocation; Spline (mechanical); Applied mathematics; Boundary value problem; Quadratic equation; Uniqueness; Mathematical analysis; Nonlinear system; Ordinary differential equation; Geometry; Differential equation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007540692905724686,"gpt":0.2451677816059539,"spread":0.2376270887002292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004441864,0.00007751949,0.0001001751,0.00005360331,0.00007554327,0.00001799638,0.00004433977,0.00002483342,0.00001180537],"category_scores_gemma":[0.00001697902,0.00007770446,0.00002106866,0.0001595215,0.00001819608,0.0000719185,0.00001929966,0.00008772763,0.00002962491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005120324,"about_ca_system_score_gemma":0.000002557755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001384975,"about_ca_topic_score_gemma":0.00000401424,"domain_scores_codex":[0.999569,0.000005966541,0.0001461407,0.00009725114,0.00005957652,0.0001220635],"domain_scores_gemma":[0.9997742,0.00004916558,0.00002094412,0.00009726451,0.00001775068,0.0000406347],"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.000001293971,0.00002029701,0.00008110669,0.00001182543,0.00001137335,7.386747e-7,0.0001078015,0.9325872,0.002170302,0.0006912913,0.0002286289,0.06408812],"study_design_scores_gemma":[0.00007006426,0.00002530393,0.0005302833,0.0000292751,0.000009421256,0.000002459855,0.00002920702,0.9910203,0.006597022,0.0001495955,0.001437742,0.00009938325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4761236,0.00009514396,0.5210119,0.0001402685,0.0000207412,0.00006962967,8.010017e-7,0.0004748674,0.002063025],"genre_scores_gemma":[0.9176408,0.00001487277,0.08214319,0.00005170267,0.00009987863,0.000004044368,0.000006178939,0.00001166203,0.00002765904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4415172,"threshold_uncertainty_score":0.3168696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146228093","doi":"10.1007/s00607-005-0141-3","title":"Adaptive Techniques for Spline Collocation","year":2005,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Piecewise; Mathematics; Collocation method; Estimator; Hermite spline; Collocation (remote sensing); Spline (mechanical); Applied mathematics; Grid; Boundary value problem; Quadratic equation; Mathematical optimization; Smoothing spline; Algorithm; Mathematical analysis; Spline interpolation; Computer science; Geometry; Differential equation; Bilinear interpolation; Ordinary differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01193795855236562,"gpt":0.2667711793054882,"spread":0.2548332207531225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008323036,0.00008459372,0.0001210722,0.00005553611,0.00005046153,0.000009797527,0.00008459565,0.00003672102,0.000003955126],"category_scores_gemma":[0.00002319563,0.00008736932,0.00004639762,0.0001628392,0.00001335928,0.00007180166,0.00002108098,0.00006428529,0.000006619046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008639094,"about_ca_system_score_gemma":0.00000320816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001159783,"about_ca_topic_score_gemma":0.000001975451,"domain_scores_codex":[0.9995317,0.000004704268,0.0001615898,0.0001098573,0.00005180053,0.0001402815],"domain_scores_gemma":[0.9997258,0.00006355395,0.0000282677,0.0001028062,0.00005272206,0.00002691517],"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.00000430405,0.00001660041,0.00003498706,0.00001924593,0.00002151095,2.37451e-7,0.00006611581,0.06552751,0.008539497,0.001217334,0.001857711,0.9226949],"study_design_scores_gemma":[0.00004971854,0.00002642864,0.00003910975,0.00002138313,0.00000883448,9.709528e-7,0.00001210201,0.8739491,0.1029862,0.0009117757,0.02187783,0.0001165127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003667513,0.0001369067,0.9929517,0.00007666447,0.00002243891,0.000186132,0.000001493846,0.001523241,0.001433943],"genre_scores_gemma":[0.5803094,0.000005629839,0.4194117,0.00004272396,0.0001716741,0.0000144597,0.000004276368,0.00001412321,0.000025986],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9225785,"threshold_uncertainty_score":0.3562818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043734742","doi":"10.1007/s00607-003-0022-6","title":"Stability of solutions of delay functional integro-differential equations and their discretizations","year":2003,"lang":"en","type":"article","venue":"Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Collocation (remote sensing); Mathematics; Runge–Kutta methods; Stability (learning theory); Basis (linear algebra); Collocation method; Differential equation; Applied mathematics; Delay differential equation; Numerical stability; Mathematical analysis; Class (philosophy); Numerical analysis; Ordinary differential equation; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1409085499038111,"gpt":0.3315825338801445,"spread":0.1906739839763334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004620427,0.0001267906,0.0002875446,0.00009391936,0.0002142189,0.00001228214,0.00008540844,0.00005870298,0.0002175457],"category_scores_gemma":[0.003489398,0.0001066376,0.0001100489,0.0003186655,0.0002211586,0.00006270868,0.00008825298,0.0001373796,9.227675e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002960721,"about_ca_system_score_gemma":0.00006726391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001528017,"about_ca_topic_score_gemma":0.00001571126,"domain_scores_codex":[0.998602,0.0003348297,0.0005456739,0.0001864486,0.0001526468,0.0001783762],"domain_scores_gemma":[0.9966844,0.002487493,0.0002679811,0.0002519482,0.0002447506,0.00006337948],"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.000006944419,0.0003948597,0.002060009,0.0001024252,0.00008772138,5.570808e-8,0.001359551,0.0001340537,0.01914126,0.9707788,0.00001835009,0.005915943],"study_design_scores_gemma":[0.0005834651,0.00009094259,0.006173286,0.0001092735,0.0001433817,0.000005409232,0.001357237,0.07154423,0.01656829,0.9031407,0.00003624312,0.0002475789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2374814,0.0000390403,0.7617083,0.00003070879,0.0001426602,0.0001529747,0.00002974537,0.00003128415,0.0003838718],"genre_scores_gemma":[0.8930347,0.000001239588,0.1068919,0.000003296389,0.00002325365,0.000005042849,0.00001513798,0.00001274537,0.00001269212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6555533,"threshold_uncertainty_score":0.4348557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038514592","doi":"10.1007/s00607-015-0445-x","title":"Specification, verification, and quantification of security in model-based systems","year":2015,"lang":"en","type":"article","venue":"Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"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":"Computer science; Systems Modeling Language; Correctness; Unified Modeling Language; Software security assurance; Software engineering; Modeling language; Computer security model; Computer security; Security testing; Software; Systems engineering; Security information and event management; Information security; Programming language; Security service; Cloud computing security; Engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0877375456571489,"gpt":0.3200410458172946,"spread":0.2323035001601457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935191,0.00009424755,0.0001610818,0.0001809473,0.00004910775,0.00007543946,0.0004725301,0.00006234999,1.828136e-7],"category_scores_gemma":[0.0002950855,0.0001032624,0.00001688079,0.0005624715,0.00006500102,0.0003174192,0.00007344808,0.00009715164,0.000004830921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007876236,"about_ca_system_score_gemma":0.0001209833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003314508,"about_ca_topic_score_gemma":0.000001386135,"domain_scores_codex":[0.9986018,0.000190396,0.0004918121,0.0003386649,0.0002328038,0.0001445488],"domain_scores_gemma":[0.9985642,0.0000845636,0.0003070302,0.0006459234,0.0003260884,0.00007221951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001567727,0.0001496724,0.007941957,0.0001565133,0.000004786191,6.276078e-7,0.005235096,0.3419218,0.004779843,0.6263225,0.0001307887,0.01334075],"study_design_scores_gemma":[0.0002308857,0.00001809672,0.006419786,0.00004030337,0.000001691408,0.000002367951,0.000135569,0.984936,0.005082222,0.002918413,0.0001140461,0.0001006309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103495,0.0002588893,0.895138,0.0001137294,0.0002426072,0.0002071579,0.000001015003,0.00007676456,0.0004667963],"genre_scores_gemma":[0.7384983,0.000003383293,0.2614463,0.0000127515,0.00002033792,0.000005944135,0.000004422706,0.000005036334,0.000003478411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6430142,"threshold_uncertainty_score":0.4210919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098548175","doi":"10.1007/s00607-005-0137-z","title":"A Numerical Study of the Xu Polynomial Interpolation Formula in Two Variables","year":2005,"lang":"en","type":"article","venue":"Computing","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":23,"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":"Università degli Studi di Padova","keywords":"Interpolation (computer graphics); Mathematics; Lagrange polynomial; Polynomial interpolation; Chebyshev nodes; Trigonometric interpolation; Birkhoff interpolation; Applied mathematics; Polynomial; Linear interpolation; Chebyshev polynomials; Chebyshev filter; Variable (mathematics); Stability (learning theory); Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0429512032389139,"gpt":0.3458132703363486,"spread":0.3028620670974347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004899861,0.00008999388,0.0002249819,0.00005587752,0.00007624862,0.0000186946,0.000166146,0.00002658568,0.00008493837],"category_scores_gemma":[0.0003884845,0.00006179525,0.00005579108,0.0002089245,0.00001570705,0.0000489147,0.000113505,0.000131057,0.000007157459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003825084,"about_ca_system_score_gemma":0.00002062414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001353845,"about_ca_topic_score_gemma":0.00007403369,"domain_scores_codex":[0.9990007,0.0001091519,0.0004866252,0.0001206511,0.0001318412,0.0001510795],"domain_scores_gemma":[0.9988326,0.0007094228,0.0001600614,0.0002474228,0.00002600839,0.00002447656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004836813,0.01998453,0.2189651,0.001089895,0.0005453757,0.000009448139,0.1217564,0.04138717,0.009302903,0.3929228,0.01972717,0.1738255],"study_design_scores_gemma":[0.002941477,0.0001924032,0.006489581,0.0003382462,0.00007386396,0.00001585296,0.001587326,0.9659252,0.00102066,0.02002302,0.001087716,0.0003046348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691434,0.000009396495,0.02586169,0.0001210148,0.0001634438,0.0003554364,7.095409e-7,0.00002778413,0.004317156],"genre_scores_gemma":[0.9893931,7.573182e-8,0.0102735,0.00003263134,0.0002029794,0.00000388226,2.458531e-7,0.00001057998,0.00008298607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9245381,"threshold_uncertainty_score":0.2519937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2900493992","doi":"10.1007/s00607-018-0678-6","title":"An end-to-end joint learning framework of artery-specific coronary calcium scoring in non-contrast cardiac CT","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Advanced X-ray and CT Imaging","field":"Engineering","cited_by":13,"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":"Calcification; Medicine; Coronary artery disease; Radiology; Artery; Contrast (vision); Internal medicine; Cardiology; Artificial intelligence; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01430688008494225,"gpt":0.2517685506776923,"spread":0.23746167059275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003506189,0.0002197025,0.0003889205,0.0001843633,0.0001371645,0.00004152696,0.0001888569,0.00005231661,0.00003195155],"category_scores_gemma":[0.00003955001,0.0002602824,0.00007327897,0.0003491819,0.00006761432,0.0001945643,0.00008670503,0.0005698327,0.00003834868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015851,"about_ca_system_score_gemma":0.00001289362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001490032,"about_ca_topic_score_gemma":0.000002849707,"domain_scores_codex":[0.998525,0.00004875697,0.0004172993,0.0003142213,0.00016823,0.0005265208],"domain_scores_gemma":[0.9993208,0.0001389467,0.0000645203,0.0002995403,0.00005062757,0.0001255762],"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.00002054374,0.00004170094,0.05762979,0.0001342222,0.00004881798,0.00007611124,0.006090143,0.5408743,0.1244682,0.0002593531,0.0000429861,0.2703138],"study_design_scores_gemma":[0.0007350713,0.0002790941,0.3187874,0.002131737,0.00002465433,0.00005189278,0.003291094,0.5932961,0.07735457,0.000435665,0.002482348,0.001130433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6487007,0.0003252451,0.3490218,0.000007825061,0.0007475888,0.0001101668,0.000001720848,0.0001612724,0.0009237304],"genre_scores_gemma":[0.9809151,0.00001414497,0.01819524,0.00002714535,0.0007740573,0.000003835144,0.000004823619,0.00005969546,0.000005973591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3322144,"threshold_uncertainty_score":0.9999849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011727948","doi":"10.1007/s00607-013-0361-x","title":"Comparing redundancy models for high availability middleware","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Ericsson (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computer science; Provisioning; High availability; Fault tolerance; Distributed computing; Component (thermodynamics); Middleware (distributed applications); Single point of failure; Reliability engineering; Context (archaeology); Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03841983261104687,"gpt":0.2458708650413036,"spread":0.2074510324302567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321806,0.0001893726,0.0003289695,0.00006179733,0.0003887395,0.0002542421,0.0009392156,0.00008838188,0.00001084189],"category_scores_gemma":[0.00009218732,0.0001651039,0.0001134616,0.0002642666,0.00005652968,0.0008515844,0.0004467204,0.0001481852,0.0001292121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009802919,"about_ca_system_score_gemma":0.00006681169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002394562,"about_ca_topic_score_gemma":0.000004094752,"domain_scores_codex":[0.9981397,0.00006187322,0.0004922049,0.000603018,0.0002159998,0.0004871859],"domain_scores_gemma":[0.9982281,0.0002929796,0.0001551885,0.0008874858,0.0003186419,0.0001176495],"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.0000314698,0.0006829312,0.2759888,0.002680442,0.0001692889,0.000005321819,0.01039784,0.1166219,0.0007655523,0.1007143,0.01631041,0.4756317],"study_design_scores_gemma":[0.0003738157,0.00004758941,0.02132499,0.00009524186,0.000003672641,0.000006006342,0.00004065559,0.9492795,0.0003935402,0.02801944,0.0001749335,0.0002405626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4258845,0.00009914073,0.5718047,0.0001867337,0.0006914405,0.0004922432,6.580279e-7,0.0003810507,0.0004595178],"genre_scores_gemma":[0.8938574,0.000001295732,0.1057108,0.0001138659,0.000183397,0.00004214138,0.000003751934,0.00001187394,0.00007548832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8326576,"threshold_uncertainty_score":0.6732742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984058114","doi":"10.1007/s00607-013-0329-x","title":"An integrated fine-grain runtime system for MPI","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"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":"Vice Chancellor for Research and Technology, Kerman University of Medical Sciences","keywords":"Computer science; Parallel computing; Computational science","retraction":null,"screen_n_in":null,"score":{"opus":0.01596543454608506,"gpt":0.2629113881905235,"spread":0.2469459536444384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004936233,0.0001785919,0.0002219482,0.0001411741,0.0003035715,0.0004708798,0.001083057,0.00007941215,0.000006301407],"category_scores_gemma":[0.00006100096,0.0001637588,0.00007653714,0.0003948252,0.00002512018,0.0003702588,0.0001835676,0.0001192027,0.000079721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006086353,"about_ca_system_score_gemma":0.0000518674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000549907,"about_ca_topic_score_gemma":9.001962e-7,"domain_scores_codex":[0.9985901,0.0001047335,0.0003440672,0.0004499728,0.0001431201,0.0003680329],"domain_scores_gemma":[0.9987075,0.0001413068,0.0001578427,0.0005596492,0.000317819,0.0001158616],"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.00001022014,0.0002735717,0.001363442,0.0002651729,0.00007893127,0.00001135077,0.002424049,0.1049085,0.003657373,0.1096834,0.05189241,0.7254316],"study_design_scores_gemma":[0.0002156941,0.00009202246,0.0002880587,0.0000802989,0.000002703075,0.00001179037,0.000043536,0.9950078,0.002032572,0.000557518,0.001456478,0.0002115779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0108294,0.00004505893,0.9846877,0.000199739,0.0003967057,0.0004485428,0.000001308153,0.002437838,0.0009537185],"genre_scores_gemma":[0.5535291,2.538465e-7,0.4461549,0.0001025727,0.00008933627,0.00001552732,0.000009687772,0.00001128197,0.00008730618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8900993,"threshold_uncertainty_score":0.6677892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3190810079","doi":"10.1007/s00607-021-00985-z","title":"Special issue on ‘‘artificial intelligence in cloud computing’’","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Cloud computing; Computer science; Artificial intelligence; Data science; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0738313035886359,"gpt":0.3162360449937694,"spread":0.2424047414051335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794763,0.0001171953,0.0001411286,0.00009764952,0.0002105223,0.0001076126,0.0001956301,0.00005565372,0.0003105472],"category_scores_gemma":[0.0009369925,0.000132391,0.00005068252,0.00073895,0.00006816244,0.0000442875,0.0001009543,0.0003221307,0.0006427363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008468481,"about_ca_system_score_gemma":0.00005076229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004177353,"about_ca_topic_score_gemma":0.00001346179,"domain_scores_codex":[0.9984202,0.000223517,0.0003492324,0.0005041342,0.0002306776,0.0002721795],"domain_scores_gemma":[0.9991595,0.0004091214,0.0001012377,0.0002333213,0.00003857128,0.00005831171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000301613,0.0002302675,0.0001296688,0.00001509697,0.0000012899,0.0001410233,0.001277452,0.004839574,0.04805151,0.0397683,0.001927301,0.9035884],"study_design_scores_gemma":[0.000154412,0.00007744673,0.002960526,0.0001051564,0.000002843848,0.00008053802,0.0008926252,0.2178995,0.7304649,0.003366427,0.04365811,0.0003375412],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8167989,0.0000185824,0.0414614,0.00339513,0.01402812,0.0003065137,0.000003190727,0.0003680801,0.1236201],"genre_scores_gemma":[0.9882277,0.00000267645,0.0003556509,0.001344554,0.009791321,7.096735e-7,0.000001412214,0.00001348511,0.0002624527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9032508,"threshold_uncertainty_score":0.8261289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998920459","doi":"10.1007/s00607-019-00788-3","title":"Special issue on deep learning for natural language processing","year":2020,"lang":"en","type":"article","venue":"Computing","topic":"Educational Technology and Pedagogy","field":"Computer Science","cited_by":10,"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":"Computer science; Natural (archaeology); Artificial intelligence; Natural language; Natural language processing; Deep learning; Cognitive science; Psychology; History; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.02763692826690561,"gpt":0.3278781083299954,"spread":0.3002411800630898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001004,0.00007315412,0.00008636333,0.00003706562,0.000246246,0.00006310862,0.0004062936,0.00004570603,0.00001366416],"category_scores_gemma":[0.0002132129,0.00007281959,0.00003115181,0.0001787376,0.00002037307,0.00008941685,0.000110816,0.000251313,0.00005884619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000145746,"about_ca_system_score_gemma":0.00003595011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.011939e-7,"about_ca_topic_score_gemma":6.900974e-7,"domain_scores_codex":[0.9993774,0.00002131433,0.0001027925,0.000244108,0.00007950792,0.0001748666],"domain_scores_gemma":[0.9996257,0.0001504188,0.0000624147,0.00008495546,0.00003924188,0.00003721267],"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.000005304949,0.00001143546,0.0003095501,0.0000246247,0.000003786612,0.000003685075,0.006917482,0.0008623738,0.0001614172,0.006628172,0.001795463,0.9832767],"study_design_scores_gemma":[0.0002419,0.0001218084,0.001548845,0.00003332944,0.000002919682,0.000009544784,0.0007314267,0.8965296,0.001155982,0.0003978692,0.09904919,0.0001775738],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09731951,0.001326345,0.8562438,0.02567448,0.003030868,0.0003311799,4.646672e-7,0.001146669,0.01492667],"genre_scores_gemma":[0.9512925,6.197517e-7,0.03713909,0.001711099,0.009655609,0.000002107318,0.000003734813,0.000006589758,0.0001886954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9830991,"threshold_uncertainty_score":0.2969497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115333632","doi":"10.1007/s00607-012-0215-y","title":"Monitoring and recovery for web service applications","year":2012,"lang":"en","type":"article","venue":"Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Business Process Execution Language; Computer science; Web service; Automaton; Finite-state machine; Service (business); Distributed computing; Software engineering; Web application; Adaptation (eye); Service-oriented architecture; Programming language; World Wide Web; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01797269297411308,"gpt":0.2640509283156918,"spread":0.2460782353415787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002271491,0.0001075522,0.0001047435,0.00006603916,0.0002769659,0.000107095,0.000434351,0.00004022994,6.589858e-7],"category_scores_gemma":[0.000003944038,0.0001047516,0.00003046192,0.0003412114,0.000006939107,0.000343321,0.0003422748,0.00007895689,0.00001377736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001366101,"about_ca_system_score_gemma":0.00001906683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001699425,"about_ca_topic_score_gemma":0.000004048086,"domain_scores_codex":[0.9991693,0.00002028819,0.0001461088,0.0002391209,0.00009335471,0.0003317923],"domain_scores_gemma":[0.9991739,0.0002604852,0.00007233478,0.0003048946,0.00007535474,0.0001129844],"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.000008229717,0.00009620033,0.03260639,0.0003910782,0.00005113619,4.919327e-7,0.006747998,0.0004734929,0.008851747,0.02423866,0.00008139011,0.9264532],"study_design_scores_gemma":[0.002684192,0.0002434806,0.1456748,0.000701704,0.0001209591,0.0001832873,0.002178915,0.4483225,0.03255629,0.01757638,0.3475059,0.002251685],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2263149,0.001468471,0.7692096,0.0007056335,0.0006716428,0.0003159968,0.000001854545,0.0002558233,0.001056028],"genre_scores_gemma":[0.8725261,0.00000904456,0.1258148,0.0006997719,0.0009001795,0.00002875543,0.000002036393,0.00001004555,0.000009269418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9242015,"threshold_uncertainty_score":0.4271645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999144075","doi":"10.1007/s00607-012-0196-x","title":"Load balancing in peer-to-peer systems using a diffusive approach","year":2012,"lang":"en","type":"article","venue":"Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Workload; Convergence (economics); Computer science; Upper and lower bounds; Overlay; Overlay network; Load balancing (electrical power); Distributed computing; Node (physics); Peer-to-peer; Mathematical optimization; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03449987351668637,"gpt":0.2800628648536271,"spread":0.2455629913369408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00220617,0.0003242776,0.0004629388,0.0004516059,0.0002114614,0.000365245,0.001795518,0.000166409,7.604021e-7],"category_scores_gemma":[0.000702061,0.0003286126,0.00006936763,0.00195897,0.00003639508,0.0004612294,0.002254422,0.0004402933,0.00008417598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006506713,"about_ca_system_score_gemma":0.00009995449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002453097,"about_ca_topic_score_gemma":0.000005898883,"domain_scores_codex":[0.9962717,0.0001221954,0.000510896,0.0006962006,0.001061643,0.001337317],"domain_scores_gemma":[0.9980228,0.0002019414,0.0001623396,0.0009591268,0.0003751355,0.0002786907],"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.00002004378,0.0005723103,0.1743935,0.0002784277,0.00009674727,0.0001174621,0.0366669,0.63225,0.008172822,0.03191376,0.01299455,0.1025235],"study_design_scores_gemma":[0.000314663,0.00003562329,0.01210035,0.0002535184,0.000006560581,0.0001170612,0.0007887226,0.9817113,0.0003128502,0.0001025825,0.003693733,0.0005630055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.392603,0.000314049,0.6028929,0.0005244977,0.001145281,0.0003740935,9.710938e-7,0.0005852663,0.001559894],"genre_scores_gemma":[0.7812061,3.507158e-7,0.2179597,0.0002592472,0.0003805219,0.00001269573,0.000001397808,0.00002412342,0.0001558318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3886031,"threshold_uncertainty_score":0.9999166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017161972","doi":"10.1007/s00607-013-0332-2","title":"Privacy preserving and transactional advertising for mobile services","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Encryption; Upload; Computer security; Scalability; Cryptography; Cloud computing; Context (archaeology); Server; Internet privacy; Homomorphic encryption; Client-side encryption; Transaction data; World Wide Web; Database transaction; Database; On-the-fly encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.008173638724672866,"gpt":0.2407583565892462,"spread":0.2325847178645734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001442991,0.00008696593,0.00009465588,0.00005459397,0.000299057,0.0003050631,0.0004508846,0.00003247869,0.00001187668],"category_scores_gemma":[0.000007036614,0.0000854814,0.00004374513,0.0001464651,0.00001908222,0.0008964757,0.0002269605,0.00006892606,0.000004013885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006790215,"about_ca_system_score_gemma":0.00001162021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007586714,"about_ca_topic_score_gemma":0.00000402389,"domain_scores_codex":[0.9992354,0.00001922555,0.0001474483,0.0002861721,0.0001008498,0.000210897],"domain_scores_gemma":[0.9993966,0.0001822765,0.00005060917,0.0002411617,0.00006144462,0.00006796408],"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.0000111325,0.0001664311,0.01339677,0.0008936801,0.00007236513,0.000002540608,0.01460366,0.001373575,0.005660543,0.04701039,0.001057531,0.9157514],"study_design_scores_gemma":[0.0003872758,0.00005475452,0.02313992,0.00009031327,0.000005461297,0.00001484501,0.0001653957,0.9500461,0.0007277173,0.01932294,0.005838908,0.0002064272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3344963,0.0003292499,0.6645187,0.000102964,0.0001168938,0.0002253745,0.000002237654,0.0001027464,0.0001055695],"genre_scores_gemma":[0.8315638,0.000005243771,0.1681962,0.0001369508,0.00007026875,0.00001613109,0.000004489154,0.000004515535,0.000002324443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486725,"threshold_uncertainty_score":0.348583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405453640","doi":"10.1007/s00607-024-01391-x","title":"Efficient exploration of indoor localization using genetic algorithm and signal propagation model","year":2024,"lang":"en","type":"article","venue":"Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"Fundação de Amparo à Pesquisa do Estado do Amazonas; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Genetic algorithm; Computer science; Algorithm; Radio propagation; SIGNAL (programming language); Telecommunications; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02157017278592637,"gpt":0.2383092429350752,"spread":0.2167390701491488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008371942,0.00008252653,0.00008658091,0.0001488899,0.00005568008,0.0000421099,0.00003933208,0.00006169731,0.00000145204],"category_scores_gemma":[0.000009839121,0.00008342679,0.0000169147,0.0002722421,0.00003200537,0.00007359221,0.00002848195,0.00006319724,0.000001300407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000418367,"about_ca_system_score_gemma":0.00001690955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002275426,"about_ca_topic_score_gemma":1.269379e-7,"domain_scores_codex":[0.9994603,0.00001010286,0.0002072399,0.0001181947,0.0001023553,0.0001017644],"domain_scores_gemma":[0.9998342,0.00001801424,0.00002358792,0.00006070715,0.00004847099,0.00001506019],"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":[4.233069e-7,0.00000310494,0.00002710474,0.0001328981,0.00000580173,9.570764e-7,0.0005197605,0.9091308,0.002170606,0.0004790299,0.000007403813,0.08752215],"study_design_scores_gemma":[0.00006581609,0.0000104102,0.00002340136,0.0001243186,0.00001187079,0.000004064055,0.0001037719,0.9794129,0.01935109,0.0008017509,0.000005004045,0.00008560123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357447,0.0006178744,0.8629468,0.000004186182,0.0001150043,0.0001133525,0.000001956859,0.0004102739,0.00004579245],"genre_scores_gemma":[0.9477699,0.00001262348,0.0521482,0.000004065459,0.00003696061,0.000001761446,0.000006103551,0.00001862887,0.000001787605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8120251,"threshold_uncertainty_score":0.3402046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405143323","doi":"10.1007/s00607-024-01385-9","title":"Enhancing POI recommendations on social media: a sequential approach incorporating LSTM and user feedback","year":2024,"lang":"en","type":"article","venue":"Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Social media; Computer science; Artificial intelligence; Multimedia; Machine learning; Human–computer interaction; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0515753249354012,"gpt":0.2968145450501929,"spread":0.2452392201147917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411073,0.0001777796,0.0002109882,0.0001839615,0.0004809682,0.0008464861,0.0003529084,0.00009190805,0.000003723784],"category_scores_gemma":[0.00006159546,0.000167191,0.00006706471,0.0004189342,0.0000378944,0.0004205734,0.00046125,0.0003246831,0.00001321653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007420761,"about_ca_system_score_gemma":0.0000589809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002640456,"about_ca_topic_score_gemma":0.00001112687,"domain_scores_codex":[0.9984862,0.0001516686,0.0003677354,0.0005266462,0.0001964374,0.0002713217],"domain_scores_gemma":[0.9990841,0.0004822874,0.0001095547,0.0002122719,0.00004363425,0.00006813767],"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.00000285966,0.00008316564,0.0002401463,0.0003460028,0.00007640717,0.0000376214,0.01616727,0.00003821916,0.001864962,0.4721177,0.01848677,0.4905389],"study_design_scores_gemma":[0.0008319455,0.0002222732,0.001688722,0.002321022,0.00005648725,0.0004333551,0.002451692,0.9192749,0.01155525,0.02953791,0.02968633,0.001940142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01046041,0.0002285001,0.9810667,0.001785599,0.001235829,0.0001627935,0.000002037794,0.0008844147,0.004173684],"genre_scores_gemma":[0.8371553,0.000004011165,0.1619648,0.0001450913,0.0006672866,0.000008992869,0.000007213221,0.00001787669,0.00002942529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9192367,"threshold_uncertainty_score":0.8162685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979595178","doi":"10.1007/s00607-009-0032-0","title":"Discrete logarithms for finite groups","year":2009,"lang":"en","type":"article","venue":"Computing","topic":"Coding theory and cryptography","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 Calgary","funders":"","keywords":"Discrete logarithm; Multiset; Mathematics; Generalization; Cryptography; Logarithm; Abelian group; Prime (order theory); Cryptographic primitive; Group (periodic table); Finite group; Discrete mathematics; Cryptographic protocol; Finite field; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Algorithm; Public-key cryptography; Encryption; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01650153830174806,"gpt":0.2599552687443593,"spread":0.2434537304426112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003668889,0.0001000745,0.0001139729,0.00007857776,0.0002518856,0.0001513687,0.0006279328,0.00003388354,0.000002086855],"category_scores_gemma":[0.00005356453,0.00009484081,0.0001138364,0.0002876063,0.00002175915,0.0001631531,0.0001177003,0.0000839207,0.000009538913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000852339,"about_ca_system_score_gemma":0.00001064205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.143453e-7,"about_ca_topic_score_gemma":2.376153e-7,"domain_scores_codex":[0.9991763,0.00003224962,0.0001463187,0.0002801872,0.00009039466,0.0002745793],"domain_scores_gemma":[0.9992291,0.0002942983,0.00005875339,0.0003227352,0.00003669884,0.00005836831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006537281,0.00002409892,0.0001474188,0.000006200959,0.000006784535,0.000003749618,0.0005127605,0.00065067,0.0001697536,0.6963557,0.0003375989,0.3017787],"study_design_scores_gemma":[0.0004880374,0.0003120621,0.003839744,0.00005241479,0.000006807552,0.00001079637,0.0000227273,0.607985,0.0005192721,0.3793224,0.007141708,0.0002990644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01189831,0.00008514019,0.9844196,0.0006840131,0.0003379802,0.0001078359,8.01916e-7,0.0002986703,0.002167622],"genre_scores_gemma":[0.897002,0.000001053058,0.1020082,0.0007821572,0.0001720531,0.00000134641,0.0000017535,0.000003912068,0.00002744452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8851038,"threshold_uncertainty_score":0.3867496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105143665","doi":"10.1007/s00607-014-0409-6","title":"ACS: an effective admission control scheme with deadlock resolutions for workflow scheduling in clouds","year":2014,"lang":"en","type":"article","venue":"Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","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":"Computer science; Distributed computing; Cloud computing; Provisioning; Workflow; Scheduling (production processes); Workflow management system; Virtual machine; Benchmark (surveying); Workflow technology; Deadlock prevention algorithms; Deadlock; Computer network; Database; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01277492207830991,"gpt":0.2632663595620147,"spread":0.2504914374837047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454817,0.0002381923,0.000366168,0.0001324859,0.0004078256,0.0002411309,0.0008104194,0.0001112241,5.915736e-7],"category_scores_gemma":[0.0002791107,0.0002103756,0.00006980501,0.0005735754,0.00004525278,0.0002571685,0.0001537167,0.0002603004,0.000009666268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009330957,"about_ca_system_score_gemma":0.00007908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002675064,"about_ca_topic_score_gemma":0.00001486136,"domain_scores_codex":[0.9978046,0.0003361999,0.0003765392,0.0006514459,0.0002280967,0.000603047],"domain_scores_gemma":[0.998065,0.000808268,0.0001963649,0.0005581047,0.0001775442,0.0001946946],"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.000160621,0.0002843474,0.0236893,0.0001589749,0.00006572582,0.00001330326,0.001874421,0.77706,0.0009783178,0.07126007,0.0002445392,0.1242104],"study_design_scores_gemma":[0.002058894,0.0003782054,0.005674209,0.0005330659,0.000006902108,0.00001852517,0.00003730952,0.9883996,0.00009269833,0.001161413,0.001345378,0.0002937571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2453636,0.0001125795,0.7530035,0.000145885,0.0002885002,0.0005221125,0.000001938277,0.0002662504,0.0002956663],"genre_scores_gemma":[0.8126916,2.912739e-7,0.1867936,0.000125155,0.0003302241,0.00002361708,0.000009917245,0.00001636944,0.00000927292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.567328,"threshold_uncertainty_score":0.8578867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387609398","doi":"10.1007/s00607-023-01225-2","title":"A graphical deep learning technique-based VNF dependencies for multi resource requirements prediction in virtualized environments","year":2023,"lang":"en","type":"article","venue":"Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Cloud computing; Distributed computing; Workload; Exploit; Resource (disambiguation); Virtual network; Graph; Data mining; Artificial intelligence; Machine learning; Computer network; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03934790051608235,"gpt":0.2820110362366872,"spread":0.2426631357206049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001918164,0.0002303338,0.0002551614,0.0005453097,0.0004742639,0.0001373541,0.0008109655,0.0001182518,0.000002031501],"category_scores_gemma":[0.0002127467,0.0002398574,0.0001384818,0.001046962,0.00005750536,0.00003991597,0.0007822128,0.0003237059,0.00002497589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001375469,"about_ca_system_score_gemma":0.00001867276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001489123,"about_ca_topic_score_gemma":0.000004071527,"domain_scores_codex":[0.9973735,0.0002591171,0.0005120565,0.000743769,0.0004783573,0.0006331597],"domain_scores_gemma":[0.9989107,0.0003434253,0.0001918504,0.0004386989,0.00002153862,0.00009375194],"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.00005963321,0.0003578818,0.02290765,0.0001733919,0.00006844626,0.00008338971,0.002802749,0.7959488,0.008099338,0.001840469,0.0003869298,0.1672713],"study_design_scores_gemma":[0.001405742,0.0001375319,0.01206295,0.000167988,0.000007705059,0.000003138422,0.0001774265,0.9798082,0.0006475265,0.0001936975,0.005158928,0.0002291609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.155058,0.00004319808,0.8428685,0.0001800728,0.0001846448,0.0006791248,7.848449e-7,0.0008229531,0.0001626741],"genre_scores_gemma":[0.9440335,0.000001782336,0.0552435,0.0001533061,0.00008745533,0.00008922391,0.00001627322,0.00002989185,0.0003450422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7889755,"threshold_uncertainty_score":0.97811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4322768055","doi":"10.1007/s00607-023-01163-z","title":"Advances of machine learning in IoT-cloud for healthcare","year":2023,"lang":"en","type":"article","venue":"Computing","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","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 Ottawa","funders":"","keywords":"Cloud computing; Internet of Things; Computer science; Health care; Artificial intelligence; Embedded system; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.2072215111091151,"gpt":0.5270424325630477,"spread":0.3198209214539326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562726,0.0001108323,0.0003173292,0.0002042099,0.0006296574,0.000002686677,0.0001791292,0.0001380598,0.00002510042],"category_scores_gemma":[0.001155657,0.0001120709,0.00005486923,0.0006908519,0.00003930647,0.00003703513,0.0001486703,0.0006631739,0.00009462705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001176187,"about_ca_system_score_gemma":0.0002143781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001981436,"about_ca_topic_score_gemma":0.004192884,"domain_scores_codex":[0.997655,0.0004127747,0.0008583012,0.0002692105,0.000153874,0.0006508562],"domain_scores_gemma":[0.9964516,0.002742343,0.0003274622,0.0001693389,0.0002260386,0.00008320089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004714986,0.00001318612,0.8125279,0.001768964,0.000002967785,0.000003608208,0.01061828,0.007864487,0.0001017913,0.002793673,0.0002601398,0.1639978],"study_design_scores_gemma":[0.0004397445,0.0002896608,0.02691977,0.002419412,0.000005241425,8.605548e-7,0.02464624,0.9016506,0.0003682716,0.009027897,0.033931,0.0003012836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9862459,0.001692163,0.003457501,0.003762067,0.002279223,0.001390154,0.00002139811,0.0004057462,0.000745813],"genre_scores_gemma":[0.9976747,0.0001115746,0.001097769,0.0002713844,0.0005232074,0.00004279031,0.00002850721,0.00003159778,0.0002184572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8937861,"threshold_uncertainty_score":0.4842879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3137125111","doi":"10.1007/s00607-020-00899-2","title":"Novel evolutionary-EAC instance-learning-based algorithm for fast data stream mining in assisted living with extreme connectivity","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Cloud computing; Feature (linguistics); Feature selection; Evolutionary algorithm; Data stream; Extreme learning machine; Genetic algorithm; Process (computing); Data mining; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06716225142728892,"gpt":0.2866039741503886,"spread":0.2194417227230997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001002344,0.0002814249,0.0003784214,0.0002033896,0.0003248173,0.0003005368,0.00160874,0.00009877778,0.000003829946],"category_scores_gemma":[0.0009341967,0.0003025861,0.00004805109,0.001001392,0.00007488831,0.0008031162,0.001688688,0.0003459324,0.000001519605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001993732,"about_ca_system_score_gemma":0.0005444102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000725012,"about_ca_topic_score_gemma":0.0002690988,"domain_scores_codex":[0.9972502,0.0001754213,0.0004095566,0.00123578,0.0003591954,0.0005698279],"domain_scores_gemma":[0.9961296,0.001772118,0.0003024041,0.001431394,0.0002678511,0.00009658984],"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.000006413137,0.0004962501,0.01755629,0.00005611035,0.00003632999,0.00007273581,0.0004564286,0.002328154,0.0005502292,0.0005534887,0.0005617354,0.9773259],"study_design_scores_gemma":[0.0006997453,0.0001307159,0.03206242,0.0009167652,0.00001066043,0.00007522102,0.0002483551,0.9642066,0.0004040874,0.00002973589,0.0008452846,0.000370377],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01454337,0.0001602977,0.9836022,0.0001544164,0.0001670747,0.0002384092,0.00007259933,0.0006673898,0.0003942479],"genre_scores_gemma":[0.3880184,0.000001192393,0.6116462,0.00006174264,0.00006366488,0.00001131748,0.0001570633,0.00002128592,0.00001913946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9769555,"threshold_uncertainty_score":0.9999426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005539492","doi":"10.1007/s00607-020-00793-x","title":"Editorial for the special issue on big time series data","year":2020,"lang":"en","type":"article","venue":"Computing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Series (stratigraphy); Big data; Computer science; Time series; Data science; Data mining; Geology; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04572222148638688,"gpt":0.2566493682869556,"spread":0.2109271468005687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710512,0.0001149616,0.0001653764,0.00001814163,0.0004618022,0.0003642276,0.001854048,0.00003664709,0.00003535824],"category_scores_gemma":[0.0003105454,0.00008194528,0.00006679455,0.0002850878,0.00003484331,0.0002283001,0.001184978,0.0001289155,0.0001508571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009923039,"about_ca_system_score_gemma":0.00003710925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006016014,"about_ca_topic_score_gemma":0.000001917967,"domain_scores_codex":[0.9988726,0.00002801682,0.0002068811,0.0004195241,0.00023533,0.0002376526],"domain_scores_gemma":[0.9987754,0.0003555748,0.0001099486,0.0006304275,0.00006422256,0.00006448723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001964004,0.00000725067,0.000006455693,0.000006348551,0.00002654544,0.000001055494,0.0005690964,0.00144875,0.00004342016,0.001784098,0.6541005,0.3419868],"study_design_scores_gemma":[0.00009777088,0.00006680052,0.000009239766,0.00000578977,0.000007663321,6.987336e-7,0.00002760981,0.4414707,0.00004981567,0.00006419265,0.5581334,0.00006634676],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"editorial","genre_scores_codex":[0.0002034341,0.00009597195,0.8767214,0.01984573,0.09673379,0.0003682779,0.00003465479,0.0003158406,0.005680859],"genre_scores_gemma":[0.008049074,0.000002945242,0.0200898,0.0008621857,0.9706724,0.00000157865,0.00002392793,0.00001552955,0.0002825488],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.8739386,"threshold_uncertainty_score":0.3551856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945051179","doi":"10.1007/s00607-019-00771-y","title":"On cycling risk and discomfort: urban safety mapping and bike route recommendations","year":2019,"lang":"en","type":"preprint","venue":"Computing","topic":"Urban Transport and Accessibility","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Leeds","keywords":"Cycling; Transport engineering; Bike sharing; Artifact (error); Business; Computer science; Engineering; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.03172444649453365,"gpt":0.3148488298382855,"spread":0.2831243833437519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311252,0.0002073099,0.0003399475,0.00009836083,0.001184132,0.0002939934,0.0002529863,0.0002035509,0.00002492713],"category_scores_gemma":[0.0001170608,0.0002078028,0.00008425192,0.0001253733,0.0001779001,0.0001234183,0.0003803025,0.0007511909,0.000002597365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009822036,"about_ca_system_score_gemma":0.0001114063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001817567,"about_ca_topic_score_gemma":0.0007045274,"domain_scores_codex":[0.9982551,0.0001903381,0.0004192562,0.0006210619,0.0001930654,0.0003212226],"domain_scores_gemma":[0.9986783,0.00052744,0.000359836,0.0002884335,0.00002813535,0.0001178213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000007424901,0.0000257264,0.9356333,0.00009999605,0.0000333967,0.000001222821,0.01319112,0.0005463872,0.000001660294,0.001360842,0.0001610966,0.04893783],"study_design_scores_gemma":[0.0006418132,0.00002917132,0.9315746,0.001844017,0.000127732,4.083824e-7,0.004038672,0.02417361,0.000007020615,0.01755704,0.01906012,0.0009458373],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9670776,0.0005130083,0.02093495,0.0006255966,0.001264011,0.0004777341,0.00007287876,0.0001361197,0.008898086],"genre_scores_gemma":[0.9966758,0.000279089,0.002141184,0.00008712548,0.0004432091,0.000002260533,0.00009633389,0.00001623298,0.0002587443],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04799199,"threshold_uncertainty_score":0.9107506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2623963253","doi":"10.1007/s00607-017-0560-y","title":"Performance impacts of hybrid cloud storage","year":2017,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","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 Ottawa","funders":"","keywords":"Cloud computing; Computer science; Cloud storage; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02344047856203373,"gpt":0.2770958936438562,"spread":0.2536554150818224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728335,0.0001155491,0.0001862488,0.00007148271,0.0004360609,0.0001281459,0.002869552,0.00002618616,0.000001599301],"category_scores_gemma":[0.0003818548,0.0001134135,0.00003823069,0.00007829184,0.0001730222,0.0008861119,0.002139962,0.0001595613,0.00002030536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003693518,"about_ca_system_score_gemma":0.0000302801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009520991,"about_ca_topic_score_gemma":7.97904e-7,"domain_scores_codex":[0.9990274,0.0000135771,0.0002036614,0.0002877831,0.0001759147,0.000291658],"domain_scores_gemma":[0.9974794,0.00006385468,0.0004228438,0.001932516,0.00006486155,0.00003654323],"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.000008442244,0.00006666113,0.02923257,0.000143198,0.00002786273,0.0001333343,0.0005016832,0.003558361,0.005773163,0.0180676,0.002205779,0.9402813],"study_design_scores_gemma":[0.000554844,0.0001814923,0.0646136,0.0002952256,0.000005899713,0.0001102644,0.00004056041,0.8268046,0.1022971,0.002414085,0.002221832,0.0004604961],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5806246,0.00007652217,0.4177439,0.0001100999,0.0004557986,0.0000474567,0.000001885305,0.0002521231,0.0006875524],"genre_scores_gemma":[0.8914124,0.00001496836,0.1084532,0.00002710745,0.00006502125,5.614225e-7,9.392763e-7,0.000006742442,0.00001899504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9398208,"threshold_uncertainty_score":0.5332389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997660235","doi":"10.1007/s00607-013-0372-7","title":"System on chip failure rate assessment using the executable model of a system","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Radiation Effects in Electronics","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":"McGill University","funders":"","keywords":"Executable; Workload; Computer science; Reliability engineering; Reliability (semiconductor); Transient (computer programming); Failure rate; Embedded system; Fault (geology); Fault injection; System on a chip; Real-time computing; Engineering; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.01107270689941278,"gpt":0.2265287876759298,"spread":0.215456080776517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003967644,0.0001340964,0.0001949867,0.00005545416,0.0001224949,0.00005769741,0.0001882348,0.00005316852,0.000001218636],"category_scores_gemma":[0.000007893786,0.0001057325,0.00004723617,0.0001584294,0.00001203714,0.00007320594,0.00003232711,0.0002038141,0.00001053284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004726887,"about_ca_system_score_gemma":0.00003695839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002463903,"about_ca_topic_score_gemma":7.343334e-7,"domain_scores_codex":[0.9991025,0.00008402823,0.0002584185,0.0001265986,0.0001496251,0.0002787778],"domain_scores_gemma":[0.9993792,0.0001580485,0.00009358937,0.0002869514,0.00004916948,0.00003301321],"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":[4.287805e-7,0.000003617025,0.00002588191,0.0004166197,0.00002911886,3.565107e-7,0.0001266976,0.9843872,0.008108059,0.006309179,0.00009260406,0.0005002645],"study_design_scores_gemma":[0.0001242055,0.00001412225,0.00008351047,0.0004158652,0.00001456827,0.000006399668,0.000283345,0.9972136,0.001719296,0.00001667641,0.00001027578,0.00009815097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6760709,0.00008861376,0.3206788,0.00001103512,0.00024563,0.0003336639,0.000001325816,0.0002862108,0.002283813],"genre_scores_gemma":[0.9941844,4.633006e-7,0.005653585,0.00001058702,0.00009458214,0.000009513999,0.00000139368,0.00003566417,0.000009805802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3181135,"threshold_uncertainty_score":0.4311647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415311529","doi":"10.1007/s00607-025-01564-2","title":"Collaborative filtering in the age of AI: foundations, innovations, and emerging trends","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"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":"Collaborative filtering; Recommender system; Personalization; Baseline (sea); Benchmark (surveying); Field (mathematics); Big data","retraction":null,"screen_n_in":null,"score":{"opus":0.0196661130790066,"gpt":0.3228471913033872,"spread":0.3031810782243806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005178018,0.00005826449,0.0001073127,0.0002805852,0.0001200017,0.0001314984,0.0003055488,0.00002005916,6.374576e-7],"category_scores_gemma":[0.00003002696,0.00004703368,0.00001260806,0.001623358,0.00002023716,0.0001562182,0.0001898711,0.0000926024,1.253867e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000161333,"about_ca_system_score_gemma":0.0000301728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004793145,"about_ca_topic_score_gemma":0.00002306495,"domain_scores_codex":[0.9993631,0.00008361299,0.0002545569,0.0001391228,0.00006910454,0.00009044952],"domain_scores_gemma":[0.999521,0.0001367362,0.00007254074,0.0002025172,0.00006208425,0.000005138651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[8.642075e-7,0.00003047861,0.01739183,0.00005085799,0.00001553379,0.000005392261,0.006806496,0.00006130182,0.0008514841,0.5960866,0.002537837,0.3761613],"study_design_scores_gemma":[0.001515888,0.0001840115,0.4242206,0.001687764,0.00001861537,0.00003473548,0.004676716,0.356663,0.00774379,0.05720187,0.1452716,0.0007814679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03463118,0.0001976882,0.9540485,0.003393455,0.0001610094,0.0001004994,5.838358e-7,0.00006046551,0.007406624],"genre_scores_gemma":[0.9703278,0.000004382113,0.02925811,0.000349899,0.00001412706,0.000005932905,0.000002231866,0.000001700725,0.00003580163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9356967,"threshold_uncertainty_score":0.1917978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2999331497","doi":"10.1007/s00607-019-00777-6","title":"Micro-journal mining to understand mood triggers","year":2020,"lang":"en","type":"article","venue":"Computing","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multinomial logistic regression; Mood; Trigram; Sentiment analysis; Computer science; Word (group theory); Logistic regression; Psychology; Multinomial distribution; Natural language processing; Cognitive psychology; Artificial intelligence; Machine learning; Linguistics; Data science; Social psychology; Econometrics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05212175688882666,"gpt":0.2756820573529652,"spread":0.2235603004641386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312027,0.0001167719,0.0001899371,0.0001088046,0.0002774826,0.0004971931,0.0006825856,0.00002766587,0.0000223462],"category_scores_gemma":[0.00006941488,0.000112534,0.0001111266,0.0006707064,0.00001179531,0.0001835697,0.0003213307,0.0001369782,0.00006635097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003811749,"about_ca_system_score_gemma":0.00004537847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.559014e-7,"about_ca_topic_score_gemma":2.111283e-7,"domain_scores_codex":[0.9987895,0.00005058348,0.0002996266,0.0003170675,0.0002463616,0.000296829],"domain_scores_gemma":[0.9992828,0.00009482468,0.0001271509,0.0001648961,0.00005701938,0.000273264],"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.00006036403,0.0001680556,0.02162255,0.00008142657,0.0006804306,0.0002940199,0.1760162,0.09837157,0.0309909,0.01221912,0.09650334,0.562992],"study_design_scores_gemma":[0.0008953852,0.0001860832,0.0007171789,0.00009702802,0.00002231153,0.00004676457,0.004313066,0.983754,0.003515201,0.0001582573,0.005875713,0.0004190015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1880763,0.0001298578,0.8049204,0.005155601,0.0003450828,0.00004525262,1.498069e-7,0.00008344599,0.001243914],"genre_scores_gemma":[0.8310515,0.000002756985,0.1663207,0.002215946,0.0003692209,1.125701e-7,5.568996e-7,0.000007866861,0.00003141983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8853824,"threshold_uncertainty_score":0.4794445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025042589","doi":"10.1007/s00607-013-0375-4","title":"TurboLock: increasing associativity of lock table in transactional memory","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Software transactional memory; Lock (firearm); Parallel computing; Overhead (engineering); Concurrency; Exploit; Table (database); Distributed computing; Operating system; Programming language; Computer security; Database transaction; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.008302495638667196,"gpt":0.2172443057043419,"spread":0.2089418100656747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278389,0.00009336459,0.0002278917,0.00006405902,0.00007356251,0.00007214533,0.0003665676,0.0000575805,0.00001269996],"category_scores_gemma":[0.0000662052,0.00009426961,0.00004520005,0.0004414741,0.00002169628,0.0003716983,0.00007469604,0.0001489257,0.00001735117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007001706,"about_ca_system_score_gemma":0.00006292026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271195,"about_ca_topic_score_gemma":0.00001662042,"domain_scores_codex":[0.9988458,0.0001293573,0.0003233607,0.000231827,0.0002144311,0.0002551948],"domain_scores_gemma":[0.9992533,0.000224939,0.0001635232,0.0002030009,0.0001085112,0.00004668063],"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.00002314715,0.001108171,0.2806352,0.0004538712,0.0001479681,0.00004473842,0.007496819,0.08306669,0.03588647,0.0168052,0.004798607,0.5695331],"study_design_scores_gemma":[0.0004866782,0.00002049186,0.2542009,0.0001635266,0.000001926939,0.00001528685,0.00008176293,0.7421756,0.001751858,0.0006884955,0.0002251259,0.0001882811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6420934,0.0001032862,0.3551893,0.0001265521,0.0002227869,0.0001111453,0.000002538266,0.00005049823,0.002100553],"genre_scores_gemma":[0.9909037,7.361716e-7,0.008943437,0.00004774609,0.0000480726,0.000002798821,0.000001645689,0.00000428154,0.00004757741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.659109,"threshold_uncertainty_score":0.3844203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411326007","doi":"10.1007/s00607-025-01505-z","title":"Predictive container orchestration in the cloud using artificial intelligence techniques","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"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":"Orchestration; Container (type theory); Cloud computing; Computer science; Artificial intelligence; Engineering; Operating system; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03760798050484105,"gpt":0.3057208766827272,"spread":0.2681128961778861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170836,0.0001176112,0.0001230534,0.0001678429,0.0002468636,0.0002341417,0.0008965197,0.00004881901,5.010324e-7],"category_scores_gemma":[0.00007197504,0.00009057709,0.00004699238,0.0008764461,0.00005188684,0.00002805554,0.0004304312,0.0002383531,0.00000208666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008531691,"about_ca_system_score_gemma":0.00005406079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007056363,"about_ca_topic_score_gemma":0.000008043209,"domain_scores_codex":[0.998713,0.0002007466,0.0003291574,0.0003246849,0.0001866989,0.0002457779],"domain_scores_gemma":[0.9991933,0.000280373,0.00008960593,0.0003728597,0.00004688366,0.00001702943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006899051,0.0001004473,0.0005789045,0.00002475682,0.0000148233,0.00002148512,0.003052718,0.07960088,0.0002132506,0.5077016,0.00009601801,0.4085883],"study_design_scores_gemma":[0.00002772753,0.0000369245,0.000755196,0.0001340321,0.000005121623,0.000005211432,0.0006377581,0.9682457,0.001235015,0.02849342,0.0003288924,0.00009503208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1489387,0.00005677882,0.8455766,0.0009856834,0.0003154656,0.0002470133,1.038072e-7,0.0001776024,0.003702041],"genre_scores_gemma":[0.9746839,6.417725e-7,0.02455068,0.0005289171,0.0002120485,0.000003738278,4.355354e-7,0.000003542234,0.00001606426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8886448,"threshold_uncertainty_score":0.3693627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3154426907","doi":"10.1007/s00607-021-00940-y","title":"Fast-MICDTN: a new decentralized control mechanism for content-centric disruption tolerant networks","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Decentralised system; Computer science; Distributed computing; Mechanism (biology); Control (management); Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03954978302319499,"gpt":0.255667243213561,"spread":0.216117460190366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003700091,0.0002910013,0.0005031389,0.00006486565,0.0003471911,0.0004178326,0.0005795566,0.000156452,0.00002391605],"category_scores_gemma":[0.00004189688,0.0002888272,0.000257543,0.0004230272,0.00002600529,0.0002260389,0.0002396246,0.000229706,0.00001394899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007789156,"about_ca_system_score_gemma":0.0002628461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001817128,"about_ca_topic_score_gemma":0.000006010611,"domain_scores_codex":[0.9973904,0.0001290078,0.000610118,0.0007147396,0.0002920765,0.0008636853],"domain_scores_gemma":[0.9980042,0.000447041,0.0002682058,0.0005382568,0.0003614153,0.0003809085],"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.0000973198,0.0001758713,0.0004676825,0.00003982318,0.0001500395,0.0002525903,0.0004863593,0.01533837,0.0004636391,0.226508,0.004801878,0.7512184],"study_design_scores_gemma":[0.003681517,0.00006465694,0.0001157052,0.00010592,0.00004978095,0.0001181136,0.00005455352,0.98976,0.0001047135,0.004200991,0.001407029,0.0003369924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003526332,0.00107627,0.990625,0.001193157,0.002539659,0.0005161797,0.000005005477,0.0002951199,0.0002232801],"genre_scores_gemma":[0.9262051,0.00006588425,0.06991845,0.002677973,0.0007135665,0.000009553827,0.00003649685,0.00002666723,0.0003462842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9744217,"threshold_uncertainty_score":0.9999564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067222153","doi":"10.1007/s006070070001","title":"Simulated Annealing for Fitting Linear Combinations of Gaussians to Data","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":1,"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":"Maxima and minima; Gaussian; Simulated annealing; Algorithm; Computer science; Gradient descent; Gaussian function; Convergence (economics); Mixture model; Mathematical optimization; Applied mathematics; Mathematics; Artificial intelligence; Artificial neural network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06808277752787258,"gpt":0.3875594151868146,"spread":0.3194766376589421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298004,0.00005380775,0.00009692454,0.00003814053,0.0002048718,0.00005695416,0.0002951596,0.00000968567,0.0001994766],"category_scores_gemma":[0.00005279792,0.00005187389,0.00003156736,0.0002071553,0.00002553829,0.0001035432,0.0001137734,0.00004368841,0.00001589256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004149293,"about_ca_system_score_gemma":0.00003910352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009223476,"about_ca_topic_score_gemma":0.000001170933,"domain_scores_codex":[0.9993047,0.00001642504,0.0001776888,0.0001946439,0.0001033093,0.0002032072],"domain_scores_gemma":[0.9993435,0.0001842334,0.00003916645,0.0003017959,0.00006865228,0.00006265879],"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.0000721088,0.0005303129,0.02145631,0.0000880774,0.0001301601,0.000001186042,0.003511014,0.3039083,0.002306134,0.01211982,0.01607624,0.6398004],"study_design_scores_gemma":[0.0004809768,0.00002956664,0.0005267588,0.00005092563,0.000005832111,8.162063e-8,0.0004372874,0.9904834,0.001879886,0.0008474885,0.005176754,0.00008101593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8601848,0.00001784629,0.1322311,0.0001803666,0.00008334577,0.0002500893,0.0002110356,0.0000236643,0.006817732],"genre_scores_gemma":[0.9915672,1.42196e-7,0.007553791,0.00001787176,0.0001388381,9.850235e-7,0.0002475837,0.0000067766,0.0004668017],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6865752,"threshold_uncertainty_score":0.2184129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4317211950","doi":"10.1007/s00607-023-01149-x","title":"Correction to: Special issue on “artificial intelligence in cloud computing”","year":2023,"lang":"en","type":"article","venue":"Computing","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Cloud computing; Computer science; Data science; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.07439000865109235,"gpt":0.3270407649448769,"spread":0.2526507562937845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004575792,0.0001220787,0.0001282496,0.0003328101,0.0002696663,0.00009417516,0.000220507,0.0000450463,0.00009336598],"category_scores_gemma":[0.001443186,0.0001370161,0.00004266015,0.001912689,0.0000430809,0.00004490399,0.00009955325,0.0003025123,0.003508276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140556,"about_ca_system_score_gemma":0.00002300627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001619261,"about_ca_topic_score_gemma":0.00002810487,"domain_scores_codex":[0.9984373,0.0001590307,0.0003370697,0.0004976108,0.0002462118,0.0003227989],"domain_scores_gemma":[0.9989754,0.0006417825,0.00008986734,0.000191565,0.00002508581,0.00007629155],"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.00005115245,0.00007701258,0.0001200905,0.000007461479,7.401487e-7,0.00002346084,0.001808376,0.03704448,0.02769581,0.004588036,0.01850583,0.9100776],"study_design_scores_gemma":[0.00008011982,0.0001500678,0.008482399,0.0001075668,0.000001521678,0.00001694124,0.0007484988,0.7933808,0.1780669,0.00103413,0.01767182,0.0002591852],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8901091,0.000001491399,0.03469276,0.002315428,0.03740981,0.0005132186,0.0000020862,0.0009615068,0.0339946],"genre_scores_gemma":[0.9921019,0.000001284068,0.00007925709,0.0008958257,0.006265737,0.000002442134,0.000001695888,0.00001721114,0.000634658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9098184,"threshold_uncertainty_score":0.9972676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414067394","doi":"10.1007/s00607-025-01547-3","title":"An experience-based classification of quantum bugs in quantum software","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Bundesministerium für Digitalisierung und Wirtschaftsstandort; Technische Universität München; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; European Commission","keywords":"Debugging; Quantum; Software; Quantum computer; Set (abstract data type); Quantum algorithm; Software bug","retraction":null,"screen_n_in":null,"score":{"opus":0.0187290211498145,"gpt":0.291908079415636,"spread":0.2731790582658215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020895,0.0001893861,0.000289421,0.0004024625,0.0001764531,0.0001124711,0.001259328,0.00008953849,0.000002023861],"category_scores_gemma":[0.0001375256,0.0001858837,0.00007841799,0.001249783,0.00009273156,0.0001722456,0.0002193074,0.0002593666,0.000002780695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005284651,"about_ca_system_score_gemma":0.0002009331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007887041,"about_ca_topic_score_gemma":0.00000540428,"domain_scores_codex":[0.9980775,0.000174274,0.0005319359,0.0005891586,0.0002513462,0.0003757752],"domain_scores_gemma":[0.9984844,0.0003320663,0.0002059058,0.0007920818,0.0001157909,0.00006981072],"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.00002654807,0.0006366714,0.07445324,0.0002261237,0.00001746855,0.00002794762,0.008065212,0.3126571,0.008706081,0.1379424,0.0001395733,0.4571016],"study_design_scores_gemma":[0.0003345653,0.00007359579,0.0734254,0.0002443237,0.000001942086,0.000002091978,0.0001267087,0.9208577,0.001477144,0.003173697,0.0001141462,0.0001687367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4767809,0.00007307951,0.5223232,0.0002047017,0.000328678,0.00008391612,5.99589e-7,0.0001604222,0.00004447607],"genre_scores_gemma":[0.9387347,9.507918e-7,0.06099826,0.0001968677,0.00004689107,0.000004321992,0.000004084332,0.000009015378,0.000004949135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6082005,"threshold_uncertainty_score":0.7580116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988420580","doi":"10.1007/s006070070013","title":"Output-Sensitive Algorithm for Computing β-Skeletons","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Digital Image Processing Techniques","field":"Computer Science","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 Windsor","funders":"","keywords":"Intersection (aeronautics); Mathematics; Combinatorics; Planar; Algorithm; Graph; Measure (data warehouse); Skeleton (computer programming); RADIUS; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02030153970628382,"gpt":0.2833015776668781,"spread":0.2630000379605943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004531906,0.0002386928,0.0002755995,0.0001179209,0.0004117708,0.0007108615,0.0009710034,0.0000728005,0.000003527911],"category_scores_gemma":[0.0000720438,0.0002535275,0.0001319705,0.0004417704,0.00008527486,0.0006515121,0.000393189,0.0001772433,0.00006307564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006314634,"about_ca_system_score_gemma":0.00007218698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000999049,"about_ca_topic_score_gemma":3.791785e-7,"domain_scores_codex":[0.9981313,0.0000443216,0.0003650826,0.0006375267,0.0002278315,0.0005939379],"domain_scores_gemma":[0.9987153,0.0003479487,0.0001287147,0.0004728196,0.0002162738,0.0001188735],"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":[9.871791e-7,0.00003941306,0.00001031463,0.00001246893,0.00001085624,0.00001345451,0.0004032385,0.0001278517,0.00006504222,0.001420536,0.001365202,0.9965307],"study_design_scores_gemma":[0.0002479169,0.00007616133,0.0001377039,0.0001231353,0.000005707709,0.00006714909,0.00001965298,0.9819975,0.004630409,0.00505629,0.007299958,0.0003384443],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003509218,0.00008118839,0.9805065,0.0003277519,0.0002121918,0.0002875664,0.000004501646,0.001786645,0.01328444],"genre_scores_gemma":[0.2865224,0.000001510522,0.7121685,0.0005999089,0.0001967667,0.000003165876,0.000005440045,0.00002292274,0.0004794561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9961922,"threshold_uncertainty_score":0.9999917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039888183","doi":"10.1007/s00607-011-0165-9","title":"Towards a better way of computing: a return from bits to atoms via physics and biology","year":2011,"lang":"en","type":"article","venue":"Computing","topic":"Modular Robots and Swarm Intelligence","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":"Impact","funders":"","keywords":"Computer science; Parallels; Human–computer interaction; Data science; Task (project management); Metaverse; Software; Virtual reality; Systems engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04812683119579398,"gpt":0.250891753655888,"spread":0.202764922460094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009656134,0.00013549,0.0002331925,0.0000399463,0.00003737682,0.00001056288,0.0001585851,0.00006565204,0.00001919445],"category_scores_gemma":[0.0000120302,0.0001275599,0.00003777745,0.0001193546,0.00003662908,0.00002559904,0.0001457983,0.0001235358,0.00001315112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000121805,"about_ca_system_score_gemma":0.000004290111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001720435,"about_ca_topic_score_gemma":0.000004634237,"domain_scores_codex":[0.9992739,0.00002025995,0.0002329553,0.0002008565,0.00005172219,0.0002203329],"domain_scores_gemma":[0.999621,0.00004214479,0.00004066234,0.0001862853,0.00003774638,0.00007215381],"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.000008328991,0.00003828829,0.02615638,0.00009744823,0.0001250501,0.000008502503,0.01577229,0.005082999,0.03398708,0.001454227,0.0001934231,0.917076],"study_design_scores_gemma":[0.000203858,0.0001080267,0.02967379,0.0001709133,0.00002263184,0.000007649382,0.00006937976,0.8632112,0.1008685,0.004835945,0.000406312,0.0004217833],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.529146,0.00009929726,0.4700031,0.000008341636,0.000176937,0.00004826041,0.000002452755,0.00006168965,0.0004539895],"genre_scores_gemma":[0.9657547,0.000003408122,0.03394213,0.00009569276,0.0001762334,5.062923e-7,0.000003908168,0.00002115019,0.000002234186],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9166542,"threshold_uncertainty_score":0.5201741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W627525495","doi":"10.1007/s00607-015-0463-8","title":"Special issue on contributions of computational intelligence in designing complex information systems","year":2015,"lang":"en","type":"article","venue":"Computing","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Collège de Maisonneuve","funders":"","keywords":"Turnkey; Computer science; Computational intelligence; Artificial intelligence; Machine learning; Artificial neural network; Bayesian network; Fuzzy logic; Computational Science and Engineering; Bayesian probability; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.09605182917915579,"gpt":0.3161076946213896,"spread":0.2200558654422338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006390276,0.0001249489,0.0002107017,0.0003543139,0.00009552223,0.000204139,0.000260254,0.00005406786,0.00005662127],"category_scores_gemma":[0.0004356998,0.0001248523,0.00002897476,0.0006909561,0.00006308196,0.001036123,0.0001472893,0.0001285675,0.0004344934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006881654,"about_ca_system_score_gemma":0.00004530303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003470783,"about_ca_topic_score_gemma":0.000008262381,"domain_scores_codex":[0.9987747,0.00001800766,0.0005417531,0.0001387887,0.0003188937,0.0002078748],"domain_scores_gemma":[0.9988367,0.000124078,0.0003277151,0.0001271499,0.0005690195,0.00001535367],"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.0000625241,0.0001002381,0.004657464,0.0001912423,0.00001108171,0.000003847144,0.0003310922,0.7991109,0.00001968824,0.105376,0.02491668,0.06521912],"study_design_scores_gemma":[0.0003569446,0.00001883198,0.005617059,0.0003447975,0.00001022149,0.00000447682,0.001049388,0.8648456,0.0000956154,0.00246326,0.1249595,0.0002342463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03393972,0.00005712718,0.8747067,0.0004831917,0.004036254,0.0007087583,0.00003428776,0.0001702426,0.08586372],"genre_scores_gemma":[0.9935321,7.340864e-7,0.001164451,0.0002817243,0.004798429,0.000002582937,0.0002038458,0.000006526898,0.000009654205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9595923,"threshold_uncertainty_score":0.5584679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888674064","doi":"10.1007/s00607-018-0655-0","title":"Policy expressions and the bottom-up design of computing policies","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Network Packet Processing and Optimization","field":"Computer Science","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 Alberta","funders":"National Science Foundation","keywords":"Equivalence (formal languages); Computer science; Set (abstract data type); Generalization; Predicate (mathematical logic); Policy analysis; Expression (computer science); Representation (politics); Theoretical computer science; Mathematics; Discrete mathematics; Law; Programming language; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02624988976159084,"gpt":0.2896066737618062,"spread":0.2633567840002153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828607,0.0001116625,0.0001774559,0.0001011622,0.0006246621,0.0001716998,0.0005440134,0.00004235479,7.571011e-7],"category_scores_gemma":[0.0002901691,0.00007739743,0.00003064583,0.0006036175,0.0004010486,0.0001462968,0.0005261753,0.0001165996,0.00000270973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158732,"about_ca_system_score_gemma":0.000111222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005486743,"about_ca_topic_score_gemma":6.317337e-7,"domain_scores_codex":[0.9988472,0.0002037156,0.0002581272,0.0002278737,0.0001981954,0.0002648581],"domain_scores_gemma":[0.998622,0.000579252,0.0002148519,0.0003164907,0.0002155227,0.00005189973],"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.00006953918,0.00008255465,0.001466813,0.0001121666,0.00007647758,0.000002657252,0.0892946,0.1124027,0.002232271,0.3528989,0.004133556,0.4372278],"study_design_scores_gemma":[0.0004851352,0.00003253357,0.0004826813,0.0001428497,0.00000489738,0.00001429619,0.0001078645,0.9928507,0.001070818,0.004667362,0.00004588564,0.00009493207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01782738,0.0001879379,0.9795576,0.0008400615,0.0002574192,0.0001064961,1.674996e-7,0.0001288983,0.00109406],"genre_scores_gemma":[0.835442,0.00001152519,0.1637109,0.0003413182,0.000437488,5.506005e-7,2.40054e-7,0.000006987241,0.00004894069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.880448,"threshold_uncertainty_score":0.4804459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}