{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":94,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":94,"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":"3f3649e009bc","filters":{"venue":"Science of Computer Programming"}},"results":[{"id":"W2101832700","doi":"10.1016/j.scico.2009.02.007","title":"Comparison and evaluation of code clone detection techniques and tools: A qualitative approach","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":1002,"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":"Computer science; clone (Java method); Schema (genetic algorithms); Taxonomy (biology); Set (abstract data type); Source code; Context (archaeology); Data mining; Software engineering; Artificial intelligence; Programming language; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.09302423369983133,"gpt":0.4135048661088837,"spread":0.3204806324090523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004972385,0.00009790443,0.0002001876,0.0003392632,0.0001026397,0.0002337554,0.0004616484,0.00003727739,1.428887e-7],"category_scores_gemma":[0.0002609769,0.00009196169,0.00002038176,0.001056434,0.0004029382,0.001032707,0.0001999039,0.0001097819,1.157391e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004903035,"about_ca_system_score_gemma":0.00009469848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001275059,"about_ca_topic_score_gemma":6.857364e-7,"domain_scores_codex":[0.9980125,0.0001277662,0.000273592,0.000385245,0.0009648362,0.0002360292],"domain_scores_gemma":[0.9987363,0.0002577118,0.0001371256,0.0002713394,0.0005210676,0.00007647544],"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.000003270738,0.00005933625,0.0002674476,0.00002708434,0.000003255732,2.059415e-7,0.005686155,0.0002050135,0.005428057,0.001581539,0.000001177803,0.9867374],"study_design_scores_gemma":[0.0003366147,0.0009253997,0.01883152,0.00008600739,0.000009553592,0.00002774069,0.0004368784,0.8906057,0.08668336,0.001843371,0.00004134693,0.0001724339],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4190185,0.0001753012,0.5803558,0.0000333016,0.00003144916,0.000278983,2.22866e-7,0.00008225728,0.00002421618],"genre_scores_gemma":[0.5965331,0.000002459613,0.4034371,0.000002149898,0.00001225399,0.0000104739,2.596381e-7,0.000001795787,4.467144e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9865651,"threshold_uncertainty_score":0.3750089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128466029","doi":"10.1016/j.scico.2006.04.002","title":"The TXL source transformation language","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":358,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"University of Toronto","keywords":"Computer science; Rewriting; Programming language; Parsing; Functional programming; Context (archaeology)","retraction":null,"screen_n_in":null,"score":{"opus":0.00920624451607326,"gpt":0.2357112333274883,"spread":0.226504988811415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648056,0.000135844,0.0001471051,0.0001357674,0.0006523464,0.0008450183,0.001800987,0.00003891752,8.736106e-7],"category_scores_gemma":[0.00001459632,0.00008980274,0.00008929693,0.001134269,0.0005110795,0.0009013581,0.0002060339,0.0001055397,0.0000176748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892652,"about_ca_system_score_gemma":0.000146282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002372451,"about_ca_topic_score_gemma":0.00003158332,"domain_scores_codex":[0.9979745,0.00005402845,0.0003831666,0.0003379284,0.000706226,0.0005442181],"domain_scores_gemma":[0.9989299,0.00007891519,0.0001980073,0.0005418024,0.0001776579,0.00007378492],"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.000001083661,0.00003001933,0.0001307178,0.00001333738,0.000002554323,0.000001402359,0.00144801,0.0001744848,0.0005466165,0.3272022,0.00004594934,0.6704036],"study_design_scores_gemma":[0.001536342,0.0009675812,0.005981501,0.00005620133,0.00002538275,0.0002136674,0.00160948,0.5317492,0.04438754,0.04844864,0.363745,0.001279471],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01484155,0.0002765544,0.9809171,0.0003135802,0.0006539194,0.0003298302,1.009942e-7,0.000237765,0.002429578],"genre_scores_gemma":[0.9590313,0.000002084271,0.0406231,0.00002467803,0.0001710972,0.00001719777,0.000001074187,0.000005640585,0.0001238314],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9441897,"threshold_uncertainty_score":0.8148531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988680012","doi":"10.1016/j.scico.2005.10.008","title":"Modeling component connectors in Reo by constraint automata","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":307,"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; Automaton; Component (thermodynamics); Equivalence (formal languages); Constraint (computer-aided design); Cable gland; Theoretical computer science; Model checking; Programming language; Discrete mathematics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01884987414813196,"gpt":0.27851848124175,"spread":0.2596686070936181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381606,0.0001610219,0.000235124,0.0003708929,0.0001525104,0.0002832629,0.00179956,0.00005001948,0.000001222583],"category_scores_gemma":[0.00004237879,0.0001590007,0.00005153759,0.001523609,0.000571706,0.001138471,0.0004438938,0.0001519073,0.000004145785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001258055,"about_ca_system_score_gemma":0.0001641105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003035242,"about_ca_topic_score_gemma":0.000006924419,"domain_scores_codex":[0.9974989,0.00008863413,0.0005915411,0.0005949641,0.0006822462,0.0005436781],"domain_scores_gemma":[0.9988779,0.00005538526,0.0001741891,0.0006332677,0.0001705079,0.00008872696],"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.000005901423,0.0003864008,0.001128077,0.00005527677,0.000004578431,0.00000660684,0.0007394445,0.07051924,0.01799889,0.3753293,0.00005443497,0.5337719],"study_design_scores_gemma":[0.0002549192,0.00007806559,0.0007444192,0.00006216513,0.000001023279,0.00001181095,0.00002585842,0.9869015,0.009056765,0.002468707,0.0002122723,0.0001825062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2858575,0.00004402786,0.7131042,0.000099584,0.0003620699,0.0002185343,6.765274e-7,0.00014632,0.0001671026],"genre_scores_gemma":[0.5132179,9.278012e-7,0.4867338,0.00001440269,0.00001839849,0.000007925004,0.000001381267,0.00000353629,0.000001697116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9163823,"threshold_uncertainty_score":0.6483861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126063715","doi":"10.1016/s0167-6423(99)00036-2","title":"How do program understanding tools affect how programmers understand programs?","year":2000,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Computer science; Program comprehension; Programmer; Source code; Software engineering; Human–computer interaction; Usability; Affect (linguistics); Comprehension; Software; Programming language; Data science; Software system","retraction":null,"screen_n_in":null,"score":{"opus":0.06352619708920401,"gpt":0.2932363916898035,"spread":0.2297101946005995,"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.002309327,0.0005108548,0.0005321089,0.0007448519,0.0006158921,0.009081398,0.003805584,0.0001491022,0.00000843089],"category_scores_gemma":[0.0002413636,0.0004653678,0.0002575504,0.005695382,0.001753328,0.004245635,0.0006595064,0.0004942382,0.000009533173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005875749,"about_ca_system_score_gemma":0.000505735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001071746,"about_ca_topic_score_gemma":0.000003951662,"domain_scores_codex":[0.9934506,0.0001230593,0.0003896377,0.001501781,0.002436856,0.00209805],"domain_scores_gemma":[0.9969729,0.000434283,0.0002060505,0.001426816,0.0003487189,0.0006111841],"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.00000991486,0.0002874682,0.001541448,0.0001256579,0.00003656885,0.00003213087,0.0009524562,0.0001593518,0.0001544295,0.01188684,0.00006785162,0.9847459],"study_design_scores_gemma":[0.01295332,0.03118336,0.02203007,0.005232236,0.0002500078,0.001512889,0.009798383,0.7185751,0.02039443,0.02691758,0.1386307,0.01252193],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09251545,0.0002464749,0.8989275,0.002112806,0.0006633754,0.003116398,0.000001489122,0.002149038,0.0002675445],"genre_scores_gemma":[0.6463825,0.00001219981,0.353229,0.00001299056,0.0001056697,0.0001293919,0.000003150117,0.00003032982,0.0000947155],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9722239,"threshold_uncertainty_score":0.9997798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1763929460","doi":"10.1016/s0167-6423(02)00058-8","title":"A change impact model for changeability assessment in object-oriented software systems","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":110,"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":"Maintainability; Computer science; Software metric; Software maintenance; Change impact analysis; Software; Software system; Software quality; Object-oriented programming; Software sizing; Software development; Software engineering; Object-oriented design; Reliability engineering; Component-based software engineering; Systems engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.06438464849421065,"gpt":0.3370059452025773,"spread":0.2726212967083666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002263102,0.0002166171,0.0003387809,0.0006866503,0.0001575672,0.0003322795,0.001728573,0.00006472078,0.000002347881],"category_scores_gemma":[0.0003010254,0.0001953854,0.0001172713,0.002495725,0.0002460508,0.001290308,0.0006027496,0.000217798,0.00000314762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004456587,"about_ca_system_score_gemma":0.0002142368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001121161,"about_ca_topic_score_gemma":0.000006185101,"domain_scores_codex":[0.9967883,0.00004865179,0.0004065595,0.0007814076,0.0009960565,0.0009790823],"domain_scores_gemma":[0.9979566,0.0003940767,0.0001316269,0.000857077,0.0004363051,0.0002242894],"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.00001068037,0.0008723682,0.06374971,0.0006677863,0.00002856086,0.00001524412,0.01088498,0.09113738,0.0003679903,0.005277045,0.0001554125,0.8268328],"study_design_scores_gemma":[0.0003479565,0.0003048916,0.01300828,0.0001107203,0.000001678916,0.00000766107,0.00001577866,0.9857737,0.00006430691,0.0001097118,0.00006065223,0.0001946548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1181166,0.000171735,0.8794911,0.00009435722,0.0004932395,0.001362724,0.000004644754,0.000260505,0.000005077818],"genre_scores_gemma":[0.620234,0.000001901231,0.3793515,0.000008453077,0.00005981107,0.0003229952,9.763385e-7,0.000009447377,0.00001090664],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8946363,"threshold_uncertainty_score":0.7967585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128799871","doi":"10.1016/j.scico.2012.08.003","title":"Studying software evolution using topic models","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Queen's University","funders":"","keywords":"Computer science; Structuring; Topic model; Software evolution; Source code; Software; Software development; Data science; Software maintenance; Task (project management); Software system; Code (set theory); Generative grammar; Software engineering; Information retrieval; Software construction; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05347133154518463,"gpt":0.3013226588468253,"spread":0.2478513273016407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673375,0.0001432061,0.00017617,0.0004425485,0.0002822871,0.0002457023,0.001615372,0.00004197039,0.000001274906],"category_scores_gemma":[0.0001749741,0.0001390728,0.00006089491,0.001934137,0.0002512696,0.003214737,0.00100372,0.0001561351,0.000005197834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002333457,"about_ca_system_score_gemma":0.0002330981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003846066,"about_ca_topic_score_gemma":2.972256e-7,"domain_scores_codex":[0.9974102,0.00003868389,0.0002631552,0.000393723,0.001000424,0.0008937712],"domain_scores_gemma":[0.9985911,0.000178566,0.00009417332,0.0006277136,0.0002795262,0.0002289813],"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.000002982695,0.0003223284,0.105017,0.0001460049,0.00002552077,0.000005500071,0.005050587,0.07523499,0.004489928,0.052301,0.00001985403,0.7573843],"study_design_scores_gemma":[0.0002088742,0.0001069702,0.02251228,0.0001052799,0.000005436609,0.00004008131,0.00004756897,0.9721562,0.002609152,0.001784589,0.0001116113,0.0003119327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2825828,0.0002123253,0.7160724,0.00001497137,0.0006991751,0.0001706267,1.386113e-7,0.0002370944,0.00001046275],"genre_scores_gemma":[0.5347418,4.296664e-7,0.4651445,0.000005138293,0.00009451321,0.000005081673,1.072582e-7,0.000005284755,0.000003134388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8969212,"threshold_uncertainty_score":0.5671225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081869633","doi":"10.1016/j.scico.2005.10.003","title":"GXL: A graph-based standard exchange format for reengineering","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":88,"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; Interoperability; XML; Data exchange; Graph; Theoretical computer science; Programming language; Graph rewriting; Database; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01315442017528603,"gpt":0.2539888164817442,"spread":0.2408343963064582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001268441,0.0002194791,0.0002723592,0.0005789585,0.000180701,0.0002682074,0.001882376,0.00005753991,0.000001226378],"category_scores_gemma":[0.00001173298,0.0002161459,0.0001384916,0.001217591,0.0002085394,0.001359156,0.0003640667,0.0001190068,0.000001801291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000126083,"about_ca_system_score_gemma":0.0001603659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004031963,"about_ca_topic_score_gemma":0.000001815279,"domain_scores_codex":[0.9977601,0.00001264843,0.0003797228,0.0005116184,0.0006563181,0.000679565],"domain_scores_gemma":[0.9985501,0.00006188555,0.0001413193,0.0007304491,0.0003459093,0.000170343],"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.000005883787,0.00003558971,0.00003851063,0.0001197337,0.000005476063,0.000001120489,0.0003588735,0.02357721,0.0005316105,0.02990495,0.0002104476,0.9452106],"study_design_scores_gemma":[0.0003288497,0.0003395358,0.00005208621,0.0001224501,0.000003917239,0.000007108693,0.00000124817,0.8833098,0.01968342,0.00044907,0.09543341,0.0002691028],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002514629,0.000107938,0.9949697,0.0002757944,0.0003304922,0.0006170641,0.000003613409,0.001164122,0.00001662782],"genre_scores_gemma":[0.1621598,0.00000268854,0.8375256,0.00005114037,0.0001332269,0.0001054661,0.000001365435,0.00001585173,0.000004839514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9449415,"threshold_uncertainty_score":0.8814175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066610756","doi":"10.1016/j.scico.2011.01.002","title":"A framework for evolution of modelling languages","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":60,"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; Model transformation; Language evolution; Modeling language; Software evolution; Domain (mathematical analysis); Process (computing); Domain-specific language; Programming language; Artificial intelligence; Theoretical computer science; Software engineering; Software; Software development; Cognitive science","retraction":null,"screen_n_in":null,"score":{"opus":0.03548450210508491,"gpt":0.2798738074975644,"spread":0.2443893053924794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007579713,0.0001114403,0.0001863015,0.0002883447,0.0000738905,0.00004185862,0.001421041,0.00005488671,6.686749e-7],"category_scores_gemma":[0.00001272624,0.0001074287,0.00008022342,0.0008009424,0.0002398867,0.0005836272,0.0003012432,0.00008311903,4.608179e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004723942,"about_ca_system_score_gemma":0.0001150542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004144492,"about_ca_topic_score_gemma":3.18e-7,"domain_scores_codex":[0.9986908,0.00000960562,0.0002835937,0.0003498864,0.0003444487,0.0003216816],"domain_scores_gemma":[0.9988517,0.00005355084,0.000176715,0.0005403536,0.0003101324,0.00006750454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002399304,0.00004465013,0.0001489542,0.00004921156,0.000004170494,4.501717e-7,0.001503772,0.004398767,0.0004296387,0.7813157,0.000002551835,0.2120997],"study_design_scores_gemma":[0.00007399369,0.0002456365,0.0001830687,0.000170451,0.00000430909,0.000003898179,0.00001175066,0.9206397,0.02766011,0.05065535,0.0002067629,0.000144995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01062991,0.00008769851,0.9884332,0.00001245295,0.0001894556,0.0003003953,8.37416e-7,0.0003235928,0.00002245709],"genre_scores_gemma":[0.4428232,8.337763e-7,0.5571315,0.000002668379,0.00001920683,0.00001691287,1.302724e-7,0.000004483357,0.000001032032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9162409,"threshold_uncertainty_score":0.4380815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998844879","doi":"10.1016/s0167-6423(99)00029-5","title":"A calculus of functional BSP programs","year":2000,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada; Ericsson (Canada)","funders":"","keywords":"Computer science; Confluence; Mathematical proof; Extension (predicate logic); Process calculus; Calculus (dental); Reduction (mathematics); Functional programming; Programming language; Pi calculus; Process (computing); Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02356556207407858,"gpt":0.2448996145174379,"spread":0.2213340524433593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321518,0.0002097368,0.0003521039,0.0002609736,0.000233496,0.000288485,0.001789923,0.00007178738,0.00003301333],"category_scores_gemma":[0.00001803749,0.0001746484,0.0001714571,0.002164132,0.0009508932,0.000917448,0.0003182784,0.0001368344,0.00003797246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000045537,"about_ca_system_score_gemma":0.0003195863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050246,"about_ca_topic_score_gemma":0.000005768518,"domain_scores_codex":[0.9968781,0.00006122265,0.0005931105,0.000671943,0.001120375,0.0006752077],"domain_scores_gemma":[0.9983214,0.00004290776,0.0002696112,0.0007483015,0.0004140607,0.000203682],"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.000006117092,0.000221613,0.000690701,0.0000456314,0.00001276815,0.000004659652,0.0006935864,0.0002043959,0.0004062908,0.1241865,0.00003303281,0.8734947],"study_design_scores_gemma":[0.004768399,0.007487235,0.02122036,0.0003259885,0.00009370104,0.00076744,0.0004555147,0.7162758,0.02829306,0.04149063,0.1757622,0.003059761],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04569106,0.0001744178,0.949744,0.0001129485,0.0008598165,0.0005747956,3.062426e-7,0.0002688955,0.002573799],"genre_scores_gemma":[0.9027585,0.00000331954,0.09686108,0.00002736768,0.0001352046,0.00002999939,0.000002015827,0.000008364036,0.0001741287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8704349,"threshold_uncertainty_score":0.7121955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063743474","doi":"10.1016/j.scico.2009.12.004","title":"Decision-making coordination and efficient reasoning techniques for feature-based configuration","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":59,"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 model; Process (computing); Feature (linguistics); Product (mathematics); Stakeholder; Quality (philosophy); Domain engineering; Software; Software product line; Risk analysis (engineering); Domain (mathematical analysis); Exploit; Software engineering; Software development; Process management; Component-based software engineering; Computer security; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0151187916130799,"gpt":0.3156040255252115,"spread":0.3004852339121316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001678866,0.0001301454,0.0001816883,0.0003228371,0.0002460015,0.000268912,0.0006138482,0.00004825273,8.997743e-8],"category_scores_gemma":[0.0008156084,0.0001203149,0.00004106219,0.0008109931,0.0001800608,0.0005170993,0.00009807038,0.00008361167,1.16434e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005990214,"about_ca_system_score_gemma":0.00009098536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.560284e-7,"about_ca_topic_score_gemma":1.175291e-7,"domain_scores_codex":[0.9986531,0.00002888002,0.0002155837,0.000443031,0.0003543677,0.0003050469],"domain_scores_gemma":[0.9984254,0.0006986856,0.0001716058,0.0003035388,0.0003470021,0.00005373314],"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.000005497668,0.00001756983,0.00001373005,0.00001117457,9.466598e-7,6.352624e-7,0.0001367214,0.03285214,0.003180879,0.01877177,0.000006876667,0.9450021],"study_design_scores_gemma":[0.0002027466,0.0004757427,0.001838746,0.0003085294,0.000003901273,0.000009377742,0.000009831849,0.9339634,0.0474202,0.01532873,0.0002164163,0.000222352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006011693,0.00007818257,0.9925364,0.0002242787,0.0002640791,0.0004420027,4.355459e-7,0.0004302359,0.00001269738],"genre_scores_gemma":[0.4458794,3.381988e-7,0.5540547,0.00003059014,0.00002152107,0.000009743218,4.230438e-7,0.000002681032,6.210713e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9447797,"threshold_uncertainty_score":0.4906299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125899403","doi":"10.1016/j.scico.2006.01.003","title":"Semantics and scoping of aspects in higher-order languages","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"National Science Foundation","keywords":"Computer science; Scope (computer science); Programming language; Perl; Programmer; Semantics (computer science); Scheme (mathematics); Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02604234629225109,"gpt":0.3022022089453869,"spread":0.2761598626531357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007735206,0.0001009108,0.0002155389,0.0002922594,0.00004325074,0.00006700514,0.0006309868,0.00002965407,3.856026e-7],"category_scores_gemma":[0.00009841591,0.000095393,0.00001950117,0.001292276,0.000406897,0.000522925,0.0004250774,0.00008031569,2.243593e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002043593,"about_ca_system_score_gemma":0.00007452753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003579291,"about_ca_topic_score_gemma":0.000006619476,"domain_scores_codex":[0.9988042,0.00003226024,0.000263293,0.0003098453,0.0002923261,0.0002980358],"domain_scores_gemma":[0.9991972,0.0002457648,0.0001219257,0.0002914938,0.0001116629,0.00003193787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000003708042,0.0001405923,0.008920041,0.0006432934,0.000007064561,0.00003841503,0.001350103,0.1117759,0.01955573,0.2225166,0.000004996231,0.6350437],"study_design_scores_gemma":[0.002603042,0.001272631,0.2902242,0.006213098,0.00002189734,0.0001234553,0.0003421737,0.2562937,0.299683,0.1408052,0.0002830593,0.002134573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09747539,0.0003884542,0.9015186,0.0000953195,0.0002157489,0.0001267333,1.284751e-7,0.0001072279,0.00007242532],"genre_scores_gemma":[0.4395524,0.000002769239,0.5604135,0.000004194546,0.00001899971,0.000001882545,8.928457e-8,0.000002735211,0.000003447953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6329091,"threshold_uncertainty_score":0.3890014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001616837","doi":"10.1016/j.scico.2010.05.007","title":"Internal axioms for domain semirings","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Axiom; Kleene algebra; Computer science; Domain (mathematical analysis); Simple (philosophy); Modal; Algebra over a field; Set (abstract data type); Relational algebra; State (computer science); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Pure mathematics; Relational database; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01538404305182833,"gpt":0.307715587988258,"spread":0.2923315449364297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826789,0.0001205863,0.0001515317,0.0002588718,0.0002178912,0.0003611245,0.0026839,0.00004889132,0.000001950278],"category_scores_gemma":[0.0001178805,0.0001099275,0.00007995932,0.0008926048,0.0006429153,0.001285755,0.0005265772,0.0001804534,0.000005082652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002673017,"about_ca_system_score_gemma":0.0001397325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001147809,"about_ca_topic_score_gemma":0.000001822198,"domain_scores_codex":[0.9982522,0.00002240949,0.0003206894,0.0004832042,0.0004744041,0.0004471652],"domain_scores_gemma":[0.9985979,0.00007722243,0.0002167392,0.0006585033,0.00032024,0.0001294099],"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.000003389195,0.00003672301,0.00009669735,0.00001999216,0.000002580106,4.556233e-7,0.0008620637,0.00002163489,0.03813498,0.3496844,0.00001759538,0.6111194],"study_design_scores_gemma":[0.0005844565,0.0005593413,0.003408775,0.00007770328,0.000004848884,0.00008755548,0.00005966126,0.7542939,0.1899765,0.03005277,0.02043923,0.0004552258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.11296,0.000005783779,0.8843014,0.000155816,0.001935094,0.0003078645,4.345591e-7,0.0001254745,0.0002080756],"genre_scores_gemma":[0.3381594,2.113779e-7,0.6616664,0.00003266135,0.0001013809,0.00002485245,2.553981e-7,0.000004471744,0.00001035658],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7542722,"threshold_uncertainty_score":0.4987398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027110574","doi":"10.1016/s0167-6423(00)00004-6","title":"On a formal semantics of tabular expressions","year":2001,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language; Documentation; Semantics (computer science); Formal methods; Syntax; Readability; Formal semantics (linguistics); Software engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02854579184539554,"gpt":0.3014508763400059,"spread":0.2729050844946104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008409,0.0001277394,0.0002180191,0.0002495739,0.0001271786,0.00005413083,0.001554631,0.00003626994,0.000002058822],"category_scores_gemma":[0.0003031539,0.0001102066,0.00006367779,0.001366896,0.0003942052,0.00093212,0.0008116866,0.0001182119,0.000002663769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002454692,"about_ca_system_score_gemma":0.00006963765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003916672,"about_ca_topic_score_gemma":3.26946e-7,"domain_scores_codex":[0.9983284,0.00003602699,0.0002881952,0.0003387668,0.0005560044,0.0004525452],"domain_scores_gemma":[0.9986174,0.0003255871,0.0001690629,0.0006468934,0.0001518422,0.00008919464],"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.000007973579,0.0001283701,0.0004719265,0.00004025253,0.000007066476,0.00001483959,0.0008994206,0.1957787,0.01061925,0.05729539,0.00002866726,0.7347081],"study_design_scores_gemma":[0.001349469,0.002714637,0.008285216,0.0009698936,0.00002029409,0.0001353863,0.0001487334,0.6855716,0.2012327,0.09461638,0.003660042,0.001295684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09148491,0.00002702941,0.9076743,0.00006356814,0.000396429,0.000128642,2.406942e-7,0.0001786794,0.00004619616],"genre_scores_gemma":[0.3968697,0.000003206427,0.6030861,0.00001255663,0.00001549736,0.000003899732,1.030341e-7,0.000003798678,0.000005230419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7334124,"threshold_uncertainty_score":0.4494094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1554047564","doi":"10.1016/s0167-6423(01)00026-0","title":"Formal methods: the very idea","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":53,"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; Work (physics); Domain (mathematical analysis); Formal methods; Silver bullet; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04903776775227458,"gpt":0.3372662906134681,"spread":0.2882285228611935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005218174,0.0001386141,0.0001665423,0.000210353,0.000508361,0.00044021,0.003545165,0.00003881191,0.000007054792],"category_scores_gemma":[0.0001638485,0.00009667215,0.00008870337,0.002102918,0.0008546202,0.002688359,0.000924788,0.0001781376,0.00002469547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004587047,"about_ca_system_score_gemma":0.00005698671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007909607,"about_ca_topic_score_gemma":2.897848e-7,"domain_scores_codex":[0.9976993,0.0001905874,0.0003916776,0.000434686,0.0006833885,0.0006003631],"domain_scores_gemma":[0.998202,0.0001780363,0.0002411092,0.001047373,0.0002302826,0.00010126],"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":[6.512853e-7,0.00002911246,0.00003249475,0.000008398109,0.000002927068,5.900092e-7,0.001031755,0.0001301387,0.0007595905,0.1149205,0.00004551179,0.8830383],"study_design_scores_gemma":[0.000126784,0.0001728564,0.001352103,0.00002579481,0.000004462147,0.00004341186,0.0000479131,0.9650778,0.01904009,0.003208296,0.01071763,0.0001829241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004740865,0.0001666054,0.9920509,0.0003731645,0.001115459,0.0002555489,1.556231e-7,0.0001563963,0.001140876],"genre_scores_gemma":[0.1322353,0.000006187694,0.8675061,0.0001236183,0.00008147656,0.00001860371,1.028744e-7,0.000004945498,0.00002361104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9649476,"threshold_uncertainty_score":0.6587858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993807037","doi":"10.1016/j.scico.2009.10.007","title":"Rigi—An environment for software reverse engineering, exploration, visualization, and redocumentation","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reverse engineering; Software engineering; Visualization; Interoperability; Scripting language; Extensibility; Parsing; Software; Process (computing); Programming language; World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01630893437158457,"gpt":0.2878898918151171,"spread":0.2715809574435326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987828,0.0001201547,0.0001207329,0.0002818885,0.0001649633,0.0003357754,0.0006298761,0.00003102428,0.000001312803],"category_scores_gemma":[0.0001813833,0.0001250868,0.00002607161,0.0005938763,0.0001064211,0.002405863,0.0001220032,0.00005155239,0.000001713717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006421014,"about_ca_system_score_gemma":0.00007192269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003854023,"about_ca_topic_score_gemma":1.943061e-7,"domain_scores_codex":[0.9984547,0.00001551912,0.0002395888,0.0004582382,0.000506,0.0003259458],"domain_scores_gemma":[0.9991192,0.0001059555,0.00008243983,0.000373894,0.0001716398,0.0001468984],"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.000007339952,0.0002010363,0.0009673545,0.0000852444,0.000009280222,0.000002218739,0.003924268,0.0281156,0.003757449,0.04866091,0.000179631,0.9140897],"study_design_scores_gemma":[0.0008300984,0.001792941,0.01556452,0.0001108101,0.000009484374,0.00001930232,0.00006349254,0.955253,0.01435485,0.00387017,0.00758384,0.0005474871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0296669,0.0000364776,0.9693378,0.0001588237,0.0001579798,0.0004198687,5.676035e-7,0.0002208915,6.804322e-7],"genre_scores_gemma":[0.2414226,0.000006885696,0.7584314,0.00003296831,0.00005625508,0.00003107827,0.000004758195,0.000006590099,0.000007444293],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9271374,"threshold_uncertainty_score":0.510089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125453126","doi":"10.1016/j.scico.2014.11.007","title":"The Sensemaking-Coevolution-Implementation Theory of software design","year":2014,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Open Source Software Innovations","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Coevolution; Sensemaking; Software; Software engineering; Programming language; Theoretical computer science; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.0208030716805239,"gpt":0.2871346905404559,"spread":0.266331618859932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005439537,0.0001227363,0.0001596736,0.000221465,0.000669608,0.0003126273,0.001943362,0.00002839855,0.000002165906],"category_scores_gemma":[0.0003199783,0.0000935492,0.00006051383,0.002107833,0.0009012616,0.0008114345,0.0005295698,0.00009598323,0.00000504781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004767832,"about_ca_system_score_gemma":0.000277189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001422443,"about_ca_topic_score_gemma":0.000003110707,"domain_scores_codex":[0.9977455,0.0002162561,0.0004975129,0.0003664956,0.0007594712,0.0004147448],"domain_scores_gemma":[0.997111,0.0008976425,0.0004471558,0.0007619344,0.0007217875,0.00006043836],"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.000002167794,0.00002227596,0.0006609078,0.00000854129,0.000006335581,1.830098e-7,0.0008857016,0.0009076082,0.0004120527,0.2255697,0.00005224614,0.7714723],"study_design_scores_gemma":[0.001838415,0.002247884,0.04760932,0.0003853814,0.00005487123,0.00009285413,0.001475705,0.5088465,0.07762498,0.3404641,0.01797803,0.001381899],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009607761,0.00002865179,0.9891405,0.0002658336,0.0004202536,0.0003636602,4.931422e-7,0.0001312893,0.00004163452],"genre_scores_gemma":[0.4886887,5.337627e-7,0.5112265,0.0000323612,0.00003022391,0.00001070529,4.028304e-7,0.000004140566,0.000006496984],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7700904,"threshold_uncertainty_score":0.5150151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088108067","doi":"10.1016/j.scico.2013.11.025","title":"Understanding database schema evolution: A case study","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Database schema; Database; Reverse engineering; Schema (genetic algorithms); Database design; Schema migration; Database model; Information schema; Data science; Schema evolution; Software engineering; Information retrieval; Semi-structured model; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.08599344345401087,"gpt":0.3132914522561743,"spread":0.2272980088021634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585578,0.0001582576,0.0001816633,0.0005621893,0.0003874969,0.0007322726,0.001797575,0.00002740549,0.000008068068],"category_scores_gemma":[0.0002006523,0.0001467272,0.00004606568,0.0029577,0.0004109492,0.002423343,0.001406187,0.0001969751,0.00002902392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002882123,"about_ca_system_score_gemma":0.0002981006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003806414,"about_ca_topic_score_gemma":0.000006801385,"domain_scores_codex":[0.9972551,0.00005029252,0.0003022831,0.0006594056,0.001067968,0.0006649484],"domain_scores_gemma":[0.9979921,0.0002974975,0.00008845968,0.001025115,0.0003378957,0.0002589118],"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.000009793599,0.003406389,0.1874629,0.0004789877,0.0001765258,0.006041367,0.02314084,0.006089306,0.008723734,0.1389348,0.001289145,0.6242462],"study_design_scores_gemma":[0.001229379,0.001295341,0.010982,0.0001880635,0.00001231565,0.003591808,0.004547121,0.9735157,0.00150837,0.002212652,0.0001061424,0.0008111332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3533309,0.00002310159,0.6455615,0.00006448749,0.0002866834,0.0004942178,1.853299e-7,0.0002222156,0.00001678707],"genre_scores_gemma":[0.6876149,1.821478e-7,0.3122846,0.000005684418,0.00004533875,0.00003731847,1.593676e-7,0.000006157088,0.000005692661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9674264,"threshold_uncertainty_score":0.7061322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051051963","doi":"10.1016/j.scico.2010.06.009","title":"Bridging the gap between software architecture rationale formalisms and actual architecture documents: An ontology-driven approach","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Fondo de Fomento al Desarrollo Científico y Tecnológico","keywords":"Computer science; Software engineering; Documentation; Ontology; Software architecture; Architecture; Bridging (networking); Reuse; Information retrieval; Software; Data science; World Wide Web; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02824231510490536,"gpt":0.2911715243241744,"spread":0.262929209219269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611844,0.0002495881,0.0002879353,0.0002571655,0.0005388891,0.000441897,0.002375179,0.00009273589,7.847632e-7],"category_scores_gemma":[0.0003782383,0.0001779263,0.00006269907,0.0007482519,0.001224296,0.001278818,0.0009626167,0.0006674208,5.585158e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002314347,"about_ca_system_score_gemma":0.0001456192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001102311,"about_ca_topic_score_gemma":0.000007880103,"domain_scores_codex":[0.9976642,0.0001184997,0.0003125333,0.0006900501,0.0005974964,0.0006171988],"domain_scores_gemma":[0.9980714,0.0005711767,0.0001945739,0.0008210792,0.0001659205,0.0001758208],"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.000003141514,0.00002796118,0.0007219386,0.00003352014,0.00001358784,0.000001913978,0.004827844,0.06340589,0.001572306,0.006313172,0.000005062416,0.9230736],"study_design_scores_gemma":[0.003170962,0.00266957,0.0668264,0.0003404015,0.000131191,0.001843932,0.0008569123,0.5724897,0.02387841,0.3163308,0.007284526,0.004177111],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.113442,0.00003573459,0.8850133,0.0003613848,0.0004092407,0.0003899934,0.000002599369,0.0003346182,0.00001115537],"genre_scores_gemma":[0.2293888,9.707453e-7,0.7703186,0.00006726005,0.000180847,0.00002446027,0.000004539439,0.00001005436,0.000004533261],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9188966,"threshold_uncertainty_score":0.7255625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999284448","doi":"10.1016/j.scico.2012.01.004","title":"Taupe : Visualizing and analyzing eye-tracking data","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Program comprehension; Documentation; Software engineering; Plug-in; Extensibility; Eye tracking; Software; Process (computing); Human–computer interaction; Usability; Context (archaeology); Software system; Data science; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04910834378222158,"gpt":0.3630185884685466,"spread":0.3139102446863251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003726116,0.0001510599,0.0001980698,0.0004509656,0.0002759179,0.0006422727,0.003070523,0.00003666641,0.000001332844],"category_scores_gemma":[0.0004403802,0.0001445057,0.00002762937,0.001936945,0.0003977547,0.004380079,0.00361867,0.0001866835,0.000004710872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004417065,"about_ca_system_score_gemma":0.0001192159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002396362,"about_ca_topic_score_gemma":6.147983e-7,"domain_scores_codex":[0.9973766,0.00004183822,0.0002816013,0.0006101974,0.0007936459,0.0008960768],"domain_scores_gemma":[0.997888,0.0003268071,0.0001045036,0.001207355,0.0001759902,0.000297402],"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":[8.890531e-7,0.00005961943,0.1154079,0.00006410462,0.00001170715,0.000003323882,0.001809709,0.0001481332,0.003332788,0.00513583,0.00002120981,0.8740047],"study_design_scores_gemma":[0.0003650294,0.0001756012,0.2234564,0.0003088485,0.00001494064,0.00007660987,0.0001183189,0.759991,0.01002158,0.0002326542,0.004530983,0.0007079981],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2771038,0.0005898003,0.7214446,0.0000759932,0.0004469622,0.0001233181,4.091579e-7,0.0002010384,0.00001406151],"genre_scores_gemma":[0.6013889,0.000004979916,0.3984708,0.000009867815,0.0001132647,0.000002433616,8.481983e-7,0.000006615047,0.000002224461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8732967,"threshold_uncertainty_score":0.6193451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067377566","doi":"10.1016/j.scico.2010.11.010","title":"An empirical study on inconsistent changes to code clones at the release level","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":48,"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":"Computer science; Software evolution; Software release life cycle; Software; clone (Java method); Software quality; Software development; Perspective (graphical); Quality (philosophy); Code (set theory); Empirical research; Source code; Software engineering; Software construction; Programming language; Artificial intelligence; Statistics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.06513932518415562,"gpt":0.3623689497781702,"spread":0.2972296245940146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358445,0.0001725466,0.0001829185,0.0003507052,0.0004482982,0.0004670207,0.003287409,0.00003849772,0.000002846903],"category_scores_gemma":[0.0003262941,0.0001193394,0.00004408099,0.001723018,0.000445903,0.0003257386,0.001442796,0.0003218176,0.00003128294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007044255,"about_ca_system_score_gemma":0.0001846159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000455374,"about_ca_topic_score_gemma":0.0002256207,"domain_scores_codex":[0.997003,0.0000823959,0.0002209753,0.000757342,0.001329211,0.0006070348],"domain_scores_gemma":[0.9972351,0.0005260288,0.00006822593,0.001526343,0.0002849742,0.0003592931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002034998,0.0009629003,0.06468653,0.00001696205,0.00001495323,0.0000365819,0.008190823,0.001977502,0.01263441,0.0009139477,0.000386847,0.9101582],"study_design_scores_gemma":[0.0008064776,0.006541577,0.8346438,0.00008661481,0.00001139204,0.00009239404,0.0004189312,0.1168055,0.03055956,0.0002111478,0.009019459,0.0008031502],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.869394,0.000005875484,0.1262979,0.00256129,0.0008973875,0.0006340191,0.000001423269,0.0001986852,0.000009479428],"genre_scores_gemma":[0.8750818,1.925615e-7,0.1245047,0.0002252964,0.0001000277,0.0000593285,3.319917e-7,0.000009888236,0.00001836024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.909355,"threshold_uncertainty_score":0.6108878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153256103","doi":"10.1016/j.scico.2014.05.008","title":"A survey of grammatical inference in software engineering","year":2014,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Grammar induction; Inference; Rule-based machine translation; Artificial intelligence; Grammar; Natural language processing; Variety (cybernetics); Software; Programming language; Class (philosophy); Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02218549995902884,"gpt":0.2829273807883984,"spread":0.2607418808293695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003796713,0.0001429067,0.0003067301,0.0006423817,0.00003940025,0.0001356286,0.00216019,0.0000483063,0.000001118043],"category_scores_gemma":[0.007310887,0.0001391633,0.00004172759,0.003212371,0.0003064453,0.0005824816,0.0007726587,0.0002021877,0.000003273664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005034502,"about_ca_system_score_gemma":0.0002285305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001736362,"about_ca_topic_score_gemma":0.00001368866,"domain_scores_codex":[0.9976084,0.00007202026,0.0004493002,0.0004339993,0.0008583426,0.0005779957],"domain_scores_gemma":[0.9961072,0.002577757,0.0001025031,0.0006700458,0.0003930438,0.0001494735],"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.000002947712,0.0001369422,0.3686207,0.0002367746,0.000006501632,0.000004094747,0.0007398835,0.02947706,0.0007634873,0.01295315,0.000003386292,0.5870551],"study_design_scores_gemma":[0.0001350002,0.0001211099,0.4621229,0.000113986,5.277619e-7,0.000001882235,0.00000129913,0.5356238,0.001617612,0.0001270443,0.00001901055,0.0001158819],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3118232,0.00001840672,0.6877527,0.0000122696,0.0001731502,0.0001159307,3.23239e-7,0.0001013912,0.000002625439],"genre_scores_gemma":[0.6016952,5.018773e-7,0.3982785,0.000002645701,0.00001038934,0.000006685783,4.052065e-7,0.000004962719,7.169456e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5869392,"threshold_uncertainty_score":0.8752342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113772893","doi":"10.1016/j.scico.2013.03.015","title":"Using heuristics to estimate an appropriate number of latent topics in source code analysis","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latent Dirichlet allocation; Source code; Topic model; Heuristics; Set (abstract data type); Locality; Cluster analysis; Code review; Code (set theory); KPI-driven code analysis; Software; Programming language; Theoretical computer science; Information retrieval; Static program analysis; Software development; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03221342878942683,"gpt":0.3421796663322614,"spread":0.3099662375428346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003657,0.0001362115,0.000308108,0.0006756663,0.00007145251,0.0002864291,0.001704042,0.00004022062,0.000003940841],"category_scores_gemma":[0.0001630114,0.000129945,0.00006632126,0.004758418,0.0002038267,0.0006766515,0.0007770419,0.0001300347,0.000006445217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007878344,"about_ca_system_score_gemma":0.0001361383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003939677,"about_ca_topic_score_gemma":0.00001307319,"domain_scores_codex":[0.997704,0.00004419931,0.0004192894,0.0005037841,0.0007760258,0.0005527551],"domain_scores_gemma":[0.9984125,0.0001022205,0.0001193302,0.0007218256,0.0004211357,0.0002229188],"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.00000186958,0.0001537353,0.2726586,0.00006152776,0.00002906899,0.000005310081,0.001963625,0.4365238,0.001532453,0.001427494,0.000002403166,0.2856402],"study_design_scores_gemma":[0.0000856745,0.00006503934,0.1084972,0.00003693917,0.000008524692,0.000003936011,0.000008182446,0.8895506,0.00130283,0.0002844677,0.00002358067,0.0001329635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.483899,0.000003761399,0.5157751,0.00003393835,0.00008133837,0.000156295,2.371334e-7,0.00004722548,0.00000314642],"genre_scores_gemma":[0.5048447,1.750841e-7,0.4951167,0.000006396669,0.00001590615,0.000006065522,2.961148e-7,0.000004475394,0.000005232444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4530269,"threshold_uncertainty_score":0.5299001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998099342","doi":"10.1016/j.scico.2009.12.009","title":"Defining the meaning of tabular mathematical expressions","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Expression (computer science); Schema (genetic algorithms); Meaning (existential); Set (abstract data type); Theoretical computer science; Semantics (computer science); Regular expression; Programming language; Artificial intelligence; Natural language processing; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.01331328110744987,"gpt":0.2813138145955044,"spread":0.2680005334880545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002214793,0.0001091524,0.0001756775,0.0002214817,0.0002386452,0.0002063997,0.002993826,0.000039122,0.000006707626],"category_scores_gemma":[0.0008753757,0.00007435737,0.00006686894,0.001415645,0.0007942352,0.000502253,0.001148377,0.0003388288,0.000007990408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001138247,"about_ca_system_score_gemma":0.000202281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005972923,"about_ca_topic_score_gemma":6.180705e-7,"domain_scores_codex":[0.9978829,0.0000285497,0.0003117943,0.0003323994,0.0009899229,0.0004544108],"domain_scores_gemma":[0.9976844,0.0008787921,0.0001247661,0.000919709,0.0002702776,0.0001220223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001292857,0.00009545049,0.002458805,0.00006641084,0.00000961068,0.000004606636,0.003089609,0.0009414899,0.04945133,0.6797614,0.00002967976,0.2640903],"study_design_scores_gemma":[0.0004463925,0.0003267633,0.009743185,0.0004805395,0.00001214198,0.0001012883,0.0001978686,0.6926507,0.2726187,0.02148597,0.001423488,0.0005129347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1949429,0.0000390734,0.8040487,0.0001484046,0.0003977271,0.0001614592,2.403632e-7,0.0001238279,0.0001377306],"genre_scores_gemma":[0.5332737,2.900147e-7,0.4666839,0.000005156138,0.00002240104,0.000007537978,7.4825e-8,0.000004119042,0.000002851264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6917092,"threshold_uncertainty_score":0.5563322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136605135","doi":"10.1016/s0167-6423(02)00059-x","title":"Extracting Java library subsets for deployment on embedded systems","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"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":"Russian Science Foundation","keywords":"Computer science; Java; Vendor; Real time Java; Software deployment; Operating system; Java annotation; Embedded system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03309792975399573,"gpt":0.2732840682834196,"spread":0.2401861385294239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047444,0.0001860284,0.0002371302,0.0003746802,0.0003758582,0.0007458703,0.001736777,0.00005294322,0.000004112222],"category_scores_gemma":[0.00005026198,0.000170861,0.00009290872,0.001069207,0.000169948,0.001174738,0.0002756209,0.0001163451,0.00001094544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003629559,"about_ca_system_score_gemma":0.00006192911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003126312,"about_ca_topic_score_gemma":5.026822e-8,"domain_scores_codex":[0.9977407,0.00006999842,0.0004426966,0.0006387499,0.0005691519,0.0005387156],"domain_scores_gemma":[0.9985199,0.0002485922,0.0003073318,0.0006080206,0.0001665936,0.0001495421],"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.000009160194,0.0004108099,0.0003678544,0.0001171541,0.00001990927,0.000008605639,0.001701259,0.07037595,0.0004792567,0.04346294,0.003586925,0.8794602],"study_design_scores_gemma":[0.0002429749,0.0003056148,0.00003588879,0.000133394,0.000003017442,0.00001419215,0.0000191395,0.9909592,0.005275852,0.0001908395,0.002610146,0.00020969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005175184,0.0001587943,0.9916374,0.0002337583,0.0006727288,0.0005969277,0.000001051289,0.0008601647,0.000663975],"genre_scores_gemma":[0.4811938,0.000006194193,0.518548,0.00007657235,0.00008380913,0.00003069106,6.81213e-7,0.00001019431,0.00005007759],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9205833,"threshold_uncertainty_score":0.7192445,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W2783207916","doi":"10.1016/j.scico.2018.01.002","title":"The two paradigms of software development research","year":2018,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Empirical research; Software development; Situated; Management science; Knowledge management; Software engineering; Software; Data science; Epistemology; Artificial intelligence; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05274942628383975,"gpt":0.3674515784286378,"spread":0.3147021521447981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005388371,0.00009182553,0.0001210144,0.0002260081,0.0006535482,0.0003220699,0.002912008,0.00002444498,0.000001157452],"category_scores_gemma":[0.0002647896,0.00006446143,0.00003318733,0.00192015,0.001351871,0.0006361969,0.001010882,0.0001601433,0.000006387419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003971608,"about_ca_system_score_gemma":0.0004056375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002555767,"about_ca_topic_score_gemma":0.000004209436,"domain_scores_codex":[0.9978156,0.00006616478,0.0003084893,0.0003324597,0.0009747684,0.0005024849],"domain_scores_gemma":[0.9976754,0.0006217163,0.0001495608,0.0007103319,0.0007572396,0.00008578566],"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.000002634281,0.00002775289,0.0004401504,0.00001296697,0.000005241511,9.83263e-7,0.00114508,0.00003017441,0.000226714,0.03376357,0.00009994406,0.9642448],"study_design_scores_gemma":[0.0005639205,0.002120442,0.01122849,0.0005339211,0.000007630959,0.00007788697,0.0001291929,0.1102078,0.3244321,0.0239604,0.5259558,0.0007824598],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02805436,0.0001239452,0.9706682,0.0001723266,0.0004650937,0.0001935445,9.511745e-8,0.0001969821,0.0001254511],"genre_scores_gemma":[0.3992703,0.000003623581,0.6006403,0.000006325306,0.00005617403,0.0000107624,7.101989e-8,0.000003265569,0.000009185793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9634624,"threshold_uncertainty_score":0.5411284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966037378","doi":"10.1016/j.scico.2007.01.005","title":"ScriptEase: A generative/adaptive programming paradigm for game scripting","year":2007,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":36,"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; Scripting language; Programming language; Programmer; Game development tool; Game programming; Game design; Process (computing); Human–computer interaction; Video game development; Game art design; Adaptation (eye); Generative grammar; Construct (python library); Game Developer; Game design document; Multimedia; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04936147975289325,"gpt":0.3183360852273099,"spread":0.2689746054744167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004663235,0.0003478673,0.0004214721,0.0006203837,0.0006401479,0.0008390885,0.002774787,0.00009273397,0.000002293748],"category_scores_gemma":[0.0002310999,0.0003309166,0.000208515,0.002457149,0.001399176,0.002116681,0.0006963646,0.000232123,0.00001085273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001765963,"about_ca_system_score_gemma":0.0004235517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005333366,"about_ca_topic_score_gemma":0.00002353117,"domain_scores_codex":[0.9952692,0.00005673672,0.0009167872,0.001156148,0.001071899,0.001529243],"domain_scores_gemma":[0.9972243,0.0003269424,0.0005047567,0.0008131927,0.0007638537,0.000367007],"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.00001714341,0.0001244303,0.0002171043,0.00002529534,0.00001468307,0.00001005532,0.003026904,0.0004510938,0.00472866,0.1450109,0.00003545888,0.8463383],"study_design_scores_gemma":[0.0004671118,0.00176495,0.0008154018,0.000310692,0.00002635413,0.00007649699,0.001002091,0.7413903,0.2077319,0.02139975,0.02388549,0.001129428],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02918499,0.000240909,0.9671495,0.0002991183,0.001418703,0.001208,0.000001364488,0.0003478019,0.0001496345],"genre_scores_gemma":[0.4543408,0.00000117364,0.5452517,0.00009423697,0.000233309,0.00004490482,8.059348e-7,0.00001320551,0.00001985397],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8452089,"threshold_uncertainty_score":0.9999143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043140003","doi":"10.1016/j.scico.2013.10.006","title":"SeByte: Scalable clone and similarity search for bytecode","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Saskatchewan; Queen's University","funders":"","keywords":"Computer science; Bytecode; Scalability; Java bytecode; Ranking (information retrieval); Data mining; Similarity (geometry); Nearest neighbor search; Jaccard index; Source code; Matching (statistics); Heuristic; Binary search algorithm; Information retrieval; Theoretical computer science; Java; Search algorithm; Artificial intelligence; Programming language; Database; Pattern recognition (psychology); Java applet; Java annotation","retraction":null,"screen_n_in":null,"score":{"opus":0.0207267550115444,"gpt":0.28171656020423,"spread":0.2609898051926856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715463,0.0001369311,0.0001978729,0.0003176444,0.0002772511,0.0007361175,0.001624662,0.00004927019,0.000004207934],"category_scores_gemma":[0.0001781846,0.0001268562,0.00004630935,0.001275346,0.0005608539,0.001327069,0.001064458,0.00016519,0.000009920574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004994163,"about_ca_system_score_gemma":0.000205329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008079565,"about_ca_topic_score_gemma":8.241246e-7,"domain_scores_codex":[0.9976519,0.00002579452,0.0002373007,0.0006048331,0.0007069953,0.00077317],"domain_scores_gemma":[0.9980645,0.000483919,0.00004933594,0.0005853522,0.0005552945,0.0002616521],"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.000002801006,0.00009580452,0.01002668,0.0001818514,0.00001078342,0.000001917308,0.0006559145,0.0008487935,0.006248531,0.00839759,0.0003118396,0.9732175],"study_design_scores_gemma":[0.0004954448,0.0004353793,0.0356931,0.00007277427,0.00000288208,0.00002411595,0.0000255133,0.9269174,0.03297577,0.001915914,0.001119107,0.000322564],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2675374,0.00007294041,0.7309523,0.0004585568,0.0002012544,0.0005842328,6.561175e-7,0.000173227,0.00001947103],"genre_scores_gemma":[0.4869888,0.000002531417,0.5128692,0.00002197698,0.00004113102,0.00004869181,3.70396e-7,0.00000631466,0.00002097865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9728949,"threshold_uncertainty_score":0.7098398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068157922","doi":"10.1016/j.scico.2006.11.002","title":"Using semi-formal methods for detecting interactions among smart homes policies","year":2007,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":34,"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; Domain (mathematical analysis); Novelty; Feature (linguistics); Pairwise comparison; Formal methods; Iris recognition; Representation (politics); Taxonomy (biology); Human–computer interaction; Artificial intelligence; Computer security; Software engineering; Biometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.03111184549035671,"gpt":0.3676450353410482,"spread":0.3365331898506915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467263,0.00022035,0.0002758179,0.0007832212,0.0008418596,0.0004821222,0.001768953,0.00005144635,0.000001155094],"category_scores_gemma":[0.00003862936,0.0001972746,0.0001544224,0.00241012,0.0003638642,0.002367654,0.0009092407,0.000196762,8.419522e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007327658,"about_ca_system_score_gemma":0.0001519634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000336026,"about_ca_topic_score_gemma":0.0001468888,"domain_scores_codex":[0.9974303,0.00005558069,0.0005296813,0.0005659654,0.0004116922,0.001006823],"domain_scores_gemma":[0.9979711,0.000492009,0.0003575448,0.0005432046,0.0004313569,0.0002047963],"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.000008263834,0.00004865825,0.002262502,0.00007243283,0.00001898448,0.00000131198,0.005905224,0.001422078,0.01921472,0.005284652,0.000001141618,0.9657601],"study_design_scores_gemma":[0.0003651157,0.0002767016,0.007708108,0.0002082682,0.00002394457,0.00008405059,0.001152684,0.808287,0.1760335,0.001580688,0.003823878,0.0004560107],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2951598,0.00004728384,0.703165,0.00006413957,0.001003739,0.0002786359,4.06826e-7,0.0001519736,0.0001290202],"genre_scores_gemma":[0.4260147,4.5176e-7,0.5737345,0.00009207048,0.0001399427,0.000006777732,5.1673e-7,0.000007555213,0.0000035577],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.965304,"threshold_uncertainty_score":0.8044623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020217406","doi":"10.1016/j.scico.2008.09.008","title":"Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code","year":2008,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language; Abstraction; Code (set theory); Domain (mathematical analysis); Overhead (engineering); Gaussian elimination; Substitution (logic); Algorithm; Theoretical computer science; Gaussian; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04999646401566613,"gpt":0.2701197069315918,"spread":0.2201232429159256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009225829,0.000354115,0.0004207048,0.0003261865,0.0007893138,0.0005633767,0.001161116,0.00009889714,0.000002807728],"category_scores_gemma":[0.00004362772,0.0002862966,0.0000841374,0.001400453,0.001009681,0.001753436,0.0004896939,0.0002549365,0.0000067702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009360626,"about_ca_system_score_gemma":0.0002781819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007141374,"about_ca_topic_score_gemma":0.00008735814,"domain_scores_codex":[0.9963578,0.00007067139,0.0005646703,0.001118268,0.001040762,0.0008478417],"domain_scores_gemma":[0.9980038,0.0001073497,0.0005350694,0.0006853901,0.0003667028,0.0003016321],"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.0000205712,0.0003764128,0.03466853,0.0001172629,0.00005113202,0.0001167915,0.007265046,0.0007590179,0.004572978,0.006804807,0.00001569976,0.9452317],"study_design_scores_gemma":[0.00376379,0.003028309,0.1337989,0.0001999735,0.00007221814,0.0007118715,0.001904379,0.816987,0.01513302,0.0007859137,0.02115162,0.002463088],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3456519,0.0002632313,0.6527997,0.00004031911,0.0004411506,0.0004668611,8.483921e-7,0.0002749611,0.0000610124],"genre_scores_gemma":[0.6155495,0.000009457901,0.3842336,0.00001979993,0.00009918289,0.0000296378,0.000003096251,0.00001399894,0.0000417007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9427686,"threshold_uncertainty_score":0.9999589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124504744","doi":"10.1016/j.scico.2005.10.012","title":"Gaussian Elimination: A case study in efficient genericity with MetaOCaml","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Implementation; Gaussian elimination; Code (set theory); Gaussian; Code generation; Programming language; Algorithm; Theoretical computer science; Parallel computing; Mathematical optimization; Key (lock); Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01369903974349951,"gpt":0.2697930863575647,"spread":0.2560940466140652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142556,0.0001698645,0.0002352346,0.0005939875,0.0002568823,0.0003386373,0.001020948,0.00003824725,6.426968e-7],"category_scores_gemma":[0.000009837704,0.0001385194,0.00003751315,0.003173147,0.0002834582,0.0004159377,0.0003810777,0.0001528364,9.697094e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007519658,"about_ca_system_score_gemma":0.0001825014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005186938,"about_ca_topic_score_gemma":0.00008267158,"domain_scores_codex":[0.9977814,0.0000915074,0.0004132348,0.0006242531,0.0006657511,0.000423856],"domain_scores_gemma":[0.9988508,0.00004570044,0.0002132866,0.0005366359,0.0002782346,0.00007529998],"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.00001042036,0.002260051,0.0133292,0.00003174548,0.00001221917,0.001550513,0.004141808,0.662443,0.0001466731,0.01676981,0.00002891029,0.2992757],"study_design_scores_gemma":[0.0004586437,0.0005805487,0.008077745,0.00003490888,0.000005300664,0.0005645409,0.0001763328,0.9883599,0.001335434,0.0001364451,0.0000372387,0.0002329419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3943353,0.00001796314,0.60487,0.00007161086,0.00006620245,0.000338377,8.735378e-8,0.0001660584,0.0001343219],"genre_scores_gemma":[0.5628178,1.505799e-7,0.4371265,0.0000116341,0.00002004267,0.0000158658,2.198012e-7,0.000003581155,0.000004141375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3259169,"threshold_uncertainty_score":0.5648656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981525483","doi":"10.1016/j.scico.2012.05.006","title":"Invariant assertions, invariant relations, and invariant functions","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Invariant (physics); Computer science; Invariant polynomial; Finite type invariant; Mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02584949135833708,"gpt":0.2523502179027812,"spread":0.2265007265444441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238639,0.0002464573,0.0003131454,0.0004696381,0.0008082344,0.00071502,0.001144098,0.0001054566,0.000009719186],"category_scores_gemma":[0.000139521,0.00020996,0.00008714315,0.001931408,0.0005569657,0.003031538,0.0008366534,0.0002395861,0.00007352672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008718207,"about_ca_system_score_gemma":0.0003541824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001704454,"about_ca_topic_score_gemma":0.00001400323,"domain_scores_codex":[0.9970149,0.0001526887,0.0006048583,0.0006308353,0.0007259328,0.0008707504],"domain_scores_gemma":[0.9979919,0.0001506996,0.0003376145,0.0007895798,0.0003020716,0.0004281933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003058401,0.0002488061,0.01163723,0.00003661643,0.00002488547,0.00000480515,0.002091746,0.00004960691,0.0008973063,0.8750827,0.0002879962,0.1096352],"study_design_scores_gemma":[0.005155612,0.002892354,0.2821091,0.0003911993,0.0003421819,0.002709582,0.003197133,0.3633931,0.009831193,0.07767099,0.2468267,0.005480914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009732484,0.0004927726,0.9853384,0.0005380971,0.001552666,0.0005378175,9.24854e-7,0.0002679038,0.001538967],"genre_scores_gemma":[0.8117767,0.000007610382,0.187758,0.00007454101,0.0002224133,0.0000425488,0.000003401599,0.00001033062,0.0001044666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8020442,"threshold_uncertainty_score":0.856192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049511237","doi":"10.1016/j.scico.2012.11.002","title":"Stratified sampling of execution traces: Execution phases serving as strata","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"Computer science; Sampling (signal processing); Stratified sampling; Parallel computing; Telecommunications; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04349503827909484,"gpt":0.3280507423000704,"spread":0.2845557040209756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002116401,0.0001680127,0.0002306789,0.0004222362,0.000192859,0.0002643246,0.001686155,0.00005767813,0.000005540106],"category_scores_gemma":[0.0002784982,0.0001638657,0.00007423529,0.001900154,0.0003607423,0.002664066,0.0004585289,0.000169812,0.000004244123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007572409,"about_ca_system_score_gemma":0.0002805793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006766718,"about_ca_topic_score_gemma":0.000001309553,"domain_scores_codex":[0.9972582,0.00004428214,0.000440973,0.0004286232,0.001087482,0.0007404048],"domain_scores_gemma":[0.9982196,0.000335401,0.0002123377,0.0006603787,0.0003523193,0.0002199691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001281714,0.0005240347,0.00882178,0.0002943329,0.00002799475,0.000003549723,0.005144562,0.004879797,0.1126064,0.03817843,0.0000269361,0.8294794],"study_design_scores_gemma":[0.001312712,0.001595513,0.07141316,0.001193431,0.00003608641,0.0001741284,0.0009466195,0.2923252,0.6256672,0.002938441,0.001080776,0.001316835],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4362907,0.0001504027,0.5627909,0.00002872627,0.0003856969,0.0001815908,6.928755e-7,0.0001311528,0.00004014748],"genre_scores_gemma":[0.668521,0.000003112895,0.3313692,0.0000053302,0.00008189821,0.000008209265,0.000001415901,0.00000578665,0.0000040647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8281626,"threshold_uncertainty_score":0.6682249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2921931467","doi":"10.1016/j.scico.2019.03.001","title":"Measuring and analyzing code authorship in 1 + 118 open source projects","year":2019,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Linux kernel; Source code; Relation (database); Key (lock); World Wide Web; Code (set theory); Open source; Replicate; Constant (computer programming); Metric (unit); Open source software; Operating system; Software; Information retrieval; Data science; Programming language; Database; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05623410123772979,"gpt":0.3030603189937094,"spread":0.2468262177559796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004115843,0.000147892,0.0002609035,0.0006895845,0.0001188543,0.001077487,0.00320263,0.00004551273,0.00000144687],"category_scores_gemma":[0.0002938559,0.0001427498,0.00002995377,0.002689639,0.0002193773,0.001675056,0.002836814,0.0002624459,0.0000080395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009283786,"about_ca_system_score_gemma":0.000293789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001168041,"about_ca_topic_score_gemma":0.00001176887,"domain_scores_codex":[0.9974612,0.00007040639,0.0002919629,0.0007588047,0.0007320599,0.0006855756],"domain_scores_gemma":[0.9986122,0.0003122006,0.00009692436,0.0006470597,0.0001580104,0.0001736424],"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.000007131899,0.00007842236,0.3443801,0.0001687709,0.000008954315,0.00001232177,0.005011738,0.004660862,0.003170242,0.004657272,0.000007235852,0.6378369],"study_design_scores_gemma":[0.0009593619,0.0004013975,0.1989627,0.0007273426,0.000003274331,0.00005167067,0.0001135267,0.7873904,0.009152465,0.0008592809,0.0007825386,0.0005960246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6735863,0.00006729693,0.3253461,0.00009919718,0.0001983437,0.0005286292,1.16998e-7,0.0001165455,0.00005742464],"genre_scores_gemma":[0.728675,0.000001211869,0.2712456,0.000009588903,0.00001821928,0.00001413757,1.367963e-7,0.000008264164,0.00002782451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7827296,"threshold_uncertainty_score":0.9999595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968178973","doi":"10.1016/j.scico.2013.11.021","title":"Understanding software artifact provenance","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":18,"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; Artifact (error); Sketch; Flexibility (engineering); Software; Software engineering; Component (thermodynamics); Java; Software development; Component-based software engineering; Software system; Human–computer interaction; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2422656385648839,"gpt":0.3652303537855464,"spread":0.1229647152206625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006504437,0.0001441472,0.0002409114,0.0006142728,0.0005016612,0.002075979,0.002446552,0.0000266962,0.0001178133],"category_scores_gemma":[0.001150517,0.0001049093,0.00009472026,0.003403981,0.0009858207,0.001625899,0.001101384,0.0001027098,0.0003139165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009846161,"about_ca_system_score_gemma":0.0001489541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004361748,"about_ca_topic_score_gemma":0.000003064833,"domain_scores_codex":[0.9951283,0.00006195787,0.0006823062,0.0009930476,0.002523656,0.0006107485],"domain_scores_gemma":[0.9972517,0.0004256087,0.0003727621,0.001226328,0.0005294337,0.0001941349],"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.000001831832,0.0000640935,0.004952971,0.000009599405,0.000004479155,0.000001708776,0.0004880484,0.001166427,0.0003586991,0.00959778,0.006148788,0.9772056],"study_design_scores_gemma":[0.0008800646,0.00060691,0.06071449,0.0003487752,0.00001980897,0.00002993939,0.003891667,0.5506282,0.004035854,0.3382001,0.03949181,0.001152396],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1116777,0.0000187836,0.8847722,0.0004656162,0.001441862,0.0004536515,0.000001274855,0.0001238441,0.00104513],"genre_scores_gemma":[0.7975643,3.671865e-7,0.2020739,0.00005659263,0.00006049997,0.00001022923,8.256055e-7,0.00000507529,0.000228278],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9760532,"threshold_uncertainty_score":0.99896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109580177","doi":"10.1016/j.scico.2013.11.027","title":"An insight into the dispersion of changes in cloned and non-cloned code: A genealogy based empirical study","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Code (set theory); Cloning (programming); Empirical research; Genealogy; Programming language; History; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02139409513525516,"gpt":0.3106982517246645,"spread":0.2893041565894094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562319,0.000138421,0.0002422915,0.0004837707,0.0001486003,0.0002372106,0.001776375,0.00004220995,0.00000191996],"category_scores_gemma":[0.0001112723,0.00009793065,0.00002533474,0.001990166,0.0006022771,0.0005836233,0.0006927573,0.0001621646,0.000001642222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004625672,"about_ca_system_score_gemma":0.0001712923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000407277,"about_ca_topic_score_gemma":0.0001344531,"domain_scores_codex":[0.9978977,0.0001271623,0.0002732969,0.0005428072,0.0007325989,0.0004264213],"domain_scores_gemma":[0.9983939,0.00039456,0.00008936635,0.0007233727,0.0002511187,0.0001476899],"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.00001202849,0.0007518126,0.4312108,0.00007228449,0.000009427814,0.000011631,0.03314401,0.001488405,0.01527509,0.00009859452,0.00001134972,0.5179145],"study_design_scores_gemma":[0.0004369927,0.001150979,0.4461912,0.00003513707,0.00000193931,0.00000281804,0.0001742915,0.5477363,0.004055541,0.0000589265,0.0000363373,0.0001194851],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7987387,0.00004663663,0.1998334,0.0005646308,0.0001186195,0.0006506277,1.319908e-7,0.00004541305,0.000001879003],"genre_scores_gemma":[0.8710439,0.00000205778,0.1288249,0.00004152747,0.00002362746,0.00005644176,3.445051e-7,0.00000631529,9.031758e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.546248,"threshold_uncertainty_score":0.3993496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766618326","doi":"10.1016/j.scico.2017.08.010","title":"A case study of using grounded analysis as a requirement engineering method: Identifying personas that specify privacy and security tool users","year":2017,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Persona Design and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Networks of Centres of Excellence of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Persona; Categorization; Grounded theory; Identification (biology); Human–computer interaction; Set (abstract data type); Space (punctuation); Artificial intelligence; Qualitative research; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1122795109532508,"gpt":0.3727912956136177,"spread":0.260511784660367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001876393,0.0001806703,0.0003651094,0.0005179443,0.000832705,0.001178117,0.001637035,0.00003350542,0.000001057124],"category_scores_gemma":[0.00004984184,0.0001776112,0.0001127164,0.001201838,0.0002762,0.001736661,0.00120836,0.0001184991,3.11049e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007669976,"about_ca_system_score_gemma":0.0001131303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001225046,"about_ca_topic_score_gemma":0.00003096436,"domain_scores_codex":[0.9977657,0.00005834927,0.0003574034,0.000715399,0.0007211664,0.0003819373],"domain_scores_gemma":[0.9979748,0.00007844203,0.0004601854,0.001164682,0.0001832304,0.0001387291],"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.00002860606,0.002363237,0.08498464,0.0005100539,0.001380248,0.001417557,0.2306395,0.006327258,0.04359554,0.03543353,0.00000538303,0.5933144],"study_design_scores_gemma":[0.0004871978,0.000173718,0.01032775,0.00005862124,0.0001689605,0.0003251295,0.003035227,0.9824499,0.002292231,0.0003665652,0.00002162274,0.0002930692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5236346,0.00001539789,0.4759423,0.00002516351,0.00006460622,0.0002824352,3.230062e-7,0.00002911004,0.000006166581],"genre_scores_gemma":[0.6041327,0.000001122303,0.395826,0.000004469332,0.00001975977,0.0000107239,1.22139e-7,0.000003908696,0.00000120754],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9761227,"threshold_uncertainty_score":0.9998587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150207557","doi":"10.1016/j.scico.2009.02.005","title":"Reading beside the lines: Using indentation to rank revisions by complexity","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Indentation; Ranking (information retrieval); Code (set theory); Variance (accounting); Rank (graph theory); Metric (unit); Proxy (statistics); Simple (philosophy); Task (project management); Face (sociological concept); Reading (process); Algorithm; Theoretical computer science; Programming language; Artificial intelligence; Machine learning; Mathematics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04347948325870071,"gpt":0.3439133840634598,"spread":0.3004339008047591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001926564,0.0001423063,0.0001817992,0.0003291438,0.0004737416,0.0006220746,0.002370626,0.00003116729,0.000001726901],"category_scores_gemma":[0.0004222218,0.0001113307,0.00005763567,0.003142487,0.0002911515,0.0008642407,0.0004924528,0.0001846315,0.000007120861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000110623,"about_ca_system_score_gemma":0.0001655361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004578651,"about_ca_topic_score_gemma":6.062631e-7,"domain_scores_codex":[0.9975272,0.00006074887,0.000335357,0.0004997278,0.001018495,0.0005584242],"domain_scores_gemma":[0.9983436,0.0003204556,0.0001049418,0.000703918,0.0003340274,0.0001930879],"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.000005249207,0.00009940602,0.001652804,0.00002533965,0.000007655609,0.000005546748,0.002620173,0.009765851,0.03010159,0.01012224,0.000481179,0.9451129],"study_design_scores_gemma":[0.0004681268,0.0006503083,0.04254685,0.0004893332,0.00001108941,0.00007157958,0.0001142046,0.9231812,0.02689275,0.00292371,0.002035905,0.0006149921],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1845367,0.0000424531,0.8135699,0.001058365,0.0002595168,0.000361915,5.298017e-7,0.000156233,0.00001442368],"genre_scores_gemma":[0.5624963,0.000001272789,0.4373005,0.0001304315,0.00005865437,0.000003916158,5.339767e-7,0.000003969058,0.000004402335],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.944498,"threshold_uncertainty_score":0.599868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110847937","doi":"10.1016/j.scico.2011.11.002","title":"Tuning research tools for scalability and performance: The NiCad experience","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; Queen's University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Laptop; Factor (programming language); Software; Subsequence; Parsing; Code (set theory); Process (computing); Software engineering; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1341347190317785,"gpt":0.3583887963203428,"spread":0.2242540772885643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006789641,0.0001154701,0.0001482781,0.0002547207,0.000719528,0.0005966763,0.00299379,0.00003850096,0.000001795255],"category_scores_gemma":[0.001191374,0.00008281518,0.00004027215,0.001886744,0.002157277,0.001827632,0.001519713,0.0002665593,0.000002207245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000054477,"about_ca_system_score_gemma":0.0002354687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002419059,"about_ca_topic_score_gemma":6.08146e-7,"domain_scores_codex":[0.9972689,0.00007258993,0.0002657703,0.0006117861,0.0009827346,0.0007982127],"domain_scores_gemma":[0.9967341,0.001471421,0.00005933175,0.0009115157,0.0006634606,0.0001601238],"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.000008731522,0.00004603634,0.02279876,0.00006368894,0.000003371182,8.002148e-7,0.009908618,0.00002514685,0.0006028235,0.007732856,0.00001235032,0.9587968],"study_design_scores_gemma":[0.0004917942,0.001669192,0.4324507,0.0002202505,0.000003677681,0.00004767225,0.0007444566,0.5244998,0.03504503,0.002463606,0.001897034,0.0004667676],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6190791,0.00005373628,0.3799999,0.00008082803,0.0001910666,0.000462234,1.954145e-7,0.00008652957,0.00004651131],"genre_scores_gemma":[0.6871304,0.000004525626,0.3127129,0.000008348463,0.00003547697,0.00009758455,8.736405e-8,0.000004740463,0.000005964437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.95833,"threshold_uncertainty_score":0.7948578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3018272941","doi":"10.1016/j.scico.2020.102472","title":"The prevalence and severity of persistent ambiguity in software requirements specifications: Is a special effort needed to find them?","year":2020,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Sheridan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ambiguity; Software requirements specification; Sampling (signal processing); Process (computing); System requirements specification; Software engineering; Software; Software development; Risk analysis (engineering); Programming language; Software design","retraction":null,"screen_n_in":null,"score":{"opus":0.06871544950554817,"gpt":0.2913727760571159,"spread":0.2226573265515678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185367,0.000120644,0.0001754456,0.0001230784,0.0001907865,0.0001951485,0.002033705,0.00002743761,0.000004047451],"category_scores_gemma":[0.0005024148,0.0001002871,0.00006915527,0.001865596,0.0004529975,0.0004600062,0.00114857,0.0001400717,0.000004714547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007111418,"about_ca_system_score_gemma":0.000192529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002954151,"about_ca_topic_score_gemma":0.000001753435,"domain_scores_codex":[0.9977581,0.00003131711,0.000351998,0.0005272935,0.0009136676,0.0004176098],"domain_scores_gemma":[0.9986979,0.0002234815,0.0001035922,0.0005323629,0.0002473122,0.0001953603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003565265,0.0001700165,0.1446304,0.0004672023,0.00002732086,0.000006054344,0.02013909,0.0007901455,0.0009292376,0.00146719,0.0005858281,0.8307519],"study_design_scores_gemma":[0.0006929044,0.0008081152,0.8960092,0.0003809415,0.00001162453,0.00001555473,0.0003721362,0.08861495,0.008744704,0.0005427506,0.003323084,0.0004840565],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8728278,0.0001061299,0.123978,0.002086515,0.000248262,0.0006644933,0.000002575776,0.00006638985,0.00001985291],"genre_scores_gemma":[0.7796421,0.00001965952,0.2200996,0.00009959335,0.0001008482,0.00002099048,1.548002e-7,0.000005314941,0.00001171042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8302678,"threshold_uncertainty_score":0.4089589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122723127","doi":"10.1016/j.scico.2010.10.006","title":"Metamodeling semantics of multiple inheritance","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":15,"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; Inheritance (genetic algorithm); Metamodeling; Programming language; Programmer; Semantics (computer science); Context (archaeology); Construct (python library); Reusability; Multiple inheritance; Theoretical computer science; Object-oriented programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01989774059262699,"gpt":0.2773421233404728,"spread":0.2574443827478458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001472841,0.0001205836,0.0002143294,0.0002752318,0.0001002526,0.0001371996,0.002339186,0.00004519775,0.000002589853],"category_scores_gemma":[0.0005435454,0.0001144913,0.00006697753,0.001830198,0.000541553,0.0007727151,0.0008880097,0.0002595339,0.000004378414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001651229,"about_ca_system_score_gemma":0.0001732372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002491439,"about_ca_topic_score_gemma":0.000005076463,"domain_scores_codex":[0.9979157,0.00001614817,0.0003288433,0.0004189875,0.0008626787,0.0004576584],"domain_scores_gemma":[0.9981773,0.000325154,0.0001329968,0.0008139585,0.0004198427,0.0001306785],"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.000003498526,0.000174636,0.03761875,0.0001321224,0.00001620733,0.00000706583,0.001372986,0.01147941,0.2155296,0.01361141,0.00002706108,0.7200272],"study_design_scores_gemma":[0.0001855953,0.0000981941,0.009353772,0.00004664364,0.000002548502,0.00001426245,0.000007956608,0.8960633,0.09307116,0.000561886,0.0004207485,0.0001739554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4152538,0.00001855866,0.5840066,0.00005063001,0.0004592989,0.0001055139,2.168992e-7,0.00009342096,0.0000119048],"genre_scores_gemma":[0.5187175,7.236894e-7,0.4812421,0.000003864398,0.00002545601,0.000003467192,8.53957e-8,0.000004492468,0.00000234549],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8845839,"threshold_uncertainty_score":0.4668821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1409803167","doi":"10.1016/j.scico.2015.07.006","title":"Automatic deployment of component-based applications","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Seventh Framework Programme; Agence Nationale de la Recherche","keywords":"Computer science; Software deployment; Component (thermodynamics); Exploit; Metis; Cloud computing; Component-based software engineering; Distributed computing; Software; Process (computing); Automation; Software engineering; Service (business); Software system; Operating system; Database; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01774387087131645,"gpt":0.2637728356554294,"spread":0.2460289647841129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008119518,0.0001382527,0.0002268084,0.0003512806,0.0001160388,0.0001171243,0.002250257,0.000023414,0.000001466665],"category_scores_gemma":[0.000004862623,0.0001192287,0.00006760153,0.001955974,0.0003315147,0.0004283484,0.0004975602,0.00007600267,0.000007555398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003757282,"about_ca_system_score_gemma":0.0004050418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007543233,"about_ca_topic_score_gemma":0.000007724054,"domain_scores_codex":[0.9979081,0.00004390991,0.0004066474,0.0004091685,0.0008795655,0.0003526651],"domain_scores_gemma":[0.9982534,0.00007425608,0.0002871609,0.0007723011,0.0003903281,0.0002225378],"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.000003876663,0.0003817434,0.001248191,0.0001661118,0.00001380689,0.000002185016,0.002143225,0.004610993,0.002549515,0.02836481,0.00001809788,0.9604974],"study_design_scores_gemma":[0.0006704959,0.0004284211,0.00155067,0.0001421751,0.00001360071,0.00001307023,0.0001511179,0.9421968,0.04769503,0.002601925,0.004274143,0.0002625564],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1311046,0.00008512264,0.8674912,0.000331726,0.0002331363,0.0004068407,7.592491e-7,0.0001837378,0.0001629176],"genre_scores_gemma":[0.5742211,2.37941e-7,0.4256161,0.0001044821,0.00002508409,0.00002715042,0.000001221783,0.000003866238,7.976467e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9602349,"threshold_uncertainty_score":0.4862003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382930431","doi":"10.1016/j.scico.2023.102990","title":"AmbieGen: A search-based framework for autonomous systems testing","year":2023,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Modular design; Software deployment; Autonomous system (mathematics); Architecture; Robot; Scenario testing; Test case; Distributed computing; Artificial intelligence; Software engineering; Machine learning; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0676608071989877,"gpt":0.3268068828846064,"spread":0.2591460756856187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003026661,0.0001830308,0.0002663914,0.0006289408,0.0004936773,0.0007383706,0.00220505,0.00007015801,2.115656e-7],"category_scores_gemma":[0.0009302573,0.0001737018,0.00008875638,0.004521846,0.0004578647,0.0004331525,0.0005610158,0.0001625104,0.000009489309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007391203,"about_ca_system_score_gemma":0.0005844146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006778606,"about_ca_topic_score_gemma":2.364464e-7,"domain_scores_codex":[0.9973008,0.00004965808,0.0003890664,0.000708943,0.00071013,0.0008413907],"domain_scores_gemma":[0.9967106,0.001507985,0.0001909885,0.0008218538,0.0005950604,0.0001735162],"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.000003992316,0.00008535866,0.002481347,0.0002824841,0.000008709315,0.00001589158,0.0007197911,0.01719073,0.0005578463,0.05793732,0.0006403649,0.9200762],"study_design_scores_gemma":[0.000117661,0.0003794812,0.0008630721,0.0003784269,0.000003130017,0.00001245612,0.00000915123,0.9767142,0.001579773,0.0194353,0.000292425,0.0002149163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01139372,0.00003744784,0.9749328,0.0002538564,0.0007572395,0.0006193952,0.000001661613,0.01197753,0.00002635492],"genre_scores_gemma":[0.3949763,1.703143e-7,0.6048055,0.0000382906,0.00008575556,0.00007676825,9.884722e-7,0.0000108619,0.00000530928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9595235,"threshold_uncertainty_score":0.7120125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W989621208","doi":"10.1016/j.scico.2015.07.005","title":"Signature required: Making Simulink data flow and interfaces explicit","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Signature (topology); Reuse; Documentation; Interface (matter); Generalization; Software engineering; Software; Automotive industry; Comprehension; Program comprehension; Programming language; Software system; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.08808852585487233,"gpt":0.3382831394588602,"spread":0.2501946136039879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002260187,0.0001755586,0.0002249706,0.0002591664,0.0001813421,0.0006596721,0.003738542,0.000061114,3.639613e-7],"category_scores_gemma":[0.0004716378,0.0001530414,0.0000212156,0.00107533,0.000418497,0.001923214,0.003799526,0.0001808966,0.00000238817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003656023,"about_ca_system_score_gemma":0.0002259025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001897311,"about_ca_topic_score_gemma":0.000001331196,"domain_scores_codex":[0.9977244,0.00004684046,0.0002994811,0.00082948,0.0006596282,0.0004401323],"domain_scores_gemma":[0.9977506,0.0002024681,0.0001848038,0.001379631,0.0003062217,0.0001762228],"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.000003059271,0.00003540419,0.0005958999,0.0000249824,0.000004716897,0.000009534359,0.001976714,0.0002829749,0.0001778866,0.001591745,0.001366733,0.9939303],"study_design_scores_gemma":[0.0001588578,0.0002517929,0.0001316237,0.0002462066,0.000004604615,0.00005275644,0.00003472819,0.9843355,0.001107819,0.01226743,0.001173622,0.0002350558],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01476371,0.0004232416,0.9809417,0.0003448288,0.0004993378,0.0001884054,0.000001366369,0.00274932,0.00008815049],"genre_scores_gemma":[0.4777802,0.000001290383,0.5220833,0.00006387805,0.00006046779,0.000002241073,0.000001002324,0.000004871531,0.000002793175],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9936953,"threshold_uncertainty_score":0.6947204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010487855","doi":"10.1016/j.scico.2013.01.007","title":"Concurrency control generation for dynamic threads using discrete-event systems","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Concurrency; Petri net; Distributed computing; Deadlock; Formalism (music); Concurrency control; Thread (computing); State space; Deadlock prevention algorithms; Event (particle physics); Concurrent object-oriented programming; Concurrent computing; Parallel computing; Theoretical computer science; Programming language; Reactive programming; Programming paradigm","retraction":null,"screen_n_in":null,"score":{"opus":0.03041229813417752,"gpt":0.3042638866127702,"spread":0.2738515884785927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001756394,0.0002272612,0.0003769004,0.0003532878,0.0004099994,0.00107586,0.001774403,0.00006532873,0.000001047991],"category_scores_gemma":[0.00004885227,0.0001997201,0.000121423,0.001044192,0.0002958256,0.002035341,0.0003095725,0.00009660363,0.000005730999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001963557,"about_ca_system_score_gemma":0.0003272172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009073566,"about_ca_topic_score_gemma":0.000002028343,"domain_scores_codex":[0.996904,0.00008054664,0.0007212639,0.0007686923,0.000817512,0.0007080022],"domain_scores_gemma":[0.9977134,0.0001090942,0.0004531087,0.0007318175,0.0008166207,0.0001759338],"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.000004187314,0.0001455933,0.0006229189,0.0002868381,0.00004785753,0.000002331509,0.001358713,0.2612399,0.08619413,0.04522664,0.0000939513,0.6047769],"study_design_scores_gemma":[0.0004441077,0.0001624748,0.0000758876,0.0001386733,0.000008936491,0.0000240223,0.00003127037,0.9977212,0.0006625975,0.0003909152,0.0001038127,0.0002360886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09358705,0.0003554356,0.9016948,0.00009111289,0.002581296,0.001543181,0.0000028198,0.0001295313,0.00001481697],"genre_scores_gemma":[0.6549385,0.000001215721,0.3447687,0.00001654344,0.0001486443,0.0001094197,0.000001676322,0.00000879554,0.000006565029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7364812,"threshold_uncertainty_score":0.9999611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1807103277","doi":"10.1016/j.scico.2015.10.005","title":"Formal verification of function blocks applied to IEC 61131-3","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Implementation; Correctness; Programmable logic controller; Consistency (knowledge bases); Function (biology); Block (permutation group theory); Programming language; Certification; Function block diagram; Embedded system; Programmable logic device; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0386080968845398,"gpt":0.2954469819160373,"spread":0.2568388850314975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003114538,0.0001284051,0.0001985114,0.0004045351,0.0001291048,0.0001407906,0.001606156,0.00004976348,0.000001107649],"category_scores_gemma":[0.00009129071,0.0001237699,0.00004526287,0.002272155,0.0003108886,0.001423219,0.000519562,0.00009100204,0.00001161744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008096627,"about_ca_system_score_gemma":0.0002688575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001890392,"about_ca_topic_score_gemma":9.289879e-7,"domain_scores_codex":[0.9977345,0.00003785472,0.0004684039,0.0004632752,0.0008867264,0.0004091648],"domain_scores_gemma":[0.998025,0.0000273938,0.0003145471,0.0007978108,0.0006168897,0.0002183453],"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.00002556526,0.00007950592,0.0001681027,0.000021456,0.000004158384,1.592908e-7,0.001654763,0.002445834,0.01057545,0.1397967,0.00004472253,0.8451836],"study_design_scores_gemma":[0.001237058,0.002670142,0.02027811,0.0001258728,0.00002586349,0.0000264772,0.0004790557,0.5978385,0.3540918,0.009039387,0.01339035,0.0007974255],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07203226,0.00001175672,0.9256591,0.00007444363,0.0008202532,0.0003937054,4.212779e-7,0.000113716,0.0008943402],"genre_scores_gemma":[0.4835366,2.082481e-7,0.5163687,0.00002530947,0.00004222729,0.00001803141,7.85511e-7,0.000003193347,0.000004981961],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8443862,"threshold_uncertainty_score":0.5047191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393359044","doi":"10.1016/j.scico.2024.103114","title":"Exploring issues of story-based effort estimation in Agile Software Development (ASD)","year":2024,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Agile software development; Estimation; Computer science; Software development; Software; Lean software development; Software engineering; Software development process; Engineering; Systems engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04850963153745771,"gpt":0.3009249251196753,"spread":0.2524152935822176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001620891,0.0001211325,0.0001668847,0.000593039,0.0000734173,0.0002159085,0.0008657599,0.00002687384,0.000001211889],"category_scores_gemma":[0.00008118242,0.000115577,0.00004025515,0.001553735,0.0001175315,0.001900567,0.0002382477,0.0001407699,0.000002555316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007971486,"about_ca_system_score_gemma":0.0003228315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002682572,"about_ca_topic_score_gemma":0.000002078311,"domain_scores_codex":[0.9985204,0.00002044837,0.0003084135,0.0003641743,0.0005149925,0.0002715918],"domain_scores_gemma":[0.9992443,0.0001856347,0.00009199252,0.0003169277,0.0001067911,0.0000543188],"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.000001455722,0.00003930119,0.0009923842,0.0002510603,0.000004389029,0.000008770427,0.001838391,0.02814233,0.0001920869,0.002836243,0.00001280278,0.9656808],"study_design_scores_gemma":[0.0001059602,0.0001872701,0.006623303,0.001117883,0.000003899136,0.000007105089,0.00002022813,0.9339972,0.04789653,0.0005351134,0.009238684,0.0002668656],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1209826,0.0002636799,0.8775112,0.0001119808,0.000486557,0.0001575133,1.704552e-7,0.0004807591,0.000005596136],"genre_scores_gemma":[0.4400024,0.000003115155,0.5599461,0.000004248419,0.0000114383,0.00002584451,5.522826e-7,0.000004557767,0.000001765821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9654139,"threshold_uncertainty_score":0.4713092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094437360","doi":"10.1016/j.scico.2013.11.005","title":"Infeasible paths in object-oriented programs","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Dataflow; Computer science; Reachability; Traverse; Control flow; Control flow graph; Graph; Program analysis; Reachability problem; Path (computing); Theoretical computer science; Algorithm; Context (archaeology); Call graph; Data-flow analysis; Data flow diagram; Parallel computing; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02225470980871377,"gpt":0.2856804653230817,"spread":0.263425755514368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823002,0.0001653154,0.0002209573,0.0005237903,0.0001394955,0.0004423872,0.001982942,0.00005639871,0.000004462537],"category_scores_gemma":[0.0001005607,0.0001506497,0.00005809085,0.003932462,0.0005559408,0.00293086,0.0006584554,0.0001775538,0.00003960518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009474449,"about_ca_system_score_gemma":0.0002311156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001545048,"about_ca_topic_score_gemma":0.000004837319,"domain_scores_codex":[0.9973747,0.00009000486,0.0005035176,0.0006058363,0.0007425982,0.0006833193],"domain_scores_gemma":[0.9983513,0.00004104578,0.0002290044,0.0008088883,0.0004125227,0.0001572228],"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.000001082378,0.0001533508,0.006285905,0.00002311428,0.000001786652,0.000001480704,0.001115966,0.00008958852,0.001428836,0.05833975,0.000008339082,0.9325508],"study_design_scores_gemma":[0.0006727044,0.0007953545,0.07621592,0.0002357401,0.000003119818,0.00003221686,0.0001869706,0.8913233,0.0198406,0.007811236,0.002310843,0.0005719298],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2330794,0.00002928105,0.764719,0.00009473348,0.0006162593,0.0007689451,8.767723e-8,0.0001881936,0.0005040705],"genre_scores_gemma":[0.4254184,0.000001277458,0.5744422,0.00002387756,0.00002331089,0.00007803036,5.137864e-7,0.000004368489,0.000008059772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9319789,"threshold_uncertainty_score":0.6143315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169575545","doi":"10.1016/s0167-6423(02)00056-4","title":"Supporting iterations in exploratory database reengineering processes","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Business process reengineering; Legacy system; Software engineering; Database; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01727943956174552,"gpt":0.2582559259184934,"spread":0.2409764863567479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892806,0.000154392,0.000174207,0.0005685267,0.0001842403,0.0003200626,0.001605849,0.00002678755,0.000005487751],"category_scores_gemma":[0.00003085879,0.0001455795,0.00003193372,0.003665398,0.0001178284,0.002457637,0.0005664667,0.000150125,0.000007867771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002645866,"about_ca_system_score_gemma":0.0001087761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001992418,"about_ca_topic_score_gemma":0.00005459747,"domain_scores_codex":[0.9979465,0.00002636148,0.0004171785,0.0005394315,0.0005099601,0.0005605476],"domain_scores_gemma":[0.9988419,0.00008071082,0.0001567951,0.0005658232,0.0002274352,0.0001273048],"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.000004709982,0.0006134909,0.006493443,0.001027431,0.00001787747,0.00009417366,0.06444355,0.01641028,0.01356477,0.01744912,0.00007618816,0.879805],"study_design_scores_gemma":[0.0004771867,0.0001995653,0.0009554189,0.0005346661,0.000005561888,0.00004288588,0.0005570704,0.9727226,0.01984558,0.0005368923,0.00359818,0.0005244071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1880523,0.0003518075,0.8101596,0.0003484808,0.0003686129,0.0002649687,0.000001264771,0.0002324242,0.0002206175],"genre_scores_gemma":[0.70723,0.00000621007,0.2925474,0.000122081,0.00006233777,0.00001993073,0.000001682592,0.000006058623,0.000004249383],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9563123,"threshold_uncertainty_score":0.5936559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003852722","doi":"10.1016/j.scico.2007.11.005","title":"The logic of message-passing","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Message passing; Notation; Programming language; Operational semantics; Equivalence (formal languages); Semantics (computer science); Proof theory; Theoretical computer science; Logic programming; Term (time); Calculus (dental); Algorithm; Discrete mathematics; Mathematics; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.02187553062832526,"gpt":0.2702122055431208,"spread":0.2483366749147955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002255392,0.00016313,0.0002656348,0.000173257,0.000538422,0.0005444832,0.002815275,0.00004840175,8.697828e-7],"category_scores_gemma":[0.00006239158,0.0001045129,0.0001214356,0.001629203,0.0008645515,0.0007235367,0.0003670923,0.0001290528,0.000004208955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003564957,"about_ca_system_score_gemma":0.0002036754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002374216,"about_ca_topic_score_gemma":0.000002741394,"domain_scores_codex":[0.9974905,0.0000775977,0.00050829,0.0004606761,0.0008500663,0.0006128975],"domain_scores_gemma":[0.9981565,0.0001236847,0.0004154964,0.0008182391,0.0003679494,0.000118127],"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.000001497973,0.00004802473,0.0001107454,0.000009781002,0.00000384903,0.000002446934,0.0004203992,0.00004683988,0.0009214202,0.396355,0.00004283158,0.6020372],"study_design_scores_gemma":[0.00187709,0.005290919,0.01921295,0.0002105079,0.00005080122,0.0002734664,0.0006852417,0.2537733,0.07049117,0.5546876,0.09164733,0.001799666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004777877,0.0004694303,0.9907817,0.0009698552,0.0008657376,0.0003236817,7.748775e-8,0.0001505676,0.001661066],"genre_scores_gemma":[0.8587956,0.000006282375,0.140989,0.00009194084,0.00007877639,0.000004717212,1.889715e-7,0.00000347988,0.00003001104],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8540177,"threshold_uncertainty_score":0.5250464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088136492","doi":"10.1016/j.scico.2010.05.002","title":"The essential similarity and differences between mathematical modeling and programming","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Similarity (geometry); Mathematical model; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01880713761369641,"gpt":0.2760802703627261,"spread":0.2572731327490297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003367967,0.0002164216,0.0002847528,0.0001566961,0.001526133,0.002071212,0.001447162,0.00008331704,8.833477e-7],"category_scores_gemma":[0.0002276401,0.0001505825,0.00005779479,0.0005848391,0.001582883,0.0007619599,0.00112136,0.0006695207,0.000001694831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009759669,"about_ca_system_score_gemma":0.000110692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003398799,"about_ca_topic_score_gemma":0.000008064009,"domain_scores_codex":[0.997449,0.00008761664,0.000418599,0.0006642515,0.0006845372,0.0006959853],"domain_scores_gemma":[0.9984492,0.0004138956,0.0001859415,0.0005395898,0.0001582346,0.0002531297],"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.000001644126,0.0000289962,0.00315254,0.00004037055,0.000008824883,0.000001243405,0.001445605,0.00001821131,0.0001271593,0.0249678,5.873742e-7,0.970207],"study_design_scores_gemma":[0.0004310231,0.0004492989,0.007892161,0.0001779639,0.00003643084,0.000101128,0.0003124581,0.9758918,0.0003120805,0.008439371,0.005349674,0.0006066551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4348662,0.00007396584,0.5640849,0.0004257447,0.000182912,0.0001939277,1.527809e-7,0.0001559603,0.0000161095],"genre_scores_gemma":[0.5865422,0.000002739932,0.4133359,0.000005017542,0.00009269635,0.000009128891,1.981429e-7,0.000005713177,0.000006278837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9758735,"threshold_uncertainty_score":0.9997737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}