{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13798581,0.00062988995,0.81278205,0.00034542521,0.00020334698,0.00023266357,0.00020003215,0.041961644,0.0056591625],"genre_scores_gemma":[0.7445844,0.00029538237,0.25014257,0.000075016644,0.000038328388,0.00009344756,0.0006362344,0.0015105552,0.0026241478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987198,0.00037066295,0.00007322401,0.00019350699,0.0005092351,0.0001335772],"domain_scores_gemma":[0.9968856,0.0012183173,0.00017396736,0.00072139077,0.0008476492,0.00015304412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010415129,0.0010682183,0.00083114364,0.0016876253,0.00075086835,0.0013678806,0.0009487677,0.0008338181,0.0025318037],"category_scores_gemma":[0.0059477356,0.00081548636,0.00043809446,0.000916308,0.00044111203,0.001002087,0.0010348546,0.00089207356,0.00151074],"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.0013689476,0.00029536858,0.0072026327,0.0005670014,0.00011569326,0.0009097524,0.00057886366,0.106653385,0.20870359,0.009994501,0.014582094,0.6490282],"study_design_scores_gemma":[0.000078782665,0.000108477936,0.003466325,0.00004118642,0.00007514054,0.00023809008,0.0001026975,0.92210877,0.060433395,0.0052895565,0.00802823,0.00002927406],"about_ca_topic_score_codex":0.0032174734,"about_ca_topic_score_gemma":0.0041590193,"teacher_disagreement_score":0.0032174734,"about_ca_system_score_codex":0.00068511907,"about_ca_system_score_gemma":0.00097466353,"threshold_uncertainty_score":0.008469701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036685064,0.03819481,0.7861088,0.087894715,0.007030683,0.00015356496,0.00021944719,0.0007323192,0.07599711],"genre_scores_gemma":[0.4198793,0.027574763,0.4449825,0.03289497,0.01627477,0.0011979418,0.00039616716,0.0011761219,0.055623554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928833,0.0039523477,0.0002803801,0.00082543073,0.0017923332,0.00026621658],"domain_scores_gemma":[0.9831838,0.012429767,0.00036282034,0.002028647,0.0014642834,0.00053063396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013879565,0.0014833404,0.0016150668,0.0026199792,0.0027692267,0.007561416,0.0029509922,0.0053893453,0.0050341235],"category_scores_gemma":[0.019064695,0.0010743912,0.002049758,0.0010629816,0.036963116,0.02154586,0.003855611,0.012121248,0.0021518357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000010868963,0.000009613273,0.000038217102,0.000060982347,0.0000074359614,0.000008803179,0.00019167065,0.00019129939,0.00006185561,0.9933015,0.0023202314,0.003797586],"study_design_scores_gemma":[0.000020120275,0.000009930449,0.00001962939,0.00007283396,0.0000043624377,0.000025072824,0.00005442628,0.0005532937,0.00010235426,0.9622615,0.036866587,0.000009841111],"about_ca_topic_score_codex":0.0022237762,"about_ca_topic_score_gemma":0.00090456347,"teacher_disagreement_score":0.013879565,"about_ca_system_score_codex":0.004037801,"about_ca_system_score_gemma":0.0038282403,"threshold_uncertainty_score":0.07340306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031057218,0.0001382677,0.95544267,0.00057533797,0.000049330025,0.00025319832,0.00014674957,0.0007739848,0.011563324],"genre_scores_gemma":[0.82854384,0.00021520258,0.1650412,0.00018171145,0.00006508637,0.00043453302,0.00027065503,0.00014880243,0.0050989264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968262,0.0008925053,0.00019748056,0.00035576415,0.001447896,0.0002801368],"domain_scores_gemma":[0.99306726,0.0038475145,0.00073323783,0.00084380194,0.0012729879,0.0002351954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003078137,0.0009779414,0.0007405296,0.003709173,0.000769847,0.002205344,0.0019154542,0.001977488,0.004656151],"category_scores_gemma":[0.0144955795,0.0004492531,0.0012928679,0.0020807378,0.0015362098,0.00536985,0.0015096162,0.0018068803,0.0008660705],"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.00021436388,0.000544088,0.008080559,0.00023384704,0.00017819954,0.00037328704,0.00061725965,0.6042904,0.005496221,0.22588715,0.0027113075,0.15137333],"study_design_scores_gemma":[0.000026612825,0.00012806566,0.0012853189,0.000021273312,0.000059432885,0.00010132972,0.00006607852,0.9192698,0.0010864651,0.0763881,0.0015422826,0.000025335064],"about_ca_topic_score_codex":0.005568153,"about_ca_topic_score_gemma":0.0039619445,"teacher_disagreement_score":0.005568153,"about_ca_system_score_codex":0.0016817359,"about_ca_system_score_gemma":0.0012131302,"threshold_uncertainty_score":0.016278923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037989005,0.00014985124,0.9511547,0.00010543252,0.00011661016,0.0002499719,0.00021448277,0.0036075271,0.006412385],"genre_scores_gemma":[0.7052403,0.00025261161,0.28894055,0.0001176262,0.000041280837,0.00036261533,0.0005891322,0.0005303485,0.0039255037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583095,0.0017017219,0.00022077863,0.00028500723,0.0015678448,0.00039374264],"domain_scores_gemma":[0.99424994,0.0035182366,0.00032390884,0.00090284034,0.00095762487,0.000047404486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003403415,0.0007438666,0.00045784807,0.00090276956,0.00055192737,0.0014007337,0.0010040815,0.0008979967,0.0041955267],"category_scores_gemma":[0.0091194045,0.00040939508,0.001040492,0.0002955009,0.0016501672,0.0011920212,0.00067449966,0.0010126164,0.0008501354],"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.0009031408,0.00028651423,0.0024562394,0.0013415422,0.0001599141,0.0007683021,0.0009564365,0.29626632,0.0925695,0.430123,0.0056188074,0.16855025],"study_design_scores_gemma":[0.00024407484,0.00039085338,0.00093290897,0.00030184176,0.00016143658,0.0002478237,0.00009321054,0.69404423,0.17335193,0.09740476,0.03274511,0.00008184672],"about_ca_topic_score_codex":0.006512422,"about_ca_topic_score_gemma":0.0045736493,"teacher_disagreement_score":0.006512422,"about_ca_system_score_codex":0.0010730742,"about_ca_system_score_gemma":0.0032986298,"threshold_uncertainty_score":0.017999172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9302327,0.00022098426,0.06641379,0.00027092503,0.000019251102,0.00004582091,0.00008564262,0.00036827708,0.002342563],"genre_scores_gemma":[0.98566806,0.00006941352,0.013183583,0.000017746159,0.000014097613,0.000022520897,0.00006789498,0.00007212016,0.0008846043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991304,0.00027787118,0.000046768484,0.00012797888,0.00030646974,0.00011045619],"domain_scores_gemma":[0.97123003,0.023896424,0.0011068835,0.0019177396,0.0012029359,0.00064598315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015016447,0.0002574113,0.0003843778,0.0011455886,0.0012739308,0.0010168183,0.0012947577,0.00064314995,0.0015484839],"category_scores_gemma":[0.020094438,0.00039559705,0.00048289922,0.0015205778,0.0015847506,0.0030563471,0.000810417,0.0011000045,0.000116354444],"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.0035286692,0.0014662972,0.08560231,0.0005789608,0.00022631894,0.002022512,0.005905713,0.21513975,0.06409425,0.4544997,0.0028649902,0.16407058],"study_design_scores_gemma":[0.00009819881,0.00044429718,0.0065243337,0.000030150812,0.00007683047,0.00043081367,0.0008285842,0.85435826,0.014653001,0.12074639,0.0017756047,0.00003351418],"about_ca_topic_score_codex":0.003113991,"about_ca_topic_score_gemma":0.002245515,"teacher_disagreement_score":0.003113991,"about_ca_system_score_codex":0.0007681439,"about_ca_system_score_gemma":0.0010900752,"threshold_uncertainty_score":0.007941604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014896875,0.00003104381,0.98964065,0.00010176195,0.000039841132,0.000092852395,0.000069803835,0.004749967,0.0037844146],"genre_scores_gemma":[0.091607556,0.00019102402,0.89013547,0.00036008458,0.000045313893,0.0006016596,0.00044146035,0.0027259982,0.013891569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992161,0.00026387212,0.00006765057,0.00015277689,0.00023454618,0.00006506078],"domain_scores_gemma":[0.99872786,0.000528139,0.000062865096,0.00040805116,0.0001425768,0.00013047883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011885037,0.00082120515,0.00049994997,0.0005054565,0.0007329059,0.0021665052,0.0026568929,0.0010535211,0.0089362655],"category_scores_gemma":[0.003948076,0.0006757601,0.0013025115,0.00038548012,0.0018064333,0.0028557968,0.002411339,0.0033617173,0.0019336619],"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.0001729263,0.0002404627,0.00084308506,0.0003450629,0.00006813292,0.0002616481,0.0018791023,0.022388328,0.01486663,0.7585368,0.01991762,0.18048023],"study_design_scores_gemma":[0.00010690119,0.00012022112,0.00025568684,0.00011699343,0.00005563039,0.0005457238,0.00016740836,0.33858615,0.019182984,0.4622574,0.17853701,0.00006783897],"about_ca_topic_score_codex":0.0014966575,"about_ca_topic_score_gemma":0.0026083186,"teacher_disagreement_score":0.0089362655,"about_ca_system_score_codex":0.0005693636,"about_ca_system_score_gemma":0.00094235735,"threshold_uncertainty_score":0.02989477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073333,0.0008799393,0.90092564,0.005900592,0.00023056894,0.0003152159,0.000705183,0.0016259996,0.016083801],"genre_scores_gemma":[0.7343896,0.0011820506,0.2560317,0.00040705246,0.00014022025,0.00017906021,0.0016642445,0.000793936,0.0052121426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9868869,0.0047982256,0.001566798,0.001624477,0.0045367945,0.0005868174],"domain_scores_gemma":[0.8984229,0.049883563,0.0064116237,0.027327428,0.016860155,0.0010942586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01305477,0.0005770697,0.00068293296,0.0059403908,0.0025719039,0.00864943,0.0017598673,0.002278874,0.0027551006],"category_scores_gemma":[0.11617535,0.0011943204,0.0013034579,0.0033287609,0.0047282567,0.024575269,0.0059522083,0.003559115,0.0005905851],"study_design_candidate":"not_applicable","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.00012735564,0.0001004586,0.019158494,0.00036921585,0.000069431975,0.0009020991,0.007617918,0.011143273,0.002338166,0.8316121,0.004278421,0.122283004],"study_design_scores_gemma":[0.00002748528,0.000052561256,0.0030147776,0.0003494976,0.00012852377,0.00057652505,0.0021641299,0.07639355,0.0059197093,0.8478037,0.06351636,0.000053250664],"about_ca_topic_score_codex":0.011240385,"about_ca_topic_score_gemma":0.007821604,"teacher_disagreement_score":0.01305477,"about_ca_system_score_codex":0.0019363093,"about_ca_system_score_gemma":0.0054664095,"threshold_uncertainty_score":0.06904107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017157959,0.0007456539,0.9431426,0.0005335495,0.00026652997,0.000039235267,0.00008277599,0.00048502212,0.03754667],"genre_scores_gemma":[0.79946774,0.0009181856,0.17615084,0.00033429058,0.00025308723,0.00020119957,0.00015003103,0.00016261954,0.022362072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920875,0.00013452912,0.00005412775,0.00012485808,0.00041089547,0.00006689191],"domain_scores_gemma":[0.9994809,0.00022743293,0.000047400026,0.00009143158,0.00012824142,0.000024638673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741413,0.0006578599,0.00094674644,0.0007624563,0.00083670084,0.0016198016,0.001234428,0.00071270677,0.0034131375],"category_scores_gemma":[0.0013413989,0.0005040891,0.0011526758,0.00063390366,0.0025355178,0.0020469392,0.0012007791,0.0017185009,0.00050523906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000017539114,0.00000973239,0.00005362492,0.00003734316,0.000010787434,0.00003212726,0.00008748107,0.022142768,0.00075460057,0.96881324,0.0004527713,0.0075880773],"study_design_scores_gemma":[0.000017431226,0.000024481511,0.000058412723,0.000018838433,0.000018963365,0.000019912022,0.000026320218,0.087563634,0.001215704,0.90678036,0.0042460635,0.0000100133975],"about_ca_topic_score_codex":0.0032284295,"about_ca_topic_score_gemma":0.0024022392,"teacher_disagreement_score":0.0034131375,"about_ca_system_score_codex":0.0014441822,"about_ca_system_score_gemma":0.001131972,"threshold_uncertainty_score":0.011418104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042353883,0.0030577602,0.912917,0.00501936,0.0005604445,0.000082424835,0.00056493626,0.00088419585,0.034560025],"genre_scores_gemma":[0.7144772,0.0037275783,0.25928503,0.002540181,0.0026865236,0.00039302275,0.001990748,0.0005597183,0.014340038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99125165,0.0027383887,0.0009329595,0.0019996797,0.0021075467,0.0009698681],"domain_scores_gemma":[0.9662519,0.020267658,0.0031090328,0.0061006267,0.003188278,0.0010825454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930047,0.0011395796,0.0013521746,0.0040681316,0.003975805,0.0069590784,0.002815696,0.00302756,0.00699872],"category_scores_gemma":[0.029906146,0.0014987077,0.002450157,0.004005457,0.01722547,0.03065262,0.0056756367,0.007462204,0.0013465412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00003442178,0.000028301138,0.0004787455,0.000043148157,0.000010171187,0.00007963493,0.00033640294,0.000515867,0.0002187006,0.9881632,0.0012523165,0.008839191],"study_design_scores_gemma":[0.000009377522,0.000009684641,0.000103759376,0.000017064036,0.000017693857,0.000073372226,0.00007687312,0.0019537278,0.0003122038,0.99503726,0.002376314,0.000012561921],"about_ca_topic_score_codex":0.0023747436,"about_ca_topic_score_gemma":0.0017018522,"teacher_disagreement_score":0.008930047,"about_ca_system_score_codex":0.0019623572,"about_ca_system_score_gemma":0.002201225,"threshold_uncertainty_score":0.047227144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17349705,0.00014792905,0.814922,0.001208553,0.00009869718,0.00017572002,0.00040915768,0.00614704,0.0033938386],"genre_scores_gemma":[0.7351003,0.00010046948,0.2617373,0.00035738104,0.00008608153,0.000087601205,0.00066524936,0.000591139,0.0012745445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945868,0.0015313731,0.00043656706,0.0009574086,0.0016764646,0.00081137795],"domain_scores_gemma":[0.98370636,0.012103475,0.000913663,0.0019561849,0.00090334885,0.00041707614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005792462,0.0009726088,0.0010370436,0.001454114,0.0014806653,0.0038884787,0.0040102666,0.0033843813,0.0026907902],"category_scores_gemma":[0.022549586,0.0016020195,0.0028671874,0.00083104934,0.0036789093,0.0102055855,0.0046981135,0.0036453998,0.00035618487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0016876576,0.0010715349,0.025959522,0.0017526618,0.00073202763,0.007116703,0.003800055,0.3363646,0.06658834,0.4484821,0.00868909,0.09775579],"study_design_scores_gemma":[0.00029428044,0.00018586921,0.0010147055,0.00011375575,0.00030858253,0.0005645447,0.00054639403,0.59492767,0.035708245,0.36138967,0.0048703263,0.00007594559],"about_ca_topic_score_codex":0.0023047698,"about_ca_topic_score_gemma":0.0033687782,"teacher_disagreement_score":0.005792462,"about_ca_system_score_codex":0.0009315845,"about_ca_system_score_gemma":0.0014420082,"threshold_uncertainty_score":0.030633867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014831751,0.00006553858,0.97561467,0.00010222489,0.000036134552,0.00012623811,0.00012523327,0.0012691332,0.007829065],"genre_scores_gemma":[0.3243844,0.00026324147,0.6641281,0.00013639645,0.000020628933,0.00037924893,0.0004332635,0.00083375775,0.0094209425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981248,0.0005409066,0.00014576576,0.00046247983,0.00042486872,0.00030114633],"domain_scores_gemma":[0.99591917,0.0020974984,0.0004175629,0.0009814197,0.00041228865,0.00017203801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019076277,0.0011278861,0.0009124511,0.001112981,0.0009962275,0.0036300146,0.002713691,0.001979943,0.008400873],"category_scores_gemma":[0.006354854,0.0013951296,0.0022459999,0.0012775254,0.0022258656,0.005186937,0.0023681936,0.0022374133,0.0016473422],"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.00022867009,0.00015340402,0.0014088904,0.00024961605,0.00007073493,0.0007748938,0.0006578571,0.3316738,0.014328134,0.6190818,0.0010962867,0.030275831],"study_design_scores_gemma":[0.0000736373,0.000048595775,0.00017568756,0.0000545636,0.00007680588,0.00016733476,0.00013935962,0.82605743,0.013487471,0.14462838,0.0150311515,0.00005965128],"about_ca_topic_score_codex":0.009677315,"about_ca_topic_score_gemma":0.016230837,"teacher_disagreement_score":0.009677315,"about_ca_system_score_codex":0.0011723874,"about_ca_system_score_gemma":0.0019270814,"threshold_uncertainty_score":0.028103769},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025920055,0.0004425075,0.5278517,0.00022784983,0.00015109686,0.00028628256,0.0036845976,0.4558502,0.008913747],"genre_scores_gemma":[0.04957659,0.0012383126,0.84840363,0.0004965256,0.0001302922,0.0010185362,0.016583463,0.06724218,0.015310484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744105,0.00067833735,0.00017814181,0.0004119161,0.0010923641,0.00019820916],"domain_scores_gemma":[0.99511343,0.0023978925,0.00024123356,0.0016144775,0.00037285534,0.00026014558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384071,0.0024328528,0.0019324734,0.002224318,0.00086423557,0.0036440734,0.005661873,0.001617777,0.03238906],"category_scores_gemma":[0.008893183,0.0017753307,0.002466921,0.0014168688,0.0010300144,0.0044647628,0.0055571673,0.003945358,0.013074082],"study_design_candidate":"not_applicable","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.0023873374,0.0006854179,0.0025934877,0.0024119269,0.00057754817,0.0009843857,0.0016087212,0.02192651,0.030425996,0.06405771,0.36081034,0.5115306],"study_design_scores_gemma":[0.0012043414,0.00041517674,0.0019868594,0.0005016761,0.0002607562,0.0010297948,0.00025543084,0.27431232,0.058930036,0.06858795,0.59201354,0.0005021323],"about_ca_topic_score_codex":0.0023504035,"about_ca_topic_score_gemma":0.0040335353,"teacher_disagreement_score":0.03238906,"about_ca_system_score_codex":0.0006067924,"about_ca_system_score_gemma":0.0018403339,"threshold_uncertainty_score":0.108352244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010470673,0.0023193357,0.9165828,0.0046045086,0.0016240232,0.000105630796,0.00079820934,0.0012737042,0.06222113],"genre_scores_gemma":[0.3127822,0.0031597756,0.6601753,0.0031191902,0.00147356,0.0004947604,0.0014910657,0.0017255046,0.0155786835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941806,0.0028564252,0.00077731407,0.00077207445,0.0009161204,0.00049736665],"domain_scores_gemma":[0.99239737,0.0034735568,0.00066418975,0.0013275373,0.001900945,0.0002364306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006309564,0.0011172311,0.001052199,0.00312063,0.0031693457,0.011188905,0.0029850774,0.002562885,0.010782554],"category_scores_gemma":[0.018625854,0.0013463252,0.0015820641,0.0040614954,0.009997412,0.021768847,0.004373636,0.005240186,0.0042638103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000012244642,0.000003575935,0.00004591506,0.00004256679,0.0000034331038,0.000025529906,0.00042149684,0.00018083838,0.00023639141,0.99257267,0.0014235433,0.005031715],"study_design_scores_gemma":[0.0000125128645,0.000012675994,0.000047833822,0.000105435276,0.000013193122,0.000101455014,0.00029631256,0.002544771,0.0008690405,0.9458282,0.05014727,0.000021302278],"about_ca_topic_score_codex":0.0013598398,"about_ca_topic_score_gemma":0.0010092191,"teacher_disagreement_score":0.011188905,"about_ca_system_score_codex":0.002339684,"about_ca_system_score_gemma":0.0017440435,"threshold_uncertainty_score":0.03607118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023153428,0.00058858213,0.9003127,0.0013172976,0.00039979312,0.0000813647,0.00048817607,0.0019679999,0.07169052],"genre_scores_gemma":[0.59894973,0.0012242512,0.3358854,0.0008408632,0.0006598469,0.00026283305,0.0006770842,0.00054751267,0.060952447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915516,0.00016036679,0.0000448822,0.00012647099,0.00039953183,0.00011365788],"domain_scores_gemma":[0.99903095,0.00033043607,0.000067445195,0.00016297138,0.0002650524,0.00014316296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012350602,0.0005920618,0.0004543512,0.0013476638,0.0018284364,0.0032700389,0.0012473844,0.0009023255,0.009685311],"category_scores_gemma":[0.002723345,0.0005077077,0.0008761533,0.0014518277,0.0022664163,0.004122085,0.0019753398,0.0021581284,0.0018253876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000012268894,0.0000072156067,0.00004836369,0.000018797358,0.0000024575259,0.000047939062,0.00009060084,0.00043861475,0.00083613914,0.9906274,0.0013185093,0.006551697],"study_design_scores_gemma":[0.00001769231,0.000015938156,0.00011904086,0.000019044175,0.000011446415,0.00019251791,0.000060023394,0.009799933,0.0013930798,0.9564702,0.031885643,0.000015502705],"about_ca_topic_score_codex":0.0015442417,"about_ca_topic_score_gemma":0.0010373559,"teacher_disagreement_score":0.009685311,"about_ca_system_score_codex":0.0012223836,"about_ca_system_score_gemma":0.0010069059,"threshold_uncertainty_score":0.032400608},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039565347,0.0011349573,0.770238,0.00028153742,0.00033964784,0.0007965616,0.019833822,0.16115059,0.0066595087],"genre_scores_gemma":[0.14465137,0.0014164721,0.82036227,0.000270034,0.000115365016,0.001644385,0.010188664,0.009313615,0.012037803],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996518,0.00004852123,0.0000330845,0.00009713111,0.00012657657,0.000042820488],"domain_scores_gemma":[0.99892163,0.00054885825,0.00011109828,0.0001199282,0.00021941226,0.000079083155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081827544,0.0015394086,0.0008171012,0.004012585,0.0005032646,0.0019716385,0.0010111916,0.00090190594,0.022525625],"category_scores_gemma":[0.0031021023,0.00049118197,0.0007802032,0.0018109134,0.0002320419,0.0015676572,0.0014119598,0.0007498043,0.0044094184],"study_design_candidate":"not_applicable","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.0014546314,0.00023341752,0.0053658416,0.0022430103,0.00054009503,0.0009919942,0.0016175385,0.0056686476,0.17582819,0.0042939857,0.11286549,0.68889713],"study_design_scores_gemma":[0.0006219826,0.0008041883,0.04496331,0.0006307804,0.00070426584,0.0035026367,0.002203327,0.43911302,0.30476722,0.028332073,0.17381041,0.0005468339],"about_ca_topic_score_codex":0.0037601818,"about_ca_topic_score_gemma":0.0075950976,"teacher_disagreement_score":0.022525625,"about_ca_system_score_codex":0.0003106336,"about_ca_system_score_gemma":0.00080228614,"threshold_uncertainty_score":0.07535577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008103387,0.0017244173,0.96368974,0.0015941123,0.00031840525,0.000038229202,0.000087794986,0.0007602397,0.023683693],"genre_scores_gemma":[0.50864846,0.0036938917,0.465607,0.0012891626,0.00113939,0.0003401663,0.0002099823,0.00046420743,0.01860777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789715,0.0006517857,0.00015300568,0.00046604124,0.0006077895,0.00022428841],"domain_scores_gemma":[0.9952696,0.0028491244,0.00027555798,0.00082573196,0.00053590164,0.00024403725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029438876,0.0011306577,0.0011033982,0.002258033,0.0025372982,0.0037575176,0.002402404,0.0024129166,0.0049315346],"category_scores_gemma":[0.011086078,0.00097561395,0.0020644285,0.0034620329,0.008414135,0.007836757,0.0041265544,0.0059341257,0.0009489742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000008094821,0.000008399986,0.00006918294,0.000020345431,0.0000046602368,0.000060014958,0.00013875669,0.001490075,0.0002615238,0.9896344,0.00075163576,0.0075529106],"study_design_scores_gemma":[0.0000072330076,0.0000062498693,0.000056356377,0.000012085939,0.00001070476,0.00007295645,0.000023020697,0.010287312,0.00020906572,0.9839871,0.0053168726,0.0000110469355],"about_ca_topic_score_codex":0.0035873842,"about_ca_topic_score_gemma":0.0019436186,"teacher_disagreement_score":0.0049315346,"about_ca_system_score_codex":0.0023942569,"about_ca_system_score_gemma":0.0014798816,"threshold_uncertainty_score":0.017371655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020095171,0.0005708162,0.9259288,0.0010327535,0.00035354742,0.0001645141,0.00067698595,0.001101393,0.050076105],"genre_scores_gemma":[0.5915611,0.0013053154,0.37497854,0.0013607626,0.00067998737,0.0007821226,0.0034633,0.0011216336,0.02474723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99451375,0.001607697,0.0007538603,0.000989651,0.0015647282,0.0005703067],"domain_scores_gemma":[0.99123573,0.0043224674,0.00033283344,0.0018499327,0.0017312855,0.0005277962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005669951,0.0010506975,0.0009615042,0.0025860611,0.0022036657,0.0058589024,0.0018109677,0.0017160984,0.007096509],"category_scores_gemma":[0.00724389,0.0015410682,0.0028100556,0.0014595211,0.006364397,0.011616016,0.0046501877,0.007121213,0.0024211349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000014541313,0.000016298316,0.00013009644,0.00004610857,0.000009157336,0.00005112493,0.00033273132,0.00031427588,0.0004945753,0.9933169,0.0008606082,0.0044135954],"study_design_scores_gemma":[0.000033868742,0.00002013938,0.00015833238,0.000044146167,0.000032183834,0.00011256157,0.00022773567,0.0026397125,0.0025295338,0.97647494,0.0177092,0.000017682827],"about_ca_topic_score_codex":0.0011106953,"about_ca_topic_score_gemma":0.0011926406,"teacher_disagreement_score":0.007096509,"about_ca_system_score_codex":0.002036613,"about_ca_system_score_gemma":0.0013381616,"threshold_uncertainty_score":0.029985905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016210744,0.009279246,0.86763567,0.016201688,0.0013747424,0.000084083535,0.00063961244,0.0012888493,0.08728538],"genre_scores_gemma":[0.6636998,0.011706804,0.274371,0.0046856785,0.0043518064,0.00043163818,0.0009141027,0.00070509216,0.03913411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961383,0.0015110947,0.000275368,0.0006262934,0.0010704664,0.00037844508],"domain_scores_gemma":[0.99362856,0.0040223207,0.00045654253,0.0009361349,0.00061460916,0.00034180496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046317424,0.0010568339,0.0013369374,0.0021620297,0.0032174124,0.011608889,0.0025090172,0.002671505,0.0065612774],"category_scores_gemma":[0.011707787,0.0013095483,0.0019575097,0.003289113,0.012082096,0.022732286,0.0032447465,0.0076751155,0.0019939563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000009474087,0.0000032794383,0.000026803506,0.000020446141,0.0000030299602,0.000011629768,0.00007334505,0.00026751755,0.0000677044,0.9964736,0.0007622149,0.0022808176],"study_design_scores_gemma":[0.000009318167,0.000004070588,0.00001681394,0.000014725543,0.0000060340044,0.000024588267,0.000018728364,0.0016079174,0.0001823757,0.991711,0.0063977907,0.0000066374805],"about_ca_topic_score_codex":0.002063203,"about_ca_topic_score_gemma":0.00091418764,"teacher_disagreement_score":0.011608889,"about_ca_system_score_codex":0.0038618224,"about_ca_system_score_gemma":0.0024745727,"threshold_uncertainty_score":0.028019667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29053107,0.003953395,0.5429453,0.0029070608,0.0009900284,0.00023666884,0.0027278385,0.024465015,0.13124354],"genre_scores_gemma":[0.8839461,0.00045337278,0.08997916,0.00039029244,0.00035623295,0.00012434232,0.0016987559,0.0012665462,0.021785172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974884,0.0008299273,0.000112407375,0.00026253657,0.0009081839,0.0003985484],"domain_scores_gemma":[0.99468166,0.0019212322,0.00020665486,0.0016931045,0.0012802199,0.00021702128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001726284,0.0006427333,0.0009787206,0.00095473893,0.0008741336,0.0024765215,0.0011284862,0.0006989058,0.01724239],"category_scores_gemma":[0.009650841,0.00035556435,0.0007033012,0.0011522004,0.001121559,0.0039201416,0.0025278965,0.0008801286,0.0028104086],"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.004051702,0.00027045218,0.005921274,0.0010656363,0.00026479707,0.00055861386,0.0004960529,0.045292057,0.015669838,0.36179778,0.06792848,0.49668333],"study_design_scores_gemma":[0.0003159618,0.00082597346,0.0024605873,0.00018511589,0.00030668257,0.000697582,0.0002822381,0.30680937,0.0481272,0.55340636,0.086469255,0.00011372987],"about_ca_topic_score_codex":0.001364262,"about_ca_topic_score_gemma":0.0020947324,"teacher_disagreement_score":0.01724239,"about_ca_system_score_codex":0.0008489956,"about_ca_system_score_gemma":0.0013927872,"threshold_uncertainty_score":0.05768156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018093739,0.00006284363,0.97939014,0.00006879995,0.000055771234,0.000076640565,0.000020231602,0.00084089313,0.001390974],"genre_scores_gemma":[0.65113276,0.00007896624,0.34578,0.00005505786,0.000031045125,0.0001789233,0.00009653137,0.000284029,0.0023626257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979006,0.0004996221,0.00017520947,0.00038651715,0.0007928189,0.00024520865],"domain_scores_gemma":[0.99495065,0.002956845,0.00030977468,0.00080047944,0.0007116214,0.00027062534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033122636,0.00060534023,0.0008762777,0.00087488774,0.0010532897,0.0021524767,0.0018337824,0.0007821162,0.0031467031],"category_scores_gemma":[0.0089178635,0.0006492197,0.0010051884,0.0005107358,0.0014667232,0.0019801266,0.001986921,0.0016528347,0.0003242556],"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.0012278588,0.00046230716,0.003354101,0.0002983896,0.00013481114,0.00074493716,0.00091985794,0.50290966,0.03133178,0.28820693,0.0022462076,0.16816309],"study_design_scores_gemma":[0.00007347359,0.00003247573,0.000060055303,0.0000127572075,0.00002397231,0.000031317264,0.000025645035,0.94697315,0.0076720985,0.043495405,0.0015849839,0.0000146183165],"about_ca_topic_score_codex":0.0023613742,"about_ca_topic_score_gemma":0.00308708,"teacher_disagreement_score":0.0033122636,"about_ca_system_score_codex":0.00090606307,"about_ca_system_score_gemma":0.0014122785,"threshold_uncertainty_score":0.01751709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05355756,0.00018226646,0.77607083,0.00383196,0.000045378667,0.0005177721,0.0005243103,0.00080594904,0.164464],"genre_scores_gemma":[0.6820678,0.0003937727,0.28323635,0.00038940192,0.000049533486,0.0009120431,0.0008327031,0.00015576559,0.03196262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975781,0.0008943949,0.00014414992,0.00040525506,0.0008160094,0.00016216101],"domain_scores_gemma":[0.9939955,0.002587794,0.000508969,0.0011395365,0.0014379622,0.00033040156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431853,0.00067041983,0.00024019108,0.0021547782,0.0009419251,0.0040636193,0.0018071935,0.0020152472,0.011741567],"category_scores_gemma":[0.0067997593,0.0005045249,0.00083214603,0.0024307927,0.001737648,0.0075407973,0.0016382312,0.0018396578,0.0031579786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000045538854,0.00031499277,0.0032012272,0.00008056431,0.000033270484,0.00026807713,0.0015314402,0.02464021,0.0007554442,0.91281766,0.0027757073,0.053535797],"study_design_scores_gemma":[0.00013399406,0.00023788668,0.00254529,0.0001670652,0.000079829726,0.0005169497,0.0018746299,0.27389166,0.0014792231,0.64976496,0.06926865,0.000039893228],"about_ca_topic_score_codex":0.0052406904,"about_ca_topic_score_gemma":0.003172829,"teacher_disagreement_score":0.011741567,"about_ca_system_score_codex":0.0021327222,"about_ca_system_score_gemma":0.002427711,"threshold_uncertainty_score":0.03927952},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025302596,0.00020206886,0.9665672,0.00022498275,0.000047795267,0.00006230172,0.00006225277,0.005400181,0.002130632],"genre_scores_gemma":[0.38790768,0.00028247328,0.6024572,0.0003413761,0.00009365146,0.0001650856,0.00024691143,0.0031259507,0.005379611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995814,0.0011725405,0.00038773112,0.00067612994,0.0011556315,0.0007939335],"domain_scores_gemma":[0.9832791,0.0032313536,0.00070438813,0.011493603,0.00081052777,0.00048095788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050649317,0.0009837567,0.001661431,0.0011736209,0.001330811,0.0032555799,0.005106173,0.0017615621,0.0044892924],"category_scores_gemma":[0.011420046,0.0018014394,0.0025137188,0.0020462002,0.0036067136,0.01468972,0.0089127105,0.0047023273,0.0012683994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0010601082,0.00036425723,0.0057225702,0.0006702304,0.00017350732,0.0004235021,0.001501928,0.02299987,0.03235535,0.62776166,0.007096369,0.29987076],"study_design_scores_gemma":[0.00019167812,0.00033933355,0.0015385697,0.00018365614,0.00046269383,0.0005779323,0.0002967965,0.24724306,0.055566806,0.6643307,0.029080104,0.00018858697],"about_ca_topic_score_codex":0.0010462173,"about_ca_topic_score_gemma":0.002495855,"teacher_disagreement_score":0.005106173,"about_ca_system_score_codex":0.0010758846,"about_ca_system_score_gemma":0.0024014316,"threshold_uncertainty_score":0.026786268},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03667283,0.00005331587,0.9556901,0.00022360779,0.00004056344,0.00019805906,0.00031675867,0.0021066442,0.0046981503],"genre_scores_gemma":[0.584095,0.00013156042,0.40656394,0.00019876305,0.000038284,0.00053909427,0.0009086087,0.0006790591,0.006845659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975114,0.0007809123,0.00025797533,0.00024751632,0.0009424411,0.0002598192],"domain_scores_gemma":[0.99172217,0.005132357,0.00056300947,0.0012530738,0.0011795667,0.00014977025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031746875,0.00072277576,0.00047022136,0.0007461257,0.0006316424,0.0028413434,0.0013641709,0.0009704123,0.0047515864],"category_scores_gemma":[0.008861248,0.0007248752,0.0009021372,0.00039607572,0.002187807,0.0025458992,0.0015149104,0.0015889754,0.0007098919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00030686948,0.00016116645,0.0013163717,0.00037409054,0.000037800004,0.0005234,0.0016270159,0.07386189,0.018587269,0.86855453,0.0016205243,0.033029035],"study_design_scores_gemma":[0.0002621101,0.00014201633,0.00039612938,0.00016251569,0.00008258073,0.00025157028,0.00034344284,0.50268835,0.0540303,0.42028657,0.021294322,0.00006006003],"about_ca_topic_score_codex":0.0023866438,"about_ca_topic_score_gemma":0.004082839,"teacher_disagreement_score":0.0047515864,"about_ca_system_score_codex":0.001235881,"about_ca_system_score_gemma":0.0026117666,"threshold_uncertainty_score":0.016789556},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095203455,0.12620676,0.037203647,0.041874576,0.72561556,0.00012595298,0.00090471393,0.000859711,0.06625705],"genre_scores_gemma":[0.003863512,0.063701995,0.009282454,0.01493515,0.7068909,0.0001257342,0.001363802,0.0009346174,0.19890183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885404,0.00019555974,0.0001293698,0.0002746433,0.00044971643,0.00009664711],"domain_scores_gemma":[0.9950023,0.0023683757,0.00026116698,0.00042702293,0.0011691097,0.0007720644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017301356,0.0019457919,0.0027583148,0.0038174395,0.0011839202,0.0053738933,0.0017461375,0.0028999613,0.07180207],"category_scores_gemma":[0.0050655394,0.0007441874,0.0018597699,0.0029581361,0.0013702967,0.00578418,0.0020347135,0.0056547634,0.03086131],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000028609049,0.00005718257,0.00014543736,0.00037813952,0.000024269375,0.00007854479,0.00004441231,0.00021363437,0.00048491976,0.007521261,0.917417,0.07360663],"study_design_scores_gemma":[0.00000878366,0.00004380807,0.00044030734,0.00016332667,0.000018688948,0.0002259523,0.000030734154,0.0003005298,0.00012575109,0.010677639,0.987949,0.000015432366],"about_ca_topic_score_codex":0.0005438083,"about_ca_topic_score_gemma":0.0015962814,"teacher_disagreement_score":0.07180207,"about_ca_system_score_codex":0.00094031467,"about_ca_system_score_gemma":0.0011812055,"threshold_uncertainty_score":0.24020189},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33145112,0.0007532893,0.6068225,0.001277242,0.0002106355,0.00040419094,0.00034041516,0.015233233,0.043507326],"genre_scores_gemma":[0.6135848,0.0004813095,0.36565065,0.00022032254,0.000040926563,0.00010509523,0.00068695925,0.0027968562,0.016432958],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924576,0.0003403137,0.000033602493,0.00009613353,0.00020244016,0.0000818537],"domain_scores_gemma":[0.99789846,0.0009319077,0.000042867323,0.00056669035,0.00034875108,0.00021127742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023414218,0.00052487967,0.00042549663,0.0003506413,0.0006438752,0.0009953907,0.0016286892,0.0007533948,0.005892091],"category_scores_gemma":[0.003691099,0.00045563135,0.00049988896,0.00038417045,0.0008322785,0.0018002061,0.0010350045,0.0012751373,0.0013231895],"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.001224463,0.0013613788,0.012429731,0.0008867219,0.00023711311,0.0018205781,0.010852254,0.1314461,0.09704337,0.03638331,0.030697808,0.67561716],"study_design_scores_gemma":[0.0009998002,0.0033442406,0.010534796,0.00031120435,0.00036363545,0.003066937,0.0028567754,0.45282155,0.1619033,0.027068825,0.33645183,0.00027703395],"about_ca_topic_score_codex":0.0037574784,"about_ca_topic_score_gemma":0.004820972,"teacher_disagreement_score":0.005892091,"about_ca_system_score_codex":0.00058952894,"about_ca_system_score_gemma":0.0011658347,"threshold_uncertainty_score":0.019711018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006125644,0.0006787567,0.9775025,0.0016507171,0.0004128574,0.00010866333,0.0002937107,0.0011982436,0.012028875],"genre_scores_gemma":[0.23920701,0.002213602,0.7379041,0.0023251842,0.0011232356,0.00058557926,0.0014133552,0.001551041,0.013676859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590576,0.0013421563,0.00049715035,0.0006148424,0.0011830186,0.00045693014],"domain_scores_gemma":[0.9926105,0.0037820695,0.0004904417,0.0011979716,0.0016181836,0.00030088538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005170823,0.0012982591,0.0012581612,0.0024960092,0.0028545437,0.0067502274,0.0030820344,0.0026061991,0.008445715],"category_scores_gemma":[0.012732774,0.0015807925,0.0029799019,0.0041481303,0.007270039,0.01819945,0.0053402893,0.0051657753,0.0020519579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000025672047,0.000013476774,0.00006115773,0.00005887345,0.0000067106666,0.000036940113,0.00031114544,0.0013170784,0.00044469457,0.989115,0.0013362038,0.0072730985],"study_design_scores_gemma":[0.000028814378,0.00002280877,0.000058812282,0.00008738627,0.000028278357,0.00008912749,0.00014490832,0.011238001,0.0010690328,0.9651302,0.02207253,0.000030092278],"about_ca_topic_score_codex":0.003928044,"about_ca_topic_score_gemma":0.0036373397,"teacher_disagreement_score":0.008445715,"about_ca_system_score_codex":0.0025347278,"about_ca_system_score_gemma":0.0024457555,"threshold_uncertainty_score":0.028253734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40407354,0.00035531732,0.5476199,0.00031450295,0.00028315265,0.00021354761,0.00024436606,0.025985844,0.020909864],"genre_scores_gemma":[0.7704817,0.00012499807,0.22040884,0.00014575422,0.000036040252,0.0001536793,0.0005280928,0.00230048,0.00582045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990582,0.00021866805,0.000056970006,0.00015705761,0.00030146935,0.00020774592],"domain_scores_gemma":[0.99854076,0.00054501183,0.000086137225,0.00037215272,0.00034734464,0.00010852905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886699,0.0007469663,0.0006652,0.0005494417,0.00078092545,0.0011945894,0.001780365,0.0005541888,0.00455014],"category_scores_gemma":[0.0028852497,0.00048910454,0.0006689334,0.00075702596,0.0007593195,0.0011044681,0.0011219329,0.00091782794,0.00075743336],"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.007194612,0.0010132656,0.012563048,0.0005441541,0.00033089676,0.0010316771,0.0015979734,0.23585601,0.17408378,0.051953528,0.021913387,0.49191773],"study_design_scores_gemma":[0.0005115052,0.00036712195,0.0019270305,0.00002568929,0.000098807875,0.00010427875,0.00012540903,0.8780868,0.08857227,0.020393545,0.009742539,0.00004495636],"about_ca_topic_score_codex":0.004936535,"about_ca_topic_score_gemma":0.0057106134,"teacher_disagreement_score":0.004936535,"about_ca_system_score_codex":0.0008322492,"about_ca_system_score_gemma":0.0012223317,"threshold_uncertainty_score":0.015221715},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009277835,0.00046941772,0.9512067,0.0006276029,0.0001993568,0.0001756558,0.00027768372,0.022439785,0.015325971],"genre_scores_gemma":[0.1993491,0.0013621409,0.762473,0.0013519486,0.00030969217,0.0006252554,0.0019442176,0.0059533636,0.026631273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730337,0.0005911903,0.00033447758,0.00070283393,0.00065119157,0.00041696872],"domain_scores_gemma":[0.995291,0.0007134851,0.00017347539,0.002965268,0.0005288201,0.00032793568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051719225,0.001031911,0.0014951513,0.0025352512,0.002464329,0.0059806276,0.0047302814,0.0031563696,0.015741253],"category_scores_gemma":[0.0058348165,0.0017806236,0.003174081,0.0025327806,0.0038614406,0.017377088,0.011552218,0.0046441862,0.0063439608],"study_design_candidate":"not_applicable","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.00033663097,0.0001313732,0.0017933059,0.0003540686,0.00008225533,0.00030526286,0.0015673169,0.004292049,0.0052483925,0.84966505,0.015569497,0.12065482],"study_design_scores_gemma":[0.000103644845,0.00012593977,0.00050333765,0.00026300873,0.00023170187,0.0006441518,0.00033273856,0.054014623,0.008677997,0.69802535,0.23695005,0.00012755829],"about_ca_topic_score_codex":0.0017012876,"about_ca_topic_score_gemma":0.00311994,"teacher_disagreement_score":0.015741253,"about_ca_system_score_codex":0.0018052481,"about_ca_system_score_gemma":0.0016598683,"threshold_uncertainty_score":0.05265975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24598381,0.0002094061,0.74510205,0.00026720302,0.00007737762,0.00011184984,0.00017812975,0.005590954,0.00247925],"genre_scores_gemma":[0.94839007,0.0000731634,0.05016825,0.000059050064,0.000028739263,0.00006699511,0.00010572065,0.0002156952,0.00089231844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383897,0.0022397975,0.00028474376,0.0007941881,0.0020363845,0.0008059831],"domain_scores_gemma":[0.982464,0.011645559,0.0014908498,0.002974074,0.0011855687,0.00023998931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043940526,0.0012037491,0.0011969359,0.0017587251,0.0010351263,0.0025745425,0.0028218399,0.0011916516,0.0020624462],"category_scores_gemma":[0.017435467,0.001128596,0.002085844,0.0011292406,0.0034882412,0.0046480014,0.0023867392,0.0017251413,0.00024990257],"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.0019197119,0.000484179,0.01243097,0.0005003397,0.00032494165,0.0006935236,0.00072645344,0.73839617,0.04638654,0.1293091,0.0013613639,0.067466706],"study_design_scores_gemma":[0.000110111316,0.000117036405,0.00036227485,0.000027361655,0.00010443808,0.00007479023,0.000041873096,0.9186908,0.026419524,0.053470016,0.00055310794,0.00002854947],"about_ca_topic_score_codex":0.007945425,"about_ca_topic_score_gemma":0.01074712,"teacher_disagreement_score":0.007945425,"about_ca_system_score_codex":0.0020436759,"about_ca_system_score_gemma":0.00447224,"threshold_uncertainty_score":0.023238242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061837558,0.001607503,0.7144258,0.00027952803,0.00030685906,0.000410419,0.0025323252,0.21405262,0.004547363],"genre_scores_gemma":[0.24321029,0.00052348396,0.7217562,0.00026883167,0.0001298876,0.00045677595,0.011024448,0.012789274,0.00984081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976127,0.00027562177,0.00016191705,0.0005900507,0.0011318482,0.00022789282],"domain_scores_gemma":[0.9965239,0.0010920698,0.00026576882,0.0013932064,0.00053250085,0.00019250785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113742,0.0021190867,0.0024420633,0.004351909,0.0013745048,0.0017411985,0.0049471622,0.0022511338,0.0126803],"category_scores_gemma":[0.007852188,0.0011865004,0.0017236368,0.0052514756,0.0010683734,0.0060237814,0.0049877614,0.0014737913,0.005087618],"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.0012879524,0.00037320616,0.0049207318,0.00073907716,0.000362257,0.00046421544,0.0004969587,0.010090813,0.03836161,0.012142291,0.06712729,0.8636335],"study_design_scores_gemma":[0.00084913167,0.00079699943,0.003946506,0.0001306561,0.0002689686,0.0011571279,0.0005303647,0.80401385,0.08429966,0.059824206,0.043992974,0.00018945504],"about_ca_topic_score_codex":0.006743291,"about_ca_topic_score_gemma":0.011106877,"teacher_disagreement_score":0.0126803,"about_ca_system_score_codex":0.0010443332,"about_ca_system_score_gemma":0.002056101,"threshold_uncertainty_score":0.04241979},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.436699,0.00078148977,0.5481957,0.00065636553,0.00042981037,0.0035705399,0.0040591597,0.0014225073,0.004185344],"genre_scores_gemma":[0.9177194,0.00018452608,0.07281773,0.0006044356,0.00017868345,0.0018366325,0.0035854462,0.0001534373,0.0029198246],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97752863,0.013302934,0.0015795358,0.0035222587,0.0026582738,0.0014083599],"domain_scores_gemma":[0.9287406,0.03373099,0.0029944733,0.027256723,0.005427138,0.0018500523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026870728,0.00072480785,0.0018094184,0.001797788,0.0013617377,0.0026355453,0.0021940928,0.0015335038,0.0037836707],"category_scores_gemma":[0.10201899,0.0007480875,0.001589424,0.002049885,0.0016201417,0.0011429263,0.0021803635,0.0014393609,0.0010561921],"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.013590658,0.0020563758,0.55832356,0.0008487868,0.0024948325,0.000630351,0.007455528,0.02369402,0.030486159,0.08049674,0.01702056,0.26290238],"study_design_scores_gemma":[0.0026635053,0.0045339777,0.27907395,0.0003930205,0.0055501577,0.0013349869,0.004722344,0.3987767,0.051197503,0.20070964,0.050686568,0.00035760275],"about_ca_topic_score_codex":0.0043566595,"about_ca_topic_score_gemma":0.004561136,"teacher_disagreement_score":0.026870728,"about_ca_system_score_codex":0.0010191115,"about_ca_system_score_gemma":0.0026299136,"threshold_uncertainty_score":0.14210767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021697296,0.0005452289,0.96549714,0.004680202,0.00008841868,0.00017928713,0.00036242185,0.00025367519,0.0066963895],"genre_scores_gemma":[0.24631198,0.0011040788,0.74826443,0.0006362169,0.00005125456,0.00034471796,0.0011731901,0.0002390756,0.0018750554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9817488,0.006902269,0.0020667645,0.0011997079,0.007290798,0.00079152564],"domain_scores_gemma":[0.96231484,0.021648632,0.002924669,0.0059119537,0.006332996,0.0008668963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021569507,0.0006427443,0.001172717,0.0068618017,0.0027984562,0.01319065,0.004331023,0.0033763235,0.0021927403],"category_scores_gemma":[0.04401283,0.0018310848,0.0017900134,0.0057278457,0.005102948,0.026284624,0.006525772,0.0055480753,0.000614744],"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.000055538378,0.0001606382,0.0015860646,0.00035540527,0.000073257404,0.0003250657,0.0060439208,0.0052687493,0.002685791,0.9191238,0.0018740968,0.06244766],"study_design_scores_gemma":[0.00007901165,0.00006012879,0.0013696947,0.0008627841,0.00014157305,0.00055794505,0.0076002986,0.09709398,0.0052024405,0.81656164,0.07036688,0.00010354999],"about_ca_topic_score_codex":0.008325871,"about_ca_topic_score_gemma":0.01130727,"teacher_disagreement_score":0.021569507,"about_ca_system_score_codex":0.00510999,"about_ca_system_score_gemma":0.01272925,"threshold_uncertainty_score":0.11407179},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68052244,0.0038210303,0.20971498,0.0014595626,0.00126899,0.00015138576,0.0007085127,0.08745062,0.014902468],"genre_scores_gemma":[0.92741895,0.00023108022,0.06128447,0.00034141573,0.00014027035,0.000053042517,0.00059280323,0.0012526824,0.008685232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843365,0.0004871996,0.00010029684,0.00029713064,0.00040054627,0.0002811087],"domain_scores_gemma":[0.9967242,0.00078706077,0.00019585234,0.0014292295,0.00060991157,0.0002538705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013128058,0.00081166514,0.00060926576,0.0007320976,0.00054242095,0.0015399621,0.002702159,0.00081632374,0.0058251875],"category_scores_gemma":[0.003567372,0.00044362238,0.00030680915,0.00066949846,0.0006958121,0.002273876,0.0012992016,0.0013365492,0.0017095356],"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.008117607,0.0014242142,0.0075387754,0.0005462618,0.00022398322,0.00039674965,0.00051193516,0.04451247,0.20265998,0.014442245,0.044070076,0.6755557],"study_design_scores_gemma":[0.0009845841,0.002341755,0.00270845,0.000033422377,0.00016495925,0.0004108736,0.00018725662,0.73378956,0.23033068,0.008502541,0.020428091,0.000117839576],"about_ca_topic_score_codex":0.0010109378,"about_ca_topic_score_gemma":0.0017808388,"teacher_disagreement_score":0.0058251875,"about_ca_system_score_codex":0.0004472585,"about_ca_system_score_gemma":0.0010010006,"threshold_uncertainty_score":0.019487202},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042862505,0.00019529165,0.94153434,0.00032386035,0.00006507986,0.0000972189,0.0002130887,0.003213517,0.011495103],"genre_scores_gemma":[0.7037494,0.00027760686,0.28899944,0.000084072795,0.0000446724,0.00017518098,0.0005341083,0.0005653385,0.005570156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977986,0.000582648,0.00009044177,0.0002471403,0.00092972093,0.00035148687],"domain_scores_gemma":[0.99503976,0.0036015117,0.00019346953,0.0006716533,0.0004053778,0.000088178655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622437,0.00090172986,0.0011689952,0.0010064653,0.0013909467,0.0026772092,0.0018010519,0.000981177,0.009649885],"category_scores_gemma":[0.009485059,0.000539913,0.0010577398,0.0014205647,0.0023929907,0.0034182812,0.0023595754,0.0016445866,0.0014538891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00060759764,0.00016194239,0.0009113008,0.0005316225,0.00007315894,0.00042699144,0.0006438957,0.13949913,0.018117774,0.63827723,0.004073699,0.1966756],"study_design_scores_gemma":[0.0001517713,0.00007691777,0.0001676906,0.00006846462,0.00007654887,0.000089443754,0.00014241709,0.5551578,0.032266647,0.40419257,0.007575806,0.000033933455],"about_ca_topic_score_codex":0.0024923189,"about_ca_topic_score_gemma":0.00420837,"teacher_disagreement_score":0.009649885,"about_ca_system_score_codex":0.0014952787,"about_ca_system_score_gemma":0.0030497888,"threshold_uncertainty_score":0.032282054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013843493,0.000035004836,0.99502265,0.00004810779,0.000016545382,0.000045200588,0.00005175832,0.0019875157,0.0014088652],"genre_scores_gemma":[0.05441861,0.000095493946,0.94202024,0.000052422212,0.00001356534,0.00025372737,0.00021355375,0.00063152204,0.0023009256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.00016603932,0.00004980197,0.00007538664,0.000361341,0.00006115287],"domain_scores_gemma":[0.9988164,0.00057373027,0.000067242734,0.0002391114,0.00021941174,0.000084063046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014768942,0.00077048,0.00081392284,0.0006875759,0.0007104164,0.0015828008,0.0025787754,0.0013377258,0.01044728],"category_scores_gemma":[0.0046916003,0.00077867386,0.0010771193,0.00040142785,0.0008049407,0.001597631,0.0029287976,0.0018103954,0.001571409],"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.00017631514,0.0002597945,0.0017935345,0.000635972,0.0001606092,0.000516943,0.0004975396,0.47759318,0.020049756,0.2786666,0.0071377843,0.21251193],"study_design_scores_gemma":[0.00002801391,0.000029033228,0.00007468225,0.000040418665,0.000017043942,0.00009312376,0.00001555926,0.9447784,0.005428754,0.027703242,0.021774132,0.000017654542],"about_ca_topic_score_codex":0.0020392993,"about_ca_topic_score_gemma":0.0035290113,"teacher_disagreement_score":0.01044728,"about_ca_system_score_codex":0.0005141525,"about_ca_system_score_gemma":0.0012391655,"threshold_uncertainty_score":0.03494966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061746044,0.000048448153,0.99084246,0.00012760311,0.000016276144,0.00008692984,0.00006374922,0.0009587728,0.0016810152],"genre_scores_gemma":[0.26521453,0.0000822024,0.73271,0.000065407905,0.000027657019,0.00017980325,0.0002886283,0.00016558832,0.0012662138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463224,0.0017429579,0.000505224,0.0010682447,0.0016000575,0.00045128894],"domain_scores_gemma":[0.9919316,0.0042506657,0.000607949,0.0022001665,0.0007835207,0.0002261721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050558588,0.0012648712,0.0015321677,0.0018125795,0.0016164067,0.004227043,0.0040746634,0.0015079323,0.008147751],"category_scores_gemma":[0.01781958,0.0009789324,0.0017272349,0.0018069245,0.0016794157,0.0050329007,0.0032126524,0.0023108115,0.0011855604],"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.0007166001,0.00048455023,0.0020452878,0.00031289598,0.00026832518,0.0004767958,0.00093855197,0.349733,0.009060936,0.16493814,0.006389537,0.46463537],"study_design_scores_gemma":[0.00008534051,0.000055674238,0.00030792027,0.00003445011,0.00009035718,0.00011564136,0.00012219475,0.8256954,0.006783297,0.16394557,0.0027246177,0.00003949378],"about_ca_topic_score_codex":0.0048872186,"about_ca_topic_score_gemma":0.005772308,"teacher_disagreement_score":0.008147751,"about_ca_system_score_codex":0.0014319583,"about_ca_system_score_gemma":0.0024091261,"threshold_uncertainty_score":0.027256906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00131631,0.00018989506,0.9941942,0.0004341784,0.000058454792,0.00004571258,0.000044396413,0.00051283254,0.0032040023],"genre_scores_gemma":[0.05254871,0.0004618145,0.9428549,0.00018144629,0.000071502676,0.00023145576,0.00020393843,0.00043582587,0.0030104497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694604,0.0012290514,0.00032165973,0.00044644298,0.0008322632,0.00022448423],"domain_scores_gemma":[0.99490404,0.0018919702,0.00031027166,0.0017881016,0.0008104846,0.00029508545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005979783,0.0009200602,0.00097287947,0.002184888,0.001959469,0.004702874,0.004199812,0.0024418752,0.004530597],"category_scores_gemma":[0.012474881,0.0012855473,0.0031202026,0.0017245987,0.004250044,0.007365547,0.004535259,0.004999879,0.001051716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000009330496,0.000013835342,0.00012891204,0.000045315825,0.000019178742,0.00006468907,0.00034432783,0.007411368,0.0004930956,0.977433,0.0007082371,0.013328674],"study_design_scores_gemma":[0.000022972756,0.000027276734,0.000092361064,0.00009689839,0.000048925744,0.00012492471,0.00010939682,0.07355996,0.0011553839,0.8743087,0.050416946,0.00003620293],"about_ca_topic_score_codex":0.0060130847,"about_ca_topic_score_gemma":0.0047288067,"teacher_disagreement_score":0.0060130847,"about_ca_system_score_codex":0.0024863393,"about_ca_system_score_gemma":0.002528397,"threshold_uncertainty_score":0.031624436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979311,0.00015535466,0.00059378176,0.000118797805,0.000006997066,0.00003189968,0.00009503852,0.0000145375225,0.0010524988],"genre_scores_gemma":[0.99855787,0.00007305897,0.00060099136,0.00008866614,0.000010867679,0.000027032824,0.00022662127,0.000027627002,0.0003872698],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98147994,0.009311834,0.0018945013,0.00202269,0.0046020513,0.0006890274],"domain_scores_gemma":[0.2937554,0.5736138,0.08197597,0.023026863,0.02422729,0.0034006434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01541674,0.0003734003,0.00044249868,0.0025848215,0.0012706098,0.0019593318,0.0016930809,0.0017378067,0.0039970726],"category_scores_gemma":[0.28005132,0.0005431284,0.00041070816,0.002778576,0.0021202494,0.0034338862,0.0013837742,0.0029426112,0.0006066738],"study_design_candidate":"observational","study_design_consensus":"observational","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.0012668489,0.0023196468,0.9624238,0.0002080122,0.00014403474,0.0004646898,0.00793324,0.0005256055,0.0013498731,0.0010989787,0.00063783623,0.021627558],"study_design_scores_gemma":[0.00012782718,0.0017676785,0.97916585,0.00013384921,0.00021180559,0.0011174507,0.009718454,0.0029676908,0.0016309347,0.0009333957,0.002181905,0.00004305382],"about_ca_topic_score_codex":0.0037098727,"about_ca_topic_score_gemma":0.0048518726,"teacher_disagreement_score":0.01541674,"about_ca_system_score_codex":0.0012194152,"about_ca_system_score_gemma":0.001300657,"threshold_uncertainty_score":0.08153248},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045021318,0.00012618267,0.9503284,0.00014541914,0.000035431945,0.00021301664,0.0002010161,0.003049692,0.00087942847],"genre_scores_gemma":[0.5193364,0.00011128085,0.478277,0.00010327112,0.000027070972,0.0003981398,0.00046839152,0.0002548223,0.0010235334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9878834,0.0046159807,0.0009694205,0.001550674,0.0043234043,0.00065717084],"domain_scores_gemma":[0.9458267,0.038815275,0.005868331,0.0047296965,0.003998226,0.0007616273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067902696,0.0009898971,0.00093595765,0.0028611068,0.0008860699,0.0027012636,0.0015226332,0.0011257275,0.0014235914],"category_scores_gemma":[0.029765531,0.0007987726,0.0014458996,0.0010134928,0.0020986462,0.003825445,0.0022011308,0.0018378602,0.00035887907],"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.0015360827,0.0010789515,0.067025475,0.0018564194,0.00087407284,0.001871023,0.005354624,0.2103128,0.07166305,0.20693523,0.004053526,0.4274387],"study_design_scores_gemma":[0.00010442803,0.00024026341,0.0029800558,0.0001518796,0.00011921076,0.00036871122,0.0006029243,0.87079835,0.027318586,0.092484176,0.004733956,0.0000974424],"about_ca_topic_score_codex":0.0043924074,"about_ca_topic_score_gemma":0.0061395057,"teacher_disagreement_score":0.0067902696,"about_ca_system_score_codex":0.0011854605,"about_ca_system_score_gemma":0.003121379,"threshold_uncertainty_score":0.035910785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94321215,0.005684671,0.002542965,0.004990469,0.00035952797,0.00006965961,0.00006172924,0.00009507203,0.042983793],"genre_scores_gemma":[0.9635204,0.004285421,0.0021400016,0.0015595153,0.00013108236,0.00005810108,0.000076593074,0.00007329389,0.028155651],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9939276,0.0024768477,0.00022847066,0.0006039477,0.0013119372,0.0014511204],"domain_scores_gemma":[0.9764224,0.005546386,0.0015057729,0.00071119575,0.0028465767,0.012967732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068867058,0.0006403853,0.00057389797,0.002254594,0.0033952873,0.005885813,0.0013792844,0.0032879033,0.0060776058],"category_scores_gemma":[0.019099606,0.00064743,0.0007136603,0.0017044937,0.0029276991,0.005769917,0.0038645728,0.0042598485,0.0021546776],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.0006100308,0.012737477,0.12280956,0.0006395836,0.00007555354,0.003961816,0.4995633,0.00069584366,0.006104681,0.013437942,0.01635671,0.32300758],"study_design_scores_gemma":[0.00027799536,0.0074772015,0.20548697,0.0016171724,0.0001085902,0.015069219,0.42115098,0.0017827295,0.004828625,0.0065501323,0.33529556,0.00035485893],"about_ca_topic_score_codex":0.0022476641,"about_ca_topic_score_gemma":0.006053553,"teacher_disagreement_score":0.0068867058,"about_ca_system_score_codex":0.0018795308,"about_ca_system_score_gemma":0.0022683449,"threshold_uncertainty_score":0.036420822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036128087,0.00010191721,0.8471989,0.00060055824,0.00038674907,0.0004565457,0.014226823,0.12411527,0.009300435],"genre_scores_gemma":[0.09088597,0.00083044945,0.74340814,0.0013380144,0.00023875535,0.0020524245,0.076094225,0.053985864,0.031166214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690384,0.00095008034,0.0005928733,0.0003555763,0.000940171,0.0002574497],"domain_scores_gemma":[0.99025375,0.0032257081,0.00057162816,0.0042368877,0.0014221007,0.00028996952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004633728,0.0019123999,0.0010556671,0.003211341,0.0010628576,0.0045582573,0.0030725643,0.0027437534,0.031233082],"category_scores_gemma":[0.014700324,0.0013361789,0.0014368383,0.0029741742,0.001010505,0.0064001842,0.0032990607,0.0041810484,0.016570605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0016035421,0.000550813,0.002156336,0.0013539103,0.00015149945,0.0007822497,0.0011706663,0.03731928,0.012686944,0.33848104,0.30212486,0.3016189],"study_design_scores_gemma":[0.00046339168,0.00024143513,0.000716998,0.00047103546,0.00010562266,0.00046272617,0.00026339228,0.11664987,0.033693433,0.22675699,0.6199238,0.00025131198],"about_ca_topic_score_codex":0.0039246986,"about_ca_topic_score_gemma":0.0042491625,"teacher_disagreement_score":0.031233082,"about_ca_system_score_codex":0.0013037602,"about_ca_system_score_gemma":0.0020476924,"threshold_uncertainty_score":0.104485035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06900066,0.00033412996,0.91971153,0.0004639338,0.00023712372,0.0001319845,0.00011735611,0.003046604,0.006956648],"genre_scores_gemma":[0.83588594,0.00010434124,0.1529315,0.00026421744,0.000089964495,0.00020599128,0.00012570554,0.00031366275,0.010078674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957658,0.0014691283,0.00023126336,0.0005216021,0.0011324387,0.00087981706],"domain_scores_gemma":[0.98882675,0.0054730736,0.0006240297,0.0023750607,0.0017971019,0.00090393174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031678695,0.00079212955,0.0018765364,0.00087000674,0.002518387,0.0031343678,0.0038907956,0.0014569965,0.0056607267],"category_scores_gemma":[0.009985343,0.0006434905,0.0006410573,0.001337359,0.0019295213,0.0030939498,0.0048776367,0.0027673023,0.0011309233],"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.005732141,0.0010208223,0.0020467837,0.00028303845,0.00015181297,0.00031267817,0.00078120775,0.47287807,0.027688144,0.33463645,0.009747242,0.14472166],"study_design_scores_gemma":[0.000124785,0.0001614145,0.00009050052,0.000008473039,0.000026220443,0.000026347705,0.000030632007,0.9550625,0.005122778,0.038050424,0.0012618267,0.000034157747],"about_ca_topic_score_codex":0.0065120733,"about_ca_topic_score_gemma":0.00815353,"teacher_disagreement_score":0.0065120733,"about_ca_system_score_codex":0.0021768152,"about_ca_system_score_gemma":0.0038256012,"threshold_uncertainty_score":0.018936992},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003046151,0.023307303,0.00437721,0.023151355,0.9057487,0.000110184345,0.00079120183,0.00036437984,0.041845072],"genre_scores_gemma":[0.0025496557,0.020916598,0.002847761,0.009764178,0.63144445,0.00014202364,0.0021986428,0.0010429485,0.32909378],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985832,0.0001574246,0.00012288193,0.00023199379,0.0007806737,0.00012385091],"domain_scores_gemma":[0.9899254,0.0019981265,0.0005275572,0.00056291366,0.005607412,0.0013785415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024180687,0.0021440233,0.0024471006,0.0050830166,0.0017269999,0.005677779,0.0015574672,0.0029390613,0.1391413],"category_scores_gemma":[0.007834303,0.00062362367,0.0013131347,0.0038080832,0.0006622823,0.004111825,0.001982465,0.0046940725,0.092125736],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001421024,0.000016127007,0.000021796131,0.00010306349,0.0000036634885,0.000016248163,0.0000052721693,0.000060298644,0.0001291811,0.00044295698,0.9819338,0.017253516],"study_design_scores_gemma":[0.000010543776,0.000047001336,0.00043312446,0.0001893845,0.000012462871,0.00008293267,0.000021217473,0.00022341289,0.00018935942,0.0016243554,0.99715304,0.00001313723],"about_ca_topic_score_codex":0.002040138,"about_ca_topic_score_gemma":0.003959717,"teacher_disagreement_score":0.1391413,"about_ca_system_score_codex":0.0018168765,"about_ca_system_score_gemma":0.0021375613,"threshold_uncertainty_score":0.46547407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88773364,0.00073460775,0.09236269,0.00398237,0.00004850999,0.0003514585,0.0005608238,0.0006450215,0.0135809295],"genre_scores_gemma":[0.9003116,0.00050922856,0.09400111,0.00034013807,0.000017498965,0.000064294996,0.0005756981,0.00017219991,0.0040083104],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9972711,0.001325224,0.0001689479,0.0004135736,0.0006640574,0.00015705696],"domain_scores_gemma":[0.9720416,0.022020843,0.0011820372,0.0024351797,0.0018933384,0.00042704612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003870698,0.00040695933,0.00031070734,0.001260825,0.0016444268,0.0032413402,0.0021028677,0.0034028422,0.0022961362],"category_scores_gemma":[0.02465983,0.0004868298,0.0005201671,0.0017928205,0.0013036248,0.0054269484,0.0018178127,0.0021819335,0.00033324352],"study_design_candidate":"qualitative","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.0010744699,0.0036392743,0.12176963,0.0020661461,0.00020064572,0.026919477,0.16972168,0.030172082,0.032813102,0.076967366,0.0124843735,0.5221718],"study_design_scores_gemma":[0.00033861073,0.0015217784,0.05660826,0.0011896908,0.0005790081,0.042197675,0.15060453,0.38237852,0.088960916,0.07943961,0.19586419,0.00031709223],"about_ca_topic_score_codex":0.007293737,"about_ca_topic_score_gemma":0.014107311,"teacher_disagreement_score":0.007293737,"about_ca_system_score_codex":0.0016750466,"about_ca_system_score_gemma":0.0015050059,"threshold_uncertainty_score":0.02047044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0679873,0.07136213,0.5626146,0.060382675,0.008123579,0.00016817228,0.0004886369,0.0008731505,0.22799975],"genre_scores_gemma":[0.8388897,0.017064845,0.11411445,0.0064880676,0.005378861,0.00037788175,0.00023733937,0.00027154785,0.017177263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970509,0.0014387637,0.00021505468,0.00046178227,0.0007214839,0.000112121954],"domain_scores_gemma":[0.9894432,0.0073900344,0.0004941224,0.0013922699,0.0009492907,0.00033111277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034725217,0.00039904265,0.000754291,0.0016048485,0.0014981804,0.004440904,0.0014704865,0.0026303788,0.0032610158],"category_scores_gemma":[0.018556062,0.00032545632,0.00057993166,0.0016217205,0.013812885,0.011021587,0.0026486649,0.004577854,0.00078739127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000011460993,0.000007842553,0.00014827166,0.0000637568,0.0000035450298,0.000019240579,0.00051908783,0.00014529376,0.00013421927,0.99191236,0.0009987603,0.0060361507],"study_design_scores_gemma":[0.000008724818,0.000020848312,0.00059083034,0.00006959791,0.000008452594,0.00025203844,0.00033792743,0.0017900552,0.0003104016,0.9708474,0.025750427,0.000013324735],"about_ca_topic_score_codex":0.0011253705,"about_ca_topic_score_gemma":0.0005855921,"teacher_disagreement_score":0.004440904,"about_ca_system_score_codex":0.0012344597,"about_ca_system_score_gemma":0.0015687465,"threshold_uncertainty_score":0.018364668},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010352342,0.04427118,0.025630765,0.023454992,0.7937981,0.00027568344,0.0009234367,0.0015945621,0.10901608],"genre_scores_gemma":[0.003818344,0.028496085,0.0059325635,0.0054772533,0.6412729,0.00022307567,0.0022721058,0.0016157096,0.310892],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702007,0.00045016178,0.0002634062,0.0006164656,0.0014213815,0.00022854487],"domain_scores_gemma":[0.98908293,0.003009498,0.0005631548,0.0016830786,0.004059877,0.0016014463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027083973,0.0033275082,0.0041996706,0.008018537,0.0022845382,0.006987062,0.0029758317,0.003992754,0.13404925],"category_scores_gemma":[0.008312091,0.0011448392,0.0024316218,0.0058128317,0.0014936499,0.00631742,0.0032865861,0.0040040645,0.06852749],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000040741354,0.000070154616,0.00016760378,0.00037909605,0.000024826742,0.00008138498,0.000020374184,0.00016184825,0.00044841593,0.0032735744,0.92381483,0.07151719],"study_design_scores_gemma":[0.000015297084,0.00006146075,0.0005993116,0.00018724041,0.000032066677,0.00029789846,0.000021221478,0.00046317704,0.00029554582,0.006701652,0.99130756,0.00001753918],"about_ca_topic_score_codex":0.000877174,"about_ca_topic_score_gemma":0.002624053,"teacher_disagreement_score":0.13404925,"about_ca_system_score_codex":0.0015437595,"about_ca_system_score_gemma":0.0020857668,"threshold_uncertainty_score":0.44843942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0726221,0.000048575646,0.9125821,0.00026752276,0.00006803577,0.00007692446,0.00013694998,0.011705091,0.0024926972],"genre_scores_gemma":[0.8207131,0.000058716392,0.17419927,0.0001361759,0.000042007476,0.00014711493,0.00031073383,0.0019470826,0.002445772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99411017,0.002032951,0.00028516422,0.0005122427,0.0025606265,0.0004988615],"domain_scores_gemma":[0.9706824,0.019069687,0.0012716743,0.006635475,0.0020768791,0.00026391767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003922613,0.0010637018,0.00093164307,0.0015033932,0.0007793542,0.001849078,0.0033540495,0.0019039179,0.0043187873],"category_scores_gemma":[0.031590734,0.0008741732,0.0014742862,0.0009513525,0.0032111483,0.006116694,0.0034122472,0.0026150257,0.00084701716],"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.002002695,0.00094575365,0.012476921,0.00086619204,0.00030878876,0.001459131,0.0016671421,0.2441808,0.059307933,0.43937513,0.0066763,0.23073329],"study_design_scores_gemma":[0.00019856075,0.00016720619,0.00042101066,0.000040864343,0.000106637155,0.00017023302,0.00006597438,0.71104264,0.07033656,0.21456893,0.0028250967,0.00005627653],"about_ca_topic_score_codex":0.0017418052,"about_ca_topic_score_gemma":0.0021288707,"teacher_disagreement_score":0.0043187873,"about_ca_system_score_codex":0.0011512428,"about_ca_system_score_gemma":0.0018529966,"threshold_uncertainty_score":0.02074498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18213119,0.00044591862,0.803498,0.0011360237,0.00007102918,0.00016755375,0.00026646245,0.0007370176,0.011546841],"genre_scores_gemma":[0.76520616,0.00064733037,0.22594531,0.0002790223,0.000051947703,0.00030789492,0.0005673877,0.00041673274,0.0065782573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945919,0.0019351355,0.00035878192,0.00054516963,0.0019473429,0.0006216613],"domain_scores_gemma":[0.9595531,0.03471218,0.0024784773,0.0014174648,0.0013517129,0.0004870559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004251047,0.0007552483,0.00092271715,0.0019918422,0.0025259303,0.0034299935,0.0014600349,0.0022155484,0.0043939757],"category_scores_gemma":[0.03500198,0.0016156767,0.0011508047,0.0021138529,0.0049399915,0.007270311,0.0037473748,0.004033217,0.00041073243],"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.0004187055,0.00014367823,0.003816617,0.00039408702,0.000052615564,0.0010652245,0.0013952598,0.10133162,0.0021318097,0.8597063,0.001432364,0.028111786],"study_design_scores_gemma":[0.00004658603,0.000028026585,0.00029882768,0.00006240264,0.000036414174,0.0001398016,0.00017958622,0.0828622,0.0017188286,0.91232526,0.002282075,0.000020098158],"about_ca_topic_score_codex":0.00464487,"about_ca_topic_score_gemma":0.004865397,"teacher_disagreement_score":0.00464487,"about_ca_system_score_codex":0.0016514079,"about_ca_system_score_gemma":0.0026453126,"threshold_uncertainty_score":0.022481978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82606846,0.0022678804,0.12856108,0.002345588,0.00013116655,0.0075768298,0.002049899,0.00034729388,0.030651795],"genre_scores_gemma":[0.9351101,0.0007325293,0.057261102,0.0002382839,0.000020554317,0.0034368096,0.00035184,0.00011530712,0.0027335724],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.92054397,0.05109779,0.0042683785,0.0023868016,0.019684361,0.0020187385],"domain_scores_gemma":[0.6118573,0.28415164,0.01165211,0.0065709148,0.08381553,0.001952553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.067516126,0.0009250151,0.0012527108,0.010427555,0.0033145125,0.003911766,0.00272869,0.0014926078,0.0035214317],"category_scores_gemma":[0.18859768,0.0006571646,0.0008824534,0.0061346255,0.003738722,0.0045394893,0.0033571576,0.0011769532,0.00039582246],"study_design_candidate":"qualitative","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.004674595,0.0031570676,0.060380645,0.019094188,0.00056713825,0.0008507641,0.2653497,0.0070584416,0.05505494,0.03810852,0.0057160733,0.53998786],"study_design_scores_gemma":[0.0015514122,0.017569482,0.13716246,0.010418088,0.002172018,0.001629485,0.50696975,0.038057964,0.17880596,0.03920225,0.06571417,0.00074691256],"about_ca_topic_score_codex":0.005362688,"about_ca_topic_score_gemma":0.008035923,"teacher_disagreement_score":0.067516126,"about_ca_system_score_codex":0.010356049,"about_ca_system_score_gemma":0.008320644,"threshold_uncertainty_score":0.35706365},"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":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99566615,0.00018320017,0.0018258265,0.00018455938,0.0000024397225,0.0000060473844,0.00010584567,0.000014037491,0.002011688],"genre_scores_gemma":[0.9989592,0.00005988957,0.00045223685,0.00002020796,0.0000041655417,0.000003891011,0.00008835486,0.000010566934,0.00040138402],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973538,0.0011924125,0.00016871539,0.0005744431,0.0005223053,0.00018834058],"domain_scores_gemma":[0.9056657,0.073942915,0.010609125,0.0058490057,0.0026338894,0.0012993434],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.004982007,0.000121295394,0.00039330215,0.004113319,0.0010331159,0.0017796744,0.0011322211,0.001047466,0.004116815],"category_scores_gemma":[0.07162661,0.00029961806,0.0002501338,0.0043991497,0.0035458528,0.004208814,0.0015793398,0.001182401,0.0004101551],"study_design_candidate":"observational","study_design_consensus":"observational","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.00024255224,0.00017079667,0.9300351,0.000054180106,0.00015783716,0.0004749513,0.012144018,0.0050425977,0.0019301532,0.027079543,0.0005389222,0.022129245],"study_design_scores_gemma":[0.000027739168,0.00028067234,0.92292476,0.00006397406,0.00008734792,0.0021077686,0.0124132745,0.023481254,0.0013374655,0.0339842,0.0032283121,0.00006328129],"about_ca_topic_score_codex":0.0060214894,"about_ca_topic_score_gemma":0.005679198,"teacher_disagreement_score":0.995018,"about_ca_system_score_codex":0.00091278634,"about_ca_system_score_gemma":0.0003869108,"threshold_uncertainty_score":0.026347697},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16450082,0.009401965,0.6364604,0.014513688,0.0012541476,0.0005832776,0.0011716064,0.055772573,0.11634148],"genre_scores_gemma":[0.37042323,0.003126683,0.60117084,0.0014393822,0.0004303636,0.00048457432,0.0013025715,0.007129748,0.014492679],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98460567,0.0071416916,0.0006432152,0.0013479567,0.0056928326,0.0005685963],"domain_scores_gemma":[0.9007604,0.05447537,0.0016964885,0.020881549,0.018912178,0.0032740287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029497571,0.0012389225,0.0012965945,0.0029383667,0.0015973403,0.0054567354,0.004926632,0.0013938859,0.0074742325],"category_scores_gemma":[0.07485249,0.0009397957,0.00066017435,0.003426273,0.0023722472,0.013147299,0.0041901073,0.0054500992,0.002072908],"study_design_candidate":"not_applicable","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.0027428246,0.0012326195,0.011239152,0.00067423045,0.00017352054,0.00015397719,0.0026707717,0.01656108,0.015134665,0.1374611,0.07371888,0.7382372],"study_design_scores_gemma":[0.0015753108,0.0013192414,0.008617536,0.000801935,0.0004303589,0.0007482729,0.0022806493,0.34874797,0.075280845,0.20429759,0.35545105,0.00044918153],"about_ca_topic_score_codex":0.0041169263,"about_ca_topic_score_gemma":0.0041651563,"teacher_disagreement_score":0.029497571,"about_ca_system_score_codex":0.0026014615,"about_ca_system_score_gemma":0.0041055502,"threshold_uncertainty_score":0.15599996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059456665,0.00047810926,0.9372499,0.00025952808,0.00004116278,0.00015137186,0.00031780312,0.0016218156,0.00042370253],"genre_scores_gemma":[0.42958987,0.0002581458,0.5659839,0.00020209132,0.00008717525,0.0005339192,0.0022925832,0.0003777079,0.00067459757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950288,0.0026040738,0.0003225575,0.001087149,0.00053265097,0.00042482925],"domain_scores_gemma":[0.9615428,0.03343609,0.0011102771,0.0014549514,0.0019320542,0.0005239409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006223495,0.0015416779,0.0019996576,0.005413289,0.0017197939,0.0031746514,0.0022800516,0.0027208468,0.0016544014],"category_scores_gemma":[0.039250858,0.0014480333,0.002053682,0.0038238624,0.0013187672,0.0043895845,0.0019030201,0.003874375,0.0007225],"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.0021542604,0.0012528852,0.035645645,0.0008120415,0.00082866347,0.00029378434,0.002005057,0.2527653,0.019818718,0.026195155,0.014661975,0.6435665],"study_design_scores_gemma":[0.00014046601,0.000055204095,0.0026779496,0.00004209265,0.00011401427,0.00006486457,0.00018184258,0.9671396,0.0028378016,0.02600445,0.0007042755,0.00003749715],"about_ca_topic_score_codex":0.011493518,"about_ca_topic_score_gemma":0.017972546,"teacher_disagreement_score":0.011493518,"about_ca_system_score_codex":0.0018337518,"about_ca_system_score_gemma":0.0033270686,"threshold_uncertainty_score":0.032913387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018570796,0.00041890933,0.94268775,0.0012516845,0.00025070625,0.00011399691,0.001785199,0.011023678,0.02389716],"genre_scores_gemma":[0.34648567,0.0011193338,0.61754245,0.0009529688,0.00027887663,0.0002479869,0.0073239673,0.0075420663,0.018506652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975848,0.00067993585,0.00018152792,0.00046928643,0.00084735925,0.00023717331],"domain_scores_gemma":[0.99655735,0.0018138706,0.0001225224,0.0009503295,0.00043025205,0.00012573287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018746922,0.0008613679,0.0011441169,0.0017756011,0.0011887159,0.005185645,0.0016599289,0.0016638117,0.016134696],"category_scores_gemma":[0.008916422,0.0014203781,0.0022440453,0.0022035567,0.0021714712,0.012207511,0.004858282,0.0041037668,0.003916131],"study_design_candidate":"not_applicable","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.00015396548,0.000065608416,0.0005739429,0.00018422844,0.000058903785,0.00020187451,0.0007056415,0.0049335505,0.002331151,0.8973828,0.015973412,0.077434935],"study_design_scores_gemma":[0.00004286393,0.000012636741,0.00011775431,0.000059600872,0.00005833181,0.00008305722,0.00012281981,0.026630582,0.003914357,0.9451626,0.023761483,0.00003393116],"about_ca_topic_score_codex":0.0029826122,"about_ca_topic_score_gemma":0.0053572278,"teacher_disagreement_score":0.016134696,"about_ca_system_score_codex":0.0011310601,"about_ca_system_score_gemma":0.001174128,"threshold_uncertainty_score":0.053976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02199855,0.00045601834,0.9654237,0.00095763523,0.00013931416,0.000053667027,0.0001405873,0.0012750077,0.009555483],"genre_scores_gemma":[0.49537605,0.000790171,0.4943274,0.0005289816,0.00021942829,0.0001748059,0.00045320063,0.00074376474,0.007386119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751246,0.00085877633,0.00034814043,0.00036766485,0.0006827975,0.00023007386],"domain_scores_gemma":[0.9966941,0.0011932908,0.00026816892,0.0009814068,0.00069017935,0.0001729031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004195493,0.00058549613,0.00074881467,0.0012801704,0.0014598179,0.004237384,0.002279621,0.0016304874,0.0025511405],"category_scores_gemma":[0.005476007,0.00094098557,0.0015377598,0.0011857423,0.002633816,0.0091592,0.0025952084,0.0030169094,0.0005279492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000026787508,0.000025771664,0.0002294967,0.000054269673,0.000014345925,0.000081883896,0.0006802114,0.0025240595,0.0015795153,0.981427,0.0006464408,0.012710276],"study_design_scores_gemma":[0.000032971606,0.000018980207,0.00013137987,0.00007329357,0.00005258075,0.0001523465,0.00015752405,0.019959744,0.003495107,0.9554601,0.02043901,0.000026813852],"about_ca_topic_score_codex":0.002537595,"about_ca_topic_score_gemma":0.0032169123,"teacher_disagreement_score":0.004237384,"about_ca_system_score_codex":0.0018707331,"about_ca_system_score_gemma":0.0017429049,"threshold_uncertainty_score":0.022188187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06813831,0.00025500185,0.910255,0.0010861978,0.000031285,0.00016648052,0.00017006318,0.005278161,0.014619503],"genre_scores_gemma":[0.4851829,0.00023420798,0.50470364,0.00028609097,0.000037654972,0.0001168497,0.00030411896,0.00211826,0.0070162765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951792,0.001990806,0.00022133024,0.00046064402,0.0014975687,0.00065051886],"domain_scores_gemma":[0.98224336,0.009807545,0.0006357865,0.0060115284,0.0010709551,0.00023077885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063757114,0.00059709005,0.0008842128,0.0010635913,0.0018018092,0.0029414964,0.003306476,0.0022926803,0.0048158113],"category_scores_gemma":[0.02311493,0.00056681794,0.0017059011,0.002931478,0.0032003468,0.005576979,0.0048010005,0.0026772371,0.00088458066],"study_design_candidate":"not_applicable","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.00042252245,0.00026555723,0.0035374807,0.000391586,0.000098777295,0.0013362062,0.0023380986,0.056991894,0.0062234495,0.7292682,0.006582227,0.192544],"study_design_scores_gemma":[0.00018817539,0.00019308848,0.00088624016,0.0001439808,0.00018324605,0.0013791878,0.0007003542,0.41754773,0.0316459,0.4864818,0.06056247,0.00008779984],"about_ca_topic_score_codex":0.0027110775,"about_ca_topic_score_gemma":0.0046796766,"teacher_disagreement_score":0.0063757114,"about_ca_system_score_codex":0.0010659776,"about_ca_system_score_gemma":0.0017503193,"threshold_uncertainty_score":0.033718407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09664169,0.0008889631,0.8842895,0.001108692,0.0001544748,0.00024105908,0.00030144173,0.00078066625,0.01559343],"genre_scores_gemma":[0.8008944,0.0010139428,0.18914187,0.00029539625,0.00017374726,0.00032047747,0.00063916243,0.0006585147,0.006862495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99176884,0.0029081784,0.0015135948,0.00085884996,0.002104567,0.0008459808],"domain_scores_gemma":[0.97536886,0.014978184,0.0016594365,0.004177873,0.0032632023,0.00055248756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010014506,0.0008507375,0.0012350226,0.003863294,0.0031147285,0.006687924,0.0020244035,0.0024255672,0.0026289069],"category_scores_gemma":[0.022042366,0.0020202931,0.0031165236,0.004065202,0.008144403,0.020676928,0.0049998024,0.004175729,0.0004965196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000813007,0.000038050075,0.0012733904,0.00016060859,0.000035085814,0.00021259717,0.002399484,0.0026858863,0.0016596037,0.97552574,0.00043189863,0.01549648],"study_design_scores_gemma":[0.000026073845,0.000024960213,0.00025886204,0.00009406259,0.000078951016,0.00014693412,0.00047990677,0.007800509,0.0028945256,0.9821362,0.0060297446,0.000029306164],"about_ca_topic_score_codex":0.0034117526,"about_ca_topic_score_gemma":0.003415855,"teacher_disagreement_score":0.010014506,"about_ca_system_score_codex":0.002190194,"about_ca_system_score_gemma":0.0028420286,"threshold_uncertainty_score":0.052962422},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95623773,0.0004660661,0.021867402,0.0016870678,0.000055862012,0.00006088728,0.00010274235,0.0005999436,0.018922273],"genre_scores_gemma":[0.9919962,0.00014521503,0.005755283,0.00029169148,0.000014713773,0.000030185807,0.000072551484,0.0004116586,0.001282501],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99001384,0.0057791886,0.0003017991,0.0014080039,0.0018847456,0.0006123791],"domain_scores_gemma":[0.8258317,0.14062184,0.013393721,0.007109981,0.010460144,0.0025825445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006999307,0.00057153025,0.00045240662,0.0012302294,0.0009915588,0.0071937945,0.00091548206,0.002658373,0.003694713],"category_scores_gemma":[0.16852848,0.00083905447,0.0004537546,0.0009699252,0.00200332,0.013867848,0.0019335487,0.002641962,0.0007066537],"study_design_candidate":"observational","study_design_consensus":"observational","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.0023696742,0.002404824,0.47798467,0.00092144264,0.00072223134,0.00080500904,0.09726113,0.004994939,0.075947784,0.031152153,0.009314342,0.29612187],"study_design_scores_gemma":[0.0003556443,0.0016120742,0.7501581,0.0005664442,0.0012551764,0.0010362457,0.055632528,0.03366573,0.051655345,0.07823149,0.025420893,0.0004104253],"about_ca_topic_score_codex":0.0019519364,"about_ca_topic_score_gemma":0.0025332575,"teacher_disagreement_score":0.0071937945,"about_ca_system_score_codex":0.00088258827,"about_ca_system_score_gemma":0.00086127856,"threshold_uncertainty_score":0.037016332},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003414168,0.00026774497,0.7756622,0.00086297846,0.0005130768,0.00019263953,0.010714462,0.17190973,0.036463108],"genre_scores_gemma":[0.134721,0.0018923595,0.55898505,0.0019289524,0.00070231676,0.0011408085,0.061577268,0.13722675,0.10182548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985349,0.00024896784,0.00017571924,0.00028032335,0.00061440346,0.00014559984],"domain_scores_gemma":[0.9976927,0.0006471108,0.00014084231,0.0009425019,0.0004749758,0.0001018372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147277,0.0010970728,0.00076428906,0.0014937595,0.0007084939,0.003808749,0.0027728768,0.0010654675,0.04970329],"category_scores_gemma":[0.0046788994,0.0010595632,0.0013055737,0.0015440336,0.0010890212,0.0047426736,0.0036166972,0.0041467557,0.037453778],"study_design_candidate":"not_applicable","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.00045030733,0.00021091587,0.0011487951,0.0010879614,0.000073450035,0.0005247373,0.00067610387,0.003980379,0.015597665,0.30914432,0.32321587,0.34388956],"study_design_scores_gemma":[0.0001992747,0.00007699242,0.00044279126,0.00030217576,0.000068533875,0.0007726067,0.00016407405,0.028962305,0.05182554,0.17047273,0.7466107,0.000102323604],"about_ca_topic_score_codex":0.0012152623,"about_ca_topic_score_gemma":0.0010199838,"teacher_disagreement_score":0.04970329,"about_ca_system_score_codex":0.0007887486,"about_ca_system_score_gemma":0.0018034823,"threshold_uncertainty_score":0.16627407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.655942,0.002896077,0.3319842,0.0028910728,0.00007529467,0.00009907073,0.00024229381,0.00032177652,0.0055480893],"genre_scores_gemma":[0.97195655,0.00094791426,0.024648491,0.00008693719,0.00011720856,0.000097115764,0.00026013728,0.00009288617,0.0017928516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966814,0.0024480424,0.0001032021,0.0003427077,0.00024570356,0.00017888172],"domain_scores_gemma":[0.9218579,0.0719838,0.0020268979,0.001930685,0.0013629267,0.00083781866],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006650657,0.0006665324,0.0010480109,0.0030670683,0.0009902626,0.0029002884,0.0014436508,0.001952693,0.0026030503],"category_scores_gemma":[0.052071422,0.0009069428,0.0015324674,0.0036039131,0.0009540666,0.008290567,0.0013152105,0.0019913653,0.00035262952],"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.0007989627,0.0008040297,0.12463324,0.00083496305,0.0013271781,0.00061395223,0.006384851,0.34559876,0.006379063,0.3097241,0.006347086,0.19655386],"study_design_scores_gemma":[0.00006084682,0.000119183554,0.008352459,0.00003474368,0.0001738346,0.00016602178,0.00070504035,0.8728534,0.0008785827,0.114482336,0.0021438436,0.000029729357],"about_ca_topic_score_codex":0.0053309635,"about_ca_topic_score_gemma":0.0048311083,"teacher_disagreement_score":0.9933493,"about_ca_system_score_codex":0.001456497,"about_ca_system_score_gemma":0.0007379748,"threshold_uncertainty_score":0.035172462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40292633,0.0006474679,0.53745085,0.0006027489,0.00015787325,0.00034644,0.0053721503,0.039321337,0.013174824],"genre_scores_gemma":[0.46283317,0.0004580544,0.5070058,0.0001148808,0.00006748968,0.00025354238,0.015730469,0.007767199,0.005769388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994804,0.00006513462,0.000055131306,0.00010668348,0.00018318693,0.00010951848],"domain_scores_gemma":[0.99813545,0.0005519209,0.0001938186,0.0005481353,0.00046158192,0.00010908911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003252271,0.0012399731,0.0010406352,0.0023050397,0.00072215335,0.0011640121,0.001037055,0.00063298305,0.0054660724],"category_scores_gemma":[0.0036424757,0.001037647,0.0011309804,0.0025498061,0.00031156166,0.0024694472,0.000970538,0.0008580482,0.0035051988],"study_design_candidate":"not_applicable","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.0016669686,0.00035456067,0.018925779,0.0008793364,0.00008985116,0.0014204071,0.00076525816,0.020212416,0.14384027,0.007196656,0.030675052,0.77397335],"study_design_scores_gemma":[0.0004549179,0.00088308565,0.02732151,0.00024248847,0.00048673464,0.0016654081,0.0021555373,0.5736967,0.29037508,0.028698148,0.07386692,0.00015358247],"about_ca_topic_score_codex":0.0020861053,"about_ca_topic_score_gemma":0.0041415347,"teacher_disagreement_score":0.0054660724,"about_ca_system_score_codex":0.00034305526,"about_ca_system_score_gemma":0.001224869,"threshold_uncertainty_score":0.018285811},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08426201,0.0012323057,0.87972176,0.0019662264,0.00013957772,0.00008602956,0.00043082322,0.0010438353,0.031117404],"genre_scores_gemma":[0.9009362,0.0012216227,0.08477462,0.0005708088,0.00058504887,0.00024194091,0.0007958451,0.00035268225,0.010521268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693465,0.0005633988,0.00026073406,0.0005700525,0.0011391893,0.0005318944],"domain_scores_gemma":[0.9889535,0.0053061717,0.0015074827,0.0021353276,0.0016013666,0.00049622456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024425674,0.0006375918,0.00084258657,0.0029090869,0.0016864263,0.005472292,0.0025101297,0.0014744196,0.0069959206],"category_scores_gemma":[0.012234854,0.0007078174,0.0008602156,0.0029663227,0.0041375384,0.01357185,0.002697441,0.0030769152,0.00087855256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00004037126,0.000023395392,0.000556188,0.000055711433,0.00001431813,0.000061730185,0.00057290687,0.006012995,0.0010423022,0.98100454,0.0009066394,0.009708855],"study_design_scores_gemma":[0.00001723301,0.000029589337,0.0003632309,0.00002350738,0.000039008268,0.00011362598,0.00023936632,0.025592797,0.0014908296,0.9660158,0.0060571893,0.000017714054],"about_ca_topic_score_codex":0.0020621577,"about_ca_topic_score_gemma":0.0011592,"teacher_disagreement_score":0.0069959206,"about_ca_system_score_codex":0.0019859807,"about_ca_system_score_gemma":0.0009927574,"threshold_uncertainty_score":0.023403645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30041504,0.0029930677,0.58898157,0.0071977116,0.0036818292,0.00080521073,0.0069094375,0.01118735,0.07782878],"genre_scores_gemma":[0.75334156,0.0005892205,0.22514533,0.00050331914,0.0014843342,0.0004040199,0.0049478943,0.0017389393,0.011845437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9830283,0.007197151,0.0021902143,0.002005843,0.0044944845,0.001084014],"domain_scores_gemma":[0.77629775,0.12815645,0.023570897,0.0281378,0.037002645,0.006834509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011495177,0.0017178081,0.0017778777,0.017667454,0.0032556944,0.008136672,0.0023745107,0.0020578338,0.03063122],"category_scores_gemma":[0.25678936,0.0006720479,0.0010590405,0.015443065,0.0037285571,0.01945807,0.005048565,0.0028766405,0.007332691],"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.0018162047,0.00031060015,0.0457192,0.00067845907,0.00016072716,0.00039301228,0.0036837559,0.005901535,0.0025449838,0.0769192,0.08297163,0.7789006],"study_design_scores_gemma":[0.00048259064,0.0017758243,0.05469128,0.0010383893,0.00027170172,0.0013792831,0.008047144,0.12259056,0.013202911,0.6768135,0.11905979,0.00064705126],"about_ca_topic_score_codex":0.0020941412,"about_ca_topic_score_gemma":0.0027955223,"teacher_disagreement_score":0.03063122,"about_ca_system_score_codex":0.0012555897,"about_ca_system_score_gemma":0.0027247313,"threshold_uncertainty_score":0.10247165},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017321875,0.3316728,0.57513446,0.014899513,0.0011160073,0.00016125533,0.0011620698,0.0014169111,0.05711519],"genre_scores_gemma":[0.19378139,0.42213434,0.3580458,0.005531684,0.005525473,0.0002708794,0.0036736412,0.0013770501,0.009659723],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9945332,0.0022089165,0.0007108037,0.0010505329,0.0012960428,0.00020057286],"domain_scores_gemma":[0.96716523,0.027643204,0.000608031,0.0020711701,0.002291136,0.00022116785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067884983,0.0008625108,0.0019302784,0.008422466,0.0017196073,0.0053037032,0.0024986167,0.002607226,0.007988327],"category_scores_gemma":[0.029710878,0.0011664262,0.0012725585,0.011550422,0.0035391708,0.017308,0.002590143,0.0028498864,0.00280845],"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.00007699445,0.00011810449,0.0038716816,0.0034566121,0.00009535296,0.00018862248,0.0008644193,0.0037205326,0.0012181666,0.27264404,0.014572364,0.69917315],"study_design_scores_gemma":[0.000029090465,0.00009294755,0.0038954085,0.0022457577,0.00012992375,0.0011461035,0.00082192913,0.02637982,0.0031313202,0.65378577,0.30824262,0.00009932126],"about_ca_topic_score_codex":0.0024692828,"about_ca_topic_score_gemma":0.002629411,"teacher_disagreement_score":0.008422466,"about_ca_system_score_codex":0.002044167,"about_ca_system_score_gemma":0.0032190168,"threshold_uncertainty_score":0.035901427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010499465,0.00031391863,0.9939976,0.00016851847,0.000055319222,0.0000610822,0.00006115121,0.0012417346,0.0030508414],"genre_scores_gemma":[0.07137751,0.0018699904,0.91572773,0.00050174503,0.00021489483,0.00026051546,0.0005000206,0.0012154232,0.008332258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968803,0.00072921306,0.0003244971,0.00049272325,0.0012892107,0.00028398228],"domain_scores_gemma":[0.99752575,0.0013929356,0.00013292536,0.0005961598,0.00029334455,0.000058838577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027741245,0.0015292655,0.0009154615,0.0031436188,0.0020916467,0.005116702,0.0027956672,0.0020218752,0.009052467],"category_scores_gemma":[0.0069388417,0.0013917144,0.0030089312,0.0042401915,0.0028611284,0.01208349,0.0032186005,0.004981476,0.004115908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00008570335,0.00009775708,0.00038351564,0.00047728562,0.00007378339,0.0002714928,0.0005545165,0.011312374,0.008196375,0.83891004,0.0048641087,0.13477291],"study_design_scores_gemma":[0.00002561932,0.000036099103,0.00011509564,0.00016965496,0.00007546306,0.00029932018,0.00008694347,0.048154466,0.016642408,0.88188934,0.052440226,0.00006543065],"about_ca_topic_score_codex":0.0014576744,"about_ca_topic_score_gemma":0.0017037182,"teacher_disagreement_score":0.009052467,"about_ca_system_score_codex":0.0012552274,"about_ca_system_score_gemma":0.0016079985,"threshold_uncertainty_score":0.030283451},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15756443,0.00065628963,0.76970446,0.00030515992,0.00038735956,0.0001820913,0.00040813186,0.05565647,0.015135538],"genre_scores_gemma":[0.56050676,0.00027744778,0.42095092,0.00036821043,0.000109934925,0.00017357303,0.0009532217,0.0051640333,0.011495888],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968624,0.000041055606,0.000028686643,0.00006160215,0.00010586688,0.00007656201],"domain_scores_gemma":[0.99949276,0.00012025315,0.000045235785,0.00014860969,0.00014515636,0.000047934915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040239526,0.0005798399,0.00046486332,0.00044469797,0.0004575361,0.0007352666,0.0013628665,0.00033408648,0.0037451552],"category_scores_gemma":[0.0008497856,0.00051505625,0.00042502722,0.00038394163,0.00032646194,0.0007790105,0.000965278,0.00072430307,0.0012795787],"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.0022326447,0.00037694603,0.004232034,0.00044425603,0.00013776973,0.00044250884,0.0003165395,0.049674112,0.2538437,0.025799131,0.032903057,0.62959725],"study_design_scores_gemma":[0.0006753534,0.00063933886,0.0028661282,0.00006382356,0.00026370867,0.00051794027,0.00013926713,0.68420476,0.23984902,0.016745616,0.05393801,0.00009712145],"about_ca_topic_score_codex":0.0011763121,"about_ca_topic_score_gemma":0.003246255,"teacher_disagreement_score":0.0037451552,"about_ca_system_score_codex":0.00039445848,"about_ca_system_score_gemma":0.0013476503,"threshold_uncertainty_score":0.012528837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3709234,0.0002058989,0.6104815,0.00038185954,0.00004597322,0.00045188598,0.00007884004,0.009090072,0.008340565],"genre_scores_gemma":[0.7454935,0.00008604815,0.25113934,0.000060361876,0.000016777944,0.00016777104,0.00019870781,0.0006022804,0.0022352412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914697,0.0043263193,0.0004773308,0.00078979816,0.0023409207,0.00059585145],"domain_scores_gemma":[0.91058356,0.064941354,0.003530397,0.01396174,0.005171261,0.0018117344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010931325,0.0009135733,0.0008477204,0.00088702876,0.0012395096,0.003870051,0.0023644473,0.002055476,0.0041257236],"category_scores_gemma":[0.07025163,0.0012071581,0.0006263607,0.0006603959,0.0014823787,0.0060797115,0.0047071525,0.002232384,0.0011691065],"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.0062686503,0.0025165072,0.035536684,0.0009893627,0.00017141158,0.0013917208,0.023406371,0.0693248,0.07193414,0.092325464,0.004643846,0.69149107],"study_design_scores_gemma":[0.0005999201,0.0021346803,0.0053558047,0.00041862583,0.00018382183,0.00096391933,0.0039849062,0.71702987,0.15098275,0.09483478,0.02330636,0.00020450015],"about_ca_topic_score_codex":0.00077162037,"about_ca_topic_score_gemma":0.0010917484,"teacher_disagreement_score":0.010931325,"about_ca_system_score_codex":0.00048430427,"about_ca_system_score_gemma":0.001750571,"threshold_uncertainty_score":0.05781108},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009366323,0.30580455,0.30755165,0.035889573,0.025118344,0.00011920743,0.0034551974,0.0012342464,0.31146094],"genre_scores_gemma":[0.2672847,0.25826213,0.13240378,0.007128001,0.04620019,0.00059587986,0.0059369504,0.002432733,0.27975553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988111,0.0002508337,0.00007138085,0.0003494951,0.00044490962,0.000072228046],"domain_scores_gemma":[0.9987477,0.00060188345,0.00011272095,0.00019598249,0.0002615969,0.00008007555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012861682,0.0017770284,0.0022300358,0.0030989174,0.0015073258,0.004289214,0.0012588259,0.0014610599,0.020541647],"category_scores_gemma":[0.0038564517,0.0013774255,0.0014418688,0.008467229,0.0025502404,0.005432387,0.0023007952,0.005490295,0.005581717],"study_design_candidate":"not_applicable","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.000055369965,0.000062034786,0.00047419124,0.00096760935,0.00009062467,0.00006009436,0.00019354181,0.010096616,0.0006390862,0.6090082,0.20689595,0.17145674],"study_design_scores_gemma":[0.00003151168,0.000034341316,0.002242188,0.0006046288,0.000086654036,0.00015824872,0.000057481164,0.009279087,0.0009081928,0.5670638,0.41949,0.00004393792],"about_ca_topic_score_codex":0.0071691526,"about_ca_topic_score_gemma":0.005570308,"teacher_disagreement_score":0.020541647,"about_ca_system_score_codex":0.008521473,"about_ca_system_score_gemma":0.0020799965,"threshold_uncertainty_score":0.06871861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2316916,0.002487119,0.5742744,0.006825773,0.000886769,0.00020542159,0.00089684513,0.0015197018,0.18121235],"genre_scores_gemma":[0.9120236,0.0007880273,0.05976378,0.0016963747,0.00045739324,0.00028807018,0.0005976922,0.0004632132,0.023921782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709594,0.00064998254,0.0002069274,0.0007539782,0.00084375707,0.00044929492],"domain_scores_gemma":[0.98731637,0.009474516,0.00041255017,0.0015282361,0.0007628635,0.0005054456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886036,0.0009592399,0.0014539901,0.0015681993,0.0027253053,0.00376298,0.0038461797,0.0023861593,0.015694756],"category_scores_gemma":[0.010048692,0.0008140574,0.0025497223,0.0017815476,0.005220997,0.01150881,0.004580269,0.008081302,0.001349043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000902797,0.000045698063,0.00012900362,0.00007334041,0.000015533473,0.0000697501,0.00016264299,0.0015589966,0.0014847171,0.98964685,0.00093906384,0.0057842247],"study_design_scores_gemma":[0.000020413516,0.000020308951,0.00005186097,0.000010492957,0.000014607399,0.0000638325,0.000017052422,0.008776175,0.001078693,0.988596,0.0013381728,0.000012395117],"about_ca_topic_score_codex":0.00069992524,"about_ca_topic_score_gemma":0.00078299164,"teacher_disagreement_score":0.015694756,"about_ca_system_score_codex":0.002134437,"about_ca_system_score_gemma":0.0011269625,"threshold_uncertainty_score":0.05250424},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035822068,0.03232201,0.76738405,0.02640097,0.012425096,0.0003705732,0.00045013524,0.0050092596,0.1520556],"genre_scores_gemma":[0.056600004,0.044481866,0.74894536,0.0072468594,0.010551839,0.00084036065,0.0015676357,0.0063365153,0.12342958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99409455,0.0014268244,0.0010720554,0.00078029407,0.0023018897,0.00032447715],"domain_scores_gemma":[0.99285793,0.0028936828,0.00041150258,0.0017981719,0.0015613865,0.00047725072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00628172,0.0006656059,0.001070046,0.0021486527,0.0013714449,0.009659651,0.0020514862,0.0027947314,0.011549557],"category_scores_gemma":[0.010266524,0.0011476345,0.0011194145,0.0026069444,0.004936369,0.0061282646,0.0023384898,0.008684611,0.00854301],"study_design_candidate":"not_applicable","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.00004113069,0.00011834171,0.000795274,0.00070037995,0.000033836215,0.00010336232,0.0008740188,0.0011229176,0.0030951262,0.5828305,0.13201767,0.27826744],"study_design_scores_gemma":[0.000019064206,0.00003345617,0.0008916427,0.00057456776,0.000023557051,0.00066159916,0.00016457654,0.0026278815,0.0017590385,0.16812368,0.82508284,0.000038254628],"about_ca_topic_score_codex":0.0019121789,"about_ca_topic_score_gemma":0.0017037393,"teacher_disagreement_score":0.011549557,"about_ca_system_score_codex":0.0015569348,"about_ca_system_score_gemma":0.004526785,"threshold_uncertainty_score":0.03863716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052685335,0.00039528767,0.9058177,0.0019162802,0.0009454907,0.0010121028,0.0010609057,0.014725849,0.021441069],"genre_scores_gemma":[0.47325388,0.0003681825,0.50754637,0.0010661641,0.00013087288,0.000678776,0.0016202657,0.0030154332,0.012320023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9742305,0.010765478,0.0015919169,0.0019316067,0.009756701,0.0017238073],"domain_scores_gemma":[0.9522504,0.019005034,0.0019623414,0.016335638,0.009770917,0.0006757371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021326445,0.0010633112,0.000874039,0.0020147678,0.001983724,0.0046355207,0.0035294052,0.0026261865,0.009044881],"category_scores_gemma":[0.052523904,0.001181624,0.0021521377,0.00068335386,0.003325649,0.0050897878,0.0037999123,0.003697301,0.0029647565],"study_design_candidate":"not_applicable","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.0019989402,0.0011574447,0.00731821,0.0016659361,0.00033034015,0.0014375148,0.0025595087,0.07695232,0.08256895,0.6093236,0.03528472,0.17940249],"study_design_scores_gemma":[0.00059096364,0.0010027526,0.0025342759,0.0012205521,0.00025198114,0.0008430621,0.0006055509,0.5373069,0.21079496,0.12999706,0.11449711,0.00035486577],"about_ca_topic_score_codex":0.012770179,"about_ca_topic_score_gemma":0.0078511,"teacher_disagreement_score":0.021326445,"about_ca_system_score_codex":0.0024054868,"about_ca_system_score_gemma":0.009809202,"threshold_uncertainty_score":0.11278635},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012453535,0.03597303,0.030258244,0.045820564,0.7545111,0.00037473757,0.0017787595,0.003077753,0.12696038],"genre_scores_gemma":[0.0054164743,0.025181247,0.00895656,0.015664948,0.581992,0.0002920861,0.0031801295,0.0025164213,0.35680008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99689853,0.00041329904,0.00022226007,0.00069606234,0.001499521,0.00027039414],"domain_scores_gemma":[0.9900003,0.002424654,0.0008023442,0.0014663137,0.0038519902,0.0014543922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030585378,0.002546419,0.0019017318,0.007972174,0.0017594504,0.0040298416,0.0023970888,0.004624092,0.10354916],"category_scores_gemma":[0.009262703,0.00092569395,0.0018663938,0.003985087,0.0013791136,0.0049750246,0.004274002,0.004530012,0.071712516],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000018862222,0.000047130354,0.00014259933,0.00017691987,0.000008627521,0.000063189895,0.000011742709,0.000105251376,0.0005165464,0.0015783206,0.94022495,0.05710579],"study_design_scores_gemma":[0.000007099339,0.00005736479,0.0009925206,0.00026358376,0.000011091004,0.0003420557,0.000016324611,0.0003831487,0.00048071274,0.0051181465,0.99230886,0.0000191019],"about_ca_topic_score_codex":0.0016876076,"about_ca_topic_score_gemma":0.005142238,"teacher_disagreement_score":0.10354916,"about_ca_system_score_codex":0.0021775186,"about_ca_system_score_gemma":0.0026351947,"threshold_uncertainty_score":0.3464064},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011385586,0.36130205,0.1231289,0.046512064,0.07315415,0.00021253161,0.00824895,0.0019064434,0.37414935],"genre_scores_gemma":[0.06941873,0.18609765,0.040608477,0.003111042,0.027633213,0.00024343038,0.010987928,0.0015203978,0.6603792],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993149,0.000077012926,0.000046832425,0.00021269568,0.0003093721,0.000039205373],"domain_scores_gemma":[0.99851745,0.00056698127,0.000061633895,0.00011985681,0.0006024696,0.00013157143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091733964,0.0012271777,0.0013309391,0.0025666323,0.00094909506,0.0031752987,0.00066626724,0.00083080947,0.041810352],"category_scores_gemma":[0.0028968374,0.0005753675,0.00076867297,0.006033379,0.0007637874,0.0024049445,0.00086136546,0.0018925825,0.011310395],"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.00013856347,0.0000560734,0.00030961935,0.0012172115,0.000049799713,0.000067603185,0.00008569732,0.005632348,0.0016967641,0.07970349,0.59532136,0.31572148],"study_design_scores_gemma":[0.000025702418,0.00004822509,0.0012095054,0.00045803332,0.000059278344,0.00013513767,0.000050490955,0.0050637308,0.0023226282,0.0746132,0.9159855,0.000028531334],"about_ca_topic_score_codex":0.008251712,"about_ca_topic_score_gemma":0.008540199,"teacher_disagreement_score":0.041810352,"about_ca_system_score_codex":0.004288477,"about_ca_system_score_gemma":0.0029672764,"threshold_uncertainty_score":0.13986957},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001212343,0.018573321,0.0022646096,0.060839698,0.8670418,0.00020009004,0.0009994137,0.0006721466,0.0481966],"genre_scores_gemma":[0.0033924787,0.011943376,0.00072305097,0.03542597,0.85023105,0.0001789133,0.0010073966,0.00026919664,0.09682858],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855167,0.00021860785,0.00022911064,0.00037145722,0.0003985306,0.00023055219],"domain_scores_gemma":[0.9930577,0.0020834922,0.0006354874,0.0004194433,0.0018056952,0.001998221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051457,0.0027049503,0.002789588,0.0043624793,0.0011484469,0.0026441277,0.0021812278,0.011015825,0.058009736],"category_scores_gemma":[0.00657793,0.0010190163,0.0018429856,0.0015378073,0.0011457786,0.0019837928,0.002097056,0.0049923263,0.035408124],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000080914004,0.00004814573,0.00020849428,0.0001934929,0.00001588079,0.0006699811,0.0000070151605,0.000085933956,0.00036070507,0.00039980595,0.97525305,0.022676667],"study_design_scores_gemma":[0.000048980575,0.00012483436,0.002750709,0.00030648906,0.000035941674,0.002434114,0.0000130919725,0.00017814447,0.00031747148,0.0019370605,0.9918281,0.000025026637],"about_ca_topic_score_codex":0.0015215506,"about_ca_topic_score_gemma":0.00481788,"teacher_disagreement_score":0.058009736,"about_ca_system_score_codex":0.0015764296,"about_ca_system_score_gemma":0.0013622468,"threshold_uncertainty_score":0.19406193},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010607285,0.01224465,0.0009354583,0.024509767,0.9541603,0.000043168446,0.00028182345,0.00012635758,0.0075923805],"genre_scores_gemma":[0.0007839495,0.008467911,0.0004893791,0.010143808,0.93124163,0.000066678556,0.00060369284,0.0003061018,0.047896862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978169,0.00030601345,0.00024556133,0.00034675075,0.0011042391,0.00018060373],"domain_scores_gemma":[0.9773243,0.0055298232,0.0013519042,0.0010655294,0.011055987,0.0036724214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004164037,0.0029189957,0.003692606,0.006962935,0.0022916114,0.006870829,0.0024744892,0.004481204,0.10571816],"category_scores_gemma":[0.017569557,0.0006864691,0.0017436701,0.0038561677,0.0009969752,0.0058186213,0.0031459625,0.008735226,0.06542396],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000018002724,0.000015803269,0.000035660047,0.00011944638,0.0000052489436,0.000019192918,0.000008094585,0.000027004626,0.00007758549,0.00039164734,0.98941004,0.009872326],"study_design_scores_gemma":[0.000018573939,0.00006702013,0.0006911854,0.00035234203,0.00002148955,0.00010976243,0.000034209028,0.00021354908,0.00011780844,0.0023943644,0.99596184,0.00001779483],"about_ca_topic_score_codex":0.0013570052,"about_ca_topic_score_gemma":0.0021535074,"teacher_disagreement_score":0.10571816,"about_ca_system_score_codex":0.0019967689,"about_ca_system_score_gemma":0.0026008217,"threshold_uncertainty_score":0.3536625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034861848,0.00037457116,0.9464621,0.0032873545,0.000071319075,0.00009267087,0.0002459951,0.00042705217,0.01417717],"genre_scores_gemma":[0.4840581,0.0017976882,0.506831,0.0007365178,0.00019418441,0.0004974561,0.00079145026,0.0003728422,0.0047208667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918194,0.004140243,0.000607403,0.00096447725,0.0020242229,0.00044439864],"domain_scores_gemma":[0.9626166,0.023379676,0.0018482588,0.004758313,0.006066201,0.0013309676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007134377,0.0010451818,0.0009947441,0.0019550917,0.0016760118,0.004846658,0.0030097927,0.002640545,0.0067914757],"category_scores_gemma":[0.044089034,0.0010593816,0.0016536044,0.004165896,0.009196509,0.016617978,0.0075081964,0.005818884,0.0008228128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000008021081,0.000012846556,0.0005313744,0.0000411692,0.000005544771,0.000022383521,0.00023385436,0.002237637,0.00015345542,0.98804456,0.00030131626,0.008407893],"study_design_scores_gemma":[0.0000093943,0.000020495647,0.0001987305,0.00006049094,0.000008192065,0.00005434565,0.0002149982,0.011949176,0.00045080087,0.9850963,0.0019240346,0.0000130159415],"about_ca_topic_score_codex":0.0028482855,"about_ca_topic_score_gemma":0.0017422248,"teacher_disagreement_score":0.007134377,"about_ca_system_score_codex":0.0014714439,"about_ca_system_score_gemma":0.003092776,"threshold_uncertainty_score":0.037730634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88654006,0.00020813919,0.078077964,0.0041110422,0.00011406294,0.0032336067,0.00039754133,0.00016609217,0.027151577],"genre_scores_gemma":[0.9301859,0.00021715467,0.061266717,0.00080486975,0.000017389422,0.0013658879,0.00015387505,0.000088208086,0.0059000063],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.96491295,0.027800357,0.0010150969,0.0014918332,0.0029729921,0.0018067071],"domain_scores_gemma":[0.91750914,0.06552686,0.002791171,0.006508881,0.0049188524,0.0027451054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018445695,0.0010199642,0.00071740703,0.0026671928,0.01123507,0.0044848872,0.003422937,0.0072337943,0.0042815697],"category_scores_gemma":[0.055060264,0.0009701868,0.0010306337,0.0026497294,0.005047207,0.0064691505,0.0059769806,0.00426241,0.00089903385],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.0012211562,0.006573775,0.025088672,0.0017920791,0.00010145723,0.03283554,0.7626182,0.002380148,0.011713204,0.062636845,0.0060256463,0.08701327],"study_design_scores_gemma":[0.0004981785,0.0023234372,0.013608714,0.0012012803,0.00018093557,0.017297072,0.8401835,0.013031556,0.021558035,0.019716678,0.0701735,0.00022716731],"about_ca_topic_score_codex":0.0075763846,"about_ca_topic_score_gemma":0.013015032,"teacher_disagreement_score":0.018445695,"about_ca_system_score_codex":0.0051122154,"about_ca_system_score_gemma":0.005381417,"threshold_uncertainty_score":0.097551346},"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":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012560262,0.045751244,0.44203064,0.1811469,0.0038767515,0.0004627378,0.00026123103,0.00035526368,0.31355503],"genre_scores_gemma":[0.5400277,0.045450516,0.32891127,0.03098243,0.008502866,0.004586683,0.00033487854,0.00052701577,0.04067661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9651294,0.021829037,0.0016274337,0.0029437514,0.0074084997,0.0010620407],"domain_scores_gemma":[0.94421804,0.036189478,0.0037818614,0.0066487077,0.006305781,0.002856074],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.023469456,0.0013328678,0.0021274975,0.010989617,0.0044903583,0.019388152,0.0040092077,0.009693149,0.007201413],"category_scores_gemma":[0.04664601,0.0014725492,0.001358652,0.008693585,0.05831411,0.035366423,0.010428564,0.01332523,0.002135906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000082509005,0.000021646085,0.00011898219,0.00005270265,0.0000026519099,0.000010065654,0.0010110921,0.000059420992,0.000030812564,0.99370146,0.0008345219,0.004148303],"study_design_scores_gemma":[0.0000374888,0.000029983603,0.00032071667,0.0002680225,0.000007855299,0.00011340033,0.0017764469,0.0008109362,0.00013521237,0.96158785,0.034892928,0.000019041077],"about_ca_topic_score_codex":0.003104343,"about_ca_topic_score_gemma":0.002240139,"teacher_disagreement_score":0.97653055,"about_ca_system_score_codex":0.008167957,"about_ca_system_score_gemma":0.011585119,"threshold_uncertainty_score":0.12411988},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003464677,0.0057403846,0.0014310043,0.03160364,0.91234976,0.00024324055,0.0012268958,0.00046265687,0.04659597],"genre_scores_gemma":[0.0022917017,0.0057577677,0.0010144075,0.012056067,0.46922824,0.0002807427,0.0028623324,0.00094250095,0.50556624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986364,0.00014812357,0.00012246963,0.00016998783,0.00078254676,0.00014044147],"domain_scores_gemma":[0.9847744,0.0015878882,0.00087117415,0.00052805356,0.009240623,0.002997866],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023209655,0.0022530272,0.0025631983,0.0040266737,0.0025445023,0.006647442,0.0021289426,0.003563699,0.36519003],"category_scores_gemma":[0.01071808,0.00054474134,0.0013144454,0.0021371525,0.0005767945,0.004338055,0.0031168866,0.004610572,0.22564182],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000016942984,0.000017348597,0.000029973258,0.000054762768,0.0000019366282,0.000015581467,0.0000049885202,0.00001764312,0.0000675204,0.00012651544,0.99166274,0.007983948],"study_design_scores_gemma":[0.00002309975,0.00006169022,0.0007793517,0.0001936695,0.000010333933,0.000052875555,0.000054751647,0.00019268024,0.00011249253,0.0009939021,0.99751127,0.000013985717],"about_ca_topic_score_codex":0.0026276894,"about_ca_topic_score_gemma":0.0051290332,"teacher_disagreement_score":0.36519003,"about_ca_system_score_codex":0.001598289,"about_ca_system_score_gemma":0.002503968,"threshold_uncertainty_score":0.9054794},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964954,0.00013020367,0.0013816751,0.00007554125,0.000019025989,0.000030765063,0.00033603903,0.00013463614,0.0013967658],"genre_scores_gemma":[0.99038965,0.0000911824,0.0061338414,0.000021758,0.000025697213,0.00006699035,0.0011889202,0.000087333574,0.001994513],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98801047,0.003102364,0.0015095768,0.0019200959,0.004844158,0.0006132584],"domain_scores_gemma":[0.8395121,0.083979785,0.031018572,0.010940313,0.028333504,0.0062157344],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.006131408,0.00035815433,0.0003165389,0.0070846053,0.001339801,0.0014655392,0.0007120893,0.00084309734,0.0011345455],"category_scores_gemma":[0.08011086,0.00029808548,0.0002843162,0.0044508865,0.0008219175,0.0019428576,0.0025302651,0.0006961812,0.00052158255],"study_design_candidate":"observational","study_design_consensus":"observational","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.00041727116,0.0002835737,0.8166114,0.00030203254,0.000082057704,0.000292636,0.0060080322,0.0014759551,0.006520628,0.0014893269,0.0019562966,0.1645608],"study_design_scores_gemma":[0.00007380224,0.0007398699,0.9376845,0.0001596703,0.00011155323,0.0012413362,0.005369612,0.021475442,0.0111484,0.0037535965,0.018157514,0.00008468202],"about_ca_topic_score_codex":0.0014645647,"about_ca_topic_score_gemma":0.0041332007,"teacher_disagreement_score":0.9938686,"about_ca_system_score_codex":0.00079549674,"about_ca_system_score_gemma":0.0013542314,"threshold_uncertainty_score":0.032426357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04411359,0.002061279,0.8173568,0.00439433,0.002165794,0.00012875059,0.0010499792,0.005041667,0.12368781],"genre_scores_gemma":[0.38995335,0.0016142769,0.5672802,0.0021892255,0.0007201775,0.00015678497,0.0012588889,0.0027392725,0.034087855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846256,0.00040178446,0.00012424299,0.000311804,0.000509065,0.00019048729],"domain_scores_gemma":[0.9972314,0.0011240721,0.00013635345,0.00070336997,0.00069059624,0.00011420475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102615,0.00075393205,0.0007509313,0.0021729493,0.0019349665,0.0037001076,0.0018383029,0.0016450187,0.010010886],"category_scores_gemma":[0.0059287054,0.0010897461,0.0017266877,0.0020725173,0.0034455261,0.0068481183,0.0036907676,0.003006709,0.0032415125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00007252109,0.000035601464,0.00015326121,0.00009553815,0.000012495515,0.00013117403,0.00034171133,0.0014260701,0.0010628732,0.96708965,0.0059269047,0.0236522],"study_design_scores_gemma":[0.000027606708,0.00001826776,0.00011554932,0.00006838691,0.000019887268,0.000103286555,0.00016379372,0.009862781,0.002184214,0.94865465,0.038757157,0.000024299788],"about_ca_topic_score_codex":0.0079603605,"about_ca_topic_score_gemma":0.007872698,"teacher_disagreement_score":0.010010886,"about_ca_system_score_codex":0.0018950106,"about_ca_system_score_gemma":0.0015854283,"threshold_uncertainty_score":0.033489764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.813342,0.010297384,0.11787476,0.042731676,0.00070791,0.00015438815,0.0003993799,0.0006103154,0.013882212],"genre_scores_gemma":[0.9674169,0.0015298158,0.02831609,0.0017588069,0.00032408372,0.00004319464,0.00019726454,0.00013393338,0.00027995746],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9165481,0.036770564,0.012110358,0.004285168,0.028103301,0.002182605],"domain_scores_gemma":[0.41051528,0.4296969,0.08734978,0.03215988,0.03623209,0.004046003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0722291,0.0004737972,0.0008223739,0.0063972254,0.0018948077,0.0063712336,0.0025487791,0.0035983128,0.0016332516],"category_scores_gemma":[0.4492901,0.0011156214,0.0008722159,0.005146103,0.0056214384,0.023203164,0.006331486,0.004919088,0.0004708859],"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.0008107107,0.00037059106,0.38941896,0.0015566647,0.00036531663,0.0017815772,0.037062164,0.0030269846,0.007530917,0.06768552,0.0057846108,0.4846059],"study_design_scores_gemma":[0.00023590123,0.0010200934,0.29500917,0.00526282,0.0009385996,0.024969136,0.12770814,0.03200998,0.01037212,0.45919865,0.04250785,0.00076755154],"about_ca_topic_score_codex":0.001683704,"about_ca_topic_score_gemma":0.0018449523,"teacher_disagreement_score":0.0722291,"about_ca_system_score_codex":0.0013508346,"about_ca_system_score_gemma":0.0035997953,"threshold_uncertainty_score":0.38198858},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030697876,0.024691781,0.002633416,0.17319357,0.54913074,0.000108246044,0.00080463843,0.00036388586,0.24876669],"genre_scores_gemma":[0.0035719324,0.010446604,0.0009940955,0.080426574,0.123736456,0.0001461604,0.00073124154,0.0005384189,0.7794085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900824,0.00014631235,0.00005924393,0.00017716447,0.00050303154,0.000106137566],"domain_scores_gemma":[0.9962798,0.00079227425,0.00017591141,0.00027726873,0.0017921723,0.000682596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001268054,0.00107707,0.0008469509,0.0017805328,0.0020838322,0.0042790677,0.0012607818,0.0037078501,0.15413973],"category_scores_gemma":[0.008170974,0.00027467404,0.0006208328,0.001129494,0.0012090085,0.0035312776,0.002309251,0.006762422,0.16061205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000009136534,0.000005339014,0.000017683276,0.000059221427,0.0000015163243,0.000013156333,0.00001288792,0.000009415112,0.000059086597,0.0052484046,0.9776758,0.016888289],"study_design_scores_gemma":[0.0000032431649,0.000007021844,0.00007093414,0.00009512518,0.0000022039399,0.000033875967,0.000016156733,0.000015056256,0.00006152688,0.0026584493,0.9970337,0.0000026800456],"about_ca_topic_score_codex":0.0020785825,"about_ca_topic_score_gemma":0.0033171568,"teacher_disagreement_score":0.84586024,"about_ca_system_score_codex":0.0021894793,"about_ca_system_score_gemma":0.0022751582,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019249367,0.0012437867,0.8528647,0.0053881165,0.0001240378,0.00019217691,0.000055455683,0.00011225799,0.12077026],"genre_scores_gemma":[0.7866677,0.0011537928,0.20106313,0.00071243657,0.00013036237,0.0006590425,0.00006655224,0.00007678166,0.009470205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917223,0.005297312,0.0003245433,0.0008367532,0.0014963929,0.00032273526],"domain_scores_gemma":[0.9879238,0.008654646,0.0005393435,0.0015931496,0.0009590972,0.0003299611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008276145,0.0010266032,0.0010288546,0.001978466,0.0017553605,0.0062284037,0.0026705207,0.0029207128,0.006067265],"category_scores_gemma":[0.021089073,0.00063451147,0.001448112,0.0017948484,0.014490288,0.008450468,0.0025494217,0.0036663099,0.0008400589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000005860638,0.000020489744,0.000163405,0.00003259242,0.0000099004565,0.000011827618,0.0002716303,0.0020681461,0.00008537761,0.9927713,0.00016831844,0.004391157],"study_design_scores_gemma":[0.00001718577,0.00002204677,0.00010061661,0.000028690449,0.000008448018,0.000030256688,0.00009228222,0.00847344,0.00015226379,0.98834306,0.002724792,0.000006890233],"about_ca_topic_score_codex":0.0017822575,"about_ca_topic_score_gemma":0.0010840545,"teacher_disagreement_score":0.008276145,"about_ca_system_score_codex":0.0038888631,"about_ca_system_score_gemma":0.0036893198,"threshold_uncertainty_score":0.043769002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11371127,0.000053066306,0.85956573,0.0006851881,0.000028615934,0.0001935879,0.00018160215,0.00093990174,0.024641016],"genre_scores_gemma":[0.8137313,0.00009562637,0.17658989,0.00014903922,0.000018917064,0.00039485493,0.00032599727,0.00018832508,0.008506058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951213,0.001919796,0.00032772092,0.00057110103,0.0013151224,0.0007449286],"domain_scores_gemma":[0.9923057,0.0042382907,0.0006607221,0.0019462123,0.0006072188,0.00024184913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036755092,0.00056623254,0.0006512505,0.00089520996,0.0008927147,0.0031506137,0.0019781147,0.0018307213,0.007249927],"category_scores_gemma":[0.008765525,0.0005725283,0.0018865257,0.00079540315,0.0035956607,0.0052555045,0.002516537,0.0024223537,0.00083919277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00011711833,0.00007634493,0.00046787658,0.000055279907,0.000033799373,0.00019973789,0.00041583818,0.028217554,0.003934697,0.9587717,0.00025411954,0.0074558486],"study_design_scores_gemma":[0.00018547206,0.00013379488,0.00029169585,0.000035083725,0.0000630715,0.000091510505,0.00020046107,0.14963773,0.008252394,0.8365736,0.0044977437,0.00003735954],"about_ca_topic_score_codex":0.0039007508,"about_ca_topic_score_gemma":0.0023653598,"teacher_disagreement_score":0.007249927,"about_ca_system_score_codex":0.0015803048,"about_ca_system_score_gemma":0.002002628,"threshold_uncertainty_score":0.024253428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3041019,0.046298184,0.56912196,0.032298144,0.0008537605,0.00036095583,0.0026267872,0.03068502,0.013653279],"genre_scores_gemma":[0.71563137,0.011034013,0.26163656,0.0015044896,0.000811073,0.0001892239,0.0027769625,0.0016618585,0.0047544874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98949933,0.0039434643,0.0005099199,0.0011667636,0.004406086,0.00047449055],"domain_scores_gemma":[0.94139427,0.028639428,0.0037782365,0.0106459595,0.0136716645,0.0018704259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077660056,0.0012253993,0.0020235567,0.009487138,0.0010542184,0.0059190462,0.0042114467,0.0024877554,0.0012200848],"category_scores_gemma":[0.029748522,0.0007809541,0.00087986776,0.006902207,0.0017004019,0.009859185,0.0017525285,0.0020526063,0.0013659779],"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.0003018892,0.0010652948,0.08686421,0.00089482183,0.00037014423,0.00035692728,0.0007733665,0.014620423,0.016436901,0.015140559,0.030116014,0.83305943],"study_design_scores_gemma":[0.000086786145,0.00045526627,0.04655755,0.0006161086,0.0002795422,0.0016271471,0.0021940675,0.7542414,0.0396543,0.10985837,0.044201143,0.00022823404],"about_ca_topic_score_codex":0.0047878637,"about_ca_topic_score_gemma":0.0068897814,"teacher_disagreement_score":0.009487138,"about_ca_system_score_codex":0.0012545908,"about_ca_system_score_gemma":0.0030442118,"threshold_uncertainty_score":0.041071057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12578781,0.00055719994,0.83837503,0.0003658886,0.00049272476,0.00035319783,0.00064196595,0.022466704,0.010959526],"genre_scores_gemma":[0.42764938,0.00031842108,0.5591213,0.0001915908,0.00011744472,0.00033838834,0.0017880697,0.0044252235,0.00605011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920017,0.00016911479,0.00006194714,0.000111228816,0.00033166565,0.00012597411],"domain_scores_gemma":[0.99722445,0.0013066728,0.00015475773,0.00042277697,0.0008139817,0.00007740894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010310335,0.00081603054,0.00068809406,0.0010705808,0.0006428163,0.0011850817,0.0013867109,0.000869952,0.005888665],"category_scores_gemma":[0.005117833,0.0007387094,0.0007686375,0.0007135818,0.000904707,0.0013921248,0.0011962228,0.0013074833,0.0012795482],"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.0012088029,0.00029474677,0.0032962195,0.0010679206,0.00013403529,0.0013116464,0.0013656067,0.09807191,0.1490402,0.16854165,0.029604191,0.54606307],"study_design_scores_gemma":[0.00029017858,0.0003101906,0.0006876991,0.00014349369,0.000105330604,0.00040092846,0.00020775085,0.66394335,0.25917658,0.049994573,0.024651775,0.00008828838],"about_ca_topic_score_codex":0.000754813,"about_ca_topic_score_gemma":0.0012525533,"teacher_disagreement_score":0.005888665,"about_ca_system_score_codex":0.00091452565,"about_ca_system_score_gemma":0.0013817692,"threshold_uncertainty_score":0.019699574},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030574212,0.039393544,0.05456267,0.036553428,0.68652266,0.0006437205,0.005311723,0.006616241,0.16733858],"genre_scores_gemma":[0.007957294,0.019980963,0.016698841,0.007017912,0.18277825,0.00030912974,0.010738275,0.0067308433,0.74778855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99622357,0.0005366921,0.0002502932,0.0005701231,0.0020057599,0.00041348385],"domain_scores_gemma":[0.98599094,0.003008674,0.00054857094,0.001295025,0.005996965,0.0031598439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005240989,0.0021599866,0.0027389328,0.0060159382,0.0017310081,0.009479013,0.0023491639,0.003312621,0.207419],"category_scores_gemma":[0.009472864,0.00076289196,0.0014213056,0.004355249,0.00079795363,0.0064980825,0.004050983,0.0041922173,0.09315024],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00007170903,0.0000602774,0.00011604234,0.00018480205,0.000012415349,0.000053231717,0.000026875246,0.00010963191,0.00063463073,0.0015517434,0.93509185,0.062086802],"study_design_scores_gemma":[0.00002603612,0.00007143793,0.00038534676,0.00022322767,0.000019136942,0.00013763837,0.000027516966,0.0005500625,0.00050368236,0.0028461867,0.9951916,0.000018276834],"about_ca_topic_score_codex":0.0015693166,"about_ca_topic_score_gemma":0.0048954417,"teacher_disagreement_score":0.207419,"about_ca_system_score_codex":0.0015467162,"about_ca_system_score_gemma":0.0031358788,"threshold_uncertainty_score":0.6938857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007452509,0.0001935575,0.99270105,0.000108129716,0.000019077002,0.0001798499,0.0001336174,0.0044968864,0.0014225907],"genre_scores_gemma":[0.039289586,0.00047815774,0.95619935,0.00015408969,0.000034937155,0.00079017936,0.00083464873,0.00094429066,0.0012747595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959014,0.0016221239,0.0003469729,0.00045738177,0.0013797956,0.00029224416],"domain_scores_gemma":[0.99512696,0.003291266,0.00031516192,0.00057553354,0.0005194432,0.00017149476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059237164,0.0024880737,0.0013798586,0.0032420347,0.0008038545,0.002825805,0.005625123,0.002167857,0.00594512],"category_scores_gemma":[0.013446929,0.0013256365,0.0030046413,0.0015159415,0.0029739663,0.0027735876,0.0033388028,0.003704058,0.0016722924],"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.0001877743,0.00026631262,0.0022131489,0.001110172,0.00022998112,0.0006426605,0.00039110435,0.52333283,0.0058501507,0.26095167,0.011219038,0.19360504],"study_design_scores_gemma":[0.00007222302,0.00008445418,0.00020505708,0.00021509134,0.000044473083,0.00029406504,0.00003557273,0.8724615,0.00335928,0.101492584,0.021695375,0.000040324947],"about_ca_topic_score_codex":0.00630772,"about_ca_topic_score_gemma":0.0077366726,"teacher_disagreement_score":0.00630772,"about_ca_system_score_codex":0.0016126035,"about_ca_system_score_gemma":0.0028704992,"threshold_uncertainty_score":0.031327963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035930026,0.000051058243,0.99224263,0.00012395594,0.000047275636,0.00006263619,0.00012096562,0.005813023,0.0011790608],"genre_scores_gemma":[0.044829436,0.0002862882,0.94802934,0.00039044474,0.00011619241,0.00047710922,0.00082547107,0.0022757368,0.0027700176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948612,0.0017555024,0.000417456,0.00054677716,0.0020414712,0.00037752723],"domain_scores_gemma":[0.99476177,0.0020212815,0.00034036665,0.0019274681,0.00072351017,0.0002257212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051728645,0.0020230678,0.0012057923,0.0017145372,0.001355492,0.0046566525,0.0051315227,0.0024335808,0.010368451],"category_scores_gemma":[0.012380828,0.0016233356,0.0039599203,0.0009538701,0.002283733,0.0055014757,0.0064412383,0.006981036,0.0036138715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00024249202,0.00020017072,0.000792743,0.0008212715,0.00020187753,0.00027690356,0.00035692885,0.06859828,0.0073636873,0.7508237,0.023075173,0.14724682],"study_design_scores_gemma":[0.00007919148,0.000101375575,0.00015155246,0.00026127198,0.00011839885,0.00022642578,0.000055525084,0.44669157,0.012694728,0.45097435,0.08857503,0.000070541384],"about_ca_topic_score_codex":0.002583793,"about_ca_topic_score_gemma":0.0034508645,"teacher_disagreement_score":0.010368451,"about_ca_system_score_codex":0.0013613177,"about_ca_system_score_gemma":0.0033634733,"threshold_uncertainty_score":0.03468585},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001517646,0.01823151,0.0017402504,0.0643497,0.90312207,0.000040887888,0.0002592681,0.00016181132,0.011942728],"genre_scores_gemma":[0.0013218966,0.013509506,0.0006671427,0.017570667,0.9152221,0.000077240256,0.00054397405,0.0003914238,0.05069598],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781895,0.0003799312,0.00019651675,0.0002940754,0.0011547739,0.0001557891],"domain_scores_gemma":[0.97489923,0.011392938,0.0013360658,0.0009814978,0.0082455985,0.003144764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039148647,0.0020376493,0.0020999678,0.004722135,0.0022069172,0.007353201,0.0019968133,0.0046004294,0.0841663],"category_scores_gemma":[0.022085384,0.0005881114,0.0011416515,0.003673013,0.0012095625,0.0062973755,0.0029906514,0.0097211385,0.03266129],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000008059182,0.000009993826,0.000018345401,0.00007831474,0.000003137068,0.000014477434,0.000012122922,0.000023594408,0.000031435862,0.00052054337,0.9915787,0.0077011744],"study_design_scores_gemma":[0.000016652402,0.000039256964,0.00030218132,0.00043491373,0.000014197417,0.000107696345,0.00005093871,0.0002003168,0.00007677115,0.0031986623,0.99554425,0.00001426117],"about_ca_topic_score_codex":0.0013126489,"about_ca_topic_score_gemma":0.0022973467,"teacher_disagreement_score":0.0841663,"about_ca_system_score_codex":0.0020610618,"about_ca_system_score_gemma":0.0019128623,"threshold_uncertainty_score":0.28156435},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000165413,0.013084322,0.00933885,0.028117971,0.913292,0.00015184449,0.00072657835,0.00079625804,0.034326814],"genre_scores_gemma":[0.0018827976,0.0111356815,0.003651371,0.01323059,0.73369384,0.00027796795,0.0019732546,0.0018859901,0.23226848],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820185,0.0002465188,0.00016706469,0.00028048357,0.0009929304,0.000111161884],"domain_scores_gemma":[0.9861813,0.005097458,0.00071840174,0.0008821497,0.005287883,0.0018327213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029762876,0.00269211,0.0030002769,0.0042079887,0.0016922575,0.0058674407,0.0022871068,0.0041250596,0.21623236],"category_scores_gemma":[0.0140330875,0.0007678845,0.0015840492,0.002633512,0.0009167263,0.0058091655,0.0025087066,0.008698904,0.12457806],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0000113912865,0.000016271237,0.000011405995,0.00009384942,0.0000035525636,0.00001578099,0.0000060506286,0.00004719905,0.00010243783,0.0007241251,0.98734736,0.011620663],"study_design_scores_gemma":[0.000021433027,0.000052816657,0.00027794056,0.00025891795,0.000013515913,0.000109201894,0.000019665313,0.00039468036,0.0001427341,0.005069848,0.99361986,0.000019269544],"about_ca_topic_score_codex":0.0009578085,"about_ca_topic_score_gemma":0.0018835848,"teacher_disagreement_score":0.21623236,"about_ca_system_score_codex":0.0016047026,"about_ca_system_score_gemma":0.0015743535,"threshold_uncertainty_score":0.7233693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43820533,0.00054014986,0.5415604,0.003763986,0.0000637282,0.00014495531,0.00013097694,0.00021292995,0.015377558],"genre_scores_gemma":[0.9210623,0.00011128613,0.077870905,0.000059657847,0.000012511406,0.0000725785,0.000061959494,0.00004550214,0.0007034261],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.98283696,0.013537755,0.0006921794,0.0007827698,0.0017761497,0.00037407715],"domain_scores_gemma":[0.79517084,0.18162262,0.008583442,0.004663136,0.008769798,0.0011901404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019934442,0.0005043713,0.00041058956,0.002144608,0.00092974806,0.0057057585,0.0018818723,0.0013716194,0.0021393704],"category_scores_gemma":[0.18565686,0.00059868506,0.0003589429,0.0022114622,0.0019350484,0.01115638,0.0037314084,0.001711515,0.00019581523],"study_design_candidate":"qualitative","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.00070885505,0.00056886795,0.11391478,0.0005828261,0.00016924723,0.0009558297,0.055181593,0.041908514,0.0042285444,0.32851443,0.0026117468,0.45065483],"study_design_scores_gemma":[0.00006127329,0.0005038622,0.047626134,0.0005423827,0.00012390276,0.0008238364,0.0472891,0.70963806,0.0063937954,0.17418952,0.012663205,0.00014499728],"about_ca_topic_score_codex":0.004950832,"about_ca_topic_score_gemma":0.0044633155,"teacher_disagreement_score":0.019934442,"about_ca_system_score_codex":0.0016158842,"about_ca_system_score_gemma":0.0013271088,"threshold_uncertainty_score":0.1054247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07347879,0.0012671108,0.91465116,0.0006704042,0.00022418838,0.00026730742,0.0007498281,0.005841559,0.0028497055],"genre_scores_gemma":[0.67597944,0.0005857301,0.31101373,0.0006273583,0.00013115503,0.00034344257,0.0025929806,0.00060620403,0.00811986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852604,0.0001996369,0.000090761045,0.00056755636,0.00045071365,0.00016543207],"domain_scores_gemma":[0.9969608,0.00088360783,0.00053759356,0.00044692055,0.0009923019,0.00017884656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763774,0.0014495468,0.0010160325,0.0029901708,0.0005214777,0.0013060773,0.002035892,0.0016379997,0.0016422208],"category_scores_gemma":[0.005140391,0.00038952995,0.0010540984,0.0017347406,0.0008456236,0.0023725778,0.0011508222,0.0017076285,0.00080163655],"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.0007398983,0.00038322067,0.021411724,0.00034538034,0.0002542953,0.0005070721,0.00018601041,0.18728723,0.022775704,0.0074581313,0.012783357,0.74586797],"study_design_scores_gemma":[0.00000823584,0.00004940048,0.0017469153,0.000013595592,0.000018972036,0.00007447181,0.000016628828,0.99093086,0.0037926747,0.0024100465,0.0009231228,0.000015116165],"about_ca_topic_score_codex":0.013350663,"about_ca_topic_score_gemma":0.017670806,"teacher_disagreement_score":0.013350663,"about_ca_system_score_codex":0.0015764274,"about_ca_system_score_gemma":0.0013135474,"threshold_uncertainty_score":0.026545942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016628321,0.00006107908,0.9656051,0.00056525535,0.00046292532,0.00013174072,0.00018842985,0.0089818295,0.0073752874],"genre_scores_gemma":[0.58207214,0.00017399433,0.39099452,0.0010764837,0.0002072316,0.00022230815,0.0004848845,0.0050447695,0.01972366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99588567,0.0008121273,0.00041640317,0.0007295785,0.0015506663,0.0006055719],"domain_scores_gemma":[0.982106,0.004504301,0.0014391394,0.007865093,0.0036191002,0.00046654025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034687747,0.0011184941,0.000958938,0.00075877487,0.0010152343,0.0027646008,0.0028926875,0.0022295022,0.015493593],"category_scores_gemma":[0.022155227,0.0010119848,0.0009412142,0.0007157254,0.002051664,0.008425685,0.0034931959,0.004858386,0.0044297613],"study_design_candidate":"not_applicable","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.0029849005,0.0005458107,0.0030972024,0.000958693,0.00009698018,0.0012718182,0.0011264111,0.02866471,0.09017766,0.4419166,0.016598321,0.4125609],"study_design_scores_gemma":[0.00052166067,0.00046246228,0.00084689795,0.00039383964,0.0002688113,0.00062741473,0.00029226064,0.22788352,0.44654602,0.24538116,0.07661396,0.00016202439],"about_ca_topic_score_codex":0.0010600353,"about_ca_topic_score_gemma":0.0013461001,"teacher_disagreement_score":0.015493593,"about_ca_system_score_codex":0.0010973315,"about_ca_system_score_gemma":0.0034996085,"threshold_uncertainty_score":0.051831245},"labels":[],"label_agreement":null}]}