{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11332,"total_is_capped":false,"direct_labels_cover":8,"predictions_cover":11332,"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":"7d5e525c1154","filters":{"venue":"Lecture notes in computer science"}},"results":[{"id":"W2604314403","doi":"10.1007/978-3-319-93417-4_38","title":"Modeling Relational Data with Graph Convolutional Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":5060,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Computer science; Inference; Predicate (mathematical logic); Encoder; Relational database; Convolutional neural network; Graph; Information retrieval; Artificial intelligence; Knowledge base; Data mining; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03535772873792242,"gpt":0.252253383566264,"spread":0.2168956548283416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007681181,0.0006121119,0.0004742202,0.0006603496,0.0004673292,0.0003539504,0.006063338,0.0003688993,0.0000319963],"category_scores_gemma":[0.00004709822,0.0005214535,0.00008209667,0.001018824,0.001360402,0.001782121,0.003144118,0.001227933,0.00002523183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001719601,"about_ca_system_score_gemma":0.0005449088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008044485,"about_ca_topic_score_gemma":0.0001203488,"domain_scores_codex":[0.994661,0.00003528019,0.0005562094,0.00253365,0.00138349,0.0008303549],"domain_scores_gemma":[0.9956374,0.0004520337,0.0002761165,0.002968356,0.00044508,0.0002210061],"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.00001144802,0.00001060956,0.00003541482,0.000005164904,0.00001408733,0.00004118119,0.0000529457,0.9210442,0.000001553652,0.03621203,0.00005141084,0.04252],"study_design_scores_gemma":[0.0001953924,0.0001020144,0.00002358673,0.0002430425,0.000007436596,0.0001150836,3.546405e-8,0.7764413,0.000002911738,0.2220209,0.0003417445,0.0005065341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002666134,0.0007429385,0.9961635,0.0004068004,0.00146417,0.0003345865,0.00001432637,0.0002175902,0.0006293725],"genre_scores_gemma":[0.07327548,0.00007553532,0.9234707,0.00145396,0.001415579,0.000007555131,0.0001038296,0.00005590375,0.0001414632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1858089,"threshold_uncertainty_score":0.9997237,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W44815768","doi":"10.1007/978-3-642-35289-8_32","title":"A Practical Guide to Training Restricted Boltzmann Machines","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":2825,"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":"Boltzmann machine; Computer science; Set (abstract data type); Artificial intelligence; Generative grammar; Training set; Machine learning; Divergence (linguistics); Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.03733683725891546,"gpt":0.2967167350036891,"spread":0.2593798977447736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001001245,0.0005890717,0.0006141935,0.0007608515,0.0003306731,0.0006912251,0.002385871,0.0002931915,0.00004013835],"category_scores_gemma":[0.0005715084,0.0005120563,0.0001494239,0.0008750447,0.0003441351,0.00100729,0.00158409,0.0007959654,0.0001207081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002315601,"about_ca_system_score_gemma":0.0006803909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003677785,"about_ca_topic_score_gemma":0.00007571177,"domain_scores_codex":[0.9958168,0.00008657922,0.0005966004,0.001497088,0.0009918804,0.001011061],"domain_scores_gemma":[0.9968694,0.0008121944,0.000253259,0.001326315,0.0002955397,0.0004432982],"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.000009352327,0.00003339007,0.00002382719,0.00001086646,0.00002054653,0.0001172477,0.001298498,0.03132127,0.0004206346,0.01193183,0.001972985,0.9528396],"study_design_scores_gemma":[0.0003655136,0.0003289326,0.0003842278,0.000395691,0.00003158458,0.0002275762,6.357959e-7,0.8900129,0.001409656,0.029257,0.07602128,0.001565057],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001067809,0.0003113007,0.9862556,0.004150357,0.00215214,0.0004027081,0.000004489889,0.0001567707,0.006555964],"genre_scores_gemma":[0.04297308,0.00003447022,0.9515081,0.002924601,0.001828994,0.00001289951,0.000003604676,0.00004009884,0.0006741677],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9512745,"threshold_uncertainty_score":0.9997331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W151377110","doi":"10.1007/978-3-642-37456-2_14","title":"Density-Based Clustering Based on Hierarchical Density Estimates","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":2412,"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":"","keywords":"Computer science; Cluster analysis; Hierarchical clustering; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02155881081884803,"gpt":0.2774625965106832,"spread":0.2559037856918352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001052845,0.0008777426,0.0008121474,0.001471137,0.0005455339,0.001057072,0.004706081,0.0004710053,0.00004578003],"category_scores_gemma":[0.0003945358,0.0008144166,0.0002083274,0.0008059339,0.001213467,0.0005700341,0.002449255,0.00205431,0.0002466564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008054438,"about_ca_system_score_gemma":0.0009778027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004348464,"about_ca_topic_score_gemma":0.00008872511,"domain_scores_codex":[0.9931122,0.00008708959,0.0006162942,0.002569691,0.002237341,0.00137739],"domain_scores_gemma":[0.9941137,0.002007819,0.0002604406,0.00265572,0.0004708926,0.0004914713],"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.00001960235,0.00004747265,0.0000446695,0.00007673001,0.000006522412,0.0003030121,0.00007823299,0.6124852,0.0002108438,0.001298455,0.00001197622,0.3854173],"study_design_scores_gemma":[0.0004330807,0.0003426055,0.0002479205,0.0005968327,0.000004715842,0.00004912816,3.867472e-8,0.9581263,0.003744454,0.03548161,0.0001738449,0.0007994969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001602876,0.0000440658,0.9947513,0.00155443,0.001182852,0.0006549079,0.000004236771,0.0004354038,0.001212505],"genre_scores_gemma":[0.1128377,0.000004031501,0.8837252,0.002809397,0.0003212957,0.00002467051,0.000007883185,0.00007255353,0.0001971979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3846178,"threshold_uncertainty_score":0.9999799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W60686164","doi":"10.1007/978-3-642-25566-3_40","title":"Sequential Model-Based Optimization for General Algorithm Configuration","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2377,"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":"Solver; Computer science; Algorithm; Categorical variable; Mathematical optimization; Satisfiability; Integer programming; State (computer science); Optimization problem; Search algorithm; State space; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02616477628119233,"gpt":0.2674975861835472,"spread":0.2413328099023549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005247568,0.0006096991,0.0005015853,0.0008785846,0.0003653966,0.0004216869,0.001942353,0.0004092219,0.00003840955],"category_scores_gemma":[0.00008723113,0.0006276979,0.0001745011,0.0004837822,0.0004998371,0.00112277,0.0003780352,0.0004355017,0.00001128304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005223036,"about_ca_system_score_gemma":0.001072773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009203582,"about_ca_topic_score_gemma":0.00000946371,"domain_scores_codex":[0.9962039,0.00003538729,0.0006244569,0.001757964,0.0007392892,0.0006390087],"domain_scores_gemma":[0.9970486,0.0001944647,0.0004914929,0.001067845,0.001011856,0.0001857336],"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.00000558929,0.00002004323,2.839999e-7,0.00001034764,0.000005435883,0.000005591134,0.0001237326,0.6804618,0.00003293552,0.009221246,0.00000399366,0.310109],"study_design_scores_gemma":[0.0006702276,0.0001449054,0.000001107272,0.00007892436,0.00001153921,0.00001205802,3.938852e-8,0.926464,0.003411001,0.06842327,0.000131902,0.0006510412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[4.989434e-7,0.00007747368,0.9955601,0.0001821432,0.00169266,0.001136787,0.0000330017,0.0002681568,0.001049239],"genre_scores_gemma":[0.0007306621,0.00001858285,0.9971319,0.0009858292,0.0004054768,0.00006757867,0.00008409699,0.00006446243,0.0005114481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.309458,"threshold_uncertainty_score":0.9996175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966661","doi":"10.1007/978-3-642-21735-7_6","title":"Transforming Auto-Encoders","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1323,"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":"Computer science; Artificial intelligence; Scale-invariant feature transform; Artificial neural network; Feature (linguistics); Domain (mathematical analysis); Orientation (vector space); Representation (politics); Encoder; Computer vision; Pattern recognition (psychology); Feature extraction; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02486934333846073,"gpt":0.267167582133467,"spread":0.2422982387950063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007058712,0.0005824945,0.0005442866,0.000870512,0.0002559634,0.0003380678,0.00397293,0.0003589269,0.00003779999],"category_scores_gemma":[0.00006798869,0.000527878,0.000188272,0.000645076,0.0007320545,0.001600022,0.0008368524,0.0009736067,0.00005396678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002604826,"about_ca_system_score_gemma":0.0004909675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000200391,"about_ca_topic_score_gemma":0.00001979073,"domain_scores_codex":[0.9962822,0.00002034502,0.0005399615,0.001537266,0.0008365551,0.000783709],"domain_scores_gemma":[0.9976878,0.0002254527,0.0002333582,0.001439883,0.0002147964,0.0001986775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003625708,0.00001324908,0.000005603674,0.00002248931,0.000005390196,0.00009614247,0.0006123824,0.0002406927,0.0002644475,0.03349571,0.00001324712,0.965227],"study_design_scores_gemma":[0.0002254703,0.0003417132,0.00001692875,0.0005451411,0.00001027465,0.0001298265,1.206736e-7,0.04929345,0.04781064,0.8854082,0.01507144,0.001146749],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003711019,0.0006797562,0.97912,0.0002636928,0.0008806547,0.000433314,0.000002659998,0.0005609202,0.01805533],"genre_scores_gemma":[0.03672412,0.0003741689,0.9598228,0.001758843,0.0003009053,0.00001390226,0.000002677322,0.0000590058,0.0009435512],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9640803,"threshold_uncertainty_score":0.9997173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549228503","doi":"10.1007/0-387-34805-0_39","title":"A Design Principle for Hash Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1190,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Hash function; Computer science; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.06384997702380152,"gpt":0.3182864825069628,"spread":0.2544365054831613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001533707,0.0003743195,0.0003394175,0.00112108,0.0005233187,0.0005005756,0.00194803,0.0002172169,0.000032817],"category_scores_gemma":[0.00006192852,0.0003576826,0.0001630579,0.0007781311,0.0003959641,0.0004305596,0.0006052939,0.0004222629,0.00001929038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001976921,"about_ca_system_score_gemma":0.0005547336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001377525,"about_ca_topic_score_gemma":0.0001630532,"domain_scores_codex":[0.996958,0.00002052455,0.0004981021,0.001182681,0.0006628674,0.0006778511],"domain_scores_gemma":[0.9974695,0.0007623684,0.0002140987,0.001066722,0.0003311717,0.0001560781],"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.00001235221,0.00005656954,0.00002608774,0.00003439768,0.0000208658,0.00002192232,0.0008893625,0.01279316,0.00008172824,0.2191985,0.0001376075,0.7667274],"study_design_scores_gemma":[0.000655267,0.0004569765,0.00009877747,0.0001299988,0.00001780646,0.00006058364,3.682826e-7,0.602838,0.0007217298,0.3602792,0.03389931,0.0008420072],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000210456,0.0001335564,0.9957556,0.0003893639,0.001559954,0.0009544695,0.0000129307,0.0001546347,0.001018487],"genre_scores_gemma":[0.01190965,0.00001526761,0.9861951,0.001066152,0.0003392777,0.00004510697,0.00001363093,0.00002636603,0.0003894013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7658854,"threshold_uncertainty_score":0.9998875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3104370314","doi":"10.1007/978-3-319-67558-9","title":"Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI in cancer detection","field":"Computer Science","cited_by":1132,"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":"Computer science; Artificial intelligence; Generalization; Normalization (sociology); Deep learning; Machine learning; Pattern recognition (psychology); Domain (mathematical analysis); Representation (politics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02024162509865219,"gpt":0.3487750863579071,"spread":0.3285334612592549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006641333,0.0004702735,0.001031627,0.001662429,0.0006093878,0.0009541656,0.003630531,0.0007709617,0.00002123829],"category_scores_gemma":[0.003758365,0.0004466799,0.0003026703,0.001284156,0.001130288,0.0009358586,0.002132168,0.002499765,0.00001111799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005171741,"about_ca_system_score_gemma":0.001558017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006031596,"about_ca_topic_score_gemma":0.0009454709,"domain_scores_codex":[0.9940552,0.0002292979,0.001023502,0.002347033,0.00152886,0.0008161373],"domain_scores_gemma":[0.9936473,0.003908742,0.0006641042,0.001163582,0.0002862678,0.0003299661],"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.00002150084,0.00002510265,0.008081738,0.00002708874,0.00002861954,0.00008821085,0.0003731965,0.03487027,0.000004793259,0.00002485938,0.00002409205,0.9564306],"study_design_scores_gemma":[0.0007678116,0.0003888326,0.01223352,0.000218432,0.00003968527,0.00004436056,3.419495e-7,0.9771528,0.00004512467,0.00679799,0.001835388,0.000475668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006289174,0.0002491761,0.9962004,0.0003929182,0.001697247,0.0004079751,8.231889e-7,0.0001424263,0.0002801551],"genre_scores_gemma":[0.1286837,0.0004207204,0.8688595,0.00052666,0.0009852214,0.00004331167,0.00001497734,0.00004666295,0.0004192038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9559548,"threshold_uncertainty_score":0.9998015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2500062327","doi":"10.1007/978-3-540-88425-5","title":"Rough Sets and Current Trends in Computing","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1099,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Current (fluid); Rough set; Artificial intelligence; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0248559307893422,"gpt":0.2768443501141991,"spread":0.2519884193248569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007797235,0.0005828837,0.0006933893,0.001538099,0.000282101,0.0005373117,0.002888839,0.0002835739,0.00000329536],"category_scores_gemma":[0.00004122556,0.0005137667,0.0001028461,0.002241201,0.0006839744,0.0006020572,0.002120748,0.001215481,0.00001223813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004296987,"about_ca_system_score_gemma":0.0005910804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003564736,"about_ca_topic_score_gemma":0.00007725758,"domain_scores_codex":[0.9955047,0.0000930571,0.0006246566,0.001919348,0.0008868041,0.00097142],"domain_scores_gemma":[0.997977,0.0003849161,0.0002605801,0.001088658,0.00009103002,0.000197884],"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.000001750517,0.0000436286,0.0003516561,0.00002602514,0.000002419172,0.0001452279,0.001363246,0.0119899,0.000001144403,0.0008182633,0.0002487309,0.985008],"study_design_scores_gemma":[0.0004575072,0.0001416469,0.004929504,0.0004393615,0.000003048662,0.0002314884,1.211879e-7,0.9633621,0.00001520528,0.02586932,0.003785724,0.0007649849],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005591893,0.003227533,0.9898571,0.0004695495,0.002158756,0.0002162894,0.00000386779,0.0001415229,0.003366163],"genre_scores_gemma":[0.2194667,0.0007214812,0.7765946,0.001870577,0.001035474,0.00001148545,0.00002853904,0.0000593018,0.0002118969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.984243,"threshold_uncertainty_score":0.9997314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589176872","doi":"10.1007/3-540-46766-1_35","title":"Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1043,"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":"Zero-knowledge proof; Ciphertext; Computer science; Computer security; Encryption; Cryptography","retraction":null,"screen_n_in":null,"score":{"opus":0.02433145023707008,"gpt":0.2923114647678343,"spread":0.2679800145307643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001106066,0.0006368863,0.0007893183,0.001223751,0.0002144449,0.000275249,0.003004792,0.0004144818,0.00001934956],"category_scores_gemma":[0.00006597886,0.0005814171,0.0001933847,0.001068372,0.001332898,0.0009402814,0.002483535,0.0009879048,0.00002537589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001508466,"about_ca_system_score_gemma":0.0004784171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002431779,"about_ca_topic_score_gemma":0.0002919598,"domain_scores_codex":[0.996222,0.00003779984,0.0006897598,0.001750837,0.0005985659,0.000701018],"domain_scores_gemma":[0.9965605,0.0007374049,0.0004124836,0.001534369,0.000486654,0.0002685983],"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.00002779636,0.0002134369,0.0002333649,0.0002258176,0.0000405235,0.00004507363,0.006751815,0.0003477467,0.0001411785,0.02160772,0.0002085639,0.970157],"study_design_scores_gemma":[0.00229426,0.001666809,0.004102396,0.004011803,0.00007650869,0.0003129556,0.000002643037,0.6003383,0.01929944,0.3309738,0.03326143,0.003659699],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004803076,0.002254047,0.9768388,0.00007551216,0.001465316,0.0005598294,0.00002055737,0.00007501325,0.01823059],"genre_scores_gemma":[0.7391931,0.0001439736,0.259398,0.0003933296,0.0005623935,0.00001407533,0.00001626504,0.00005975526,0.000219045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9664972,"threshold_uncertainty_score":0.9996637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147953023","doi":"10.1007/978-3-540-24670-1_3","title":"A Boosted Particle Filter: Multitarget Detection and Tracking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":1029,"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":"AdaBoost; Particle filter; Artificial intelligence; Tracking (education); Computer science; Computer vision; Filter (signal processing); Mixture model; Video tracking; Gaussian; Context (archaeology); Pattern recognition (psychology); Object detection; Object (grammar); Classifier (UML)","retraction":null,"screen_n_in":null,"score":{"opus":0.01866135330152782,"gpt":0.2339072648257161,"spread":0.2152459115241882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005666383,0.000426336,0.0003849056,0.0003603384,0.0003755142,0.0007257223,0.001375055,0.0003099637,0.00002324792],"category_scores_gemma":[0.00009158025,0.0003987742,0.00008146391,0.000441714,0.000460899,0.0007833098,0.0008562932,0.0007712676,0.00002842829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001851101,"about_ca_system_score_gemma":0.0001622758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004556546,"about_ca_topic_score_gemma":0.0001140607,"domain_scores_codex":[0.9968296,0.00003317339,0.0004552329,0.001408758,0.0006496871,0.0006235217],"domain_scores_gemma":[0.9980888,0.0003399799,0.0002023027,0.001011874,0.0001539331,0.0002031134],"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.000008237808,0.00002555778,0.00008252096,0.00002815626,0.000007762566,0.0001061617,0.0007641154,0.03530018,0.001066457,0.006217076,0.000006866607,0.9563869],"study_design_scores_gemma":[0.0006377849,0.0002206837,0.0007875412,0.000542723,0.0000114816,0.000196833,3.200296e-7,0.8905289,0.008986418,0.09581158,0.001424594,0.0008511523],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001210487,0.0006767088,0.9952633,0.0003389987,0.001563687,0.0002638666,0.000006464636,0.0002850966,0.0003913677],"genre_scores_gemma":[0.8020497,0.00007652283,0.1967524,0.0006835476,0.0003299599,0.000005496165,0.000003995708,0.0000287662,0.00006960167],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9555358,"threshold_uncertainty_score":0.9998464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2517954747","doi":"10.1007/978-3-319-46976-8_19","title":"The Importance of Skip Connections in Biomedical Image Segmentation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":991,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Centre Hospitalier de l’Université de Montréal; Université de Montréal; Polytechnique Montréal","funders":"Mitacs","keywords":"Computer science; Upsampling; Path (computing); Residual; Segmentation; Artificial intelligence; Image (mathematics); Image segmentation; Pattern recognition (psychology); Computer vision; Algorithm; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01373374754625272,"gpt":0.2756294804930322,"spread":0.2618957329467795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161827,0.0002701791,0.0002876413,0.0003947631,0.0002530584,0.0001205201,0.002339927,0.0001463871,0.000009169531],"category_scores_gemma":[0.0001137878,0.0001845283,0.00007372272,0.0008829916,0.00136944,0.0004742933,0.000697298,0.0004322311,0.00001830303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002583746,"about_ca_system_score_gemma":0.0002914248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003937726,"about_ca_topic_score_gemma":0.0001587074,"domain_scores_codex":[0.9973464,0.0000329022,0.0006209628,0.0009021488,0.0006472925,0.0004502884],"domain_scores_gemma":[0.99688,0.001305139,0.0003972455,0.001155609,0.0001649091,0.00009709116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005659437,0.00003595756,0.0002112521,0.00001444822,0.000006533518,0.00002304436,0.0002455937,0.002515041,0.002778285,0.1862065,0.00005185246,0.8079058],"study_design_scores_gemma":[0.0004870322,0.0001505123,0.000637396,0.0003422197,0.000005385862,0.00006340582,5.356878e-7,0.178868,0.004383448,0.8112588,0.003250815,0.0005524316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001344608,0.0002589569,0.9931024,0.004256748,0.0006706205,0.0004419505,0.00000681205,0.00006423876,0.0010638],"genre_scores_gemma":[0.1437498,0.0004306843,0.8532297,0.001285816,0.0005857457,0.0001125043,0.000008304872,0.00005089426,0.0005465851],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8073534,"threshold_uncertainty_score":0.7524846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2560311620","doi":"10.1007/978-3-319-50835-1_22","title":"Optimizing Intersection-Over-Union in Deep Neural Networks for Image Segmentation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":903,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Softmax function; Artificial intelligence; Computer science; Segmentation; Intersection (aeronautics); Pattern recognition (psychology); Object (grammar); Image segmentation; Artificial neural network; Deep learning; Object detection; Deep neural networks; Pixel; Computer vision; Cartography","retraction":null,"screen_n_in":null,"score":{"opus":0.01384282197705767,"gpt":0.2666441925100097,"spread":0.252801370532952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005233369,0.0004475248,0.0003805025,0.0006743174,0.000256492,0.0003320421,0.001930644,0.0002303006,0.000008593292],"category_scores_gemma":[0.00004376619,0.0004042519,0.000123094,0.0006549648,0.0003513957,0.001287548,0.0007610056,0.00055152,0.000006588805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00061376,"about_ca_system_score_gemma":0.00008195706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000066158,"about_ca_topic_score_gemma":0.0001610943,"domain_scores_codex":[0.9968468,0.00004088312,0.0005625768,0.001454455,0.0004204433,0.0006748707],"domain_scores_gemma":[0.9976555,0.0007865393,0.0003551207,0.0009142912,0.00016728,0.0001212377],"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.000006976522,0.00001101522,0.00001582652,0.000009617093,0.000002932245,0.000008492966,0.0001982732,0.3541289,0.0003731347,0.006781053,0.000006336618,0.6384575],"study_design_scores_gemma":[0.0003962502,0.0001005018,0.0000428807,0.0001555508,0.000003795829,0.00002510334,2.850041e-7,0.929703,0.0004493525,0.06858109,0.0001195485,0.0004226427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005842088,0.0001846381,0.9957886,0.0007628924,0.001668164,0.00096921,0.000003861474,0.000156949,0.0004072814],"genre_scores_gemma":[0.1293245,0.00004987841,0.8686163,0.0009936937,0.0007197898,0.00012577,0.00001260047,0.00005148605,0.0001059034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6380348,"threshold_uncertainty_score":0.9998409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3117804044","doi":"10.1007/978-3-030-01270-0_39","title":"Deep Continuous Fusion for Multi-sensor 3D Object Detection","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":841,"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":"Computer science; Fuse (electrical); Benchmark (surveying); Artificial intelligence; Computer vision; Lidar; Object detection; Detector; Exploit; Object (grammar); ENCODE; Feature (linguistics); Image sensor; State (computer science); Sensor fusion; Pattern recognition (psychology); Algorithm; Remote sensing","retraction":null,"screen_n_in":null,"score":{"opus":0.02506021675575439,"gpt":0.275280890487304,"spread":0.2502206737315497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000489398,0.0005519692,0.0005092032,0.0005590127,0.0005817561,0.0003424214,0.002575487,0.0003613361,0.00001489262],"category_scores_gemma":[0.0001395679,0.000518576,0.0001662815,0.0006664967,0.0006596483,0.0005150302,0.0009784854,0.0005561203,0.00008064784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003090159,"about_ca_system_score_gemma":0.0001686094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000824189,"about_ca_topic_score_gemma":0.0002718933,"domain_scores_codex":[0.9961199,0.0000290364,0.0005451449,0.001937479,0.0006024659,0.0007660323],"domain_scores_gemma":[0.9967343,0.0006223251,0.0004189761,0.001555195,0.0004927585,0.0001764107],"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.00001310856,0.00003095936,0.000007373599,0.00002238218,0.000007220385,0.00001086713,0.0003440738,0.02022894,0.001913891,0.001705406,0.00001523428,0.9757006],"study_design_scores_gemma":[0.000393466,0.0002917622,0.000041909,0.0001128218,0.000009623157,0.00006686332,1.540437e-7,0.9448817,0.006223205,0.04290477,0.004465949,0.0006077243],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007706627,0.0002321029,0.9954938,0.0002048411,0.001978857,0.00131612,0.000005363841,0.0003510759,0.0003407804],"genre_scores_gemma":[0.01690461,0.00004842986,0.980378,0.000945624,0.001004092,0.00008842195,0.000006611996,0.00005508374,0.0005691009],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9750928,"threshold_uncertainty_score":0.9997266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963248893","doi":"10.1007/978-3-319-46128-1_50","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":832,"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":"Convexity; Rate of convergence; Applied mathematics; Mathematics; Stochastic gradient descent; Convergence (economics); Gradient descent; Mathematical proof; Generalization; Simple (philosophy); Convex function; Regular polygon; Mathematical optimization; Computer science; Mathematical analysis; Artificial neural network; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0238326173554937,"gpt":0.2977316453413589,"spread":0.2738990279858652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001586759,0.0005125259,0.0005615324,0.0007158026,0.0002704163,0.0001600716,0.002441116,0.0002533278,0.00002319874],"category_scores_gemma":[0.0001520445,0.0003400559,0.0001253652,0.0006332943,0.002063059,0.0004388562,0.00123862,0.0004497758,0.000006186121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002160782,"about_ca_system_score_gemma":0.0003265283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000128212,"about_ca_topic_score_gemma":0.000009078291,"domain_scores_codex":[0.9964291,0.0001190356,0.0007206218,0.001328714,0.0008371781,0.00056539],"domain_scores_gemma":[0.9963624,0.001032265,0.0006019445,0.001412737,0.0004192298,0.0001714304],"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.000009153763,0.000043007,0.00004992199,0.00006360839,0.00003131322,0.0000108073,0.0009960788,0.00513365,0.0007814504,0.7871828,0.00002433271,0.2056739],"study_design_scores_gemma":[0.0003981699,0.0004960743,0.000267362,0.0007569331,0.00003185753,0.0001553919,0.000001057673,0.4596758,0.02306749,0.5138304,0.0005275907,0.0007918123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007333168,0.0006734192,0.9947411,0.001412275,0.001311917,0.000813456,0.00001191842,0.0001668046,0.0007958202],"genre_scores_gemma":[0.07764057,0.0001702236,0.9206927,0.001022497,0.000163552,0.00003963078,0.000003473948,0.00003794749,0.0002293416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4545422,"threshold_uncertainty_score":0.9999052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1916886752","doi":"10.1007/3-540-48285-7_35","title":"Secret-Key Reconciliation by Public Discussion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":790,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Collège Montmorency","funders":"","keywords":"Alice (programming language); Key (lock); Computer science; Channel (broadcasting); Alice and Bob; Computer security; Construct (python library); Protocol (science); Theoretical computer science; Binary number; Algorithm; Computer network; Mathematics; Arithmetic; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02534850090791529,"gpt":0.2537469176716241,"spread":0.2283984167637088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007381297,0.000329988,0.0002938472,0.0005873396,0.0001167702,0.0002076232,0.001297415,0.0004154897,0.00006076423],"category_scores_gemma":[0.00005890043,0.0002724825,0.00006429134,0.0003366419,0.0002925813,0.0003957035,0.0003249447,0.0008674798,0.00002728941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005213043,"about_ca_system_score_gemma":0.0000894152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007948533,"about_ca_topic_score_gemma":0.0001232785,"domain_scores_codex":[0.9981483,0.00001798873,0.0004140052,0.0004800958,0.0005573336,0.0003823333],"domain_scores_gemma":[0.9984748,0.0001709378,0.0001106053,0.0009877848,0.000139301,0.0001166188],"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.00000160313,0.00001036321,0.00003687631,0.00004565063,0.000007097855,0.000003890558,0.0005526283,0.004083871,0.0007362312,0.003351678,0.000498594,0.9906715],"study_design_scores_gemma":[0.0002636055,0.00009328279,0.00008039453,0.0007514355,0.000009543284,0.00002549143,5.932175e-7,0.7216452,0.015127,0.07499565,0.1855498,0.001457921],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001071642,0.0007340819,0.9853732,0.0006815278,0.0005064188,0.0002539025,0.000011359,0.0006848321,0.01164751],"genre_scores_gemma":[0.69508,0.000832158,0.3012224,0.001177748,0.0005303212,0.0000307694,0.0001981057,0.0001920671,0.0007364059],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9892136,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1670558497","doi":"10.1007/3-540-39799-x_41","title":"On the Design of S-Boxes","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":713,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Plaintext; Ciphertext; Mathematics; Arithmetic; Malleability; Bit (key); Function (biology); Discrete mathematics; Combinatorics; Algorithm; Computer science; Encryption; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03851490802162377,"gpt":0.2627779418962908,"spread":0.2242630338746671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002487764,0.000460187,0.0004206293,0.0008553588,0.0001995867,0.0002521091,0.004075598,0.0002408713,0.00004814201],"category_scores_gemma":[0.0002685458,0.0003233614,0.000139932,0.000792247,0.0009861897,0.0003673368,0.0007568605,0.0008309864,0.00007307358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002582229,"about_ca_system_score_gemma":0.0004875566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001854491,"about_ca_topic_score_gemma":0.00001207057,"domain_scores_codex":[0.9963199,0.00007782708,0.0005342896,0.001103496,0.001413943,0.0005504895],"domain_scores_gemma":[0.9945517,0.003040993,0.0003848946,0.001632553,0.0002814147,0.000108433],"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.00002779088,0.00005520225,0.000004478009,0.00003285156,0.00001476807,0.00008372524,0.0006548414,0.1755121,0.001972982,0.279587,0.0001296245,0.5419246],"study_design_scores_gemma":[0.0001996008,0.0004422504,0.00003732309,0.0004653028,0.000006892012,0.00003711131,1.124927e-7,0.5557513,0.01854551,0.4236906,0.0003310323,0.0004929188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003571251,0.0001820663,0.9941509,0.0008404775,0.000973766,0.0004934017,0.00000251046,0.0001017621,0.003219361],"genre_scores_gemma":[0.1653164,0.00004584683,0.8278469,0.0058034,0.0005016145,0.00001320172,0.000002605112,0.00006081462,0.0004091449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5414317,"threshold_uncertainty_score":0.9999219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1574082713","doi":"10.1007/3-540-44634-6","title":"Algorithms and Data Structures","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":626,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03008785630812405,"gpt":0.2894725715367051,"spread":0.2593847152285811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004433717,0.0003512073,0.0003360279,0.0003000764,0.0002801741,0.0008034036,0.006551394,0.0001930387,0.000007448768],"category_scores_gemma":[0.00003254215,0.0002968016,0.00003236457,0.0009675887,0.0005725406,0.0007084371,0.004490874,0.0006298954,0.000009128433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009350035,"about_ca_system_score_gemma":0.0004728241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002168196,"about_ca_topic_score_gemma":0.00005323108,"domain_scores_codex":[0.9966862,0.00002833149,0.000307674,0.001869634,0.0005786215,0.0005295807],"domain_scores_gemma":[0.9964747,0.0003275039,0.000157008,0.00279066,0.00008270197,0.0001673575],"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":[5.14654e-7,0.00000935032,0.00002576141,0.0000104768,0.000003485473,0.00003243869,0.00007272005,0.003765514,0.00001287198,0.003995876,0.001213375,0.9908576],"study_design_scores_gemma":[0.0001049403,0.00003689048,0.0002268163,0.00006689259,0.000004451148,0.0001394463,3.027204e-8,0.768261,0.00004543137,0.2121734,0.01857368,0.0003670256],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002833822,0.000849749,0.9956442,0.001262902,0.0007981346,0.0002724261,0.00001443372,0.0001235185,0.00100629],"genre_scores_gemma":[0.006973836,0.0003400977,0.9871093,0.002798863,0.001616648,0.00001210745,0.00005485152,0.00003240747,0.00106188],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9904906,"threshold_uncertainty_score":0.9999484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W73112891","doi":"10.1007/978-3-642-15567-3_16","title":"Learning to Detect Roads in High-Resolution Aerial Images","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":624,"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":"Computer science; Initialization; Artificial intelligence; Context (archaeology); Task (project management); Feature engineering; Artificial neural network; Feature (linguistics); Deep learning; Object detection; Machine learning; Computer vision; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.006167981939215608,"gpt":0.2146971444104521,"spread":0.2085291624712365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000349202,0.0002845345,0.0002693805,0.0007040685,0.0001051665,0.0001460828,0.0004051362,0.000386421,0.00002859491],"category_scores_gemma":[0.00007265041,0.00028234,0.00004384956,0.000289387,0.0001141457,0.0001990727,0.0001334726,0.001259304,0.00004568274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002547464,"about_ca_system_score_gemma":0.00005584154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006148961,"about_ca_topic_score_gemma":0.0001964465,"domain_scores_codex":[0.9985318,0.00001180144,0.0002621531,0.0004844737,0.0003160447,0.0003937671],"domain_scores_gemma":[0.9994727,0.00009630185,0.00005653817,0.0002575585,0.00004211074,0.00007479826],"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.000004371573,0.000002069974,0.0000136319,0.00001516555,0.000002129571,0.00001638687,0.0001378099,0.6957424,0.03058944,0.00002811841,0.000008937967,0.2734396],"study_design_scores_gemma":[0.0005041477,0.0002558059,0.002799902,0.0007894284,0.00001391828,0.00007247899,3.222748e-7,0.8974308,0.07952061,0.01121429,0.006126927,0.001271414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0252138,0.0001126364,0.9695444,0.00007310534,0.003672249,0.000208132,0.000002330216,0.0004306249,0.0007427342],"genre_scores_gemma":[0.9031828,0.00002663905,0.09573036,0.0000586174,0.0008468829,0.00000655986,0.000005437034,0.00004741607,0.00009527162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.877969,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1612175259","doi":"10.1007/978-3-319-11755-3","title":"Image Analysis and Recognition","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":607,"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; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01260559046677196,"gpt":0.2228593285212617,"spread":0.2102537380544898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005159317,0.0001895929,0.0003324808,0.0009146159,0.0000712718,0.000188357,0.0001637343,0.0002590716,0.00001620168],"category_scores_gemma":[0.00004085405,0.0001736914,0.00007369167,0.0009345376,0.0001151092,0.000122897,0.00005748279,0.0003695764,0.00002755056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001544573,"about_ca_system_score_gemma":0.00004796134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002107137,"about_ca_topic_score_gemma":0.0000760391,"domain_scores_codex":[0.9988879,0.00002457076,0.0002347477,0.0003848715,0.0002603952,0.0002075364],"domain_scores_gemma":[0.9993984,0.0001587873,0.00005636741,0.0002561174,0.00006939441,0.00006089978],"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.000002339686,0.000002400147,0.00002920445,0.00005911438,0.00003933244,0.0000065271,0.0001345804,0.02453679,0.0004829127,0.000001905232,0.0001714401,0.9745334],"study_design_scores_gemma":[0.0002007085,0.00007487999,0.000278019,0.0001995204,0.00009432115,0.00002151138,1.16392e-7,0.9886215,0.002475273,0.005424177,0.002161887,0.0004480652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001834989,0.0001009307,0.9940734,0.000008049618,0.001082568,0.0001340597,0.000005568932,0.0001201482,0.002640306],"genre_scores_gemma":[0.8644028,0.00007581742,0.1294971,0.0003544628,0.004510163,0.00002975425,0.00007775104,0.0001142018,0.0009379842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9740854,"threshold_uncertainty_score":0.7082931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1591163814","doi":"10.1007/11866763_8","title":"Symmetric Atlasing and Model Based Segmentation: An Application to the Hippocampus in Older Adults","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":603,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Segmentation; Computer science; Tracing; Artificial intelligence; Computer vision; Extension (predicate logic); Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.02170383164047134,"gpt":0.2782831723838239,"spread":0.2565793407433525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003843404,0.0001104091,0.000085431,0.00029778,0.0002031994,0.0001388436,0.0004183789,0.00003437109,0.000001324449],"category_scores_gemma":[0.000101716,0.00008124842,0.00001115297,0.002190175,0.00009992278,0.0002952053,0.00008672466,0.0001306369,0.000003382778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005106316,"about_ca_system_score_gemma":0.00004087113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002902044,"about_ca_topic_score_gemma":0.0001394672,"domain_scores_codex":[0.998569,0.00008425683,0.0001625783,0.0006213346,0.0003063226,0.0002565609],"domain_scores_gemma":[0.9993073,0.0002861768,0.00004694915,0.0002789334,0.00002303722,0.00005757296],"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.00001130667,0.00004012067,0.0002624234,0.000005723897,3.537797e-8,0.000003121367,0.0003162809,0.5237066,0.1338267,0.000125342,4.654013e-7,0.3417019],"study_design_scores_gemma":[0.0001712276,0.0000402381,0.001799639,0.00001761158,4.642553e-7,0.000006577547,6.422513e-7,0.6411699,0.3482915,0.008431375,3.019142e-7,0.00007046966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4939524,0.000006811068,0.5051868,0.000504887,0.00008186088,0.0002470247,5.688177e-7,0.000016081,0.000003610576],"genre_scores_gemma":[0.955473,7.961211e-7,0.04070442,0.003727578,0.00005945801,0.00002850361,6.847201e-7,0.000005271454,2.917828e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4644824,"threshold_uncertainty_score":0.3313214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3096266342","doi":"10.1007/978-3-030-61377-8_28","title":"BERTimbau: Pretrained BERT Models for Brazilian Portuguese","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":598,"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; Natural language processing; Artificial intelligence; Transformer; Language model; Sentence; Encoder; Portuguese; Transfer of learning; Textual entailment; Named-entity recognition; Logical consequence; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02926096844476913,"gpt":0.252910922927005,"spread":0.2236499544822358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007552507,0.0006648118,0.0007257988,0.0005448005,0.0002323744,0.0004543343,0.004793234,0.0004302938,0.00001075957],"category_scores_gemma":[0.0001491781,0.0006411715,0.0002644695,0.0004792425,0.0003851264,0.001003216,0.001497004,0.0007529471,0.00002179507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002583589,"about_ca_system_score_gemma":0.00081582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000190124,"about_ca_topic_score_gemma":0.00003855459,"domain_scores_codex":[0.9948258,0.00002380076,0.0007489099,0.002460178,0.001089032,0.0008522155],"domain_scores_gemma":[0.9967499,0.0004318216,0.0002997886,0.00183163,0.0003182157,0.0003686573],"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.00001049129,0.00001971531,0.000003399311,0.00007536585,0.00001713391,0.00005677943,0.001018105,0.1321606,0.0001495577,0.1085206,0.00008727958,0.7578809],"study_design_scores_gemma":[0.0002226103,0.0001181228,0.000006411401,0.0001426698,0.000006736633,0.00001840783,7.125085e-8,0.6552728,0.0002268736,0.3425184,0.0009998253,0.0004671118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001280685,0.0005960683,0.9876415,0.003522066,0.00169521,0.0009306915,0.00001453876,0.0003243498,0.005262733],"genre_scores_gemma":[0.07136209,0.00003047293,0.9214533,0.005473265,0.0008855305,0.0000375368,0.00001400745,0.00006968385,0.0006741227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7574138,"threshold_uncertainty_score":0.9996039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094810043","doi":"10.1007/11561347_28","title":"Mapping Features to Models: A Template Approach Based on Superimposed Variants","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":579,"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; Feature (linguistics); Unified Modeling Language; Semantics (computer science); Feature model; Artificial intelligence; Class (philosophy); Data mining; Programming language; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02164612689303328,"gpt":0.2319028754730577,"spread":0.2102567485800244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000860823,0.0009784739,0.0007865119,0.002196104,0.000440237,0.0009215123,0.006012482,0.0004781006,0.00001717162],"category_scores_gemma":[0.0000247556,0.0008470993,0.0002155482,0.001621517,0.0002083026,0.0007053714,0.001478232,0.001254364,0.00006229354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002977108,"about_ca_system_score_gemma":0.0006085517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008383522,"about_ca_topic_score_gemma":0.0001295308,"domain_scores_codex":[0.9935968,0.00006821222,0.0006589309,0.002817994,0.001682036,0.001176037],"domain_scores_gemma":[0.9960553,0.0004163475,0.000241059,0.0025202,0.000312353,0.0004547148],"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.00002577283,0.00007390766,0.000004047851,0.00006659968,0.00001521563,0.00006784109,0.003493697,0.7294151,0.000172152,0.01042624,0.00003068671,0.2562087],"study_design_scores_gemma":[0.0004571964,0.0002651727,0.0001169455,0.000614937,0.000007198999,0.00006884499,0.000001232194,0.9607893,0.0005057608,0.0331308,0.002984808,0.001057866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001004558,0.0002160979,0.9714993,0.002681901,0.00110115,0.0008245253,0.00001426929,0.0003619499,0.0232003],"genre_scores_gemma":[0.1131187,0.00001064094,0.8527334,0.03290921,0.0008688435,0.00003676065,0.00002007337,0.0000825416,0.0002198851],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2551509,"threshold_uncertainty_score":0.999398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2298168480","doi":"10.1007/978-3-540-72530-5","title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","year":2007,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":573,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Regina; University of Winnipeg; York University","funders":"","keywords":"Granular computing; Rough set; Data mining; Computer science; Fuzzy set; Fuzzy logic; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03682741232498869,"gpt":0.2833880134363644,"spread":0.2465606011113757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00336255,0.0008311403,0.0008961012,0.0009391103,0.0006604152,0.001531953,0.009083957,0.0005342797,0.00000405556],"category_scores_gemma":[0.0001674837,0.0007467383,0.00009532044,0.001746062,0.001088005,0.001336736,0.009019366,0.0011002,0.00001783136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002990229,"about_ca_system_score_gemma":0.0009683745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000543246,"about_ca_topic_score_gemma":0.0001011702,"domain_scores_codex":[0.9927251,0.0001183759,0.0008637277,0.003344707,0.00146804,0.001480102],"domain_scores_gemma":[0.9941327,0.001098606,0.0004587854,0.003770602,0.0001876548,0.000351627],"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.000003845098,0.00003273881,0.000262694,0.00007923986,0.00001166962,0.0003149041,0.001114191,0.003879251,0.000004183738,0.0007936279,0.001013427,0.9924902],"study_design_scores_gemma":[0.0004131162,0.0001540145,0.0005361672,0.0005143051,0.00001681832,0.0003578981,9.029931e-7,0.954652,0.00002324903,0.03689088,0.005385902,0.001054815],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002897753,0.002981929,0.9886211,0.0005674279,0.002340081,0.0004519795,0.0000276547,0.0002896505,0.004430438],"genre_scores_gemma":[0.01851318,0.0001275452,0.977295,0.003113908,0.0007126235,0.000002259661,0.00009595699,0.00004976337,0.00008972297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9914354,"threshold_uncertainty_score":0.9995046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1539705164","doi":"10.1007/978-3-642-02161-9_3","title":"Engineering Self-Adaptive Systems through Feedback Loops","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":560,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); York University; University of Victoria","funders":"","keywords":"Computer science; Adaptation (eye); Adaptive system; Process (computing); Perspective (graphical); Software; Class (philosophy); Software engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02784657795735096,"gpt":0.2525572822981015,"spread":0.2247107043407506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027517,0.0008560083,0.0008923833,0.0006598771,0.0001766191,0.000525227,0.004081124,0.0004843565,0.000003033207],"category_scores_gemma":[0.0003460164,0.0008286251,0.0001600377,0.0008572802,0.0002524704,0.001196573,0.001194467,0.001293036,0.00005681757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007371854,"about_ca_system_score_gemma":0.0004047191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001124201,"about_ca_topic_score_gemma":0.000002562627,"domain_scores_codex":[0.9953827,0.00003960261,0.0006338842,0.001884493,0.001041914,0.001017448],"domain_scores_gemma":[0.9958014,0.001609528,0.0002977067,0.001850691,0.0002698922,0.0001707404],"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.000002278548,0.0000121872,0.000001220325,0.00004634091,0.00001628633,0.0001152058,0.0005243399,0.8218159,0.00006144059,0.03848543,0.000009816477,0.1389096],"study_design_scores_gemma":[0.0002910468,0.0002899283,0.0000540765,0.0008552014,0.0000149538,0.0002419092,3.206589e-7,0.8247815,0.001134505,0.1675552,0.003251759,0.001529638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000008357504,0.001858175,0.9909447,0.000143966,0.003868443,0.0004799653,0.000003581531,0.001576299,0.001116536],"genre_scores_gemma":[0.004926686,0.0001186313,0.9937882,0.0002917142,0.0005633799,0.00001310999,0.000001829346,0.00005977746,0.0002366245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1373799,"threshold_uncertainty_score":0.9994165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2507635762","doi":"10.1007/978-3-319-46131-1_8","title":"The SPMF Open-Source Data Mining Library Version 2","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":551,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Implementation; Authorship attribution; Data mining; Plug-in; Open source; Visualization; Information retrieval; Interface (matter); Software; Software engineering; Artificial intelligence; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03201302824163588,"gpt":0.2657663356650473,"spread":0.2337533074234114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001061724,0.0003673833,0.0003013809,0.0002339911,0.0009438265,0.003061086,0.0251153,0.0001691482,0.0000267689],"category_scores_gemma":[0.00009131594,0.0002360022,0.00004769032,0.0005016099,0.0007176307,0.002814252,0.0230522,0.0004461748,0.0001636844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007547386,"about_ca_system_score_gemma":0.0006228227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001074278,"about_ca_topic_score_gemma":0.00001545456,"domain_scores_codex":[0.9964331,0.00003343374,0.0004075693,0.001852083,0.0007004574,0.000573324],"domain_scores_gemma":[0.9932131,0.001171617,0.0002854978,0.005092297,0.00007196533,0.0001655657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002057354,0.000008764488,0.000008861952,0.000003746672,0.000005447478,0.00001147648,0.0001092958,0.00009073387,0.00001039084,0.01483858,0.002696409,0.9822142],"study_design_scores_gemma":[0.0002095589,0.00006442932,0.00003140561,0.0003950091,0.000005736054,0.00004193587,3.570082e-7,0.4144326,0.0001521895,0.03665651,0.5475284,0.0004817954],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000005793956,0.00042884,0.9786344,0.006037675,0.001109887,0.000329872,0.00007895607,0.00017322,0.01320142],"genre_scores_gemma":[0.001029099,0.0002651015,0.985873,0.002106094,0.0008548244,0.00001534452,0.00007486575,0.00005852602,0.009723125],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9817324,"threshold_uncertainty_score":0.9979739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4288860568","doi":"10.1007/978-3-030-32248-9","title":"Medical Image Computing and Computer Assisted Intervention – MICCAI 2019","year":2019,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":540,"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":"Computer science; Intervention (counseling); Medical imaging; Multimedia; Data science; Medical physics; Human–computer interaction; Artificial intelligence; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.00762688133724588,"gpt":0.2962035355455158,"spread":0.2885766542082699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00197853,0.000439263,0.0008708394,0.0006442023,0.0001469531,0.0002632003,0.0006771563,0.0004418535,0.00008116783],"category_scores_gemma":[0.0004828759,0.0003694035,0.0001821354,0.000399082,0.001129688,0.0001571324,0.0009136457,0.002220038,0.00004794839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003418039,"about_ca_system_score_gemma":0.0008546401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005003502,"about_ca_topic_score_gemma":0.000009393189,"domain_scores_codex":[0.9961548,0.0001038746,0.0006620598,0.001171429,0.001299087,0.0006087563],"domain_scores_gemma":[0.9978811,0.0006766481,0.0002902423,0.0005761737,0.0001865358,0.0003893534],"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.00002321242,0.00009525676,0.001553543,0.0004719191,0.00004055993,0.0003395456,0.0003190046,0.0005758296,0.0001558232,0.00006778177,0.002424519,0.993933],"study_design_scores_gemma":[0.001737857,0.0003428956,0.007357907,0.004323348,0.0000515188,0.001221329,3.681021e-7,0.9803883,0.0000530815,0.0008850679,0.003207456,0.0004308713],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005746935,0.000794697,0.9866669,0.00256737,0.002521816,0.0004642176,0.000003260215,0.0001100043,0.001124833],"genre_scores_gemma":[0.1973457,0.000266468,0.7694582,0.01984345,0.007368558,0.000007788326,0.0003320354,0.0002484159,0.005129466],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9935021,"threshold_uncertainty_score":0.9998758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1569729202","doi":"10.1007/3-540-45571-x_47","title":"Mining Access Patterns Efficiently from Web Logs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":498,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Web mining; Data mining; Web mapping; Tree (set theory); Web modeling; World Wide Web; Information retrieval; Web service","retraction":null,"screen_n_in":null,"score":{"opus":0.02328515983586727,"gpt":0.2684583184193423,"spread":0.245173158583475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004304225,0.0005542263,0.0005072799,0.0006521121,0.0003464683,0.00177496,0.007815873,0.0002854928,0.0001221278],"category_scores_gemma":[0.00003156486,0.0005229894,0.0001231936,0.0006917982,0.0004269246,0.0009225883,0.002349698,0.0006686245,0.0001512889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001743371,"about_ca_system_score_gemma":0.0005303473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001507985,"about_ca_topic_score_gemma":0.0001479181,"domain_scores_codex":[0.9956039,0.0000249643,0.0005580064,0.002142385,0.0009535808,0.0007172059],"domain_scores_gemma":[0.9966633,0.0005047552,0.0002857361,0.002196446,0.0001236142,0.0002261528],"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.000001610254,0.00003341461,0.0001128113,0.000007795138,0.000009079245,0.00005302524,0.0004110838,0.005895467,0.00003202228,0.002396271,0.00008806815,0.9909593],"study_design_scores_gemma":[0.0002874118,0.00007819184,0.0005349938,0.0004991368,0.00001265445,0.00003167989,2.35305e-7,0.9463339,0.000475535,0.04012298,0.01074307,0.000880179],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001120257,0.0002222628,0.9920714,0.0006925585,0.001181615,0.0002894599,0.0001265147,0.0002507564,0.004045193],"genre_scores_gemma":[0.1263205,0.0001818189,0.8679193,0.003550573,0.001267127,0.00004140652,0.0001387948,0.00008310095,0.0004974282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9900792,"threshold_uncertainty_score":0.9997222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3109991383","doi":"10.1007/978-3-030-58536-5_36","title":"V2VNet: Vehicle-to-Vehicle Communication for Joint Perception and Prediction","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":449,"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":"Computer science; Viewpoints; Perception; Artificial intelligence; Bandwidth (computing); Joint (building); Feature (linguistics); Computer vision; Range (aeronautics); Real-time computing; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03757137983663022,"gpt":0.2797818468397802,"spread":0.24221046700315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001334681,0.000310116,0.0003810195,0.0003719519,0.0003261643,0.000455119,0.001327341,0.0002150112,0.000003646775],"category_scores_gemma":[0.0001585287,0.0003036453,0.00008474098,0.0003822255,0.0002603733,0.000504288,0.0008317792,0.000465117,0.00001654306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688403,"about_ca_system_score_gemma":0.0001520465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000170983,"about_ca_topic_score_gemma":0.00004600069,"domain_scores_codex":[0.9975603,0.00007216194,0.0004126235,0.001126008,0.0004790527,0.0003498482],"domain_scores_gemma":[0.9980151,0.0004133444,0.0001789003,0.0009926973,0.0002218678,0.0001780873],"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.00001125253,0.0000127949,0.0002456715,0.00004968681,0.000007588989,0.000003329414,0.001363811,0.006183483,0.001879103,0.005329166,0.00003804236,0.9848761],"study_design_scores_gemma":[0.000356425,0.000380366,0.008784026,0.0002948899,0.000008380564,0.00001936954,5.233405e-7,0.8699014,0.0006515146,0.1170536,0.002115377,0.0004341925],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005648541,0.0002277497,0.9931122,0.004254713,0.0005989858,0.0006260231,0.00001161818,0.0001883939,0.000415438],"genre_scores_gemma":[0.2981871,0.00007655157,0.6989749,0.002333331,0.0003132256,0.00002652683,0.0000113531,0.0000267707,0.00005023821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9844419,"threshold_uncertainty_score":0.9999416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W198033559","doi":"10.1007/978-3-642-29011-4_29","title":"Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":442,"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":"Computer science; Homomorphic encryption; Secure multi-party computation; Theoretical computer science; Computation; Encryption; Plaintext; Universal composability; Public-key cryptography; Cryptography; Computer security; Algorithm; Cryptographic protocol","retraction":null,"screen_n_in":null,"score":{"opus":0.01550720551093689,"gpt":0.2565546351823031,"spread":0.2410474296713662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007995254,0.0004854196,0.0004280597,0.000726583,0.00046115,0.0006790987,0.001367634,0.000251217,0.000007892635],"category_scores_gemma":[0.00002108074,0.0004269549,0.00007100491,0.0006282575,0.0008483222,0.002098987,0.0009574237,0.0008450398,0.00001743489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155497,"about_ca_system_score_gemma":0.000142784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005767504,"about_ca_topic_score_gemma":0.0002441547,"domain_scores_codex":[0.9971299,0.00006589187,0.0005006945,0.001088285,0.0007378582,0.0004773805],"domain_scores_gemma":[0.9974616,0.000519558,0.0004452437,0.001020161,0.0003533497,0.0002001147],"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.00003244838,0.0001181983,0.0007128031,0.00009227944,0.00002942459,0.00001384881,0.00277218,0.04828728,0.00008262751,0.02114126,0.00004127438,0.9266764],"study_design_scores_gemma":[0.0005237772,0.0001739975,0.00147172,0.0004529346,0.00001908945,0.0001510125,0.000001075981,0.8790655,0.0003673285,0.1167221,0.0003729731,0.0006785234],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001060429,0.0008814486,0.9958289,0.0004031757,0.0005571748,0.0004886357,0.000008956039,0.0001820081,0.0005892654],"genre_scores_gemma":[0.6230999,0.00009380776,0.3761757,0.0004166366,0.0001174055,0.000008622464,0.00006387303,0.00002059179,0.000003462413],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9259979,"threshold_uncertainty_score":0.9998182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1548953334","doi":"10.1007/978-3-642-15555-0_16","title":"Superpixels and Supervoxels in an Energy Optimization Framework","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":441,"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":"Computer science; Artificial intelligence; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01308034700212096,"gpt":0.2652442031675602,"spread":0.2521638561654392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008088847,0.0004089474,0.0004273427,0.0009710492,0.0001445505,0.0006759373,0.002266108,0.0006144427,0.00007415045],"category_scores_gemma":[0.0001847602,0.0003901528,0.00004526399,0.0005724954,0.0008481796,0.001418379,0.0009142905,0.001092056,0.00000361712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001312585,"about_ca_system_score_gemma":0.0002965555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005100244,"about_ca_topic_score_gemma":0.0001562974,"domain_scores_codex":[0.9966908,0.00006224747,0.0005190614,0.001411336,0.0008247111,0.0004918247],"domain_scores_gemma":[0.9978213,0.000440465,0.0001473083,0.001144398,0.0001810845,0.0002654159],"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.000003393069,0.00004514043,0.0001407535,0.00002246354,0.000002906814,0.00007883397,0.001199478,0.01075482,0.001164845,0.02253675,0.000003913346,0.9640467],"study_design_scores_gemma":[0.0002172707,0.0002162031,0.00009730757,0.0003973456,0.000003685109,0.00005190212,2.983754e-7,0.7273284,0.01509253,0.255758,0.0001458768,0.0006912214],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009298047,0.0001866479,0.9977176,0.0004935109,0.000720214,0.0002374357,0.000002275093,0.000204896,0.0003444299],"genre_scores_gemma":[0.01726885,0.0001365927,0.9793549,0.002912283,0.0002230591,0.00001507692,0.000008720991,0.00002835888,0.00005219815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9633555,"threshold_uncertainty_score":0.999855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113717903","doi":"10.1007/978-3-642-55220-5_30","title":"Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":432,"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":"Ciphertext; Homomorphic encryption; Learning with errors; Plaintext; Key (lock); Encryption; Attribute-based encryption; Computer science; Public-key cryptography; Construct (python library); Arithmetic; Theoretical computer science; Key size; Multilinear map; Electronic circuit; Cryptography; Algorithm; Mathematics; Computer security; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01741008001241027,"gpt":0.2243699274008831,"spread":0.2069598473884728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001591973,0.0008319169,0.0009189607,0.001328429,0.0005178566,0.001305036,0.003779342,0.0004912694,0.00005288902],"category_scores_gemma":[0.0001407171,0.0008012194,0.0002057099,0.0008540499,0.001476148,0.0007797981,0.001110145,0.00123697,0.00008464386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710021,"about_ca_system_score_gemma":0.0004507362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004956258,"about_ca_topic_score_gemma":0.0001061147,"domain_scores_codex":[0.9944269,0.00009915339,0.0007612716,0.002373772,0.001338727,0.001000184],"domain_scores_gemma":[0.995782,0.000746549,0.0004365084,0.002224071,0.0003511258,0.0004597457],"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.000007864104,0.00008146986,0.0004971866,0.0001923929,0.00004397971,0.0001670525,0.001742781,0.001572584,0.0005188463,0.4989526,0.0001607812,0.4960625],"study_design_scores_gemma":[0.0009669872,0.0004863787,0.003708707,0.0008983632,0.00003842736,0.0005601907,3.842176e-7,0.1557481,0.0004613823,0.8266754,0.008546595,0.001909136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000385217,0.0009114771,0.9925705,0.0005664549,0.001240228,0.0005023618,0.00002192013,0.000388703,0.003413169],"genre_scores_gemma":[0.9142931,0.0002263614,0.08153857,0.002947111,0.0008014389,0.00001173041,0.0000274609,0.0000872265,0.00006698992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9139079,"threshold_uncertainty_score":0.9997317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1536098516","doi":"10.1007/3-540-36579-6_12","title":"Scaling Java Points-to Analysis Using Spark","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":430,"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":"SPARK (programming language); Computer science; Java; Modular design; Implementation; Scala; Graph; Scaling; Theoretical computer science; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03014260705133876,"gpt":0.2649328401996686,"spread":0.2347902331483298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001744777,0.0006217601,0.000896553,0.001990235,0.0003844564,0.001100853,0.003355919,0.0003601987,0.00002719333],"category_scores_gemma":[0.0001453771,0.0005545649,0.0003432955,0.002903091,0.0003492665,0.000456344,0.001110136,0.0006069553,0.00009575773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004338988,"about_ca_system_score_gemma":0.0003602218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001117904,"about_ca_topic_score_gemma":0.0001201956,"domain_scores_codex":[0.9949007,0.00007976334,0.0007142611,0.00207371,0.001264548,0.000967031],"domain_scores_gemma":[0.9967799,0.0002914699,0.0003703411,0.001867408,0.0003329272,0.0003579578],"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.000007317416,0.00007194019,0.0009187893,0.0000857287,0.0002761165,0.0003235148,0.002725834,0.2650454,0.0001831139,0.1809361,0.00006157113,0.5493646],"study_design_scores_gemma":[0.000265599,0.0001652009,0.0001071975,0.0001126206,0.0001450607,0.0001337146,6.799011e-7,0.7984814,0.000875486,0.1864893,0.01164396,0.001579776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009767619,0.0004016214,0.9925731,0.0003342584,0.002278323,0.0004250502,0.00000133379,0.0001669372,0.00372166],"genre_scores_gemma":[0.3408728,0.00001186076,0.6550238,0.003024228,0.0005521364,0.000007402212,0.000003950441,0.00004642027,0.0004573687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5477848,"threshold_uncertainty_score":0.9999361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1570173564","doi":"10.1007/978-3-540-28630-1_17","title":"Staged Configuration Using Feature Models","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":427,"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":"Cardinality (data modeling); Computer science; Feature (linguistics); Notation; Feature model; Semantics (computer science); Product (mathematics); Process (computing); Theoretical computer science; Artificial intelligence; Programming language; Data mining; Mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05681029222051876,"gpt":0.290329064332653,"spread":0.2335187721121342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000876577,0.0005859798,0.0005617706,0.0007386327,0.0002430271,0.0004236084,0.002642509,0.0004597844,0.000006935385],"category_scores_gemma":[0.0002492555,0.0005617943,0.0001177792,0.0005822462,0.0004627196,0.001360875,0.0008410849,0.001152946,0.000008910391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008022952,"about_ca_system_score_gemma":0.0007926816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001197534,"about_ca_topic_score_gemma":0.000006931901,"domain_scores_codex":[0.9965683,0.00004831845,0.0003899248,0.001452825,0.000881381,0.0006592235],"domain_scores_gemma":[0.9972392,0.0006902041,0.0002703173,0.001400663,0.0002630272,0.0001365598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002128941,0.000005033275,7.491968e-7,0.00002450592,0.000005166759,0.00005452609,0.0004363431,0.858299,0.0004030143,0.04474768,0.000001652679,0.09602024],"study_design_scores_gemma":[0.0001475242,0.00004985859,0.000005853082,0.0002557104,0.000004215139,0.00004271984,1.051072e-7,0.4416412,0.002819938,0.5545192,0.00004518731,0.0004684457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002809245,0.0005557704,0.9957248,0.0002832769,0.001986394,0.0003618797,0.000004310571,0.0005408797,0.0005146185],"genre_scores_gemma":[0.02116117,0.00003130857,0.9779227,0.0004011006,0.0002581895,0.000004549072,0.000003842983,0.00004215527,0.0001749955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5097715,"threshold_uncertainty_score":0.9996834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589846406","doi":"10.1007/978-3-662-45472-5_31","title":"Mixcoin: Anonymity for Bitcoin with Accountable Mixes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":416,"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":"Anonymity; Computer science; Cryptocurrency; Computer security; Scheme (mathematics); Property (philosophy); Protocol (science); Incentive; Payment; World Wide Web; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.01234825725930602,"gpt":0.2277676437124877,"spread":0.2154193864531816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001362359,0.0006437026,0.0008101962,0.0006772365,0.0003524639,0.0009232367,0.003563445,0.0003255768,0.00002450244],"category_scores_gemma":[0.00008116292,0.0004980963,0.0002404283,0.0005327492,0.0005281221,0.0004949569,0.000708566,0.0006426349,0.00003564754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002230901,"about_ca_system_score_gemma":0.0004754134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004031159,"about_ca_topic_score_gemma":0.0006766471,"domain_scores_codex":[0.9956598,0.00003276522,0.0005819869,0.001858003,0.0009855528,0.000881914],"domain_scores_gemma":[0.997273,0.0006960534,0.0004143024,0.0009895788,0.0004568266,0.0001702793],"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.00003511217,0.00006184275,0.00007950066,0.0001552929,0.00009199131,0.00007779378,0.001022927,0.09948075,0.00006436949,0.4450458,0.0004379949,0.4534467],"study_design_scores_gemma":[0.000383873,0.0003375865,0.0000181197,0.0003902682,0.00002591386,0.0000630328,2.761074e-7,0.9814072,0.0005288693,0.005642486,0.01043669,0.0007656651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002188056,0.0001975859,0.9957353,0.0005438284,0.0009727692,0.0004623665,0.000005788192,0.0001651993,0.00169838],"genre_scores_gemma":[0.5215427,0.000009176454,0.4747147,0.001996653,0.0005280378,0.00001863856,0.000009617864,0.00004616566,0.001134316],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8819265,"threshold_uncertainty_score":0.999747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527113450","doi":"10.1007/b136266","title":"Computational Science and Its Applications – ICCSA 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":394,"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":"Computer science; Computational science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05567509002823586,"gpt":0.3527477389872752,"spread":0.2970726489590394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.01521055,0.0004284639,0.0005051605,0.002979648,0.00121299,0.003115332,0.006141687,0.0001541931,0.000102845],"category_scores_gemma":[0.002745886,0.0003549141,0.00007930264,0.005170301,0.003036813,0.001066445,0.003691214,0.000571127,0.0004744316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007322654,"about_ca_system_score_gemma":0.00341411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006250115,"about_ca_topic_score_gemma":0.00005584786,"domain_scores_codex":[0.9880105,0.00007479484,0.0009993091,0.003408439,0.006555441,0.0009515148],"domain_scores_gemma":[0.9928994,0.002730391,0.0004808559,0.001922319,0.001555634,0.0004114197],"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.000002580264,0.0000426368,0.00003461459,0.0000106002,0.000003313103,0.000006602525,0.0002193616,0.1583534,0.00002153808,0.00487271,0.004497381,0.8319352],"study_design_scores_gemma":[0.000170315,0.00002954767,0.000484041,0.00007273084,0.000007053318,0.00003399382,0.000001184631,0.7484295,0.00004714791,0.09910429,0.1512152,0.0004049245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002685393,0.0007229735,0.9863691,0.001895695,0.001517705,0.0007355591,0.0000467607,0.0001029745,0.008340739],"genre_scores_gemma":[0.2959874,0.0001110255,0.6539756,0.009554438,0.004793376,0.0001438286,0.000112826,0.0001075913,0.03521393],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8315303,"threshold_uncertainty_score":0.9998903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1611084195","doi":"10.1007/978-3-540-31987-0_3","title":"The ASTREÉ Analyzer","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":392,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Computer science; Correctness; Programming language; Abstract interpretation; Spectrum analyzer; Software; Computation; Interpretation (philosophy); Memory safety; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02170910406121952,"gpt":0.2778863502023117,"spread":0.2561772461410922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002118374,0.0004294483,0.0003325042,0.0004658281,0.0005627992,0.0009085581,0.005991729,0.0002637662,0.00001725994],"category_scores_gemma":[0.0002115775,0.0003083553,0.0001361201,0.0007063766,0.001006748,0.000735786,0.001337664,0.0008999537,0.000134927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003527882,"about_ca_system_score_gemma":0.0004357259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007494677,"about_ca_topic_score_gemma":0.00005478779,"domain_scores_codex":[0.9963566,0.00006604697,0.0005512753,0.001226811,0.001112367,0.0006869154],"domain_scores_gemma":[0.9963131,0.0005935624,0.0003428851,0.002359983,0.0002486473,0.0001418394],"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.000001939082,0.000006467779,0.000009969367,0.000004242532,0.000005077837,0.000007422012,0.0001595332,0.005541658,0.00001952085,0.1172775,0.00003171916,0.8769349],"study_design_scores_gemma":[0.0001306784,0.00009873121,0.0002458997,0.0001207005,0.000006756848,0.00006094652,1.037345e-7,0.7784787,0.001203026,0.1566699,0.06240315,0.0005814215],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001044008,0.0006916474,0.9840439,0.00134867,0.002213926,0.0002744714,0.00000161361,0.0001568073,0.0112585],"genre_scores_gemma":[0.006581463,0.0001237531,0.9901561,0.0009903105,0.0007270952,0.00001069536,0.0000015024,0.00002630843,0.001382756],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8763535,"threshold_uncertainty_score":0.9999369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W16016350","doi":"10.1007/978-3-642-23783-6_41","title":"Higher Order Contractive Auto-Encoder","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":380,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Hessian matrix; Jacobian matrix and determinant; Initialization; Computer science; Robustness (evolution); Manifold (fluid mechanics); Encoder; Norm (philosophy); Autoencoder; Artificial intelligence; Regularization (linguistics); Feature vector; Algorithm; Mathematical optimization; Mathematics; Applied mathematics; Deep learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02043062593792137,"gpt":0.2310940455076262,"spread":0.2106634195697049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006492536,0.0006710961,0.0006695049,0.0005279063,0.0003140052,0.0005473844,0.003114199,0.0004131896,0.000312955],"category_scores_gemma":[0.00008306091,0.0005711089,0.0001415309,0.0006161036,0.0008800077,0.001115461,0.001201955,0.0008750449,0.0001800668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002365949,"about_ca_system_score_gemma":0.0006023414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005716191,"about_ca_topic_score_gemma":0.00005863166,"domain_scores_codex":[0.9959888,0.00006745187,0.0005047468,0.001797004,0.0008207951,0.0008211726],"domain_scores_gemma":[0.9969807,0.0004479724,0.0003410828,0.001459221,0.0005495758,0.0002214555],"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.00001390743,0.00006488459,0.00001987636,0.00001547166,0.00005216459,0.0001647147,0.0009096684,0.02500652,0.0004319724,0.05194803,0.0003584925,0.9210143],"study_design_scores_gemma":[0.0006649357,0.0003859228,0.0004619447,0.0003612487,0.00003816434,0.00005811987,1.783428e-7,0.4998429,0.007112789,0.4497325,0.03935193,0.001989397],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002838145,0.0004640105,0.9623535,0.0008604963,0.00373529,0.000374152,0.000004664941,0.0001567626,0.0320483],"genre_scores_gemma":[0.1633908,0.00009215403,0.8250732,0.00396862,0.001676796,0.00002226597,0.000005014555,0.00007998462,0.005691066],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9190249,"threshold_uncertainty_score":0.999674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963830382","doi":"10.1007/978-3-030-01225-0_4","title":"Local Spectral Graph Convolution for Point Set Feature Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":380,"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":"Pooling; Computer science; Graph; Spectral clustering; Artificial intelligence; Pattern recognition (psychology); Feature (linguistics); Point cloud; Cluster analysis; Convolution (computer science); Segmentation; Theoretical computer science; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.01196481781771614,"gpt":0.2211784362470469,"spread":0.2092136184293308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003484053,0.0003299015,0.0003496834,0.0004483444,0.0001659278,0.0001221967,0.0004270886,0.0003028972,0.00003569551],"category_scores_gemma":[0.00002702066,0.00030879,0.0001811523,0.000226093,0.0003505004,0.0001089966,0.00007830426,0.0006876843,0.00002255929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001993994,"about_ca_system_score_gemma":0.00006206836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006455589,"about_ca_topic_score_gemma":0.0000630342,"domain_scores_codex":[0.9984562,0.000008247668,0.0002183644,0.000569037,0.0003113851,0.0004367591],"domain_scores_gemma":[0.9993302,0.0001062537,0.00005945804,0.0002951435,0.0001222909,0.0000866308],"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.000003786743,0.000002139476,0.000007057655,0.00004386948,0.00002111403,0.000005101259,0.0003076692,0.9420168,0.0000886277,0.0001382405,0.0001788533,0.05718677],"study_design_scores_gemma":[0.000126884,0.0000834076,0.000004868456,0.0001924088,0.00002579565,0.00001340648,6.23584e-7,0.962288,0.0007499293,0.03528225,0.0008796976,0.0003527905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004706195,0.0005015322,0.9971953,0.0001500129,0.0007188238,0.0001455255,0.00001013997,0.0002213968,0.0005866623],"genre_scores_gemma":[0.9111193,0.00007065925,0.08683473,0.0002044628,0.001052828,0.000007254478,0.00005327991,0.00007276013,0.0005846951],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9106487,"threshold_uncertainty_score":0.9999364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W167928972","doi":"10.1007/978-3-642-28914-9_24","title":"How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":353,"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":"Verifiable secret sharing; Delegate; Computer science; Delegation; Theoretical computer science; Encryption; Computation; Cryptography; Scheme (mathematics); Function (biology); Cryptographic primitive; Algorithm; Computer security; Mathematics; Programming language; Cryptographic protocol; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.02531275578391829,"gpt":0.2365524085154586,"spread":0.2112396527315404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008913164,0.0004840298,0.0004955842,0.001252452,0.0002159881,0.001597384,0.001721762,0.0003633902,0.000009822636],"category_scores_gemma":[0.0001033626,0.0004869559,0.00008190979,0.001171772,0.0003557468,0.001956424,0.0009758844,0.0006994383,0.00001851537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00024302,"about_ca_system_score_gemma":0.0003186471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001832308,"about_ca_topic_score_gemma":0.0004469209,"domain_scores_codex":[0.9964505,0.00006740964,0.0004045069,0.001502085,0.0008080731,0.0007674673],"domain_scores_gemma":[0.9978245,0.0004531195,0.0002137452,0.0009600373,0.0001990026,0.0003495702],"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.00003246436,0.0001350234,0.002219638,0.00007502569,0.0000199565,0.00006725722,0.001379781,0.01231404,0.0007914454,0.06338356,0.00008719906,0.9194946],"study_design_scores_gemma":[0.001260542,0.0003740173,0.008705291,0.0005686536,0.0000187669,0.00002193105,0.000001017414,0.7592837,0.002238655,0.2116736,0.01409451,0.001759303],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002471962,0.0007547989,0.9929224,0.002083884,0.0009925551,0.0004582785,0.00006422357,0.0001273147,0.000124615],"genre_scores_gemma":[0.5945928,0.00003429158,0.403973,0.00105334,0.0002255107,0.00001313745,0.00008588577,0.00001832271,0.000003745102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9177353,"threshold_uncertainty_score":0.9997582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2476332689","doi":"10.1007/b105222","title":"Topics in Cryptology – CT-RSA 2005","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":349,"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":"Cryptography; Computer science; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01168510026693092,"gpt":0.2506889156898459,"spread":0.2390038154229149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001286503,0.0006193125,0.0007178288,0.001613566,0.0001563693,0.0004634126,0.004687695,0.0003302574,0.00005869044],"category_scores_gemma":[0.0001864098,0.0006197913,0.0001448872,0.001620636,0.000727869,0.00105237,0.001476715,0.001482566,0.0001652144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001647783,"about_ca_system_score_gemma":0.002316158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000575587,"about_ca_topic_score_gemma":0.000753482,"domain_scores_codex":[0.9947965,0.0001426276,0.0007758829,0.001959149,0.001064854,0.00126104],"domain_scores_gemma":[0.9970666,0.000567987,0.0003159735,0.001657599,0.000166412,0.0002254327],"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.00000772461,0.0001156617,0.0001784136,0.00005525484,0.000006884382,0.0005320926,0.0006154322,0.08013306,0.0002208457,0.008121897,0.00131035,0.9087024],"study_design_scores_gemma":[0.0008909148,0.0002107773,0.0008379496,0.0004634267,0.000007975411,0.0003672339,1.893142e-7,0.8253153,0.002134918,0.1207204,0.04774898,0.001301967],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002177349,0.0007267636,0.9890569,0.003624312,0.002335979,0.00044246,0.000003511389,0.0002008882,0.003391495],"genre_scores_gemma":[0.0157806,0.0001271584,0.9704473,0.008133126,0.002832802,0.00004195406,0.00002104668,0.00006693434,0.002549068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9074004,"threshold_uncertainty_score":0.9996253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152337449","doi":"10.1007/978-3-540-74835-9_24","title":"Graphical Password Authentication Using Cued Click Points","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":340,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cued speech; Password; Point (geometry); Usability; Image (mathematics); Authentication (law); Workload; Computer vision; Computer security; Artificial intelligence; Human–computer interaction; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04030825148284347,"gpt":0.2915846542011033,"spread":0.2512764027182599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001794819,0.0005030138,0.0005275398,0.001450903,0.0003129099,0.0006821646,0.003287903,0.0004665896,0.00002663754],"category_scores_gemma":[0.0001053506,0.0004822334,0.0001965904,0.001095815,0.000659933,0.0006084954,0.0008843314,0.000809818,0.0001110381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003222094,"about_ca_system_score_gemma":0.0004009628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003290884,"about_ca_topic_score_gemma":0.00009245168,"domain_scores_codex":[0.9953266,0.00007046697,0.0008491129,0.001592289,0.001419052,0.0007424545],"domain_scores_gemma":[0.9967501,0.0003479114,0.0004235796,0.001826928,0.0003657212,0.0002857989],"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.00002228075,0.0002681966,0.0009558336,0.0002000927,0.00007361551,0.0001836637,0.02816252,0.0008134737,0.001449532,0.4043028,0.00005215112,0.5635158],"study_design_scores_gemma":[0.0002553247,0.00006267791,0.0004777322,0.0003144258,0.00001350631,0.0000946544,3.102307e-7,0.8246058,0.0004739011,0.1711201,0.001938929,0.0006427163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009955224,0.0001743455,0.9939669,0.0009884008,0.002193306,0.0004722162,0.000002974985,0.0002196573,0.0009866981],"genre_scores_gemma":[0.7903652,0.00001969789,0.2069443,0.001753931,0.000564447,0.000006637418,0.000009464844,0.00004984081,0.0002864246],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8237923,"threshold_uncertainty_score":0.999763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505973206","doi":"10.1007/3-540-36492-7_17","title":"White-Box Cryptography and an AES Implementation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Crosslight Software (Canada)","funders":"","keywords":"Computer science; AES implementations; Cryptography; White box; Implementation; Encryption; Key (lock); Software implementation; Table (database); Software; Advanced Encryption Standard; Theoretical computer science; Computer security; Programming language; Database; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0171529933463793,"gpt":0.2942482527862945,"spread":0.2770952594399152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008285894,0.0004542075,0.0003663838,0.001342838,0.0004465018,0.0009227064,0.001385152,0.0001778401,0.00008046657],"category_scores_gemma":[0.00001107366,0.0004412418,0.000104257,0.000899492,0.0005601377,0.001104424,0.0005039055,0.0004273235,0.000004050126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008161012,"about_ca_system_score_gemma":0.0001967695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005020934,"about_ca_topic_score_gemma":0.0006527912,"domain_scores_codex":[0.996692,0.00005701088,0.0005189108,0.001391199,0.0007463421,0.0005945391],"domain_scores_gemma":[0.9981982,0.0001291639,0.0002449798,0.001002328,0.0002034442,0.0002218783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003237546,0.00004430327,0.003391542,0.000029842,0.00001774692,0.00002515916,0.003211246,0.0003786029,0.00006819038,0.2493157,0.00008053538,0.7434339],"study_design_scores_gemma":[0.00113046,0.0008101925,0.004863475,0.0001329167,0.00003141376,0.0001308663,0.00001065899,0.04178037,0.0008043358,0.9408982,0.007710702,0.001696452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001262892,0.0003179924,0.9955284,0.000673168,0.0007453296,0.0004405243,0.00001408773,0.0001101638,0.0009074273],"genre_scores_gemma":[0.1690785,0.0002024861,0.8271168,0.003223534,0.0002536812,0.00002551324,0.00003792578,0.00003975165,0.00002180013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7417374,"threshold_uncertainty_score":0.999804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1565539145","doi":"10.1007/978-3-642-04138-9_26","title":"The State-of-the-Art in IC Reverse Engineering","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":331,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Chipworks (Canada)","funders":"","keywords":"Schematic; Reverse engineering; Computer science; Encryption; Embedded system; Chip; Transistor; Semiconductor industry; Integrated circuit; Process (computing); Software; State (computer science); Computer hardware; Manufacturing engineering; Electrical engineering; Operating system; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.007553501657843944,"gpt":0.20242767453985,"spread":0.194874172882006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007113613,0.0003372516,0.0003575602,0.0003302623,0.0002340178,0.0002464868,0.003412569,0.0001214411,0.000003425573],"category_scores_gemma":[0.0001356286,0.0002262691,0.0001596808,0.001050077,0.0004018363,0.0003995608,0.001014233,0.0009467526,0.00002227461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002461093,"about_ca_system_score_gemma":0.0004070255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002691646,"about_ca_topic_score_gemma":0.00020028,"domain_scores_codex":[0.9974046,0.00003392834,0.0004420201,0.0007835561,0.0007824156,0.0005534381],"domain_scores_gemma":[0.9976529,0.0005153418,0.0001903774,0.001402223,0.0001486847,0.00009049737],"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.000007339555,0.00005225348,0.00002713786,0.00003499285,0.000009944246,0.00004094062,0.0006688624,0.1141156,0.0002141077,0.04240824,0.0001682628,0.8422523],"study_design_scores_gemma":[0.0003021931,0.0001665148,0.001020527,0.0006382983,0.000007345366,0.00003602404,1.281165e-7,0.5342563,0.002022619,0.4194335,0.04144254,0.0006740547],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002197302,0.0003098406,0.9944902,0.00121504,0.001831284,0.0003209898,0.00000332308,0.00006766203,0.00154193],"genre_scores_gemma":[0.7450351,0.00051382,0.2398872,0.005608648,0.001589095,0.00005287095,0.000008092509,0.0001307842,0.007174354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8415782,"threshold_uncertainty_score":0.9226987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502487903","doi":"10.1007/978-3-642-17572-5_48","title":"Threshold Models for Competitive Influence in Social Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":316,"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":"Computer science; Maximization; Competitor analysis; Greedy algorithm; Mathematical optimization; Cascade; Set (abstract data type); Square root; Extension (predicate logic); Conjecture; Product (mathematics); Mathematical economics; Algorithm; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01530642877649156,"gpt":0.2650131315491454,"spread":0.2497067027726538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004940854,0.0004281618,0.0006107463,0.0004364064,0.0002651991,0.0002110664,0.001131701,0.0002636797,0.00004714433],"category_scores_gemma":[0.000005596863,0.0004278721,0.0002136136,0.0003580242,0.0006700816,0.0002664824,0.0004879179,0.001201511,0.000002465876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001171461,"about_ca_system_score_gemma":0.0001921916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006524856,"about_ca_topic_score_gemma":0.0003284543,"domain_scores_codex":[0.997664,0.00001427701,0.0004616897,0.0009225124,0.0003576188,0.000579887],"domain_scores_gemma":[0.9986364,0.0003142839,0.0002535571,0.00047726,0.0002460481,0.00007243615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001496689,0.00004084781,0.0007766795,0.00001120399,0.00002383516,0.000004315611,0.0003351518,0.4907555,0.0000614468,0.374411,0.00002352745,0.1335415],"study_design_scores_gemma":[0.000133345,0.00002444437,0.00009134825,0.0001051138,0.00001005513,4.725557e-7,1.857337e-7,0.4752453,0.0001004227,0.5235688,0.0004162231,0.0003043168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004885605,0.0000622828,0.9910991,0.0001243883,0.0002143317,0.0005563539,0.00001789195,0.00005477476,0.007382324],"genre_scores_gemma":[0.9420043,0.000004208502,0.05596889,0.000323124,0.001494687,0.00005161789,0.00003483873,0.00004023205,0.00007808892],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9415157,"threshold_uncertainty_score":0.9998173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1536265389","doi":"10.1007/3-540-46423-9_2","title":"Optimizing Java Bytecode Using the Soot Framework: Is It Feasible?","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":313,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bytecode; Java bytecode; Computer science; Java; Programming language; Java annotation; Class (philosophy); Generics in Java; Program optimization; Java applet; Operating system; Compiler; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05289934935660727,"gpt":0.3031957885134227,"spread":0.2502964391568154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00128173,0.0007173932,0.0005900614,0.0007478898,0.0007985505,0.001353028,0.006140446,0.0005461646,0.00007436929],"category_scores_gemma":[0.000268002,0.0005573237,0.0002172527,0.0009954231,0.0009063488,0.0005604887,0.001808911,0.001712616,0.00004536924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003368097,"about_ca_system_score_gemma":0.0006746717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000898,"about_ca_topic_score_gemma":0.00001288505,"domain_scores_codex":[0.9952644,0.00006079028,0.0006299246,0.001813889,0.001232889,0.0009980998],"domain_scores_gemma":[0.9949201,0.001574353,0.0003616393,0.002741683,0.0002226227,0.0001796267],"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.000007423636,0.00003897763,0.0001187875,0.00004073413,0.00002489269,0.0001340492,0.004689309,0.06349618,0.00002923421,0.008647664,0.001194181,0.9215786],"study_design_scores_gemma":[0.00006533026,0.0000614891,0.0000107832,0.0009310442,0.00001010738,0.0001603907,9.893617e-8,0.4985569,0.0004522634,0.497696,0.001489595,0.0005659456],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003298611,0.0008121623,0.9894285,0.002632916,0.001101413,0.0003807457,0.000004392977,0.002415881,0.003190956],"genre_scores_gemma":[0.02900715,0.00008981725,0.9614568,0.008648426,0.0005217352,0.000008803256,0.000001241307,0.00005785926,0.0002081996],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9210126,"threshold_uncertainty_score":0.9996879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1491688952","doi":"10.1007/11851561_16","title":"A Unifying View of Genome Rearrangements","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":299,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Concatenation (mathematics); Genome; Computation; Algorithm; Theoretical computer science; Variety (cybernetics); Combinatorics; Mathematics; Genetics; Artificial intelligence; Biology; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.0145501442805102,"gpt":0.2404525168478769,"spread":0.2259023725673667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003702174,0.0003000397,0.0003188846,0.0002697286,0.00006132478,0.00003990441,0.0007674781,0.0002339886,0.00003026161],"category_scores_gemma":[0.00001790325,0.0002921013,0.0001072528,0.0001612069,0.0003737868,0.000005426084,0.000497707,0.0001950931,0.00001127331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006076464,"about_ca_system_score_gemma":0.0001608276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001889799,"about_ca_topic_score_gemma":0.00003358547,"domain_scores_codex":[0.9981253,0.00001597264,0.0003520056,0.0007370019,0.0004227388,0.0003469591],"domain_scores_gemma":[0.9989007,0.00001636472,0.0002023232,0.000672971,0.000148048,0.00005957341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004051348,0.0001240693,0.0006807428,0.0005104984,0.0001510616,0.00006546071,0.0003061162,0.04570771,0.3243908,0.0003176406,0.0001190151,0.6275864],"study_design_scores_gemma":[0.008014134,0.005770059,0.0105835,0.004357085,0.0004657147,0.0003529474,0.000003918735,0.03817474,0.2621462,0.06168123,0.5977661,0.01068438],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003495875,0.004377739,0.9801647,0.00006675951,0.000473626,0.0005065313,0.00002592597,0.0000165699,0.01087226],"genre_scores_gemma":[0.7652445,0.001360156,0.2235119,0.0009791068,0.00204115,0.00002881777,0.0004158653,0.0002024827,0.006215971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7617487,"threshold_uncertainty_score":0.9999531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3022604549","doi":"10.1007/978-3-030-47358-7_52","title":"A Scheme for Generating a Dataset for Anomalous Activity Detection in IoT Networks","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":298,"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":"","keywords":"Computer science; Botnet; Internet of Things; Intrusion detection system; Scheme (mathematics); Data mining; Set (abstract data type); The Internet; Artificial intelligence; Computer security; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02273888662673615,"gpt":0.252053421875638,"spread":0.2293145352489018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009079386,0.0004364084,0.0004934879,0.0004797313,0.000407929,0.0004923745,0.001545805,0.000408766,0.00000372894],"category_scores_gemma":[0.0001214735,0.0004516076,0.0001378329,0.0006850735,0.0001847551,0.0005280313,0.0005643229,0.0007816066,0.000003185846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003046369,"about_ca_system_score_gemma":0.0002413778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003249691,"about_ca_topic_score_gemma":0.0005804409,"domain_scores_codex":[0.9968443,0.00004101499,0.000462345,0.001619759,0.00040775,0.0006248661],"domain_scores_gemma":[0.9980826,0.0005961643,0.0003165842,0.0007221652,0.0001434452,0.0001390079],"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.00006023818,0.00002766754,0.000003185932,0.0000646086,0.000008666363,0.00001176279,0.0001778798,0.1042101,0.001422344,0.001052017,0.0001163215,0.8928452],"study_design_scores_gemma":[0.000448518,0.0004604785,0.000009135719,0.0001404212,0.000005803417,0.00002204015,7.84188e-8,0.9759176,0.003372225,0.01374704,0.005403216,0.0004733839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002998055,0.0002089773,0.9955699,0.0005367824,0.001984145,0.001214643,0.00005996633,0.0001021421,0.00002363488],"genre_scores_gemma":[0.2551586,0.00002782992,0.7381494,0.003217773,0.003072382,0.0001890957,0.0001032734,0.00006000658,0.0000216411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8923718,"threshold_uncertainty_score":0.9997936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1572330878","doi":"10.1007/3-540-47721-7_17","title":"All-or-Nothing Disclosure of Secrets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Nothing; Internet privacy; Computer science; Business; Philosophy; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03114779796906828,"gpt":0.278129350780815,"spread":0.2469815528117467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001431177,0.0005397909,0.0006418957,0.001169192,0.0001745878,0.000335302,0.004561328,0.0004371186,0.00004746498],"category_scores_gemma":[0.0001028851,0.0004381865,0.0002248467,0.001020542,0.0009471883,0.0008962069,0.001910354,0.0009931352,0.0000132817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001105274,"about_ca_system_score_gemma":0.0004713712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005990191,"about_ca_topic_score_gemma":0.0002413747,"domain_scores_codex":[0.9956692,0.00002968923,0.000718498,0.001487093,0.001356904,0.00073862],"domain_scores_gemma":[0.9965011,0.0006729626,0.0004321167,0.001950254,0.0002210532,0.000222455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004465688,0.00009133138,0.0002425549,0.0001856168,0.00004671351,0.0003679652,0.005400093,0.002622814,0.0002212807,0.2658643,0.00006352957,0.7248491],"study_design_scores_gemma":[0.001153666,0.0008210882,0.001172432,0.002095128,0.00005332122,0.0003929435,0.000001565787,0.2054495,0.006777337,0.7438471,0.0353737,0.002862239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001445402,0.0005155143,0.993318,0.0003935488,0.001342593,0.0002787478,0.00002449732,0.0001368948,0.003845648],"genre_scores_gemma":[0.1230828,0.0001426352,0.8731321,0.002932617,0.0005755098,0.000004127451,0.00002268028,0.00004570713,0.00006184343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7219868,"threshold_uncertainty_score":0.999807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2496364950","doi":"10.1007/b98048","title":"Computational Science and Its Applications – ICCSA 2004","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":295,"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":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05407763662381332,"gpt":0.347890961164756,"spread":0.2938133245409427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.01236372,0.0004310186,0.0005061894,0.002859002,0.001255288,0.003120203,0.005995569,0.0001556579,0.00005165393],"category_scores_gemma":[0.003148356,0.0003565829,0.00008128124,0.006885955,0.00361544,0.0009464113,0.003401548,0.0005709041,0.0002787237],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00148141,"about_ca_system_score_gemma":0.008869852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001378998,"about_ca_topic_score_gemma":0.00003282947,"domain_scores_codex":[0.988079,0.00006165602,0.0009567149,0.003456083,0.0066075,0.0008391156],"domain_scores_gemma":[0.9932402,0.00214357,0.0004705099,0.001915395,0.001858086,0.0003722651],"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.00000308103,0.00005202854,0.00003954973,0.00002099264,0.000003941611,0.00001473289,0.0004448992,0.4448865,0.00002354994,0.009511872,0.001051741,0.5439471],"study_design_scores_gemma":[0.0002630275,0.00005384833,0.0004862967,0.000145534,0.000008121573,0.00004596213,0.000001471207,0.5471677,0.00007695797,0.4135988,0.03768663,0.0004657031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002568836,0.0006794239,0.98981,0.001128985,0.001737887,0.0007756208,0.00004367059,0.0001013415,0.005466213],"genre_scores_gemma":[0.5342914,0.00003931058,0.4412197,0.006295525,0.00210978,0.0001192524,0.0001005835,0.00009243411,0.01573196],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5485902,"threshold_uncertainty_score":0.9998886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W65414435","doi":"10.1007/978-3-642-32009-5_11","title":"Functional Encryption with Bounded Collusions via Multi-party Computation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":290,"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":"Computer science; Computation; Encryption; Bounded function; Functional encryption; Theoretical computer science; Distributed computing; Secure multi-party computation; Computer security; Algorithm; Mathematics; Ciphertext","retraction":null,"screen_n_in":null,"score":{"opus":0.02381885422453816,"gpt":0.2427579886217169,"spread":0.2189391343971787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007604302,0.0005452521,0.0004380267,0.000897448,0.000672276,0.0005456029,0.001512543,0.0003282374,0.00005735497],"category_scores_gemma":[0.00002776726,0.0004652621,0.0001358313,0.001007961,0.000872588,0.001499753,0.0009236453,0.0007998116,0.00008268577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002675203,"about_ca_system_score_gemma":0.0004952507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004046725,"about_ca_topic_score_gemma":0.0003185075,"domain_scores_codex":[0.9961891,0.00005278653,0.0004721469,0.001387446,0.001204655,0.0006938671],"domain_scores_gemma":[0.9976538,0.0003388942,0.0003428914,0.001023693,0.0003589368,0.0002817853],"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.00006508455,0.0003932683,0.0006278466,0.00008346847,0.00005844277,0.00007360024,0.001919822,0.03233071,0.0006393162,0.1547085,0.0001581892,0.8089417],"study_design_scores_gemma":[0.00121241,0.00037754,0.005597369,0.0003284307,0.00003707708,0.0002806975,4.954364e-7,0.7501364,0.0005547964,0.2372177,0.00286091,0.001396249],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001814096,0.0003793217,0.9962724,0.0003112456,0.001614719,0.0004896886,0.0000220571,0.0002382621,0.000490829],"genre_scores_gemma":[0.2040718,0.00003487324,0.7945085,0.0007487989,0.0004575629,0.00001748159,0.00009758119,0.00002960158,0.00003386629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8075455,"threshold_uncertainty_score":0.9997799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}