{"meta":{"query_hash":"3f3649e009bc","filters":{"venue":"Science of Computer Programming"},"cohort_total":94,"direct_labels_cover":1,"predictions_cover":94,"exported":94,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3f3649e009bc","api":"https://metacan.xera.ac/api/v1/cohort?venue=Science+of+Computer+Programming"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017743870871316455,"score_gpt":0.26377283565542936,"score_spread":0.2460289647841129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409803167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13110457,0.000085122636,0.8674912,0.000331726,0.00023313629,0.0004068407,7.592491e-7,0.00018373784,0.00016291755],"genre_scores_gemma":[0.5742211,2.3794098e-7,0.4256161,0.00010448208,0.000025084086,0.000027150418,0.0000012217829,0.000003866238,7.9764675e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790806,0.000043909913,0.0004066474,0.00040916845,0.0008795655,0.00035266514],"domain_scores_gemma":[0.9982534,0.00007425608,0.00028716095,0.0007723011,0.00039032812,0.00022253777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008119518,0.00013825268,0.00022680844,0.00035128064,0.00011603876,0.000117124284,0.0022502574,0.000023413997,0.0000014666653],"category_scores_gemma":[0.000004862623,0.00011922865,0.000067601526,0.0019559741,0.00033151472,0.0004283484,0.00049756025,0.000076002674,0.0000075553976],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038766625,0.00038174342,0.0012481912,0.00016611177,0.000013806888,0.0000021850158,0.0021432252,0.0046109925,0.0025495153,0.028364807,0.000018097882,0.96049744],"study_design_scores_gemma":[0.00067049585,0.00042842107,0.0015506698,0.0001421751,0.000013600711,0.000013070226,0.00015111794,0.9421968,0.047695026,0.0026019248,0.0042741434,0.0002625564],"about_ca_topic_score_codex":0.000075432334,"about_ca_topic_score_gemma":0.000007724054,"teacher_disagreement_score":0.9602349,"about_ca_system_score_codex":0.000037572816,"about_ca_system_score_gemma":0.00040504182,"threshold_uncertainty_score":0.48620033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Work (physics); Domain (mathematical analysis); Formal methods; Silver bullet; Software engineering","score_opus":0.04903776775227458,"score_gpt":0.33726629061346813,"score_spread":0.28822852286119355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554047564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047408645,0.00016660542,0.99205095,0.00037316445,0.0011154591,0.00025554895,1.5562306e-7,0.0001563963,0.001140876],"genre_scores_gemma":[0.13223533,0.000006187694,0.86750615,0.00012361833,0.00008147656,0.00001860371,1.02874424e-7,0.000004945498,0.000023611039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976993,0.00019058738,0.00039167763,0.00043468596,0.0006833885,0.0006003631],"domain_scores_gemma":[0.99820197,0.00017803625,0.0002411092,0.0010473733,0.00023028262,0.00010125995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052181743,0.00013861411,0.00016654232,0.00021035303,0.000508361,0.00044020996,0.0035451653,0.00003881191,0.0000070547917],"category_scores_gemma":[0.00016384853,0.00009667215,0.00008870337,0.0021029185,0.0008546202,0.0026883595,0.000924788,0.00017813759,0.000024695466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5128535e-7,0.00002911246,0.00003249475,0.000008398109,0.0000029270684,5.900092e-7,0.0010317555,0.00013013865,0.0007595905,0.114920504,0.000045511788,0.88303834],"study_design_scores_gemma":[0.00012678397,0.00017285635,0.0013521033,0.000025794807,0.0000044621474,0.000043411856,0.000047913105,0.96507776,0.019040085,0.003208296,0.010717633,0.00018292405],"about_ca_topic_score_codex":0.000007909607,"about_ca_topic_score_gemma":2.897848e-7,"teacher_disagreement_score":0.9649476,"about_ca_system_score_codex":0.00004587047,"about_ca_system_score_gemma":0.00005698671,"threshold_uncertainty_score":0.6587858},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06438464849421065,"score_gpt":0.33700594520257726,"score_spread":0.2726212967083666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763929460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1181166,0.00017173498,0.8794911,0.000094357216,0.0004932395,0.0013627243,0.0000046447544,0.000260505,0.000005077818],"genre_scores_gemma":[0.62023395,0.0000019012306,0.37935153,0.000008453077,0.000059811075,0.0003229952,9.763385e-7,0.000009447377,0.00001090664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678826,0.000048651793,0.00040655947,0.0007814076,0.0009960565,0.0009790823],"domain_scores_gemma":[0.99795663,0.00039407675,0.00013162692,0.00085707696,0.00043630513,0.00022428944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022631024,0.00021661713,0.00033878087,0.00068665034,0.00015756722,0.00033227948,0.0017285726,0.00006472078,0.0000023478808],"category_scores_gemma":[0.0003010254,0.0001953854,0.00011727125,0.0024957254,0.0002460508,0.0012903081,0.0006027496,0.00021779802,0.00000314762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010680372,0.0008723682,0.06374971,0.0006677863,0.000028560857,0.000015244122,0.010884984,0.09113738,0.00036799026,0.005277045,0.00015541252,0.82683283],"study_design_scores_gemma":[0.0003479565,0.00030489164,0.013008284,0.000110720255,0.0000016789157,0.0000076610695,0.000015778664,0.9857737,0.00006430691,0.00010971179,0.000060652234,0.0001946548],"about_ca_topic_score_codex":0.000112116075,"about_ca_topic_score_gemma":0.0000061851015,"teacher_disagreement_score":0.89463633,"about_ca_system_score_codex":0.00044565875,"about_ca_system_score_gemma":0.00021423683,"threshold_uncertainty_score":0.79675853},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038608096884539804,"score_gpt":0.2954469819160373,"score_spread":0.2568388850314975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807103277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07203226,0.000011756717,0.9256591,0.00007444363,0.00082025316,0.0003937054,4.2127792e-7,0.00011371597,0.00089434016],"genre_scores_gemma":[0.4835366,2.082481e-7,0.5163687,0.00002530947,0.000042227286,0.000018031415,7.85511e-7,0.0000031933466,0.000004981961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773455,0.00003785472,0.0004684039,0.0004632752,0.00088672637,0.00040916476],"domain_scores_gemma":[0.998025,0.000027393802,0.00031454707,0.0007978108,0.00061688974,0.0002183453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031145378,0.00012840511,0.00019851138,0.00040453507,0.00012910475,0.00014079062,0.0016061559,0.00004976348,0.0000011076486],"category_scores_gemma":[0.00009129071,0.00012376992,0.00004526287,0.0022721551,0.0003108886,0.0014232195,0.000519562,0.00009100204,0.0000116174415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002556526,0.000079505924,0.00016810266,0.000021455997,0.0000041583844,1.5929076e-7,0.0016547632,0.0024458335,0.010575446,0.13979666,0.000044722532,0.8451836],"study_design_scores_gemma":[0.0012370583,0.0026701416,0.020278107,0.00012587277,0.000025863494,0.000026477204,0.0004790557,0.5978385,0.35409176,0.009039387,0.013390348,0.0007974255],"about_ca_topic_score_codex":0.000018903922,"about_ca_topic_score_gemma":9.289879e-7,"teacher_disagreement_score":0.8443862,"about_ca_system_score_codex":0.00008096627,"about_ca_system_score_gemma":0.0002688575,"threshold_uncertainty_score":0.5047191},"labels":[],"label_agreement":null},{"id":"W1965621944","doi":"10.1016/j.scico.2009.01.004","title":"A study of potential parallelism among traces in Java programs","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallelism (grammar); Java; Programming language; Task parallelism; Parallel computing","score_opus":0.016344855828402165,"score_gpt":0.26305832386614125,"score_spread":0.24671346803773908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965621944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7732121,0.00005026652,0.2254128,0.000061690385,0.00036136401,0.0006853364,2.3014317e-7,0.00011201567,0.00010422079],"genre_scores_gemma":[0.9359565,8.6435443e-7,0.0639486,0.000009508414,0.00006008263,0.000012016216,0.0000011372971,0.0000045195193,0.000006820466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966575,0.0001266921,0.0008210407,0.0007096104,0.0010311154,0.0006540565],"domain_scores_gemma":[0.99842983,0.000033652133,0.00043583883,0.0006909019,0.0002677916,0.00014200302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017372633,0.00021981688,0.0004589323,0.00047548828,0.00014188082,0.00036656085,0.002612205,0.000058915888,5.310005e-7],"category_scores_gemma":[0.000018535577,0.00019703273,0.00009932954,0.0026941497,0.00033708895,0.0009167768,0.00034328582,0.00017749879,0.0000015723042],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014141817,0.0031437539,0.02657697,0.000045217035,0.000018194183,0.00008225876,0.014120319,0.020812362,0.00045031746,0.0038499578,0.000018467414,0.930868],"study_design_scores_gemma":[0.003251142,0.0074595697,0.4443795,0.0006406752,0.000021070882,0.00008272505,0.0017022899,0.5381283,0.0007861245,0.0024310413,0.00019486572,0.0009226452],"about_ca_topic_score_codex":0.0001682331,"about_ca_topic_score_gemma":0.000020964528,"teacher_disagreement_score":0.9299454,"about_ca_system_score_codex":0.000034408084,"about_ca_system_score_gemma":0.00015244535,"threshold_uncertainty_score":0.80347615},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04936147975289325,"score_gpt":0.3183360852273099,"score_spread":0.26897460547441665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966037378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029184986,0.00024090896,0.9671495,0.00029911828,0.0014187029,0.0012079998,0.000001364488,0.0003478019,0.00014963448],"genre_scores_gemma":[0.45434082,0.00000117364,0.54525167,0.00009423697,0.00023330904,0.000044904824,8.059348e-7,0.000013205506,0.000019853975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952692,0.000056736717,0.00091678725,0.0011561478,0.0010718993,0.001529243],"domain_scores_gemma":[0.9972243,0.0003269424,0.0005047567,0.0008131927,0.00076385366,0.00036700701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046632346,0.00034786726,0.0004214721,0.00062038365,0.0006401479,0.0008390885,0.0027747867,0.00009273397,0.0000022937481],"category_scores_gemma":[0.00023109993,0.0003309166,0.00020851503,0.002457149,0.001399176,0.0021166806,0.0006963646,0.000232123,0.000010852732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017143408,0.00012443025,0.0002171043,0.000025295336,0.000014683066,0.0000100553225,0.0030269043,0.00045109377,0.0047286605,0.14501087,0.000035458877,0.84633833],"study_design_scores_gemma":[0.00046711182,0.0017649496,0.0008154018,0.00031069203,0.00002635413,0.00007649699,0.0010020913,0.7413903,0.20773195,0.02139975,0.023885489,0.0011294277],"about_ca_topic_score_codex":0.00005333366,"about_ca_topic_score_gemma":0.000023531165,"teacher_disagreement_score":0.8452089,"about_ca_system_score_codex":0.00017659625,"about_ca_system_score_gemma":0.00042355168,"threshold_uncertainty_score":0.9999143},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.24226563856488387,"score_gpt":0.3652303537855464,"score_spread":0.12296471522066255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968178973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11167767,0.000018783596,0.8847722,0.00046561623,0.0014418624,0.00045365148,0.0000012748545,0.00012384407,0.0010451298],"genre_scores_gemma":[0.79756427,3.6718646e-7,0.20207386,0.000056592628,0.00006049997,0.0000102292315,8.256055e-7,0.00000507529,0.00022827805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951283,0.00006195787,0.0006823062,0.0009930476,0.002523656,0.0006107485],"domain_scores_gemma":[0.99725175,0.0004256087,0.00037276212,0.0012263283,0.0005294337,0.00019413486],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006504437,0.00014414721,0.00024091135,0.0006142728,0.00050166115,0.002075979,0.0024465516,0.000026696203,0.000117813346],"category_scores_gemma":[0.0011505168,0.00010490925,0.00009472026,0.0034039812,0.0009858207,0.0016258985,0.0011013838,0.00010270977,0.00031391653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018318316,0.000064093496,0.0049529714,0.000009599405,0.0000044791555,0.000001708776,0.0004880484,0.0011664269,0.0003586991,0.00959778,0.0061487877,0.9772056],"study_design_scores_gemma":[0.00088006456,0.00060691003,0.060714494,0.00034877518,0.000019808971,0.000029939385,0.0038916667,0.5506282,0.0040358542,0.33820012,0.03949181,0.001152396],"about_ca_topic_score_codex":0.000043617478,"about_ca_topic_score_gemma":0.0000030648328,"teacher_disagreement_score":0.9760532,"about_ca_system_score_codex":0.00009846161,"about_ca_system_score_gemma":0.00014895409,"threshold_uncertainty_score":0.99895996},"labels":[],"label_agreement":null},{"id":"W1972755304","doi":"10.1016/j.scico.2014.04.016","title":"Supervisory control theory with Alloy","year":2014,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Control (management); Artificial intelligence","score_opus":0.015454074446812325,"score_gpt":0.22936982342784468,"score_spread":0.21391574898103236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972755304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053510655,0.00006412519,0.94469136,0.0001468063,0.00044602717,0.0002512397,2.5452974e-7,0.0002417417,0.00064778764],"genre_scores_gemma":[0.61994034,5.1303397e-7,0.3798318,0.00011872148,0.000078139354,0.000011003906,1.3672616e-7,0.0000072167645,0.000012150986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709374,0.00017437899,0.00037786947,0.0007036217,0.001002713,0.00064766227],"domain_scores_gemma":[0.9979339,0.00026145994,0.0001997432,0.001036876,0.00038197974,0.00018599285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042003933,0.00019839552,0.00031419823,0.00033861733,0.00027027694,0.00041224007,0.0029780548,0.000043766395,0.000001944752],"category_scores_gemma":[0.00006174485,0.00015211922,0.00006737192,0.0014356028,0.00068277924,0.0012000375,0.00044156666,0.00014039883,0.000011835311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012586436,0.00007479207,0.0011984262,0.000042775122,0.000016940603,0.0000046251853,0.001128304,0.008292379,0.0021323299,0.2143269,0.000014029464,0.7727559],"study_design_scores_gemma":[0.0008562701,0.00054424244,0.0009692277,0.00017282652,0.0000093481585,0.00006875536,0.00004431587,0.9888957,0.0020444281,0.0037864384,0.002241434,0.00036698882],"about_ca_topic_score_codex":0.00000925268,"about_ca_topic_score_gemma":0.0000016857146,"teacher_disagreement_score":0.98060334,"about_ca_system_score_codex":0.000044340988,"about_ca_system_score_gemma":0.00022007897,"threshold_uncertainty_score":0.6203242},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Invariant (physics); Computer science; Invariant polynomial; Finite type invariant; Mathematics; Mathematical analysis","score_opus":0.025849491358337078,"score_gpt":0.2523502179027812,"score_spread":0.22650072654444414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981525483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009732484,0.00049277255,0.9853384,0.0005380971,0.0015526658,0.0005378175,9.24854e-7,0.00026790384,0.0015389665],"genre_scores_gemma":[0.8117767,0.0000076103825,0.18775801,0.00007454101,0.00022241333,0.000042548796,0.000003401599,0.000010330621,0.000104466555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701494,0.00015268866,0.00060485833,0.0006308353,0.0007259328,0.0008707504],"domain_scores_gemma":[0.99799186,0.00015069963,0.00033761447,0.0007895798,0.0003020716,0.00042819328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032386386,0.00024645735,0.0003131454,0.00046963806,0.00080823444,0.00071502,0.0011440978,0.000105456566,0.000009719186],"category_scores_gemma":[0.00013952095,0.00020996,0.000087143155,0.0019314082,0.0005569657,0.0030315383,0.0008366534,0.00023958612,0.00007352672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030584006,0.00024880614,0.011637234,0.000036616428,0.000024885469,0.00000480515,0.002091746,0.00004960691,0.0008973063,0.8750827,0.00028799617,0.10963524],"study_design_scores_gemma":[0.005155612,0.0028923543,0.28210905,0.00039119928,0.00034218194,0.0027095824,0.0031971326,0.36339307,0.009831193,0.07767099,0.24682671,0.005480914],"about_ca_topic_score_codex":0.0001704454,"about_ca_topic_score_gemma":0.000014003225,"teacher_disagreement_score":0.8020442,"about_ca_system_score_codex":0.00008718207,"about_ca_system_score_gemma":0.00035418244,"threshold_uncertainty_score":0.856192},"labels":[],"label_agreement":null},{"id":"W1983109102","doi":"10.1016/j.scico.2007.04.001","title":"Reasoning about safety properties in a JVM-like environment","year":2007,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Bytecode; Computer science; Programming language; Overhead (engineering); Event (particle physics); Java","score_opus":0.018036515301800955,"score_gpt":0.24792762288091727,"score_spread":0.22989110757911632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983109102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14711878,0.0002044583,0.85133106,0.0001339074,0.0004936244,0.00025848325,1.2233646e-7,0.000112632144,0.00034691227],"genre_scores_gemma":[0.6301906,0.0000065286367,0.36967805,0.00005566782,0.00005166317,0.0000044443154,2.6507897e-7,0.000004194718,0.000008571635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973377,0.000045171062,0.0005819962,0.00063001626,0.00073488604,0.000670234],"domain_scores_gemma":[0.9988597,0.00007948304,0.00022347456,0.0006033268,0.0000985133,0.00013551745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037750704,0.0001567117,0.00020537176,0.0003963156,0.0003118422,0.0002579275,0.0017170535,0.000050325805,0.000002649079],"category_scores_gemma":[0.000040562772,0.00014747208,0.00005838934,0.0013402344,0.0005310843,0.0008998191,0.000693063,0.00019225883,0.000009378742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010454385,0.00017656917,0.0036629764,0.000036459358,0.000004451532,0.000010523402,0.006002218,0.0024523046,0.0018635907,0.03707527,0.0000059606286,0.94869924],"study_design_scores_gemma":[0.00089124567,0.00034740032,0.078841016,0.0006891123,0.000005267114,0.00007797478,0.0004820938,0.8764012,0.023139847,0.00122478,0.017108072,0.00079202274],"about_ca_topic_score_codex":0.000044081782,"about_ca_topic_score_gemma":0.000005960324,"teacher_disagreement_score":0.9479072,"about_ca_system_score_codex":0.00015840534,"about_ca_system_score_gemma":0.00016061541,"threshold_uncertainty_score":0.60137373},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018849874148131957,"score_gpt":0.27851848124175,"score_spread":0.25966860709361805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988680012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28585747,0.000044027856,0.7131042,0.000099584,0.00036206993,0.00021853429,6.765274e-7,0.00014631997,0.00016710257],"genre_scores_gemma":[0.5132179,9.278012e-7,0.4867338,0.00001440269,0.00001839849,0.000007925004,0.0000013812665,0.0000035362896,0.0000016971161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974989,0.00008863413,0.00059154106,0.00059496413,0.00068224623,0.0005436781],"domain_scores_gemma":[0.99887794,0.000055385262,0.00017418909,0.0006332677,0.00017050792,0.00008872696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381606,0.00016102195,0.00023512404,0.0003708929,0.00015251045,0.00028326293,0.0017995603,0.00005001948,0.0000012225835],"category_scores_gemma":[0.000042378793,0.00015900072,0.000051537594,0.001523609,0.00057170604,0.0011384713,0.0004438938,0.00015190733,0.000004145785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059014233,0.00038640082,0.0011280768,0.000055276767,0.000004578431,0.0000066068396,0.00073944445,0.07051924,0.017998891,0.3753293,0.00005443497,0.5337719],"study_design_scores_gemma":[0.0002549192,0.00007806559,0.0007444192,0.000062165134,0.0000010232794,0.000011810948,0.00002585842,0.98690146,0.009056765,0.0024687068,0.00021227228,0.00018250622],"about_ca_topic_score_codex":0.0003035242,"about_ca_topic_score_gemma":0.000006924419,"teacher_disagreement_score":0.91638225,"about_ca_system_score_codex":0.00012580551,"about_ca_system_score_gemma":0.00016411053,"threshold_uncertainty_score":0.6483861},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016308934371584573,"score_gpt":0.28788989181511715,"score_spread":0.27158095744353256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993807037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029666897,0.000036477595,0.9693378,0.00015882366,0.00015797977,0.00041986865,5.676035e-7,0.00022089154,6.804322e-7],"genre_scores_gemma":[0.24142256,0.000006885696,0.75843143,0.00003296831,0.000056255078,0.000031078267,0.0000047581952,0.0000065900986,0.0000074442933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984547,0.00001551912,0.00023958876,0.00045823824,0.00050599995,0.00032594585],"domain_scores_gemma":[0.99911916,0.000105955485,0.00008243983,0.00037389397,0.00017163981,0.0001468984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987828,0.00012015469,0.00012073293,0.00028188853,0.00016496329,0.0003357754,0.0006298761,0.00003102428,0.0000013128027],"category_scores_gemma":[0.0001813833,0.00012508676,0.000026071613,0.0005938763,0.00010642106,0.002405863,0.00012200318,0.000051552386,0.0000017137171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073399524,0.0002010363,0.00096735446,0.0000852444,0.000009280222,0.0000022187392,0.003924268,0.028115604,0.0037574489,0.04866091,0.00017963098,0.9140897],"study_design_scores_gemma":[0.0008300984,0.0017929407,0.015564518,0.000110810135,0.0000094843745,0.00001930232,0.00006349254,0.955253,0.014354847,0.0038701699,0.0075838403,0.0005474871],"about_ca_topic_score_codex":0.000003854023,"about_ca_topic_score_gemma":1.9430607e-7,"teacher_disagreement_score":0.92713743,"about_ca_system_score_codex":0.000064210144,"about_ca_system_score_gemma":0.00007192269,"threshold_uncertainty_score":0.51008904},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013313281107449868,"score_gpt":0.28131381459550436,"score_spread":0.26800053348805447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998099342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1949429,0.0000390734,0.80404866,0.0001484046,0.00039772707,0.00016145925,2.4036322e-7,0.00012382788,0.00013773062],"genre_scores_gemma":[0.5332737,2.9001473e-7,0.46668386,0.000005156138,0.000022401038,0.0000075379776,7.4825e-8,0.000004119042,0.0000028512643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978829,0.000028549697,0.00031179425,0.00033239945,0.0009899229,0.00045441077],"domain_scores_gemma":[0.9976844,0.0008787921,0.00012476605,0.00091970904,0.00027027758,0.000122022335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002214793,0.00010915243,0.00017567749,0.00022148169,0.00023864521,0.00020639971,0.0029938256,0.000039122,0.0000067076257],"category_scores_gemma":[0.0008753757,0.00007435737,0.00006686894,0.0014156449,0.00079423515,0.00050225295,0.0011483774,0.0003388288,0.000007990408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012928567,0.00009545049,0.0024588045,0.000066410845,0.00000961068,0.000004606636,0.0030896089,0.0009414899,0.04945133,0.67976135,0.000029679755,0.26409033],"study_design_scores_gemma":[0.00044639249,0.00032676326,0.009743185,0.00048053946,0.000012141976,0.0001012883,0.00019786858,0.6926507,0.2726187,0.021485971,0.0014234883,0.0005129347],"about_ca_topic_score_codex":0.0000059729227,"about_ca_topic_score_gemma":6.180705e-7,"teacher_disagreement_score":0.6917092,"about_ca_system_score_codex":0.000011382468,"about_ca_system_score_gemma":0.00020228104,"threshold_uncertainty_score":0.55633223},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023565562074078582,"score_gpt":0.24489961451743786,"score_spread":0.22133405244335927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998844879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04569106,0.00017441783,0.949744,0.00011294845,0.0008598165,0.00057479565,3.0624258e-7,0.00026889553,0.0025737989],"genre_scores_gemma":[0.90275854,0.0000033195397,0.09686108,0.000027367681,0.00013520464,0.000029999386,0.000002015827,0.000008364036,0.00017412867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687815,0.00006122265,0.00059311045,0.00067194295,0.0011203755,0.0006752077],"domain_scores_gemma":[0.9983214,0.000042907763,0.00026961122,0.0007483015,0.00041406072,0.00020368201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013215183,0.00020973677,0.00035210387,0.00026097358,0.00023349604,0.000288485,0.0017899234,0.00007178738,0.000033013326],"category_scores_gemma":[0.00001803749,0.00017464839,0.00017145707,0.0021641317,0.0009508932,0.000917448,0.00031827838,0.00013683437,0.00003797246],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061170917,0.000221613,0.00069070095,0.000045631405,0.00001276815,0.0000046596524,0.0006935864,0.00020439591,0.00040629078,0.1241865,0.00003303281,0.8734947],"study_design_scores_gemma":[0.004768399,0.0074872347,0.021220358,0.00032598854,0.00009370104,0.00076744,0.0004555147,0.71627575,0.028293056,0.041490633,0.17576218,0.003059761],"about_ca_topic_score_codex":0.000105024556,"about_ca_topic_score_gemma":0.0000057685183,"teacher_disagreement_score":0.87043494,"about_ca_system_score_codex":0.000045537,"about_ca_system_score_gemma":0.00031958625,"threshold_uncertainty_score":0.71219546},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04910834378222158,"score_gpt":0.3630185884685466,"score_spread":0.31391024468632506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999284448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2771038,0.0005898003,0.7214446,0.0000759932,0.0004469622,0.00012331811,4.0915788e-7,0.0002010384,0.0000140615075],"genre_scores_gemma":[0.60138893,0.000004979916,0.39847082,0.000009867815,0.00011326465,0.0000024336164,8.481983e-7,0.0000066150474,0.0000022244606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973766,0.00004183822,0.00028160127,0.0006101974,0.00079364586,0.0008960768],"domain_scores_gemma":[0.99788797,0.00032680715,0.000104503626,0.0012073551,0.00017599022,0.00029740197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037261161,0.00015105991,0.00019806983,0.0004509656,0.0002759179,0.0006422727,0.0030705235,0.000036666414,0.0000013328438],"category_scores_gemma":[0.00044038016,0.00014450566,0.000027629374,0.0019369451,0.0003977547,0.0043800785,0.0036186702,0.0001866835,0.0000047108715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.890531e-7,0.000059619426,0.115407944,0.00006410462,0.00001170715,0.0000033238823,0.0018097094,0.00014813316,0.0033327881,0.0051358296,0.000021209808,0.8740047],"study_design_scores_gemma":[0.00036502935,0.0001756012,0.2234564,0.00030884848,0.000014940641,0.000076609875,0.00011831887,0.75999105,0.01002158,0.00023265417,0.004530983,0.0007079981],"about_ca_topic_score_codex":0.000023963616,"about_ca_topic_score_gemma":6.147983e-7,"teacher_disagreement_score":0.87329674,"about_ca_system_score_codex":0.00004417065,"about_ca_system_score_gemma":0.0001192159,"threshold_uncertainty_score":0.61934507},"labels":[],"label_agreement":null},{"id":"W2000579079","doi":"10.1016/s0167-6423(99)00046-5","title":"A calculus of program adaptation and its applications","year":2000,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software engineering; Software development; Programming language; Reuse; Component-based software engineering; Software construction; Adaptation (eye); Software","score_opus":0.02702946033575281,"score_gpt":0.29345959545317046,"score_spread":0.26643013511741764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000579079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037923366,0.00016907511,0.9590505,0.00008235716,0.000037229922,0.0005536832,4.5908897e-7,0.0020097988,0.00017355767],"genre_scores_gemma":[0.4911479,0.000004366489,0.5087666,0.000009120067,0.00001208496,0.000051909872,2.8168515e-7,0.0000022591776,0.0000055018895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882287,0.000019959838,0.0002465857,0.00033581702,0.00034402075,0.00023074356],"domain_scores_gemma":[0.9991531,0.00008678871,0.00011895681,0.0003256551,0.00023423454,0.00008128429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054486515,0.00008746323,0.00013540954,0.00016401205,0.00013471395,0.00011190968,0.00073937804,0.000027460577,0.0000015235513],"category_scores_gemma":[0.000034732788,0.00008090057,0.000030397125,0.0012170253,0.00030809562,0.00045719024,0.00015879002,0.000057832523,0.0000018740847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6217244e-7,0.00007215484,0.000080362726,0.000024981768,0.0000016377112,3.768977e-7,0.00045971738,0.0000949735,0.00011801603,0.007725982,0.0000112433645,0.9914097],"study_design_scores_gemma":[0.00013858665,0.00042344496,0.0010952171,0.00010007539,0.000005173552,0.000028538047,0.000006890581,0.9864919,0.0037170325,0.005952259,0.0018814446,0.00015944488],"about_ca_topic_score_codex":0.000026638147,"about_ca_topic_score_gemma":6.457424e-7,"teacher_disagreement_score":0.9912503,"about_ca_system_score_codex":0.0000127596695,"about_ca_system_score_gemma":0.00010701999,"threshold_uncertainty_score":0.32990295},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015384043051828328,"score_gpt":0.307715587988258,"score_spread":0.29233154493642965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001616837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112960026,0.000005783779,0.8843014,0.00015581604,0.0019350937,0.00030786454,4.3455907e-7,0.00012547447,0.00020807557],"genre_scores_gemma":[0.3381594,2.1137785e-7,0.6616664,0.00003266135,0.00010138093,0.00002485245,2.5539808e-7,0.0000044717435,0.000010356576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825215,0.000022409491,0.00032068937,0.0004832042,0.00047440408,0.00044716522],"domain_scores_gemma":[0.99859786,0.00007722243,0.00021673916,0.00065850327,0.00032023995,0.00012940986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028267887,0.00012058626,0.00015153167,0.0002588718,0.00021789123,0.00036112455,0.0026838996,0.00004889132,0.0000019502777],"category_scores_gemma":[0.00011788054,0.000109927474,0.00007995932,0.00089260476,0.0006429153,0.0012857548,0.0005265772,0.00018045337,0.000005082652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033891954,0.000036723013,0.00009669735,0.000019992163,0.0000025801064,4.5562325e-7,0.0008620637,0.000021634885,0.038134977,0.34968445,0.00001759538,0.61111945],"study_design_scores_gemma":[0.0005844565,0.0005593413,0.0034087754,0.00007770328,0.000004848884,0.00008755548,0.000059661263,0.75429386,0.18997654,0.030052774,0.020439234,0.0004552258],"about_ca_topic_score_codex":0.000011478088,"about_ca_topic_score_gemma":0.0000018221983,"teacher_disagreement_score":0.7542722,"about_ca_system_score_codex":0.00002673017,"about_ca_system_score_gemma":0.00013973245,"threshold_uncertainty_score":0.49873978},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021875530628325264,"score_gpt":0.27021220554312075,"score_spread":0.2483366749147955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003852722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004777877,0.0004694303,0.9907817,0.00096985523,0.0008657376,0.00032368168,7.748775e-8,0.00015056763,0.0016610663],"genre_scores_gemma":[0.85879564,0.0000062823747,0.14098898,0.00009194084,0.00007877639,0.0000047172116,1.8897147e-7,0.0000034798798,0.000030011035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749047,0.000077597695,0.00050829,0.00046067612,0.00085006625,0.0006128975],"domain_scores_gemma":[0.9981565,0.00012368467,0.00041549638,0.0008182391,0.00036794943,0.000118127005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022553916,0.00016313004,0.0002656348,0.000173257,0.000538422,0.00054448325,0.0028152748,0.000048401747,8.6978275e-7],"category_scores_gemma":[0.000062391584,0.00010451289,0.00012143559,0.001629203,0.0008645515,0.00072353665,0.00036709235,0.00012905276,0.0000042089546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014979729,0.00004802473,0.000110745365,0.000009781002,0.00000384903,0.0000024469343,0.00042039918,0.000046839876,0.00092142023,0.396355,0.000042831576,0.6020372],"study_design_scores_gemma":[0.0018770898,0.0052909194,0.01921295,0.00021050787,0.000050801216,0.00027346637,0.00068524166,0.25377327,0.07049117,0.55468756,0.09164733,0.0017996663],"about_ca_topic_score_codex":0.000023742161,"about_ca_topic_score_gemma":0.0000027413942,"teacher_disagreement_score":0.85401773,"about_ca_system_score_codex":0.00003564957,"about_ca_system_score_gemma":0.00020367537,"threshold_uncertainty_score":0.5250464},"labels":[],"label_agreement":null},{"id":"W2009853803","doi":"10.1016/j.scico.2010.12.001","title":"Partial evaluation of Maple","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Maple; Computer science; Partial evaluation; Code (set theory); Programming language","score_opus":0.02531060812568823,"score_gpt":0.30938040908148295,"score_spread":0.2840698009557947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009853803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21349587,0.000020623962,0.7849855,0.000037949805,0.0010037022,0.0002060747,0.000001245116,0.00004247959,0.00020655313],"genre_scores_gemma":[0.5503059,2.3388024e-7,0.4496237,0.0000043330037,0.000053438198,0.000007960227,6.274313e-7,0.0000017663635,0.0000020055888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980069,0.000038197286,0.00030984715,0.00032953187,0.0010557908,0.00025977005],"domain_scores_gemma":[0.9983324,0.00003527823,0.00023194209,0.00064617925,0.000675803,0.00007843154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028839489,0.00008416607,0.0001515119,0.00015390683,0.00011808087,0.000054910342,0.0007960538,0.000025528418,0.000006371974],"category_scores_gemma":[0.00009344943,0.000072301715,0.000044269316,0.0008128041,0.0005219055,0.0011906569,0.0003814692,0.00009111328,0.000003309975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013785387,0.00004830956,0.00036783406,0.000018870727,0.000002893451,4.5133748e-7,0.00048444772,0.000338744,0.03705556,0.22026971,0.000013182881,0.74139863],"study_design_scores_gemma":[0.0006373666,0.00027532826,0.004934134,0.00008668078,0.000014429893,0.000029591354,0.000058177786,0.7244889,0.24590589,0.0034197946,0.019835941,0.00031377366],"about_ca_topic_score_codex":0.000025560277,"about_ca_topic_score_gemma":0.0000103854345,"teacher_disagreement_score":0.7410848,"about_ca_system_score_codex":0.000012947532,"about_ca_system_score_gemma":0.00032761446,"threshold_uncertainty_score":0.29483783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030412298134177517,"score_gpt":0.3042638866127702,"score_spread":0.2738515884785927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010487855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09358705,0.0003554356,0.9016948,0.00009111289,0.0025812958,0.001543181,0.0000028198003,0.00012953134,0.000014816969],"genre_scores_gemma":[0.65493846,0.0000012157211,0.34476867,0.000016543445,0.0001486443,0.00010941966,0.000001676322,0.0000087955395,0.000006565029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690396,0.00008054664,0.0007212639,0.00076869235,0.000817512,0.0007080022],"domain_scores_gemma":[0.99771345,0.00010909422,0.00045310875,0.0007318175,0.0008166207,0.00017593378],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017563938,0.0002272612,0.00037690037,0.00035328785,0.00040999937,0.0010758599,0.0017744033,0.00006532873,0.0000010479911],"category_scores_gemma":[0.00004885227,0.00019972009,0.00012142304,0.001044192,0.00029582556,0.002035341,0.00030957247,0.00009660363,0.000005730999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004187314,0.00014559332,0.00062291895,0.00028683813,0.00004785753,0.0000023315094,0.0013587128,0.26123995,0.08619413,0.04522664,0.000093951305,0.6047769],"study_design_scores_gemma":[0.0004441077,0.00016247481,0.0000758876,0.00013867328,0.000008936491,0.000024022296,0.000031270367,0.9977212,0.0006625975,0.0003909152,0.000103812665,0.00023608858],"about_ca_topic_score_codex":0.00009073566,"about_ca_topic_score_gemma":0.0000020283435,"teacher_disagreement_score":0.73648125,"about_ca_system_score_codex":0.0001963557,"about_ca_system_score_gemma":0.00032721722,"threshold_uncertainty_score":0.99996114},"labels":[],"label_agreement":null},{"id":"W2013611163","doi":"10.1016/j.scico.2004.10.006","title":"A Product Line engineering practices model","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Product line; Product (mathematics); New product development; Line (geometry); Domain engineering; Product engineering; Work (physics); Software engineering; Systems engineering; Product design; Manufacturing engineering; Software development; Programming language; Management; Engineering; Mechanical engineering","score_opus":0.053828498379622204,"score_gpt":0.3304260050909633,"score_spread":0.2765975067113411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013611163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013622704,0.00022320036,0.9842673,0.0005228531,0.00040541118,0.00020469635,2.4317217e-7,0.0007284385,0.000025185793],"genre_scores_gemma":[0.25695246,0.000005130863,0.7428271,0.000024845232,0.00015327119,0.00001323788,1.7221072e-7,0.000008874616,0.0000148959425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978712,0.000025383964,0.00033285204,0.0006313971,0.0005790069,0.0005601477],"domain_scores_gemma":[0.99823,0.00027990428,0.00034093694,0.0007663846,0.00026058877,0.00012217907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001870387,0.00018655832,0.00023020041,0.000336229,0.000119996286,0.00021931659,0.0019880908,0.00003149387,4.6226262e-7],"category_scores_gemma":[0.0012472881,0.00017397854,0.000057628706,0.0013678629,0.00020558067,0.0027640176,0.0007254844,0.00020287388,0.000004645131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.165072e-7,0.000028174112,0.0000122061,0.000019996443,0.0000031179077,0.0000010955422,0.0003358556,0.63649327,0.005052097,0.0051220683,0.0000054777433,0.35292575],"study_design_scores_gemma":[0.00009477718,0.000075696895,0.000073735486,0.000037971753,0.0000029408818,0.000022551145,0.0000044414055,0.9673541,0.030297086,0.0007837805,0.0010512846,0.00020162026],"about_ca_topic_score_codex":0.0000023766693,"about_ca_topic_score_gemma":4.5678715e-7,"teacher_disagreement_score":0.3527241,"about_ca_system_score_codex":0.00007973188,"about_ca_system_score_gemma":0.00022134997,"threshold_uncertainty_score":0.7094639},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04999646401566613,"score_gpt":0.27011970693159176,"score_spread":0.22012324291592564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020217406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3456519,0.00026323134,0.6527997,0.00004031911,0.00044115062,0.0004668611,8.4839206e-7,0.00027496114,0.000061012397],"genre_scores_gemma":[0.6155495,0.000009457901,0.38423362,0.000019799932,0.000099182886,0.000029637804,0.0000030962512,0.000013998943,0.0000417007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963578,0.00007067139,0.0005646703,0.0011182682,0.0010407619,0.00084784173],"domain_scores_gemma":[0.99800384,0.00010734966,0.00053506944,0.00068539014,0.00036670276,0.00030163207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092258287,0.000354115,0.0004207048,0.0003261865,0.0007893138,0.0005633767,0.0011611158,0.000098897144,0.0000028077282],"category_scores_gemma":[0.000043627722,0.00028629656,0.0000841374,0.0014004529,0.0010096814,0.0017534357,0.0004896939,0.00025493655,0.0000067702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020571204,0.0003764128,0.034668535,0.000117262935,0.000051132018,0.00011679153,0.007265046,0.0007590179,0.004572978,0.006804807,0.00001569976,0.94523174],"study_design_scores_gemma":[0.0037637895,0.0030283085,0.13379885,0.00019997351,0.00007221814,0.0007118715,0.0019043788,0.816987,0.01513302,0.00078591367,0.021151617,0.002463088],"about_ca_topic_score_codex":0.0007141374,"about_ca_topic_score_gemma":0.000087358145,"teacher_disagreement_score":0.94276863,"about_ca_system_score_codex":0.00009360626,"about_ca_system_score_gemma":0.0002781819,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W2020345512","doi":"10.1016/j.scico.2012.02.001","title":"Executable formal specifications of complex distributed systems with CoreASM","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Defence Research and Development Canada","funders":"","keywords":"Executable; Computer science; Programming language; Software engineering; Formal methods; Extensibility; Formal verification; Formal specification; Software system; Software","score_opus":0.07390001709856975,"score_gpt":0.2975262949599616,"score_spread":0.22362627786139183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020345512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030953385,0.000059084523,0.96757305,0.000045183013,0.00048700214,0.00040249436,0.0000060092875,0.00010412568,0.000369668],"genre_scores_gemma":[0.50863254,9.515597e-7,0.4912973,0.000003248527,0.00003849639,0.000015596554,0.0000040212108,0.0000036081094,0.0000042423694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977645,0.00006686863,0.0004281097,0.00031098607,0.0007653244,0.0006641763],"domain_scores_gemma":[0.9978926,0.00006412158,0.00047557146,0.00084334135,0.00053510367,0.00018923008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019529238,0.00014567864,0.00025931004,0.00024338222,0.00024683983,0.00017449343,0.001657886,0.00003707841,0.0000018142536],"category_scores_gemma":[0.000037303704,0.00011928551,0.000045859942,0.0021508879,0.00079356815,0.002966402,0.0003710727,0.00009605063,0.000004700816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015898577,0.0004165533,0.0074059563,0.00015606376,0.000021811073,6.8802836e-7,0.0015837393,0.0039754203,0.0074274978,0.8154614,0.00011369779,0.16342129],"study_design_scores_gemma":[0.0004790114,0.00048388285,0.10110867,0.00017342219,0.000019867486,0.00013115695,0.00030464082,0.8714396,0.016298529,0.0002586034,0.008855494,0.00044714415],"about_ca_topic_score_codex":0.000031809803,"about_ca_topic_score_gemma":3.9049047e-7,"teacher_disagreement_score":0.8674642,"about_ca_system_score_codex":0.0000696164,"about_ca_system_score_gemma":0.00013460702,"threshold_uncertainty_score":0.4864322},"labels":[],"label_agreement":null},{"id":"W202396775","doi":"10.1016/j.scico.2006.02.001","title":"Introduction to the special issue on software analysis, evolution and reengineering","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Business process reengineering; Computer science; Software engineering; Reverse engineering; Software evolution; Software system; Software; Software development; Component (thermodynamics); Legacy system; Component-based software engineering; Software construction; Systems engineering; Programming language; Engineering; Manufacturing engineering","score_opus":0.005930556694977833,"score_gpt":0.23681208914462343,"score_spread":0.2308815324496456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202396775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043868918,0.000034376942,0.95353043,0.0013659725,0.0007895856,0.00021683605,4.071672e-7,0.00017846638,0.000014994152],"genre_scores_gemma":[0.5337447,7.0535134e-7,0.45970547,0.000016961196,0.0064663845,0.000014760559,0.0000010566921,0.0000067354263,0.000043207576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809116,0.000024129482,0.00020428652,0.00053133065,0.00074786955,0.00040122404],"domain_scores_gemma":[0.99894553,0.0001269324,0.000051508367,0.00060029957,0.00018495569,0.000090750844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131654,0.000118818076,0.00014903705,0.0007399052,0.00023047699,0.00035622044,0.0009940547,0.000026504611,0.0000032860432],"category_scores_gemma":[0.00020359301,0.000094557785,0.000049797432,0.004645583,0.00016178298,0.00042783775,0.00040290883,0.0001351554,0.000013143574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055258383,0.00005900933,0.0060511716,0.000023940203,0.000029296101,0.0000032114076,0.00042636684,0.36127675,0.00040185166,0.016528022,0.0030294752,0.6121654],"study_design_scores_gemma":[0.00024385224,0.00055033184,0.36121276,0.000053374813,0.000036012036,0.00002449091,0.000025631443,0.5655143,0.003648682,0.00054723176,0.067658566,0.0004847345],"about_ca_topic_score_codex":0.00005917105,"about_ca_topic_score_gemma":0.000010167093,"teacher_disagreement_score":0.6116806,"about_ca_system_score_codex":0.00011260129,"about_ca_system_score_gemma":0.000056564142,"threshold_uncertainty_score":0.38559547},"labels":[],"label_agreement":null},{"id":"W2026881319","doi":"10.1016/j.scico.2009.05.003","title":"Experience of building an architecture-based generator using GenVoca for distributed systems","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Architecture; Generator (circuit theory); Computer architecture; Power (physics)","score_opus":0.05158484322867527,"score_gpt":0.3394637415726975,"score_spread":0.2878788983440222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026881319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17692357,0.000112997164,0.8217563,0.000021143367,0.00056033797,0.00038706762,0.0000037125549,0.00023434387,5.019861e-7],"genre_scores_gemma":[0.4605334,2.3790595e-7,0.5393895,0.000010432841,0.000049536073,0.000010790396,9.5080605e-7,0.000004993695,1.553162e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976766,0.00007780037,0.0004852682,0.0006311958,0.0005397308,0.00058938935],"domain_scores_gemma":[0.9980817,0.0002765913,0.0003204391,0.0007611827,0.00040539156,0.00015469381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337664,0.0002111314,0.00037262985,0.00033327163,0.00021253701,0.00020390505,0.001947045,0.000055109882,1.1935002e-7],"category_scores_gemma":[0.00028663984,0.00019613834,0.000089516274,0.0014140438,0.0004055832,0.0008379122,0.00017285185,0.00009801869,4.511436e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006002982,0.000045374003,0.000038415867,0.000043373497,0.0000026514358,0.0000013497314,0.00041629904,0.75532734,0.10123907,0.0067210617,4.6232645e-7,0.13615859],"study_design_scores_gemma":[0.00022168839,0.00049285847,0.00017700209,0.00010020523,0.000004362973,0.000011752684,0.000032551732,0.8715133,0.12567146,0.0014713226,0.00007224231,0.00023122045],"about_ca_topic_score_codex":0.000009750721,"about_ca_topic_score_gemma":1.7740663e-7,"teacher_disagreement_score":0.28360984,"about_ca_system_score_codex":0.00008126601,"about_ca_system_score_gemma":0.00024234841,"threshold_uncertainty_score":0.79982895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028545791845395536,"score_gpt":0.30145087634000595,"score_spread":0.27290508449461043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027110574","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09148491,0.000027029408,0.9076743,0.000063568135,0.00039642898,0.00012864203,2.4069422e-7,0.00017867939,0.00004619616],"genre_scores_gemma":[0.39686966,0.0000032064265,0.60308605,0.000012556626,0.000015497362,0.000003899732,1.03034104e-7,0.0000037986777,0.0000052304194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832845,0.000036026988,0.0002881952,0.00033876684,0.00055600435,0.00045254524],"domain_scores_gemma":[0.9986174,0.00032558714,0.00016906294,0.0006468934,0.00015184219,0.00008919464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084094,0.00012773939,0.00021801914,0.00024957387,0.0001271786,0.000054130825,0.0015546314,0.00003626994,0.0000020588225],"category_scores_gemma":[0.00030315385,0.00011020658,0.00006367779,0.001366896,0.00039420516,0.00093212,0.0008116866,0.000118211894,0.0000026637692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007973579,0.0001283701,0.00047192653,0.000040252533,0.0000070664755,0.000014839587,0.0008994206,0.19577871,0.010619246,0.057295386,0.000028667264,0.73470813],"study_design_scores_gemma":[0.0013494692,0.0027146367,0.008285216,0.00096989365,0.000020294088,0.00013538633,0.00014873338,0.68557155,0.20123272,0.094616376,0.0036600416,0.0012956836],"about_ca_topic_score_codex":0.0000039166716,"about_ca_topic_score_gemma":3.26946e-7,"teacher_disagreement_score":0.73341244,"about_ca_system_score_codex":0.000024546916,"about_ca_system_score_gemma":0.00006963765,"threshold_uncertainty_score":0.4494094},"labels":[],"label_agreement":null},{"id":"W2027534015","doi":"10.1016/j.scico.2011.06.004","title":"Parallel execution of Java loops on Graphics Processing Units","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Just-in-time compilation; Speedup; Parallel computing; Control flow; Java bytecode; Java; Compiler; Graphics; Bytecode; Optimizing compiler; Programming language; CUDA; General-purpose computing on graphics processing units; Operating system; Real time Java; Java annotation","score_opus":0.04446778688000051,"score_gpt":0.2719287597999689,"score_spread":0.22746097291996836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027534015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02046305,0.000057306635,0.9776225,0.00003862818,0.00018617496,0.00021541813,3.113101e-7,0.00031815632,0.0010984635],"genre_scores_gemma":[0.5126372,0.0000051223324,0.48729646,0.00003254042,0.000014549725,0.00000420602,4.7647873e-7,0.000004268928,0.000005194714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979582,0.000057971243,0.000454972,0.00048706273,0.00064717204,0.00039464515],"domain_scores_gemma":[0.99807703,0.000037171532,0.00042273506,0.00054313533,0.0008097311,0.000110176785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011130531,0.00016801561,0.00023564334,0.00056269695,0.00023554696,0.000116003655,0.0017607233,0.000061426996,0.0000012016205],"category_scores_gemma":[0.0000479762,0.00015287515,0.00005847271,0.0031222918,0.00061947864,0.0007690531,0.00037942853,0.0001409834,0.0000017648206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019470433,0.00037938938,0.0009659503,0.00010334904,0.000010776976,0.0000050882986,0.0049309894,0.004653145,0.0005179797,0.20941743,0.000085132946,0.7789113],"study_design_scores_gemma":[0.00043159167,0.0012258103,0.004384504,0.0005006205,0.000009863719,0.000022331918,0.000060701204,0.93925554,0.043814097,0.0094591575,0.0003652824,0.00047050646],"about_ca_topic_score_codex":0.000029946448,"about_ca_topic_score_gemma":6.915682e-7,"teacher_disagreement_score":0.9346024,"about_ca_system_score_codex":0.000024508929,"about_ca_system_score_gemma":0.0002813659,"threshold_uncertainty_score":0.62340677},"labels":[],"label_agreement":null},{"id":"W2030003063","doi":"10.1016/j.scico.2009.09.008","title":"An architecture for generic extensions","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Component (thermodynamics); Variety (cybernetics); Generic programming; Programming language; Interface (matter); Extension (predicate logic); Overhead (engineering); Architecture; Hierarchy; Software; Independence (probability theory); Code (set theory); Range (aeronautics); Software engineering; Operating system; Artificial intelligence; Set (abstract data type)","score_opus":0.024563760399068366,"score_gpt":0.27921587922234226,"score_spread":0.2546521188232739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030003063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010261032,0.00011738365,0.9874495,0.000420671,0.0007228214,0.0005842829,3.2425382e-7,0.0002951366,0.00014881424],"genre_scores_gemma":[0.5694615,8.56055e-7,0.43021458,0.00013797994,0.00015545018,0.000014173807,0.0000012611131,0.000004307582,0.000009848138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976469,0.00004501621,0.00034789223,0.0007289565,0.0005408646,0.00069036044],"domain_scores_gemma":[0.9982355,0.00004879126,0.00019579615,0.00089191593,0.0003733461,0.00025464562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010957269,0.000192108,0.00026725323,0.00030295475,0.00042483644,0.00050127006,0.0022146015,0.00005986051,8.559429e-7],"category_scores_gemma":[0.00003221659,0.00015377709,0.0001248073,0.0013194474,0.00031064605,0.0007984223,0.0001607932,0.00010741798,0.00000383331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002716219,0.000121000594,0.00004627681,0.000011907799,0.000003023232,0.0000028738762,0.00069433276,0.00052194356,0.004682595,0.18168357,0.00004712346,0.8121826],"study_design_scores_gemma":[0.0015911071,0.008265558,0.0073387157,0.00005590365,0.00003410836,0.0002983843,0.00016835774,0.64263225,0.020972412,0.24987337,0.06719883,0.00157103],"about_ca_topic_score_codex":0.000012140987,"about_ca_topic_score_gemma":0.0000031168315,"teacher_disagreement_score":0.8106116,"about_ca_system_score_codex":0.000030319416,"about_ca_system_score_gemma":0.00020312332,"threshold_uncertainty_score":0.6270848},"labels":[],"label_agreement":null},{"id":"W2035868375","doi":"10.1016/j.scico.2014.10.008","title":"Model checking of concurrent programs with static analysis of field accesses","year":2014,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Thread (computing); Heap (data structure); Tree traversal; Partial order reduction; Programming language; Java; Static analysis; Model checking; Distributed computing","score_opus":0.04364811075380737,"score_gpt":0.3294716491577327,"score_spread":0.2858235384039253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035868375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16029218,0.000012618232,0.8392485,0.000028264172,0.00010043765,0.00019519163,3.725531e-7,0.0000394861,0.00008297685],"genre_scores_gemma":[0.50355387,0.0000011511636,0.49642125,0.00000806641,0.0000049966784,0.0000071029517,5.9172055e-7,0.0000021816134,8.174433e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790895,0.00006474711,0.00051916746,0.00040228522,0.00079791446,0.00030692352],"domain_scores_gemma":[0.9978813,0.00012826605,0.0006533017,0.0006704257,0.0005885541,0.00007816767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017855209,0.00012788954,0.0003970178,0.0005552621,0.00007552579,0.00011832723,0.0017416499,0.00003109158,7.5486355e-7],"category_scores_gemma":[0.00010202362,0.00010169338,0.00009159253,0.004092526,0.00057306647,0.0008927738,0.0003403469,0.0000834615,1.7565237e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004296728,0.00012430406,0.00236151,0.00012963847,0.000047424626,1.5985418e-7,0.0014096007,0.030262956,0.001215269,0.053105906,7.674965e-7,0.91133815],"study_design_scores_gemma":[0.00011846965,0.00051658205,0.0012323966,0.00010451239,0.00006715858,0.0000010881137,0.000029859568,0.9580597,0.039261885,0.00047357794,0.000023834888,0.000110896224],"about_ca_topic_score_codex":0.000029890534,"about_ca_topic_score_gemma":0.0000054277366,"teacher_disagreement_score":0.9277968,"about_ca_system_score_codex":0.000020522673,"about_ca_system_score_gemma":0.0001649329,"threshold_uncertainty_score":0.4146936},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0207267550115444,"score_gpt":0.28171656020423,"score_spread":0.2609898051926856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043140003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2675374,0.000072940406,0.73095226,0.00045855675,0.00020125444,0.0005842328,6.561175e-7,0.00017322705,0.000019471026],"genre_scores_gemma":[0.48698884,0.0000025314168,0.5128692,0.000021976984,0.000041131025,0.000048691814,3.7039595e-7,0.0000063146604,0.000020978652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765193,0.00002579452,0.00023730069,0.00060483307,0.00070699526,0.00077317003],"domain_scores_gemma":[0.99806446,0.00048391902,0.00004933594,0.0005853522,0.0005552945,0.00026165208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017154632,0.00013693106,0.00019787291,0.00031764444,0.0002772511,0.0007361175,0.0016246622,0.000049270187,0.0000042079337],"category_scores_gemma":[0.00017818461,0.00012685625,0.00004630935,0.0012753456,0.0005608539,0.0013270691,0.0010644578,0.00016518995,0.0000099205745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002801006,0.00009580452,0.010026678,0.00018185136,0.000010783421,0.000001917308,0.0006559145,0.0008487935,0.0062485314,0.00839759,0.0003118396,0.9732175],"study_design_scores_gemma":[0.00049544475,0.00043537928,0.035693098,0.00007277427,0.0000028820803,0.00002411595,0.0000255133,0.92691743,0.032975767,0.001915914,0.0011191072,0.00032256404],"about_ca_topic_score_codex":0.00008079565,"about_ca_topic_score_gemma":8.2412464e-7,"teacher_disagreement_score":0.9728949,"about_ca_system_score_codex":0.000049941627,"about_ca_system_score_gemma":0.00020532904,"threshold_uncertainty_score":0.7098398},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"Computer science; Sampling (signal processing); Stratified sampling; Parallel computing; Telecommunications; Statistics","score_opus":0.04349503827909484,"score_gpt":0.3280507423000704,"score_spread":0.2845557040209756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049511237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43629074,0.00015040272,0.5627909,0.000028726268,0.00038569685,0.00018159077,6.9287546e-7,0.00013115282,0.00004014748],"genre_scores_gemma":[0.668521,0.0000031128948,0.33136916,0.0000053302,0.00008189821,0.000008209265,0.0000014159015,0.0000057866496,0.0000040647],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99725825,0.00004428214,0.00044097297,0.00042862317,0.001087482,0.0007404048],"domain_scores_gemma":[0.9982196,0.000335401,0.00021233769,0.0006603787,0.00035231927,0.00021996912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021164012,0.0001680127,0.00023067892,0.00042223625,0.00019285898,0.0002643246,0.0016861545,0.000057678135,0.0000055401056],"category_scores_gemma":[0.00027849825,0.0001638657,0.00007423529,0.0019001539,0.00036074227,0.0026640662,0.00045852887,0.00016981199,0.000004244123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012817141,0.0005240347,0.00882178,0.0002943329,0.00002799475,0.0000035497226,0.0051445616,0.004879797,0.112606384,0.038178425,0.000026936095,0.8294794],"study_design_scores_gemma":[0.0013127119,0.0015955134,0.07141316,0.0011934309,0.000036086414,0.00017412836,0.00094661955,0.29232517,0.62566715,0.0029384412,0.0010807755,0.0013168349],"about_ca_topic_score_codex":0.00006766718,"about_ca_topic_score_gemma":0.0000013095533,"teacher_disagreement_score":0.82816255,"about_ca_system_score_codex":0.000075724085,"about_ca_system_score_gemma":0.00028057926,"threshold_uncertainty_score":0.6682249},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028242315104905356,"score_gpt":0.29117152432417437,"score_spread":0.262929209219269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051051963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11344198,0.00003573459,0.8850133,0.00036138477,0.0004092407,0.0003899934,0.000002599369,0.00033461818,0.000011155368],"genre_scores_gemma":[0.22938876,9.707453e-7,0.77031857,0.00006726005,0.00018084704,0.000024460267,0.000004539439,0.000010054359,0.000004533261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976642,0.00011849969,0.0003125333,0.00069005013,0.0005974964,0.00061719876],"domain_scores_gemma":[0.99807143,0.0005711767,0.00019457386,0.00082107924,0.00016592053,0.00017582082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016118443,0.00024958813,0.00028793534,0.00025716552,0.00053888914,0.00044189696,0.0023751794,0.000092735885,7.847632e-7],"category_scores_gemma":[0.00037823833,0.00017792634,0.00006269907,0.0007482519,0.0012242964,0.0012788185,0.0009626167,0.0006674208,5.5851575e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031415138,0.000027961176,0.00072193856,0.000033520144,0.000013587836,0.0000019139777,0.0048278435,0.063405894,0.0015723064,0.0063131717,0.0000050624158,0.92307365],"study_design_scores_gemma":[0.003170962,0.0026695698,0.0668264,0.0003404015,0.00013119102,0.0018439323,0.00085691235,0.57248974,0.02387841,0.31633082,0.0072845262,0.0041771107],"about_ca_topic_score_codex":0.000011023108,"about_ca_topic_score_gemma":0.000007880103,"teacher_disagreement_score":0.91889656,"about_ca_system_score_codex":0.000023143466,"about_ca_system_score_gemma":0.00014561915,"threshold_uncertainty_score":0.7255625},"labels":[],"label_agreement":null},{"id":"W2054047340","doi":"10.1016/j.scico.2012.11.007","title":"ARV–ALA: Improving performance of software transactional memory through adaptive read and write policies","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Lakehead University","keywords":"Computer science; Transactional memory; Software transactional memory; Lock (firearm); Benchmark (surveying); Transactional leadership; Exploit; Implementation; Database transaction; Software; Distributed computing; Software engineering; Operating system; Programming language; Computer security","score_opus":0.01768339843819622,"score_gpt":0.24676671066169212,"score_spread":0.2290833122234959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054047340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32104486,0.00041842792,0.6776543,0.000046566547,0.00045205254,0.00017978875,0.000004876807,0.000066203764,0.00013291583],"genre_scores_gemma":[0.7066262,0.0000067967403,0.29323584,0.000021316231,0.000082054205,0.000008641492,6.518e-7,0.0000045198453,0.00001398522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979703,0.000032932796,0.0004116731,0.0003726826,0.00063756586,0.00057488814],"domain_scores_gemma":[0.99883676,0.00006800802,0.00029070742,0.00037384484,0.00029545763,0.00013520016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090105925,0.00017240054,0.00028968885,0.00014048287,0.00026735273,0.00012681072,0.00081158534,0.000051376202,0.000001612619],"category_scores_gemma":[0.000016714543,0.00015241066,0.000066485496,0.0008938322,0.0007414426,0.002955659,0.0002375562,0.00013133182,0.0000016321828],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013943875,0.00015902544,0.0062295008,0.0002256276,0.000018831028,9.91972e-7,0.007396237,0.00049882644,0.0025613601,0.012950338,0.000014043338,0.96993124],"study_design_scores_gemma":[0.0027984078,0.003007299,0.21747188,0.001956308,0.00007737763,0.00058528414,0.0024290618,0.6922318,0.0700038,0.0010778756,0.0060006496,0.0023602573],"about_ca_topic_score_codex":0.00013905416,"about_ca_topic_score_gemma":0.0000019157237,"teacher_disagreement_score":0.967571,"about_ca_system_score_codex":0.00003900872,"about_ca_system_score_gemma":0.00014987201,"threshold_uncertainty_score":0.62151265},"labels":[],"label_agreement":null},{"id":"W2055877289","doi":"10.1016/j.scico.2009.02.002","title":"Efficient symbolic computation of process expressions","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Operational semantics; TRACE (psycholinguistics); Process calculus; Semantics (computer science); Process (computing); Expression (computer science); Computation; Interpreter; Programming language; Theoretical computer science","score_opus":0.021882348870322272,"score_gpt":0.33725302720649564,"score_spread":0.3153706783361734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055877289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26383734,0.000031750285,0.73528504,0.00006821418,0.00026273212,0.00022566495,2.3871976e-7,0.000095201794,0.00019380575],"genre_scores_gemma":[0.5191039,3.634177e-7,0.48085827,0.000014430489,0.000016404265,0.0000037281654,2.2661095e-7,0.0000018549374,8.481541e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785316,0.00006182541,0.00047347645,0.00043130617,0.0008253533,0.0003548796],"domain_scores_gemma":[0.99843657,0.000039521197,0.00039282654,0.00049175805,0.0005292279,0.000110092704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012020397,0.00012621077,0.00021676467,0.00039035894,0.00018414679,0.00010919579,0.0015852175,0.000039184037,6.407825e-7],"category_scores_gemma":[0.00008310852,0.00011274527,0.000060936076,0.002256058,0.00041816023,0.0004994209,0.00018597538,0.00009851661,0.0000021712603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004453814,0.00027083413,0.00008902933,0.000051095223,0.0000026596572,7.296847e-7,0.003347692,0.05292209,0.016844217,0.0668941,0.000004623313,0.8595685],"study_design_scores_gemma":[0.00016165151,0.00030373014,0.0069422936,0.00015429477,0.0000032577811,0.000009464463,0.00005738309,0.92348963,0.06541202,0.0033046415,0.000022693035,0.00013895148],"about_ca_topic_score_codex":0.0000030267167,"about_ca_topic_score_gemma":5.5083817e-8,"teacher_disagreement_score":0.87056756,"about_ca_system_score_codex":0.000033499462,"about_ca_system_score_gemma":0.00019959743,"threshold_uncertainty_score":0.45976186},"labels":[],"label_agreement":null},{"id":"W2062334424","doi":"10.1016/j.scico.2013.03.007","title":"An MDE-based framework to support the development of Mixed Interactive Systems","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Model-driven architecture; Domain (mathematical analysis); Domain-specific language; Context (archaeology); Software engineering; Human–computer interaction; Unified Modeling Language; Programming language; Software","score_opus":0.016421950730908436,"score_gpt":0.2781646288934667,"score_spread":0.26174267816255825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062334424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106339894,0.0000060995876,0.89203984,0.00009800798,0.0005281523,0.0006976857,3.8942989e-7,0.00028089722,0.000009048366],"genre_scores_gemma":[0.48819274,4.824192e-8,0.51167667,0.000020831494,0.00001806416,0.000084810905,3.773368e-7,0.000005288623,0.0000012053905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775314,0.000059953014,0.0005043402,0.00048492724,0.0007600591,0.00043759582],"domain_scores_gemma":[0.9978955,0.00012244559,0.00022565149,0.0009979276,0.000573668,0.00018482018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013395532,0.00017666427,0.0002475017,0.00032444313,0.0001592103,0.00038379387,0.0031589419,0.0000504274,0.0000026827474],"category_scores_gemma":[0.000019362496,0.00013165247,0.00005098904,0.0012595211,0.00023730949,0.00092716754,0.00053641724,0.00016052826,0.000010256087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022229608,0.000120411176,0.00047512737,0.000049249153,0.000009899923,9.4280256e-7,0.005096799,0.010826458,0.0026689917,0.025422998,0.000052385018,0.9552745],"study_design_scores_gemma":[0.00014017905,0.00093400234,0.006843949,0.0005471543,0.000005033962,0.000008399066,0.00007386963,0.8983579,0.08697454,0.0007010466,0.0049404465,0.00047346644],"about_ca_topic_score_codex":0.000037196434,"about_ca_topic_score_gemma":0.0000015994555,"teacher_disagreement_score":0.954801,"about_ca_system_score_codex":0.00008834397,"about_ca_system_score_gemma":0.00038297378,"threshold_uncertainty_score":0.5870153},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015118791613079899,"score_gpt":0.3156040255252115,"score_spread":0.3004852339121316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063743474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060116933,0.00007818257,0.99253637,0.00022427873,0.0002640791,0.00044200267,4.355459e-7,0.0004302359,0.000012697377],"genre_scores_gemma":[0.4458794,3.3819876e-7,0.5540547,0.000030590145,0.000021521066,0.0000097432185,4.2304384e-7,0.0000026810321,6.210713e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986531,0.000028880018,0.00021558373,0.00044303096,0.00035436774,0.0003050469],"domain_scores_gemma":[0.9984254,0.00069868565,0.0001716058,0.00030353878,0.00034700215,0.000053733143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016788656,0.00013014536,0.00018168826,0.0003228371,0.00024600147,0.00026891197,0.0006138482,0.000048252732,8.9977426e-8],"category_scores_gemma":[0.0008156084,0.0001203149,0.00004106219,0.00081099314,0.00018006082,0.0005170993,0.00009807038,0.000083611674,1.16434016e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005497668,0.00001756983,0.000013730053,0.000011174569,9.4665984e-7,6.3526244e-7,0.00013672138,0.032852136,0.003180879,0.018771771,0.000006876667,0.9450021],"study_design_scores_gemma":[0.00020274658,0.00047574265,0.0018387455,0.0003085294,0.000003901273,0.000009377742,0.000009831849,0.9339634,0.047420196,0.015328729,0.0002164163,0.00022235201],"about_ca_topic_score_codex":5.560284e-7,"about_ca_topic_score_gemma":1.1752907e-7,"teacher_disagreement_score":0.9447797,"about_ca_system_score_codex":0.00005990214,"about_ca_system_score_gemma":0.000090985355,"threshold_uncertainty_score":0.4906299},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03548450210508491,"score_gpt":0.27987380749756435,"score_spread":0.24438930539247944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066610756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010629907,0.00008769851,0.9884332,0.000012452952,0.0001894556,0.00030039533,8.37416e-7,0.00032359283,0.000022457094],"genre_scores_gemma":[0.4428232,8.337763e-7,0.5571315,0.0000026683795,0.000019206827,0.00001691287,1.3027238e-7,0.0000044833573,0.0000010320317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.00000960562,0.00028359372,0.00034988637,0.00034444872,0.00032168158],"domain_scores_gemma":[0.9988517,0.000053550844,0.00017671498,0.0005403536,0.0003101324,0.00006750454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007579713,0.0001114403,0.00018630148,0.0002883447,0.0000738905,0.000041858617,0.0014210413,0.000054886706,6.686749e-7],"category_scores_gemma":[0.000012726244,0.000107428685,0.00008022342,0.00080094236,0.00023988666,0.0005836272,0.00030124324,0.00008311903,4.608179e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023993043,0.000044650133,0.00014895425,0.000049211558,0.000004170494,4.501717e-7,0.0015037721,0.0043987674,0.00042963866,0.78131574,0.0000025518348,0.21209966],"study_design_scores_gemma":[0.00007399369,0.00024563653,0.00018306865,0.00017045098,0.00000430909,0.0000038981793,0.000011750659,0.9206397,0.02766011,0.050655346,0.00020676294,0.00014499499],"about_ca_topic_score_codex":0.000041444924,"about_ca_topic_score_gemma":3.1799996e-7,"teacher_disagreement_score":0.91624093,"about_ca_system_score_codex":0.000047239417,"about_ca_system_score_gemma":0.00011505415,"threshold_uncertainty_score":0.43808147},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06513932518415562,"score_gpt":0.3623689497781702,"score_spread":0.2972296245940146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067377566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.869394,0.0000058754836,0.12629786,0.00256129,0.00089738745,0.0006340191,0.0000014232692,0.00019868523,0.000009479428],"genre_scores_gemma":[0.87508184,1.9256152e-7,0.12450474,0.00022529636,0.00010002765,0.0000593285,3.3199174e-7,0.0000098882365,0.00001836024],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997003,0.0000823959,0.00022097534,0.00075734203,0.0013292114,0.00060703483],"domain_scores_gemma":[0.9972351,0.0005260288,0.00006822593,0.0015263428,0.00028497417,0.0003592931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358445,0.0001725466,0.0001829185,0.0003507052,0.00044829823,0.00046702073,0.0032874085,0.000038497725,0.0000028469033],"category_scores_gemma":[0.0003262941,0.0001193394,0.000044080985,0.001723018,0.000445903,0.00032573857,0.001442796,0.00032181758,0.000031282943],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020349984,0.00096290035,0.06468653,0.000016962045,0.00001495323,0.000036581896,0.008190823,0.0019775024,0.012634413,0.0009139477,0.00038684704,0.91015816],"study_design_scores_gemma":[0.00080647756,0.0065415767,0.8346438,0.00008661481,0.0000113920405,0.00009239404,0.0004189312,0.116805546,0.03055956,0.0002111478,0.009019459,0.0008031502],"about_ca_topic_score_codex":0.000045537396,"about_ca_topic_score_gemma":0.00022562071,"teacher_disagreement_score":0.90935504,"about_ca_system_score_codex":0.000070442555,"about_ca_system_score_gemma":0.00018461586,"threshold_uncertainty_score":0.61088777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031111845490356706,"score_gpt":0.3676450353410482,"score_spread":0.33653318985069147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068157922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2951598,0.00004728384,0.703165,0.000064139575,0.0010037388,0.00027863594,4.0682602e-7,0.00015197355,0.0001290202],"genre_scores_gemma":[0.42601466,4.5175997e-7,0.57373446,0.00009207048,0.00013994267,0.000006777732,5.1673004e-7,0.0000075552134,0.0000035577004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743026,0.000055580687,0.0005296813,0.0005659654,0.00041169216,0.0010068226],"domain_scores_gemma":[0.9979711,0.000492009,0.00035754484,0.0005432046,0.0004313569,0.00020479629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034672634,0.00022034999,0.00027581787,0.00078322116,0.00084185955,0.00048212215,0.0017689532,0.00005144635,0.0000011550937],"category_scores_gemma":[0.00003862936,0.00019727457,0.00015442244,0.00241012,0.00036386418,0.002367654,0.00090924074,0.00019676203,8.4195216e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008263834,0.000048658254,0.0022625017,0.000072432835,0.000018984478,0.0000013119804,0.005905224,0.0014220778,0.01921472,0.0052846516,0.0000011416176,0.96576005],"study_design_scores_gemma":[0.00036511573,0.00027670164,0.0077081076,0.00020826816,0.00002394457,0.00008405059,0.0011526836,0.808287,0.17603353,0.0015806882,0.0038238785,0.00045601072],"about_ca_topic_score_codex":0.00033602605,"about_ca_topic_score_gemma":0.00014688882,"teacher_disagreement_score":0.965304,"about_ca_system_score_codex":0.000073276584,"about_ca_system_score_gemma":0.00015196337,"threshold_uncertainty_score":0.8044623},"labels":[],"label_agreement":null},{"id":"W2080651595","doi":"10.1016/j.scico.2004.04.001","title":"Practice and experience with Java in education","year":2004,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Java; Programming language; Software engineering","score_opus":0.008841459162889753,"score_gpt":0.28535681984056804,"score_spread":0.2765153606776783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080651595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35302854,0.00015686102,0.64539945,0.0007918137,0.00021659532,0.00019409777,2.3682217e-8,0.000113028036,0.00009961355],"genre_scores_gemma":[0.5077675,0.0000023822777,0.49214298,0.000054209617,0.000016462762,0.000010979392,9.8032466e-8,0.0000028196343,0.0000025555828],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99837977,0.000048074373,0.00021863522,0.0005132445,0.0004689211,0.0003713719],"domain_scores_gemma":[0.9991197,0.00006748937,0.00016010826,0.0003703716,0.00016637816,0.0001159352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011189111,0.00011905038,0.00013366657,0.00031232781,0.00020349596,0.0004385928,0.0007970406,0.000027439857,2.1616259e-7],"category_scores_gemma":[0.00011613589,0.0001014856,0.000015843774,0.0014671591,0.0004899836,0.0020662623,0.00025882904,0.0001984882,0.000001422809],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003365484,0.000152348,0.0021656447,0.000013067217,0.0000014356388,0.0000039650718,0.014026907,0.00086254475,0.00009231865,0.02549269,5.698401e-7,0.95718515],"study_design_scores_gemma":[0.012897174,0.013968539,0.39881086,0.008227371,0.000091252026,0.005004412,0.047408238,0.081115775,0.016322391,0.010390956,0.39865977,0.007103286],"about_ca_topic_score_codex":0.00030422033,"about_ca_topic_score_gemma":0.000010187996,"teacher_disagreement_score":0.9500819,"about_ca_system_score_codex":0.000071739305,"about_ca_system_score_gemma":0.0005479001,"threshold_uncertainty_score":0.42293605},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013154420175286025,"score_gpt":0.2539888164817442,"score_spread":0.24083439630645817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081869633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025146294,0.00010793802,0.9949697,0.00027579445,0.00033049216,0.00061706407,0.0000036134095,0.0011641216,0.000016627824],"genre_scores_gemma":[0.16215982,0.0000026885402,0.8375256,0.00005114037,0.00013322693,0.00010546608,0.0000013654351,0.000015851729,0.0000048395136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977601,0.000012648431,0.00037972277,0.0005116184,0.0006563181,0.00067956495],"domain_scores_gemma":[0.9985501,0.00006188555,0.00014131925,0.0007304491,0.00034590927,0.00017034302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012684405,0.0002194791,0.0002723592,0.0005789585,0.00018070101,0.00026820743,0.0018823763,0.000057539914,0.0000012263781],"category_scores_gemma":[0.0000117329755,0.00021614591,0.00013849157,0.0012175912,0.00020853942,0.0013591564,0.0003640667,0.000119006836,0.0000018012906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058837873,0.000035589714,0.000038510625,0.00011973368,0.000005476063,0.000001120489,0.00035887354,0.023577208,0.00053161045,0.029904949,0.00021044764,0.9452106],"study_design_scores_gemma":[0.00032884968,0.0003395358,0.000052086212,0.00012245013,0.0000039172387,0.000007108693,0.0000012481704,0.8833098,0.019683424,0.00044907,0.095433414,0.0002691028],"about_ca_topic_score_codex":0.000004031963,"about_ca_topic_score_gemma":0.0000018152788,"teacher_disagreement_score":0.9449415,"about_ca_system_score_codex":0.000126083,"about_ca_system_score_gemma":0.00016036592,"threshold_uncertainty_score":0.88141745},"labels":[],"label_agreement":null},{"id":"W2083112208","doi":"10.1016/j.scico.2010.11.002","title":"Queue based mutual exclusion with linearly bounded overtaking","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Overtaking; Thread (computing); Computer science; Critical section; Queue; Traverse; Bounded function; Parallel computing; Distributed computing; Computer network; Mathematics; Programming language","score_opus":0.007506269166022648,"score_gpt":0.2411300093688366,"score_spread":0.23362374020281396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083112208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24701342,0.000012886918,0.75131613,0.00017885031,0.0008081668,0.0002340935,0.0000012474924,0.00016419252,0.0002709793],"genre_scores_gemma":[0.6203817,1.243971e-7,0.37944058,0.00005747904,0.00009299639,0.000008559068,0.0000012243554,0.000006019408,0.000011313456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729025,0.000031559448,0.00036439468,0.0006858684,0.0010280062,0.00059992843],"domain_scores_gemma":[0.99814695,0.00006579636,0.00027287216,0.00084432453,0.00046331593,0.00020672094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011651597,0.00020303269,0.00025978297,0.00023409813,0.0004401307,0.0008813005,0.002008858,0.00006972541,0.0000040953705],"category_scores_gemma":[0.000034657824,0.00015893548,0.0000699426,0.0017452596,0.0006231134,0.0013188492,0.00037800046,0.00028809757,0.000008704249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029145642,0.00035974185,0.0038741413,0.000092354014,0.00001448272,0.000047065216,0.0014923618,0.0012243149,0.035655025,0.08209704,0.00008807829,0.8750262],"study_design_scores_gemma":[0.0008250015,0.00051817414,0.0047002314,0.00021837908,0.0000052144887,0.000063950385,0.000026450705,0.9674636,0.012881881,0.00032657152,0.012528595,0.0004419347],"about_ca_topic_score_codex":0.000092750044,"about_ca_topic_score_gemma":0.000047164973,"teacher_disagreement_score":0.9662393,"about_ca_system_score_codex":0.000033203476,"about_ca_system_score_gemma":0.0005489828,"threshold_uncertainty_score":0.8498401},"labels":[],"label_agreement":null},{"id":"W2085495665","doi":"10.1016/j.scico.2011.01.008","title":"Preface to the special issue on reverse engineering (featuring selected papers from WCRE 2009)","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reverse engineering; Software engineering; Data science; Programming language","score_opus":0.007996367776412659,"score_gpt":0.18997283455753033,"score_spread":0.18197646678111767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085495665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79833794,0.00016141891,0.1859833,0.00025306217,0.005385243,0.0015797911,0.000013553605,0.0013580649,0.006927655],"genre_scores_gemma":[0.8217752,0.000007963039,0.1766174,0.000035587444,0.0014656036,0.000017142287,0.0000025588147,0.000026409283,0.000052110354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891216,0.0000073131396,0.00017577654,0.0002616961,0.00029794904,0.0003450925],"domain_scores_gemma":[0.999502,0.000022284907,0.000037907164,0.00024996747,0.0000881748,0.00009968778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018945443,0.00015327366,0.00013190015,0.00013523751,0.00011925186,0.00009692117,0.0004935818,0.000040132887,0.00006295954],"category_scores_gemma":[0.000030995605,0.00012268614,0.000027987004,0.0007891603,0.0000496083,0.00020347685,0.00008540591,0.00014876592,0.000019603653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012243291,0.000024316985,0.000106021114,0.000052322768,0.00001746291,0.0000025992285,0.004594545,0.7537287,0.0010363517,0.00005838966,0.0005924007,0.23977463],"study_design_scores_gemma":[0.00055230246,0.0004071475,0.03149726,0.0006108949,0.000041801984,0.000006645065,0.00023643496,0.57016706,0.24468623,0.000030898842,0.15074345,0.0010198503],"about_ca_topic_score_codex":0.000039188362,"about_ca_topic_score_gemma":0.0000075692747,"teacher_disagreement_score":0.24364989,"about_ca_system_score_codex":0.00004467272,"about_ca_system_score_gemma":0.000025965699,"threshold_uncertainty_score":0.5002995},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08599344345401087,"score_gpt":0.31329145225617433,"score_spread":0.22729800880216344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088108067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35333085,0.000023101586,0.64556146,0.00006448749,0.0002866834,0.00049421785,1.8532987e-7,0.00022221565,0.000016787073],"genre_scores_gemma":[0.68761486,1.8214784e-7,0.31228465,0.0000056844183,0.000045338747,0.000037318467,1.5936764e-7,0.000006157088,0.0000056926615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972551,0.000050292518,0.00030228312,0.0006594056,0.0010679684,0.00066494837],"domain_scores_gemma":[0.9979921,0.00029749746,0.00008845968,0.0010251147,0.00033789573,0.00025891178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015855776,0.00015825764,0.00018166333,0.00056218926,0.00038749693,0.00073227263,0.0017975746,0.000027405491,0.000008068068],"category_scores_gemma":[0.00020065231,0.00014672724,0.00004606568,0.0029577003,0.00041094917,0.0024233435,0.0014061868,0.00019697512,0.000029023917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009793599,0.0034063892,0.18746293,0.0004789877,0.00017652585,0.0060413666,0.02314084,0.006089306,0.008723734,0.13893479,0.001289145,0.6242462],"study_design_scores_gemma":[0.0012293792,0.0012953406,0.010982002,0.00018806347,0.000012315648,0.0035918078,0.004547121,0.9735157,0.0015083703,0.0022126518,0.00010614236,0.00081113324],"about_ca_topic_score_codex":0.00038064143,"about_ca_topic_score_gemma":0.0000068013846,"teacher_disagreement_score":0.96742636,"about_ca_system_score_codex":0.00028821226,"about_ca_system_score_gemma":0.00029810064,"threshold_uncertainty_score":0.7061322},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Similarity (geometry); Mathematical model; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.018807137613696415,"score_gpt":0.2760802703627261,"score_spread":0.2572731327490297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088136492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43486625,0.00007396584,0.56408495,0.00042574474,0.00018291196,0.00019392773,1.5278093e-7,0.00015596033,0.000016109498],"genre_scores_gemma":[0.58654225,0.0000027399324,0.41333595,0.000005017542,0.000092696355,0.000009128891,1.9814294e-7,0.0000057131765,0.000006278837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997449,0.00008761664,0.00041859897,0.0006642515,0.0006845372,0.0006959853],"domain_scores_gemma":[0.9984492,0.00041389556,0.00018594146,0.0005395898,0.0001582346,0.00025312966],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003367967,0.00021642161,0.0002847528,0.00015669611,0.0015261328,0.0020712123,0.0014471622,0.00008331704,8.833477e-7],"category_scores_gemma":[0.00022764008,0.00015058246,0.000057794794,0.0005848391,0.0015828833,0.0007619599,0.00112136,0.0006695207,0.0000016948305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016441261,0.0000289962,0.0031525404,0.000040370545,0.0000088248835,0.0000012434052,0.0014456048,0.00001821131,0.00012715929,0.024967805,5.8737425e-7,0.97020704],"study_design_scores_gemma":[0.00043102307,0.0004492989,0.007892161,0.00017796387,0.000036430843,0.00010112802,0.0003124581,0.97589177,0.00031208046,0.008439371,0.005349674,0.0006066551],"about_ca_topic_score_codex":0.000033987988,"about_ca_topic_score_gemma":0.000008064009,"teacher_disagreement_score":0.97587353,"about_ca_system_score_codex":0.000009759669,"about_ca_system_score_gemma":0.000110691966,"threshold_uncertainty_score":0.99977374},"labels":[],"label_agreement":null},{"id":"W2088296131","doi":"10.1016/j.scico.2006.04.009","title":"Special issue on Source code analysis and manipulation","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Program slicing; Source code; Slicing; Program comprehension; Transformation (genetics); Static program analysis; Code (set theory); Program transformation; Restructuring; Programming language; Program analysis; Software engineering; World Wide Web; Software; Software development; Software system; Set (abstract data type)","score_opus":0.014948064418239062,"score_gpt":0.265467116510335,"score_spread":0.25051905209209596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088296131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040561743,0.000009774971,0.9568263,0.00014592064,0.00024094772,0.00011306893,2.7479575e-7,0.0015030336,0.0005989281],"genre_scores_gemma":[0.45201424,3.3065803e-7,0.54711086,0.000033833967,0.0008025526,0.0000029469677,8.52695e-7,0.0000032761584,0.000031089286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851066,0.000026926738,0.000231555,0.00046611024,0.0004865219,0.00027821216],"domain_scores_gemma":[0.99914664,0.000111270965,0.00014464106,0.0004083185,0.00012844824,0.00006070488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058124,0.00011374084,0.00017713563,0.0005840203,0.00022338972,0.00036081523,0.0006777714,0.000031817173,0.0000020960147],"category_scores_gemma":[0.000036812664,0.00010496189,0.000056102755,0.0022305471,0.00028205005,0.00036675148,0.00026551777,0.00007193615,0.0000033202027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018327553,0.000056830366,0.016396184,0.000008137984,0.000008607466,0.0000026484552,0.00022662016,0.0019542915,0.000057270307,0.0057285484,0.0011149319,0.9744441],"study_design_scores_gemma":[0.00020166673,0.00037169657,0.12957343,0.00006909992,0.000042589036,0.00001806546,0.000004767428,0.8399377,0.0028128966,0.015139233,0.011456067,0.00037282906],"about_ca_topic_score_codex":0.00015291365,"about_ca_topic_score_gemma":0.000010751222,"teacher_disagreement_score":0.97407126,"about_ca_system_score_codex":0.00002962879,"about_ca_system_score_gemma":0.000036764264,"threshold_uncertainty_score":0.42802218},"labels":[],"label_agreement":null},{"id":"W2092844858","doi":"10.1016/j.scico.2006.04.008","title":"Using source transformation to test and model check implicit-invocation systems","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Executable; Model transformation; Transformation (genetics); Invocation; Program transformation; Source code; Software system; Software engineering; Software; Artificial intelligence","score_opus":0.03677212379515102,"score_gpt":0.30870860501789044,"score_spread":0.2719364812227394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092844858","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18151146,0.000026803076,0.8176207,0.000068326604,0.0001751004,0.0003972537,4.977092e-7,0.00010498876,0.000094875],"genre_scores_gemma":[0.48202285,4.2384693e-7,0.517915,0.000012500693,0.000031731568,0.000009955472,4.5866963e-7,0.000003616805,0.000003446189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830186,0.00003250551,0.0004144496,0.00039773967,0.0005041966,0.00034923802],"domain_scores_gemma":[0.9990104,0.00003879872,0.00018623823,0.000391527,0.00027314163,0.00009991365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524627,0.00012681358,0.00015460249,0.0003276184,0.00027622702,0.0004954004,0.00075947447,0.000042074033,7.7929606e-8],"category_scores_gemma":[0.00003471442,0.00012451052,0.000026859894,0.0013065434,0.00015823357,0.0018369827,0.00017345947,0.00006823852,0.0000017264146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000256003,0.0000975509,0.00032602184,0.00010565756,0.0000020059215,2.141436e-7,0.0023087056,0.4472805,0.063131124,0.14420073,0.000006417387,0.3425385],"study_design_scores_gemma":[0.00009311921,0.00009891794,0.00075250026,0.000053084525,0.000003244133,0.000019763358,0.000042930926,0.9858558,0.012031665,0.00078429317,0.0001235501,0.00014113961],"about_ca_topic_score_codex":0.00013361398,"about_ca_topic_score_gemma":0.0000022892648,"teacher_disagreement_score":0.5385753,"about_ca_system_score_codex":0.000091800546,"about_ca_system_score_gemma":0.00012067596,"threshold_uncertainty_score":0.5077392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022254709808713774,"score_gpt":0.2856804653230817,"score_spread":0.263425755514368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094437360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23307943,0.000029281055,0.764719,0.00009473348,0.0006162593,0.00076894514,8.767723e-8,0.00018819359,0.0005040705],"genre_scores_gemma":[0.42541838,0.0000012774584,0.5744422,0.000023877561,0.00002331089,0.00007803036,5.137864e-7,0.000004368489,0.000008059772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973747,0.00009000486,0.00050351763,0.0006058363,0.0007425982,0.0006833193],"domain_scores_gemma":[0.99835134,0.000041045783,0.00022900442,0.00080888835,0.00041252273,0.0001572228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230022,0.00016531539,0.00022095727,0.0005237903,0.00013949547,0.00044238725,0.0019829418,0.000056398705,0.0000044625367],"category_scores_gemma":[0.000100560705,0.00015064968,0.00005809085,0.003932462,0.00055594085,0.00293086,0.0006584554,0.00017755378,0.000039605184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010823784,0.00015335076,0.0062859054,0.000023114282,0.0000017866519,0.0000014807038,0.0011159662,0.000089588524,0.0014288365,0.058339752,0.000008339082,0.9325508],"study_design_scores_gemma":[0.00067270437,0.00079535454,0.07621592,0.00023574012,0.000003119818,0.00003221686,0.00018697056,0.8913233,0.019840604,0.007811236,0.0023108434,0.0005719298],"about_ca_topic_score_codex":0.00015450484,"about_ca_topic_score_gemma":0.0000048373195,"teacher_disagreement_score":0.9319789,"about_ca_system_score_codex":0.000094744486,"about_ca_system_score_gemma":0.00023111564,"threshold_uncertainty_score":0.61433154},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09302423369983133,"score_gpt":0.41350486610888365,"score_spread":0.32048063240905234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101832700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4190185,0.00017530122,0.58035576,0.0000333016,0.00003144916,0.000278983,2.2286605e-7,0.000082257284,0.000024216175],"genre_scores_gemma":[0.59653306,0.000002459613,0.40343708,0.000002149898,0.000012253987,0.000010473898,2.5963814e-7,0.0000017957866,4.4671438e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801254,0.00012776616,0.00027359204,0.000385245,0.0009648362,0.00023602921],"domain_scores_gemma":[0.99873626,0.00025771177,0.00013712558,0.0002713394,0.00052106765,0.000076475444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049723852,0.00009790443,0.00020018758,0.0003392632,0.00010263971,0.00023375542,0.0004616484,0.00003727739,1.4288871e-7],"category_scores_gemma":[0.00026097687,0.00009196169,0.00002038176,0.0010564344,0.00040293823,0.0010327068,0.0001999039,0.000109781904,1.1573914e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032707378,0.000059336246,0.0002674476,0.00002708434,0.0000032557316,2.0594149e-7,0.0056861546,0.00020501354,0.005428057,0.0015815387,0.0000011778034,0.98673743],"study_design_scores_gemma":[0.00033661473,0.0009253997,0.01883152,0.000086007385,0.000009553592,0.000027740687,0.0004368784,0.89060575,0.08668336,0.0018433712,0.000041346928,0.00017243391],"about_ca_topic_score_codex":0.000012750593,"about_ca_topic_score_gemma":6.857364e-7,"teacher_disagreement_score":0.98656505,"about_ca_system_score_codex":0.00004903035,"about_ca_system_score_gemma":0.00009469848,"threshold_uncertainty_score":0.37500888},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02139409513525516,"score_gpt":0.31069825172466453,"score_spread":0.2893041565894094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109580177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79873866,0.000046636633,0.19983342,0.00056463084,0.0001186195,0.00065062765,1.3199082e-7,0.000045413053,0.0000018790025],"genre_scores_gemma":[0.8710439,0.0000020577804,0.12882487,0.000041527466,0.000023627463,0.00005644176,3.4450514e-7,0.0000063152897,9.031758e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978977,0.00012716232,0.00027329693,0.00054280716,0.0007325989,0.00042642132],"domain_scores_gemma":[0.9983939,0.00039456,0.00008936635,0.0007233727,0.0002511187,0.00014768988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015623186,0.00013842098,0.0002422915,0.00048377065,0.00014860027,0.00023721058,0.0017763748,0.00004220995,0.0000019199601],"category_scores_gemma":[0.00011127234,0.00009793065,0.000025334737,0.0019901663,0.00060227705,0.0005836233,0.00069275725,0.00016216464,0.0000016422223],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012028486,0.0007518126,0.43121082,0.000072284485,0.000009427814,0.000011631005,0.03314401,0.001488405,0.015275087,0.000098594515,0.00001134972,0.51791453],"study_design_scores_gemma":[0.00043699268,0.0011509788,0.44619122,0.00003513707,0.00000193931,0.0000028180398,0.00017429152,0.54773635,0.0040555415,0.000058926504,0.0000363373,0.00011948511],"about_ca_topic_score_codex":0.00040727697,"about_ca_topic_score_gemma":0.00013445309,"teacher_disagreement_score":0.54624796,"about_ca_system_score_codex":0.00004625672,"about_ca_system_score_gemma":0.00017129231,"threshold_uncertainty_score":0.3993496},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1341347190317785,"score_gpt":0.35838879632034276,"score_spread":0.22425407728856425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110847937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61907905,0.00005373628,0.37999988,0.00008082803,0.00019106663,0.00046223402,1.9541446e-7,0.000086529566,0.00004651131],"genre_scores_gemma":[0.6871304,0.0000045256256,0.3127129,0.000008348463,0.000035476973,0.000097584554,8.736405e-8,0.000004740463,0.000005964437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972689,0.00007258993,0.00026577033,0.00061178615,0.0009827346,0.0007982127],"domain_scores_gemma":[0.99673414,0.0014714209,0.00005933175,0.0009115157,0.0006634606,0.00016012379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006789641,0.00011547014,0.00014827811,0.00025472068,0.000719528,0.00059667625,0.0029937895,0.00003850096,0.0000017952547],"category_scores_gemma":[0.0011913737,0.000082815175,0.000040272153,0.0018867442,0.0021572772,0.0018276323,0.0015197133,0.00026655933,0.0000022072445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008731522,0.000046036337,0.022798758,0.00006368894,0.0000033711824,8.0021476e-7,0.009908618,0.000025146852,0.0006028235,0.0077328556,0.000012350323,0.9587968],"study_design_scores_gemma":[0.0004917942,0.0016691922,0.43245074,0.00022025054,0.000003677681,0.000047672253,0.0007444566,0.5244998,0.03504503,0.0024636064,0.0018970337,0.0004667676],"about_ca_topic_score_codex":0.000024190591,"about_ca_topic_score_gemma":6.0814597e-7,"teacher_disagreement_score":0.95833004,"about_ca_system_score_codex":0.000054476997,"about_ca_system_score_gemma":0.00023546875,"threshold_uncertainty_score":0.7948578},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03221342878942683,"score_gpt":0.34217966633226143,"score_spread":0.3099662375428346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113772893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48389897,0.0000037613986,0.5157751,0.000033938348,0.000081338374,0.00015629498,2.3713336e-7,0.000047225483,0.0000031464199],"genre_scores_gemma":[0.5048447,1.7508411e-7,0.49511674,0.000006396669,0.000015906153,0.0000060655216,2.9611476e-7,0.000004475394,0.000005232444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770397,0.00004419931,0.00041928943,0.0005037841,0.0007760258,0.0005527551],"domain_scores_gemma":[0.99841255,0.00010222046,0.00011933017,0.0007218256,0.00042113574,0.0002229188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010036572,0.00013621151,0.00030810802,0.0006756663,0.00007145251,0.00028642907,0.001704042,0.00004022062,0.0000039408415],"category_scores_gemma":[0.00016301144,0.00012994495,0.00006632126,0.004758418,0.00020382671,0.0006766515,0.0007770419,0.00013003474,0.0000064452165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018695799,0.00015373527,0.27265856,0.00006152776,0.000029068988,0.000005310081,0.0019636247,0.4365238,0.0015324528,0.0014274939,0.0000024031656,0.28564015],"study_design_scores_gemma":[0.0000856745,0.00006503934,0.10849721,0.00003693917,0.000008524692,0.000003936011,0.0000081824455,0.8895506,0.0013028302,0.00028446774,0.000023580671,0.00013296348],"about_ca_topic_score_codex":0.0003939677,"about_ca_topic_score_gemma":0.0000130731905,"teacher_disagreement_score":0.45302686,"about_ca_system_score_codex":0.000078783436,"about_ca_system_score_gemma":0.00013613835,"threshold_uncertainty_score":0.52990013},"labels":[],"label_agreement":null},{"id":"W2119516574","doi":"10.1016/j.scico.2013.11.007","title":"Parse views with Boolean grammars","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Tree-adjoining grammar; Parsing; Parsing expression grammar; Phrase structure grammar; Rule-based machine translation; Programming language; Context-free grammar; L-attributed grammar; Natural language processing; Indexed grammar; S-attributed grammar; Negation; Artificial intelligence","score_opus":0.01395245520905636,"score_gpt":0.261069871613509,"score_spread":0.24711741640445262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119516574","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018899435,0.00032347822,0.97891873,0.00045256413,0.00016800596,0.0004921188,1.4239023e-7,0.00059769355,0.00014784034],"genre_scores_gemma":[0.33863974,0.0000015317646,0.6611551,0.000111887835,0.00003122168,0.000031636686,3.36496e-7,0.0000067856377,0.000021760898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976775,0.00003528831,0.000312395,0.000609969,0.00075967703,0.00060516223],"domain_scores_gemma":[0.9983029,0.00003990332,0.00023461742,0.0007887655,0.00044908607,0.0001847315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007330897,0.00019750043,0.00023654016,0.00030390412,0.00022184422,0.0008010395,0.002749622,0.000043381864,0.000006064794],"category_scores_gemma":[0.000025785375,0.00013920362,0.00005491083,0.0018264673,0.0007211267,0.0024838743,0.00067112356,0.00018335889,0.000021900727],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013027988,0.000049512557,0.00031334607,0.000027049482,0.000004009362,0.000006482821,0.00048167515,0.000012368648,0.0025166217,0.03042791,0.00014945166,0.9660103],"study_design_scores_gemma":[0.0020240603,0.0045564887,0.0048361802,0.0018096473,0.000048416103,0.0007216434,0.00033212116,0.40084553,0.31691423,0.24578825,0.01828799,0.0038354583],"about_ca_topic_score_codex":0.000080454294,"about_ca_topic_score_gemma":0.0000046647315,"teacher_disagreement_score":0.96217483,"about_ca_system_score_codex":0.00004456684,"about_ca_system_score_gemma":0.00019178302,"threshold_uncertainty_score":0.77244425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019897740592626993,"score_gpt":0.27734212334047276,"score_spread":0.25744438274784576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122723127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41525382,0.00001855866,0.5840066,0.000050630013,0.00045929887,0.00010551394,2.1689918e-7,0.00009342096,0.000011904798],"genre_scores_gemma":[0.51871747,7.236894e-7,0.4812421,0.000003864398,0.000025456005,0.0000034671916,8.53957e-8,0.000004492468,0.0000023454902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979157,0.000016148168,0.0003288433,0.0004189875,0.00086267875,0.0004576584],"domain_scores_gemma":[0.99817735,0.000325154,0.00013299679,0.0008139585,0.00041984275,0.00013067845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014728407,0.00012058356,0.0002143294,0.0002752318,0.000100252604,0.00013719957,0.0023391864,0.000045197754,0.000002589853],"category_scores_gemma":[0.0005435454,0.000114491326,0.000066977525,0.0018301979,0.000541553,0.00077271514,0.00088800973,0.00025953387,0.0000043784144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034985255,0.000174636,0.03761875,0.00013212238,0.000016207327,0.0000070658302,0.0013729861,0.011479406,0.21552964,0.013611409,0.000027061078,0.7200272],"study_design_scores_gemma":[0.00018559527,0.0000981941,0.009353772,0.000046643643,0.0000025485024,0.000014262451,0.000007956608,0.89606327,0.093071155,0.000561886,0.00042074855,0.00017395544],"about_ca_topic_score_codex":0.000024914389,"about_ca_topic_score_gemma":0.000005076463,"teacher_disagreement_score":0.8845839,"about_ca_system_score_codex":0.000016512295,"about_ca_system_score_gemma":0.00017323716,"threshold_uncertainty_score":0.46688208},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013699039743499506,"score_gpt":0.26979308635756466,"score_spread":0.25609404661406515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124504744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39433533,0.000017963139,0.60487,0.00007161086,0.00006620245,0.00033837697,8.7353776e-8,0.00016605838,0.00013432193],"genre_scores_gemma":[0.5628178,1.5057987e-7,0.43712655,0.000011634101,0.000020042675,0.000015865804,2.1980124e-7,0.000003581155,0.0000041413746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977814,0.0000915074,0.00041323475,0.0006242531,0.00066575105,0.000423856],"domain_scores_gemma":[0.9988508,0.000045700443,0.0002132866,0.00053663587,0.00027823463,0.00007529998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014255603,0.00016986454,0.00023523462,0.0005939875,0.00025688234,0.00033863733,0.0010209479,0.000038247254,6.4269676e-7],"category_scores_gemma":[0.000009837704,0.00013851938,0.000037513146,0.0031731466,0.00028345815,0.0004159377,0.00038107773,0.00015283641,9.697094e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010420357,0.0022600507,0.013329202,0.000031745483,0.00001221917,0.0015505125,0.0041418085,0.662443,0.00014667312,0.016769808,0.000028910288,0.29927567],"study_design_scores_gemma":[0.00045864366,0.00058054866,0.008077745,0.00003490888,0.0000053006643,0.00056454085,0.00017633276,0.9883599,0.0013354344,0.00013644506,0.000037238697,0.0002329419],"about_ca_topic_score_codex":0.0005186938,"about_ca_topic_score_gemma":0.00008267158,"teacher_disagreement_score":0.32591692,"about_ca_system_score_codex":0.00007519658,"about_ca_system_score_gemma":0.00018250138,"threshold_uncertainty_score":0.5648656},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026042346292251085,"score_gpt":0.30220220894538685,"score_spread":0.27615986265313575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125899403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09747539,0.0003884542,0.9015186,0.000095319505,0.00021574892,0.00012673334,1.2847508e-7,0.00010722789,0.00007242532],"genre_scores_gemma":[0.43955237,0.0000027692386,0.5604135,0.0000041945464,0.00001899971,0.0000018825451,8.928457e-8,0.000002735211,0.0000034479533],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988042,0.00003226024,0.00026329304,0.00030984535,0.00029232612,0.00029803583],"domain_scores_gemma":[0.99919724,0.0002457648,0.00012192568,0.00029149384,0.00011166288,0.000031937867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077352056,0.00010091082,0.00021553885,0.0002922594,0.00004325074,0.000067005145,0.00063098676,0.000029654071,3.856026e-7],"category_scores_gemma":[0.000098415905,0.000095393,0.00001950117,0.0012922764,0.00040689704,0.000522925,0.0004250774,0.00008031569,2.2435928e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037080422,0.00014059227,0.008920041,0.00064329343,0.000007064561,0.000038415033,0.0013501034,0.11177585,0.019555733,0.22251655,0.0000049962314,0.6350437],"study_design_scores_gemma":[0.0026030417,0.0012726306,0.2902242,0.0062130983,0.000021897344,0.0001234553,0.0003421737,0.2562937,0.29968297,0.1408052,0.00028305931,0.0021345727],"about_ca_topic_score_codex":0.000035792913,"about_ca_topic_score_gemma":0.000006619476,"teacher_disagreement_score":0.63290906,"about_ca_system_score_codex":0.000020435928,"about_ca_system_score_gemma":0.00007452753,"threshold_uncertainty_score":0.38900137},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06352619708920401,"score_gpt":0.29323639168980353,"score_spread":0.22971019460059952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126063715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09251545,0.0002464749,0.89892745,0.0021128063,0.0006633754,0.0031163977,0.0000014891216,0.002149038,0.00026754447],"genre_scores_gemma":[0.6463825,0.000012199813,0.35322902,0.000012990556,0.000105669664,0.00012939189,0.0000031501172,0.000030329817,0.0000947155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345064,0.00012305935,0.00038963772,0.0015017809,0.0024368556,0.00209805],"domain_scores_gemma":[0.9969729,0.000434283,0.00020605048,0.0014268156,0.00034871887,0.0006111841],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002309327,0.0005108548,0.00053210894,0.0007448519,0.00061589206,0.009081398,0.003805584,0.00014910224,0.00000843089],"category_scores_gemma":[0.00024136362,0.00046536778,0.00025755042,0.0056953817,0.0017533276,0.0042456347,0.0006595064,0.00049423816,0.000009533173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000991486,0.00028746817,0.0015414484,0.00012565791,0.000036568854,0.000032130873,0.0009524562,0.00015935181,0.00015442954,0.0118868435,0.00006785162,0.98474586],"study_design_scores_gemma":[0.012953324,0.03118336,0.022030074,0.005232236,0.00025000775,0.0015128892,0.009798383,0.7185751,0.020394433,0.026917579,0.13863069,0.012521928],"about_ca_topic_score_codex":0.000010717457,"about_ca_topic_score_gemma":0.0000039516617,"teacher_disagreement_score":0.97222394,"about_ca_system_score_codex":0.0005875749,"about_ca_system_score_gemma":0.000505735,"threshold_uncertainty_score":0.9997798},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"University of Toronto","keywords":"Computer science; Rewriting; Programming language; Parsing; Functional programming; Context (archaeology)","score_opus":0.00920624451607326,"score_gpt":0.23571123332748825,"score_spread":0.22650498881141498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128466029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014841551,0.00027655443,0.9809171,0.00031358024,0.0006539194,0.00032983025,1.00994235e-7,0.00023776498,0.0024295775],"genre_scores_gemma":[0.9590313,0.0000020842708,0.040623102,0.000024678027,0.0001710972,0.000017197772,0.0000010741869,0.000005640585,0.00012383141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797446,0.00005402845,0.00038316657,0.00033792845,0.000706226,0.00054421806],"domain_scores_gemma":[0.99892986,0.00007891519,0.00019800733,0.00054180244,0.00017765789,0.00007378492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016480559,0.00013584396,0.00014710514,0.00013576738,0.00065234635,0.0008450183,0.0018009868,0.00003891752,8.736106e-7],"category_scores_gemma":[0.000014596321,0.000089802736,0.000089296926,0.0011342687,0.0005110795,0.00090135814,0.00020603393,0.0001055397,0.000017674802],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010836613,0.00003001933,0.00013071783,0.000013337379,0.000002554323,0.0000014023594,0.00144801,0.00017448475,0.0005466165,0.3272022,0.000045949342,0.6704036],"study_design_scores_gemma":[0.0015363415,0.00096758123,0.005981501,0.000056201327,0.000025382747,0.00021366744,0.0016094795,0.5317492,0.04438754,0.04844864,0.363745,0.0012794714],"about_ca_topic_score_codex":0.00023724513,"about_ca_topic_score_gemma":0.00003158332,"teacher_disagreement_score":0.9441897,"about_ca_system_score_codex":0.000038926515,"about_ca_system_score_gemma":0.00014628204,"threshold_uncertainty_score":0.81485313},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05347133154518463,"score_gpt":0.3013226588468253,"score_spread":0.24785132730164067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128799871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28258282,0.00021232534,0.7160724,0.000014971372,0.0006991751,0.00017062666,1.3861127e-7,0.0002370944,0.0000104627525],"genre_scores_gemma":[0.5347418,4.2966641e-7,0.46514446,0.000005138293,0.000094513205,0.000005081673,1.0725815e-7,0.0000052847554,0.0000031343877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741024,0.000038683887,0.00026315518,0.000393723,0.0010004243,0.0008937712],"domain_scores_gemma":[0.99859107,0.00017856601,0.000094173316,0.0006277136,0.00027952617,0.00022898133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016733753,0.00014320605,0.00017617004,0.0004425485,0.0002822871,0.0002457023,0.001615372,0.000041970394,0.0000012749063],"category_scores_gemma":[0.00017497415,0.00013907281,0.00006089491,0.0019341372,0.00025126964,0.003214737,0.0010037203,0.00015613507,0.000005197834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029826952,0.00032232841,0.10501701,0.00014600491,0.000025520772,0.0000055000705,0.005050587,0.07523499,0.0044899285,0.052301,0.000019854027,0.7573843],"study_design_scores_gemma":[0.00020887417,0.00010697017,0.022512283,0.00010527993,0.0000054366087,0.00004008131,0.000047568967,0.9721562,0.0026091519,0.0017845894,0.000111611305,0.00031193267],"about_ca_topic_score_codex":0.000038460665,"about_ca_topic_score_gemma":2.9722557e-7,"teacher_disagreement_score":0.8969212,"about_ca_system_score_codex":0.00023334568,"about_ca_system_score_gemma":0.00023309806,"threshold_uncertainty_score":0.5671225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033097929753995725,"score_gpt":0.2732840682834196,"score_spread":0.2401861385294239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136605135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051751835,0.0001587943,0.9916374,0.00023375826,0.00067272875,0.0005969277,0.0000010512888,0.0008601647,0.000663975],"genre_scores_gemma":[0.48119384,0.000006194193,0.51854795,0.000076572345,0.00008380913,0.000030691055,6.81213e-7,0.000010194306,0.000050077593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977407,0.000069998416,0.0004426966,0.0006387499,0.00056915195,0.0005387156],"domain_scores_gemma":[0.9985199,0.00024859223,0.0003073318,0.0006080206,0.00016659363,0.00014954213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010474442,0.00018602835,0.00023713015,0.00037468024,0.0003758582,0.00074587035,0.0017367767,0.000052943218,0.000004112222],"category_scores_gemma":[0.00005026198,0.00017086104,0.00009290872,0.0010692065,0.00016994805,0.0011747384,0.00027562087,0.0001163451,0.00001094544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009160194,0.00041080994,0.00036785443,0.00011715409,0.000019909268,0.000008605639,0.0017012594,0.07037595,0.0004792567,0.04346294,0.0035869246,0.87946016],"study_design_scores_gemma":[0.00024297487,0.00030561478,0.00003588879,0.00013339405,0.0000030174422,0.000014192148,0.000019139497,0.9909592,0.005275852,0.0001908395,0.0026101456,0.00020969],"about_ca_topic_score_codex":0.0000031263119,"about_ca_topic_score_gemma":5.0268223e-8,"teacher_disagreement_score":0.9205833,"about_ca_system_score_codex":0.000036295594,"about_ca_system_score_gemma":0.00006192911,"threshold_uncertainty_score":0.7192445},"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":"W2138859256","doi":"10.1016/j.scico.2004.07.003","title":"Relational characterizations of system fault tolerance","year":2004,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Fault tolerance; Range (aeronautics); Software fault tolerance; Reliability engineering; Theoretical computer science; Algorithm; Distributed computing","score_opus":0.016303384051068966,"score_gpt":0.23842279993898138,"score_spread":0.22211941588791242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138859256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11621244,0.000047544974,0.8822971,0.00012697546,0.00065764604,0.00022385883,0.0000072885355,0.000115612405,0.00031151302],"genre_scores_gemma":[0.73548996,7.655611e-7,0.26442093,0.000011831054,0.000052537784,0.000010103566,0.0000036230479,0.0000036290653,0.0000066215907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979195,0.000023106813,0.00055938895,0.00042005826,0.0007460667,0.0003318541],"domain_scores_gemma":[0.99839544,0.000026526614,0.00039392858,0.00052820286,0.000549822,0.000106103515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262893,0.00012914886,0.0002604686,0.00020253008,0.0002083467,0.00013310004,0.0012599394,0.00004418311,6.8738814e-7],"category_scores_gemma":[0.000015908208,0.00012027228,0.00007981223,0.0018335317,0.00037138592,0.0011720365,0.00022651466,0.000085519394,0.0000072745484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003270481,0.00015414966,0.00071098236,0.00018860951,0.000010648468,0.000005223009,0.0011983169,0.0310924,0.009521787,0.8833013,0.000006469062,0.073806815],"study_design_scores_gemma":[0.0029036948,0.0007758458,0.05736948,0.0036555843,0.000023024359,0.00026857754,0.00029875207,0.8708648,0.05279542,0.0027480633,0.007081158,0.0012155832],"about_ca_topic_score_codex":0.000026825704,"about_ca_topic_score_gemma":9.4408733e-7,"teacher_disagreement_score":0.88055325,"about_ca_system_score_codex":0.00008058911,"about_ca_system_score_gemma":0.00034820873,"threshold_uncertainty_score":0.49045613},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.043479483258700706,"score_gpt":0.3439133840634598,"score_spread":0.30043390080475907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150207557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18453668,0.000042453095,0.8135699,0.0010583651,0.0002595168,0.000361915,5.298017e-7,0.00015623303,0.000014423685],"genre_scores_gemma":[0.5624963,0.0000012727893,0.4373005,0.00013043145,0.000058654372,0.000003916158,5.339767e-7,0.0000039690576,0.000004402335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752724,0.000060748873,0.000335357,0.00049972784,0.0010184948,0.00055842416],"domain_scores_gemma":[0.9983436,0.00032045564,0.00010494184,0.00070391805,0.0003340274,0.00019308786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019265641,0.0001423063,0.00018179917,0.00032914383,0.00047374156,0.00062207464,0.0023706255,0.00003116729,0.000001726901],"category_scores_gemma":[0.00042222175,0.00011133068,0.000057635672,0.0031424866,0.00029115146,0.0008642407,0.00049245276,0.0001846315,0.0000071208606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052492073,0.000099406025,0.0016528044,0.000025339654,0.000007655609,0.0000055467476,0.0026201727,0.009765851,0.030101586,0.010122242,0.00048117898,0.94511294],"study_design_scores_gemma":[0.00046812682,0.0006503083,0.04254685,0.0004893332,0.000011089412,0.000071579576,0.000114204646,0.9231812,0.02689275,0.0029237096,0.0020359051,0.0006149921],"about_ca_topic_score_codex":0.00004578651,"about_ca_topic_score_gemma":6.062631e-7,"teacher_disagreement_score":0.944498,"about_ca_system_score_codex":0.00011062296,"about_ca_system_score_gemma":0.00016553608,"threshold_uncertainty_score":0.599868},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022185499959028836,"score_gpt":0.28292738078839835,"score_spread":0.2607418808293695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153256103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31182316,0.000018406716,0.6877527,0.000012269597,0.00017315018,0.00011593073,3.2323896e-7,0.00010139121,0.0000026254393],"genre_scores_gemma":[0.6016952,5.018773e-7,0.39827853,0.000002645701,0.000010389339,0.0000066857833,4.052065e-7,0.000004962719,7.169456e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760836,0.00007202026,0.00044930016,0.00043399935,0.0008583426,0.00057799567],"domain_scores_gemma":[0.99610716,0.0025777572,0.00010250312,0.00067004585,0.00039304377,0.00014947349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037967132,0.00014290666,0.00030673007,0.00064238167,0.000039400245,0.00013562864,0.0021601904,0.000048306298,0.0000011180431],"category_scores_gemma":[0.007310887,0.00013916331,0.00004172759,0.0032123707,0.00030644526,0.0005824816,0.0007726587,0.00020218766,0.000003273664],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029477117,0.00013694224,0.36862066,0.00023677465,0.000006501632,0.0000040947466,0.00073988346,0.029477064,0.0007634873,0.012953148,0.0000033862916,0.5870551],"study_design_scores_gemma":[0.00013500018,0.00012110991,0.46212286,0.00011398603,5.277619e-7,0.0000018822346,0.0000012991304,0.5356238,0.0016176121,0.00012704427,0.000019010555,0.00011588189],"about_ca_topic_score_codex":0.00017363617,"about_ca_topic_score_gemma":0.0000136886565,"teacher_disagreement_score":0.5869392,"about_ca_system_score_codex":0.000050345025,"about_ca_system_score_gemma":0.00022853045,"threshold_uncertainty_score":0.87523425},"labels":[],"label_agreement":null},{"id":"W2155938435","doi":"10.1016/j.scico.2006.01.009","title":"Describing data flow analysis techniques with Kleene algebra","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Soundness; Computer science; Control flow graph; Kleene algebra; Data-flow analysis; Data flow diagram; Control flow; Theoretical computer science; Program analysis; Kleene's recursion theorem; Compiler; Class (philosophy); Programming language; Graph; Static analysis; Algebra over a field; Flow (mathematics); Graph algebra; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Database; Pure mathematics","score_opus":0.02315846028272783,"score_gpt":0.2639729143379643,"score_spread":0.2408144540552365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155938435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044018365,0.00004773723,0.99357283,0.00012465645,0.00008828466,0.000316155,0.0000028173558,0.0012785079,0.00016717704],"genre_scores_gemma":[0.3721098,0.0000015891749,0.62777317,0.000028037592,0.000051341194,0.000015658929,0.000006406421,0.000007700462,0.0000062913714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969184,0.000040946983,0.00043266462,0.0011022656,0.0009330713,0.0005726698],"domain_scores_gemma":[0.996886,0.0000585646,0.00030749902,0.0021654097,0.00045154185,0.00013099852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705432,0.00022570975,0.00033859993,0.0010353654,0.0003238146,0.0005063516,0.0041384716,0.000050259576,0.0000026127657],"category_scores_gemma":[0.000031869382,0.00019229231,0.000076366865,0.006871677,0.0006366683,0.0031341072,0.0016911007,0.00015819888,0.0000015394371],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003621409,0.00010148518,0.0007591128,0.0000102522135,0.000031347005,0.0000113748,0.00006681449,0.0014107631,0.0022380755,0.006507854,0.00004329143,0.988816],"study_design_scores_gemma":[0.00019118607,0.00062106294,0.0010990694,0.00012404048,0.000094158495,0.000063345564,0.00001893839,0.6607978,0.330037,0.0039174156,0.0023932694,0.0006427667],"about_ca_topic_score_codex":0.00014948446,"about_ca_topic_score_gemma":0.000045991295,"teacher_disagreement_score":0.98817325,"about_ca_system_score_codex":0.00007762033,"about_ca_system_score_gemma":0.00020820597,"threshold_uncertainty_score":0.7841453},"labels":[],"label_agreement":null},{"id":"W2162727661","doi":"10.1016/j.scico.2005.03.008","title":"A selective dynamic compiler for embedded Java virtual machines targeting ARM processors","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Porting; Compiler; Operating system; Just-in-time compilation; Java; Embedded system; Embedded Java; Virtual machine; Memory footprint; strictfp; Real time Java; Software","score_opus":0.009300400936536063,"score_gpt":0.28451684635323987,"score_spread":0.2752164454167038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162727661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020731715,0.00005646129,0.9769029,0.00056793744,0.00025035944,0.0006075388,0.0000013361213,0.00066650636,0.0002152136],"genre_scores_gemma":[0.47592902,0.0000028439283,0.52384347,0.00010913075,0.00005236123,0.000031052536,0.0000024368292,0.000008582677,0.000021120255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752253,0.000065055276,0.0005039103,0.0007424939,0.0005468444,0.00061917753],"domain_scores_gemma":[0.9982559,0.00016224971,0.00035702964,0.0003704858,0.000722677,0.00013167114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017064047,0.0002379542,0.00030463815,0.00042017477,0.0004445444,0.00042367322,0.0017588373,0.000051407704,0.0000011998737],"category_scores_gemma":[0.00011500791,0.00021899345,0.00011227755,0.0015739946,0.0003293401,0.0015096943,0.00048046088,0.00017149272,0.000003221302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016854723,0.00034360948,0.00010601978,0.00005778449,0.000019295205,7.9395454e-7,0.0042106537,0.10776692,0.0018385142,0.022007715,0.00031732518,0.8633145],"study_design_scores_gemma":[0.00031982924,0.00042628252,0.00017482604,0.0000660426,0.0000039827605,0.000008355043,0.000028457218,0.9894518,0.007238078,0.0011069498,0.00090123643,0.00027410896],"about_ca_topic_score_codex":0.000006889834,"about_ca_topic_score_gemma":0.0000033667075,"teacher_disagreement_score":0.88168496,"about_ca_system_score_codex":0.000091105,"about_ca_system_score_gemma":0.0003204596,"threshold_uncertainty_score":0.89302933},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Business process reengineering; Legacy system; Software engineering; Database; Programming language","score_opus":0.017279439561745515,"score_gpt":0.2582559259184934,"score_spread":0.24097648635674787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169575545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18805228,0.00035180748,0.81015956,0.0003484808,0.00036861293,0.0002649687,0.000001264771,0.00023242421,0.00022061748],"genre_scores_gemma":[0.70723003,0.0000062100703,0.2925474,0.00012208098,0.00006233777,0.000019930732,0.0000016825918,0.000006058623,0.0000042493825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979465,0.00002636148,0.00041717847,0.00053943146,0.0005099601,0.00056054763],"domain_scores_gemma":[0.99884194,0.000080710815,0.00015679511,0.0005658232,0.00022743519,0.00012730481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068928057,0.000154392,0.00017420697,0.00056852674,0.00018424026,0.0003200626,0.0016058494,0.000026787553,0.0000054877514],"category_scores_gemma":[0.000030858788,0.00014557948,0.00003193372,0.0036653983,0.00011782837,0.002457637,0.00056646665,0.000150125,0.000007867771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047099816,0.00061349093,0.006493443,0.0010274308,0.000017877466,0.00009417366,0.06444355,0.016410284,0.013564769,0.01744912,0.00007618816,0.87980497],"study_design_scores_gemma":[0.00047718672,0.0001995653,0.0009554189,0.0005346661,0.0000055618884,0.000042885877,0.0005570704,0.9727226,0.01984558,0.0005368923,0.00359818,0.00052440714],"about_ca_topic_score_codex":0.000019924182,"about_ca_topic_score_gemma":0.000054597473,"teacher_disagreement_score":0.9563123,"about_ca_system_score_codex":0.000026458656,"about_ca_system_score_gemma":0.00010877606,"threshold_uncertainty_score":0.5936559},"labels":[],"label_agreement":null},{"id":"W2334537514","doi":"10.1016/j.scico.2012.07.006","title":"Mathematics of Program Construction (selected papers from MPC 2010)","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Programming language","score_opus":0.017848431403635227,"score_gpt":0.25720549500083684,"score_spread":0.2393570635972016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334537514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33135954,0.00012777907,0.6653902,0.000045101042,0.001836964,0.00045599916,0.0000036797778,0.0003190298,0.0004616952],"genre_scores_gemma":[0.53568393,0.0000010763525,0.46419844,0.000004237724,0.00009195419,0.0000076194597,0.0000035731787,0.000004432452,0.0000047568324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975226,0.00006159558,0.00060050294,0.0003873623,0.0007745507,0.0006533763],"domain_scores_gemma":[0.9980518,0.00012410773,0.0005284892,0.00064238865,0.000448778,0.00020443488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010228428,0.000191085,0.00035700636,0.00021470561,0.00016639761,0.00020512409,0.001529161,0.00007054453,0.000004878206],"category_scores_gemma":[0.000058211204,0.00016937534,0.00009525088,0.0021804038,0.0006403678,0.0008195772,0.00039234594,0.000131222,0.000008612129],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004209654,0.00072362454,0.011081751,0.00012974475,0.000049263326,0.0000012991187,0.0044098343,0.00036080534,0.010062474,0.029293418,0.00011738764,0.9437662],"study_design_scores_gemma":[0.0023026704,0.0020418486,0.09017806,0.0015376243,0.00011625489,0.00027656756,0.00097496464,0.80629086,0.07303513,0.00482889,0.016266283,0.002150844],"about_ca_topic_score_codex":0.000065370994,"about_ca_topic_score_gemma":0.0000011005457,"teacher_disagreement_score":0.94161534,"about_ca_system_score_codex":0.00003991371,"about_ca_system_score_gemma":0.0002020916,"threshold_uncertainty_score":0.6906926},"labels":[],"label_agreement":null},{"id":"W2339438075","doi":"10.1016/j.scico.2017.08.011","title":"A finite alternation result for reversible boolean circuits","year":2017,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Air Force Materiel Command; Natural Sciences and Engineering Research Council of Canada; U.S. Air Force","keywords":"Alternation (linguistics); Boolean function; Computer science; Boolean circuit; Function (biology); Discrete mathematics; Algorithm; Arithmetic; Mathematics","score_opus":0.024521928790932,"score_gpt":0.28819220411018726,"score_spread":0.26367027531925524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339438075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04147363,0.000026325342,0.9556394,0.0009107683,0.0012302365,0.000349665,0.0000021939761,0.00012958591,0.00023817996],"genre_scores_gemma":[0.5727007,0.0000013717948,0.42701155,0.00004580454,0.00018973609,0.000007703256,7.7511214e-7,0.000005566221,0.00003680213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794996,0.000021780701,0.0003026278,0.00064286863,0.00055408233,0.0005286844],"domain_scores_gemma":[0.99774927,0.00012964019,0.0004555231,0.0011573215,0.00037249384,0.00013575776],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014608252,0.00015256739,0.00020319509,0.00024982257,0.0013274791,0.0012219833,0.0037724043,0.00003959233,5.051974e-7],"category_scores_gemma":[0.00022967125,0.00013984602,0.000110667956,0.00035383206,0.0004610582,0.0010824186,0.0008888286,0.00012205049,0.000003598798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018656899,0.000041469277,0.0002261551,0.00003259426,0.000006692324,0.000002755018,0.0006350784,0.003790532,0.0006778546,0.013080245,0.00006810961,0.98143667],"study_design_scores_gemma":[0.0004559797,0.00027032287,0.0030592538,0.00012939487,0.0000039751385,0.000010846426,0.000007189416,0.98256487,0.0040670526,0.0054111625,0.0038184072,0.00020156881],"about_ca_topic_score_codex":0.00003171717,"about_ca_topic_score_gemma":0.000002563911,"teacher_disagreement_score":0.9812351,"about_ca_system_score_codex":0.000032600186,"about_ca_system_score_gemma":0.00019168506,"threshold_uncertainty_score":0.99997264},"labels":[],"label_agreement":null},{"id":"W2339804272","doi":"10.1016/j.scico.2010.04.004","title":"Principles and Practice of Programming in Java 2008—Special issue","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Programming language; Java; Software engineering","score_opus":0.017370147512257985,"score_gpt":0.2848930143781241,"score_spread":0.2675228668658661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339804272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29725707,0.00020264465,0.69046474,0.0010164544,0.0037815515,0.0012321176,0.000002783351,0.00024008765,0.005802591],"genre_scores_gemma":[0.5597655,0.000002398239,0.43975762,0.000016190143,0.00043054763,0.000006843901,7.378121e-7,0.000005090232,0.000015095032],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972057,0.000106664695,0.00070351525,0.0006449275,0.0007504572,0.0005887784],"domain_scores_gemma":[0.99792194,0.00034912382,0.0005126517,0.00061150506,0.00043978254,0.00016496624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037798665,0.00019399404,0.00035616086,0.00039418243,0.00016310815,0.00039697878,0.0016886854,0.00008381926,0.0000030387769],"category_scores_gemma":[0.00042325992,0.00018163363,0.000057485264,0.001872287,0.0007966643,0.0012480803,0.0008393746,0.00030442482,0.000004022436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013047012,0.00029485783,0.003659541,0.000119713055,0.000010314767,0.000017786548,0.004249764,0.00047593153,0.0029584311,0.04885754,0.00006830453,0.9392748],"study_design_scores_gemma":[0.001972261,0.0013037934,0.019682495,0.00075994,0.000025876345,0.0006711608,0.00071484235,0.27033496,0.007984866,0.0011257234,0.69417536,0.0012487238],"about_ca_topic_score_codex":0.000110010005,"about_ca_topic_score_gemma":0.00002578793,"teacher_disagreement_score":0.9380261,"about_ca_system_score_codex":0.000022403869,"about_ca_system_score_gemma":0.00028937077,"threshold_uncertainty_score":0.7406804},"labels":[],"label_agreement":null},{"id":"W2359630901","doi":"10.1016/j.scico.2016.04.011","title":"A formal validation of the RBAC ANSI 2012 standard using B","year":2016,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Role-based access control; Software engineering; Operating system; Access control","score_opus":0.03379121972956286,"score_gpt":0.3088459989268042,"score_spread":0.27505477919724136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359630901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24180344,0.000014996705,0.75718737,0.00010211121,0.0006185687,0.00018866645,9.274999e-7,0.00003402702,0.000049896567],"genre_scores_gemma":[0.46078885,7.3124545e-7,0.539169,0.000007495977,0.000024757364,0.000002286303,4.2875477e-8,0.0000024594717,0.0000043552354],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980901,0.00009184538,0.00037065468,0.00029272438,0.0007877161,0.00036695963],"domain_scores_gemma":[0.99835426,0.00005552143,0.00039286446,0.0007202029,0.0004174916,0.00005966357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249858,0.00009833331,0.00014746404,0.00016024182,0.00022080992,0.00010316349,0.0017971371,0.000033740547,0.0000021998665],"category_scores_gemma":[0.000095426665,0.000056957902,0.00007178662,0.0013188113,0.0007183699,0.0033485875,0.00068073685,0.000056206223,0.0000012996156],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006267485,0.000027353306,0.0012204004,0.000022847908,0.0000037906823,1.499073e-7,0.00058374414,0.00027638843,0.050245382,0.06164464,0.000006873269,0.8859622],"study_design_scores_gemma":[0.00038368502,0.00027242844,0.006113,0.0002638806,0.000008714252,0.000022417491,0.000025311218,0.116316795,0.8714992,0.0037229953,0.0011640326,0.00020755974],"about_ca_topic_score_codex":0.0000069581843,"about_ca_topic_score_gemma":4.1651555e-7,"teacher_disagreement_score":0.8857546,"about_ca_system_score_codex":0.000078980054,"about_ca_system_score_gemma":0.00027276628,"threshold_uncertainty_score":0.33395576},"labels":[],"label_agreement":null},{"id":"W2401032800","doi":"10.1016/j.scico.2015.05.001","title":"Special Section on Source Code Analysis and Manipulation (SCAM 2013)","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Computer science; Section (typography); Special section; Code (set theory); Source code; Programming language; Operating system; Set (abstract data type)","score_opus":0.024175851037010358,"score_gpt":0.28167567139160754,"score_spread":0.2574998203545972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401032800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04873989,0.00000872242,0.949436,0.00012959722,0.0009593811,0.00018671853,2.905191e-7,0.00032239786,0.00021701951],"genre_scores_gemma":[0.52498466,0.000001994383,0.4741664,0.000032734297,0.0007690333,0.000008350745,7.4061745e-7,0.0000049642745,0.00003109872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982777,0.000041645293,0.00025126626,0.000529618,0.00062981306,0.00026995517],"domain_scores_gemma":[0.9988891,0.000036504403,0.00020277288,0.00041386407,0.00030196842,0.00015579275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767488,0.00012618922,0.00018620606,0.00079187076,0.00018548126,0.00027211494,0.00057361485,0.00004573799,0.0000012867156],"category_scores_gemma":[0.000037290294,0.000121389596,0.000057942474,0.002749602,0.00026513526,0.0011187162,0.00031080816,0.00011199852,0.0000032723347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010689706,0.000055276705,0.00135692,0.000007157972,0.000018247722,0.0000018394431,0.00079656736,0.011078227,0.00046753234,0.0042765755,0.0002577765,0.9816732],"study_design_scores_gemma":[0.0005422137,0.0014992101,0.018068917,0.000049887974,0.00005688096,0.000047887446,0.000105394036,0.9132855,0.028755786,0.005927707,0.031084359,0.00057624746],"about_ca_topic_score_codex":0.000047597987,"about_ca_topic_score_gemma":0.00003006054,"teacher_disagreement_score":0.9810969,"about_ca_system_score_codex":0.00009900309,"about_ca_system_score_gemma":0.00006441274,"threshold_uncertainty_score":0.4950124},"labels":[],"label_agreement":null},{"id":"W2464672509","doi":"10.1016/j.scico.2011.03.004","title":"Abstract State Machines, Alloy, B and Z Selected papers from ABZ 2010","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Advanced Materials Characterization Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université de Sherbrooke","funders":"","keywords":"Computer science; State (computer science); Programming language","score_opus":0.010067334479293236,"score_gpt":0.21358026077376163,"score_spread":0.2035129262944684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464672509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94628507,0.000031394164,0.052488927,0.0000045907946,0.00032989928,0.00016477253,0.000008092132,0.00055916136,0.00012811803],"genre_scores_gemma":[0.74146193,0.000021757107,0.2584571,0.000006867813,0.000023109942,0.0000066904813,0.000005883577,0.000013479634,0.0000032095832],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919695,0.0000058801775,0.00021495769,0.00020105294,0.00015081148,0.00023033604],"domain_scores_gemma":[0.9996144,0.00001402371,0.00006677832,0.00015443139,0.00007538201,0.000074987605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014554603,0.00011917526,0.00014077613,0.00010114178,0.00005268303,0.00006618035,0.0002286786,0.000029129915,0.000031487412],"category_scores_gemma":[0.000008939428,0.00011354961,0.000013221064,0.0002820453,0.00020605256,0.00043743633,0.000073613905,0.000068108486,0.0000021833937],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039314637,0.000013914102,0.0006842598,0.000029268365,0.000006277396,0.0000020436464,0.00064395485,0.00007849556,0.76592624,0.000037687834,0.0000075153093,0.2325664],"study_design_scores_gemma":[0.00020175424,0.00008177294,0.2620428,0.00009125749,0.000006893996,0.0000052426076,0.000012828546,0.012237131,0.7232841,0.0009722457,0.0007044785,0.0003594878],"about_ca_topic_score_codex":0.000061860206,"about_ca_topic_score_gemma":0.000004536625,"teacher_disagreement_score":0.26135853,"about_ca_system_score_codex":0.000016180547,"about_ca_system_score_gemma":0.00001875158,"threshold_uncertainty_score":0.46304187},"labels":[],"label_agreement":null},{"id":"W2466055387","doi":"10.1016/j.scico.2012.07.002","title":"Special section on Mutation testing (Mutation 2010)","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Genomics and Rare Diseases","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Mutation; Section (typography); Mutation testing; Genetics; Biology; Operating system","score_opus":0.017681324518313685,"score_gpt":0.2603838100539199,"score_spread":0.24270248553560622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466055387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880526,0.000031082734,0.009249134,0.000015020375,0.0020910238,0.00011550994,0.0000011408199,0.000009438813,0.00043504342],"genre_scores_gemma":[0.9702157,9.148174e-7,0.024803307,0.00002587045,0.0049120346,0.0000045803104,0.000015298692,0.0000050585563,0.000017253906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993595,0.00001353,0.00011108146,0.00016308558,0.00015396567,0.00019883814],"domain_scores_gemma":[0.9996101,0.000008272026,0.000084233114,0.000104354294,0.0001260273,0.00006700649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027804647,0.000062236584,0.000048901642,0.000066764165,0.00012806455,0.0000408609,0.00010451266,0.000029917403,0.000002064898],"category_scores_gemma":[0.000054199518,0.00005841418,0.000029738647,0.00019845579,0.00012383249,0.00001667968,0.000048996728,0.00003047171,0.0000036625647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000323514,0.00022616729,0.005893864,0.00002557761,0.000011084466,0.000002646509,0.00039346828,0.002238369,0.18865237,0.00035318662,0.0005716757,0.80159926],"study_design_scores_gemma":[0.0015560115,0.0038366169,0.3693443,0.0001528141,0.0000634997,0.00031918564,0.00063752575,0.013392278,0.5749556,0.0004132072,0.03424694,0.0010820572],"about_ca_topic_score_codex":0.000007719559,"about_ca_topic_score_gemma":0.0000011845991,"teacher_disagreement_score":0.8005172,"about_ca_system_score_codex":0.000014188819,"about_ca_system_score_gemma":0.000064201675,"threshold_uncertainty_score":0.23820612},"labels":[],"label_agreement":null},{"id":"W2575734139","doi":"10.1016/j.scico.2016.12.001","title":"Preface to the special issue on advances in software measurement","year":2017,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Software engineering; Software; Data science; Programming language","score_opus":0.03234619304457469,"score_gpt":0.32610259047257245,"score_spread":0.29375639742799775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575734139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023108007,0.00022878118,0.9647377,0.008265199,0.0015757203,0.0009821098,8.833877e-7,0.000112949245,0.0009886326],"genre_scores_gemma":[0.7302114,0.000027117858,0.26813114,0.00015889909,0.0013751327,0.00004887538,1.5068188e-7,0.000006769049,0.000040522464],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99658924,0.00007302913,0.0002755581,0.0006298099,0.0019020112,0.000530329],"domain_scores_gemma":[0.99767417,0.000104883875,0.00014548864,0.0015278503,0.0004050757,0.00014251792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003836535,0.00012857308,0.00020213342,0.00025344745,0.0008043093,0.0010054782,0.0053403117,0.000027004326,0.000006065218],"category_scores_gemma":[0.0008748343,0.000087665656,0.00007647587,0.00093145756,0.0005333058,0.0011836329,0.0012307487,0.00018084934,0.000048487273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005264049,0.00008190054,0.0023012615,0.00001471565,0.0000024783028,0.0000025621662,0.00064030616,0.002698783,0.000026562244,0.001212984,0.0001151349,0.99289805],"study_design_scores_gemma":[0.0011811091,0.0019954003,0.13405918,0.0010995413,0.000012026274,0.000010291812,0.00022323431,0.10833717,0.014864804,0.007866233,0.7292543,0.0010967246],"about_ca_topic_score_codex":0.00005174357,"about_ca_topic_score_gemma":0.000120579636,"teacher_disagreement_score":0.9918013,"about_ca_system_score_codex":0.00012567698,"about_ca_system_score_gemma":0.00024490684,"threshold_uncertainty_score":0.9923717},"labels":[],"label_agreement":null},{"id":"W2584896789","doi":"10.1016/j.scico.2016.11.006","title":"Projecting programs on specifications: Definition and implications","year":2017,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Programming language; Operator (biology); Specification language; Projection (relational algebra); Theoretical computer science; Algorithm","score_opus":0.11570300031759101,"score_gpt":0.329896731864103,"score_spread":0.214193731546512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584896789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2460301,0.000042248477,0.75077784,0.001271348,0.0003278898,0.00065314403,5.8508164e-7,0.00033259502,0.00056424853],"genre_scores_gemma":[0.6222973,0.0000040903496,0.37759447,0.0000067462393,0.00004263524,0.000046126217,4.991707e-7,0.00000422976,0.00000389747],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984689,0.000015876712,0.0001945177,0.0005101368,0.0004404859,0.00037013047],"domain_scores_gemma":[0.9980694,0.00017451975,0.00017317671,0.0011950387,0.000272276,0.00011559567],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009824318,0.00010303905,0.00011090404,0.00026344854,0.0009975856,0.001372796,0.001892495,0.000028479055,3.787578e-7],"category_scores_gemma":[0.00044734174,0.00009681489,0.000030257992,0.0005212738,0.000627734,0.0010439133,0.00061642437,0.00013217962,0.000006429003],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.418521e-7,0.00006357735,0.013501611,0.000017838085,0.0000027929384,7.866887e-7,0.00030758325,0.000015632502,0.00048254232,0.09813538,0.0000064227256,0.887465],"study_design_scores_gemma":[0.0004906985,0.0007578373,0.9315674,0.00035841393,0.0000060325324,0.00007081068,0.000059817656,0.044889983,0.0056880047,0.013816063,0.0017888324,0.00050612213],"about_ca_topic_score_codex":0.000017321263,"about_ca_topic_score_gemma":0.0000012860437,"teacher_disagreement_score":0.9180658,"about_ca_system_score_codex":0.000045251123,"about_ca_system_score_gemma":0.00013112043,"threshold_uncertainty_score":0.9996639},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11227951095325076,"score_gpt":0.3727912956136177,"score_spread":0.26051178466036695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766618326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52363455,0.000015397885,0.47594225,0.000025163514,0.00006460622,0.00028243524,3.2300622e-7,0.000029110039,0.0000061665805],"genre_scores_gemma":[0.60413265,0.0000011223026,0.395826,0.0000044693325,0.000019759767,0.000010723901,1.2213903e-7,0.000003908696,0.0000012075398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977657,0.00005834927,0.00035740342,0.00071539904,0.00072116643,0.00038193728],"domain_scores_gemma":[0.99797475,0.00007844203,0.0004601854,0.0011646821,0.00018323041,0.0001387291],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001876393,0.00018067026,0.00036510942,0.00051794434,0.000832705,0.0011781172,0.0016370347,0.00003350542,0.0000010571242],"category_scores_gemma":[0.000049841845,0.00017761123,0.00011271642,0.0012018377,0.0002762,0.0017366612,0.0012083598,0.00011849912,3.1104904e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028606062,0.0023632366,0.08498464,0.0005100539,0.0013802483,0.0014175565,0.23063953,0.0063272584,0.043595545,0.035433527,0.00000538303,0.5933144],"study_design_scores_gemma":[0.0004871978,0.00017371803,0.010327748,0.00005862124,0.00016896048,0.00032512945,0.0030352266,0.9824499,0.0022922314,0.00036656522,0.00002162274,0.00029306917],"about_ca_topic_score_codex":0.001225046,"about_ca_topic_score_gemma":0.000030964362,"teacher_disagreement_score":0.9761227,"about_ca_system_score_codex":0.00007669976,"about_ca_system_score_gemma":0.000113130256,"threshold_uncertainty_score":0.99985874},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05274942628383975,"score_gpt":0.36745157842863785,"score_spread":0.3147021521447981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783207916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028054364,0.0001239452,0.9706682,0.00017232657,0.0004650937,0.0001935445,9.511745e-8,0.0001969821,0.00012545106],"genre_scores_gemma":[0.3992703,0.0000036235806,0.6006403,0.000006325306,0.000056174027,0.000010762398,7.101989e-8,0.000003265569,0.000009185793],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978156,0.00006616478,0.00030848934,0.00033245972,0.00097476837,0.0005024849],"domain_scores_gemma":[0.99767536,0.0006217163,0.00014956082,0.0007103319,0.0007572396,0.00008578566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005388371,0.00009182553,0.000121014404,0.00022600814,0.00065354817,0.00032206989,0.002912008,0.000024444984,0.0000011574522],"category_scores_gemma":[0.00026478965,0.00006446143,0.000033187327,0.0019201501,0.0013518713,0.0006361969,0.001010882,0.0001601433,0.0000063874186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026342814,0.000027752889,0.00044015038,0.000012966965,0.0000052415107,9.83263e-7,0.0011450796,0.000030174408,0.00022671401,0.033763573,0.00009994406,0.9642448],"study_design_scores_gemma":[0.0005639205,0.0021204422,0.011228489,0.0005339211,0.000007630959,0.00007788697,0.00012919286,0.11020778,0.32443208,0.023960399,0.5259558,0.0007824598],"about_ca_topic_score_codex":0.000025557674,"about_ca_topic_score_gemma":0.0000042094357,"teacher_disagreement_score":0.96346235,"about_ca_system_score_codex":0.00003971608,"about_ca_system_score_gemma":0.0004056375,"threshold_uncertainty_score":0.5411284},"labels":[],"label_agreement":null},{"id":"W2803355808","doi":"10.1016/j.scico.2018.05.003","title":"Preface for the Special Issue on the 23rd Asia-Pacific Software Engineering Conference (APSEC) 2016","year":2018,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Software engineering; Software; Programming language","score_opus":0.021423402473417383,"score_gpt":0.2649475131821159,"score_spread":0.2435241107086985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803355808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011590873,0.000049342565,0.99327946,0.002124838,0.0020707748,0.0006889393,0.0000018793286,0.00042126697,0.00020440258],"genre_scores_gemma":[0.18789545,0.000011479827,0.8085985,0.000098796096,0.0031598767,0.00010186469,4.795615e-7,0.00001711123,0.00011645707],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99810797,0.000029957657,0.0002640664,0.00049600156,0.0005659842,0.0005360334],"domain_scores_gemma":[0.9971481,0.001258554,0.00017835545,0.00094525225,0.00038275644,0.0000869817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017722086,0.00020670952,0.00017222133,0.00013807452,0.0005581025,0.0007628063,0.003167509,0.000052939613,0.000018266406],"category_scores_gemma":[0.00046955142,0.00012346967,0.000087763685,0.0009207431,0.0005294462,0.00075813493,0.0005079751,0.00021113038,0.000020705576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014424879,0.00005742388,0.00006339449,0.000039306175,0.000024104978,0.0000016072898,0.0018748947,0.00080764294,0.00030469627,0.077260874,0.009413538,0.9101381],"study_design_scores_gemma":[0.00017198279,0.0009102277,0.0006315517,0.00021416495,0.000013039183,0.000020926986,0.00006926146,0.31308553,0.016976396,0.0013090848,0.6662146,0.00038323586],"about_ca_topic_score_codex":0.0000104332385,"about_ca_topic_score_gemma":0.000001199721,"teacher_disagreement_score":0.9097549,"about_ca_system_score_codex":0.000039423405,"about_ca_system_score_gemma":0.0001728445,"threshold_uncertainty_score":0.73557585},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05623410123772979,"score_gpt":0.3030603189937094,"score_spread":0.2468262177559796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921931467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6735863,0.000067296925,0.32534614,0.000099197176,0.00019834365,0.0005286292,1.16998e-7,0.00011654554,0.000057424637],"genre_scores_gemma":[0.728675,0.000001211869,0.27124557,0.000009588903,0.000018219282,0.000014137566,1.367963e-7,0.000008264164,0.000027824513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974612,0.000070406386,0.00029196293,0.00075880473,0.0007320599,0.0006855756],"domain_scores_gemma":[0.99861217,0.00031220057,0.000096924356,0.0006470597,0.00015801043,0.00017364236],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0041158427,0.00014789205,0.00026090353,0.00068958447,0.00011885428,0.0010774866,0.0032026304,0.00004551273,0.0000014468696],"category_scores_gemma":[0.00029385593,0.00014274982,0.000029953773,0.002689639,0.00021937727,0.0016750564,0.002836814,0.00026244586,0.0000080395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007131899,0.00007842236,0.34438014,0.00016877094,0.000008954315,0.000012321767,0.0050117383,0.0046608625,0.0031702423,0.004657272,0.000007235852,0.63783693],"study_design_scores_gemma":[0.0009593619,0.00040139753,0.19896272,0.00072734256,0.0000032743314,0.00005167067,0.000113526716,0.7873904,0.009152465,0.00085928093,0.0007825386,0.00059602456],"about_ca_topic_score_codex":0.00011680414,"about_ca_topic_score_gemma":0.00001176887,"teacher_disagreement_score":0.78272957,"about_ca_system_score_codex":0.00009283786,"about_ca_system_score_gemma":0.00029378897,"threshold_uncertainty_score":0.99995947},"labels":[],"label_agreement":null},{"id":"W2998504027","doi":"10.1016/j.scico.2019.102378","title":"Translating Alloy and extensions to classical B","year":2019,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Component (thermodynamics); Construct (python library); Constraint (computer-aided design); Translation (biology); Programming language; Grammar; Theoretical computer science; Algorithm; Linguistics; Mathematics","score_opus":0.021369235195576645,"score_gpt":0.2644331777788579,"score_spread":0.24306394258328123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998504027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1415827,0.000080839876,0.8548818,0.00094764284,0.00092464994,0.0006258965,1.4368105e-7,0.00020151654,0.00075479207],"genre_scores_gemma":[0.7358631,6.90213e-7,0.26392257,0.00009243814,0.000056631383,0.000008527585,2.0489048e-7,0.0000056950876,0.00005013852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977248,0.000043629505,0.00033495834,0.0007071443,0.000613898,0.00057559035],"domain_scores_gemma":[0.9987779,0.00007370768,0.00011194433,0.00055748626,0.00019469728,0.00028425152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011173169,0.00016159705,0.00027265746,0.0002489388,0.00021060143,0.00043701474,0.0011325745,0.0000507458,0.00000281791],"category_scores_gemma":[0.000030399935,0.00013324709,0.00006690883,0.0012002985,0.0002740631,0.00069960207,0.00055636093,0.00012889903,0.000039596758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023654397,0.00005316562,0.002296337,0.000036525664,0.0000057393354,0.000004824119,0.0022414955,0.00012244338,0.007025473,0.2332298,0.000022039985,0.75495976],"study_design_scores_gemma":[0.002320091,0.0043948814,0.028586945,0.00026287607,0.00003405116,0.0003914373,0.00077491364,0.8385233,0.0089363605,0.022609288,0.09092262,0.002243217],"about_ca_topic_score_codex":0.00002499793,"about_ca_topic_score_gemma":0.0000057888856,"teacher_disagreement_score":0.8384009,"about_ca_system_score_codex":0.000025421314,"about_ca_system_score_gemma":0.00014357008,"threshold_uncertainty_score":0.54336584},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06871544950554817,"score_gpt":0.2913727760571159,"score_spread":0.22265732655156775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018272941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8728278,0.000106129875,0.12397796,0.0020865148,0.00024826202,0.0006644933,0.0000025757756,0.000066389846,0.00001985291],"genre_scores_gemma":[0.7796421,0.00001965952,0.22009961,0.00009959335,0.00010084821,0.000020990485,1.5480022e-7,0.000005314941,0.0000117104155],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9977581,0.000031317108,0.00035199797,0.00052729354,0.0009136676,0.00041760982],"domain_scores_gemma":[0.9986979,0.00022348153,0.00010359215,0.0005323629,0.00024731216,0.00019536034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011853672,0.000120643956,0.00017544556,0.0001230784,0.00019078652,0.0001951485,0.0020337047,0.000027437614,0.000004047451],"category_scores_gemma":[0.00050241477,0.000100287085,0.00006915527,0.001865596,0.00045299745,0.00046000624,0.00114857,0.00014007169,0.000004714547],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003565265,0.00017001646,0.14463039,0.00046720234,0.000027320863,0.0000060543443,0.020139093,0.0007901455,0.0009292376,0.0014671899,0.0005858281,0.8307519],"study_design_scores_gemma":[0.0006929044,0.0008081152,0.8960092,0.00038094146,0.000011624527,0.000015554728,0.00037213624,0.08861495,0.008744704,0.0005427506,0.0033230842,0.00048405654],"about_ca_topic_score_codex":0.00002954151,"about_ca_topic_score_gemma":0.0000017534345,"teacher_disagreement_score":0.8302678,"about_ca_system_score_codex":0.000071114184,"about_ca_system_score_gemma":0.000192529,"threshold_uncertainty_score":0.40895885},"labels":[],"label_agreement":null},{"id":"W3043857026","doi":"10.1016/j.scico.2011.10.005","title":"Foreword","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.04751891094183951,"score_gpt":0.27570614468198607,"score_spread":0.22818723374014654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043857026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89776456,0.000029746298,0.09725603,0.000012372012,0.00052256667,0.00033126803,0.000002012189,0.00029726842,0.0037841485],"genre_scores_gemma":[0.6217096,9.659624e-8,0.37821794,0.000009296722,0.00003503392,0.0000051561874,2.3090013e-7,0.000010263056,0.000012432676],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983781,0.000016973809,0.0002243321,0.00032927233,0.0005446332,0.00050671643],"domain_scores_gemma":[0.99910384,0.00001391398,0.00013805344,0.00037495524,0.00023178254,0.00013743449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933138,0.00010339895,0.00013580629,0.00028861366,0.00014070598,0.00004410464,0.00090022315,0.000022111448,0.000031726242],"category_scores_gemma":[0.000025813035,0.00009075639,0.000056083984,0.0014974971,0.0012958535,0.0006312452,0.00028564403,0.00007408685,0.00023258702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014685922,0.00018957602,0.010301919,0.00001922901,0.000007711506,0.000005952724,0.0036681802,0.000013211332,0.0056614266,0.023740351,0.00013261846,0.9562451],"study_design_scores_gemma":[0.0025695232,0.003543982,0.34772107,0.0005940542,0.00008997205,0.00021729026,0.0010571312,0.14625236,0.44309264,0.028257893,0.02423219,0.002371868],"about_ca_topic_score_codex":0.00004132207,"about_ca_topic_score_gemma":0.0000040213426,"teacher_disagreement_score":0.9538733,"about_ca_system_score_codex":0.000033825276,"about_ca_system_score_gemma":0.00012216232,"threshold_uncertainty_score":0.47746265},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0208030716805239,"score_gpt":0.2871346905404559,"score_spread":0.26633161885993195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125453126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009607761,0.000028651793,0.98914045,0.0002658336,0.0004202536,0.00036366025,4.931422e-7,0.00013128926,0.00004163452],"genre_scores_gemma":[0.48868868,5.337627e-7,0.5112265,0.000032361197,0.000030223911,0.000010705288,4.0283044e-7,0.000004140566,0.0000064969845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977455,0.00021625613,0.00049751287,0.00036649557,0.0007594712,0.00041474478],"domain_scores_gemma":[0.997111,0.00089764246,0.00044715585,0.0007619344,0.0007217875,0.00006043836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005439537,0.00012273632,0.00015967357,0.00022146499,0.00066960795,0.00031262726,0.0019433618,0.000028398546,0.0000021659062],"category_scores_gemma":[0.00031997828,0.0000935492,0.00006051383,0.0021078333,0.00090126164,0.0008114345,0.0005295698,0.00009598323,0.00000504781],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021677936,0.000022275963,0.0006609078,0.00000854129,0.000006335581,1.830098e-7,0.0008857016,0.0009076082,0.00041205273,0.2255697,0.00005224614,0.7714723],"study_design_scores_gemma":[0.0018384146,0.002247884,0.047609318,0.00038538143,0.000054871227,0.000092854134,0.0014757047,0.5088465,0.077624984,0.34046414,0.017978031,0.0013818993],"about_ca_topic_score_codex":0.000014224428,"about_ca_topic_score_gemma":0.0000031107068,"teacher_disagreement_score":0.7700904,"about_ca_system_score_codex":0.00004767832,"about_ca_system_score_gemma":0.00027718904,"threshold_uncertainty_score":0.51501507},"labels":[],"label_agreement":null},{"id":"W381873492","doi":"10.1016/j.scico.2015.05.007","title":"Implementability of requirements in the four-variable model","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Nondeterministic algorithm; Software; Variable (mathematics); Software system; Software requirements; Software requirements specification; Physical system; Functional requirement; Software engineering; Software construction; Theoretical computer science; Programming language; Mathematics","score_opus":0.157395670495039,"score_gpt":0.3779316375933396,"score_spread":0.2205359670983006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W381873492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08980228,0.0000122131405,0.9090744,0.00009623826,0.00022695682,0.00031893063,5.0091035e-7,0.000023247483,0.00044519166],"genre_scores_gemma":[0.45755866,2.4858622e-7,0.5423942,0.000025037185,0.000008611944,0.000010611901,1.9882822e-7,0.0000013443675,0.0000010528505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977848,0.00013910314,0.00048002246,0.00033389372,0.0009204195,0.00034177623],"domain_scores_gemma":[0.998486,0.000054966233,0.00023558957,0.0008355065,0.00032117614,0.00006676026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009960054,0.00008763991,0.00015150114,0.00016805623,0.00007354038,0.00010984903,0.0026415666,0.00002322525,5.8422086e-7],"category_scores_gemma":[0.00015788767,0.000065541346,0.00003168246,0.0017859741,0.0004061995,0.0013000126,0.00056022796,0.00008753158,8.6047487e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001168782,0.00034606343,0.0059832977,0.00006862864,0.0000051107722,0.0000010038298,0.009946976,0.0178484,0.003361746,0.47499073,0.000061577826,0.48737478],"study_design_scores_gemma":[0.00024155066,0.00017650033,0.0016194253,0.000024616433,0.0000019480524,0.000004465457,0.00015604425,0.96994275,0.005041772,0.022524634,0.00018221496,0.00008410527],"about_ca_topic_score_codex":0.00006512326,"about_ca_topic_score_gemma":0.00000289036,"teacher_disagreement_score":0.9520943,"about_ca_system_score_codex":0.00008168244,"about_ca_system_score_gemma":0.0004081282,"threshold_uncertainty_score":0.4908732},"labels":[],"label_agreement":null},{"id":"W413907436","doi":"10.1016/j.scico.2014.09.005","title":"Crawl-based analysis of web applications: Prospects and challenges","year":2014,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sketch; Web crawler; Computer science; Crawling; World Wide Web; Web application; Web testing; Field (mathematics); Data science; Web service; Web application security; Web development","score_opus":0.022321936001959024,"score_gpt":0.26792613935501,"score_spread":0.24560420335305094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W413907436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011074082,0.0003893869,0.9866874,0.00025496705,0.000040138304,0.00021508512,4.1264678e-7,0.0012384319,0.000100068064],"genre_scores_gemma":[0.522514,0.000008022269,0.47742313,0.000018262308,0.000011320764,0.00002225302,3.2113414e-7,0.0000021440994,5.4116776e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859405,0.00003576947,0.00025760685,0.00046303772,0.00041517944,0.00023435763],"domain_scores_gemma":[0.99848056,0.000260964,0.00022201966,0.0006609803,0.0002930554,0.00008241238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013811117,0.00010455299,0.0002625971,0.0006931104,0.000119807824,0.00011623021,0.000996332,0.000030672825,3.4597588e-7],"category_scores_gemma":[0.00009088942,0.000093378156,0.000056142675,0.0024082947,0.000517823,0.0002517718,0.00027814115,0.000054621127,4.5041128e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.069662e-7,0.00007444132,0.0044546984,0.00007983835,0.000019212868,2.2204057e-7,0.00021589897,0.00024282698,0.0002431247,0.028979337,0.000008500266,0.9656811],"study_design_scores_gemma":[0.00012647502,0.00026002858,0.012341147,0.00006962482,0.000044383,0.000002347116,0.0000035294763,0.97421837,0.0024850366,0.009225173,0.001061964,0.00016191414],"about_ca_topic_score_codex":0.0000126740915,"about_ca_topic_score_gemma":0.0000025585537,"teacher_disagreement_score":0.97397554,"about_ca_system_score_codex":0.000013789218,"about_ca_system_score_gemma":0.00010083039,"threshold_uncertainty_score":0.38078508},"labels":[],"label_agreement":null},{"id":"W4252400262","doi":"10.1016/j.scico.2004.07.005","title":"Generation of fast interpreters for Huffman compressed bytecode","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Opcode; Computer science; Bytecode; Operand; Byte; Huffman coding; Operating system; Just-in-time compilation; Virtual memory; Virtual machine; Parallel computing; Programming language; Algorithm; Memory management; Data compression","score_opus":0.03493034153137976,"score_gpt":0.29447289235625357,"score_spread":0.2595425508248738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252400262","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03937841,0.000054033142,0.9594457,0.00016891511,0.00048687457,0.0003362071,0.000006007573,0.000071104,0.00005271699],"genre_scores_gemma":[0.47104287,0.0000013947376,0.52878946,0.000031404405,0.00011041735,0.000011630742,0.0000039653332,0.000003736731,0.0000051366915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823785,0.000024866848,0.0004318525,0.00048192084,0.00047161168,0.00035191336],"domain_scores_gemma":[0.99863356,0.000060570306,0.00028064783,0.00060416776,0.0003191855,0.000101884114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524216,0.00014193797,0.00023430612,0.00024209337,0.00018692495,0.00020409905,0.0017662417,0.00003769071,0.00000217375],"category_scores_gemma":[0.000019645959,0.00012121298,0.00009181899,0.00054446526,0.00032538635,0.0014857504,0.0006149865,0.0000677338,0.0000016758747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050470685,0.000093558294,0.000047753365,0.000029638955,0.0000061662727,2.5092407e-7,0.0008486199,0.0030106425,0.03204997,0.0070690573,0.00023440867,0.9566049],"study_design_scores_gemma":[0.0002859896,0.00023769205,0.0001382936,0.00006541094,0.0000035877972,0.000003927703,0.000014723202,0.91353726,0.081730515,0.00020236784,0.0036486948,0.00013155265],"about_ca_topic_score_codex":0.000012340938,"about_ca_topic_score_gemma":0.0000033880865,"teacher_disagreement_score":0.95647335,"about_ca_system_score_codex":0.000034781708,"about_ca_system_score_gemma":0.00010849526,"threshold_uncertainty_score":0.4942922},"labels":[],"label_agreement":null},{"id":"W4379745561","doi":"10.1016/j.scico.2023.102973","title":"Special issue on Tools at the 29th IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER 2022)","year":2023,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Business process reengineering; Software engineering; Software; Systems engineering; Programming language; Manufacturing engineering; Engineering","score_opus":0.11004311249968979,"score_gpt":0.37031334836422675,"score_spread":0.26027023586453696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379745561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6103117,0.000025261226,0.36253378,0.003375103,0.016971938,0.000751287,0.000055496635,0.00033656857,0.0056388997],"genre_scores_gemma":[0.9779544,0.000008393909,0.015595036,0.00011604537,0.002725949,0.000013975632,0.000027341806,0.000009331251,0.0035495502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958627,0.00006530844,0.00041953128,0.00086757133,0.0024337624,0.00035108163],"domain_scores_gemma":[0.9981124,0.00047796906,0.00020116106,0.0008208413,0.00029259422,0.000095024545],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006054827,0.00013188165,0.00019752198,0.001083834,0.0004983462,0.0012353543,0.0016694706,0.000026385113,0.00015616088],"category_scores_gemma":[0.00067281234,0.00008673481,0.00009236971,0.004895692,0.0005067858,0.00040774728,0.0009655003,0.000115847855,0.00019509353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015137301,0.000030830855,0.0018965434,0.0000033704873,0.000034699882,0.0000048268143,0.00045073632,0.045653924,0.00010081993,0.004333066,0.024601812,0.9228742],"study_design_scores_gemma":[0.00024179003,0.00018319723,0.06432522,0.00006413125,0.00003507569,0.0000037220586,0.00055887783,0.8362387,0.00031248174,0.0013340679,0.096448906,0.0002538543],"about_ca_topic_score_codex":0.000017525539,"about_ca_topic_score_gemma":0.000024909254,"teacher_disagreement_score":0.92262036,"about_ca_system_score_codex":0.00008929471,"about_ca_system_score_gemma":0.000057767305,"threshold_uncertainty_score":0.99980146},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0676608071989877,"score_gpt":0.3268068828846064,"score_spread":0.2591460756856187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382930431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011393717,0.000037447837,0.9749328,0.00025385636,0.00075723947,0.0006193952,0.0000016616128,0.011977534,0.00002635492],"genre_scores_gemma":[0.39497632,1.7031427e-7,0.6048055,0.000038290596,0.000085755564,0.00007676825,9.884722e-7,0.000010861904,0.0000053092804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973008,0.000049658076,0.0003890664,0.000708943,0.00071013,0.0008413907],"domain_scores_gemma":[0.9967106,0.0015079849,0.00019098849,0.0008218538,0.0005950604,0.00017351618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030266605,0.00018303085,0.00026639138,0.00062894076,0.00049367733,0.0007383706,0.00220505,0.000070158014,2.1156556e-7],"category_scores_gemma":[0.00093025726,0.00017370182,0.00008875638,0.0045218463,0.00045786466,0.00043315245,0.0005610158,0.00016251036,0.000009489309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039923157,0.00008535866,0.0024813472,0.00028248414,0.000008709315,0.000015891581,0.0007197911,0.017190734,0.0005578463,0.057937317,0.0006403649,0.9200762],"study_design_scores_gemma":[0.00011766097,0.00037948124,0.00086307205,0.00037842692,0.000003130017,0.000012456116,0.00000915123,0.9767142,0.0015797726,0.0194353,0.000292425,0.00021491626],"about_ca_topic_score_codex":0.00006778606,"about_ca_topic_score_gemma":2.3644641e-7,"teacher_disagreement_score":0.9595235,"about_ca_system_score_codex":0.00007391203,"about_ca_system_score_gemma":0.0005844146,"threshold_uncertainty_score":0.71201247},"labels":[],"label_agreement":null},{"id":"W4385597996","doi":"10.1016/j.scico.2023.103004","title":"MMINT-A: A framework for model-based safety assurance","year":2023,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Traceability; Computer science; Safety assurance; Functional safety; Risk analysis (engineering); Fault tree analysis; System safety; Safety case; Safety standards; Systems engineering; Process management; Software engineering; Reliability engineering; Business; Engineering","score_opus":0.015281875908712475,"score_gpt":0.25435234624855546,"score_spread":0.239070470339843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385597996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094556715,0.000048475064,0.9874283,0.0000768881,0.001199739,0.00049451547,0.000006851486,0.0012064303,0.000083137136],"genre_scores_gemma":[0.52247286,0.000001265017,0.47733665,0.0000070192427,0.00007476527,0.000074151816,0.0000024388635,0.00002374877,0.0000071181576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844205,0.0000063913085,0.00035288237,0.0002951301,0.0003352923,0.0005682719],"domain_scores_gemma":[0.99907684,0.00025402103,0.00005426507,0.00039155842,0.000122414,0.00010086996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085680024,0.00016867847,0.00024507893,0.0003104293,0.00011301329,0.00007259671,0.0005815364,0.000070721886,0.0000010920753],"category_scores_gemma":[0.000082073566,0.00017845257,0.000098505174,0.0015079844,0.00018027384,0.00020591842,0.000057261666,0.00011925193,0.000012904564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002804614,0.0000066851235,0.00005589821,0.0002544661,0.000008282325,6.5368533e-7,0.00017589037,0.92685443,0.0007448344,0.0054074475,0.00007534535,0.06641328],"study_design_scores_gemma":[0.00016868135,0.000035366684,0.00047502783,0.00023025273,0.0000043526857,0.0000012164094,0.00001178517,0.99205995,0.002820545,0.00079352,0.0032055995,0.00019370252],"about_ca_topic_score_codex":0.000001331024,"about_ca_topic_score_gemma":4.4476792e-7,"teacher_disagreement_score":0.5130172,"about_ca_system_score_codex":0.00009957112,"about_ca_system_score_gemma":0.00013026943,"threshold_uncertainty_score":0.72770846},"labels":[],"label_agreement":null},{"id":"W4389331053","doi":"10.1016/j.scico.2023.103072","title":"Preface to the special issue on success stories in model driven engineering","year":2023,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Data science; Software engineering","score_opus":0.015782607299238575,"score_gpt":0.26865169230635255,"score_spread":0.25286908500711397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389331053","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04317088,0.0000046070154,0.9540937,0.00073852536,0.00078722095,0.00043072138,9.904255e-7,0.00073276076,0.000040616324],"genre_scores_gemma":[0.27964798,0.000001993865,0.7196854,0.000040547035,0.0005150952,0.000063752275,4.9138197e-7,0.000013219112,0.000031549946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778724,0.000020404428,0.00028353313,0.0005538107,0.0007634783,0.00059150765],"domain_scores_gemma":[0.99886775,0.0000713385,0.00006380177,0.0007583531,0.0001214091,0.00011737173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488372,0.00018462712,0.00020534435,0.00063293515,0.00013283847,0.0002831233,0.002868691,0.000042920223,8.8478095e-7],"category_scores_gemma":[0.000026976782,0.00015315793,0.000049375383,0.00342541,0.00011379314,0.0006365669,0.0010459955,0.00020416512,0.000021188709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001462902,0.000017613955,0.00012672745,0.00001426846,0.000001757083,0.000004237493,0.0027165355,0.7596113,0.00017903656,0.028741747,0.00035847552,0.2082268],"study_design_scores_gemma":[0.00006495252,0.00010858602,0.001128819,0.00010416998,8.7783746e-7,0.000001847831,0.0000054087996,0.97575355,0.0024074176,0.00017275462,0.020073673,0.0001779213],"about_ca_topic_score_codex":0.000020088084,"about_ca_topic_score_gemma":0.000009092193,"teacher_disagreement_score":0.2364771,"about_ca_system_score_codex":0.00011815729,"about_ca_system_score_gemma":0.00011720632,"threshold_uncertainty_score":0.6245599},"labels":[],"label_agreement":null},{"id":"W4391692598","doi":"10.1016/j.scico.2024.103091","title":"Preface for the Special Issue on Tools and Demonstrations in Model-Driven Engineering","year":2024,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McGill University","funders":"","keywords":"Computer science; Software engineering; Data science","score_opus":0.01979006410005019,"score_gpt":0.268807964185722,"score_spread":0.24901790008567182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391692598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029147645,0.00006457685,0.9951221,0.0005591583,0.00042445978,0.00055285136,0.000002847384,0.00033273225,0.00002653953],"genre_scores_gemma":[0.16237555,0.0000068773556,0.83718336,0.000017510603,0.0003165648,0.00008209493,4.5695293e-7,0.000008276549,0.000009298243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987552,0.000007919712,0.0002197825,0.00041841454,0.0002913645,0.0003072967],"domain_scores_gemma":[0.9993033,0.00020727227,0.000030818384,0.0003374351,0.00006446437,0.000056732584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060547976,0.00013080503,0.0001298782,0.0002717919,0.000106294254,0.0005736234,0.0008878996,0.000037658025,4.6111745e-7],"category_scores_gemma":[0.000015950967,0.00010356319,0.00004427246,0.0007656551,0.00014556831,0.00081823295,0.00024767497,0.00015064837,9.3437285e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.16344e-7,0.000011712968,0.000012205436,0.000033444867,0.0000031560503,0.0000012630218,0.0006542766,0.2664893,0.00027105262,0.1687533,0.000066219174,0.56370324],"study_design_scores_gemma":[0.000055160494,0.00009278404,0.00015470368,0.00015727131,0.0000027365877,0.000005865812,0.000002014573,0.98142314,0.0012808137,0.0005505015,0.016160838,0.00011415725],"about_ca_topic_score_codex":0.000002672147,"about_ca_topic_score_gemma":0.0000020574653,"teacher_disagreement_score":0.7149339,"about_ca_system_score_codex":0.000054267795,"about_ca_system_score_gemma":0.00011953639,"threshold_uncertainty_score":0.55314636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048509631537457715,"score_gpt":0.30092492511967533,"score_spread":0.2524152935822176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393359044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12098255,0.0002636799,0.8775112,0.00011198083,0.00048655696,0.00015751326,1.7045522e-7,0.0004807591,0.000005596136],"genre_scores_gemma":[0.44000235,0.000003115155,0.5599461,0.0000042484194,0.0000114383,0.000025844512,5.522826e-7,0.000004557767,0.0000017658208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985204,0.000020448375,0.00030841352,0.00036417428,0.0005149925,0.00027159182],"domain_scores_gemma":[0.99924433,0.00018563474,0.000091992515,0.0003169277,0.00010679113,0.000054318796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016208909,0.00012113248,0.00016688471,0.000593039,0.0000734173,0.00021590853,0.0008657599,0.000026873842,0.0000012118891],"category_scores_gemma":[0.00008118242,0.00011557697,0.000040255152,0.0015537348,0.00011753154,0.0019005666,0.00023824771,0.00014076995,0.0000025553159],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014557222,0.00003930119,0.0009923842,0.00025106032,0.000004389029,0.0000087704275,0.0018383913,0.028142326,0.00019208691,0.0028362428,0.000012802775,0.9656808],"study_design_scores_gemma":[0.00010596018,0.00018727007,0.006623303,0.0011178834,0.0000038991357,0.0000071050895,0.000020228134,0.93399715,0.047896534,0.00053511345,0.009238684,0.0002668656],"about_ca_topic_score_codex":0.000026825717,"about_ca_topic_score_gemma":0.000002078311,"teacher_disagreement_score":0.9654139,"about_ca_system_score_codex":0.00007971486,"about_ca_system_score_gemma":0.00032283147,"threshold_uncertainty_score":0.4713092},"labels":[],"label_agreement":null},{"id":"W4407685505","doi":"10.1016/j.scico.2025.103284","title":"Graph neural network-based long method and blob code smell detection","year":2025,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Software Engineering Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Graph; Code (set theory); Artificial intelligence; Artificial neural network; Theoretical computer science; Programming language","score_opus":0.013471483309353492,"score_gpt":0.29774889675374216,"score_spread":0.28427741344438867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407685505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0943259,0.0001776152,0.9041035,0.00015417319,0.0007025073,0.00024335626,1.8587471e-7,0.00027906627,0.000013662002],"genre_scores_gemma":[0.55297476,0.0000010729722,0.4469305,0.00003985304,0.000033026,0.000010819173,1.5388821e-7,0.0000038244334,0.0000060085904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978912,0.00007975167,0.00025245926,0.00061805185,0.00055116706,0.00060735707],"domain_scores_gemma":[0.9984337,0.000579494,0.00007637231,0.00053599954,0.00024073095,0.00013369205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020373573,0.00014966134,0.00019684443,0.0005464749,0.0002853509,0.00046689043,0.0012679423,0.000049178343,5.740373e-7],"category_scores_gemma":[0.0001459606,0.00014474419,0.00006026708,0.003547536,0.0003789534,0.0005268077,0.0006194593,0.00021202894,8.645892e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035591372,0.000028179456,0.010811585,0.000062017374,0.000007814815,0.0000059334006,0.00008101543,0.050359342,0.00092312385,0.0018927867,0.000011641062,0.935813],"study_design_scores_gemma":[0.00024828143,0.00014619135,0.057133194,0.00008193613,0.000005098788,0.000011493294,0.000002459448,0.9304205,0.010432789,0.0011480378,0.00021963562,0.00015039432],"about_ca_topic_score_codex":0.000026012367,"about_ca_topic_score_gemma":0.000008660432,"teacher_disagreement_score":0.9356626,"about_ca_system_score_codex":0.00004839978,"about_ca_system_score_gemma":0.0001786049,"threshold_uncertainty_score":0.5902497},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08808852585487233,"score_gpt":0.3382831394588602,"score_spread":0.25019461360398787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W989621208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01476371,0.0004232416,0.98094165,0.0003448288,0.0004993378,0.00018840544,0.0000013663689,0.00274932,0.00008815049],"genre_scores_gemma":[0.47778016,0.0000012903834,0.5220833,0.000063878055,0.000060467788,0.000002241073,0.0000010023238,0.0000048715315,0.0000027931753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977244,0.00004684046,0.0002994811,0.00082948,0.0006596282,0.0004401323],"domain_scores_gemma":[0.99775064,0.00020246813,0.00018480378,0.0013796313,0.00030622171,0.00017622276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022601874,0.00017555855,0.00022497062,0.0002591664,0.00018134213,0.00065967214,0.0037385423,0.000061114,3.6396133e-7],"category_scores_gemma":[0.00047163776,0.00015304142,0.0000212156,0.0010753301,0.00041849702,0.0019232143,0.0037995263,0.00018089658,0.00000238817],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030592707,0.00003540419,0.00059589994,0.000024982395,0.0000047168974,0.000009534359,0.0019767135,0.00028297486,0.00017788664,0.001591745,0.0013667335,0.99393034],"study_design_scores_gemma":[0.00015885783,0.00025179292,0.00013162369,0.00024620662,0.0000046046152,0.00005275644,0.00003472819,0.9843355,0.001107819,0.012267433,0.0011736223,0.00023505579],"about_ca_topic_score_codex":0.000018973109,"about_ca_topic_score_gemma":0.000001331196,"teacher_disagreement_score":0.9936953,"about_ca_system_score_codex":0.00003656023,"about_ca_system_score_gemma":0.00022590249,"threshold_uncertainty_score":0.6947204},"labels":[],"label_agreement":null}]}